134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2a68b90caSToby 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); 535a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 536a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 537a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->constraintSection);CHKERRQ(ierr); 538a68b90caSToby 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 } 122524c766afSToby Isaac { 122624c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 122724c766afSToby Isaac 122824c766afSToby Isaac c = mesh->maxConeSize; 122924c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 123024c766afSToby Isaac s = mesh->maxSupportSize; 123124c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 123224c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 123324c766afSToby Isaac } 1234bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1235bfbcdd7aSMatthew G. Knepley if (*points) { 1236bfbcdd7aSMatthew G. Knepley closure = *points; 1237bfbcdd7aSMatthew G. Knepley } else { 1238bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1239bfbcdd7aSMatthew G. Knepley } 1240bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1241552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1242552f7358SJed Brown const PetscInt cp = tmp[t]; 1243552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1244552f7358SJed Brown 1245552f7358SJed Brown closure[closureSize] = cp; 1246552f7358SJed Brown closure[closureSize+1] = co; 1247552f7358SJed Brown fifo[fifoSize] = cp; 1248552f7358SJed Brown fifo[fifoSize+1] = co; 1249552f7358SJed Brown } 1250bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1251552f7358SJed Brown while (fifoSize - fifoStart) { 1252552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1253552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1254552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1255552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1256552f7358SJed Brown 1257552f7358SJed Brown if (useCone) { 1258552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1259552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1260552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1261552f7358SJed Brown } else { 1262552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1263552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12640298fd71SBarry Smith tmpO = NULL; 1265552f7358SJed Brown } 1266552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1267552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1268552f7358SJed Brown const PetscInt cp = tmp[i]; 12692e1b13c2SMatthew 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. */ 12702e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12712e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12722e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1273552f7358SJed Brown PetscInt c; 1274552f7358SJed Brown 12752e1b13c2SMatthew G. Knepley if (rev) { 12762e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12772e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12782e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12792e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12802e1b13c2SMatthew G. Knepley } 1281552f7358SJed Brown /* Check for duplicate */ 1282552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1283552f7358SJed Brown if (closure[c] == cp) break; 1284552f7358SJed Brown } 1285552f7358SJed Brown if (c == closureSize) { 1286552f7358SJed Brown closure[closureSize] = cp; 1287552f7358SJed Brown closure[closureSize+1] = co; 1288552f7358SJed Brown fifo[fifoSize] = cp; 1289552f7358SJed Brown fifo[fifoSize+1] = co; 1290552f7358SJed Brown closureSize += 2; 1291552f7358SJed Brown fifoSize += 2; 1292552f7358SJed Brown } 1293552f7358SJed Brown } 1294552f7358SJed Brown fifoStart += 2; 1295552f7358SJed Brown } 1296552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1297552f7358SJed Brown if (points) *points = closure; 1298552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1299552f7358SJed Brown PetscFunctionReturn(0); 1300552f7358SJed Brown } 1301552f7358SJed Brown 1302552f7358SJed Brown #undef __FUNCT__ 13039bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13049bf0dad6SMatthew G. Knepley /*@C 13059bf0dad6SMatthew 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 13069bf0dad6SMatthew G. Knepley 13079bf0dad6SMatthew G. Knepley Not collective 13089bf0dad6SMatthew G. Knepley 13099bf0dad6SMatthew G. Knepley Input Parameters: 13109bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13119bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13129bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13139bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13149bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley Output Parameters: 13179bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13189bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13199bf0dad6SMatthew G. Knepley 13209bf0dad6SMatthew G. Knepley Note: 13219bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13229bf0dad6SMatthew G. Knepley 13239bf0dad6SMatthew G. Knepley Fortran Notes: 13249bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13259bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13269bf0dad6SMatthew G. Knepley 13279bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13289bf0dad6SMatthew G. Knepley 13299bf0dad6SMatthew G. Knepley Level: beginner 13309bf0dad6SMatthew G. Knepley 13319bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13329bf0dad6SMatthew G. Knepley @*/ 13339bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13349bf0dad6SMatthew G. Knepley { 13359bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13369bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13379bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13389bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13399bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13409bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13419bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13429bf0dad6SMatthew G. Knepley 13439bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13449bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13459bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13469bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13479bf0dad6SMatthew G. Knepley if (useCone) { 13489bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13499bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13509bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13519bf0dad6SMatthew G. Knepley } else { 13529bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13539bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13549bf0dad6SMatthew G. Knepley } 13559bf0dad6SMatthew G. Knepley if (depth == 1) { 13569bf0dad6SMatthew G. Knepley if (*points) { 13579bf0dad6SMatthew G. Knepley closure = *points; 13589bf0dad6SMatthew G. Knepley } else { 13599bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13609bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13619bf0dad6SMatthew G. Knepley } 13629bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13639bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13649bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13659bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13669bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13679bf0dad6SMatthew G. Knepley } 13689bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13699bf0dad6SMatthew G. Knepley if (points) *points = closure; 13709bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13719bf0dad6SMatthew G. Knepley } 137224c766afSToby Isaac { 137324c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 137424c766afSToby Isaac 137524c766afSToby Isaac c = mesh->maxConeSize; 137624c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 137724c766afSToby Isaac s = mesh->maxSupportSize; 137824c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 137924c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 138024c766afSToby Isaac } 13819bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13829bf0dad6SMatthew G. Knepley if (*points) { 13839bf0dad6SMatthew G. Knepley closure = *points; 13849bf0dad6SMatthew G. Knepley } else { 13859bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13869bf0dad6SMatthew G. Knepley } 13879bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13889bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13899bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13909bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13919bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13929bf0dad6SMatthew G. Knepley 13939bf0dad6SMatthew G. Knepley if (ornt < 0) { 13949bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13959bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13969bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13979bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13989bf0dad6SMatthew G. Knepley } 13999bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14009bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14019bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14029bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14039bf0dad6SMatthew G. Knepley } 14049bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14059bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14069bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14079bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14089bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14099bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14109bf0dad6SMatthew G. Knepley 14119bf0dad6SMatthew G. Knepley if (useCone) { 14129bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14139bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14149bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14159bf0dad6SMatthew G. Knepley } else { 14169bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14179bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14189bf0dad6SMatthew G. Knepley tmpO = NULL; 14199bf0dad6SMatthew G. Knepley } 14209bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14219bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14229bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14239bf0dad6SMatthew G. Knepley /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */ 14249bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14259bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14269bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14279bf0dad6SMatthew G. Knepley PetscInt c; 14289bf0dad6SMatthew G. Knepley 14299bf0dad6SMatthew G. Knepley if (rev) { 14309bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14319bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14329bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14339bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14349bf0dad6SMatthew G. Knepley } 14359bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14369bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14379bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14389bf0dad6SMatthew G. Knepley } 14399bf0dad6SMatthew G. Knepley if (c == closureSize) { 14409bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14419bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14429bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14439bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14449bf0dad6SMatthew G. Knepley closureSize += 2; 14459bf0dad6SMatthew G. Knepley fifoSize += 2; 14469bf0dad6SMatthew G. Knepley } 14479bf0dad6SMatthew G. Knepley } 14489bf0dad6SMatthew G. Knepley fifoStart += 2; 14499bf0dad6SMatthew G. Knepley } 14509bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14519bf0dad6SMatthew G. Knepley if (points) *points = closure; 14529bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14539bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14549bf0dad6SMatthew G. Knepley } 14559bf0dad6SMatthew G. Knepley 14569bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1457552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1458552f7358SJed Brown /*@C 1459552f7358SJed Brown DMPlexRestoreTransitiveClosure - Restore the array of points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1460552f7358SJed Brown 1461552f7358SJed Brown Not collective 1462552f7358SJed Brown 1463552f7358SJed Brown Input Parameters: 1464552f7358SJed Brown + mesh - The DMPlex 1465552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1466552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1467e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1468e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1469552f7358SJed Brown 1470552f7358SJed Brown Note: 14710298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1472552f7358SJed Brown 14733813dfbdSMatthew G Knepley Fortran Notes: 14743813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14753813dfbdSMatthew G Knepley include petsc.h90 in your code. 14763813dfbdSMatthew G Knepley 14773813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14783813dfbdSMatthew G Knepley 1479552f7358SJed Brown Level: beginner 1480552f7358SJed Brown 1481552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1482552f7358SJed Brown @*/ 1483552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1484552f7358SJed Brown { 1485552f7358SJed Brown PetscErrorCode ierr; 1486552f7358SJed Brown 1487552f7358SJed Brown PetscFunctionBegin; 1488552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1489e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1490e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1491552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14924ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1493552f7358SJed Brown PetscFunctionReturn(0); 1494552f7358SJed Brown } 1495552f7358SJed Brown 1496552f7358SJed Brown #undef __FUNCT__ 1497552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1498552f7358SJed Brown /*@ 1499552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1500552f7358SJed Brown 1501552f7358SJed Brown Not collective 1502552f7358SJed Brown 1503552f7358SJed Brown Input Parameter: 1504552f7358SJed Brown . mesh - The DMPlex 1505552f7358SJed Brown 1506552f7358SJed Brown Output Parameters: 1507552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1508552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1509552f7358SJed Brown 1510552f7358SJed Brown Level: beginner 1511552f7358SJed Brown 1512552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1513552f7358SJed Brown @*/ 1514552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1515552f7358SJed Brown { 1516552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1517552f7358SJed Brown 1518552f7358SJed Brown PetscFunctionBegin; 1519552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1520552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1521552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1522552f7358SJed Brown PetscFunctionReturn(0); 1523552f7358SJed Brown } 1524552f7358SJed Brown 1525552f7358SJed Brown #undef __FUNCT__ 1526552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1527552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1528552f7358SJed Brown { 1529552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1530552f7358SJed Brown PetscInt size; 1531552f7358SJed Brown PetscErrorCode ierr; 1532552f7358SJed Brown 1533552f7358SJed Brown PetscFunctionBegin; 1534552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1535552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1536552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15371795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15381795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1539552f7358SJed Brown if (mesh->maxSupportSize) { 1540552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1541552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15421795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1543552f7358SJed Brown } 1544552f7358SJed Brown PetscFunctionReturn(0); 1545552f7358SJed Brown } 1546552f7358SJed Brown 1547552f7358SJed Brown #undef __FUNCT__ 1548552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1549552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1550552f7358SJed Brown { 1551552f7358SJed Brown PetscErrorCode ierr; 1552552f7358SJed Brown 1553552f7358SJed Brown PetscFunctionBegin; 15544d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15554d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1556552f7358SJed Brown PetscFunctionReturn(0); 1557552f7358SJed Brown } 1558552f7358SJed Brown 1559552f7358SJed Brown #undef __FUNCT__ 1560552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1561552f7358SJed Brown /*@ 1562552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1563552f7358SJed Brown 1564552f7358SJed Brown Not collective 1565552f7358SJed Brown 1566552f7358SJed Brown Input Parameter: 1567552f7358SJed Brown . mesh - The DMPlex 1568552f7358SJed Brown 1569552f7358SJed Brown Output Parameter: 1570552f7358SJed Brown 1571552f7358SJed Brown Note: 1572552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1573552f7358SJed Brown 1574552f7358SJed Brown Level: beginner 1575552f7358SJed Brown 1576552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1577552f7358SJed Brown @*/ 1578552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1579552f7358SJed Brown { 1580552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1581552f7358SJed Brown PetscInt *offsets; 1582552f7358SJed Brown PetscInt supportSize; 1583552f7358SJed Brown PetscInt pStart, pEnd, p; 1584552f7358SJed Brown PetscErrorCode ierr; 1585552f7358SJed Brown 1586552f7358SJed Brown PetscFunctionBegin; 1587552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 158882f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1589552f7358SJed Brown /* Calculate support sizes */ 1590552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1591552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1592552f7358SJed Brown PetscInt dof, off, c; 1593552f7358SJed Brown 1594552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1595552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1596552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1597552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1598552f7358SJed Brown } 1599552f7358SJed Brown } 1600552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1601552f7358SJed Brown PetscInt dof; 1602552f7358SJed Brown 1603552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16040d644c17SKarl Rupp 1605552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1606552f7358SJed Brown } 1607552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1608552f7358SJed Brown /* Calculate supports */ 1609552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16101795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16111795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1612552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1613552f7358SJed Brown PetscInt dof, off, c; 1614552f7358SJed Brown 1615552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1616552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1617552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1618552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1619552f7358SJed Brown PetscInt offS; 1620552f7358SJed Brown 1621552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16220d644c17SKarl Rupp 1623552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1624552f7358SJed Brown ++offsets[q]; 1625552f7358SJed Brown } 1626552f7358SJed Brown } 1627552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1628552f7358SJed Brown PetscFunctionReturn(0); 1629552f7358SJed Brown } 1630552f7358SJed Brown 1631552f7358SJed Brown #undef __FUNCT__ 1632552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1633552f7358SJed Brown /*@ 1634552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1635552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1636552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1637552f7358SJed Brown the DAG. 1638552f7358SJed Brown 1639552f7358SJed Brown Not collective 1640552f7358SJed Brown 1641552f7358SJed Brown Input Parameter: 1642552f7358SJed Brown . mesh - The DMPlex 1643552f7358SJed Brown 1644552f7358SJed Brown Output Parameter: 1645552f7358SJed Brown 1646552f7358SJed Brown Notes: 1647150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1648150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1649150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1650150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1651552f7358SJed Brown 1652150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1653552f7358SJed Brown 1654552f7358SJed Brown Level: beginner 1655552f7358SJed Brown 1656552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1657552f7358SJed Brown @*/ 1658552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1659552f7358SJed Brown { 1660aa50250dSMatthew G. Knepley DMLabel label; 1661552f7358SJed Brown PetscInt pStart, pEnd, p; 1662552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1663552f7358SJed Brown PetscErrorCode ierr; 1664552f7358SJed Brown 1665552f7358SJed Brown PetscFunctionBegin; 1666552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1667552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1668552f7358SJed Brown /* Calculate depth */ 1669aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1670aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1671aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1672552f7358SJed Brown /* Initialize roots and count leaves */ 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 (!coneSize && supportSize) { 1679552f7358SJed Brown ++numRoots; 1680aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1681552f7358SJed Brown } else if (!supportSize && coneSize) { 1682552f7358SJed Brown ++numLeaves; 1683552f7358SJed Brown } else if (!supportSize && !coneSize) { 1684552f7358SJed Brown /* Isolated points */ 1685aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1686552f7358SJed Brown } 1687552f7358SJed Brown } 1688552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1689552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1690552f7358SJed Brown PetscInt coneSize, supportSize; 1691552f7358SJed Brown 1692552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1693552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1694552f7358SJed Brown if (!supportSize && coneSize) { 1695aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1696552f7358SJed Brown } 1697552f7358SJed Brown } 1698552f7358SJed Brown } else { 169974ef644bSMatthew G. Knepley IS pointIS; 170074ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1701552f7358SJed Brown 170274ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170374ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170474ef644bSMatthew G. Knepley while (numPoints) { 170574ef644bSMatthew G. Knepley const PetscInt *points; 170674ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 170774ef644bSMatthew G. Knepley 170874ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 170974ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 171074ef644bSMatthew G. Knepley const PetscInt point = points[p]; 171174ef644bSMatthew G. Knepley const PetscInt *support; 171274ef644bSMatthew G. Knepley PetscInt supportSize, s; 171374ef644bSMatthew G. Knepley 171474ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 171574ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 171674ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 171774ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1718552f7358SJed Brown } 1719552f7358SJed Brown } 17205edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 172174ef644bSMatthew G. Knepley ++level; 172274ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172374ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 172474ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 172574ef644bSMatthew G. Knepley else {numPoints = 0;} 172674ef644bSMatthew G. Knepley } 172774ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172874ef644bSMatthew G. Knepley } 1729552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1730552f7358SJed Brown PetscFunctionReturn(0); 1731552f7358SJed Brown } 1732552f7358SJed Brown 1733552f7358SJed Brown #undef __FUNCT__ 1734552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1735552f7358SJed Brown /*@C 1736552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1737552f7358SJed Brown 1738552f7358SJed Brown Not Collective 1739552f7358SJed Brown 1740552f7358SJed Brown Input Parameters: 1741552f7358SJed Brown + dm - The DMPlex object 1742552f7358SJed Brown . numPoints - The number of input points for the join 1743552f7358SJed Brown - points - The input points 1744552f7358SJed Brown 1745552f7358SJed Brown Output Parameters: 1746552f7358SJed Brown + numCoveredPoints - The number of points in the join 1747552f7358SJed Brown - coveredPoints - The points in the join 1748552f7358SJed Brown 1749552f7358SJed Brown Level: intermediate 1750552f7358SJed Brown 1751552f7358SJed Brown Note: Currently, this is restricted to a single level join 1752552f7358SJed Brown 17533813dfbdSMatthew G Knepley Fortran Notes: 17543813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17553813dfbdSMatthew G Knepley include petsc.h90 in your code. 17563813dfbdSMatthew G Knepley 17573813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17583813dfbdSMatthew G Knepley 1759552f7358SJed Brown .keywords: mesh 1760552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1761552f7358SJed Brown @*/ 1762552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1763552f7358SJed Brown { 1764552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1765552f7358SJed Brown PetscInt *join[2]; 1766552f7358SJed Brown PetscInt joinSize, i = 0; 1767552f7358SJed Brown PetscInt dof, off, p, c, m; 1768552f7358SJed Brown PetscErrorCode ierr; 1769552f7358SJed Brown 1770552f7358SJed Brown PetscFunctionBegin; 1771552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1772552f7358SJed Brown PetscValidPointer(points, 2); 1773552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1774552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1775552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1776552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1777552f7358SJed Brown /* Copy in support of first point */ 1778552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1779552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1780552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1781552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1782552f7358SJed Brown } 1783552f7358SJed Brown /* Check each successive support */ 1784552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1785552f7358SJed Brown PetscInt newJoinSize = 0; 1786552f7358SJed Brown 1787552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1788552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1789552f7358SJed Brown for (c = 0; c < dof; ++c) { 1790552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1791552f7358SJed Brown 1792552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1793552f7358SJed Brown if (point == join[i][m]) { 1794552f7358SJed Brown join[1-i][newJoinSize++] = point; 1795552f7358SJed Brown break; 1796552f7358SJed Brown } 1797552f7358SJed Brown } 1798552f7358SJed Brown } 1799552f7358SJed Brown joinSize = newJoinSize; 1800552f7358SJed Brown i = 1-i; 1801552f7358SJed Brown } 1802552f7358SJed Brown *numCoveredPoints = joinSize; 1803552f7358SJed Brown *coveredPoints = join[i]; 1804552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1805552f7358SJed Brown PetscFunctionReturn(0); 1806552f7358SJed Brown } 1807552f7358SJed Brown 1808552f7358SJed Brown #undef __FUNCT__ 1809552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1810552f7358SJed Brown /*@C 1811552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1812552f7358SJed Brown 1813552f7358SJed Brown Not Collective 1814552f7358SJed Brown 1815552f7358SJed Brown Input Parameters: 1816552f7358SJed Brown + dm - The DMPlex object 1817552f7358SJed Brown . numPoints - The number of input points for the join 1818552f7358SJed Brown - points - The input points 1819552f7358SJed Brown 1820552f7358SJed Brown Output Parameters: 1821552f7358SJed Brown + numCoveredPoints - The number of points in the join 1822552f7358SJed Brown - coveredPoints - The points in the join 1823552f7358SJed Brown 18243813dfbdSMatthew G Knepley Fortran Notes: 18253813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18263813dfbdSMatthew G Knepley include petsc.h90 in your code. 18273813dfbdSMatthew G Knepley 18283813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18293813dfbdSMatthew G Knepley 1830552f7358SJed Brown Level: intermediate 1831552f7358SJed Brown 1832552f7358SJed Brown .keywords: mesh 1833552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1834552f7358SJed Brown @*/ 1835552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1836552f7358SJed Brown { 1837552f7358SJed Brown PetscErrorCode ierr; 1838552f7358SJed Brown 1839552f7358SJed Brown PetscFunctionBegin; 1840552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1841d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1842d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1843d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1844552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1845d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1846552f7358SJed Brown PetscFunctionReturn(0); 1847552f7358SJed Brown } 1848552f7358SJed Brown 1849552f7358SJed Brown #undef __FUNCT__ 1850552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1851552f7358SJed Brown /*@C 1852552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1853552f7358SJed Brown 1854552f7358SJed Brown Not Collective 1855552f7358SJed Brown 1856552f7358SJed Brown Input Parameters: 1857552f7358SJed Brown + dm - The DMPlex object 1858552f7358SJed Brown . numPoints - The number of input points for the join 1859552f7358SJed Brown - points - The input points 1860552f7358SJed Brown 1861552f7358SJed Brown Output Parameters: 1862552f7358SJed Brown + numCoveredPoints - The number of points in the join 1863552f7358SJed Brown - coveredPoints - The points in the join 1864552f7358SJed Brown 18653813dfbdSMatthew G Knepley Fortran Notes: 18663813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18673813dfbdSMatthew G Knepley include petsc.h90 in your code. 18683813dfbdSMatthew G Knepley 18693813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18703813dfbdSMatthew G Knepley 1871552f7358SJed Brown Level: intermediate 1872552f7358SJed Brown 1873552f7358SJed Brown .keywords: mesh 1874552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1875552f7358SJed Brown @*/ 1876552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1877552f7358SJed Brown { 1878552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1879552f7358SJed Brown PetscInt *offsets, **closures; 1880552f7358SJed Brown PetscInt *join[2]; 1881552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 188224c766afSToby Isaac PetscInt p, d, c, m, ms; 1883552f7358SJed Brown PetscErrorCode ierr; 1884552f7358SJed Brown 1885552f7358SJed Brown PetscFunctionBegin; 1886552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1887552f7358SJed Brown PetscValidPointer(points, 2); 1888552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1889552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1890552f7358SJed Brown 1891552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18921795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1893552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 189424c766afSToby Isaac ms = mesh->maxSupportSize; 189524c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 1896552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1897552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1898552f7358SJed Brown 1899552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1900552f7358SJed Brown PetscInt closureSize; 1901552f7358SJed Brown 1902552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19030d644c17SKarl Rupp 1904552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1905552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1906552f7358SJed Brown PetscInt pStart, pEnd, i; 1907552f7358SJed Brown 1908552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1909552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1910552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1911552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1912552f7358SJed Brown break; 1913552f7358SJed Brown } 1914552f7358SJed Brown } 1915552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1916552f7358SJed Brown } 191782f516ccSBarry 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); 1918552f7358SJed Brown } 1919552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1920552f7358SJed Brown PetscInt dof; 1921552f7358SJed Brown 1922552f7358SJed Brown /* Copy in support of first point */ 1923552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1924552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1925552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1926552f7358SJed Brown } 1927552f7358SJed Brown /* Check each successive cone */ 1928552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1929552f7358SJed Brown PetscInt newJoinSize = 0; 1930552f7358SJed Brown 1931552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1932552f7358SJed Brown for (c = 0; c < dof; ++c) { 1933552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1934552f7358SJed Brown 1935552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1936552f7358SJed Brown if (point == join[i][m]) { 1937552f7358SJed Brown join[1-i][newJoinSize++] = point; 1938552f7358SJed Brown break; 1939552f7358SJed Brown } 1940552f7358SJed Brown } 1941552f7358SJed Brown } 1942552f7358SJed Brown joinSize = newJoinSize; 1943552f7358SJed Brown i = 1-i; 1944552f7358SJed Brown } 1945552f7358SJed Brown if (joinSize) break; 1946552f7358SJed Brown } 1947552f7358SJed Brown *numCoveredPoints = joinSize; 1948552f7358SJed Brown *coveredPoints = join[i]; 1949552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19500298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1951552f7358SJed Brown } 1952552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1953552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1954552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1955552f7358SJed Brown PetscFunctionReturn(0); 1956552f7358SJed Brown } 1957552f7358SJed Brown 1958552f7358SJed Brown #undef __FUNCT__ 1959552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1960552f7358SJed Brown /*@C 1961552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1962552f7358SJed Brown 1963552f7358SJed Brown Not Collective 1964552f7358SJed Brown 1965552f7358SJed Brown Input Parameters: 1966552f7358SJed Brown + dm - The DMPlex object 1967552f7358SJed Brown . numPoints - The number of input points for the meet 1968552f7358SJed Brown - points - The input points 1969552f7358SJed Brown 1970552f7358SJed Brown Output Parameters: 1971552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1972552f7358SJed Brown - coveredPoints - The points in the meet 1973552f7358SJed Brown 1974552f7358SJed Brown Level: intermediate 1975552f7358SJed Brown 1976552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1977552f7358SJed Brown 19783813dfbdSMatthew G Knepley Fortran Notes: 19793813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19803813dfbdSMatthew G Knepley include petsc.h90 in your code. 19813813dfbdSMatthew G Knepley 19823813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19833813dfbdSMatthew G Knepley 1984552f7358SJed Brown .keywords: mesh 1985552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1986552f7358SJed Brown @*/ 1987552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1988552f7358SJed Brown { 1989552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1990552f7358SJed Brown PetscInt *meet[2]; 1991552f7358SJed Brown PetscInt meetSize, i = 0; 1992552f7358SJed Brown PetscInt dof, off, p, c, m; 1993552f7358SJed Brown PetscErrorCode ierr; 1994552f7358SJed Brown 1995552f7358SJed Brown PetscFunctionBegin; 1996552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1997552f7358SJed Brown PetscValidPointer(points, 2); 1998552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1999552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2000552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2001552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2002552f7358SJed Brown /* Copy in cone of first point */ 2003552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2004552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2005552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2006552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2007552f7358SJed Brown } 2008552f7358SJed Brown /* Check each successive cone */ 2009552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2010552f7358SJed Brown PetscInt newMeetSize = 0; 2011552f7358SJed Brown 2012552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2013552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2014552f7358SJed Brown for (c = 0; c < dof; ++c) { 2015552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2016552f7358SJed Brown 2017552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2018552f7358SJed Brown if (point == meet[i][m]) { 2019552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2020552f7358SJed Brown break; 2021552f7358SJed Brown } 2022552f7358SJed Brown } 2023552f7358SJed Brown } 2024552f7358SJed Brown meetSize = newMeetSize; 2025552f7358SJed Brown i = 1-i; 2026552f7358SJed Brown } 2027552f7358SJed Brown *numCoveringPoints = meetSize; 2028552f7358SJed Brown *coveringPoints = meet[i]; 2029552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2030552f7358SJed Brown PetscFunctionReturn(0); 2031552f7358SJed Brown } 2032552f7358SJed Brown 2033552f7358SJed Brown #undef __FUNCT__ 2034552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2035552f7358SJed Brown /*@C 2036552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2037552f7358SJed Brown 2038552f7358SJed Brown Not Collective 2039552f7358SJed Brown 2040552f7358SJed Brown Input Parameters: 2041552f7358SJed Brown + dm - The DMPlex object 2042552f7358SJed Brown . numPoints - The number of input points for the meet 2043552f7358SJed Brown - points - The input points 2044552f7358SJed Brown 2045552f7358SJed Brown Output Parameters: 2046552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2047552f7358SJed Brown - coveredPoints - The points in the meet 2048552f7358SJed Brown 2049552f7358SJed Brown Level: intermediate 2050552f7358SJed Brown 20513813dfbdSMatthew G Knepley Fortran Notes: 20523813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20533813dfbdSMatthew G Knepley include petsc.h90 in your code. 20543813dfbdSMatthew G Knepley 20553813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20563813dfbdSMatthew G Knepley 2057552f7358SJed Brown .keywords: mesh 2058552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2059552f7358SJed Brown @*/ 2060552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2061552f7358SJed Brown { 2062552f7358SJed Brown PetscErrorCode ierr; 2063552f7358SJed Brown 2064552f7358SJed Brown PetscFunctionBegin; 2065552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2066d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2067d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2068d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2069552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2070d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2071552f7358SJed Brown PetscFunctionReturn(0); 2072552f7358SJed Brown } 2073552f7358SJed Brown 2074552f7358SJed Brown #undef __FUNCT__ 2075552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2076552f7358SJed Brown /*@C 2077552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2078552f7358SJed Brown 2079552f7358SJed Brown Not Collective 2080552f7358SJed Brown 2081552f7358SJed Brown Input Parameters: 2082552f7358SJed Brown + dm - The DMPlex object 2083552f7358SJed Brown . numPoints - The number of input points for the meet 2084552f7358SJed Brown - points - The input points 2085552f7358SJed Brown 2086552f7358SJed Brown Output Parameters: 2087552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2088552f7358SJed Brown - coveredPoints - The points in the meet 2089552f7358SJed Brown 2090552f7358SJed Brown Level: intermediate 2091552f7358SJed Brown 20923813dfbdSMatthew G Knepley Fortran Notes: 20933813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20943813dfbdSMatthew G Knepley include petsc.h90 in your code. 20953813dfbdSMatthew G Knepley 20963813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20973813dfbdSMatthew G Knepley 2098552f7358SJed Brown .keywords: mesh 2099552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2100552f7358SJed Brown @*/ 2101552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2102552f7358SJed Brown { 2103552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2104552f7358SJed Brown PetscInt *offsets, **closures; 2105552f7358SJed Brown PetscInt *meet[2]; 2106552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 210724c766afSToby Isaac PetscInt p, h, c, m, mc; 2108552f7358SJed Brown PetscErrorCode ierr; 2109552f7358SJed Brown 2110552f7358SJed Brown PetscFunctionBegin; 2111552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2112552f7358SJed Brown PetscValidPointer(points, 2); 2113552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2114552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2115552f7358SJed Brown 2116552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2117785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2118552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 211924c766afSToby Isaac mc = mesh->maxConeSize; 212024c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2121552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2122552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2123552f7358SJed Brown 2124552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2125552f7358SJed Brown PetscInt closureSize; 2126552f7358SJed Brown 2127552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21280d644c17SKarl Rupp 2129552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2130552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2131552f7358SJed Brown PetscInt pStart, pEnd, i; 2132552f7358SJed Brown 2133552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2134552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2135552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2136552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2137552f7358SJed Brown break; 2138552f7358SJed Brown } 2139552f7358SJed Brown } 2140552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2141552f7358SJed Brown } 214282f516ccSBarry 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); 2143552f7358SJed Brown } 2144552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2145552f7358SJed Brown PetscInt dof; 2146552f7358SJed Brown 2147552f7358SJed Brown /* Copy in cone of first point */ 2148552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2149552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2150552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2151552f7358SJed Brown } 2152552f7358SJed Brown /* Check each successive cone */ 2153552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2154552f7358SJed Brown PetscInt newMeetSize = 0; 2155552f7358SJed Brown 2156552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2157552f7358SJed Brown for (c = 0; c < dof; ++c) { 2158552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2159552f7358SJed Brown 2160552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2161552f7358SJed Brown if (point == meet[i][m]) { 2162552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2163552f7358SJed Brown break; 2164552f7358SJed Brown } 2165552f7358SJed Brown } 2166552f7358SJed Brown } 2167552f7358SJed Brown meetSize = newMeetSize; 2168552f7358SJed Brown i = 1-i; 2169552f7358SJed Brown } 2170552f7358SJed Brown if (meetSize) break; 2171552f7358SJed Brown } 2172552f7358SJed Brown *numCoveredPoints = meetSize; 2173552f7358SJed Brown *coveredPoints = meet[i]; 2174552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21750298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2176552f7358SJed Brown } 2177552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2178552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2179552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2180552f7358SJed Brown PetscFunctionReturn(0); 2181552f7358SJed Brown } 2182552f7358SJed Brown 2183552f7358SJed Brown #undef __FUNCT__ 21844e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21854e3744c5SMatthew G. Knepley /*@C 21864e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21874e3744c5SMatthew G. Knepley 21884e3744c5SMatthew G. Knepley Not Collective 21894e3744c5SMatthew G. Knepley 21904e3744c5SMatthew G. Knepley Input Parameters: 21914e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21924e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21934e3744c5SMatthew G. Knepley 21944e3744c5SMatthew G. Knepley Output Parameters: 21954e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21964e3744c5SMatthew G. Knepley 21974e3744c5SMatthew G. Knepley Level: intermediate 21984e3744c5SMatthew G. Knepley 21994e3744c5SMatthew G. Knepley Notes: 22004e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 22014e3744c5SMatthew G. Knepley 22024e3744c5SMatthew G. Knepley .keywords: mesh 22034e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22044e3744c5SMatthew G. Knepley @*/ 22054e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22064e3744c5SMatthew G. Knepley { 22074e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22084e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22094e3744c5SMatthew G. Knepley 22104e3744c5SMatthew G. Knepley PetscFunctionBegin; 22114e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22124e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22134e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22144e3744c5SMatthew G. Knepley 22154e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22164e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22174e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22184e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22194e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22204e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22214e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22224e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22234e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22244e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22254e3744c5SMatthew G. Knepley 22264e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22274e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22284e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22294e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22304e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22314e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22324e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22334e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22344e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22354e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22364e3744c5SMatthew G. Knepley } 22374e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22384e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22394e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22404e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22414e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22424e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22434e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22444e3744c5SMatthew G. Knepley } 22454e3744c5SMatthew G. Knepley } 22464e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22474e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22484e3744c5SMatthew G. Knepley } 22494e3744c5SMatthew G. Knepley 22504e3744c5SMatthew G. Knepley #undef __FUNCT__ 225118ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 225218ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2253a6dfd86eSKarl Rupp { 225482f516ccSBarry Smith MPI_Comm comm; 2255552f7358SJed Brown PetscErrorCode ierr; 2256552f7358SJed Brown 2257552f7358SJed Brown PetscFunctionBegin; 225882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2259552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2260552f7358SJed Brown switch (cellDim) { 2261552f7358SJed Brown case 0: 2262552f7358SJed Brown *numFaceVertices = 0; 2263552f7358SJed Brown break; 2264552f7358SJed Brown case 1: 2265552f7358SJed Brown *numFaceVertices = 1; 2266552f7358SJed Brown break; 2267552f7358SJed Brown case 2: 2268552f7358SJed Brown switch (numCorners) { 226919436ca2SJed Brown case 3: /* triangle */ 227019436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2271552f7358SJed Brown break; 227219436ca2SJed Brown case 4: /* quadrilateral */ 227319436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2274552f7358SJed Brown break; 227519436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 227619436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2277552f7358SJed Brown break; 227819436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 227919436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2280552f7358SJed Brown break; 2281552f7358SJed Brown default: 2282552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2283552f7358SJed Brown } 2284552f7358SJed Brown break; 2285552f7358SJed Brown case 3: 2286552f7358SJed Brown switch (numCorners) { 228719436ca2SJed Brown case 4: /* tetradehdron */ 228819436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2289552f7358SJed Brown break; 229019436ca2SJed Brown case 6: /* tet cohesive cells */ 229119436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2292552f7358SJed Brown break; 229319436ca2SJed Brown case 8: /* hexahedron */ 229419436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2295552f7358SJed Brown break; 229619436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 229719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2298552f7358SJed Brown break; 229919436ca2SJed Brown case 10: /* quadratic tetrahedron */ 230019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2301552f7358SJed Brown break; 230219436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 230319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2304552f7358SJed Brown break; 230519436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 230619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2307552f7358SJed Brown break; 230819436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 230919436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2310552f7358SJed Brown break; 2311552f7358SJed Brown default: 2312552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2313552f7358SJed Brown } 2314552f7358SJed Brown break; 2315552f7358SJed Brown default: 2316552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2317552f7358SJed Brown } 2318552f7358SJed Brown PetscFunctionReturn(0); 2319552f7358SJed Brown } 2320552f7358SJed Brown 2321552f7358SJed Brown #undef __FUNCT__ 2322d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2323d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2324d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2325d27a0f52SMatthew G. Knepley { 2326a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2327a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2328a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2329d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2330d27a0f52SMatthew G. Knepley 2331d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2332d27a0f52SMatthew G. Knepley /* Truth Table 2333d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2334d27a0f52SMatthew G. Knepley F 0 flips no F F F 2335d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2336d27a0f52SMatthew G. Knepley F 2 flips no T F T 2337d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2338d27a0f52SMatthew G. Knepley T 1 flip no 2339d27a0f52SMatthew G. Knepley T 2 flips yes 2340d27a0f52SMatthew G. Knepley */ 2341c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2342d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2343a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2344d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2346a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2347a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2348a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2349a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2350a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2351785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2352a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2353a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2354defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2355a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2356a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2357a1b4d4a2SMatthew G. Knepley 2358a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2359a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2360a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2361a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2362a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2363a1b4d4a2SMatthew G. Knepley } 2364a1b4d4a2SMatthew G. Knepley } 2365a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2366a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2367d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2368a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2369d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2370d27a0f52SMatthew G. Knepley 2371a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2372a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2373a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2374d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2375d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2376a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 237786cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2378a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 237986cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2380d27a0f52SMatthew G. Knepley 2381d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2382d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2383d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2384d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2385d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2386d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2387a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2388a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2389a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2390a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2391a1b4d4a2SMatthew G. Knepley } 2392a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2393a1b4d4a2SMatthew 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); 2394a1b4d4a2SMatthew G. Knepley } 2395a1b4d4a2SMatthew 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]); 2396a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2397a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2398a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2399a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2400a1b4d4a2SMatthew G. Knepley } 2401a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2402a1b4d4a2SMatthew 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); 2403a1b4d4a2SMatthew G. Knepley } 2404a1b4d4a2SMatthew 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]); 2405d27a0f52SMatthew G. Knepley 2406d27a0f52SMatthew G. Knepley if (dim == 1) { 2407d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2408d27a0f52SMatthew G. Knepley } else { 2409d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2410d27a0f52SMatthew G. Knepley } 2411d27a0f52SMatthew G. Knepley 2412d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2413d27a0f52SMatthew 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]); 2414d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2415a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2416d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2417a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2418d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 241986cff514SMatthew 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"); 2420a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2421a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2422d27a0f52SMatthew G. Knepley } 2423fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2424fedde076SMatthew G. Knepley { 2425fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2426fedde076SMatthew G. Knepley PetscSF sf; 2427fedde076SMatthew G. Knepley const PetscInt *lpoints; 2428fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 242913048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2430fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2431a1b4d4a2SMatthew G. Knepley 2432fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2433fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2434fedde076SMatthew G. Knepley if (numLeaves >= 0) { 243562ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 243662ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 243762ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 243813048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 243962ad4a6aSMatthew G. Knepley 2440fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2441fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2442fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2443fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2444fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2445fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2446fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2447fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2448fedde076SMatthew G. Knepley PetscInt supportSize; 2449fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2450fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2451fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2452fedde076SMatthew G. Knepley } 2453fedde076SMatthew G. Knepley } 2454fedde076SMatthew G. Knepley } 245513048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2456fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2457fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2458fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2459fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2460fedde076SMatthew G. Knepley 2461fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 246262ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2463fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2464fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24655b7033fcSMatthew G. Knepley if (dim == 1) { 24665b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24675b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24685b7033fcSMatthew G. Knepley } else { 2469fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2470fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2471fedde076SMatthew G. Knepley } 24725b7033fcSMatthew G. Knepley } 2473fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2474fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2475fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2476fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2477fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2478fedde076SMatthew G. Knepley 247913048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 248013048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 248113048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2482fedde076SMatthew G. Knepley } 248313048561SMatthew G. Knepley /* Collect the graph on 0 */ 248413048561SMatthew G. Knepley { 248513048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2486e8f90184SMatthew G. Knepley Mat G; 248713048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 248813048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 248913048561SMatthew G. Knepley PetscInt *adj = NULL; 249013048561SMatthew G. Knepley PetscBool *val = NULL; 249113048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 249213048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 249313048561SMatthew G. Knepley PetscInt debug = 0; 249413048561SMatthew G. Knepley 249513048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 249613048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 249713048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 249813048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 249913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250013048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 250113048561SMatthew G. Knepley } 250213048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 250313048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 250413048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 250513048561SMatthew G. Knepley if (debug) { 250613048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250713048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 250813048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 250913048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 251013048561SMatthew G. Knepley } 251113048561SMatthew G. Knepley } 251213048561SMatthew G. Knepley } 2513e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2514e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2515e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2516e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2517e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2518e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 25199a4fe19dSMatthew G. Knepley const PetscInt r = p; 2520e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 25217406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2522e8f90184SMatthew G. Knepley 25237406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 25247406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2525e8f90184SMatthew G. Knepley } 2526e8f90184SMatthew G. Knepley } 2527e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2528e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2529e8f90184SMatthew G. Knepley 253013048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 253113048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 253213048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 253313048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 253413048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 253513048561SMatthew G. Knepley pTop = pBottom = 0; 253613048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 253713048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 253813048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 253913048561SMatthew G. Knepley procFIFO[pBottom++] = p; 254013048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 254113048561SMatthew G. Knepley /* Consider each proc in FIFO */ 254213048561SMatthew G. Knepley while (pTop < pBottom) { 2543e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2544e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2545e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 254613048561SMatthew G. Knepley 254713048561SMatthew G. Knepley proc = procFIFO[pTop++]; 254813048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2549e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 255013048561SMatthew G. Knepley /* Loop over neighboring procs */ 2551e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2552e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25537406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 255413048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 255513048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 255613048561SMatthew G. Knepley 255713048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 255813048561SMatthew 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); 255913048561SMatthew G. Knepley if (!flippedB) { 256013048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 256113048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 256213048561SMatthew 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"); 256313048561SMatthew G. Knepley if (!seen) { 256413048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 256513048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 256613048561SMatthew G. Knepley } 256713048561SMatthew G. Knepley } 256813048561SMatthew G. Knepley } 256913048561SMatthew G. Knepley } 257013048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2571e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 257213048561SMatthew G. Knepley 257313048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 257413048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 257513048561SMatthew G. Knepley { 257613048561SMatthew G. Knepley PetscBool *flips; 257713048561SMatthew G. Knepley 257813048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 257913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 258013048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 258113048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 258213048561SMatthew G. Knepley } 258313048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 258413048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 258513048561SMatthew G. Knepley } 258613048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 258713048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 258813048561SMatthew G. Knepley } 258913048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2590fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 259113048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2592fedde076SMatthew G. Knepley } 2593fedde076SMatthew G. Knepley } 2594fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2595d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2596d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2597d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2598a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2599f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2600f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2601d27a0f52SMatthew G. Knepley 2602a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2603a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2604a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2605a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2606a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2607a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2608a1b4d4a2SMatthew G. Knepley 2609a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2610a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2611a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2612d27a0f52SMatthew G. Knepley } 2613a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2614a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2615f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2616f4e909fcSMatthew G. Knepley faceSize = coneSize; 2617f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2618f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2619f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2620f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2621f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2622f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2623f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2624f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2625f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2626f4e909fcSMatthew G. Knepley } 2627f4e909fcSMatthew G. Knepley } 2628d27a0f52SMatthew G. Knepley } 2629d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2630d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2631d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2632a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2633a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2634a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2635d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2636d27a0f52SMatthew G. Knepley } 2637d27a0f52SMatthew G. Knepley 2638d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2639895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2640895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2641895b8c46SMatthew G. Knepley { 2642895b8c46SMatthew G. Knepley int tmpc; 2643895b8c46SMatthew G. Knepley 2644895b8c46SMatthew G. Knepley PetscFunctionBegin; 2645895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2646895b8c46SMatthew G. Knepley switch (numCorners) { 2647895b8c46SMatthew G. Knepley case 4: 2648895b8c46SMatthew G. Knepley tmpc = cone[0]; 2649895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2650895b8c46SMatthew G. Knepley cone[1] = tmpc; 2651895b8c46SMatthew G. Knepley break; 2652895b8c46SMatthew G. Knepley case 8: 2653895b8c46SMatthew G. Knepley tmpc = cone[1]; 2654895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2655895b8c46SMatthew G. Knepley cone[3] = tmpc; 2656895b8c46SMatthew G. Knepley break; 2657895b8c46SMatthew G. Knepley default: break; 2658895b8c46SMatthew G. Knepley } 2659895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2660895b8c46SMatthew G. Knepley } 2661895b8c46SMatthew G. Knepley 2662895b8c46SMatthew G. Knepley #undef __FUNCT__ 26639db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26649db3b87dSMatthew G. Knepley /*@C 26659db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26669db3b87dSMatthew G. Knepley 26679db3b87dSMatthew G. Knepley Input Parameters: 26689db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26699db3b87dSMatthew G. Knepley - cone - The incoming cone 26709db3b87dSMatthew G. Knepley 26719db3b87dSMatthew G. Knepley Output Parameter: 26729db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26739db3b87dSMatthew G. Knepley 26749db3b87dSMatthew G. Knepley Level: developer 26759db3b87dSMatthew G. Knepley 26769db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26779db3b87dSMatthew G. Knepley @*/ 26789db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26792e1b13c2SMatthew G. Knepley { 26809db3b87dSMatthew G. Knepley int tmpc; 26812e1b13c2SMatthew G. Knepley 26822e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26839db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26849db3b87dSMatthew G. Knepley switch (numCorners) { 26859db3b87dSMatthew G. Knepley case 4: 26861885f254SMatthew G. Knepley tmpc = cone[0]; 26871885f254SMatthew G. Knepley cone[0] = cone[1]; 26881885f254SMatthew G. Knepley cone[1] = tmpc; 26899db3b87dSMatthew G. Knepley break; 26909db3b87dSMatthew G. Knepley case 8: 26919db3b87dSMatthew G. Knepley tmpc = cone[1]; 26929db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26939db3b87dSMatthew G. Knepley cone[3] = tmpc; 26949db3b87dSMatthew G. Knepley break; 26959db3b87dSMatthew G. Knepley default: break; 26969db3b87dSMatthew G. Knepley } 26979db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26989db3b87dSMatthew G. Knepley } 26999db3b87dSMatthew G. Knepley 27009db3b87dSMatthew G. Knepley #undef __FUNCT__ 27019db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 27029db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 27039db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 27049db3b87dSMatthew G. Knepley { 27059db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 27069db3b87dSMatthew G. Knepley PetscErrorCode ierr; 27079db3b87dSMatthew G. Knepley 27089db3b87dSMatthew G. Knepley PetscFunctionBegin; 27099db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 27109db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 27112e1b13c2SMatthew G. Knepley } 27122e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 27132e1b13c2SMatthew G. Knepley } 27142e1b13c2SMatthew G. Knepley 2715519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2716552f7358SJed Brown #include <triangle.h> 2717552f7358SJed Brown 2718552f7358SJed Brown #undef __FUNCT__ 2719552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 27200adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 27210adebc6cSBarry Smith { 2722552f7358SJed Brown PetscFunctionBegin; 2723552f7358SJed Brown inputCtx->numberofpoints = 0; 2724552f7358SJed Brown inputCtx->numberofpointattributes = 0; 27250298fd71SBarry Smith inputCtx->pointlist = NULL; 27260298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27270298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2728552f7358SJed Brown inputCtx->numberofsegments = 0; 27290298fd71SBarry Smith inputCtx->segmentlist = NULL; 27300298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2731552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27320298fd71SBarry Smith inputCtx->trianglelist = NULL; 2733552f7358SJed Brown inputCtx->numberofholes = 0; 27340298fd71SBarry Smith inputCtx->holelist = NULL; 2735552f7358SJed Brown inputCtx->numberofregions = 0; 27360298fd71SBarry Smith inputCtx->regionlist = NULL; 2737552f7358SJed Brown PetscFunctionReturn(0); 2738552f7358SJed Brown } 2739552f7358SJed Brown 2740552f7358SJed Brown #undef __FUNCT__ 2741552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27420adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27430adebc6cSBarry Smith { 2744552f7358SJed Brown PetscFunctionBegin; 2745552f7358SJed Brown outputCtx->numberofpoints = 0; 27460298fd71SBarry Smith outputCtx->pointlist = NULL; 27470298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27480298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2749552f7358SJed Brown outputCtx->numberoftriangles = 0; 27500298fd71SBarry Smith outputCtx->trianglelist = NULL; 27510298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27520298fd71SBarry Smith outputCtx->neighborlist = NULL; 27530298fd71SBarry Smith outputCtx->segmentlist = NULL; 27540298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2755552f7358SJed Brown outputCtx->numberofedges = 0; 27560298fd71SBarry Smith outputCtx->edgelist = NULL; 27570298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2758552f7358SJed Brown PetscFunctionReturn(0); 2759552f7358SJed Brown } 2760552f7358SJed Brown 2761552f7358SJed Brown #undef __FUNCT__ 2762552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27630adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27640adebc6cSBarry Smith { 2765552f7358SJed Brown PetscFunctionBegin; 276623b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2767552f7358SJed Brown free(outputCtx->pointmarkerlist); 276823b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 276923b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2770552f7358SJed Brown free(outputCtx->edgelist); 2771552f7358SJed Brown free(outputCtx->edgemarkerlist); 2772552f7358SJed Brown free(outputCtx->trianglelist); 2773552f7358SJed Brown free(outputCtx->neighborlist); 2774552f7358SJed Brown PetscFunctionReturn(0); 2775552f7358SJed Brown } 2776552f7358SJed Brown 2777552f7358SJed Brown #undef __FUNCT__ 2778552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2779552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2780552f7358SJed Brown { 278182f516ccSBarry Smith MPI_Comm comm; 2782552f7358SJed Brown PetscInt dim = 2; 2783552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2784552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2785552f7358SJed Brown struct triangulateio in; 2786552f7358SJed Brown struct triangulateio out; 2787552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2788552f7358SJed Brown PetscMPIInt rank; 2789552f7358SJed Brown PetscErrorCode ierr; 2790552f7358SJed Brown 2791552f7358SJed Brown PetscFunctionBegin; 279282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2793552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2794552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2795552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2796552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27970d644c17SKarl Rupp 2798552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2799552f7358SJed Brown if (in.numberofpoints > 0) { 2800552f7358SJed Brown PetscSection coordSection; 2801552f7358SJed Brown Vec coordinates; 2802552f7358SJed Brown PetscScalar *array; 2803552f7358SJed Brown 2804785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2805785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2806552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 280769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2808552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2809552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2810552f7358SJed Brown const PetscInt idx = v - vStart; 2811552f7358SJed Brown PetscInt off, d; 2812552f7358SJed Brown 2813552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2814552f7358SJed Brown for (d = 0; d < dim; ++d) { 2815552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2816552f7358SJed Brown } 2817552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2818552f7358SJed Brown } 2819552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2820552f7358SJed Brown } 2821552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2822552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2823552f7358SJed Brown if (in.numberofsegments > 0) { 2824785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2825785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2826552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2827552f7358SJed Brown const PetscInt idx = e - eStart; 2828552f7358SJed Brown const PetscInt *cone; 2829552f7358SJed Brown 2830552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28310d644c17SKarl Rupp 2832552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2833552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28340d644c17SKarl Rupp 2835552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2836552f7358SJed Brown } 2837552f7358SJed Brown } 2838552f7358SJed Brown #if 0 /* Do not currently support holes */ 2839552f7358SJed Brown PetscReal *holeCoords; 2840552f7358SJed Brown PetscInt h, d; 2841552f7358SJed Brown 2842552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2843552f7358SJed Brown if (in.numberofholes > 0) { 2844785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2845552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2846552f7358SJed Brown for (d = 0; d < dim; ++d) { 2847552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2848552f7358SJed Brown } 2849552f7358SJed Brown } 2850552f7358SJed Brown } 2851552f7358SJed Brown #endif 2852552f7358SJed Brown if (!rank) { 2853552f7358SJed Brown char args[32]; 2854552f7358SJed Brown 2855552f7358SJed Brown /* Take away 'Q' for verbose output */ 2856552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2857552f7358SJed Brown if (createConvexHull) { 2858552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2859552f7358SJed Brown } 2860552f7358SJed Brown if (constrained) { 2861552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2862552f7358SJed Brown } 28630298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2864552f7358SJed Brown } 2865552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2866552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2867552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2868552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2869552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2870552f7358SJed Brown 2871552f7358SJed Brown { 2872552f7358SJed Brown const PetscInt numCorners = 3; 2873552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2874552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2875552f7358SJed Brown const int *cells = out.trianglelist; 2876552f7358SJed Brown const double *meshCoords = out.pointlist; 2877552f7358SJed Brown 28780fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2879552f7358SJed Brown /* Set labels */ 2880552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2881552f7358SJed Brown if (out.pointmarkerlist[v]) { 2882552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2883552f7358SJed Brown } 2884552f7358SJed Brown } 2885552f7358SJed Brown if (interpolate) { 2886552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2887552f7358SJed Brown if (out.edgemarkerlist[e]) { 2888552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2889552f7358SJed Brown const PetscInt *edges; 2890552f7358SJed Brown PetscInt numEdges; 2891552f7358SJed Brown 2892552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2893552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2894552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2895552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2896552f7358SJed Brown } 2897552f7358SJed Brown } 2898552f7358SJed Brown } 2899552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2900552f7358SJed Brown } 2901552f7358SJed Brown #if 0 /* Do not currently support holes */ 2902552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2903552f7358SJed Brown #endif 2904552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2905552f7358SJed Brown PetscFunctionReturn(0); 2906552f7358SJed Brown } 2907552f7358SJed Brown 2908552f7358SJed Brown #undef __FUNCT__ 2909552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2910552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2911552f7358SJed Brown { 291282f516ccSBarry Smith MPI_Comm comm; 2913552f7358SJed Brown PetscInt dim = 2; 2914552f7358SJed Brown struct triangulateio in; 2915552f7358SJed Brown struct triangulateio out; 2916552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2917552f7358SJed Brown PetscMPIInt rank; 2918552f7358SJed Brown PetscErrorCode ierr; 2919552f7358SJed Brown 2920552f7358SJed Brown PetscFunctionBegin; 292182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2922552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2923552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2924552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2925552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2926552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2927552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29280d644c17SKarl Rupp 2929552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2930552f7358SJed Brown if (in.numberofpoints > 0) { 2931552f7358SJed Brown PetscSection coordSection; 2932552f7358SJed Brown Vec coordinates; 2933552f7358SJed Brown PetscScalar *array; 2934552f7358SJed Brown 2935785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2936785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2937552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 293869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2939552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2940552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2941552f7358SJed Brown const PetscInt idx = v - vStart; 2942552f7358SJed Brown PetscInt off, d; 2943552f7358SJed Brown 2944552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2945552f7358SJed Brown for (d = 0; d < dim; ++d) { 2946552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2947552f7358SJed Brown } 2948552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2949552f7358SJed Brown } 2950552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2951552f7358SJed Brown } 2952552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29530d644c17SKarl Rupp 2954552f7358SJed Brown in.numberofcorners = 3; 2955552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29560d644c17SKarl Rupp 2957552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2958552f7358SJed Brown if (in.numberoftriangles > 0) { 2959785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2960552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2961552f7358SJed Brown const PetscInt idx = c - cStart; 29620298fd71SBarry Smith PetscInt *closure = NULL; 2963552f7358SJed Brown PetscInt closureSize; 2964552f7358SJed Brown 2965552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2966552f7358SJed 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); 2967552f7358SJed Brown for (v = 0; v < 3; ++v) { 2968552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2969552f7358SJed Brown } 2970552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2971552f7358SJed Brown } 2972552f7358SJed Brown } 2973552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2974552f7358SJed Brown #if 0 /* Do not currently support holes */ 2975552f7358SJed Brown PetscReal *holeCoords; 2976552f7358SJed Brown PetscInt h, d; 2977552f7358SJed Brown 2978552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2979552f7358SJed Brown if (in.numberofholes > 0) { 2980785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2981552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2982552f7358SJed Brown for (d = 0; d < dim; ++d) { 2983552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2984552f7358SJed Brown } 2985552f7358SJed Brown } 2986552f7358SJed Brown } 2987552f7358SJed Brown #endif 2988552f7358SJed Brown if (!rank) { 2989552f7358SJed Brown char args[32]; 2990552f7358SJed Brown 2991552f7358SJed Brown /* Take away 'Q' for verbose output */ 2992552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29930298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2994552f7358SJed Brown } 2995552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2996552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2997552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2998552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2999552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3000552f7358SJed Brown 3001552f7358SJed Brown { 3002552f7358SJed Brown const PetscInt numCorners = 3; 3003552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3004552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3005552f7358SJed Brown const int *cells = out.trianglelist; 3006552f7358SJed Brown const double *meshCoords = out.pointlist; 3007552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3008552f7358SJed Brown 30090fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3010552f7358SJed Brown /* Set labels */ 3011552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3012552f7358SJed Brown if (out.pointmarkerlist[v]) { 3013552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3014552f7358SJed Brown } 3015552f7358SJed Brown } 3016552f7358SJed Brown if (interpolate) { 3017552f7358SJed Brown PetscInt e; 3018552f7358SJed Brown 3019552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3020552f7358SJed Brown if (out.edgemarkerlist[e]) { 3021552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3022552f7358SJed Brown const PetscInt *edges; 3023552f7358SJed Brown PetscInt numEdges; 3024552f7358SJed Brown 3025552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3026552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3027552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3028552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3029552f7358SJed Brown } 3030552f7358SJed Brown } 3031552f7358SJed Brown } 3032552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3033552f7358SJed Brown } 3034552f7358SJed Brown #if 0 /* Do not currently support holes */ 3035552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3036552f7358SJed Brown #endif 3037552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3038552f7358SJed Brown PetscFunctionReturn(0); 3039552f7358SJed Brown } 3040552f7358SJed Brown #endif 3041552f7358SJed Brown 3042519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3043552f7358SJed Brown #include <tetgen.h> 3044552f7358SJed Brown #undef __FUNCT__ 3045552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3046552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3047552f7358SJed Brown { 304882f516ccSBarry Smith MPI_Comm comm; 3049552f7358SJed Brown const PetscInt dim = 3; 3050552f7358SJed Brown ::tetgenio in; 3051552f7358SJed Brown ::tetgenio out; 3052552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3053552f7358SJed Brown PetscMPIInt rank; 3054552f7358SJed Brown PetscErrorCode ierr; 3055552f7358SJed Brown 3056552f7358SJed Brown PetscFunctionBegin; 305782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3058552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3059552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3060552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3061552f7358SJed Brown if (in.numberofpoints > 0) { 3062552f7358SJed Brown PetscSection coordSection; 3063552f7358SJed Brown Vec coordinates; 3064552f7358SJed Brown PetscScalar *array; 3065552f7358SJed Brown 3066552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3067552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30680d644c17SKarl Rupp 3069552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 307069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3071552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3072552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3073552f7358SJed Brown const PetscInt idx = v - vStart; 3074552f7358SJed Brown PetscInt off, d; 3075552f7358SJed Brown 3076552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3077a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3078552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3079552f7358SJed Brown } 3080552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3081552f7358SJed Brown } 3082552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30830d644c17SKarl Rupp 3084552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3085552f7358SJed Brown if (in.numberoffacets > 0) { 3086552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3087552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3088552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3089552f7358SJed Brown const PetscInt idx = f - fStart; 30900298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3091552f7358SJed Brown 3092552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3093552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3094552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3095552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3096552f7358SJed Brown 3097552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3098552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3099552f7358SJed Brown const PetscInt point = points[p]; 31000d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3101552f7358SJed Brown } 3102552f7358SJed Brown 3103552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3104552f7358SJed Brown poly->numberofvertices = numVertices; 3105552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3106552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3107552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3108552f7358SJed Brown poly->vertexlist[v] = vIdx; 3109552f7358SJed Brown } 3110552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3111552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3112552f7358SJed Brown } 3113552f7358SJed Brown } 3114552f7358SJed Brown if (!rank) { 3115552f7358SJed Brown char args[32]; 3116552f7358SJed Brown 3117552f7358SJed Brown /* Take away 'Q' for verbose output */ 3118552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3119552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3120552f7358SJed Brown } 3121552f7358SJed Brown { 3122552f7358SJed Brown const PetscInt numCorners = 4; 3123552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3124552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3125552f7358SJed Brown const double *meshCoords = out.pointlist; 31261d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3127552f7358SJed Brown 31289db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31290fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3130552f7358SJed Brown /* Set labels */ 3131552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3132552f7358SJed Brown if (out.pointmarkerlist[v]) { 3133552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3134552f7358SJed Brown } 3135552f7358SJed Brown } 3136552f7358SJed Brown if (interpolate) { 3137552f7358SJed Brown PetscInt e; 3138552f7358SJed Brown 3139552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3140552f7358SJed Brown if (out.edgemarkerlist[e]) { 3141552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3142552f7358SJed Brown const PetscInt *edges; 3143552f7358SJed Brown PetscInt numEdges; 3144552f7358SJed Brown 3145552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3146552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3147552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3148552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3149552f7358SJed Brown } 3150552f7358SJed Brown } 3151552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3152552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3153552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3154552f7358SJed Brown const PetscInt *faces; 3155552f7358SJed Brown PetscInt numFaces; 3156552f7358SJed Brown 3157552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3158552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3159552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3160552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3161552f7358SJed Brown } 3162552f7358SJed Brown } 3163552f7358SJed Brown } 3164552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3165552f7358SJed Brown } 3166552f7358SJed Brown PetscFunctionReturn(0); 3167552f7358SJed Brown } 3168552f7358SJed Brown 3169552f7358SJed Brown #undef __FUNCT__ 3170552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3171552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3172552f7358SJed Brown { 317382f516ccSBarry Smith MPI_Comm comm; 3174552f7358SJed Brown const PetscInt dim = 3; 3175552f7358SJed Brown ::tetgenio in; 3176552f7358SJed Brown ::tetgenio out; 3177552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3178552f7358SJed Brown PetscMPIInt rank; 3179552f7358SJed Brown PetscErrorCode ierr; 3180552f7358SJed Brown 3181552f7358SJed Brown PetscFunctionBegin; 318282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3183552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3184552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3185552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3186552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31870d644c17SKarl Rupp 3188552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3189552f7358SJed Brown if (in.numberofpoints > 0) { 3190552f7358SJed Brown PetscSection coordSection; 3191552f7358SJed Brown Vec coordinates; 3192552f7358SJed Brown PetscScalar *array; 3193552f7358SJed Brown 3194552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3195552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31960d644c17SKarl Rupp 3197552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 319869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3199552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3200552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3201552f7358SJed Brown const PetscInt idx = v - vStart; 3202552f7358SJed Brown PetscInt off, d; 3203552f7358SJed Brown 3204552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3205a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3206552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3207552f7358SJed Brown } 3208552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3209552f7358SJed Brown } 3210552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 32110d644c17SKarl Rupp 3212552f7358SJed Brown in.numberofcorners = 4; 3213552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3214552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3215552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3216552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3217552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3218552f7358SJed Brown const PetscInt idx = c - cStart; 32190298fd71SBarry Smith PetscInt *closure = NULL; 3220552f7358SJed Brown PetscInt closureSize; 3221552f7358SJed Brown 3222552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3223552f7358SJed 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); 3224552f7358SJed Brown for (v = 0; v < 4; ++v) { 3225552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3226552f7358SJed Brown } 3227552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3228552f7358SJed Brown } 3229552f7358SJed Brown } 323019436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3231552f7358SJed Brown if (!rank) { 3232552f7358SJed Brown char args[32]; 3233552f7358SJed Brown 3234552f7358SJed Brown /* Take away 'Q' for verbose output */ 323519436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3236552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3237552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3238552f7358SJed Brown } 3239552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3240552f7358SJed Brown 3241552f7358SJed Brown { 3242552f7358SJed Brown const PetscInt numCorners = 4; 3243552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3244552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3245552f7358SJed Brown const double *meshCoords = out.pointlist; 32461d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32471d4b4d7bSJed Brown 3248552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3249552f7358SJed Brown 32509db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32510fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3252552f7358SJed Brown /* Set labels */ 3253552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3254552f7358SJed Brown if (out.pointmarkerlist[v]) { 3255552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3256552f7358SJed Brown } 3257552f7358SJed Brown } 3258552f7358SJed Brown if (interpolate) { 3259552f7358SJed Brown PetscInt e, f; 3260552f7358SJed Brown 3261552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3262552f7358SJed Brown if (out.edgemarkerlist[e]) { 3263552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3264552f7358SJed Brown const PetscInt *edges; 3265552f7358SJed Brown PetscInt numEdges; 3266552f7358SJed Brown 3267552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3268552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3269552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3270552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3271552f7358SJed Brown } 3272552f7358SJed Brown } 3273552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3274552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3275552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3276552f7358SJed Brown const PetscInt *faces; 3277552f7358SJed Brown PetscInt numFaces; 3278552f7358SJed Brown 3279552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3280552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3281552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3282552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3283552f7358SJed Brown } 3284552f7358SJed Brown } 3285552f7358SJed Brown } 3286552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3287552f7358SJed Brown } 3288552f7358SJed Brown PetscFunctionReturn(0); 3289552f7358SJed Brown } 3290552f7358SJed Brown #endif 3291552f7358SJed Brown 3292519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3293aaa7dc30SBarry Smith #include <ctetgen.h> 3294552f7358SJed Brown 3295552f7358SJed Brown #undef __FUNCT__ 3296552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3297552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3298552f7358SJed Brown { 329982f516ccSBarry Smith MPI_Comm comm; 3300552f7358SJed Brown const PetscInt dim = 3; 3301552f7358SJed Brown PLC *in, *out; 3302552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3303552f7358SJed Brown PetscMPIInt rank; 3304552f7358SJed Brown PetscErrorCode ierr; 3305552f7358SJed Brown 3306552f7358SJed Brown PetscFunctionBegin; 330782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 33080298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3309552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3310552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3311552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3312552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 33130d644c17SKarl Rupp 3314552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3315552f7358SJed Brown if (in->numberofpoints > 0) { 3316552f7358SJed Brown PetscSection coordSection; 3317552f7358SJed Brown Vec coordinates; 3318552f7358SJed Brown PetscScalar *array; 3319552f7358SJed Brown 3320785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3321785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3322552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 332369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3324552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3325552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3326552f7358SJed Brown const PetscInt idx = v - vStart; 3327552f7358SJed Brown PetscInt off, d, m; 3328552f7358SJed Brown 3329552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3330552f7358SJed Brown for (d = 0; d < dim; ++d) { 3331552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3332552f7358SJed Brown } 3333552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33340d644c17SKarl Rupp 3335552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3336552f7358SJed Brown } 3337552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3338552f7358SJed Brown } 3339552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33400d644c17SKarl Rupp 3341552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3342552f7358SJed Brown if (in->numberoffacets > 0) { 3343785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3344785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3345552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3346552f7358SJed Brown const PetscInt idx = f - fStart; 33470298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3348552f7358SJed Brown polygon *poly; 3349552f7358SJed Brown 3350552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33510d644c17SKarl Rupp 3352785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33530d644c17SKarl Rupp 3354552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33550298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3356552f7358SJed Brown 3357552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3358552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3359552f7358SJed Brown const PetscInt point = points[p]; 33600d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3361552f7358SJed Brown } 3362552f7358SJed Brown 3363552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3364552f7358SJed Brown poly->numberofvertices = numVertices; 3365785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3366552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3367552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3368552f7358SJed Brown poly->vertexlist[v] = vIdx; 3369552f7358SJed Brown } 3370552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3371552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3372552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3373552f7358SJed Brown } 3374552f7358SJed Brown } 3375552f7358SJed Brown if (!rank) { 3376552f7358SJed Brown TetGenOpts t; 3377552f7358SJed Brown 3378552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3379552f7358SJed Brown t.in = boundary; /* Should go away */ 3380552f7358SJed Brown t.plc = 1; 3381552f7358SJed Brown t.quality = 1; 3382552f7358SJed Brown t.edgesout = 1; 3383552f7358SJed Brown t.zeroindex = 1; 3384552f7358SJed Brown t.quiet = 1; 3385552f7358SJed Brown t.verbose = verbose; 3386552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3387552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3388552f7358SJed Brown } 3389552f7358SJed Brown { 3390552f7358SJed Brown const PetscInt numCorners = 4; 3391552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3392552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3393552f7358SJed Brown const double *meshCoords = out->pointlist; 33941d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3395552f7358SJed Brown 33969db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33970fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3398552f7358SJed Brown /* Set labels */ 3399552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3400552f7358SJed Brown if (out->pointmarkerlist[v]) { 3401552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3402552f7358SJed Brown } 3403552f7358SJed Brown } 3404552f7358SJed Brown if (interpolate) { 3405552f7358SJed Brown PetscInt e; 3406552f7358SJed Brown 3407552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3408552f7358SJed Brown if (out->edgemarkerlist[e]) { 3409552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3410552f7358SJed Brown const PetscInt *edges; 3411552f7358SJed Brown PetscInt numEdges; 3412552f7358SJed Brown 3413552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3414552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3415552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3416552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3417552f7358SJed Brown } 3418552f7358SJed Brown } 3419552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3420552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3421552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3422552f7358SJed Brown const PetscInt *faces; 3423552f7358SJed Brown PetscInt numFaces; 3424552f7358SJed Brown 3425552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3426552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3427552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3428552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3429552f7358SJed Brown } 3430552f7358SJed Brown } 3431552f7358SJed Brown } 3432552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3433552f7358SJed Brown } 3434552f7358SJed Brown 3435552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3436552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3437552f7358SJed Brown PetscFunctionReturn(0); 3438552f7358SJed Brown } 3439552f7358SJed Brown 3440552f7358SJed Brown #undef __FUNCT__ 3441552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3442552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3443552f7358SJed Brown { 344482f516ccSBarry Smith MPI_Comm comm; 3445552f7358SJed Brown const PetscInt dim = 3; 3446552f7358SJed Brown PLC *in, *out; 3447552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3448552f7358SJed Brown PetscMPIInt rank; 3449552f7358SJed Brown PetscErrorCode ierr; 3450552f7358SJed Brown 3451552f7358SJed Brown PetscFunctionBegin; 345282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34530298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3454552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3455552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3456552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3457552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3458552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3459552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34600d644c17SKarl Rupp 3461552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3462552f7358SJed Brown if (in->numberofpoints > 0) { 3463552f7358SJed Brown PetscSection coordSection; 3464552f7358SJed Brown Vec coordinates; 3465552f7358SJed Brown PetscScalar *array; 3466552f7358SJed Brown 3467785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3468785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3469552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 347069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3471552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3472552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3473552f7358SJed Brown const PetscInt idx = v - vStart; 3474552f7358SJed Brown PetscInt off, d, m; 3475552f7358SJed Brown 3476552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3477552f7358SJed Brown for (d = 0; d < dim; ++d) { 3478552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3479552f7358SJed Brown } 3480552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34810d644c17SKarl Rupp 3482552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3483552f7358SJed Brown } 3484552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3485552f7358SJed Brown } 3486552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34870d644c17SKarl Rupp 3488552f7358SJed Brown in->numberofcorners = 4; 3489552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3490552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3491552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3492785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3493552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3494552f7358SJed Brown const PetscInt idx = c - cStart; 34950298fd71SBarry Smith PetscInt *closure = NULL; 3496552f7358SJed Brown PetscInt closureSize; 3497552f7358SJed Brown 3498552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3499552f7358SJed 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); 3500552f7358SJed Brown for (v = 0; v < 4; ++v) { 3501552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3502552f7358SJed Brown } 3503552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3504552f7358SJed Brown } 3505552f7358SJed Brown } 3506552f7358SJed Brown if (!rank) { 3507552f7358SJed Brown TetGenOpts t; 3508552f7358SJed Brown 3509552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 35100d644c17SKarl Rupp 3511552f7358SJed Brown t.in = dm; /* Should go away */ 3512552f7358SJed Brown t.refine = 1; 3513552f7358SJed Brown t.varvolume = 1; 3514552f7358SJed Brown t.quality = 1; 3515552f7358SJed Brown t.edgesout = 1; 3516552f7358SJed Brown t.zeroindex = 1; 3517552f7358SJed Brown t.quiet = 1; 3518552f7358SJed Brown t.verbose = verbose; /* Change this */ 35190d644c17SKarl Rupp 3520552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3521552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3522552f7358SJed Brown } 3523552f7358SJed Brown { 3524552f7358SJed Brown const PetscInt numCorners = 4; 3525552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3526552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3527552f7358SJed Brown const double *meshCoords = out->pointlist; 35281d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3529552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3530552f7358SJed Brown 35319db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35320fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3533552f7358SJed Brown /* Set labels */ 3534552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3535552f7358SJed Brown if (out->pointmarkerlist[v]) { 3536552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3537552f7358SJed Brown } 3538552f7358SJed Brown } 3539552f7358SJed Brown if (interpolate) { 3540552f7358SJed Brown PetscInt e, f; 3541552f7358SJed Brown 3542552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3543552f7358SJed Brown if (out->edgemarkerlist[e]) { 3544552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3545552f7358SJed Brown const PetscInt *edges; 3546552f7358SJed Brown PetscInt numEdges; 3547552f7358SJed Brown 3548552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3549552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3550552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3551552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3552552f7358SJed Brown } 3553552f7358SJed Brown } 3554552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3555552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3556552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3557552f7358SJed Brown const PetscInt *faces; 3558552f7358SJed Brown PetscInt numFaces; 3559552f7358SJed Brown 3560552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3561552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3562552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3563552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3564552f7358SJed Brown } 3565552f7358SJed Brown } 3566552f7358SJed Brown } 3567552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3568552f7358SJed Brown } 3569552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3570552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3571552f7358SJed Brown PetscFunctionReturn(0); 3572552f7358SJed Brown } 3573552f7358SJed Brown #endif 3574552f7358SJed Brown 3575552f7358SJed Brown #undef __FUNCT__ 3576552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3577552f7358SJed Brown /*@C 3578552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3579552f7358SJed Brown 3580552f7358SJed Brown Not Collective 3581552f7358SJed Brown 3582552f7358SJed Brown Input Parameters: 3583552f7358SJed Brown + boundary - The DMPlex boundary object 3584552f7358SJed Brown . name - The mesh generation package name 3585552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3586552f7358SJed Brown 3587552f7358SJed Brown Output Parameter: 3588552f7358SJed Brown . mesh - The DMPlex object 3589552f7358SJed Brown 3590552f7358SJed Brown Level: intermediate 3591552f7358SJed Brown 3592552f7358SJed Brown .keywords: mesh, elements 3593552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3594552f7358SJed Brown @*/ 3595552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3596552f7358SJed Brown { 3597552f7358SJed Brown PetscInt dim; 3598552f7358SJed Brown char genname[1024]; 3599552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3600552f7358SJed Brown PetscErrorCode ierr; 3601552f7358SJed Brown 3602552f7358SJed Brown PetscFunctionBegin; 3603552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3604552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3605c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3606552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36070d644c17SKarl Rupp if (flg) name = genname; 3608552f7358SJed Brown if (name) { 3609552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3610552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3611552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3612552f7358SJed Brown } 3613552f7358SJed Brown switch (dim) { 3614552f7358SJed Brown case 1: 3615552f7358SJed Brown if (!name || isTriangle) { 3616519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3617552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3618552f7358SJed Brown #else 361982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3620552f7358SJed Brown #endif 362182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3622552f7358SJed Brown break; 3623552f7358SJed Brown case 2: 3624552f7358SJed Brown if (!name || isCTetgen) { 3625519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3626552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3627552f7358SJed Brown #else 362882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3629552f7358SJed Brown #endif 3630552f7358SJed Brown } else if (isTetgen) { 3631519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3632552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3633552f7358SJed Brown #else 363482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3635552f7358SJed Brown #endif 363682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3637552f7358SJed Brown break; 3638552f7358SJed Brown default: 363982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3640552f7358SJed Brown } 3641552f7358SJed Brown PetscFunctionReturn(0); 3642552f7358SJed Brown } 3643552f7358SJed Brown 3644552f7358SJed Brown #undef __FUNCT__ 3645552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3646552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3647552f7358SJed Brown { 3648552f7358SJed Brown PetscReal refinementLimit; 3649552f7358SJed Brown PetscInt dim, cStart, cEnd; 36500298fd71SBarry Smith char genname[1024], *name = NULL; 3651552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3652552f7358SJed Brown PetscErrorCode ierr; 3653552f7358SJed Brown 3654552f7358SJed Brown PetscFunctionBegin; 3655552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3656552f7358SJed Brown if (isUniform) { 3657552f7358SJed Brown CellRefiner cellRefiner; 3658552f7358SJed Brown 3659509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3660509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36618e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3662552f7358SJed Brown PetscFunctionReturn(0); 3663552f7358SJed Brown } 3664552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3665552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3666c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3667552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3668552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36690d644c17SKarl Rupp if (flg) name = genname; 3670552f7358SJed Brown if (name) { 3671552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3672552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3673552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3674552f7358SJed Brown } 3675552f7358SJed Brown switch (dim) { 3676552f7358SJed Brown case 2: 3677552f7358SJed Brown if (!name || isTriangle) { 3678519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3679552f7358SJed Brown double *maxVolumes; 3680552f7358SJed Brown PetscInt c; 3681552f7358SJed Brown 3682785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36830d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3684552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36856b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3686552f7358SJed Brown #else 368782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3688552f7358SJed Brown #endif 368982f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3690552f7358SJed Brown break; 3691552f7358SJed Brown case 3: 3692552f7358SJed Brown if (!name || isCTetgen) { 3693519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3694552f7358SJed Brown PetscReal *maxVolumes; 3695552f7358SJed Brown PetscInt c; 3696552f7358SJed Brown 3697785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36980d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3699552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3700552f7358SJed Brown #else 370182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3702552f7358SJed Brown #endif 3703552f7358SJed Brown } else if (isTetgen) { 3704519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3705552f7358SJed Brown double *maxVolumes; 3706552f7358SJed Brown PetscInt c; 3707552f7358SJed Brown 3708785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37090d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3710552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3711552f7358SJed Brown #else 371282f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3713552f7358SJed Brown #endif 371482f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3715552f7358SJed Brown break; 3716552f7358SJed Brown default: 371782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3718552f7358SJed Brown } 37198e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3720552f7358SJed Brown PetscFunctionReturn(0); 3721552f7358SJed Brown } 3722552f7358SJed Brown 3723552f7358SJed Brown #undef __FUNCT__ 37240a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 37250a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 37260a6ba040SMatthew G. Knepley { 37270a6ba040SMatthew G. Knepley DM cdm = dm; 37280a6ba040SMatthew G. Knepley PetscInt r; 37290a6ba040SMatthew G. Knepley PetscBool isUniform; 37300a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37310a6ba040SMatthew G. Knepley 37320a6ba040SMatthew G. Knepley PetscFunctionBegin; 37330a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37340a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37350a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37360a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37370a6ba040SMatthew G. Knepley 37380a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37390a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37400a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37410a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37420a6ba040SMatthew G. Knepley } 37430a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37440a6ba040SMatthew G. Knepley } 37450a6ba040SMatthew G. Knepley 37460a6ba040SMatthew G. Knepley #undef __FUNCT__ 37470a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37480a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37490a6ba040SMatthew G. Knepley { 37500a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3751549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37520a6ba040SMatthew G. Knepley 37530a6ba040SMatthew G. Knepley PetscFunctionBegin; 3754549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37550a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37560a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37570a6ba040SMatthew G. Knepley } 37580a6ba040SMatthew G. Knepley 37590a6ba040SMatthew G. Knepley #undef __FUNCT__ 3760d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3761d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3762d49fcaecSMatthew G. Knepley { 3763d49fcaecSMatthew G. Knepley PetscInt d; 3764d49fcaecSMatthew G. Knepley 3765d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3766d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3767d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3768d49fcaecSMatthew G. Knepley } else { 3769d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3770d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3771858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3772d49fcaecSMatthew G. Knepley } else { 3773d49fcaecSMatthew G. Knepley out[d] = in[d]; 3774d49fcaecSMatthew G. Knepley } 3775d49fcaecSMatthew G. Knepley } 3776d49fcaecSMatthew G. Knepley } 3777d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3778d49fcaecSMatthew G. Knepley } 3779d49fcaecSMatthew G. Knepley 3780d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3781d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3782d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3783d49fcaecSMatthew G. Knepley { 3784d49fcaecSMatthew G. Knepley PetscInt d; 3785d49fcaecSMatthew G. Knepley 3786d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3787d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3788d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3789d49fcaecSMatthew G. Knepley } else { 3790d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3791d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3792858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3793d49fcaecSMatthew G. Knepley } else { 3794d49fcaecSMatthew G. Knepley out[d] += in[d]; 3795d49fcaecSMatthew G. Knepley } 3796d49fcaecSMatthew G. Knepley } 3797d49fcaecSMatthew G. Knepley } 3798d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3799d49fcaecSMatthew G. Knepley } 3800d49fcaecSMatthew G. Knepley 3801d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3802d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3803d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3804d49fcaecSMatthew G. Knepley { 3805d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3806d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3807d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 38088c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3809d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3810d49fcaecSMatthew G. Knepley 3811d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3812d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3813d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3814d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3815d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3816d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3817d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3818d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 38198c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 38208c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 38218c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3822d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3823d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3824d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3825d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 38268c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley } 3828d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3829d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3830d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38318c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3832d49fcaecSMatthew G. Knepley } 3833d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3834d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3835d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3836d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3837d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3838d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3839d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3840d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3841d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3842d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3843d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3844d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3845d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3846d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3847d49fcaecSMatthew G. Knepley } 3848d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3849d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3850d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3851d49fcaecSMatthew G. Knepley PetscInt b; 3852d49fcaecSMatthew G. Knepley 3853d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3854d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3855d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3856d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3857d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3858d49fcaecSMatthew G. Knepley } 3859d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3860d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3861d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 386246e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 3863d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3864d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3865d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3866d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3867d49fcaecSMatthew G. Knepley } 3868d49fcaecSMatthew G. Knepley 3869d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3870aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3871552f7358SJed Brown /*@ 3872aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3873552f7358SJed Brown 3874552f7358SJed Brown Not Collective 3875552f7358SJed Brown 3876aa50250dSMatthew G. Knepley Input Parameter: 3877552f7358SJed Brown . dm - The DMPlex object 3878552f7358SJed Brown 3879aa50250dSMatthew G. Knepley Output Parameter: 3880aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3881552f7358SJed Brown 3882552f7358SJed Brown Level: developer 3883552f7358SJed Brown 3884aa50250dSMatthew G. Knepley .keywords: mesh, points 3885aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3886aa50250dSMatthew G. Knepley @*/ 3887aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3888aa50250dSMatthew G. Knepley { 3889aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3890aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3891aa50250dSMatthew G. Knepley 3892aa50250dSMatthew G. Knepley PetscFunctionBegin; 3893aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3894aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 389563d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3896aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3897aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3898aa50250dSMatthew G. Knepley } 3899aa50250dSMatthew G. Knepley 3900aa50250dSMatthew G. Knepley #undef __FUNCT__ 3901aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3902aa50250dSMatthew G. Knepley /*@ 3903aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3904aa50250dSMatthew G. Knepley 3905aa50250dSMatthew G. Knepley Not Collective 3906aa50250dSMatthew G. Knepley 3907aa50250dSMatthew G. Knepley Input Parameter: 3908aa50250dSMatthew G. Knepley . dm - The DMPlex object 3909aa50250dSMatthew G. Knepley 3910aa50250dSMatthew G. Knepley Output Parameter: 3911aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3912aa50250dSMatthew G. Knepley 3913aa50250dSMatthew G. Knepley Level: developer 3914552f7358SJed Brown 3915552f7358SJed Brown .keywords: mesh, points 3916aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3917552f7358SJed Brown @*/ 3918552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3919552f7358SJed Brown { 3920aa50250dSMatthew G. Knepley DMLabel label; 3921aa50250dSMatthew G. Knepley PetscInt d = 0; 3922552f7358SJed Brown PetscErrorCode ierr; 3923552f7358SJed Brown 3924552f7358SJed Brown PetscFunctionBegin; 3925552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3926552f7358SJed Brown PetscValidPointer(depth, 2); 3927aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3928aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3929552f7358SJed Brown *depth = d-1; 3930552f7358SJed Brown PetscFunctionReturn(0); 3931552f7358SJed Brown } 3932552f7358SJed Brown 3933552f7358SJed Brown #undef __FUNCT__ 3934552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3935552f7358SJed Brown /*@ 3936552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3937552f7358SJed Brown 3938552f7358SJed Brown Not Collective 3939552f7358SJed Brown 3940552f7358SJed Brown Input Parameters: 3941552f7358SJed Brown + dm - The DMPlex object 3942552f7358SJed Brown - stratumValue - The requested depth 3943552f7358SJed Brown 3944552f7358SJed Brown Output Parameters: 3945552f7358SJed Brown + start - The first point at this depth 3946552f7358SJed Brown - end - One beyond the last point at this depth 3947552f7358SJed Brown 3948552f7358SJed Brown Level: developer 3949552f7358SJed Brown 3950552f7358SJed Brown .keywords: mesh, points 3951552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3952552f7358SJed Brown @*/ 39530adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39540adebc6cSBarry Smith { 3955aa50250dSMatthew G. Knepley DMLabel label; 395663d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3957552f7358SJed Brown PetscErrorCode ierr; 3958552f7358SJed Brown 3959552f7358SJed Brown PetscFunctionBegin; 3960552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 396163d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 396263d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3963552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39640d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 396563d1a920SMatthew G. Knepley if (stratumValue < 0) { 396663d1a920SMatthew G. Knepley if (start) *start = pStart; 396763d1a920SMatthew G. Knepley if (end) *end = pEnd; 396863d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3969552f7358SJed Brown } 3970aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 397163d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 397263d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3973552f7358SJed Brown PetscFunctionReturn(0); 3974552f7358SJed Brown } 3975552f7358SJed Brown 3976552f7358SJed Brown #undef __FUNCT__ 3977552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3978552f7358SJed Brown /*@ 3979552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3980552f7358SJed Brown 3981552f7358SJed Brown Not Collective 3982552f7358SJed Brown 3983552f7358SJed Brown Input Parameters: 3984552f7358SJed Brown + dm - The DMPlex object 3985552f7358SJed Brown - stratumValue - The requested height 3986552f7358SJed Brown 3987552f7358SJed Brown Output Parameters: 3988552f7358SJed Brown + start - The first point at this height 3989552f7358SJed Brown - end - One beyond the last point at this height 3990552f7358SJed Brown 3991552f7358SJed Brown Level: developer 3992552f7358SJed Brown 3993552f7358SJed Brown .keywords: mesh, points 3994552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3995552f7358SJed Brown @*/ 39960adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39970adebc6cSBarry Smith { 3998aa50250dSMatthew G. Knepley DMLabel label; 399963d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4000552f7358SJed Brown PetscErrorCode ierr; 4001552f7358SJed Brown 4002552f7358SJed Brown PetscFunctionBegin; 4003552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 400463d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 400563d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4006552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 40070d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 400863d1a920SMatthew G. Knepley if (stratumValue < 0) { 400963d1a920SMatthew G. Knepley if (start) *start = pStart; 401063d1a920SMatthew G. Knepley if (end) *end = pEnd; 401163d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4012552f7358SJed Brown } 4013aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4014aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 401563d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 401663d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4017552f7358SJed Brown PetscFunctionReturn(0); 4018552f7358SJed Brown } 4019552f7358SJed Brown 4020552f7358SJed Brown #undef __FUNCT__ 4021552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4022552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4023a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4024a6dfd86eSKarl Rupp { 4025552f7358SJed Brown PetscInt *numDofTot; 4026916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4027916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4028552f7358SJed Brown PetscErrorCode ierr; 4029552f7358SJed Brown 4030552f7358SJed Brown PetscFunctionBegin; 4031785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4032552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4033552f7358SJed Brown numDofTot[d] = 0; 40340d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4035552f7358SJed Brown } 403682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4037552f7358SJed Brown if (numFields > 0) { 4038552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4039552f7358SJed Brown if (numComp) { 4040552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4041552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4042552f7358SJed Brown } 4043552f7358SJed Brown } 4044552f7358SJed Brown } 4045552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4046552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4047916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4048916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4049916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4050916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4051552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4052552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4053552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4054552f7358SJed Brown } 4055552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4056552f7358SJed Brown } 4057552f7358SJed Brown } 4058552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4059552f7358SJed Brown PetscFunctionReturn(0); 4060552f7358SJed Brown } 4061552f7358SJed Brown 4062552f7358SJed Brown #undef __FUNCT__ 4063552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4064552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4065552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4066552f7358SJed Brown */ 4067a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4068a6dfd86eSKarl Rupp { 4069552f7358SJed Brown PetscInt numFields; 4070552f7358SJed Brown PetscInt bc; 4071a68b90caSToby Isaac PetscSection aSec; 4072552f7358SJed Brown PetscErrorCode ierr; 4073552f7358SJed Brown 4074552f7358SJed Brown PetscFunctionBegin; 4075552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4076552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4077552f7358SJed Brown PetscInt field = 0; 4078552f7358SJed Brown const PetscInt *idx; 4079552f7358SJed Brown PetscInt n, i; 4080552f7358SJed Brown 40810d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4082552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4083552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4084552f7358SJed Brown for (i = 0; i < n; ++i) { 4085552f7358SJed Brown const PetscInt p = idx[i]; 4086552f7358SJed Brown PetscInt numConst = constDof; 4087552f7358SJed Brown 4088552f7358SJed Brown /* Constrain every dof on the point */ 4089552f7358SJed Brown if (numConst < 0) { 4090552f7358SJed Brown if (numFields) { 4091552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4092552f7358SJed Brown } else { 4093552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4094552f7358SJed Brown } 4095552f7358SJed Brown } 4096552f7358SJed Brown if (numFields) { 4097552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4098552f7358SJed Brown } 4099552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4100552f7358SJed Brown } 4101552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4102552f7358SJed Brown } 4103a68b90caSToby Isaac ierr = DMPlexGetConstraints(dm, &aSec, NULL);CHKERRQ(ierr); 4104a68b90caSToby Isaac if (aSec) { 4105a68b90caSToby Isaac PetscInt aStart, aEnd, a; 4106a68b90caSToby Isaac 4107a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 4108a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 4109a68b90caSToby Isaac PetscInt dof; 4110a68b90caSToby Isaac 4111a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 4112a68b90caSToby Isaac if (dof) { 4113a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 4114a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 4115a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 4116a68b90caSToby Isaac if (numFields) { 4117a68b90caSToby Isaac PetscInt f; 4118a68b90caSToby Isaac 4119a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 4120a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 4121a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 4122a68b90caSToby Isaac } 4123a68b90caSToby Isaac } 4124a68b90caSToby Isaac } 4125a68b90caSToby Isaac } 4126a68b90caSToby Isaac } 4127552f7358SJed Brown PetscFunctionReturn(0); 4128552f7358SJed Brown } 4129552f7358SJed Brown 4130552f7358SJed Brown #undef __FUNCT__ 4131552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4132552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41330adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 41340adebc6cSBarry Smith { 4135552f7358SJed Brown PetscInt *maxConstraints; 4136552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4137552f7358SJed Brown PetscErrorCode ierr; 4138552f7358SJed Brown 4139552f7358SJed Brown PetscFunctionBegin; 4140552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4141552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4142785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 41430d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4144552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4145552f7358SJed Brown PetscInt cdof; 4146552f7358SJed Brown 4147552f7358SJed Brown if (numFields) { 4148552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4149552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4150552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4151552f7358SJed Brown } 4152552f7358SJed Brown } else { 4153552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4154552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4155552f7358SJed Brown } 4156552f7358SJed Brown } 4157552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4158552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4159552f7358SJed Brown } 4160552f7358SJed Brown if (maxConstraints[numFields]) { 4161552f7358SJed Brown PetscInt *indices; 4162552f7358SJed Brown 4163785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4164552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4165552f7358SJed Brown PetscInt cdof, d; 4166552f7358SJed Brown 4167552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4168552f7358SJed Brown if (cdof) { 4169552f7358SJed Brown if (cdof > maxConstraints[numFields]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_LIB, "Likely memory corruption, point %D cDof %D > maxConstraints %D", p, cdof, maxConstraints[numFields]); 4170552f7358SJed Brown if (numFields) { 4171552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4172552f7358SJed Brown 4173552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4174552f7358SJed Brown PetscInt cfdof, fdof; 4175552f7358SJed Brown 4176552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4177552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4178552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41790d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4180552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41810d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4182552f7358SJed Brown numConst += cfdof; 4183552f7358SJed Brown foff += fdof; 4184552f7358SJed Brown } 4185552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4186552f7358SJed Brown } else { 41870d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4188552f7358SJed Brown } 4189552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4190552f7358SJed Brown } 4191552f7358SJed Brown } 4192552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4193552f7358SJed Brown } 4194552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4195552f7358SJed Brown PetscFunctionReturn(0); 4196552f7358SJed Brown } 4197552f7358SJed Brown 4198552f7358SJed Brown #undef __FUNCT__ 4199552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4200552f7358SJed Brown /* Set the constrained field indices on each point */ 42010adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 42020adebc6cSBarry Smith { 4203552f7358SJed Brown const PetscInt *points, *indices; 4204552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4205552f7358SJed Brown PetscErrorCode ierr; 4206552f7358SJed Brown 4207552f7358SJed Brown PetscFunctionBegin; 4208552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4209552f7358SJed Brown if ((field < 0) || (field >= numFields)) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Section field %d should be in [%d, %d)", field, 0, numFields); 4210552f7358SJed Brown 4211552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4212552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4213552f7358SJed Brown if (!constraintIndices) { 4214552f7358SJed Brown PetscInt *idx, i; 4215552f7358SJed Brown 4216552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4217785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 42180d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4219552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4220552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4221552f7358SJed Brown } 4222552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4223552f7358SJed Brown } else { 4224552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4225552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4226552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4227552f7358SJed Brown PetscInt fcdof; 4228552f7358SJed Brown 4229552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 423082f516ccSBarry Smith if (fcdof != numConstraints) SETERRQ4(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Section point %d field %d has %d constraints, but yo ugave %d indices", p, field, fcdof, numConstraints); 4231552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4232552f7358SJed Brown } 4233552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4234552f7358SJed Brown } 4235552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4236552f7358SJed Brown PetscFunctionReturn(0); 4237552f7358SJed Brown } 4238552f7358SJed Brown 4239552f7358SJed Brown #undef __FUNCT__ 4240552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4241552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 42420adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 42430adebc6cSBarry Smith { 4244552f7358SJed Brown PetscInt *indices; 4245552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4246552f7358SJed Brown PetscErrorCode ierr; 4247552f7358SJed Brown 4248552f7358SJed Brown PetscFunctionBegin; 4249552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4250785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4251552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 425282f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4253552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4254552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4255552f7358SJed Brown PetscInt cdof, d; 4256552f7358SJed Brown 4257552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4258552f7358SJed Brown if (cdof) { 4259552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4260552f7358SJed Brown 4261552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4262552f7358SJed Brown const PetscInt *fcind; 4263552f7358SJed Brown PetscInt fdof, fcdof; 4264552f7358SJed Brown 4265552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4266552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4267552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4268552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42690d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4270552f7358SJed Brown foff += fdof; 4271552f7358SJed Brown numConst += fcdof; 4272552f7358SJed Brown } 427382f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4274552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4275552f7358SJed Brown } 4276552f7358SJed Brown } 4277552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4278552f7358SJed Brown PetscFunctionReturn(0); 4279552f7358SJed Brown } 4280552f7358SJed Brown 4281552f7358SJed Brown #undef __FUNCT__ 4282552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4283552f7358SJed Brown /*@C 4284552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4285552f7358SJed Brown 4286552f7358SJed Brown Not Collective 4287552f7358SJed Brown 4288552f7358SJed Brown Input Parameters: 4289552f7358SJed Brown + dm - The DMPlex object 4290552f7358SJed Brown . dim - The spatial dimension of the problem 4291552f7358SJed Brown . numFields - The number of fields in the problem 4292552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4293552f7358SJed Brown . numDof - An array of size numFields*(dim+1) which holds the number of dof for each field on a mesh piece of dimension d 4294552f7358SJed Brown . numBC - The number of boundary conditions 4295552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4296f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4297f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4298552f7358SJed Brown 4299552f7358SJed Brown Output Parameter: 4300552f7358SJed Brown . section - The PetscSection object 4301552f7358SJed Brown 4302552f7358SJed Brown Notes: numDof[f*(dim+1)+d] gives the number of dof for field f on sieve points of dimension d. For instance, numDof[1] is the 4303f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4304f8f126e8SMatthew G. Knepley 4305f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4306552f7358SJed Brown 4307552f7358SJed Brown Level: developer 4308552f7358SJed Brown 43093813dfbdSMatthew G Knepley Fortran Notes: 43103813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 43113813dfbdSMatthew G Knepley 4312552f7358SJed Brown .keywords: mesh, elements 4313f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4314552f7358SJed Brown @*/ 4315f8f126e8SMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], IS perm, PetscSection *section) 4316a6dfd86eSKarl Rupp { 4317a68b90caSToby Isaac PetscSection aSec; 4318552f7358SJed Brown PetscErrorCode ierr; 4319552f7358SJed Brown 4320552f7358SJed Brown PetscFunctionBegin; 4321552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4322552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4323f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4324552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4325a68b90caSToby Isaac ierr = DMPlexGetConstraints(dm,&aSec,NULL);CHKERRQ(ierr); 4326a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4327ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4328552f7358SJed Brown PetscFunctionReturn(0); 4329552f7358SJed Brown } 4330552f7358SJed Brown 4331552f7358SJed Brown #undef __FUNCT__ 4332552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 43330adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 43340adebc6cSBarry Smith { 4335552f7358SJed Brown PetscSection section; 4336552f7358SJed Brown PetscErrorCode ierr; 4337552f7358SJed Brown 4338552f7358SJed Brown PetscFunctionBegin; 433938221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 434082f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4341552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 43421d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4343552f7358SJed Brown PetscFunctionReturn(0); 4344552f7358SJed Brown } 4345552f7358SJed Brown 4346552f7358SJed Brown #undef __FUNCT__ 4347552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 43480adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 43490adebc6cSBarry Smith { 4350552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4351552f7358SJed Brown 4352552f7358SJed Brown PetscFunctionBegin; 4353552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4354552f7358SJed Brown if (section) *section = mesh->coneSection; 4355552f7358SJed Brown PetscFunctionReturn(0); 4356552f7358SJed Brown } 4357552f7358SJed Brown 4358552f7358SJed Brown #undef __FUNCT__ 43598cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43608cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43618cb4d582SMatthew G. Knepley { 43628cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43638cb4d582SMatthew G. Knepley 43648cb4d582SMatthew G. Knepley PetscFunctionBegin; 43658cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43668cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43678cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43688cb4d582SMatthew G. Knepley } 43698cb4d582SMatthew G. Knepley 43708cb4d582SMatthew G. Knepley #undef __FUNCT__ 4371552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4372a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4373a6dfd86eSKarl Rupp { 4374552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4375552f7358SJed Brown 4376552f7358SJed Brown PetscFunctionBegin; 4377552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4378552f7358SJed Brown if (cones) *cones = mesh->cones; 4379552f7358SJed Brown PetscFunctionReturn(0); 4380552f7358SJed Brown } 4381552f7358SJed Brown 4382552f7358SJed Brown #undef __FUNCT__ 4383552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4384a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4385a6dfd86eSKarl Rupp { 4386552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4387552f7358SJed Brown 4388552f7358SJed Brown PetscFunctionBegin; 4389552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4390552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4391552f7358SJed Brown PetscFunctionReturn(0); 4392552f7358SJed Brown } 4393552f7358SJed Brown 4394552f7358SJed Brown /******************************** FEM Support **********************************/ 4395552f7358SJed Brown 4396552f7358SJed Brown #undef __FUNCT__ 43971a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43981a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4399a6dfd86eSKarl Rupp { 4400552f7358SJed Brown PetscScalar *array, *vArray; 4401d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 44021a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4403552f7358SJed Brown PetscErrorCode ierr; 4404552f7358SJed Brown 44051b406b76SMatthew G. Knepley PetscFunctionBeginHot; 44062a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 44075a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 44085a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 44095a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 44103f7cbbe7SMatthew G. Knepley if (!values || !*values) { 44119df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44129df71ca4SMatthew G. Knepley PetscInt dof; 4413d9917b9dSMatthew G. Knepley 44149df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44159df71ca4SMatthew G. Knepley size += dof; 44169df71ca4SMatthew G. Knepley } 44179df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44189df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44192a3aaacfSMatthew G. Knepley PetscInt dof; 44205a1bb5cfSMatthew G. Knepley 44215a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44222a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44235a1bb5cfSMatthew G. Knepley size += dof; 44245a1bb5cfSMatthew G. Knepley } 44253f7cbbe7SMatthew G. Knepley if (!values) { 44263f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 44273f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 44283f7cbbe7SMatthew G. Knepley } 44295a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4430982e9ed1SMatthew G. Knepley } else { 4431982e9ed1SMatthew G. Knepley array = *values; 4432982e9ed1SMatthew G. Knepley } 44339df71ca4SMatthew G. Knepley size = 0; 44345a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44359df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44369df71ca4SMatthew G. Knepley PetscInt dof, off, d; 44379df71ca4SMatthew G. Knepley PetscScalar *varr; 4438d9917b9dSMatthew G. Knepley 44399df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44409df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44419df71ca4SMatthew G. Knepley varr = &vArray[off]; 44421a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44431a271a75SMatthew G. Knepley array[offset] = varr[d]; 44449df71ca4SMatthew G. Knepley } 44459df71ca4SMatthew G. Knepley size += dof; 44469df71ca4SMatthew G. Knepley } 44479df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44489df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44499df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 44505a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 44515a1bb5cfSMatthew G. Knepley PetscScalar *varr; 44525a1bb5cfSMatthew G. Knepley 445352ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44545a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44555a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44565a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44575a1bb5cfSMatthew G. Knepley if (o >= 0) { 44581a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44591a271a75SMatthew G. Knepley array[offset] = varr[d]; 44605a1bb5cfSMatthew G. Knepley } 44615a1bb5cfSMatthew G. Knepley } else { 44621a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44631a271a75SMatthew G. Knepley array[offset] = varr[d]; 44645a1bb5cfSMatthew G. Knepley } 44655a1bb5cfSMatthew G. Knepley } 44669df71ca4SMatthew G. Knepley size += dof; 44675a1bb5cfSMatthew G. Knepley } 44685a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44699df71ca4SMatthew G. Knepley if (!*values) { 44705a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44715a1bb5cfSMatthew G. Knepley *values = array; 44729df71ca4SMatthew G. Knepley } else { 44739df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44748c312ff3SMatthew G. Knepley *csize = size; 44759df71ca4SMatthew G. Knepley } 44765a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44775a1bb5cfSMatthew G. Knepley } 4478d9917b9dSMatthew G. Knepley 4479d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44801a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44811a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44821a271a75SMatthew G. Knepley { 44831a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44841a271a75SMatthew G. Knepley PetscErrorCode ierr; 44851a271a75SMatthew G. Knepley 44861a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4487fe02ba77SJed Brown *size = 0; 44881a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44891a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44901a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44911a271a75SMatthew G. Knepley PetscInt dof, off, d; 44921a271a75SMatthew G. Knepley const PetscScalar *varr; 44931a271a75SMatthew G. Knepley 44941a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44951a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44961a271a75SMatthew G. Knepley varr = &vArray[off]; 44971a271a75SMatthew G. Knepley if (o >= 0) { 44981a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44991a271a75SMatthew G. Knepley } else { 45001a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 45011a271a75SMatthew G. Knepley } 45021a271a75SMatthew G. Knepley } 45031a271a75SMatthew G. Knepley *size = offset; 45041a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45051a271a75SMatthew G. Knepley } 45061a271a75SMatthew G. Knepley 45071a271a75SMatthew G. Knepley #undef __FUNCT__ 45081a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 45091a271a75SMatthew 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[]) 45101a271a75SMatthew G. Knepley { 45111a271a75SMatthew G. Knepley PetscInt offset = 0, f; 45121a271a75SMatthew G. Knepley PetscErrorCode ierr; 45131a271a75SMatthew G. Knepley 45141a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4515fe02ba77SJed Brown *size = 0; 45161a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 45171a271a75SMatthew G. Knepley PetscInt fcomp, p; 45181a271a75SMatthew G. Knepley 45191a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 45201a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 45211a271a75SMatthew G. Knepley const PetscInt point = points[p]; 45221a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45231a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 45241a271a75SMatthew G. Knepley const PetscScalar *varr; 45251a271a75SMatthew G. Knepley 45261a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 45271a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45281a271a75SMatthew G. Knepley varr = &vArray[foff]; 45291a271a75SMatthew G. Knepley if (o >= 0) { 45301a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 45311a271a75SMatthew G. Knepley } else { 45321a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 45331a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 45341a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 45351a271a75SMatthew G. Knepley } 45361a271a75SMatthew G. Knepley } 45371a271a75SMatthew G. Knepley } 45381a271a75SMatthew G. Knepley } 45391a271a75SMatthew G. Knepley } 45401a271a75SMatthew G. Knepley *size = offset; 45411a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45421a271a75SMatthew G. Knepley } 45431a271a75SMatthew G. Knepley 45441a271a75SMatthew G. Knepley #undef __FUNCT__ 4545552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4546552f7358SJed Brown /*@C 4547552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4548552f7358SJed Brown 4549552f7358SJed Brown Not collective 4550552f7358SJed Brown 4551552f7358SJed Brown Input Parameters: 4552552f7358SJed Brown + dm - The DM 4553552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4554552f7358SJed Brown . v - The local vector 4555552f7358SJed Brown - point - The sieve point in the DM 4556552f7358SJed Brown 4557552f7358SJed Brown Output Parameters: 4558552f7358SJed Brown + csize - The number of values in the closure, or NULL 4559552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4560552f7358SJed Brown 4561552f7358SJed Brown Fortran Notes: 4562552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4563552f7358SJed Brown include petsc.h90 in your code. 4564552f7358SJed Brown 4565552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4566552f7358SJed Brown 4567552f7358SJed Brown Level: intermediate 4568552f7358SJed Brown 4569552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4570552f7358SJed Brown @*/ 4571552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4572552f7358SJed Brown { 4573552f7358SJed Brown PetscSection clSection; 4574d9917b9dSMatthew G. Knepley IS clPoints; 4575552f7358SJed Brown PetscScalar *array, *vArray; 4576552f7358SJed Brown PetscInt *points = NULL; 4577d9917b9dSMatthew G. Knepley const PetscInt *clp; 45781a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4579552f7358SJed Brown PetscErrorCode ierr; 4580552f7358SJed Brown 4581d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4582552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4583552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45841a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45851a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4586552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4587552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4588552f7358SJed Brown if (depth == 1 && numFields < 2) { 45891a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4590552f7358SJed Brown PetscFunctionReturn(0); 4591552f7358SJed Brown } 45921a271a75SMatthew G. Knepley /* Get points */ 4593d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4594d9917b9dSMatthew G. Knepley if (!clPoints) { 45951a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4596552f7358SJed Brown 45971a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4598552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4599552f7358SJed Brown /* Compress out points not in the section */ 4600552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4601552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4602552f7358SJed Brown points[q*2] = points[p]; 4603552f7358SJed Brown points[q*2+1] = points[p+1]; 4604552f7358SJed Brown ++q; 4605552f7358SJed Brown } 4606552f7358SJed Brown } 4607552f7358SJed Brown numPoints = q; 4608d9917b9dSMatthew G. Knepley } else { 4609d9917b9dSMatthew G. Knepley PetscInt dof, off; 4610552f7358SJed Brown 4611d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4612d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4613d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46141a271a75SMatthew G. Knepley numPoints = dof/2; 4615d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4616552f7358SJed Brown } 46171a271a75SMatthew G. Knepley /* Get array */ 4618552f7358SJed Brown if (!values || !*values) { 46191a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4620552f7358SJed Brown 46211a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4622552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 46231a271a75SMatthew G. Knepley asize += dof; 4624552f7358SJed Brown } 4625bd6c0d32SMatthew G. Knepley if (!values) { 4626d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46271a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46281a271a75SMatthew G. Knepley if (csize) *csize = asize; 4629bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4630bd6c0d32SMatthew G. Knepley } 46311a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4632d0f6b257SMatthew G. Knepley } else { 4633d0f6b257SMatthew G. Knepley array = *values; 4634d0f6b257SMatthew G. Knepley } 4635552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 46361a271a75SMatthew G. Knepley /* Get values */ 4637ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 46381a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 46391a271a75SMatthew G. Knepley /* Cleanup points */ 46401a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46411a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46421a271a75SMatthew G. Knepley /* Cleanup array */ 4643552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4644d0f6b257SMatthew G. Knepley if (!*values) { 4645552f7358SJed Brown if (csize) *csize = size; 4646552f7358SJed Brown *values = array; 4647d0f6b257SMatthew G. Knepley } else { 4648d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4649d0f6b257SMatthew G. Knepley *csize = size; 4650d0f6b257SMatthew G. Knepley } 4651552f7358SJed Brown PetscFunctionReturn(0); 4652552f7358SJed Brown } 4653552f7358SJed Brown 4654552f7358SJed Brown #undef __FUNCT__ 4655552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4656552f7358SJed Brown /*@C 4657552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4658552f7358SJed Brown 4659552f7358SJed Brown Not collective 4660552f7358SJed Brown 4661552f7358SJed Brown Input Parameters: 4662552f7358SJed Brown + dm - The DM 46630298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4664552f7358SJed Brown . v - The local vector 4665552f7358SJed Brown . point - The sieve point in the DM 46660298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4667552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4668552f7358SJed Brown 46693813dfbdSMatthew G Knepley Fortran Notes: 46703813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46713813dfbdSMatthew G Knepley include petsc.h90 in your code. 46723813dfbdSMatthew G Knepley 46733813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46743813dfbdSMatthew G Knepley 4675552f7358SJed Brown Level: intermediate 4676552f7358SJed Brown 4677552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4678552f7358SJed Brown @*/ 46797c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4680a6dfd86eSKarl Rupp { 4681552f7358SJed Brown PetscInt size = 0; 4682552f7358SJed Brown PetscErrorCode ierr; 4683552f7358SJed Brown 4684552f7358SJed Brown PetscFunctionBegin; 4685552f7358SJed Brown /* Should work without recalculating size */ 4686552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4687552f7358SJed Brown PetscFunctionReturn(0); 4688552f7358SJed Brown } 4689552f7358SJed Brown 4690552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4691552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4692552f7358SJed Brown 4693552f7358SJed Brown #undef __FUNCT__ 4694552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46951a271a75SMatthew 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[]) 4696552f7358SJed Brown { 4697552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4698552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4699552f7358SJed Brown PetscScalar *a; 4700552f7358SJed Brown PetscInt off, cind = 0, k; 4701552f7358SJed Brown PetscErrorCode ierr; 4702552f7358SJed Brown 4703552f7358SJed Brown PetscFunctionBegin; 4704552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4705552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4706552f7358SJed Brown a = &array[off]; 4707552f7358SJed Brown if (!cdof || setBC) { 4708552f7358SJed Brown if (orientation >= 0) { 4709552f7358SJed Brown for (k = 0; k < dof; ++k) { 4710552f7358SJed Brown fuse(&a[k], values[k]); 4711552f7358SJed Brown } 4712552f7358SJed Brown } else { 4713552f7358SJed Brown for (k = 0; k < dof; ++k) { 4714552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4715552f7358SJed Brown } 4716552f7358SJed Brown } 4717552f7358SJed Brown } else { 4718552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4719552f7358SJed Brown if (orientation >= 0) { 4720552f7358SJed Brown for (k = 0; k < dof; ++k) { 4721552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4722552f7358SJed Brown fuse(&a[k], values[k]); 4723552f7358SJed Brown } 4724552f7358SJed Brown } else { 4725552f7358SJed Brown for (k = 0; k < dof; ++k) { 4726552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4727552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4728552f7358SJed Brown } 4729552f7358SJed Brown } 4730552f7358SJed Brown } 4731552f7358SJed Brown PetscFunctionReturn(0); 4732552f7358SJed Brown } 4733552f7358SJed Brown 4734552f7358SJed Brown #undef __FUNCT__ 4735a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 47361a271a75SMatthew 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[]) 4737a5e93ea8SMatthew G. Knepley { 4738a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4739a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4740a5e93ea8SMatthew G. Knepley PetscScalar *a; 4741a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4742a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4743a5e93ea8SMatthew G. Knepley 4744a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4745a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4746a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4747a5e93ea8SMatthew G. Knepley a = &array[off]; 4748a5e93ea8SMatthew G. Knepley if (cdof) { 4749a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4750a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4751a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4752a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4753a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4754a5e93ea8SMatthew G. Knepley ++cind; 4755a5e93ea8SMatthew G. Knepley } 4756a5e93ea8SMatthew G. Knepley } 4757a5e93ea8SMatthew G. Knepley } else { 4758a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4759a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4760a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4761a5e93ea8SMatthew G. Knepley ++cind; 4762a5e93ea8SMatthew G. Knepley } 4763a5e93ea8SMatthew G. Knepley } 4764a5e93ea8SMatthew G. Knepley } 4765a5e93ea8SMatthew G. Knepley } 4766a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4767a5e93ea8SMatthew G. Knepley } 4768a5e93ea8SMatthew G. Knepley 4769a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4770552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47711a271a75SMatthew 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[]) 4772a6dfd86eSKarl Rupp { 4773552f7358SJed Brown PetscScalar *a; 47741a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47751a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47761a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4777552f7358SJed Brown PetscErrorCode ierr; 4778552f7358SJed Brown 4779552f7358SJed Brown PetscFunctionBegin; 4780552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4781552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47821a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47831a271a75SMatthew G. Knepley a = &array[foff]; 4784552f7358SJed Brown if (!fcdof || setBC) { 47851a271a75SMatthew G. Knepley if (o >= 0) { 47861a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4787552f7358SJed Brown } else { 4788552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4789552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47901a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4791552f7358SJed Brown } 4792552f7358SJed Brown } 4793552f7358SJed Brown } 4794552f7358SJed Brown } else { 4795552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47961a271a75SMatthew G. Knepley if (o >= 0) { 4797552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4798552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47991a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4800552f7358SJed Brown } 4801552f7358SJed Brown } else { 4802552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4803552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4804552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 48051a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4806552f7358SJed Brown } 4807552f7358SJed Brown } 4808552f7358SJed Brown } 4809552f7358SJed Brown } 48101a271a75SMatthew G. Knepley *offset += fdof; 4811552f7358SJed Brown PetscFunctionReturn(0); 4812552f7358SJed Brown } 4813552f7358SJed Brown 4814552f7358SJed Brown #undef __FUNCT__ 4815a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 48161a271a75SMatthew 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[]) 4817a5e93ea8SMatthew G. Knepley { 4818a5e93ea8SMatthew G. Knepley PetscScalar *a; 48191a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 48201a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 48211a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4822a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4823a5e93ea8SMatthew G. Knepley 4824a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4825a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4826a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 48271a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 48281a271a75SMatthew G. Knepley a = &array[foff]; 4829a5e93ea8SMatthew G. Knepley if (fcdof) { 4830a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 48311a271a75SMatthew G. Knepley if (o >= 0) { 4832a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4833a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 48341a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4835a5e93ea8SMatthew G. Knepley ++cind; 4836a5e93ea8SMatthew G. Knepley } 4837a5e93ea8SMatthew G. Knepley } 4838a5e93ea8SMatthew G. Knepley } else { 4839a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4840a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4841a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 48421a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4843a5e93ea8SMatthew G. Knepley ++cind; 4844a5e93ea8SMatthew G. Knepley } 4845a5e93ea8SMatthew G. Knepley } 4846a5e93ea8SMatthew G. Knepley } 4847a5e93ea8SMatthew G. Knepley } 4848a5e93ea8SMatthew G. Knepley } 48491a271a75SMatthew G. Knepley *offset += fdof; 4850a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4851a5e93ea8SMatthew G. Knepley } 4852a5e93ea8SMatthew G. Knepley 4853a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48541b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48551a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4856a6dfd86eSKarl Rupp { 4857552f7358SJed Brown PetscScalar *array; 48581b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48591b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4860552f7358SJed Brown PetscErrorCode ierr; 4861552f7358SJed Brown 48621b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4863b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4864b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4865b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4866b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4867b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4868b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4869b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4870b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4871b6ebb6e6SMatthew G. Knepley 4872b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4873b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4874b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4875b6ebb6e6SMatthew G. Knepley { 4876b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4877b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4878b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4879b6ebb6e6SMatthew G. Knepley 4880b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4881b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4882b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4883b6ebb6e6SMatthew G. Knepley if (!cdof) { 4884b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4885b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4886b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4887b6ebb6e6SMatthew G. Knepley } 4888b6ebb6e6SMatthew G. Knepley } else { 4889b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4890b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4891b6ebb6e6SMatthew G. Knepley } 4892b6ebb6e6SMatthew G. Knepley } 4893b6ebb6e6SMatthew G. Knepley } else { 4894b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4895b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4896b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4897b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4898b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4899b6ebb6e6SMatthew G. Knepley } 4900b6ebb6e6SMatthew G. Knepley } else { 4901b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4902b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4903b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4904b6ebb6e6SMatthew G. Knepley } 4905b6ebb6e6SMatthew G. Knepley } 4906b6ebb6e6SMatthew G. Knepley } 4907b6ebb6e6SMatthew G. Knepley } 4908b6ebb6e6SMatthew G. Knepley } 4909b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4910b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4911b6ebb6e6SMatthew G. Knepley } 49121b406b76SMatthew G. Knepley 49131b406b76SMatthew G. Knepley #undef __FUNCT__ 49141b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 49151b406b76SMatthew G. Knepley /*@C 49161b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 49171b406b76SMatthew G. Knepley 49181b406b76SMatthew G. Knepley Not collective 49191b406b76SMatthew G. Knepley 49201b406b76SMatthew G. Knepley Input Parameters: 49211b406b76SMatthew G. Knepley + dm - The DM 49221b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 49231b406b76SMatthew G. Knepley . v - The local vector 49241b406b76SMatthew G. Knepley . point - The sieve point in the DM 49251b406b76SMatthew G. Knepley . values - The array of values 49261b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 49271b406b76SMatthew G. Knepley 49281b406b76SMatthew G. Knepley Fortran Notes: 49291b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 49301b406b76SMatthew G. Knepley 49311b406b76SMatthew G. Knepley Level: intermediate 49321b406b76SMatthew G. Knepley 49331b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 49341b406b76SMatthew G. Knepley @*/ 49351b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 49361b406b76SMatthew G. Knepley { 49371b406b76SMatthew G. Knepley PetscSection clSection; 49381b406b76SMatthew G. Knepley IS clPoints; 49391b406b76SMatthew G. Knepley PetscScalar *array; 49401b406b76SMatthew G. Knepley PetscInt *points = NULL; 49411b406b76SMatthew G. Knepley const PetscInt *clp; 49421a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 49431b406b76SMatthew G. Knepley PetscErrorCode ierr; 49441b406b76SMatthew G. Knepley 49451a271a75SMatthew G. Knepley PetscFunctionBeginHot; 49461b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49471b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 49481a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 49491a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 49501b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49511b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49521b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 49531a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49541b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49551b406b76SMatthew G. Knepley } 49561a271a75SMatthew G. Knepley /* Get points */ 49571b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49581b406b76SMatthew G. Knepley if (!clPoints) { 49591a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49601a271a75SMatthew G. Knepley 49611a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4962552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4963552f7358SJed Brown /* Compress out points not in the section */ 4964552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4965552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4966552f7358SJed Brown points[q*2] = points[p]; 4967552f7358SJed Brown points[q*2+1] = points[p+1]; 4968552f7358SJed Brown ++q; 4969552f7358SJed Brown } 4970552f7358SJed Brown } 4971552f7358SJed Brown numPoints = q; 49721b406b76SMatthew G. Knepley } else { 49731b406b76SMatthew G. Knepley PetscInt dof, off; 4974552f7358SJed Brown 49751b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49761b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49771b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49781a271a75SMatthew G. Knepley numPoints = dof/2; 49791b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4980552f7358SJed Brown } 49811a271a75SMatthew G. Knepley /* Get array */ 4982552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49831a271a75SMatthew G. Knepley /* Get values */ 4984ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49851a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4986552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49871a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4988552f7358SJed Brown switch (mode) { 4989552f7358SJed Brown case INSERT_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, insert, PETSC_FALSE, values, &offset, array); 4994552f7358SJed Brown } break; 4995552f7358SJed Brown case INSERT_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, insert, PETSC_TRUE, values, &offset, array); 5000552f7358SJed Brown } break; 5001a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5002a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50031a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50041a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50051a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5006a5e93ea8SMatthew G. Knepley } break; 5007552f7358SJed Brown case ADD_VALUES: 5008552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50091a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50101a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50111a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5012552f7358SJed Brown } break; 5013552f7358SJed Brown case ADD_ALL_VALUES: 5014552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50151a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50161a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50171a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5018552f7358SJed Brown } break; 5019552f7358SJed Brown default: 502082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5021552f7358SJed Brown } 50221a271a75SMatthew G. Knepley } 5023552f7358SJed Brown } else { 50241a271a75SMatthew G. Knepley PetscInt dof, off; 50251a271a75SMatthew G. Knepley 5026552f7358SJed Brown switch (mode) { 5027552f7358SJed Brown case INSERT_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, insert, PETSC_FALSE, o, &values[off], array); 5032552f7358SJed Brown } break; 5033552f7358SJed Brown case INSERT_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, insert, PETSC_TRUE, o, &values[off], array); 5038552f7358SJed Brown } break; 5039a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5040a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5041a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5042a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5043a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5044a5e93ea8SMatthew G. Knepley } break; 5045552f7358SJed Brown case ADD_VALUES: 5046552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5047552f7358SJed Brown PetscInt o = points[p+1]; 5048552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5049552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5050552f7358SJed Brown } break; 5051552f7358SJed Brown case ADD_ALL_VALUES: 5052552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5053552f7358SJed Brown PetscInt o = points[p+1]; 5054552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5055552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5056552f7358SJed Brown } break; 5057552f7358SJed Brown default: 505882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5059552f7358SJed Brown } 5060552f7358SJed Brown } 50611a271a75SMatthew G. Knepley /* Cleanup points */ 50621a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50631a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50641a271a75SMatthew G. Knepley /* Cleanup array */ 5065552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5066552f7358SJed Brown PetscFunctionReturn(0); 5067552f7358SJed Brown } 5068552f7358SJed Brown 5069552f7358SJed Brown #undef __FUNCT__ 5070e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5071e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5072e07394fbSMatthew G. Knepley { 5073e07394fbSMatthew G. Knepley PetscSection clSection; 5074e07394fbSMatthew G. Knepley IS clPoints; 5075e07394fbSMatthew G. Knepley PetscScalar *array; 5076e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5077e07394fbSMatthew G. Knepley const PetscInt *clp; 5078e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5079e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5080e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5081e07394fbSMatthew G. Knepley 5082e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5083e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5084e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5085e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5086e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5087e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5088e07394fbSMatthew G. Knepley /* Get points */ 5089e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5090e07394fbSMatthew G. Knepley if (!clPoints) { 5091e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5092e07394fbSMatthew G. Knepley 5093e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5094e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5095e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5096e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5097e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5098e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5099e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5100e07394fbSMatthew G. Knepley ++q; 5101e07394fbSMatthew G. Knepley } 5102e07394fbSMatthew G. Knepley } 5103e07394fbSMatthew G. Knepley numPoints = q; 5104e07394fbSMatthew G. Knepley } else { 5105e07394fbSMatthew G. Knepley PetscInt dof, off; 5106e07394fbSMatthew G. Knepley 5107e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5108e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5109e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5110e07394fbSMatthew G. Knepley numPoints = dof/2; 5111e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5112e07394fbSMatthew G. Knepley } 5113e07394fbSMatthew G. Knepley /* Get array */ 5114e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5115e07394fbSMatthew G. Knepley /* Get values */ 5116e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5117e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5118e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5119e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5120e07394fbSMatthew G. Knepley PetscInt fdof; 5121e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5122e07394fbSMatthew G. Knepley offset += fdof; 5123e07394fbSMatthew G. Knepley } 5124e07394fbSMatthew G. Knepley continue; 5125e07394fbSMatthew G. Knepley } 5126e07394fbSMatthew G. Knepley switch (mode) { 5127e07394fbSMatthew G. Knepley case INSERT_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, insert, PETSC_FALSE, values, &offset, array); 5132e07394fbSMatthew G. Knepley } break; 5133e07394fbSMatthew G. Knepley case INSERT_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, insert, PETSC_TRUE, values, &offset, array); 5138e07394fbSMatthew G. Knepley } break; 5139e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5140e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5141e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5142e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5143e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5144e07394fbSMatthew G. Knepley } break; 5145e07394fbSMatthew G. Knepley case ADD_VALUES: 5146e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5147e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5148e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5149e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5150e07394fbSMatthew G. Knepley } break; 5151e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5152e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5153e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5154e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5155e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5156e07394fbSMatthew G. Knepley } break; 5157e07394fbSMatthew G. Knepley default: 5158e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5159e07394fbSMatthew G. Knepley } 5160e07394fbSMatthew G. Knepley } 5161e07394fbSMatthew G. Knepley /* Cleanup points */ 5162e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5163e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5164e07394fbSMatthew G. Knepley /* Cleanup array */ 5165e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5166e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5167e07394fbSMatthew G. Knepley } 5168e07394fbSMatthew G. Knepley 5169e07394fbSMatthew G. Knepley #undef __FUNCT__ 5170552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5171b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5172552f7358SJed Brown { 5173552f7358SJed Brown PetscMPIInt rank; 5174552f7358SJed Brown PetscInt i, j; 5175552f7358SJed Brown PetscErrorCode ierr; 5176552f7358SJed Brown 5177552f7358SJed Brown PetscFunctionBegin; 517882f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 517977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5180b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5181b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5182b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5183b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 518477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5185b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5186519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51877eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5188552f7358SJed Brown #else 5189b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5190552f7358SJed Brown #endif 5191552f7358SJed Brown } 519277a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5193552f7358SJed Brown } 5194552f7358SJed Brown PetscFunctionReturn(0); 5195552f7358SJed Brown } 5196552f7358SJed Brown 5197552f7358SJed Brown #undef __FUNCT__ 5198552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5199552f7358SJed Brown /* . off - The global offset of this point */ 5200e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5201a6dfd86eSKarl Rupp { 5202e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5203552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5204552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5205552f7358SJed Brown PetscInt cind = 0, k; 5206552f7358SJed Brown PetscErrorCode ierr; 5207552f7358SJed Brown 5208552f7358SJed Brown PetscFunctionBegin; 5209552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5210552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5211552f7358SJed Brown if (!cdof || setBC) { 5212552f7358SJed Brown if (orientation >= 0) { 5213e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5214552f7358SJed Brown } else { 5215e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5216552f7358SJed Brown } 5217552f7358SJed Brown } else { 5218552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5219552f7358SJed Brown if (orientation >= 0) { 5220552f7358SJed Brown for (k = 0; k < dof; ++k) { 5221552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5222552f7358SJed Brown /* Insert check for returning constrained indices */ 5223e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5224552f7358SJed Brown ++cind; 5225552f7358SJed Brown } else { 5226e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5227552f7358SJed Brown } 5228552f7358SJed Brown } 5229552f7358SJed Brown } else { 5230552f7358SJed Brown for (k = 0; k < dof; ++k) { 5231552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5232552f7358SJed Brown /* Insert check for returning constrained indices */ 5233e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5234552f7358SJed Brown ++cind; 5235552f7358SJed Brown } else { 5236e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5237552f7358SJed Brown } 5238552f7358SJed Brown } 5239552f7358SJed Brown } 5240552f7358SJed Brown } 5241e6ccafaeSMatthew G Knepley *loff += dof; 5242552f7358SJed Brown PetscFunctionReturn(0); 5243552f7358SJed Brown } 5244552f7358SJed Brown 5245552f7358SJed Brown #undef __FUNCT__ 5246552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5247552f7358SJed Brown /* . off - The global offset of this point */ 5248a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5249a6dfd86eSKarl Rupp { 5250552f7358SJed Brown PetscInt numFields, foff, f; 5251552f7358SJed Brown PetscErrorCode ierr; 5252552f7358SJed Brown 5253552f7358SJed Brown PetscFunctionBegin; 5254552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5255552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5256552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5257552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5258552f7358SJed Brown PetscInt cind = 0, k, c; 5259552f7358SJed Brown 5260552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5261552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5262552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5263552f7358SJed Brown if (!cfdof || setBC) { 5264552f7358SJed Brown if (orientation >= 0) { 52650d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5266552f7358SJed Brown } else { 5267552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5268552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5269552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5270552f7358SJed Brown } 5271552f7358SJed Brown } 5272552f7358SJed Brown } 5273552f7358SJed Brown } else { 5274552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5275552f7358SJed Brown if (orientation >= 0) { 5276552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5277552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5278552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5279552f7358SJed Brown ++cind; 5280552f7358SJed Brown } else { 5281552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5282552f7358SJed Brown } 5283552f7358SJed Brown } 5284552f7358SJed Brown } else { 5285552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5286552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5287552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5288552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5289552f7358SJed Brown ++cind; 5290552f7358SJed Brown } else { 5291552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5292552f7358SJed Brown } 5293552f7358SJed Brown } 5294552f7358SJed Brown } 5295552f7358SJed Brown } 5296552f7358SJed Brown } 5297552f7358SJed Brown foff += fdof - cfdof; 5298552f7358SJed Brown foffs[f] += fdof; 5299552f7358SJed Brown } 5300552f7358SJed Brown PetscFunctionReturn(0); 5301552f7358SJed Brown } 5302552f7358SJed Brown 5303552f7358SJed Brown #undef __FUNCT__ 5304*d3d1a6afSToby Isaac #define __FUNCT__ "DMPlexConstraintsModifyMat" 5305*d3d1a6afSToby Isaac static PetscErrorCode DMPlexConstraintsModifyMat(DM dm, PetscSection section, PetscInt numPoints, PetscInt numIndices, const PetscInt points[], const PetscScalar values[], PetscInt *outNumPoints, PetscInt *outNumIndices, PetscInt *outPoints[], PetscScalar *outValues[], PetscInt offsets[]) 5306*d3d1a6afSToby Isaac { 5307*d3d1a6afSToby Isaac Mat cMat; 5308*d3d1a6afSToby Isaac PetscSection aSec, cSec; 5309*d3d1a6afSToby Isaac IS aIS; 5310*d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 5311*d3d1a6afSToby Isaac const PetscInt *anchors; 5312*d3d1a6afSToby Isaac PetscInt numFields, f, p, q, newP; 5313*d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 5314*d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 5315*d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 5316*d3d1a6afSToby Isaac PetscInt newOffsets[32]; 5317*d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 5318*d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 5319*d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 5320*d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 5321*d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 5322*d3d1a6afSToby Isaac PetscErrorCode ierr; 5323*d3d1a6afSToby Isaac 5324*d3d1a6afSToby Isaac PetscFunctionBegin; 5325*d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5326*d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5327*d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5328*d3d1a6afSToby Isaac 5329*d3d1a6afSToby Isaac ierr = DMPlexGetConstraints(dm,&aSec,&aIS);CHKERRQ(ierr); 5330*d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 5331*d3d1a6afSToby Isaac if (aSec) { 5332*d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5333*d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 5334*d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 5335*d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 5336*d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 5337*d3d1a6afSToby Isaac * into the global matrix anyway) */ 5338*d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 5339*d3d1a6afSToby Isaac PetscInt b = points[p]; 5340*d3d1a6afSToby Isaac PetscInt bDof = 0; 5341*d3d1a6afSToby Isaac 5342*d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5343*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 5344*d3d1a6afSToby Isaac } 5345*d3d1a6afSToby Isaac if (bDof) { 5346*d3d1a6afSToby Isaac /* this point is constrained */ 5347*d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 5348*d3d1a6afSToby Isaac PetscInt bOff, q; 5349*d3d1a6afSToby Isaac 5350*d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 5351*d3d1a6afSToby Isaac newNumPoints += bDof; 5352*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 5353*d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5354*d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 5355*d3d1a6afSToby Isaac PetscInt aDof; 5356*d3d1a6afSToby Isaac 5357*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 5358*d3d1a6afSToby Isaac newNumIndices += aDof; 5359*d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 5360*d3d1a6afSToby Isaac PetscInt fDof; 5361*d3d1a6afSToby Isaac 5362*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 5363*d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 5364*d3d1a6afSToby Isaac } 5365*d3d1a6afSToby Isaac } 5366*d3d1a6afSToby Isaac } 5367*d3d1a6afSToby Isaac else { 5368*d3d1a6afSToby Isaac /* this point is not constrained */ 5369*d3d1a6afSToby Isaac newNumPoints++; 5370*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 5371*d3d1a6afSToby Isaac newNumIndices += bDof; 5372*d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 5373*d3d1a6afSToby Isaac PetscInt fDof; 5374*d3d1a6afSToby Isaac 5375*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5376*d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 5377*d3d1a6afSToby Isaac } 5378*d3d1a6afSToby Isaac } 5379*d3d1a6afSToby Isaac } 5380*d3d1a6afSToby Isaac } 5381*d3d1a6afSToby Isaac if (!anyConstrained) { 5382*d3d1a6afSToby Isaac *outNumPoints = 0; 5383*d3d1a6afSToby Isaac *outNumIndices = 0; 5384*d3d1a6afSToby Isaac *outPoints = NULL; 5385*d3d1a6afSToby Isaac *outValues = NULL; 5386*d3d1a6afSToby Isaac if (aSec) { 5387*d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 5388*d3d1a6afSToby Isaac } 5389*d3d1a6afSToby Isaac PetscFunctionReturn(0); 5390*d3d1a6afSToby Isaac } 5391*d3d1a6afSToby Isaac 5392*d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 5393*d3d1a6afSToby Isaac 5394*d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 5395*d3d1a6afSToby Isaac 5396*d3d1a6afSToby Isaac ierr = DMPlexGetConstraintSection(dm, &cSec);CHKERRQ(ierr); 5397*d3d1a6afSToby Isaac ierr = DMPlexGetConstraintMatrix(dm, &cMat);CHKERRQ(ierr); 5398*d3d1a6afSToby Isaac 5399*d3d1a6afSToby Isaac /* output arrays */ 5400*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 5401*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 5402*d3d1a6afSToby Isaac 5403*d3d1a6afSToby Isaac /* workspaces */ 5404*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 5405*d3d1a6afSToby Isaac if (numFields) { 5406*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5407*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 5408*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 5409*d3d1a6afSToby Isaac } 5410*d3d1a6afSToby Isaac } 5411*d3d1a6afSToby Isaac else { 5412*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 5413*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 5414*d3d1a6afSToby Isaac } 5415*d3d1a6afSToby Isaac 5416*d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 5417*d3d1a6afSToby Isaac if (numFields) { 5418*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5419*d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5420*d3d1a6afSToby Isaac PetscInt bDof = 0; 5421*d3d1a6afSToby Isaac 5422*d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5423*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5424*d3d1a6afSToby Isaac } 5425*d3d1a6afSToby Isaac if (bDof) { 5426*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5427*d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 5428*d3d1a6afSToby Isaac 5429*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5430*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 5431*d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5432*d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 5433*d3d1a6afSToby Isaac PetscInt aFDof; 5434*d3d1a6afSToby Isaac 5435*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 5436*d3d1a6afSToby Isaac allFDof += aFDof; 5437*d3d1a6afSToby Isaac } 5438*d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 5439*d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 5440*d3d1a6afSToby Isaac } 5441*d3d1a6afSToby Isaac } 5442*d3d1a6afSToby Isaac else { 5443*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5444*d3d1a6afSToby Isaac PetscInt fDof; 5445*d3d1a6afSToby Isaac 5446*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5447*d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 5448*d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 5449*d3d1a6afSToby Isaac } 5450*d3d1a6afSToby Isaac } 5451*d3d1a6afSToby Isaac } 5452*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5453*d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 5454*d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 5455*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5456*d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 5457*d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 5458*d3d1a6afSToby Isaac } 5459*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 5460*d3d1a6afSToby Isaac } 5461*d3d1a6afSToby Isaac } 5462*d3d1a6afSToby Isaac else { 5463*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5464*d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5465*d3d1a6afSToby Isaac PetscInt bDof = 0; 5466*d3d1a6afSToby Isaac 5467*d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5468*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5469*d3d1a6afSToby Isaac } 5470*d3d1a6afSToby Isaac if (bDof) { 5471*d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 5472*d3d1a6afSToby Isaac 5473*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 5474*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 5475*d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5476*d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 5477*d3d1a6afSToby Isaac 5478*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 5479*d3d1a6afSToby Isaac allDof += aDof; 5480*d3d1a6afSToby Isaac } 5481*d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 5482*d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 5483*d3d1a6afSToby Isaac } 5484*d3d1a6afSToby Isaac else { 5485*d3d1a6afSToby Isaac PetscInt dof; 5486*d3d1a6afSToby Isaac 5487*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 5488*d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 5489*d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 5490*d3d1a6afSToby Isaac } 5491*d3d1a6afSToby Isaac } 5492*d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 5493*d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 5494*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5495*d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 5496*d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 5497*d3d1a6afSToby Isaac } 5498*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 5499*d3d1a6afSToby Isaac } 5500*d3d1a6afSToby Isaac 5501*d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 5502*d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 5503*d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 5504*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 5505*d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 5506*d3d1a6afSToby Isaac if (numFields) { 5507*d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 5508*d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5509*d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 5510*d3d1a6afSToby Isaac PetscInt bDof = 0; 5511*d3d1a6afSToby Isaac 5512*d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5513*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5514*d3d1a6afSToby Isaac } 5515*d3d1a6afSToby Isaac if (bDof) { 5516*d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 5517*d3d1a6afSToby Isaac 5518*d3d1a6afSToby Isaac fStart[0] = 0; 5519*d3d1a6afSToby Isaac fEnd[0] = 0; 5520*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5521*d3d1a6afSToby Isaac PetscInt fDof; 5522*d3d1a6afSToby Isaac 5523*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 5524*d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 5525*d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 5526*d3d1a6afSToby Isaac } 5527*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 5528*d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 5529*d3d1a6afSToby Isaac 5530*d3d1a6afSToby Isaac fAnchorStart[0] = 0; 5531*d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 5532*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5533*d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 5534*d3d1a6afSToby Isaac 5535*d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 5536*d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 5537*d3d1a6afSToby Isaac } 5538*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 5539*d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5540*d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 5541*d3d1a6afSToby Isaac 5542*d3d1a6afSToby Isaac /* we take the orientation of ap into account in the order that we constructed the indices above: the newly added points have no orientation */ 5543*d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 5544*d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 5545*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 5546*d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 5547*d3d1a6afSToby Isaac } 5548*d3d1a6afSToby Isaac newP += bDof; 5549*d3d1a6afSToby Isaac 5550*d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 5551*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5552*d3d1a6afSToby Isaac ierr = MatGetValues(cMat,fEnd[f]-fStart[f],indices + fStart[f],fAnchorEnd[f] - fAnchorStart[f],newIndices + fAnchorStart[f],pointMat[f] + pointMatOffsets[f][p]);CHKERRQ(ierr); 5553*d3d1a6afSToby Isaac } 5554*d3d1a6afSToby Isaac } 5555*d3d1a6afSToby Isaac else { 5556*d3d1a6afSToby Isaac newPoints[2 * newP] = b; 5557*d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 5558*d3d1a6afSToby Isaac newP++; 5559*d3d1a6afSToby Isaac } 5560*d3d1a6afSToby Isaac } 5561*d3d1a6afSToby Isaac } else { 5562*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5563*d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5564*d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 5565*d3d1a6afSToby Isaac PetscInt bDof = 0; 5566*d3d1a6afSToby Isaac 5567*d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5568*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5569*d3d1a6afSToby Isaac } 5570*d3d1a6afSToby Isaac if (bDof) { 5571*d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 5572*d3d1a6afSToby Isaac 5573*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 5574*d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 5575*d3d1a6afSToby Isaac 5576*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 5577*d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5578*d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 5579*d3d1a6afSToby Isaac 5580*d3d1a6afSToby Isaac /* we take the orientation of ap into account in the order that we constructed the indices above: the newly added points have no orientation */ 5581*d3d1a6afSToby Isaac 5582*d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 5583*d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 5584*d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 5585*d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 5586*d3d1a6afSToby Isaac } 5587*d3d1a6afSToby Isaac newP += bDof; 5588*d3d1a6afSToby Isaac 5589*d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 5590*d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 5591*d3d1a6afSToby Isaac } 5592*d3d1a6afSToby Isaac else { 5593*d3d1a6afSToby Isaac newPoints[2 * newP] = b; 5594*d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 5595*d3d1a6afSToby Isaac newP++; 5596*d3d1a6afSToby Isaac } 5597*d3d1a6afSToby Isaac } 5598*d3d1a6afSToby Isaac } 5599*d3d1a6afSToby Isaac 5600*d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 5601*d3d1a6afSToby Isaac /* multiply constraints on the right */ 5602*d3d1a6afSToby Isaac if (numFields) { 5603*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5604*d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 5605*d3d1a6afSToby Isaac 5606*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5607*d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 5608*d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5609*d3d1a6afSToby Isaac PetscInt c, r, k; 5610*d3d1a6afSToby Isaac PetscInt dof; 5611*d3d1a6afSToby Isaac 5612*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 5613*d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 5614*d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 5615*d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 5616*d3d1a6afSToby Isaac 5617*d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5618*d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 5619*d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5620*d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 5621*d3d1a6afSToby Isaac } 5622*d3d1a6afSToby Isaac } 5623*d3d1a6afSToby Isaac } 5624*d3d1a6afSToby Isaac } 5625*d3d1a6afSToby Isaac else { 5626*d3d1a6afSToby Isaac /* copy this column as is */ 5627*d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5628*d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 5629*d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 5630*d3d1a6afSToby Isaac } 5631*d3d1a6afSToby Isaac } 5632*d3d1a6afSToby Isaac } 5633*d3d1a6afSToby Isaac oldOff += dof; 5634*d3d1a6afSToby Isaac } 5635*d3d1a6afSToby Isaac } 5636*d3d1a6afSToby Isaac } 5637*d3d1a6afSToby Isaac else { 5638*d3d1a6afSToby Isaac PetscInt oldOff = 0; 5639*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5640*d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 5641*d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5642*d3d1a6afSToby Isaac PetscInt c, r, k; 5643*d3d1a6afSToby Isaac PetscInt dof; 5644*d3d1a6afSToby Isaac 5645*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 5646*d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 5647*d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 5648*d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 5649*d3d1a6afSToby Isaac 5650*d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5651*d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 5652*d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5653*d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 5654*d3d1a6afSToby Isaac } 5655*d3d1a6afSToby Isaac } 5656*d3d1a6afSToby Isaac } 5657*d3d1a6afSToby Isaac } 5658*d3d1a6afSToby Isaac else { 5659*d3d1a6afSToby Isaac /* copy this column as is */ 5660*d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5661*d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 5662*d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 5663*d3d1a6afSToby Isaac } 5664*d3d1a6afSToby Isaac } 5665*d3d1a6afSToby Isaac } 5666*d3d1a6afSToby Isaac oldOff += dof; 5667*d3d1a6afSToby Isaac } 5668*d3d1a6afSToby Isaac } 5669*d3d1a6afSToby Isaac 5670*d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 5671*d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 5672*d3d1a6afSToby Isaac if (numFields) { 5673*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5674*d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 5675*d3d1a6afSToby Isaac 5676*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5677*d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 5678*d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5679*d3d1a6afSToby Isaac PetscInt c, r, k; 5680*d3d1a6afSToby Isaac PetscInt dof; 5681*d3d1a6afSToby Isaac 5682*d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 5683*d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 5684*d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 5685*d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 5686*d3d1a6afSToby Isaac 5687*d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 5688*d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5689*d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5690*d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 5691*d3d1a6afSToby Isaac } 5692*d3d1a6afSToby Isaac } 5693*d3d1a6afSToby Isaac } 5694*d3d1a6afSToby Isaac } 5695*d3d1a6afSToby Isaac else { 5696*d3d1a6afSToby Isaac /* copy this row as is */ 5697*d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 5698*d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5699*d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 5700*d3d1a6afSToby Isaac } 5701*d3d1a6afSToby Isaac } 5702*d3d1a6afSToby Isaac } 5703*d3d1a6afSToby Isaac oldOff += dof; 5704*d3d1a6afSToby Isaac } 5705*d3d1a6afSToby Isaac } 5706*d3d1a6afSToby Isaac } 5707*d3d1a6afSToby Isaac else { 5708*d3d1a6afSToby Isaac PetscInt oldOff = 0; 5709*d3d1a6afSToby Isaac 5710*d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5711*d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 5712*d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5713*d3d1a6afSToby Isaac PetscInt c, r, k; 5714*d3d1a6afSToby Isaac PetscInt dof; 5715*d3d1a6afSToby Isaac 5716*d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 5717*d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 5718*d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 5719*d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 5720*d3d1a6afSToby Isaac 5721*d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 5722*d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5723*d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5724*d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 5725*d3d1a6afSToby Isaac } 5726*d3d1a6afSToby Isaac } 5727*d3d1a6afSToby Isaac } 5728*d3d1a6afSToby Isaac } 5729*d3d1a6afSToby Isaac else { 5730*d3d1a6afSToby Isaac /* copy this row as is */ 5731*d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 5732*d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5733*d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 5734*d3d1a6afSToby Isaac } 5735*d3d1a6afSToby Isaac } 5736*d3d1a6afSToby Isaac } 5737*d3d1a6afSToby Isaac oldOff += dof; 5738*d3d1a6afSToby Isaac } 5739*d3d1a6afSToby Isaac } 5740*d3d1a6afSToby Isaac 5741*d3d1a6afSToby Isaac /* clean up */ 5742*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 5743*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 5744*d3d1a6afSToby Isaac if (numFields) { 5745*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5746*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 5747*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 5748*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 5749*d3d1a6afSToby Isaac } 5750*d3d1a6afSToby Isaac } 5751*d3d1a6afSToby Isaac else { 5752*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 5753*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 5754*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 5755*d3d1a6afSToby Isaac } 5756*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 5757*d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 5758*d3d1a6afSToby Isaac 5759*d3d1a6afSToby Isaac /* output */ 5760*d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 5761*d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 5762*d3d1a6afSToby Isaac *outPoints = newPoints; 5763*d3d1a6afSToby Isaac *outValues = newValues; 5764*d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5765*d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 5766*d3d1a6afSToby Isaac } 5767*d3d1a6afSToby Isaac PetscFunctionReturn(0); 5768*d3d1a6afSToby Isaac } 5769*d3d1a6afSToby Isaac 5770*d3d1a6afSToby Isaac #undef __FUNCT__ 5771552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 57727f5d1fdeSMatthew G. Knepley /*@C 57737f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 57747f5d1fdeSMatthew G. Knepley 57757f5d1fdeSMatthew G. Knepley Not collective 57767f5d1fdeSMatthew G. Knepley 57777f5d1fdeSMatthew G. Knepley Input Parameters: 57787f5d1fdeSMatthew G. Knepley + dm - The DM 5779ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5780ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 57817f5d1fdeSMatthew G. Knepley . A - The matrix 57827f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 57837f5d1fdeSMatthew G. Knepley . values - The array of values 57847f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 57857f5d1fdeSMatthew G. Knepley 57867f5d1fdeSMatthew G. Knepley Fortran Notes: 57877f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 57887f5d1fdeSMatthew G. Knepley 57897f5d1fdeSMatthew G. Knepley Level: intermediate 57907f5d1fdeSMatthew G. Knepley 57917f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 57927f5d1fdeSMatthew G. Knepley @*/ 57937c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5794552f7358SJed Brown { 5795552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 57961b406b76SMatthew G. Knepley PetscSection clSection; 57971b406b76SMatthew G. Knepley IS clPoints; 5798*d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 57991b406b76SMatthew G. Knepley const PetscInt *clp; 5800552f7358SJed Brown PetscInt *indices; 5801552f7358SJed Brown PetscInt offsets[32]; 5802*d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5803*d3d1a6afSToby Isaac PetscScalar *newValues; 5804552f7358SJed Brown PetscErrorCode ierr; 5805552f7358SJed Brown 5806552f7358SJed Brown PetscFunctionBegin; 5807552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5808ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 58093dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5810ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 58113dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58123dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5813552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 581482f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5815552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 58161b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 58171b406b76SMatthew G. Knepley if (!clPoints) { 5818552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5819552f7358SJed Brown /* Compress out points not in the section */ 5820552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5821552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5822552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5823552f7358SJed Brown points[q*2] = points[p]; 5824552f7358SJed Brown points[q*2+1] = points[p+1]; 5825552f7358SJed Brown ++q; 5826552f7358SJed Brown } 5827552f7358SJed Brown } 5828552f7358SJed Brown numPoints = q; 58291b406b76SMatthew G. Knepley } else { 58301b406b76SMatthew G. Knepley PetscInt dof, off; 58311b406b76SMatthew G. Knepley 58321b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 58331b406b76SMatthew G. Knepley numPoints = dof/2; 58341b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 58351b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 58361b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 58371b406b76SMatthew G. Knepley } 5838552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5839552f7358SJed Brown PetscInt fdof; 5840552f7358SJed Brown 5841552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5842552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5843552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5844552f7358SJed Brown offsets[f+1] += fdof; 5845552f7358SJed Brown } 5846552f7358SJed Brown numIndices += dof; 5847552f7358SJed Brown } 58480d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58490d644c17SKarl Rupp 585082f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5851*d3d1a6afSToby Isaac ierr = DMPlexConstraintsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 5852*d3d1a6afSToby Isaac if (newNumPoints) { 5853*d3d1a6afSToby Isaac if (!clPoints) { 5854*d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5855*d3d1a6afSToby Isaac } else { 5856*d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 5857*d3d1a6afSToby Isaac } 5858*d3d1a6afSToby Isaac numPoints = newNumPoints; 5859*d3d1a6afSToby Isaac numIndices = newNumIndices; 5860*d3d1a6afSToby Isaac points = newPoints; 5861*d3d1a6afSToby Isaac values = newValues; 5862*d3d1a6afSToby Isaac } 5863552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5864552f7358SJed Brown if (numFields) { 5865552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5866552f7358SJed Brown PetscInt o = points[p+1]; 5867552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5868552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5869552f7358SJed Brown } 5870552f7358SJed Brown } else { 5871e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5872552f7358SJed Brown PetscInt o = points[p+1]; 5873552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5874e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5875552f7358SJed Brown } 5876552f7358SJed Brown } 5877b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5878552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5879552f7358SJed Brown if (ierr) { 5880552f7358SJed Brown PetscMPIInt rank; 5881552f7358SJed Brown PetscErrorCode ierr2; 5882552f7358SJed Brown 588382f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 588477a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5885b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 58866a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5887552f7358SJed Brown CHKERRQ(ierr); 5888552f7358SJed Brown } 5889*d3d1a6afSToby Isaac if (newNumPoints) { 5890*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 5891*d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 5892*d3d1a6afSToby Isaac } 5893*d3d1a6afSToby Isaac else { 58941b406b76SMatthew G. Knepley if (!clPoints) { 5895552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 58961b406b76SMatthew G. Knepley } else { 58971b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 58981b406b76SMatthew G. Knepley } 5899*d3d1a6afSToby Isaac } 5900552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5901552f7358SJed Brown PetscFunctionReturn(0); 5902552f7358SJed Brown } 5903552f7358SJed Brown 5904552f7358SJed Brown #undef __FUNCT__ 5905de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5906de41b84cSMatthew 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) 5907de41b84cSMatthew G. Knepley { 5908de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5909de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5910de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5911de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5912de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5913de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 59144ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5915de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5916de41b84cSMatthew G. Knepley 5917de41b84cSMatthew G. Knepley PetscFunctionBegin; 5918de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5919de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5920de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5921de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5922de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5923de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5924de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5925de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5926de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5927de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5928de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5929de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5930de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5931de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5932de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5933de41b84cSMatthew G. Knepley /* Column indices */ 5934de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 59354ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5936de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5937de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5938de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5939de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5940de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5941de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5942de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5943de41b84cSMatthew G. Knepley ++q; 5944de41b84cSMatthew G. Knepley } 5945de41b84cSMatthew G. Knepley } 5946de41b84cSMatthew G. Knepley numCPoints = q; 5947de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5948de41b84cSMatthew G. Knepley PetscInt fdof; 5949de41b84cSMatthew G. Knepley 5950de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 59514ca5e9f5SMatthew G. Knepley if (!dof) continue; 5952de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5953de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5954de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5955de41b84cSMatthew G. Knepley } 5956de41b84cSMatthew G. Knepley numCIndices += dof; 5957de41b84cSMatthew G. Knepley } 5958de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5959de41b84cSMatthew G. Knepley /* Row indices */ 5960de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5961de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 59621ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5963de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5964de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5965de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5966de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5967de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5968de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5969de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 59704ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 59714ca5e9f5SMatthew G. Knepley if (!dof) continue; 59724ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 59734ca5e9f5SMatthew G. Knepley if (s < q) continue; 5974de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5975de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5976de41b84cSMatthew G. Knepley ++q; 5977de41b84cSMatthew G. Knepley } 5978de41b84cSMatthew G. Knepley } 5979de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5980de41b84cSMatthew G. Knepley } 5981de41b84cSMatthew G. Knepley numFPoints = q; 5982de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5983de41b84cSMatthew G. Knepley PetscInt fdof; 5984de41b84cSMatthew G. Knepley 5985de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 59864ca5e9f5SMatthew G. Knepley if (!dof) continue; 5987de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5988de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5989de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5990de41b84cSMatthew G. Knepley } 5991de41b84cSMatthew G. Knepley numFIndices += dof; 5992de41b84cSMatthew G. Knepley } 5993de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5994de41b84cSMatthew G. Knepley 5995de41b84cSMatthew 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); 5996de41b84cSMatthew 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); 5997de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5998de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5999de41b84cSMatthew G. Knepley if (numFields) { 6000de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 6001de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6002de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6003de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 6004de41b84cSMatthew G. Knepley } 6005de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 6006de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6007de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6008de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 6009de41b84cSMatthew G. Knepley } 6010de41b84cSMatthew G. Knepley } else { 6011de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 6012de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6013de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6014de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 6015de41b84cSMatthew G. Knepley } 6016de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 6017de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6018de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6019de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 6020de41b84cSMatthew G. Knepley } 6021de41b84cSMatthew G. Knepley } 6022de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 6023de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 6024de41b84cSMatthew G. Knepley if (ierr) { 6025de41b84cSMatthew G. Knepley PetscMPIInt rank; 6026de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 6027de41b84cSMatthew G. Knepley 6028de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 6029de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 6030de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 6031de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 6032de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 6033de41b84cSMatthew G. Knepley CHKERRQ(ierr); 6034de41b84cSMatthew G. Knepley } 6035549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 6036de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 6037de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6038de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6039de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 6040de41b84cSMatthew G. Knepley } 6041de41b84cSMatthew G. Knepley 6042de41b84cSMatthew G. Knepley #undef __FUNCT__ 60437c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 60447c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 60457c927364SMatthew G. Knepley { 60467c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 60477c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 60487c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 60497c927364SMatthew G. Knepley CellRefiner cellRefiner; 60507c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 60517c927364SMatthew G. Knepley PetscErrorCode ierr; 60527c927364SMatthew G. Knepley 60537c927364SMatthew G. Knepley PetscFunctionBegin; 60547c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 60557c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 60567c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 60577c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 60587c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 60597c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 60607c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 60617c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 60627c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 60637c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 60647c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 60657c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 60667c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 60677c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 60687c927364SMatthew G. Knepley /* Column indices */ 60697c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 60707c927364SMatthew G. Knepley maxFPoints = numCPoints; 60717c927364SMatthew G. Knepley /* Compress out points not in the section */ 60727c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 60737c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 60747c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 60757c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 60767c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 60777c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 60787c927364SMatthew G. Knepley ++q; 60797c927364SMatthew G. Knepley } 60807c927364SMatthew G. Knepley } 60817c927364SMatthew G. Knepley numCPoints = q; 60827c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 60837c927364SMatthew G. Knepley PetscInt fdof; 60847c927364SMatthew G. Knepley 60857c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 60867c927364SMatthew G. Knepley if (!dof) continue; 60877c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 60887c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 60897c927364SMatthew G. Knepley coffsets[f+1] += fdof; 60907c927364SMatthew G. Knepley } 60917c927364SMatthew G. Knepley numCIndices += dof; 60927c927364SMatthew G. Knepley } 60937c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 60947c927364SMatthew G. Knepley /* Row indices */ 60957c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 60967c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 60977c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 60987c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 60997c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 61007c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 61017c927364SMatthew G. Knepley /* Compress out points not in the section */ 61027c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 61037c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 61047c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 61057c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 61067c927364SMatthew G. Knepley if (!dof) continue; 61077c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 61087c927364SMatthew G. Knepley if (s < q) continue; 61097c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 61107c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 61117c927364SMatthew G. Knepley ++q; 61127c927364SMatthew G. Knepley } 61137c927364SMatthew G. Knepley } 61147c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 61157c927364SMatthew G. Knepley } 61167c927364SMatthew G. Knepley numFPoints = q; 61177c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 61187c927364SMatthew G. Knepley PetscInt fdof; 61197c927364SMatthew G. Knepley 61207c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 61217c927364SMatthew G. Knepley if (!dof) continue; 61227c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 61237c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 61247c927364SMatthew G. Knepley foffsets[f+1] += fdof; 61257c927364SMatthew G. Knepley } 61267c927364SMatthew G. Knepley numFIndices += dof; 61277c927364SMatthew G. Knepley } 61287c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 61297c927364SMatthew G. Knepley 61307c927364SMatthew 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); 61317c927364SMatthew 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); 61327c927364SMatthew G. Knepley if (numFields) { 61337c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 61347c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 61357c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 61367c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 61377c927364SMatthew G. Knepley } 61387c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 61397c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 61407c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 61417c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 61427c927364SMatthew G. Knepley } 61437c927364SMatthew G. Knepley } else { 61447c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 61457c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 61467c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 61477c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 61487c927364SMatthew G. Knepley } 61497c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 61507c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 61517c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 61527c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 61537c927364SMatthew G. Knepley } 61547c927364SMatthew G. Knepley } 61557c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 61567c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 61577c927364SMatthew G. Knepley PetscFunctionReturn(0); 61587c927364SMatthew G. Knepley } 61597c927364SMatthew G. Knepley 61607c927364SMatthew G. Knepley #undef __FUNCT__ 6161770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 6162f96281f8SMatthew G. Knepley /*@ 6163f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 6164f96281f8SMatthew G. Knepley 6165f96281f8SMatthew G. Knepley Input Parameter: 6166f96281f8SMatthew G. Knepley . dm - The DMPlex object 6167f96281f8SMatthew G. Knepley 6168f96281f8SMatthew G. Knepley Output Parameters: 6169f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 6170dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 6171dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 6172dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 6173f96281f8SMatthew G. Knepley 6174f96281f8SMatthew G. Knepley Level: developer 6175f96281f8SMatthew G. Knepley 6176dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 6177f96281f8SMatthew G. Knepley @*/ 6178770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 6179552f7358SJed Brown { 6180552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6181770b213bSMatthew G Knepley PetscInt dim; 6182770b213bSMatthew G Knepley PetscErrorCode ierr; 6183552f7358SJed Brown 6184552f7358SJed Brown PetscFunctionBegin; 6185552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6186c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6187770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 6188770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 6189770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 6190770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 6191552f7358SJed Brown PetscFunctionReturn(0); 6192552f7358SJed Brown } 6193552f7358SJed Brown 6194552f7358SJed Brown #undef __FUNCT__ 6195770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 6196dc5a3409SMatthew G. Knepley /*@ 6197dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 6198dc5a3409SMatthew G. Knepley 6199dc5a3409SMatthew G. Knepley Input Parameters: 6200dc5a3409SMatthew G. Knepley . dm - The DMPlex object 6201dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 6202dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 6203dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 6204dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 6205dc5a3409SMatthew G. Knepley 6206dc5a3409SMatthew G. Knepley Level: developer 6207dc5a3409SMatthew G. Knepley 6208dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 6209dc5a3409SMatthew G. Knepley @*/ 6210770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 6211552f7358SJed Brown { 6212552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6213770b213bSMatthew G Knepley PetscInt dim; 6214770b213bSMatthew G Knepley PetscErrorCode ierr; 6215552f7358SJed Brown 6216552f7358SJed Brown PetscFunctionBegin; 6217552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6218c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6219770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 6220770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 6221770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 6222770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 6223552f7358SJed Brown PetscFunctionReturn(0); 6224552f7358SJed Brown } 6225552f7358SJed Brown 6226552f7358SJed Brown #undef __FUNCT__ 6227552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 6228552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 6229552f7358SJed Brown { 6230552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6231552f7358SJed Brown 6232552f7358SJed Brown PetscFunctionBegin; 6233552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6234552f7358SJed Brown PetscValidPointer(cellHeight, 2); 6235552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 6236552f7358SJed Brown PetscFunctionReturn(0); 6237552f7358SJed Brown } 6238552f7358SJed Brown 6239552f7358SJed Brown #undef __FUNCT__ 6240552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 6241552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 6242552f7358SJed Brown { 6243552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6244552f7358SJed Brown 6245552f7358SJed Brown PetscFunctionBegin; 6246552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6247552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 6248552f7358SJed Brown PetscFunctionReturn(0); 6249552f7358SJed Brown } 6250552f7358SJed Brown 6251552f7358SJed Brown #undef __FUNCT__ 6252552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 6253552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 6254ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 6255552f7358SJed Brown { 6256552f7358SJed Brown PetscSection section, globalSection; 6257552f7358SJed Brown PetscInt *numbers, p; 6258552f7358SJed Brown PetscErrorCode ierr; 6259552f7358SJed Brown 6260552f7358SJed Brown PetscFunctionBegin; 626182f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 6262552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 6263552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6264552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 6265552f7358SJed Brown } 6266552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 6267552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 6268785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 6269552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6270552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 6271ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 6272ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 6273552f7358SJed Brown } 627482f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 6275ef48cebcSMatthew G. Knepley if (globalSize) { 6276ef48cebcSMatthew G. Knepley PetscLayout layout; 6277ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 6278ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 6279ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 6280ef48cebcSMatthew G. Knepley } 6281552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6282552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 6283552f7358SJed Brown PetscFunctionReturn(0); 6284552f7358SJed Brown } 6285552f7358SJed Brown 6286552f7358SJed Brown #undef __FUNCT__ 6287552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 6288552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 6289552f7358SJed Brown { 6290552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6291552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 6292552f7358SJed Brown PetscErrorCode ierr; 6293552f7358SJed Brown 6294552f7358SJed Brown PetscFunctionBegin; 6295552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6296552f7358SJed Brown if (!mesh->globalCellNumbers) { 6297552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6298552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 62990298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 63000d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6301ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6302552f7358SJed Brown } 6303552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6304552f7358SJed Brown PetscFunctionReturn(0); 6305552f7358SJed Brown } 6306552f7358SJed Brown 6307552f7358SJed Brown #undef __FUNCT__ 6308552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6309552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6310552f7358SJed Brown { 6311552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6312552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6313552f7358SJed Brown PetscErrorCode ierr; 6314552f7358SJed Brown 6315552f7358SJed Brown PetscFunctionBegin; 6316552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6317552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6318552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 63190298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 63200d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6321ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6322552f7358SJed Brown } 6323552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6324552f7358SJed Brown PetscFunctionReturn(0); 6325552f7358SJed Brown } 6326552f7358SJed Brown 6327ef48cebcSMatthew G. Knepley #undef __FUNCT__ 6328ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 6329ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 6330ef48cebcSMatthew G. Knepley { 6331ef48cebcSMatthew G. Knepley IS nums[4]; 6332ef48cebcSMatthew G. Knepley PetscInt depths[4]; 6333ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 6334ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 6335ef48cebcSMatthew G. Knepley 6336ef48cebcSMatthew G. Knepley PetscFunctionBegin; 6337ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6338ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6339ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 6340ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 6341ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 6342ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 6343ef48cebcSMatthew G. Knepley 6344ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 6345ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 6346ef48cebcSMatthew G. Knepley shift += gsize; 6347ef48cebcSMatthew G. Knepley } 6348ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 6349ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 6350ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 6351ef48cebcSMatthew G. Knepley } 6352ef48cebcSMatthew G. Knepley 6353552f7358SJed Brown 6354552f7358SJed Brown #undef __FUNCT__ 6355552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6356552f7358SJed Brown /*@C 6357552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6358552f7358SJed Brown the local section and an SF describing the section point overlap. 6359552f7358SJed Brown 6360552f7358SJed Brown Input Parameters: 6361552f7358SJed Brown + s - The PetscSection for the local field layout 6362552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6363552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6364552f7358SJed Brown . label - The label specifying the points 6365552f7358SJed Brown - labelValue - The label stratum specifying the points 6366552f7358SJed Brown 6367552f7358SJed Brown Output Parameter: 6368552f7358SJed Brown . gsection - The PetscSection for the global field layout 6369552f7358SJed Brown 6370552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6371552f7358SJed Brown 6372552f7358SJed Brown Level: developer 6373552f7358SJed Brown 6374552f7358SJed Brown .seealso: PetscSectionCreate() 6375552f7358SJed Brown @*/ 6376552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6377552f7358SJed Brown { 63787ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6379552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6380552f7358SJed Brown PetscErrorCode ierr; 6381552f7358SJed Brown 6382552f7358SJed Brown PetscFunctionBegin; 63834c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 6384552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6385552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 63867ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 63877ec39499SMatthew G. Knepley if (nroots >= 0) { 63887ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 63891795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 63907ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 63911795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 63927ec39499SMatthew G. Knepley } else { 63937ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 63947ec39499SMatthew G. Knepley } 63957ec39499SMatthew G. Knepley } 6396552f7358SJed Brown /* Mark ghost points with negative dof */ 6397552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6398552f7358SJed Brown PetscInt value; 6399552f7358SJed Brown 6400552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6401552f7358SJed Brown if (value != labelValue) continue; 6402552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6403552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6404552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6405552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 64067ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6407552f7358SJed Brown } 6408552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6409552f7358SJed Brown if (nroots >= 0) { 64107ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64117ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6412552f7358SJed Brown if (nroots > pEnd-pStart) { 64137ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6414552f7358SJed Brown } 6415552f7358SJed Brown } 6416552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6417552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6418552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6419552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6420552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6421552f7358SJed Brown } 64224c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 6423552f7358SJed Brown globalOff -= off; 6424552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6425552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 64267ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6427552f7358SJed Brown } 6428552f7358SJed Brown /* Put in negative offsets for ghost points */ 6429552f7358SJed Brown if (nroots >= 0) { 64307ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64317ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6432552f7358SJed Brown if (nroots > pEnd-pStart) { 64337ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6434552f7358SJed Brown } 6435552f7358SJed Brown } 64367ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6437552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6438552f7358SJed Brown PetscFunctionReturn(0); 6439552f7358SJed Brown } 6440ca8062c8SMatthew G. Knepley 6441ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6442ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6443ca8062c8SMatthew G. Knepley /*@ 6444ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6445ca8062c8SMatthew G. Knepley 6446ca8062c8SMatthew G. Knepley Input Parameters: 6447ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6448ca8062c8SMatthew G. Knepley 6449ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6450ca8062c8SMatthew G. Knepley 6451ca8062c8SMatthew G. Knepley Level: developer 6452ca8062c8SMatthew G. Knepley 64539bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6454ca8062c8SMatthew G. Knepley @*/ 6455ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6456ca8062c8SMatthew G. Knepley { 6457ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6458ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6459ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6460ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6461ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6462ca8062c8SMatthew G. Knepley 6463ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6464ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6465ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6466ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6467ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6468ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6469ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6470ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6471ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6472ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 647342e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 647442e66dfaSMatthew G. Knepley PetscInt d; 647542e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 647642e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 647742e66dfaSMatthew G. Knepley } 6478ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6479ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6480ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6481ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6482ca8062c8SMatthew G. Knepley } 648342e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 6484ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6485ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6486ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6487ca8062c8SMatthew G. Knepley } 6488ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6489ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6490ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6491ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6492ca8062c8SMatthew G. Knepley } 6493ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 649442e66dfaSMatthew G. Knepley if (dup) { 649542e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 649642e66dfaSMatthew G. Knepley } else { 6497ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6498ca8062c8SMatthew G. Knepley } 6499ca8062c8SMatthew G. Knepley } 650042e66dfaSMatthew G. Knepley } 6501ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6502ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6503ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6504ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6505ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6506ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6507ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6508ca8062c8SMatthew G. Knepley } 6509ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6510ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6511ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6512ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6513ca8062c8SMatthew G. Knepley } 6514ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6515ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6516ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6517ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6518ca8062c8SMatthew G. Knepley } 6519ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6520ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6521ca8062c8SMatthew G. Knepley } 6522ca8062c8SMatthew G. Knepley } 6523ca8062c8SMatthew G. Knepley } 6524ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6525ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6526ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6527ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6528ca8062c8SMatthew G. Knepley } 6529ca8062c8SMatthew G. Knepley 6530ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6531ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6532ca8062c8SMatthew G. Knepley /*@ 6533ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6534ca8062c8SMatthew G. Knepley 6535ca8062c8SMatthew G. Knepley Input Parameters: 6536ca8062c8SMatthew G. Knepley + dm - The DMPlex object 653758723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 653858723a97SMatthew G. Knepley - cellHeight - Normally 0 6539ca8062c8SMatthew G. Knepley 6540ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6541ca8062c8SMatthew G. Knepley 6542ca8062c8SMatthew G. Knepley Level: developer 6543ca8062c8SMatthew G. Knepley 65449bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6545ca8062c8SMatthew G. Knepley @*/ 654658723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6547ca8062c8SMatthew G. Knepley { 654842363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6549ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6550ca8062c8SMatthew G. Knepley 6551ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6552ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6553c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6554ca8062c8SMatthew G. Knepley switch (dim) { 655542363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 655642363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 655742363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6558ca8062c8SMatthew G. Knepley default: 6559ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6560ca8062c8SMatthew G. Knepley } 656158723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 656258723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6563ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6564ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6565ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 656658723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 656758723a97SMatthew G. Knepley 656858723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 656958723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 657058723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 657158723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 657258723a97SMatthew G. Knepley } 657358723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6574ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6575ca8062c8SMatthew G. Knepley } 657642363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 657742363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 657842363296SMatthew G. Knepley 657942363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 658042363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 658142363296SMatthew G. Knepley const PetscInt p = closure[cl]; 658242363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 658342363296SMatthew G. Knepley } 658442363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 658542363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 658642363296SMatthew G. Knepley } 6587ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6588ca8062c8SMatthew G. Knepley } 65899bf0dad6SMatthew G. Knepley 65909bf0dad6SMatthew G. Knepley #undef __FUNCT__ 65919bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 65929bf0dad6SMatthew G. Knepley /*@ 65939bf0dad6SMatthew 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 65949bf0dad6SMatthew G. Knepley 65959bf0dad6SMatthew G. Knepley Input Parameters: 65969bf0dad6SMatthew G. Knepley + dm - The DMPlex object 65979bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 65989bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 65999bf0dad6SMatthew G. Knepley 66009bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 66019bf0dad6SMatthew G. Knepley 66029bf0dad6SMatthew G. Knepley Level: developer 66039bf0dad6SMatthew G. Knepley 66049bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 66059bf0dad6SMatthew G. Knepley @*/ 66069bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 66079bf0dad6SMatthew G. Knepley { 66083554e41dSMatthew G. Knepley PetscInt pMax[4]; 66093554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 66109bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 66119bf0dad6SMatthew G. Knepley 66129bf0dad6SMatthew G. Knepley PetscFunctionBegin; 66139bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6614c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 66159bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 661625abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 66173554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 66183554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 66193554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 66209bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 66219bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 66229bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 66239bf0dad6SMatthew G. Knepley 662425abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 66259bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 66269bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 66279bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 66289bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66299bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 66309bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 66319bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 66329bf0dad6SMatthew G. Knepley } 66333554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66349bf0dad6SMatthew 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); 66359bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 66369bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 66379bf0dad6SMatthew G. Knepley 66389bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66399bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 66409bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 66419bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 66429bf0dad6SMatthew G. Knepley } 6643e003ed69SMatthew 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); 66449bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6645e003ed69SMatthew 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]); 66469bf0dad6SMatthew G. Knepley } 66479bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66489bf0dad6SMatthew G. Knepley } 66499bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66509bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66519bf0dad6SMatthew G. Knepley } 66523554e41dSMatthew G. Knepley } 6653552f7358SJed Brown PetscFunctionReturn(0); 6654552f7358SJed Brown } 66553913d7c8SMatthew G. Knepley 66563913d7c8SMatthew G. Knepley #undef __FUNCT__ 6657bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6658bceba477SMatthew G. Knepley /* Pointwise interpolation 6659bceba477SMatthew G. Knepley Just code FEM for now 6660bceba477SMatthew G. Knepley u^f = I u^c 66614ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 66624ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 66634ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6664bceba477SMatthew G. Knepley */ 6665bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6666bceba477SMatthew G. Knepley { 6667bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6668bceba477SMatthew G. Knepley PetscInt m, n; 6669a063dac3SMatthew G. Knepley void *ctx; 6670bceba477SMatthew G. Knepley PetscErrorCode ierr; 6671bceba477SMatthew G. Knepley 6672bceba477SMatthew G. Knepley PetscFunctionBegin; 6673bceba477SMatthew G. Knepley /* 6674bceba477SMatthew G. Knepley Loop over coarse cells 6675bceba477SMatthew G. Knepley Loop over coarse basis functions 6676bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6677bceba477SMatthew G. Knepley Loop over fine dual basis functions 6678bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6679bceba477SMatthew G. Knepley Sum 6680bceba477SMatthew G. Knepley Update local element matrix 6681bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6682bceba477SMatthew G. Knepley 6683bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6684bceba477SMatthew G. Knepley */ 6685bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6686bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6687bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6688bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6689bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6690bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6691bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6692bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6693a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6694a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 66955d1c2e58SMatthew G. Knepley /* Use naive scaling */ 66965d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6697a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6698a063dac3SMatthew G. Knepley } 6699bceba477SMatthew G. Knepley 6700a063dac3SMatthew G. Knepley #undef __FUNCT__ 6701a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6702a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6703a063dac3SMatthew G. Knepley { 670490748bafSMatthew G. Knepley PetscErrorCode ierr; 670590748bafSMatthew G. Knepley 6706a063dac3SMatthew G. Knepley PetscFunctionBegin; 67077c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6708bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6709bceba477SMatthew G. Knepley } 6710bceba477SMatthew G. Knepley 6711bceba477SMatthew G. Knepley #undef __FUNCT__ 6712fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6713fd59a867SMatthew G. Knepley /* Pointwise interpolation 6714fd59a867SMatthew G. Knepley Just code FEM for now 6715fd59a867SMatthew G. Knepley u^f = I u^c 6716fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6717fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6718fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6719fd59a867SMatthew G. Knepley */ 6720fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6721fd59a867SMatthew G. Knepley { 6722fd59a867SMatthew G. Knepley PetscSection section; 6723fd59a867SMatthew G. Knepley IS *bcPoints; 6724286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6725286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6726fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6727fd59a867SMatthew G. Knepley 6728fd59a867SMatthew G. Knepley PetscFunctionBegin; 6729fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6730286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6731c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6732fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6733fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6734fd59a867SMatthew G. Knepley PetscBool isEssential; 673563d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6736fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6737fd59a867SMatthew G. Knepley } 6738fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6739fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6740fd59a867SMatthew G. Knepley const char *bdLabel; 6741fd59a867SMatthew G. Knepley DMLabel label; 6742fd59a867SMatthew G. Knepley const PetscInt *values; 67437391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6744c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6745fd59a867SMatthew G. Knepley 674663d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6747fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6748fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 67497391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 67507391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 67517391c1cbSMatthew G. Knepley const char *bdname; 67522f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 67537391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 67547391c1cbSMatthew G. Knepley if (duplicate) break; 67557391c1cbSMatthew G. Knepley } 67567391c1cbSMatthew G. Knepley if (!duplicate) { 6757fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 675832720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 67597391c1cbSMatthew G. Knepley } 676093a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6761fd59a867SMatthew G. Knepley if (isEssential) { 676293a5981aSMatthew G. Knepley IS tmp; 676393a5981aSMatthew G. Knepley PetscInt *newidx; 676493a5981aSMatthew G. Knepley const PetscInt *idx; 676593a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 676693a5981aSMatthew G. Knepley 6767fd59a867SMatthew G. Knepley bcFields[bc] = field; 676893a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 676993a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 677093a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 677193a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 677293a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 677393a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 677493a5981aSMatthew G. Knepley newn = 0; 677593a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 677693a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 677793a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 677893a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6779fd59a867SMatthew G. Knepley } 6780fd59a867SMatthew G. Knepley } 6781fd59a867SMatthew G. Knepley /* Handle discretization */ 6782fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6783286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6784fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6785fd59a867SMatthew G. Knepley PetscFE fe; 6786286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6787fd59a867SMatthew G. Knepley PetscInt d; 6788fd59a867SMatthew G. Knepley 678918abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6790fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6791286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6792286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6793fd59a867SMatthew G. Knepley } 6794286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6795286d8613SMatthew G. Knepley PetscInt d; 6796286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6797286d8613SMatthew 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."); 6798286d8613SMatthew G. Knepley } 6799286d8613SMatthew G. Knepley } 6800f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6801fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6802fd59a867SMatthew G. Knepley PetscFE fe; 6803fd59a867SMatthew G. Knepley const char *name; 680418abd763SMatthew G. Knepley 680518abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6806fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6807fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6808fd59a867SMatthew G. Knepley } 6809fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6810fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6811fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6812fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6813286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6814bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6815bceba477SMatthew G. Knepley } 6816bceba477SMatthew G. Knepley 6817bceba477SMatthew G. Knepley #undef __FUNCT__ 68183913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 68193913d7c8SMatthew G. Knepley /*@ 68203913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 68213913d7c8SMatthew G. Knepley 68223913d7c8SMatthew G. Knepley Input Parameter: 68233913d7c8SMatthew G. Knepley . dm - The DMPlex object 68243913d7c8SMatthew G. Knepley 68253913d7c8SMatthew G. Knepley Output Parameter: 68263913d7c8SMatthew G. Knepley . cdm - The coarse DM 68273913d7c8SMatthew G. Knepley 68283913d7c8SMatthew G. Knepley Level: intermediate 68293913d7c8SMatthew G. Knepley 68303913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 68313913d7c8SMatthew G. Knepley @*/ 68323913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 68333913d7c8SMatthew G. Knepley { 68343913d7c8SMatthew G. Knepley PetscFunctionBegin; 68353913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68363913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 68373913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 68383913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68393913d7c8SMatthew G. Knepley } 68403913d7c8SMatthew G. Knepley 68413913d7c8SMatthew G. Knepley #undef __FUNCT__ 68423913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 68433913d7c8SMatthew G. Knepley /*@ 68443913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 68453913d7c8SMatthew G. Knepley 68463913d7c8SMatthew G. Knepley Input Parameters: 68473913d7c8SMatthew G. Knepley + dm - The DMPlex object 68483913d7c8SMatthew G. Knepley - cdm - The coarse DM 68493913d7c8SMatthew G. Knepley 68503913d7c8SMatthew G. Knepley Level: intermediate 68513913d7c8SMatthew G. Knepley 68523913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 68533913d7c8SMatthew G. Knepley @*/ 68543913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 68553913d7c8SMatthew G. Knepley { 68563913d7c8SMatthew G. Knepley DM_Plex *mesh; 68573913d7c8SMatthew G. Knepley PetscErrorCode ierr; 68583913d7c8SMatthew G. Knepley 68593913d7c8SMatthew G. Knepley PetscFunctionBegin; 68603913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68613913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 68623913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 68633913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 68643913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 68653913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 68663913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68673913d7c8SMatthew G. Knepley } 6868a68b90caSToby Isaac 6869a68b90caSToby Isaac /* constraints */ 6870a68b90caSToby Isaac #undef __FUNCT__ 6871a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraints" 6872a68b90caSToby Isaac /*@ 6873a68b90caSToby Isaac DMPlexGetConstraints - Get the layout of the local point-to-point constraints 6874a68b90caSToby Isaac 6875a68b90caSToby Isaac not collective 6876a68b90caSToby Isaac 6877a68b90caSToby Isaac Input Parameters: 6878a68b90caSToby Isaac . dm - The DMPlex object 6879a68b90caSToby Isaac 6880a68b90caSToby Isaac Output Parameters: 6881a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 6882a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 6883a68b90caSToby Isaac 6884a68b90caSToby Isaac 6885a68b90caSToby Isaac Level: intermediate 6886a68b90caSToby Isaac 6887a68b90caSToby Isaac .seealso: DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6888a68b90caSToby Isaac @*/ 6889a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraints(DM dm, PetscSection *anchorSection, IS *anchorIS) 6890a68b90caSToby Isaac { 6891a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6892a68b90caSToby Isaac 6893a68b90caSToby Isaac PetscFunctionBegin; 6894a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6895a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 6896a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 6897a68b90caSToby Isaac PetscFunctionReturn(0); 6898a68b90caSToby Isaac } 6899a68b90caSToby Isaac 6900a68b90caSToby Isaac #undef __FUNCT__ 6901a68b90caSToby Isaac #define __FUNCT__ "DMGlobalToLocalHook_Plex_constraints" 6902a68b90caSToby Isaac static PetscErrorCode DMGlobalToLocalHook_Plex_constraints(DM dm, Vec g, InsertMode mode, Vec l, void *ctx) 6903a68b90caSToby Isaac { 6904a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6905a68b90caSToby Isaac Mat cMat; 6906a68b90caSToby Isaac Vec cVec; 6907a68b90caSToby Isaac PetscSection section, cSec; 6908a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof; 6909a68b90caSToby Isaac PetscErrorCode ierr; 6910a68b90caSToby Isaac 6911a68b90caSToby Isaac PetscFunctionBegin; 6912a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6913a68b90caSToby Isaac cMat = plex->constraintMat; 6914a68b90caSToby Isaac if (cMat && (mode == INSERT_VALUES || mode == INSERT_ALL_VALUES || mode == INSERT_BC_VALUES)) { 6915a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6916a68b90caSToby Isaac cSec = plex->constraintSection; 6917a68b90caSToby Isaac ierr = MatGetVecs(cMat,NULL,&cVec);CHKERRQ(ierr); 6918a68b90caSToby Isaac ierr = MatMult(cMat,l,cVec);CHKERRQ(ierr); 6919a68b90caSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 6920a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6921a68b90caSToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 6922a68b90caSToby Isaac if (dof) { 6923a68b90caSToby Isaac PetscScalar *vals; 6924a68b90caSToby Isaac ierr = VecGetValuesSection(cVec,cSec,p,&vals);CHKERRQ(ierr); 6925a68b90caSToby Isaac ierr = VecSetValuesSection(l,section,p,vals,INSERT_ALL_VALUES);CHKERRQ(ierr); 6926a68b90caSToby Isaac } 6927a68b90caSToby Isaac } 6928a68b90caSToby Isaac ierr = VecDestroy(&cVec);CHKERRQ(ierr); 6929a68b90caSToby Isaac } 6930a68b90caSToby Isaac PetscFunctionReturn(0); 6931a68b90caSToby Isaac } 6932a68b90caSToby Isaac 6933a68b90caSToby Isaac #undef __FUNCT__ 6934a68b90caSToby Isaac #define __FUNCT__ "DMLocalToGlobalHook_Plex_constraints" 6935a68b90caSToby Isaac static PetscErrorCode DMLocalToGlobalHook_Plex_constraints(DM dm, Vec l, InsertMode mode, Vec g, void *ctx) 6936a68b90caSToby Isaac { 6937a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6938a68b90caSToby Isaac Mat cMat; 6939a68b90caSToby Isaac Vec cVec; 6940a68b90caSToby Isaac PetscSection section, cSec; 6941a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof; 6942a68b90caSToby Isaac PetscErrorCode ierr; 6943a68b90caSToby Isaac 6944a68b90caSToby Isaac PetscFunctionBegin; 6945a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6946a68b90caSToby Isaac cMat = plex->constraintMat; 6947a68b90caSToby Isaac if (cMat && (mode == ADD_VALUES || mode == ADD_ALL_VALUES || mode == ADD_BC_VALUES)) { 6948a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6949a68b90caSToby Isaac cSec = plex->constraintSection; 6950a68b90caSToby Isaac ierr = MatGetVecs(cMat,NULL,&cVec);CHKERRQ(ierr); 6951a68b90caSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 6952a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6953a68b90caSToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 6954a68b90caSToby Isaac if (dof) { 6955a68b90caSToby Isaac PetscInt d; 6956a68b90caSToby Isaac PetscScalar *vals; 6957a68b90caSToby Isaac ierr = VecGetValuesSection(l,section,p,&vals);CHKERRQ(ierr); 6958a68b90caSToby Isaac ierr = VecSetValuesSection(cVec,cSec,p,vals,mode);CHKERRQ(ierr); 6959a68b90caSToby Isaac /* for this to be the true transpose, we have to zero the values that 6960a68b90caSToby Isaac * we just extracted */ 6961a68b90caSToby Isaac for (d = 0; d < dof; d++) { 6962a68b90caSToby Isaac vals[d] = 0.; 6963a68b90caSToby Isaac } 6964a68b90caSToby Isaac } 6965a68b90caSToby Isaac } 6966a68b90caSToby Isaac ierr = MatMultTransposeAdd(cMat,cVec,l,l);CHKERRQ(ierr); 6967a68b90caSToby Isaac ierr = VecDestroy(&cVec);CHKERRQ(ierr); 6968a68b90caSToby Isaac } 6969a68b90caSToby Isaac PetscFunctionReturn(0); 6970a68b90caSToby Isaac } 6971a68b90caSToby Isaac 6972a68b90caSToby Isaac #undef __FUNCT__ 6973a68b90caSToby Isaac #define __FUNCT__ "DMPlexSetConstraints" 6974a68b90caSToby Isaac /*@ 6975a68b90caSToby Isaac DMPlexSetConstraints - Set the layout of the local point-to-point constraints. Unlike boundary conditions, when a 6976a68b90caSToby Isaac point's degrees of freedom in a section are constrained to an outside value, the point-to-point constraints set a 6977a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 6978a68b90caSToby Isaac 6979a68b90caSToby Isaac After specifying the layout of constraints with DMPlexSetConstraints(), one specifies the constraints by calling 6980a68b90caSToby Isaac DMPlexGetConstraintMatrix() and filling in the entries. This matrix will be used fill in the constrained values 6981a68b90caSToby Isaac from the anchor values in local vectors in DMGlobalToLocalEnd() with mode = INSERT_VALUES, and its transpose is used 6982a68b90caSToby Isaac to sum constrained values back to their anchor values in DMLocalToGlobalBegin() with mode = ADD_VALUES. 6983a68b90caSToby Isaac 6984a68b90caSToby Isaac logically collective 6985a68b90caSToby Isaac 6986a68b90caSToby Isaac Input Parameters: 6987a68b90caSToby Isaac + dm - The DMPlex object 6988a68b90caSToby Isaac . anchorSection - The section that describes the mapping from constrained points to the anchor points listed in anchorIS. 6989a68b90caSToby Isaac - anchorIS - The list of all anchor points. 6990a68b90caSToby Isaac 6991a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 6992a68b90caSToby Isaac 6993a68b90caSToby Isaac 6994a68b90caSToby Isaac Level: intermediate 6995a68b90caSToby Isaac 6996a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6997a68b90caSToby Isaac @*/ 6998a68b90caSToby Isaac PetscErrorCode DMPlexSetConstraints(DM dm, PetscSection anchorSection, IS anchorIS) 6999a68b90caSToby Isaac { 7000a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7001a68b90caSToby Isaac PetscErrorCode ierr; 7002a68b90caSToby Isaac 7003a68b90caSToby Isaac PetscFunctionBegin; 7004a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7005a68b90caSToby Isaac 7006a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 7007a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 7008a68b90caSToby Isaac plex->anchorSection = anchorSection; 7009a68b90caSToby Isaac 7010a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 7011a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 7012a68b90caSToby Isaac plex->anchorIS = anchorIS; 7013a68b90caSToby Isaac 7014a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 7015a68b90caSToby Isaac if (anchorIS && anchorSection) { 7016a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 7017a68b90caSToby Isaac const PetscInt *anchors; 7018a68b90caSToby Isaac 7019a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 7020a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 7021a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 7022a68b90caSToby Isaac for (a = 0; a < size; a++) { 7023a68b90caSToby Isaac PetscInt p; 7024a68b90caSToby Isaac 7025a68b90caSToby Isaac p = anchors[a]; 7026a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 7027a68b90caSToby Isaac PetscInt dof; 7028a68b90caSToby Isaac 7029a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 7030a68b90caSToby Isaac if (dof) { 7031a68b90caSToby Isaac PetscErrorCode ierr2; 7032a68b90caSToby Isaac 7033a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 7034a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 7035a68b90caSToby Isaac } 7036a68b90caSToby Isaac } 7037a68b90caSToby Isaac } 7038a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 7039a68b90caSToby Isaac } 7040a68b90caSToby Isaac #endif 7041a68b90caSToby Isaac 7042a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->constraintSection);CHKERRQ(ierr); 7043a68b90caSToby Isaac ierr = MatDestroy(&plex->constraintMat);CHKERRQ(ierr); 7044a68b90caSToby Isaac 7045a68b90caSToby Isaac if (anchorSection) { 7046a68b90caSToby Isaac /* add the constraint hooks if they have not already been added */ 7047a68b90caSToby Isaac { 7048a68b90caSToby Isaac DMGlobalToLocalHookLink link,next=NULL; 7049a68b90caSToby Isaac for (link=dm->gtolhook; link; link=next) { 7050a68b90caSToby Isaac next = link->next; 7051a68b90caSToby Isaac if (link->endhook == DMGlobalToLocalHook_Plex_constraints) { 7052a68b90caSToby Isaac break; 7053a68b90caSToby Isaac } 7054a68b90caSToby Isaac } 7055a68b90caSToby Isaac if (!link) { 7056a68b90caSToby Isaac ierr = DMGlobalToLocalHookAdd(dm,NULL,DMGlobalToLocalHook_Plex_constraints,NULL);CHKERRQ(ierr); 7057a68b90caSToby Isaac } 7058a68b90caSToby Isaac } 7059a68b90caSToby Isaac { 7060a68b90caSToby Isaac DMLocalToGlobalHookLink link,next=NULL; 7061a68b90caSToby Isaac for (link=dm->ltoghook; link; link=next) { 7062a68b90caSToby Isaac next = link->next; 7063a68b90caSToby Isaac if (link->beginhook == DMLocalToGlobalHook_Plex_constraints) { 7064a68b90caSToby Isaac break; 7065a68b90caSToby Isaac } 7066a68b90caSToby Isaac } 7067a68b90caSToby Isaac if (!link) { 7068a68b90caSToby Isaac ierr = DMLocalToGlobalHookAdd(dm,DMLocalToGlobalHook_Plex_constraints,NULL,NULL);CHKERRQ(ierr); 7069a68b90caSToby Isaac } 7070a68b90caSToby Isaac } 7071a68b90caSToby Isaac } 7072a68b90caSToby Isaac else { 7073a68b90caSToby Isaac /* remove the constraint hooks if they were added before */ 7074a68b90caSToby Isaac { 7075a68b90caSToby Isaac DMGlobalToLocalHookLink prev=NULL,link,next=NULL; 7076a68b90caSToby Isaac for (link=dm->gtolhook; link; link=next) { 7077a68b90caSToby Isaac next = link->next; 7078a68b90caSToby Isaac if (link->endhook == DMGlobalToLocalHook_Plex_constraints) { 7079a68b90caSToby Isaac break; 7080a68b90caSToby Isaac } 7081a68b90caSToby Isaac } 7082a68b90caSToby Isaac if (link) { 7083a68b90caSToby Isaac ierr = PetscFree(link);CHKERRQ(ierr); 7084a68b90caSToby Isaac if (prev) { 7085a68b90caSToby Isaac prev->next = next; 7086a68b90caSToby Isaac } 7087a68b90caSToby Isaac else { 7088a68b90caSToby Isaac dm->gtolhook = next; 7089a68b90caSToby Isaac } 7090a68b90caSToby Isaac } 7091a68b90caSToby Isaac } 7092a68b90caSToby Isaac { 7093a68b90caSToby Isaac DMLocalToGlobalHookLink prev=NULL,link,next=NULL; 7094a68b90caSToby Isaac for (link=dm->ltoghook; link; link=next) { 7095a68b90caSToby Isaac next = link->next; 7096a68b90caSToby Isaac if (link->beginhook == DMLocalToGlobalHook_Plex_constraints) { 7097a68b90caSToby Isaac break; 7098a68b90caSToby Isaac } 7099a68b90caSToby Isaac } 7100a68b90caSToby Isaac if (link) { 7101a68b90caSToby Isaac ierr = PetscFree(link);CHKERRQ(ierr); 7102a68b90caSToby Isaac if (prev) { 7103a68b90caSToby Isaac prev->next = next; 7104a68b90caSToby Isaac } 7105a68b90caSToby Isaac else { 7106a68b90caSToby Isaac dm->ltoghook = next; 7107a68b90caSToby Isaac } 7108a68b90caSToby Isaac } 7109a68b90caSToby Isaac } 7110a68b90caSToby Isaac } 7111a68b90caSToby Isaac 7112a68b90caSToby Isaac PetscFunctionReturn(0); 7113a68b90caSToby Isaac } 7114a68b90caSToby Isaac 7115a68b90caSToby Isaac #undef __FUNCT__ 7116a68b90caSToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection" 7117a68b90caSToby Isaac static PetscErrorCode DMPlexCreateConstraintSection(DM dm, PetscSection *cSec) 7118a68b90caSToby Isaac { 7119a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7120a68b90caSToby Isaac PetscSection section, anchorSection; 7121a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 7122a68b90caSToby Isaac PetscErrorCode ierr; 7123a68b90caSToby Isaac 7124a68b90caSToby Isaac PetscFunctionBegin; 7125a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7126a68b90caSToby Isaac anchorSection = plex->anchorSection; 7127a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 7128a68b90caSToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)section),cSec);CHKERRQ(ierr); 7129a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 7130a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 7131a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 7132a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 7133a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 7134a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 7135a68b90caSToby Isaac if (dof) { 7136a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 7137a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 7138a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 7139a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 7140a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 7141a68b90caSToby Isaac } 7142a68b90caSToby Isaac } 7143a68b90caSToby Isaac } 7144a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 7145a68b90caSToby Isaac PetscFunctionReturn(0); 7146a68b90caSToby Isaac } 7147a68b90caSToby Isaac 7148a68b90caSToby Isaac #undef __FUNCT__ 7149a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraintSection" 7150a68b90caSToby Isaac /*@ 7151a68b90caSToby Isaac DMPlexGetConstraintSection - Get the section that maps constrained points to rows of the constraint matrix. 7152a68b90caSToby Isaac 7153a68b90caSToby Isaac The default section obtained with DMGetDefaultSection() maps points to columns of the constraint matrix. 7154a68b90caSToby Isaac 7155a68b90caSToby Isaac logically collective 7156a68b90caSToby Isaac 7157a68b90caSToby Isaac Input Parameters: 7158a68b90caSToby Isaac . dm - The DMPlex object 7159a68b90caSToby Isaac 7160a68b90caSToby Isaac Output Parameters: 7161a68b90caSToby Isaac . cSec - If not NULL, set to the section describing which points anchor the constrained points. 7162a68b90caSToby Isaac 7163a68b90caSToby Isaac 7164a68b90caSToby Isaac Level: intermediate 7165a68b90caSToby Isaac 7166a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 7167a68b90caSToby Isaac @*/ 7168a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraintSection(DM dm, PetscSection *cSec) 7169a68b90caSToby Isaac { 7170a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7171a68b90caSToby Isaac PetscErrorCode ierr; 7172a68b90caSToby Isaac 7173a68b90caSToby Isaac PetscFunctionBegin; 7174a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7175a68b90caSToby Isaac if (plex->anchorSection && !plex->constraintSection) { 7176a68b90caSToby Isaac ierr = DMPlexCreateConstraintSection(dm,&plex->constraintSection);CHKERRQ(ierr); 7177a68b90caSToby Isaac } 7178a68b90caSToby Isaac if (cSec) *cSec = plex->constraintSection; 7179a68b90caSToby Isaac PetscFunctionReturn(0); 7180a68b90caSToby Isaac } 7181a68b90caSToby Isaac 7182a68b90caSToby Isaac #undef __FUNCT__ 71830ac89760SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix" 71840ac89760SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix(DM dm, Mat *cMat) 71850ac89760SToby Isaac { 71860ac89760SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 71870ac89760SToby Isaac PetscSection section, aSec, cSec; 71880ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 71890ac89760SToby Isaac const PetscInt *anchors; 71900ac89760SToby Isaac PetscInt numFields, f; 71910ac89760SToby Isaac PetscErrorCode ierr; 71920ac89760SToby Isaac 71930ac89760SToby Isaac PetscFunctionBegin; 71940ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 71950ac89760SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 71960ac89760SToby Isaac ierr = DMPlexGetConstraintSection(dm, &cSec);CHKERRQ(ierr); 71970ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 71980ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 71990ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 72000ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 72010ac89760SToby Isaac ierr = MatSetType(*cMat,MATSEQAIJ); 72020ac89760SToby Isaac aSec = plex->anchorSection; 72030ac89760SToby Isaac ierr = ISGetIndices(plex->anchorIS,&anchors);CHKERRQ(ierr); 72040ac89760SToby Isaac ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr); 72050ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 72060ac89760SToby Isaac i[0] = 0; 72070ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 72080ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 72090ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 72100ac89760SToby Isaac if (!dof) continue; 72110ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 72120ac89760SToby Isaac if (numFields) { 72130ac89760SToby Isaac for (f = 0; f < numFields; f++) { 72140ac89760SToby Isaac annz = 0; 72150ac89760SToby Isaac for (q = 0; q < dof; q++) { 72160ac89760SToby Isaac a = anchors[off + q]; 72170ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 72180ac89760SToby Isaac annz += aDof; 72190ac89760SToby Isaac } 72200ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 72210ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 72220ac89760SToby Isaac for (q = 0; q < dof; q++) { 72230ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 72240ac89760SToby Isaac } 72250ac89760SToby Isaac } 72260ac89760SToby Isaac } 72270ac89760SToby Isaac else { 72280ac89760SToby Isaac annz = 0; 72290ac89760SToby Isaac for (q = 0; q < dof; q++) { 72300ac89760SToby Isaac a = anchors[off + q]; 72310ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 72320ac89760SToby Isaac annz += aDof; 72330ac89760SToby Isaac } 72340ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 72350ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 72360ac89760SToby Isaac for (q = 0; q < dof; q++) { 72370ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 72380ac89760SToby Isaac } 72390ac89760SToby Isaac } 72400ac89760SToby Isaac } 72410ac89760SToby Isaac nnz = i[m]; 72420ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 72430ac89760SToby Isaac offset = 0; 72440ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 72450ac89760SToby Isaac if (numFields) { 72460ac89760SToby Isaac for (f = 0; f < numFields; f++) { 72470ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 72480ac89760SToby Isaac for (q = 0; q < dof; q++) { 72490ac89760SToby Isaac PetscInt rDof, rOff, r; 72500ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 72510ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 72520ac89760SToby Isaac for (r = 0; r < rDof; r++) { 72530ac89760SToby Isaac PetscInt s; 72540ac89760SToby Isaac 72550ac89760SToby Isaac a = anchors[rOff + r]; 72560ac89760SToby Isaac 72570ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 72580ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 72590ac89760SToby Isaac for (s = 0; s < aDof; s++) { 72600ac89760SToby Isaac j[offset++] = aOff + s; 72610ac89760SToby Isaac } 72620ac89760SToby Isaac } 72630ac89760SToby Isaac } 72640ac89760SToby Isaac } 72650ac89760SToby Isaac } 72660ac89760SToby Isaac else { 72670ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 72680ac89760SToby Isaac for (q = 0; q < dof; q++) { 72690ac89760SToby Isaac PetscInt rDof, rOff, r; 72700ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 72710ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 72720ac89760SToby Isaac for (r = 0; r < rDof; r++) { 72730ac89760SToby Isaac PetscInt s; 72740ac89760SToby Isaac 72750ac89760SToby Isaac a = anchors[rOff + r]; 72760ac89760SToby Isaac 72770ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 72780ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 72790ac89760SToby Isaac for (s = 0; s < aDof; s++) { 72800ac89760SToby Isaac j[offset++] = aOff + s; 72810ac89760SToby Isaac } 72820ac89760SToby Isaac } 72830ac89760SToby Isaac } 72840ac89760SToby Isaac } 72850ac89760SToby Isaac } 72860ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 72870ac89760SToby Isaac ierr = PetscFree2(i,j);CHKERRQ(ierr); 72880ac89760SToby Isaac ierr = ISRestoreIndices(plex->anchorIS,&anchors);CHKERRQ(ierr); 72890ac89760SToby Isaac PetscFunctionReturn(0); 72900ac89760SToby Isaac } 72910ac89760SToby Isaac 72920ac89760SToby Isaac #undef __FUNCT__ 7293a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraintMatrix" 7294a68b90caSToby Isaac /*@ 7295a68b90caSToby Isaac DMPlexGetConstraintMatrix - Get the matrix that specifies the point-to-point constraints. 7296a68b90caSToby Isaac 7297a68b90caSToby Isaac logically collective 7298a68b90caSToby Isaac 7299a68b90caSToby Isaac Input Parameters: 7300a68b90caSToby Isaac . dm - The DMPlex object 7301a68b90caSToby Isaac 7302a68b90caSToby Isaac Output Parameters: 7303a68b90caSToby Isaac . cMat - If not NULL, returns the constraint matrix. If the constraint matrix has not been created before, then it is 7304a68b90caSToby Isaac created and its nonzero structure is allocated, so that the user can insert values. 7305a68b90caSToby Isaac 7306a68b90caSToby Isaac 7307a68b90caSToby Isaac Level: intermediate 7308a68b90caSToby Isaac 7309a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexSetConstraintMatrix() 7310a68b90caSToby Isaac @*/ 7311a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraintMatrix(DM dm, Mat *cMat) 7312a68b90caSToby Isaac { 7313a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7314a68b90caSToby Isaac PetscErrorCode ierr; 7315a68b90caSToby Isaac 7316a68b90caSToby Isaac PetscFunctionBegin; 7317a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 73180ac89760SToby Isaac if (plex->anchorSection && !plex->constraintMat) { 73190ac89760SToby Isaac ierr = DMPlexCreateConstraintMatrix(dm,&plex->constraintMat);CHKERRQ(ierr); 73200ac89760SToby Isaac } 7321a68b90caSToby Isaac if (cMat) *cMat = plex->constraintMat; 7322a68b90caSToby Isaac PetscFunctionReturn(0); 7323a68b90caSToby Isaac } 7324a68b90caSToby Isaac 7325a68b90caSToby Isaac #undef __FUNCT__ 7326a68b90caSToby Isaac #define __FUNCT__ "DMPlexSetConstraintMatrix" 7327a68b90caSToby Isaac /*@ 7328a68b90caSToby Isaac DMPlexSetConstraintMatrix - Set the matrix that specifies the point-to-point constraints. It should have the same 7329a68b90caSToby Isaac number of rows as the layout size of the section returned by DMPlexGetConstraintSection(), and it should have the 7330a68b90caSToby Isaac same number of columns as the layout size of the section returned by DMGetDefaultSection(). For the constraint 7331a68b90caSToby Isaac matrix to be used when constructing a matrix in, e.g., DMPlexSNESComputeJacobianFEM(), then MatGetValues() must be 7332a68b90caSToby Isaac implemented. 7333a68b90caSToby Isaac 7334a68b90caSToby Isaac logically collective 7335a68b90caSToby Isaac 7336a68b90caSToby Isaac Input Parameters: 7337a68b90caSToby Isaac + dm - The DMPlex object 7338a68b90caSToby Isaac - cMat - The constraint matrix. 7339a68b90caSToby Isaac 7340a68b90caSToby Isaac The reference count of cMat is incremented. 7341a68b90caSToby Isaac 7342a68b90caSToby Isaac 7343a68b90caSToby Isaac Level: advanced. 7344a68b90caSToby Isaac 7345a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix() 7346a68b90caSToby Isaac @*/ 7347a68b90caSToby Isaac PetscErrorCode DMPlexSetConstraintMatrix(DM dm, Mat cMat) 7348a68b90caSToby Isaac { 7349a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7350a68b90caSToby Isaac PetscErrorCode ierr; 7351a68b90caSToby Isaac 7352a68b90caSToby Isaac PetscFunctionBegin; 7353a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7354a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)cMat);CHKERRQ(ierr); 7355a68b90caSToby Isaac ierr = MatDestroy(&plex->constraintMat);CHKERRQ(ierr); 7356a68b90caSToby Isaac plex->constraintMat = cMat; 7357a68b90caSToby Isaac PetscFunctionReturn(0); 7358a68b90caSToby Isaac } 7359