134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2552f7358SJed Brown #include <../src/sys/utils/hash.h> 3d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 40c312b8eSJed Brown #include <petscsf.h> 5552f7358SJed Brown 6552f7358SJed Brown /* Logging support */ 775a69067SMatthew G. Knepley PetscLogEvent DMPLEX_Interpolate, DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM, DMPLEX_InterpolatorFEM, DMPLEX_InjectorFEM; 8552f7358SJed Brown 95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 112c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 12552f7358SJed Brown 137e42fee7SMatthew G. Knepley #undef __FUNCT__ 147afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 157afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 167e42fee7SMatthew G. Knepley { 177e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 187e42fee7SMatthew G. Knepley PetscErrorCode ierr; 197e42fee7SMatthew G. Knepley 207e42fee7SMatthew G. Knepley PetscFunctionBegin; 217e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 22c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 237e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 257e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley if (field >= 0) { 277e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 287e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 297e42fee7SMatthew G. Knepley } else { 307e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley } 337e42fee7SMatthew G. Knepley if (vdof) { 347e42fee7SMatthew G. Knepley *sStart = vStart; 357e42fee7SMatthew G. Knepley *sEnd = vEnd; 367e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 377e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 387e42fee7SMatthew G. Knepley } else if (cdof) { 397e42fee7SMatthew G. Knepley *sStart = cStart; 407e42fee7SMatthew G. Knepley *sEnd = cEnd; 417e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 427e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 437e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 447e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 457e42fee7SMatthew G. Knepley } 467e42fee7SMatthew G. Knepley 47552f7358SJed Brown #undef __FUNCT__ 48552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 49552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 50552f7358SJed Brown { 51552f7358SJed Brown DM dm; 52b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 53552f7358SJed Brown PetscErrorCode ierr; 54552f7358SJed Brown 55552f7358SJed Brown PetscFunctionBegin; 56552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 58552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 59b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 60b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 61ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 62ef31f671SMatthew G. Knepley PetscInt numFields; 63ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 64ef31f671SMatthew G. Knepley 65ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 66ef31f671SMatthew G. Knepley if (numFields) { 67ef31f671SMatthew G. Knepley PetscObject fe; 68ef31f671SMatthew G. Knepley 69ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 70ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 71ef31f671SMatthew G. Knepley } 724959657aSMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr);} 73ef31f671SMatthew G. Knepley } 74552f7358SJed Brown if (isvtk) { 75552f7358SJed Brown PetscSection section; 76b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 77b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 78552f7358SJed Brown 79552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 807afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 81552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 82552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 83552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 84b136c2c9SMatthew G. Knepley } else if (ishdf5) { 85b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 86b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 87b136c2c9SMatthew G. Knepley #else 88b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 89b136c2c9SMatthew G. Knepley #endif 90552f7358SJed Brown } else { 9155f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9255f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 93552f7358SJed Brown } 94552f7358SJed Brown PetscFunctionReturn(0); 95552f7358SJed Brown } 96552f7358SJed Brown 97552f7358SJed Brown #undef __FUNCT__ 98552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 99552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 100552f7358SJed Brown { 101552f7358SJed Brown DM dm; 10255f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 103552f7358SJed Brown PetscErrorCode ierr; 104552f7358SJed Brown 105552f7358SJed Brown PetscFunctionBegin; 106552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 10782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 108552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 10933c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11055f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 111552f7358SJed Brown if (isvtk) { 112552f7358SJed Brown Vec locv; 113552f7358SJed Brown const char *name; 114552f7358SJed Brown 115552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 116552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 117552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 118552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 119552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 120552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 122b136c2c9SMatthew G. Knepley } else if (ishdf5) { 123b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 124b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 125b136c2c9SMatthew G. Knepley #else 126b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 127b136c2c9SMatthew G. Knepley #endif 128552f7358SJed Brown } else { 12955f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13055f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 131552f7358SJed Brown } 132552f7358SJed Brown PetscFunctionReturn(0); 133552f7358SJed Brown } 134552f7358SJed Brown 135552f7358SJed Brown #undef __FUNCT__ 1362c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1372c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1382c40f234SMatthew G. Knepley { 1392c40f234SMatthew G. Knepley DM dm; 1402c40f234SMatthew G. Knepley PetscBool ishdf5; 1412c40f234SMatthew G. Knepley PetscErrorCode ierr; 1422c40f234SMatthew G. Knepley 1432c40f234SMatthew G. Knepley PetscFunctionBegin; 1442c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1452c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1462c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1472c40f234SMatthew G. Knepley if (ishdf5) { 1482c40f234SMatthew G. Knepley DM dmBC; 1492c40f234SMatthew G. Knepley Vec gv; 1502c40f234SMatthew G. Knepley const char *name; 1512c40f234SMatthew G. Knepley 1522c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1532c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1542c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley } else { 1612c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley } 1632c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1642c40f234SMatthew G. Knepley } 1652c40f234SMatthew G. Knepley 1662c40f234SMatthew G. Knepley #undef __FUNCT__ 1672c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1682c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1692c40f234SMatthew G. Knepley { 1702c40f234SMatthew G. Knepley DM dm; 1712c40f234SMatthew G. Knepley PetscBool ishdf5; 1722c40f234SMatthew G. Knepley PetscErrorCode ierr; 1732c40f234SMatthew G. Knepley 1742c40f234SMatthew G. Knepley PetscFunctionBegin; 1752c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1762c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1782c40f234SMatthew G. Knepley if (ishdf5) { 179878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 180b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 181b136c2c9SMatthew G. Knepley #else 182b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 183878b459fSMatthew G. Knepley #endif 1842c40f234SMatthew G. Knepley } else { 1852c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 186552f7358SJed Brown } 187552f7358SJed Brown PetscFunctionReturn(0); 188552f7358SJed Brown } 189552f7358SJed Brown 190552f7358SJed Brown #undef __FUNCT__ 191552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 192552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 193552f7358SJed Brown { 194552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 195552f7358SJed Brown DM cdm; 196552f7358SJed Brown DMLabel markers; 197552f7358SJed Brown PetscSection coordSection; 198552f7358SJed Brown Vec coordinates; 199552f7358SJed Brown PetscViewerFormat format; 200552f7358SJed Brown PetscErrorCode ierr; 201552f7358SJed Brown 202552f7358SJed Brown PetscFunctionBegin; 203552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 204552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 205552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 206552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 207552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 208552f7358SJed Brown const char *name; 209552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 210552f7358SJed Brown PetscInt pStart, pEnd, p; 211552f7358SJed Brown PetscMPIInt rank, size; 212552f7358SJed Brown 21382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21482f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 215552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 216552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 217552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 220552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 221552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 223552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 224552f7358SJed Brown PetscInt dof, off, s; 225552f7358SJed Brown 226552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 228552f7358SJed Brown for (s = off; s < off+dof; ++s) { 229552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 230552f7358SJed Brown } 231552f7358SJed Brown } 232552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 233552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 234552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 235552f7358SJed Brown PetscInt dof, off, c; 236552f7358SJed Brown 237552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 238552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 239552f7358SJed Brown for (c = off; c < off+dof; ++c) { 240552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 241552f7358SJed Brown } 242552f7358SJed Brown } 243552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2440298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 245552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 246552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 247552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 248552f7358SJed Brown if (size > 1) { 249552f7358SJed Brown PetscSF sf; 250552f7358SJed Brown 251552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 253552f7358SJed Brown } 254552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 255552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 256552f7358SJed Brown const char *name; 257552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 258552f7358SJed Brown const int numColors = 3; 259552f7358SJed Brown PetscReal scale = 2.0; 260552f7358SJed Brown PetscScalar *coords; 261552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 262552f7358SJed Brown PetscMPIInt rank, size; 263552f7358SJed Brown 264552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 26582f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 26682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 267552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 268552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 269770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 270770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 271552f7358SJed Brown \\usepackage{tikz}\n\ 272552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 273552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 274552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 275552f7358SJed Brown \\begin{document}\n\ 276552f7358SJed Brown \\section{%s}\n\ 277770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 278770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 279770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 280770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 281770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 282770b213bSMatthew G Knepley } else if (p > 0) { 283770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 284770b213bSMatthew G Knepley } 285770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 286770b213bSMatthew G Knepley } 287770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 288770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 289552f7358SJed Brown /* Plot vertices */ 290552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 291552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 292552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 293552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 294552f7358SJed Brown PetscInt off, dof, d; 295552f7358SJed Brown 296552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 297552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 298552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 299552f7358SJed Brown for (d = 0; d < dof; ++d) { 300552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3016712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 302552f7358SJed Brown } 303552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 304552f7358SJed Brown } 305552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 307552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 308552f7358SJed Brown /* Plot edges */ 309552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 310552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 311552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 312552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 313552f7358SJed Brown const PetscInt *cone; 314552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 315552f7358SJed Brown 316552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 31782f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 318552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 319552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 320552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 321552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 322552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 323552f7358SJed Brown for (d = 0; d < dof; ++d) { 324552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3256712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 326552f7358SJed Brown } 327552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 328552f7358SJed Brown } 329552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 330552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 331552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 332552f7358SJed Brown /* Plot cells */ 333552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 334552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3350298fd71SBarry Smith PetscInt *closure = NULL; 336552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 337552f7358SJed Brown 338552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 339552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 340552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 341552f7358SJed Brown const PetscInt point = closure[p]; 342552f7358SJed Brown 343552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 344552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 345552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 346552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 347552f7358SJed Brown } 348552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 349552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 350552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 351552f7358SJed Brown } 352552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 353552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 354770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 355552f7358SJed Brown } else { 35682f516ccSBarry Smith MPI_Comm comm; 357834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 358834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 359552f7358SJed Brown PetscInt pStart, pEnd, p; 360a57dd577SMatthew G Knepley PetscInt numLabels, l; 3611143a3c0SMatthew G. Knepley const char *name; 362552f7358SJed Brown PetscMPIInt size; 363552f7358SJed Brown 36482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 365552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 366c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3675f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3681143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3691143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 370552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 371552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 372bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 373dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 374552f7358SJed Brown if (depth == 1) { 375552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 376552f7358SJed Brown pEnd = pEnd - pStart; 377552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 378552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 379552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 380552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 381552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 382552f7358SJed Brown pEnd = pEnd - pStart; 383552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 384552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 385552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 386552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 387552f7358SJed Brown } else { 388552f7358SJed Brown for (d = 0; d <= dim; d++) { 389552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 390834065abSMatthew G. Knepley pEnd -= pStart; 391834065abSMatthew G. Knepley pMax[d] -= pStart; 392552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 393834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 394552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 395834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 396834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 397834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 398834065abSMatthew G. Knepley } 399552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 400552f7358SJed Brown } 401552f7358SJed Brown } 402834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 403a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 404a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 405a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 406a57dd577SMatthew G Knepley DMLabel label; 407a57dd577SMatthew G Knepley const char *name; 408a57dd577SMatthew G Knepley IS valueIS; 409a57dd577SMatthew G Knepley const PetscInt *values; 410a57dd577SMatthew G Knepley PetscInt numValues, v; 411a57dd577SMatthew G Knepley 412a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 413a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 414a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 415a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 416a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 418a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 419a57dd577SMatthew G Knepley PetscInt size; 420a57dd577SMatthew G Knepley 421a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 422a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 423a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 424a57dd577SMatthew G Knepley } 425a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 426a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4274d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 428a57dd577SMatthew G Knepley } 429552f7358SJed Brown } 430552f7358SJed Brown PetscFunctionReturn(0); 431552f7358SJed Brown } 432552f7358SJed Brown 433552f7358SJed Brown #undef __FUNCT__ 434552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 435552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 436552f7358SJed Brown { 437c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 438552f7358SJed Brown PetscErrorCode ierr; 439552f7358SJed Brown 440552f7358SJed Brown PetscFunctionBegin; 441552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 442552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 443552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 444c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 445552f7358SJed Brown if (iascii) { 446552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 447c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 448c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4497afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 450c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4517afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley #else 453c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 454552f7358SJed Brown #endif 45511aeaf0aSBarry Smith } 456552f7358SJed Brown PetscFunctionReturn(0); 457552f7358SJed Brown } 458552f7358SJed Brown 4592c40f234SMatthew G. Knepley #undef __FUNCT__ 4602c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4612c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4622c40f234SMatthew G. Knepley { 4632c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4642c40f234SMatthew G. Knepley PetscErrorCode ierr; 4652c40f234SMatthew G. Knepley 4662c40f234SMatthew G. Knepley PetscFunctionBegin; 4672c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4682c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4692c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4702c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4712c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4722c40f234SMatthew G. Knepley else if (ishdf5) { 4732c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 47410b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4752c40f234SMatthew G. Knepley #else 4762c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 477552f7358SJed Brown #endif 478552f7358SJed Brown } 479552f7358SJed Brown PetscFunctionReturn(0); 480552f7358SJed Brown } 481552f7358SJed Brown 482552f7358SJed Brown #undef __FUNCT__ 4836c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4846c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4856c73c22cSMatthew G. Knepley { 4866c73c22cSMatthew G. Knepley DMBoundary b, next; 4876c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4886c73c22cSMatthew G. Knepley 4898e136ac0SMatthew G. Knepley PetscFunctionBegin; 4906c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4916c73c22cSMatthew G. Knepley b = *boundary; 4926c73c22cSMatthew G. Knepley *boundary = NULL; 4936c73c22cSMatthew G. Knepley for (; b; b = next) { 4946c73c22cSMatthew G. Knepley next = b->next; 4956c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 4966c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 49763d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 4986c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 4996c73c22cSMatthew G. Knepley } 5006c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5016c73c22cSMatthew G. Knepley } 5026c73c22cSMatthew G. Knepley 5036c73c22cSMatthew G. Knepley #undef __FUNCT__ 504552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 505552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 506552f7358SJed Brown { 507552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 508552f7358SJed Brown DMLabel next = mesh->labels; 509552f7358SJed Brown PetscErrorCode ierr; 510552f7358SJed Brown 511552f7358SJed Brown PetscFunctionBegin; 5120d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 513552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 514552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 515552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 516552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 517552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 518552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 519*d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->tetgenOpts);CHKERRQ(ierr); 520*d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->triangleOpts);CHKERRQ(ierr); 521552f7358SJed Brown while (next) { 522552f7358SJed Brown DMLabel tmp = next->next; 523552f7358SJed Brown 524552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 525552f7358SJed Brown next = tmp; 526552f7358SJed Brown } 5273913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 528a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 529552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 530552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5316c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 532552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 533552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 534552f7358SJed Brown PetscFunctionReturn(0); 535552f7358SJed Brown } 536552f7358SJed Brown 537552f7358SJed Brown #undef __FUNCT__ 538552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 539b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 540552f7358SJed Brown { 541552f7358SJed Brown PetscSection section, sectionGlobal; 542552f7358SJed Brown PetscInt bs = -1; 543552f7358SJed Brown PetscInt localSize; 54489545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 545552f7358SJed Brown PetscErrorCode ierr; 546b412c318SBarry Smith MatType mtype; 547552f7358SJed Brown 548552f7358SJed Brown PetscFunctionBegin; 549607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 550b412c318SBarry Smith mtype = dm->mattype; 551552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 552552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 553552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 554552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 55582f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 556552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 557552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 558552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 559552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 560552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 561552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 562552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 563552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 564552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 565552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 566552f7358SJed Brown if (!isShell) { 567552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5682a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 569552f7358SJed Brown 570552f7358SJed Brown if (bs < 0) { 571552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 572fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 573552f7358SJed Brown 574552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 575552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 576552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 577fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 578fad22124SMatthew G Knepley if (dof-cdof) { 5792a28c762SMatthew G Knepley if (bs < 0) { 580fad22124SMatthew G Knepley bs = dof-cdof; 581fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5822a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5832a28c762SMatthew G Knepley bs = 1; 584552f7358SJed Brown break; 585552f7358SJed Brown } 586552f7358SJed Brown } 5872a28c762SMatthew G Knepley } 5882a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5892a28c762SMatthew G Knepley bsLocal = bs; 59082f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5912a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59282f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5932a28c762SMatthew G Knepley if (bsMin != bsMax) { 5942a28c762SMatthew G Knepley bs = 1; 5952a28c762SMatthew G Knepley } else { 5962a28c762SMatthew G Knepley bs = bsMax; 5972a28c762SMatthew G Knepley } 598552f7358SJed Brown } else { 599552f7358SJed Brown bs = 1; 600552f7358SJed Brown } 601552f7358SJed Brown } 6021795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 603552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 604552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 605552f7358SJed Brown } 606552f7358SJed Brown PetscFunctionReturn(0); 607552f7358SJed Brown } 608552f7358SJed Brown 609552f7358SJed Brown #undef __FUNCT__ 610552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 611552f7358SJed Brown /*@ 612552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 613552f7358SJed Brown 614552f7358SJed Brown Not collective 615552f7358SJed Brown 616552f7358SJed Brown Input Parameter: 617552f7358SJed Brown . mesh - The DMPlex 618552f7358SJed Brown 619552f7358SJed Brown Output Parameters: 620552f7358SJed Brown + pStart - The first mesh point 621552f7358SJed Brown - pEnd - The upper bound for mesh points 622552f7358SJed Brown 623552f7358SJed Brown Level: beginner 624552f7358SJed Brown 625552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 626552f7358SJed Brown @*/ 627552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 628552f7358SJed Brown { 629552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 630552f7358SJed Brown PetscErrorCode ierr; 631552f7358SJed Brown 632552f7358SJed Brown PetscFunctionBegin; 633552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 634552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 635552f7358SJed Brown PetscFunctionReturn(0); 636552f7358SJed Brown } 637552f7358SJed Brown 638552f7358SJed Brown #undef __FUNCT__ 639552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 640552f7358SJed Brown /*@ 641552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 642552f7358SJed Brown 643552f7358SJed Brown Not collective 644552f7358SJed Brown 645552f7358SJed Brown Input Parameters: 646552f7358SJed Brown + mesh - The DMPlex 647552f7358SJed Brown . pStart - The first mesh point 648552f7358SJed Brown - pEnd - The upper bound for mesh points 649552f7358SJed Brown 650552f7358SJed Brown Output Parameters: 651552f7358SJed Brown 652552f7358SJed Brown Level: beginner 653552f7358SJed Brown 654552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 655552f7358SJed Brown @*/ 656552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 657552f7358SJed Brown { 658552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 659552f7358SJed Brown PetscErrorCode ierr; 660552f7358SJed Brown 661552f7358SJed Brown PetscFunctionBegin; 662552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 663552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 664552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 665552f7358SJed Brown PetscFunctionReturn(0); 666552f7358SJed Brown } 667552f7358SJed Brown 668552f7358SJed Brown #undef __FUNCT__ 669552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 670552f7358SJed Brown /*@ 671552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 672552f7358SJed Brown 673552f7358SJed Brown Not collective 674552f7358SJed Brown 675552f7358SJed Brown Input Parameters: 676552f7358SJed Brown + mesh - The DMPlex 677552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 678552f7358SJed Brown 679552f7358SJed Brown Output Parameter: 680552f7358SJed Brown . size - The cone size for point p 681552f7358SJed Brown 682552f7358SJed Brown Level: beginner 683552f7358SJed Brown 684552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 685552f7358SJed Brown @*/ 686552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 687552f7358SJed Brown { 688552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 689552f7358SJed Brown PetscErrorCode ierr; 690552f7358SJed Brown 691552f7358SJed Brown PetscFunctionBegin; 692552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 693552f7358SJed Brown PetscValidPointer(size, 3); 694552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 695552f7358SJed Brown PetscFunctionReturn(0); 696552f7358SJed Brown } 697552f7358SJed Brown 698552f7358SJed Brown #undef __FUNCT__ 699552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 700552f7358SJed Brown /*@ 701552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 702552f7358SJed Brown 703552f7358SJed Brown Not collective 704552f7358SJed Brown 705552f7358SJed Brown Input Parameters: 706552f7358SJed Brown + mesh - The DMPlex 707552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 708552f7358SJed Brown - size - The cone size for point p 709552f7358SJed Brown 710552f7358SJed Brown Output Parameter: 711552f7358SJed Brown 712552f7358SJed Brown Note: 713552f7358SJed Brown This should be called after DMPlexSetChart(). 714552f7358SJed Brown 715552f7358SJed Brown Level: beginner 716552f7358SJed Brown 717552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 718552f7358SJed Brown @*/ 719552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 720552f7358SJed Brown { 721552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 722552f7358SJed Brown PetscErrorCode ierr; 723552f7358SJed Brown 724552f7358SJed Brown PetscFunctionBegin; 725552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 726552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7270d644c17SKarl Rupp 728552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 729552f7358SJed Brown PetscFunctionReturn(0); 730552f7358SJed Brown } 731552f7358SJed Brown 732552f7358SJed Brown #undef __FUNCT__ 733f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 734f5a469b9SMatthew G. Knepley /*@ 735f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 736f5a469b9SMatthew G. Knepley 737f5a469b9SMatthew G. Knepley Not collective 738f5a469b9SMatthew G. Knepley 739f5a469b9SMatthew G. Knepley Input Parameters: 740f5a469b9SMatthew G. Knepley + mesh - The DMPlex 741f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 742f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 743f5a469b9SMatthew G. Knepley 744f5a469b9SMatthew G. Knepley Output Parameter: 745f5a469b9SMatthew G. Knepley 746f5a469b9SMatthew G. Knepley Note: 747f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 748f5a469b9SMatthew G. Knepley 749f5a469b9SMatthew G. Knepley Level: beginner 750f5a469b9SMatthew G. Knepley 751f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 752f5a469b9SMatthew G. Knepley @*/ 753f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 754f5a469b9SMatthew G. Knepley { 755f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 756f5a469b9SMatthew G. Knepley PetscInt csize; 757f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 758f5a469b9SMatthew G. Knepley 759f5a469b9SMatthew G. Knepley PetscFunctionBegin; 760f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 761f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 762f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 763f5a469b9SMatthew G. Knepley 764f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 765f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 766f5a469b9SMatthew G. Knepley } 767f5a469b9SMatthew G. Knepley 768f5a469b9SMatthew G. Knepley #undef __FUNCT__ 769552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 770552f7358SJed Brown /*@C 771552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 772552f7358SJed Brown 773552f7358SJed Brown Not collective 774552f7358SJed Brown 775552f7358SJed Brown Input Parameters: 776552f7358SJed Brown + mesh - The DMPlex 777552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 778552f7358SJed Brown 779552f7358SJed Brown Output Parameter: 780552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 781552f7358SJed Brown 782552f7358SJed Brown Level: beginner 783552f7358SJed Brown 7843813dfbdSMatthew G Knepley Fortran Notes: 7853813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7863813dfbdSMatthew G Knepley include petsc.h90 in your code. 7873813dfbdSMatthew G Knepley 7883813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 789552f7358SJed Brown 790552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 791552f7358SJed Brown @*/ 792552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 793552f7358SJed Brown { 794552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 795552f7358SJed Brown PetscInt off; 796552f7358SJed Brown PetscErrorCode ierr; 797552f7358SJed Brown 798552f7358SJed Brown PetscFunctionBegin; 799552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 800552f7358SJed Brown PetscValidPointer(cone, 3); 801552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 802552f7358SJed Brown *cone = &mesh->cones[off]; 803552f7358SJed Brown PetscFunctionReturn(0); 804552f7358SJed Brown } 805552f7358SJed Brown 806552f7358SJed Brown #undef __FUNCT__ 807552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 808552f7358SJed Brown /*@ 809552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 810552f7358SJed Brown 811552f7358SJed Brown Not collective 812552f7358SJed Brown 813552f7358SJed Brown Input Parameters: 814552f7358SJed Brown + mesh - The DMPlex 815552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 816552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 817552f7358SJed Brown 818552f7358SJed Brown Output Parameter: 819552f7358SJed Brown 820552f7358SJed Brown Note: 821552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 822552f7358SJed Brown 823552f7358SJed Brown Level: beginner 824552f7358SJed Brown 825552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 826552f7358SJed Brown @*/ 827552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 828552f7358SJed Brown { 829552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 830552f7358SJed Brown PetscInt pStart, pEnd; 831552f7358SJed Brown PetscInt dof, off, c; 832552f7358SJed Brown PetscErrorCode ierr; 833552f7358SJed Brown 834552f7358SJed Brown PetscFunctionBegin; 835552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 836552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 837552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 838552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 839552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84082f516ccSBarry 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); 841552f7358SJed Brown for (c = 0; c < dof; ++c) { 84282f516ccSBarry 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); 843552f7358SJed Brown mesh->cones[off+c] = cone[c]; 844552f7358SJed Brown } 845552f7358SJed Brown PetscFunctionReturn(0); 846552f7358SJed Brown } 847552f7358SJed Brown 848552f7358SJed Brown #undef __FUNCT__ 849552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 850552f7358SJed Brown /*@C 851552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 852552f7358SJed Brown 853552f7358SJed Brown Not collective 854552f7358SJed Brown 855552f7358SJed Brown Input Parameters: 856552f7358SJed Brown + mesh - The DMPlex 857552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 858552f7358SJed Brown 859552f7358SJed Brown Output Parameter: 860552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 861552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 862552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 863552f7358SJed Brown the index of the cone point on which to start. 864552f7358SJed Brown 865552f7358SJed Brown Level: beginner 866552f7358SJed Brown 8673813dfbdSMatthew G Knepley Fortran Notes: 8683813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8693813dfbdSMatthew G Knepley include petsc.h90 in your code. 8703813dfbdSMatthew G Knepley 8713813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 872552f7358SJed Brown 873552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 874552f7358SJed Brown @*/ 875552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 876552f7358SJed Brown { 877552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 878552f7358SJed Brown PetscInt off; 879552f7358SJed Brown PetscErrorCode ierr; 880552f7358SJed Brown 881552f7358SJed Brown PetscFunctionBegin; 882552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 883552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 884552f7358SJed Brown { 885552f7358SJed Brown PetscInt dof; 886552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 887552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 888552f7358SJed Brown } 889552f7358SJed Brown #endif 890552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8910d644c17SKarl Rupp 892552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 893552f7358SJed Brown PetscFunctionReturn(0); 894552f7358SJed Brown } 895552f7358SJed Brown 896552f7358SJed Brown #undef __FUNCT__ 897552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 898552f7358SJed Brown /*@ 899552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 900552f7358SJed Brown 901552f7358SJed Brown Not collective 902552f7358SJed Brown 903552f7358SJed Brown Input Parameters: 904552f7358SJed Brown + mesh - The DMPlex 905552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 906552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 907552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 908552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 909552f7358SJed Brown the index of the cone point on which to start. 910552f7358SJed Brown 911552f7358SJed Brown Output Parameter: 912552f7358SJed Brown 913552f7358SJed Brown Note: 914552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 915552f7358SJed Brown 916552f7358SJed Brown Level: beginner 917552f7358SJed Brown 918552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 919552f7358SJed Brown @*/ 920552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 921552f7358SJed Brown { 922552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 923552f7358SJed Brown PetscInt pStart, pEnd; 924552f7358SJed Brown PetscInt dof, off, c; 925552f7358SJed Brown PetscErrorCode ierr; 926552f7358SJed Brown 927552f7358SJed Brown PetscFunctionBegin; 928552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 929552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 930552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 931552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 932552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 93382f516ccSBarry 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); 934552f7358SJed Brown for (c = 0; c < dof; ++c) { 935552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 936552f7358SJed Brown 937552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 93882f516ccSBarry 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); 939552f7358SJed Brown mesh->coneOrientations[off+c] = o; 940552f7358SJed Brown } 941552f7358SJed Brown PetscFunctionReturn(0); 942552f7358SJed Brown } 943552f7358SJed Brown 944552f7358SJed Brown #undef __FUNCT__ 945552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 946552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 947552f7358SJed Brown { 948552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 949552f7358SJed Brown PetscInt pStart, pEnd; 950552f7358SJed Brown PetscInt dof, off; 951552f7358SJed Brown PetscErrorCode ierr; 952552f7358SJed Brown 953552f7358SJed Brown PetscFunctionBegin; 954552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 955552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 95682f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 95782f516ccSBarry 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); 95877c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 95977c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 96077c88f5bSMatthew 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); 961552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 962552f7358SJed Brown PetscFunctionReturn(0); 963552f7358SJed Brown } 964552f7358SJed Brown 965552f7358SJed Brown #undef __FUNCT__ 96677c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 96777c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 96877c88f5bSMatthew G Knepley { 96977c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 97077c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 97177c88f5bSMatthew G Knepley PetscInt dof, off; 97277c88f5bSMatthew G Knepley PetscErrorCode ierr; 97377c88f5bSMatthew G Knepley 97477c88f5bSMatthew G Knepley PetscFunctionBegin; 97577c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 97677c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97777c88f5bSMatthew 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); 97877c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 97977c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98077c88f5bSMatthew 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); 98177c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 98277c88f5bSMatthew G Knepley PetscFunctionReturn(0); 98377c88f5bSMatthew G Knepley } 98477c88f5bSMatthew G Knepley 98577c88f5bSMatthew G Knepley #undef __FUNCT__ 986552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 987552f7358SJed Brown /*@ 988552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 989552f7358SJed Brown 990552f7358SJed Brown Not collective 991552f7358SJed Brown 992552f7358SJed Brown Input Parameters: 993552f7358SJed Brown + mesh - The DMPlex 994552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 995552f7358SJed Brown 996552f7358SJed Brown Output Parameter: 997552f7358SJed Brown . size - The support size for point p 998552f7358SJed Brown 999552f7358SJed Brown Level: beginner 1000552f7358SJed Brown 1001552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1002552f7358SJed Brown @*/ 1003552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1004552f7358SJed Brown { 1005552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1006552f7358SJed Brown PetscErrorCode ierr; 1007552f7358SJed Brown 1008552f7358SJed Brown PetscFunctionBegin; 1009552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1010552f7358SJed Brown PetscValidPointer(size, 3); 1011552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1012552f7358SJed Brown PetscFunctionReturn(0); 1013552f7358SJed Brown } 1014552f7358SJed Brown 1015552f7358SJed Brown #undef __FUNCT__ 1016552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1017552f7358SJed Brown /*@ 1018552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1019552f7358SJed Brown 1020552f7358SJed Brown Not collective 1021552f7358SJed Brown 1022552f7358SJed Brown Input Parameters: 1023552f7358SJed Brown + mesh - The DMPlex 1024552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1025552f7358SJed Brown - size - The support size for point p 1026552f7358SJed Brown 1027552f7358SJed Brown Output Parameter: 1028552f7358SJed Brown 1029552f7358SJed Brown Note: 1030552f7358SJed Brown This should be called after DMPlexSetChart(). 1031552f7358SJed Brown 1032552f7358SJed Brown Level: beginner 1033552f7358SJed Brown 1034552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1035552f7358SJed Brown @*/ 1036552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1037552f7358SJed Brown { 1038552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1039552f7358SJed Brown PetscErrorCode ierr; 1040552f7358SJed Brown 1041552f7358SJed Brown PetscFunctionBegin; 1042552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1043552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10440d644c17SKarl Rupp 1045552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1046552f7358SJed Brown PetscFunctionReturn(0); 1047552f7358SJed Brown } 1048552f7358SJed Brown 1049552f7358SJed Brown #undef __FUNCT__ 1050552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1051552f7358SJed Brown /*@C 1052552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1053552f7358SJed Brown 1054552f7358SJed Brown Not collective 1055552f7358SJed Brown 1056552f7358SJed Brown Input Parameters: 1057552f7358SJed Brown + mesh - The DMPlex 1058552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1059552f7358SJed Brown 1060552f7358SJed Brown Output Parameter: 1061552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1062552f7358SJed Brown 1063552f7358SJed Brown Level: beginner 1064552f7358SJed Brown 10653813dfbdSMatthew G Knepley Fortran Notes: 10663813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10673813dfbdSMatthew G Knepley include petsc.h90 in your code. 10683813dfbdSMatthew G Knepley 10693813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10703813dfbdSMatthew G Knepley 1071552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1072552f7358SJed Brown @*/ 1073552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1074552f7358SJed Brown { 1075552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1076552f7358SJed Brown PetscInt off; 1077552f7358SJed Brown PetscErrorCode ierr; 1078552f7358SJed Brown 1079552f7358SJed Brown PetscFunctionBegin; 1080552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1081552f7358SJed Brown PetscValidPointer(support, 3); 1082552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1083552f7358SJed Brown *support = &mesh->supports[off]; 1084552f7358SJed Brown PetscFunctionReturn(0); 1085552f7358SJed Brown } 1086552f7358SJed Brown 1087552f7358SJed Brown #undef __FUNCT__ 1088552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1089552f7358SJed Brown /*@ 1090552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1091552f7358SJed Brown 1092552f7358SJed Brown Not collective 1093552f7358SJed Brown 1094552f7358SJed Brown Input Parameters: 1095552f7358SJed Brown + mesh - The DMPlex 1096552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1097552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1098552f7358SJed Brown 1099552f7358SJed Brown Output Parameter: 1100552f7358SJed Brown 1101552f7358SJed Brown Note: 1102552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1103552f7358SJed Brown 1104552f7358SJed Brown Level: beginner 1105552f7358SJed Brown 1106552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1107552f7358SJed Brown @*/ 1108552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1109552f7358SJed Brown { 1110552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1111552f7358SJed Brown PetscInt pStart, pEnd; 1112552f7358SJed Brown PetscInt dof, off, c; 1113552f7358SJed Brown PetscErrorCode ierr; 1114552f7358SJed Brown 1115552f7358SJed Brown PetscFunctionBegin; 1116552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1117552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1118552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1119552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1120552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 112182f516ccSBarry 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); 1122552f7358SJed Brown for (c = 0; c < dof; ++c) { 112382f516ccSBarry 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); 1124552f7358SJed Brown mesh->supports[off+c] = support[c]; 1125552f7358SJed Brown } 1126552f7358SJed Brown PetscFunctionReturn(0); 1127552f7358SJed Brown } 1128552f7358SJed Brown 1129552f7358SJed Brown #undef __FUNCT__ 1130552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1131552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1132552f7358SJed Brown { 1133552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1134552f7358SJed Brown PetscInt pStart, pEnd; 1135552f7358SJed Brown PetscInt dof, off; 1136552f7358SJed Brown PetscErrorCode ierr; 1137552f7358SJed Brown 1138552f7358SJed Brown PetscFunctionBegin; 1139552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1140552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1141552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1142552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114382f516ccSBarry 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); 114482f516ccSBarry 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); 114582f516ccSBarry 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); 1146552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1147552f7358SJed Brown PetscFunctionReturn(0); 1148552f7358SJed Brown } 1149552f7358SJed Brown 1150552f7358SJed Brown #undef __FUNCT__ 1151552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1152552f7358SJed Brown /*@C 1153552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1154552f7358SJed Brown 1155552f7358SJed Brown Not collective 1156552f7358SJed Brown 1157552f7358SJed Brown Input Parameters: 1158552f7358SJed Brown + mesh - The DMPlex 1159552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1160552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11610298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1162552f7358SJed Brown 1163552f7358SJed Brown Output Parameters: 1164552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1165552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1166552f7358SJed Brown 1167552f7358SJed Brown Note: 11680298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1169552f7358SJed Brown 11703813dfbdSMatthew G Knepley Fortran Notes: 11713813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11723813dfbdSMatthew G Knepley include petsc.h90 in your code. 11733813dfbdSMatthew G Knepley 11743813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11753813dfbdSMatthew G Knepley 1176552f7358SJed Brown Level: beginner 1177552f7358SJed Brown 1178552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1179552f7358SJed Brown @*/ 1180552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1181552f7358SJed Brown { 1182552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1183552f7358SJed Brown PetscInt *closure, *fifo; 11840298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1185552f7358SJed Brown PetscInt tmpSize, t; 1186552f7358SJed Brown PetscInt depth = 0, maxSize; 1187552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1188552f7358SJed Brown PetscErrorCode ierr; 1189552f7358SJed Brown 1190552f7358SJed Brown PetscFunctionBegin; 1191552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1192552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1193552f7358SJed Brown /* This is only 1-level */ 1194552f7358SJed Brown if (useCone) { 1195552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1196552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1197552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1198552f7358SJed Brown } else { 1199552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1200552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1201552f7358SJed Brown } 1202bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1203bfbcdd7aSMatthew G. Knepley if (*points) { 1204bfbcdd7aSMatthew G. Knepley closure = *points; 1205bfbcdd7aSMatthew G. Knepley } else { 1206bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1207bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1208bfbcdd7aSMatthew G. Knepley } 1209bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1210bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1211bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1212bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1213bfbcdd7aSMatthew G. Knepley } 1214bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1215bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1216bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1217bfbcdd7aSMatthew G. Knepley } 1218bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1219bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1220bfbcdd7aSMatthew G. Knepley if (*points) { 1221bfbcdd7aSMatthew G. Knepley closure = *points; 1222bfbcdd7aSMatthew G. Knepley } else { 1223bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1224bfbcdd7aSMatthew G. Knepley } 1225bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1226552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1227552f7358SJed Brown const PetscInt cp = tmp[t]; 1228552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1229552f7358SJed Brown 1230552f7358SJed Brown closure[closureSize] = cp; 1231552f7358SJed Brown closure[closureSize+1] = co; 1232552f7358SJed Brown fifo[fifoSize] = cp; 1233552f7358SJed Brown fifo[fifoSize+1] = co; 1234552f7358SJed Brown } 1235bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1236552f7358SJed Brown while (fifoSize - fifoStart) { 1237552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1238552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1239552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1240552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1241552f7358SJed Brown 1242552f7358SJed Brown if (useCone) { 1243552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1244552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1245552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1246552f7358SJed Brown } else { 1247552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1248552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12490298fd71SBarry Smith tmpO = NULL; 1250552f7358SJed Brown } 1251552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1252552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1253552f7358SJed Brown const PetscInt cp = tmp[i]; 12542e1b13c2SMatthew 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. */ 12552e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12562e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12572e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1258552f7358SJed Brown PetscInt c; 1259552f7358SJed Brown 12602e1b13c2SMatthew G. Knepley if (rev) { 12612e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12622e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12632e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12642e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12652e1b13c2SMatthew G. Knepley } 1266552f7358SJed Brown /* Check for duplicate */ 1267552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1268552f7358SJed Brown if (closure[c] == cp) break; 1269552f7358SJed Brown } 1270552f7358SJed Brown if (c == closureSize) { 1271552f7358SJed Brown closure[closureSize] = cp; 1272552f7358SJed Brown closure[closureSize+1] = co; 1273552f7358SJed Brown fifo[fifoSize] = cp; 1274552f7358SJed Brown fifo[fifoSize+1] = co; 1275552f7358SJed Brown closureSize += 2; 1276552f7358SJed Brown fifoSize += 2; 1277552f7358SJed Brown } 1278552f7358SJed Brown } 1279552f7358SJed Brown fifoStart += 2; 1280552f7358SJed Brown } 1281552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1282552f7358SJed Brown if (points) *points = closure; 1283552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1284552f7358SJed Brown PetscFunctionReturn(0); 1285552f7358SJed Brown } 1286552f7358SJed Brown 1287552f7358SJed Brown #undef __FUNCT__ 12889bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 12899bf0dad6SMatthew G. Knepley /*@C 12909bf0dad6SMatthew 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 12919bf0dad6SMatthew G. Knepley 12929bf0dad6SMatthew G. Knepley Not collective 12939bf0dad6SMatthew G. Knepley 12949bf0dad6SMatthew G. Knepley Input Parameters: 12959bf0dad6SMatthew G. Knepley + mesh - The DMPlex 12969bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 12979bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 12989bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12999bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13009bf0dad6SMatthew G. Knepley 13019bf0dad6SMatthew G. Knepley Output Parameters: 13029bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13039bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13049bf0dad6SMatthew G. Knepley 13059bf0dad6SMatthew G. Knepley Note: 13069bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13079bf0dad6SMatthew G. Knepley 13089bf0dad6SMatthew G. Knepley Fortran Notes: 13099bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13109bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13119bf0dad6SMatthew G. Knepley 13129bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13139bf0dad6SMatthew G. Knepley 13149bf0dad6SMatthew G. Knepley Level: beginner 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13179bf0dad6SMatthew G. Knepley @*/ 13189bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13199bf0dad6SMatthew G. Knepley { 13209bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13219bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13229bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13239bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13249bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13259bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13269bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13279bf0dad6SMatthew G. Knepley 13289bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13299bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13309bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13319bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13329bf0dad6SMatthew G. Knepley if (useCone) { 13339bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13349bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13359bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13369bf0dad6SMatthew G. Knepley } else { 13379bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13389bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13399bf0dad6SMatthew G. Knepley } 13409bf0dad6SMatthew G. Knepley if (depth == 1) { 13419bf0dad6SMatthew G. Knepley if (*points) { 13429bf0dad6SMatthew G. Knepley closure = *points; 13439bf0dad6SMatthew G. Knepley } else { 13449bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13459bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13469bf0dad6SMatthew G. Knepley } 13479bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13489bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13499bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13509bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13519bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13529bf0dad6SMatthew G. Knepley } 13539bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13549bf0dad6SMatthew G. Knepley if (points) *points = closure; 13559bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13569bf0dad6SMatthew G. Knepley } 13579bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13589bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13599bf0dad6SMatthew G. Knepley if (*points) { 13609bf0dad6SMatthew G. Knepley closure = *points; 13619bf0dad6SMatthew G. Knepley } else { 13629bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13639bf0dad6SMatthew G. Knepley } 13649bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13659bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13669bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13679bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13689bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13699bf0dad6SMatthew G. Knepley 13709bf0dad6SMatthew G. Knepley if (ornt < 0) { 13719bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13729bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13739bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13749bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13759bf0dad6SMatthew G. Knepley } 13769bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13779bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13789bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13799bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13809bf0dad6SMatthew G. Knepley } 13819bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 13829bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 13839bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 13849bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 13859bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 13869bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 13879bf0dad6SMatthew G. Knepley 13889bf0dad6SMatthew G. Knepley if (useCone) { 13899bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13909bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13919bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13929bf0dad6SMatthew G. Knepley } else { 13939bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 13949bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13959bf0dad6SMatthew G. Knepley tmpO = NULL; 13969bf0dad6SMatthew G. Knepley } 13979bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 13989bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 13999bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14009bf0dad6SMatthew 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. */ 14019bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14029bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14039bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14049bf0dad6SMatthew G. Knepley PetscInt c; 14059bf0dad6SMatthew G. Knepley 14069bf0dad6SMatthew G. Knepley if (rev) { 14079bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14089bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14099bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14109bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14119bf0dad6SMatthew G. Knepley } 14129bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14139bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14149bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14159bf0dad6SMatthew G. Knepley } 14169bf0dad6SMatthew G. Knepley if (c == closureSize) { 14179bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14189bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14199bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14209bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14219bf0dad6SMatthew G. Knepley closureSize += 2; 14229bf0dad6SMatthew G. Knepley fifoSize += 2; 14239bf0dad6SMatthew G. Knepley } 14249bf0dad6SMatthew G. Knepley } 14259bf0dad6SMatthew G. Knepley fifoStart += 2; 14269bf0dad6SMatthew G. Knepley } 14279bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14289bf0dad6SMatthew G. Knepley if (points) *points = closure; 14299bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14309bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14319bf0dad6SMatthew G. Knepley } 14329bf0dad6SMatthew G. Knepley 14339bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1434552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1435552f7358SJed Brown /*@C 1436552f7358SJed 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 1437552f7358SJed Brown 1438552f7358SJed Brown Not collective 1439552f7358SJed Brown 1440552f7358SJed Brown Input Parameters: 1441552f7358SJed Brown + mesh - The DMPlex 1442552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1443552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1444e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1445e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1446552f7358SJed Brown 1447552f7358SJed Brown Note: 14480298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1449552f7358SJed Brown 14503813dfbdSMatthew G Knepley Fortran Notes: 14513813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14523813dfbdSMatthew G Knepley include petsc.h90 in your code. 14533813dfbdSMatthew G Knepley 14543813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14553813dfbdSMatthew G Knepley 1456552f7358SJed Brown Level: beginner 1457552f7358SJed Brown 1458552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1459552f7358SJed Brown @*/ 1460552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1461552f7358SJed Brown { 1462552f7358SJed Brown PetscErrorCode ierr; 1463552f7358SJed Brown 1464552f7358SJed Brown PetscFunctionBegin; 1465552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1466e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1467e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1468552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14694ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1470552f7358SJed Brown PetscFunctionReturn(0); 1471552f7358SJed Brown } 1472552f7358SJed Brown 1473552f7358SJed Brown #undef __FUNCT__ 1474552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1475552f7358SJed Brown /*@ 1476552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1477552f7358SJed Brown 1478552f7358SJed Brown Not collective 1479552f7358SJed Brown 1480552f7358SJed Brown Input Parameter: 1481552f7358SJed Brown . mesh - The DMPlex 1482552f7358SJed Brown 1483552f7358SJed Brown Output Parameters: 1484552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1485552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1486552f7358SJed Brown 1487552f7358SJed Brown Level: beginner 1488552f7358SJed Brown 1489552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1490552f7358SJed Brown @*/ 1491552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1492552f7358SJed Brown { 1493552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1494552f7358SJed Brown 1495552f7358SJed Brown PetscFunctionBegin; 1496552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1497552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1498552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1499552f7358SJed Brown PetscFunctionReturn(0); 1500552f7358SJed Brown } 1501552f7358SJed Brown 1502552f7358SJed Brown #undef __FUNCT__ 1503552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1504552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1505552f7358SJed Brown { 1506552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1507552f7358SJed Brown PetscInt size; 1508552f7358SJed Brown PetscErrorCode ierr; 1509552f7358SJed Brown 1510552f7358SJed Brown PetscFunctionBegin; 1511552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1512552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1513552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15141795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15151795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1516552f7358SJed Brown if (mesh->maxSupportSize) { 1517552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1518552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15191795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1520552f7358SJed Brown } 1521552f7358SJed Brown PetscFunctionReturn(0); 1522552f7358SJed Brown } 1523552f7358SJed Brown 1524552f7358SJed Brown #undef __FUNCT__ 1525552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1526552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1527552f7358SJed Brown { 1528552f7358SJed Brown PetscErrorCode ierr; 1529552f7358SJed Brown 1530552f7358SJed Brown PetscFunctionBegin; 15314d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15324d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1533552f7358SJed Brown PetscFunctionReturn(0); 1534552f7358SJed Brown } 1535552f7358SJed Brown 1536552f7358SJed Brown #undef __FUNCT__ 1537552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1538552f7358SJed Brown /*@ 1539552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1540552f7358SJed Brown 1541552f7358SJed Brown Not collective 1542552f7358SJed Brown 1543552f7358SJed Brown Input Parameter: 1544552f7358SJed Brown . mesh - The DMPlex 1545552f7358SJed Brown 1546552f7358SJed Brown Output Parameter: 1547552f7358SJed Brown 1548552f7358SJed Brown Note: 1549552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1550552f7358SJed Brown 1551552f7358SJed Brown Level: beginner 1552552f7358SJed Brown 1553552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1554552f7358SJed Brown @*/ 1555552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1556552f7358SJed Brown { 1557552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1558552f7358SJed Brown PetscInt *offsets; 1559552f7358SJed Brown PetscInt supportSize; 1560552f7358SJed Brown PetscInt pStart, pEnd, p; 1561552f7358SJed Brown PetscErrorCode ierr; 1562552f7358SJed Brown 1563552f7358SJed Brown PetscFunctionBegin; 1564552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 156582f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1566552f7358SJed Brown /* Calculate support sizes */ 1567552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1568552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1569552f7358SJed Brown PetscInt dof, off, c; 1570552f7358SJed Brown 1571552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1572552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1573552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1574552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1575552f7358SJed Brown } 1576552f7358SJed Brown } 1577552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1578552f7358SJed Brown PetscInt dof; 1579552f7358SJed Brown 1580552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 15810d644c17SKarl Rupp 1582552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1583552f7358SJed Brown } 1584552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1585552f7358SJed Brown /* Calculate supports */ 1586552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 15871795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 15881795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1589552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1590552f7358SJed Brown PetscInt dof, off, c; 1591552f7358SJed Brown 1592552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1593552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1594552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1595552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1596552f7358SJed Brown PetscInt offS; 1597552f7358SJed Brown 1598552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 15990d644c17SKarl Rupp 1600552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1601552f7358SJed Brown ++offsets[q]; 1602552f7358SJed Brown } 1603552f7358SJed Brown } 1604552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1605552f7358SJed Brown PetscFunctionReturn(0); 1606552f7358SJed Brown } 1607552f7358SJed Brown 1608552f7358SJed Brown #undef __FUNCT__ 1609552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1610552f7358SJed Brown /*@ 1611552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1612552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1613552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1614552f7358SJed Brown the DAG. 1615552f7358SJed Brown 1616552f7358SJed Brown Not collective 1617552f7358SJed Brown 1618552f7358SJed Brown Input Parameter: 1619552f7358SJed Brown . mesh - The DMPlex 1620552f7358SJed Brown 1621552f7358SJed Brown Output Parameter: 1622552f7358SJed Brown 1623552f7358SJed Brown Notes: 1624150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1625150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1626150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1627150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1628552f7358SJed Brown 1629150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1630552f7358SJed Brown 1631552f7358SJed Brown Level: beginner 1632552f7358SJed Brown 1633552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1634552f7358SJed Brown @*/ 1635552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1636552f7358SJed Brown { 1637aa50250dSMatthew G. Knepley DMLabel label; 1638552f7358SJed Brown PetscInt pStart, pEnd, p; 1639552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1640552f7358SJed Brown PetscErrorCode ierr; 1641552f7358SJed Brown 1642552f7358SJed Brown PetscFunctionBegin; 1643552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1644552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1645552f7358SJed Brown /* Calculate depth */ 1646aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1647aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1648aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1649552f7358SJed Brown /* Initialize roots and count leaves */ 1650552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1651552f7358SJed Brown PetscInt coneSize, supportSize; 1652552f7358SJed Brown 1653552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1654552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1655552f7358SJed Brown if (!coneSize && supportSize) { 1656552f7358SJed Brown ++numRoots; 1657aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1658552f7358SJed Brown } else if (!supportSize && coneSize) { 1659552f7358SJed Brown ++numLeaves; 1660552f7358SJed Brown } else if (!supportSize && !coneSize) { 1661552f7358SJed Brown /* Isolated points */ 1662aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1663552f7358SJed Brown } 1664552f7358SJed Brown } 1665552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1666552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1667552f7358SJed Brown PetscInt coneSize, supportSize; 1668552f7358SJed Brown 1669552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1670552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1671552f7358SJed Brown if (!supportSize && coneSize) { 1672aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1673552f7358SJed Brown } 1674552f7358SJed Brown } 1675552f7358SJed Brown } else { 167674ef644bSMatthew G. Knepley IS pointIS; 167774ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1678552f7358SJed Brown 167974ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 168074ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 168174ef644bSMatthew G. Knepley while (numPoints) { 168274ef644bSMatthew G. Knepley const PetscInt *points; 168374ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 168474ef644bSMatthew G. Knepley 168574ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 168674ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 168774ef644bSMatthew G. Knepley const PetscInt point = points[p]; 168874ef644bSMatthew G. Knepley const PetscInt *support; 168974ef644bSMatthew G. Knepley PetscInt supportSize, s; 169074ef644bSMatthew G. Knepley 169174ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 169274ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 169374ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 169474ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1695552f7358SJed Brown } 1696552f7358SJed Brown } 16975edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 169874ef644bSMatthew G. Knepley ++level; 169974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170074ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170174ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170274ef644bSMatthew G. Knepley else {numPoints = 0;} 170374ef644bSMatthew G. Knepley } 170474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170574ef644bSMatthew G. Knepley } 1706552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1707552f7358SJed Brown PetscFunctionReturn(0); 1708552f7358SJed Brown } 1709552f7358SJed Brown 1710552f7358SJed Brown #undef __FUNCT__ 1711552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1712552f7358SJed Brown /*@C 1713552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1714552f7358SJed Brown 1715552f7358SJed Brown Not Collective 1716552f7358SJed Brown 1717552f7358SJed Brown Input Parameters: 1718552f7358SJed Brown + dm - The DMPlex object 1719552f7358SJed Brown . numPoints - The number of input points for the join 1720552f7358SJed Brown - points - The input points 1721552f7358SJed Brown 1722552f7358SJed Brown Output Parameters: 1723552f7358SJed Brown + numCoveredPoints - The number of points in the join 1724552f7358SJed Brown - coveredPoints - The points in the join 1725552f7358SJed Brown 1726552f7358SJed Brown Level: intermediate 1727552f7358SJed Brown 1728552f7358SJed Brown Note: Currently, this is restricted to a single level join 1729552f7358SJed Brown 17303813dfbdSMatthew G Knepley Fortran Notes: 17313813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17323813dfbdSMatthew G Knepley include petsc.h90 in your code. 17333813dfbdSMatthew G Knepley 17343813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17353813dfbdSMatthew G Knepley 1736552f7358SJed Brown .keywords: mesh 1737552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1738552f7358SJed Brown @*/ 1739552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1740552f7358SJed Brown { 1741552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1742552f7358SJed Brown PetscInt *join[2]; 1743552f7358SJed Brown PetscInt joinSize, i = 0; 1744552f7358SJed Brown PetscInt dof, off, p, c, m; 1745552f7358SJed Brown PetscErrorCode ierr; 1746552f7358SJed Brown 1747552f7358SJed Brown PetscFunctionBegin; 1748552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1749552f7358SJed Brown PetscValidPointer(points, 2); 1750552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1751552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1752552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1753552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1754552f7358SJed Brown /* Copy in support of first point */ 1755552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1756552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1757552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1758552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1759552f7358SJed Brown } 1760552f7358SJed Brown /* Check each successive support */ 1761552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1762552f7358SJed Brown PetscInt newJoinSize = 0; 1763552f7358SJed Brown 1764552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1765552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1766552f7358SJed Brown for (c = 0; c < dof; ++c) { 1767552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1768552f7358SJed Brown 1769552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1770552f7358SJed Brown if (point == join[i][m]) { 1771552f7358SJed Brown join[1-i][newJoinSize++] = point; 1772552f7358SJed Brown break; 1773552f7358SJed Brown } 1774552f7358SJed Brown } 1775552f7358SJed Brown } 1776552f7358SJed Brown joinSize = newJoinSize; 1777552f7358SJed Brown i = 1-i; 1778552f7358SJed Brown } 1779552f7358SJed Brown *numCoveredPoints = joinSize; 1780552f7358SJed Brown *coveredPoints = join[i]; 1781552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1782552f7358SJed Brown PetscFunctionReturn(0); 1783552f7358SJed Brown } 1784552f7358SJed Brown 1785552f7358SJed Brown #undef __FUNCT__ 1786552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1787552f7358SJed Brown /*@C 1788552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1789552f7358SJed Brown 1790552f7358SJed Brown Not Collective 1791552f7358SJed Brown 1792552f7358SJed Brown Input Parameters: 1793552f7358SJed Brown + dm - The DMPlex object 1794552f7358SJed Brown . numPoints - The number of input points for the join 1795552f7358SJed Brown - points - The input points 1796552f7358SJed Brown 1797552f7358SJed Brown Output Parameters: 1798552f7358SJed Brown + numCoveredPoints - The number of points in the join 1799552f7358SJed Brown - coveredPoints - The points in the join 1800552f7358SJed Brown 18013813dfbdSMatthew G Knepley Fortran Notes: 18023813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18033813dfbdSMatthew G Knepley include petsc.h90 in your code. 18043813dfbdSMatthew G Knepley 18053813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18063813dfbdSMatthew G Knepley 1807552f7358SJed Brown Level: intermediate 1808552f7358SJed Brown 1809552f7358SJed Brown .keywords: mesh 1810552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1811552f7358SJed Brown @*/ 1812552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1813552f7358SJed Brown { 1814552f7358SJed Brown PetscErrorCode ierr; 1815552f7358SJed Brown 1816552f7358SJed Brown PetscFunctionBegin; 1817552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1818d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1819d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1820d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1821552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1822d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1823552f7358SJed Brown PetscFunctionReturn(0); 1824552f7358SJed Brown } 1825552f7358SJed Brown 1826552f7358SJed Brown #undef __FUNCT__ 1827552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1828552f7358SJed Brown /*@C 1829552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1830552f7358SJed Brown 1831552f7358SJed Brown Not Collective 1832552f7358SJed Brown 1833552f7358SJed Brown Input Parameters: 1834552f7358SJed Brown + dm - The DMPlex object 1835552f7358SJed Brown . numPoints - The number of input points for the join 1836552f7358SJed Brown - points - The input points 1837552f7358SJed Brown 1838552f7358SJed Brown Output Parameters: 1839552f7358SJed Brown + numCoveredPoints - The number of points in the join 1840552f7358SJed Brown - coveredPoints - The points in the join 1841552f7358SJed Brown 18423813dfbdSMatthew G Knepley Fortran Notes: 18433813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18443813dfbdSMatthew G Knepley include petsc.h90 in your code. 18453813dfbdSMatthew G Knepley 18463813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18473813dfbdSMatthew G Knepley 1848552f7358SJed Brown Level: intermediate 1849552f7358SJed Brown 1850552f7358SJed Brown .keywords: mesh 1851552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1852552f7358SJed Brown @*/ 1853552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1854552f7358SJed Brown { 1855552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1856552f7358SJed Brown PetscInt *offsets, **closures; 1857552f7358SJed Brown PetscInt *join[2]; 1858552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1859552f7358SJed Brown PetscInt p, d, c, m; 1860552f7358SJed Brown PetscErrorCode ierr; 1861552f7358SJed Brown 1862552f7358SJed Brown PetscFunctionBegin; 1863552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1864552f7358SJed Brown PetscValidPointer(points, 2); 1865552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1866552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1867552f7358SJed Brown 1868552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18691795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1870552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1871e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1872552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1873552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1874552f7358SJed Brown 1875552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1876552f7358SJed Brown PetscInt closureSize; 1877552f7358SJed Brown 1878552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 18790d644c17SKarl Rupp 1880552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1881552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1882552f7358SJed Brown PetscInt pStart, pEnd, i; 1883552f7358SJed Brown 1884552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1885552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1886552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1887552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1888552f7358SJed Brown break; 1889552f7358SJed Brown } 1890552f7358SJed Brown } 1891552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1892552f7358SJed Brown } 189382f516ccSBarry 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); 1894552f7358SJed Brown } 1895552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1896552f7358SJed Brown PetscInt dof; 1897552f7358SJed Brown 1898552f7358SJed Brown /* Copy in support of first point */ 1899552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1900552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1901552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1902552f7358SJed Brown } 1903552f7358SJed Brown /* Check each successive cone */ 1904552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1905552f7358SJed Brown PetscInt newJoinSize = 0; 1906552f7358SJed Brown 1907552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1908552f7358SJed Brown for (c = 0; c < dof; ++c) { 1909552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1910552f7358SJed Brown 1911552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1912552f7358SJed Brown if (point == join[i][m]) { 1913552f7358SJed Brown join[1-i][newJoinSize++] = point; 1914552f7358SJed Brown break; 1915552f7358SJed Brown } 1916552f7358SJed Brown } 1917552f7358SJed Brown } 1918552f7358SJed Brown joinSize = newJoinSize; 1919552f7358SJed Brown i = 1-i; 1920552f7358SJed Brown } 1921552f7358SJed Brown if (joinSize) break; 1922552f7358SJed Brown } 1923552f7358SJed Brown *numCoveredPoints = joinSize; 1924552f7358SJed Brown *coveredPoints = join[i]; 1925552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19260298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1927552f7358SJed Brown } 1928552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1929552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1930552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1931552f7358SJed Brown PetscFunctionReturn(0); 1932552f7358SJed Brown } 1933552f7358SJed Brown 1934552f7358SJed Brown #undef __FUNCT__ 1935552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1936552f7358SJed Brown /*@C 1937552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1938552f7358SJed Brown 1939552f7358SJed Brown Not Collective 1940552f7358SJed Brown 1941552f7358SJed Brown Input Parameters: 1942552f7358SJed Brown + dm - The DMPlex object 1943552f7358SJed Brown . numPoints - The number of input points for the meet 1944552f7358SJed Brown - points - The input points 1945552f7358SJed Brown 1946552f7358SJed Brown Output Parameters: 1947552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1948552f7358SJed Brown - coveredPoints - The points in the meet 1949552f7358SJed Brown 1950552f7358SJed Brown Level: intermediate 1951552f7358SJed Brown 1952552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1953552f7358SJed Brown 19543813dfbdSMatthew G Knepley Fortran Notes: 19553813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19563813dfbdSMatthew G Knepley include petsc.h90 in your code. 19573813dfbdSMatthew G Knepley 19583813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19593813dfbdSMatthew G Knepley 1960552f7358SJed Brown .keywords: mesh 1961552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1962552f7358SJed Brown @*/ 1963552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1964552f7358SJed Brown { 1965552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1966552f7358SJed Brown PetscInt *meet[2]; 1967552f7358SJed Brown PetscInt meetSize, i = 0; 1968552f7358SJed Brown PetscInt dof, off, p, c, m; 1969552f7358SJed Brown PetscErrorCode ierr; 1970552f7358SJed Brown 1971552f7358SJed Brown PetscFunctionBegin; 1972552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1973552f7358SJed Brown PetscValidPointer(points, 2); 1974552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1975552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1976552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1977552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1978552f7358SJed Brown /* Copy in cone of first point */ 1979552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1980552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1981552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1982552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1983552f7358SJed Brown } 1984552f7358SJed Brown /* Check each successive cone */ 1985552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1986552f7358SJed Brown PetscInt newMeetSize = 0; 1987552f7358SJed Brown 1988552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1989552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1990552f7358SJed Brown for (c = 0; c < dof; ++c) { 1991552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1992552f7358SJed Brown 1993552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1994552f7358SJed Brown if (point == meet[i][m]) { 1995552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1996552f7358SJed Brown break; 1997552f7358SJed Brown } 1998552f7358SJed Brown } 1999552f7358SJed Brown } 2000552f7358SJed Brown meetSize = newMeetSize; 2001552f7358SJed Brown i = 1-i; 2002552f7358SJed Brown } 2003552f7358SJed Brown *numCoveringPoints = meetSize; 2004552f7358SJed Brown *coveringPoints = meet[i]; 2005552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2006552f7358SJed Brown PetscFunctionReturn(0); 2007552f7358SJed Brown } 2008552f7358SJed Brown 2009552f7358SJed Brown #undef __FUNCT__ 2010552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2011552f7358SJed Brown /*@C 2012552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2013552f7358SJed Brown 2014552f7358SJed Brown Not Collective 2015552f7358SJed Brown 2016552f7358SJed Brown Input Parameters: 2017552f7358SJed Brown + dm - The DMPlex object 2018552f7358SJed Brown . numPoints - The number of input points for the meet 2019552f7358SJed Brown - points - The input points 2020552f7358SJed Brown 2021552f7358SJed Brown Output Parameters: 2022552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2023552f7358SJed Brown - coveredPoints - The points in the meet 2024552f7358SJed Brown 2025552f7358SJed Brown Level: intermediate 2026552f7358SJed Brown 20273813dfbdSMatthew G Knepley Fortran Notes: 20283813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20293813dfbdSMatthew G Knepley include petsc.h90 in your code. 20303813dfbdSMatthew G Knepley 20313813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20323813dfbdSMatthew G Knepley 2033552f7358SJed Brown .keywords: mesh 2034552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2035552f7358SJed Brown @*/ 2036552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2037552f7358SJed Brown { 2038552f7358SJed Brown PetscErrorCode ierr; 2039552f7358SJed Brown 2040552f7358SJed Brown PetscFunctionBegin; 2041552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2042d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2043d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2044d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2045552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2046d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2047552f7358SJed Brown PetscFunctionReturn(0); 2048552f7358SJed Brown } 2049552f7358SJed Brown 2050552f7358SJed Brown #undef __FUNCT__ 2051552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2052552f7358SJed Brown /*@C 2053552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2054552f7358SJed Brown 2055552f7358SJed Brown Not Collective 2056552f7358SJed Brown 2057552f7358SJed Brown Input Parameters: 2058552f7358SJed Brown + dm - The DMPlex object 2059552f7358SJed Brown . numPoints - The number of input points for the meet 2060552f7358SJed Brown - points - The input points 2061552f7358SJed Brown 2062552f7358SJed Brown Output Parameters: 2063552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2064552f7358SJed Brown - coveredPoints - The points in the meet 2065552f7358SJed Brown 2066552f7358SJed Brown Level: intermediate 2067552f7358SJed Brown 20683813dfbdSMatthew G Knepley Fortran Notes: 20693813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20703813dfbdSMatthew G Knepley include petsc.h90 in your code. 20713813dfbdSMatthew G Knepley 20723813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20733813dfbdSMatthew G Knepley 2074552f7358SJed Brown .keywords: mesh 2075552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2076552f7358SJed Brown @*/ 2077552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2078552f7358SJed Brown { 2079552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2080552f7358SJed Brown PetscInt *offsets, **closures; 2081552f7358SJed Brown PetscInt *meet[2]; 2082552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2083552f7358SJed Brown PetscInt p, h, c, m; 2084552f7358SJed Brown PetscErrorCode ierr; 2085552f7358SJed Brown 2086552f7358SJed Brown PetscFunctionBegin; 2087552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2088552f7358SJed Brown PetscValidPointer(points, 2); 2089552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2090552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2091552f7358SJed Brown 2092552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2093785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2094552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2095e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2096552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2097552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2098552f7358SJed Brown 2099552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2100552f7358SJed Brown PetscInt closureSize; 2101552f7358SJed Brown 2102552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21030d644c17SKarl Rupp 2104552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2105552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2106552f7358SJed Brown PetscInt pStart, pEnd, i; 2107552f7358SJed Brown 2108552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2109552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2110552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2111552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2112552f7358SJed Brown break; 2113552f7358SJed Brown } 2114552f7358SJed Brown } 2115552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2116552f7358SJed Brown } 211782f516ccSBarry 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); 2118552f7358SJed Brown } 2119552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2120552f7358SJed Brown PetscInt dof; 2121552f7358SJed Brown 2122552f7358SJed Brown /* Copy in cone of first point */ 2123552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2124552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2125552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2126552f7358SJed Brown } 2127552f7358SJed Brown /* Check each successive cone */ 2128552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2129552f7358SJed Brown PetscInt newMeetSize = 0; 2130552f7358SJed Brown 2131552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2132552f7358SJed Brown for (c = 0; c < dof; ++c) { 2133552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2134552f7358SJed Brown 2135552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2136552f7358SJed Brown if (point == meet[i][m]) { 2137552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2138552f7358SJed Brown break; 2139552f7358SJed Brown } 2140552f7358SJed Brown } 2141552f7358SJed Brown } 2142552f7358SJed Brown meetSize = newMeetSize; 2143552f7358SJed Brown i = 1-i; 2144552f7358SJed Brown } 2145552f7358SJed Brown if (meetSize) break; 2146552f7358SJed Brown } 2147552f7358SJed Brown *numCoveredPoints = meetSize; 2148552f7358SJed Brown *coveredPoints = meet[i]; 2149552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21500298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2151552f7358SJed Brown } 2152552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2153552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2154552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2155552f7358SJed Brown PetscFunctionReturn(0); 2156552f7358SJed Brown } 2157552f7358SJed Brown 2158552f7358SJed Brown #undef __FUNCT__ 21594e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21604e3744c5SMatthew G. Knepley /*@C 21614e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21624e3744c5SMatthew G. Knepley 21634e3744c5SMatthew G. Knepley Not Collective 21644e3744c5SMatthew G. Knepley 21654e3744c5SMatthew G. Knepley Input Parameters: 21664e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21674e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21684e3744c5SMatthew G. Knepley 21694e3744c5SMatthew G. Knepley Output Parameters: 21704e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21714e3744c5SMatthew G. Knepley 21724e3744c5SMatthew G. Knepley Level: intermediate 21734e3744c5SMatthew G. Knepley 21744e3744c5SMatthew G. Knepley Notes: 21754e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21764e3744c5SMatthew G. Knepley 21774e3744c5SMatthew G. Knepley .keywords: mesh 21784e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 21794e3744c5SMatthew G. Knepley @*/ 21804e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 21814e3744c5SMatthew G. Knepley { 21824e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 21834e3744c5SMatthew G. Knepley PetscErrorCode ierr; 21844e3744c5SMatthew G. Knepley 21854e3744c5SMatthew G. Knepley PetscFunctionBegin; 21864e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 21874e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 21884e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 21894e3744c5SMatthew G. Knepley 21904e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 21914e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21924e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 21934e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 21944e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 21954e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 21964e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 21974e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 21984e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 21994e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22004e3744c5SMatthew G. Knepley 22014e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22024e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22034e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22044e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22054e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22064e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22074e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22084e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22094e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22104e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22114e3744c5SMatthew G. Knepley } 22124e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22134e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22144e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22154e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22164e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22174e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22184e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22194e3744c5SMatthew G. Knepley } 22204e3744c5SMatthew G. Knepley } 22214e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22224e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22234e3744c5SMatthew G. Knepley } 22244e3744c5SMatthew G. Knepley 22254e3744c5SMatthew G. Knepley #undef __FUNCT__ 222618ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 222718ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2228a6dfd86eSKarl Rupp { 222982f516ccSBarry Smith MPI_Comm comm; 2230552f7358SJed Brown PetscErrorCode ierr; 2231552f7358SJed Brown 2232552f7358SJed Brown PetscFunctionBegin; 223382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2234552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2235552f7358SJed Brown switch (cellDim) { 2236552f7358SJed Brown case 0: 2237552f7358SJed Brown *numFaceVertices = 0; 2238552f7358SJed Brown break; 2239552f7358SJed Brown case 1: 2240552f7358SJed Brown *numFaceVertices = 1; 2241552f7358SJed Brown break; 2242552f7358SJed Brown case 2: 2243552f7358SJed Brown switch (numCorners) { 224419436ca2SJed Brown case 3: /* triangle */ 224519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2246552f7358SJed Brown break; 224719436ca2SJed Brown case 4: /* quadrilateral */ 224819436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2249552f7358SJed Brown break; 225019436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 225119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2252552f7358SJed Brown break; 225319436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 225419436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2255552f7358SJed Brown break; 2256552f7358SJed Brown default: 2257552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2258552f7358SJed Brown } 2259552f7358SJed Brown break; 2260552f7358SJed Brown case 3: 2261552f7358SJed Brown switch (numCorners) { 226219436ca2SJed Brown case 4: /* tetradehdron */ 226319436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2264552f7358SJed Brown break; 226519436ca2SJed Brown case 6: /* tet cohesive cells */ 226619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2267552f7358SJed Brown break; 226819436ca2SJed Brown case 8: /* hexahedron */ 226919436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2270552f7358SJed Brown break; 227119436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 227219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2273552f7358SJed Brown break; 227419436ca2SJed Brown case 10: /* quadratic tetrahedron */ 227519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2276552f7358SJed Brown break; 227719436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 227819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2279552f7358SJed Brown break; 228019436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 228119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2282552f7358SJed Brown break; 228319436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 228419436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2285552f7358SJed Brown break; 2286552f7358SJed Brown default: 2287552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2288552f7358SJed Brown } 2289552f7358SJed Brown break; 2290552f7358SJed Brown default: 2291552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2292552f7358SJed Brown } 2293552f7358SJed Brown PetscFunctionReturn(0); 2294552f7358SJed Brown } 2295552f7358SJed Brown 2296552f7358SJed Brown #undef __FUNCT__ 2297d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2298d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2299d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2300d27a0f52SMatthew G. Knepley { 2301a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2302a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2303a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2304d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2305d27a0f52SMatthew G. Knepley 2306d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2307d27a0f52SMatthew G. Knepley /* Truth Table 2308d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2309d27a0f52SMatthew G. Knepley F 0 flips no F F F 2310d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2311d27a0f52SMatthew G. Knepley F 2 flips no T F T 2312d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2313d27a0f52SMatthew G. Knepley T 1 flip no 2314d27a0f52SMatthew G. Knepley T 2 flips yes 2315d27a0f52SMatthew G. Knepley */ 2316c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2317d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2318a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2319d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2320a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2321a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2322a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2323a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2324a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2325a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2326785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2327a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2328a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2329defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2330a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2331a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2332a1b4d4a2SMatthew G. Knepley 2333a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2334a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2335a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2336a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2337a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2338a1b4d4a2SMatthew G. Knepley } 2339a1b4d4a2SMatthew G. Knepley } 2340a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2341a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2342d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2343a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2344d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2345d27a0f52SMatthew G. Knepley 2346a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2347a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2348a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2349d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2350d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2351a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 235286cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2353a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 235486cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2355d27a0f52SMatthew G. Knepley 2356d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2357d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2358d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2359d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2360d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2361d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2362a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2363a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2364a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2365a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2366a1b4d4a2SMatthew G. Knepley } 2367a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2368a1b4d4a2SMatthew 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); 2369a1b4d4a2SMatthew G. Knepley } 2370a1b4d4a2SMatthew 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]); 2371a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2372a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2373a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2374a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2375a1b4d4a2SMatthew G. Knepley } 2376a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2377a1b4d4a2SMatthew 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); 2378a1b4d4a2SMatthew G. Knepley } 2379a1b4d4a2SMatthew 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]); 2380d27a0f52SMatthew G. Knepley 2381d27a0f52SMatthew G. Knepley if (dim == 1) { 2382d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2383d27a0f52SMatthew G. Knepley } else { 2384d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2385d27a0f52SMatthew G. Knepley } 2386d27a0f52SMatthew G. Knepley 2387d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2388d27a0f52SMatthew 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]); 2389d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2390a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2391d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2392a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2393d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 239486cff514SMatthew 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"); 2395a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2396a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2397d27a0f52SMatthew G. Knepley } 2398fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2399fedde076SMatthew G. Knepley { 2400fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2401fedde076SMatthew G. Knepley PetscSF sf; 2402fedde076SMatthew G. Knepley const PetscInt *lpoints; 2403fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 240413048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2405fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2406a1b4d4a2SMatthew G. Knepley 2407fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2408fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2409fedde076SMatthew G. Knepley if (numLeaves >= 0) { 241062ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 241162ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 241262ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 241313048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 241462ad4a6aSMatthew G. Knepley 2415fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2416fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2417fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2418fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2419fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2420fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2421fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2422fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2423fedde076SMatthew G. Knepley PetscInt supportSize; 2424fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2425fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2426fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2427fedde076SMatthew G. Knepley } 2428fedde076SMatthew G. Knepley } 2429fedde076SMatthew G. Knepley } 243013048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2431fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2432fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2433fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2434fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2435fedde076SMatthew G. Knepley 2436fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 243762ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2438fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2439fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24405b7033fcSMatthew G. Knepley if (dim == 1) { 24415b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24425b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24435b7033fcSMatthew G. Knepley } else { 2444fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2445fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2446fedde076SMatthew G. Knepley } 24475b7033fcSMatthew G. Knepley } 2448fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2449fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2450fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2451fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2452fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2453fedde076SMatthew G. Knepley 245413048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 245513048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 245613048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2457fedde076SMatthew G. Knepley } 245813048561SMatthew G. Knepley /* Collect the graph on 0 */ 245913048561SMatthew G. Knepley { 246013048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2461e8f90184SMatthew G. Knepley Mat G; 246213048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 246313048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 246413048561SMatthew G. Knepley PetscInt *adj = NULL; 246513048561SMatthew G. Knepley PetscBool *val = NULL; 246613048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 246713048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 246813048561SMatthew G. Knepley PetscInt debug = 0; 246913048561SMatthew G. Knepley 247013048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 247113048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 247213048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 247313048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 247413048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 247513048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 247613048561SMatthew G. Knepley } 247713048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 247813048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 247913048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 248013048561SMatthew G. Knepley if (debug) { 248113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 248213048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 248313048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 248413048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 248513048561SMatthew G. Knepley } 248613048561SMatthew G. Knepley } 248713048561SMatthew G. Knepley } 2488e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2489e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2490e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2491e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2492e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2493e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 24949a4fe19dSMatthew G. Knepley const PetscInt r = p; 2495e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 24967406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2497e8f90184SMatthew G. Knepley 24987406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 24997406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2500e8f90184SMatthew G. Knepley } 2501e8f90184SMatthew G. Knepley } 2502e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2503e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2504e8f90184SMatthew G. Knepley 250513048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 250613048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 250713048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 250813048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 250913048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 251013048561SMatthew G. Knepley pTop = pBottom = 0; 251113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251213048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 251313048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 251413048561SMatthew G. Knepley procFIFO[pBottom++] = p; 251513048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 251613048561SMatthew G. Knepley /* Consider each proc in FIFO */ 251713048561SMatthew G. Knepley while (pTop < pBottom) { 2518e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2519e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2520e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 252113048561SMatthew G. Knepley 252213048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252313048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2524e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 252513048561SMatthew G. Knepley /* Loop over neighboring procs */ 2526e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2527e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25287406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 252913048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 253013048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 253113048561SMatthew G. Knepley 253213048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253313048561SMatthew G. Knepley if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc); 253413048561SMatthew G. Knepley if (!flippedB) { 253513048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 253613048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 253713048561SMatthew G. Knepley } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 253813048561SMatthew G. Knepley if (!seen) { 253913048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 254013048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 254113048561SMatthew G. Knepley } 254213048561SMatthew G. Knepley } 254313048561SMatthew G. Knepley } 254413048561SMatthew G. Knepley } 254513048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2546e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 254713048561SMatthew G. Knepley 254813048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 254913048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 255013048561SMatthew G. Knepley { 255113048561SMatthew G. Knepley PetscBool *flips; 255213048561SMatthew G. Knepley 255313048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255413048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255513048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 255613048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 255713048561SMatthew G. Knepley } 255813048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 255913048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 256013048561SMatthew G. Knepley } 256113048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256213048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256313048561SMatthew G. Knepley } 256413048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2565fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 256613048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2567fedde076SMatthew G. Knepley } 2568fedde076SMatthew G. Knepley } 2569fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2570d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2571d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2572d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2573a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2574f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2575f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2576d27a0f52SMatthew G. Knepley 2577a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2578a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2579a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2580a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2581a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2582a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2583a1b4d4a2SMatthew G. Knepley 2584a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2585a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2586a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2587d27a0f52SMatthew G. Knepley } 2588a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2589a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2590f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2591f4e909fcSMatthew G. Knepley faceSize = coneSize; 2592f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2593f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2594f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2595f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2596f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2597f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2598f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2599f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2600f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2601f4e909fcSMatthew G. Knepley } 2602f4e909fcSMatthew G. Knepley } 2603d27a0f52SMatthew G. Knepley } 2604d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2605d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2606d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2607a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2608a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2609a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2610d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2611d27a0f52SMatthew G. Knepley } 2612d27a0f52SMatthew G. Knepley 2613d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2614d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 2615d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2616d49fcaecSMatthew G. Knepley { 2617d49fcaecSMatthew G. Knepley PetscInt d; 2618d49fcaecSMatthew G. Knepley 2619d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2620d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2621d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2622d49fcaecSMatthew G. Knepley } else { 2623d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2624d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2625858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2626d49fcaecSMatthew G. Knepley } else { 2627d49fcaecSMatthew G. Knepley out[d] = in[d]; 2628d49fcaecSMatthew G. Knepley } 2629d49fcaecSMatthew G. Knepley } 2630d49fcaecSMatthew G. Knepley } 2631d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2632d49fcaecSMatthew G. Knepley } 2633d49fcaecSMatthew G. Knepley 2634d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2635d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 2636d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2637d49fcaecSMatthew G. Knepley { 2638d49fcaecSMatthew G. Knepley PetscInt d; 2639d49fcaecSMatthew G. Knepley 2640d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2641d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2642d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 2643d49fcaecSMatthew G. Knepley } else { 2644d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2645d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2646858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2647d49fcaecSMatthew G. Knepley } else { 2648d49fcaecSMatthew G. Knepley out[d] += in[d]; 2649d49fcaecSMatthew G. Knepley } 2650d49fcaecSMatthew G. Knepley } 2651d49fcaecSMatthew G. Knepley } 2652d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2653d49fcaecSMatthew G. Knepley } 2654d49fcaecSMatthew G. Knepley 2655d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2656d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 2657d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 2658d49fcaecSMatthew G. Knepley { 2659d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 2660d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 2661d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 26628c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 2663d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 2664d49fcaecSMatthew G. Knepley 2665d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2666d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2667d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 2668d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2669d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2670d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2671d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2672d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 26738c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 26748c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 26758c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 2676d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 2677d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2678d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2679d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 26808c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 2681d49fcaecSMatthew G. Knepley } 2682d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2683d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 2684d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 26858c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 2686d49fcaecSMatthew G. Knepley } 2687d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 2688d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 2689d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 2690d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 2691d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 2692d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2693d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 2694d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2695d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 2696d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2697d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2698d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2699d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 2700d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 2701d49fcaecSMatthew G. Knepley } 2702d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2703d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2704d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 2705d49fcaecSMatthew G. Knepley PetscInt b; 2706d49fcaecSMatthew G. Knepley 2707d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2708d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 2709d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 2710d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 2711d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2712d49fcaecSMatthew G. Knepley } 2713d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2714d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2715d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 271646e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 2717d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 2718d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 2719d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 2720d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2721d49fcaecSMatthew G. Knepley } 2722d49fcaecSMatthew G. Knepley 2723d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2724aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 2725552f7358SJed Brown /*@ 2726aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 2727552f7358SJed Brown 2728552f7358SJed Brown Not Collective 2729552f7358SJed Brown 2730aa50250dSMatthew G. Knepley Input Parameter: 2731552f7358SJed Brown . dm - The DMPlex object 2732552f7358SJed Brown 2733aa50250dSMatthew G. Knepley Output Parameter: 2734aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 2735552f7358SJed Brown 2736552f7358SJed Brown Level: developer 2737552f7358SJed Brown 2738aa50250dSMatthew G. Knepley .keywords: mesh, points 2739aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2740aa50250dSMatthew G. Knepley @*/ 2741aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 2742aa50250dSMatthew G. Knepley { 2743aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2744aa50250dSMatthew G. Knepley PetscErrorCode ierr; 2745aa50250dSMatthew G. Knepley 2746aa50250dSMatthew G. Knepley PetscFunctionBegin; 2747aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2748aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 274963d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 2750aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 2751aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 2752aa50250dSMatthew G. Knepley } 2753aa50250dSMatthew G. Knepley 2754aa50250dSMatthew G. Knepley #undef __FUNCT__ 2755aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 2756aa50250dSMatthew G. Knepley /*@ 2757aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 2758aa50250dSMatthew G. Knepley 2759aa50250dSMatthew G. Knepley Not Collective 2760aa50250dSMatthew G. Knepley 2761aa50250dSMatthew G. Knepley Input Parameter: 2762aa50250dSMatthew G. Knepley . dm - The DMPlex object 2763aa50250dSMatthew G. Knepley 2764aa50250dSMatthew G. Knepley Output Parameter: 2765aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 2766aa50250dSMatthew G. Knepley 2767aa50250dSMatthew G. Knepley Level: developer 2768552f7358SJed Brown 2769552f7358SJed Brown .keywords: mesh, points 2770aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2771552f7358SJed Brown @*/ 2772552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 2773552f7358SJed Brown { 2774aa50250dSMatthew G. Knepley DMLabel label; 2775aa50250dSMatthew G. Knepley PetscInt d = 0; 2776552f7358SJed Brown PetscErrorCode ierr; 2777552f7358SJed Brown 2778552f7358SJed Brown PetscFunctionBegin; 2779552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2780552f7358SJed Brown PetscValidPointer(depth, 2); 2781aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2782aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 2783552f7358SJed Brown *depth = d-1; 2784552f7358SJed Brown PetscFunctionReturn(0); 2785552f7358SJed Brown } 2786552f7358SJed Brown 2787552f7358SJed Brown #undef __FUNCT__ 2788552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 2789552f7358SJed Brown /*@ 2790552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 2791552f7358SJed Brown 2792552f7358SJed Brown Not Collective 2793552f7358SJed Brown 2794552f7358SJed Brown Input Parameters: 2795552f7358SJed Brown + dm - The DMPlex object 2796552f7358SJed Brown - stratumValue - The requested depth 2797552f7358SJed Brown 2798552f7358SJed Brown Output Parameters: 2799552f7358SJed Brown + start - The first point at this depth 2800552f7358SJed Brown - end - One beyond the last point at this depth 2801552f7358SJed Brown 2802552f7358SJed Brown Level: developer 2803552f7358SJed Brown 2804552f7358SJed Brown .keywords: mesh, points 2805552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 2806552f7358SJed Brown @*/ 28070adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 28080adebc6cSBarry Smith { 2809aa50250dSMatthew G. Knepley DMLabel label; 281063d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 2811552f7358SJed Brown PetscErrorCode ierr; 2812552f7358SJed Brown 2813552f7358SJed Brown PetscFunctionBegin; 2814552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 281563d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 281663d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2817552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 28180d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 281963d1a920SMatthew G. Knepley if (stratumValue < 0) { 282063d1a920SMatthew G. Knepley if (start) *start = pStart; 282163d1a920SMatthew G. Knepley if (end) *end = pEnd; 282263d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2823552f7358SJed Brown } 2824aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 282563d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 282663d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 2827552f7358SJed Brown PetscFunctionReturn(0); 2828552f7358SJed Brown } 2829552f7358SJed Brown 2830552f7358SJed Brown #undef __FUNCT__ 2831552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 2832552f7358SJed Brown /*@ 2833552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 2834552f7358SJed Brown 2835552f7358SJed Brown Not Collective 2836552f7358SJed Brown 2837552f7358SJed Brown Input Parameters: 2838552f7358SJed Brown + dm - The DMPlex object 2839552f7358SJed Brown - stratumValue - The requested height 2840552f7358SJed Brown 2841552f7358SJed Brown Output Parameters: 2842552f7358SJed Brown + start - The first point at this height 2843552f7358SJed Brown - end - One beyond the last point at this height 2844552f7358SJed Brown 2845552f7358SJed Brown Level: developer 2846552f7358SJed Brown 2847552f7358SJed Brown .keywords: mesh, points 2848552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 2849552f7358SJed Brown @*/ 28500adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 28510adebc6cSBarry Smith { 2852aa50250dSMatthew G. Knepley DMLabel label; 285363d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 2854552f7358SJed Brown PetscErrorCode ierr; 2855552f7358SJed Brown 2856552f7358SJed Brown PetscFunctionBegin; 2857552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 285863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 285963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2860552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 28610d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 286263d1a920SMatthew G. Knepley if (stratumValue < 0) { 286363d1a920SMatthew G. Knepley if (start) *start = pStart; 286463d1a920SMatthew G. Knepley if (end) *end = pEnd; 286563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2866552f7358SJed Brown } 2867aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2868aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 286963d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 287063d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 2871552f7358SJed Brown PetscFunctionReturn(0); 2872552f7358SJed Brown } 2873552f7358SJed Brown 2874552f7358SJed Brown #undef __FUNCT__ 2875552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 2876552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 2877a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 2878a6dfd86eSKarl Rupp { 2879552f7358SJed Brown PetscInt *numDofTot; 2880916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 2881916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 2882552f7358SJed Brown PetscErrorCode ierr; 2883552f7358SJed Brown 2884552f7358SJed Brown PetscFunctionBegin; 2885785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 2886552f7358SJed Brown for (d = 0; d <= dim; ++d) { 2887552f7358SJed Brown numDofTot[d] = 0; 28880d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 2889552f7358SJed Brown } 289082f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2891552f7358SJed Brown if (numFields > 0) { 2892552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 2893552f7358SJed Brown if (numComp) { 2894552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2895552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 2896552f7358SJed Brown } 2897552f7358SJed Brown } 2898552f7358SJed Brown } 2899552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2900552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 2901916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2902916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 2903916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 2904916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 2905552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2906552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2907552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 2908552f7358SJed Brown } 2909552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 2910552f7358SJed Brown } 2911552f7358SJed Brown } 2912552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 2913552f7358SJed Brown PetscFunctionReturn(0); 2914552f7358SJed Brown } 2915552f7358SJed Brown 2916552f7358SJed Brown #undef __FUNCT__ 2917552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 2918552f7358SJed Brown /* Set the number of dof on each point and separate by fields 2919552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 2920552f7358SJed Brown */ 2921a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 2922a6dfd86eSKarl Rupp { 2923552f7358SJed Brown PetscInt numFields; 2924552f7358SJed Brown PetscInt bc; 2925552f7358SJed Brown PetscErrorCode ierr; 2926552f7358SJed Brown 2927552f7358SJed Brown PetscFunctionBegin; 2928552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2929552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 2930552f7358SJed Brown PetscInt field = 0; 2931552f7358SJed Brown const PetscInt *idx; 2932552f7358SJed Brown PetscInt n, i; 2933552f7358SJed Brown 29340d644c17SKarl Rupp if (numFields) field = bcField[bc]; 2935552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2936552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2937552f7358SJed Brown for (i = 0; i < n; ++i) { 2938552f7358SJed Brown const PetscInt p = idx[i]; 2939552f7358SJed Brown PetscInt numConst = constDof; 2940552f7358SJed Brown 2941552f7358SJed Brown /* Constrain every dof on the point */ 2942552f7358SJed Brown if (numConst < 0) { 2943552f7358SJed Brown if (numFields) { 2944552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 2945552f7358SJed Brown } else { 2946552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 2947552f7358SJed Brown } 2948552f7358SJed Brown } 2949552f7358SJed Brown if (numFields) { 2950552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 2951552f7358SJed Brown } 2952552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 2953552f7358SJed Brown } 2954552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2955552f7358SJed Brown } 2956552f7358SJed Brown PetscFunctionReturn(0); 2957552f7358SJed Brown } 2958552f7358SJed Brown 2959552f7358SJed Brown #undef __FUNCT__ 2960552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 2961552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 29620adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 29630adebc6cSBarry Smith { 2964552f7358SJed Brown PetscInt *maxConstraints; 2965552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 2966552f7358SJed Brown PetscErrorCode ierr; 2967552f7358SJed Brown 2968552f7358SJed Brown PetscFunctionBegin; 2969552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2970552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2971785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 29720d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 2973552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2974552f7358SJed Brown PetscInt cdof; 2975552f7358SJed Brown 2976552f7358SJed Brown if (numFields) { 2977552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2978552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 2979552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 2980552f7358SJed Brown } 2981552f7358SJed Brown } else { 2982552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2983552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 2984552f7358SJed Brown } 2985552f7358SJed Brown } 2986552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2987552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 2988552f7358SJed Brown } 2989552f7358SJed Brown if (maxConstraints[numFields]) { 2990552f7358SJed Brown PetscInt *indices; 2991552f7358SJed Brown 2992785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 2993552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2994552f7358SJed Brown PetscInt cdof, d; 2995552f7358SJed Brown 2996552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2997552f7358SJed Brown if (cdof) { 2998552f7358SJed 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]); 2999552f7358SJed Brown if (numFields) { 3000552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3001552f7358SJed Brown 3002552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3003552f7358SJed Brown PetscInt cfdof, fdof; 3004552f7358SJed Brown 3005552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3006552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 3007552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 30080d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 3009552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 30100d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 3011552f7358SJed Brown numConst += cfdof; 3012552f7358SJed Brown foff += fdof; 3013552f7358SJed Brown } 3014552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3015552f7358SJed Brown } else { 30160d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 3017552f7358SJed Brown } 3018552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3019552f7358SJed Brown } 3020552f7358SJed Brown } 3021552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3022552f7358SJed Brown } 3023552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 3024552f7358SJed Brown PetscFunctionReturn(0); 3025552f7358SJed Brown } 3026552f7358SJed Brown 3027552f7358SJed Brown #undef __FUNCT__ 3028552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 3029552f7358SJed Brown /* Set the constrained field indices on each point */ 30300adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 30310adebc6cSBarry Smith { 3032552f7358SJed Brown const PetscInt *points, *indices; 3033552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 3034552f7358SJed Brown PetscErrorCode ierr; 3035552f7358SJed Brown 3036552f7358SJed Brown PetscFunctionBegin; 3037552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3038552f7358SJed 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); 3039552f7358SJed Brown 3040552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 3041552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 3042552f7358SJed Brown if (!constraintIndices) { 3043552f7358SJed Brown PetscInt *idx, i; 3044552f7358SJed Brown 3045552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3046785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 30470d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 3048552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3049552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 3050552f7358SJed Brown } 3051552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 3052552f7358SJed Brown } else { 3053552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 3054552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 3055552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3056552f7358SJed Brown PetscInt fcdof; 3057552f7358SJed Brown 3058552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 305982f516ccSBarry 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); 3060552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 3061552f7358SJed Brown } 3062552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 3063552f7358SJed Brown } 3064552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 3065552f7358SJed Brown PetscFunctionReturn(0); 3066552f7358SJed Brown } 3067552f7358SJed Brown 3068552f7358SJed Brown #undef __FUNCT__ 3069552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 3070552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 30710adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 30720adebc6cSBarry Smith { 3073552f7358SJed Brown PetscInt *indices; 3074552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 3075552f7358SJed Brown PetscErrorCode ierr; 3076552f7358SJed Brown 3077552f7358SJed Brown PetscFunctionBegin; 3078552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3079785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 3080552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 308182f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 3082552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3083552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3084552f7358SJed Brown PetscInt cdof, d; 3085552f7358SJed Brown 3086552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3087552f7358SJed Brown if (cdof) { 3088552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3089552f7358SJed Brown 3090552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3091552f7358SJed Brown const PetscInt *fcind; 3092552f7358SJed Brown PetscInt fdof, fcdof; 3093552f7358SJed Brown 3094552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3095552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 3096552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 3097552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 30980d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 3099552f7358SJed Brown foff += fdof; 3100552f7358SJed Brown numConst += fcdof; 3101552f7358SJed Brown } 310282f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3103552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3104552f7358SJed Brown } 3105552f7358SJed Brown } 3106552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3107552f7358SJed Brown PetscFunctionReturn(0); 3108552f7358SJed Brown } 3109552f7358SJed Brown 3110552f7358SJed Brown #undef __FUNCT__ 3111552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 3112552f7358SJed Brown /*@C 3113552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 3114552f7358SJed Brown 3115552f7358SJed Brown Not Collective 3116552f7358SJed Brown 3117552f7358SJed Brown Input Parameters: 3118552f7358SJed Brown + dm - The DMPlex object 3119552f7358SJed Brown . dim - The spatial dimension of the problem 3120552f7358SJed Brown . numFields - The number of fields in the problem 3121552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 3122552f7358SJed 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 3123552f7358SJed Brown . numBC - The number of boundary conditions 3124552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 3125f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 3126f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 3127552f7358SJed Brown 3128552f7358SJed Brown Output Parameter: 3129552f7358SJed Brown . section - The PetscSection object 3130552f7358SJed Brown 3131552f7358SJed 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 3132f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 3133f8f126e8SMatthew G. Knepley 3134f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 3135552f7358SJed Brown 3136552f7358SJed Brown Level: developer 3137552f7358SJed Brown 31383813dfbdSMatthew G Knepley Fortran Notes: 31393813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 31403813dfbdSMatthew G Knepley 3141552f7358SJed Brown .keywords: mesh, elements 3142f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 3143552f7358SJed Brown @*/ 3144f8f126e8SMatthew 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) 3145a6dfd86eSKarl Rupp { 3146552f7358SJed Brown PetscErrorCode ierr; 3147552f7358SJed Brown 3148552f7358SJed Brown PetscFunctionBegin; 3149552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 3150552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 3151f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 3152552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3153552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 3154ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 3155552f7358SJed Brown PetscFunctionReturn(0); 3156552f7358SJed Brown } 3157552f7358SJed Brown 3158552f7358SJed Brown #undef __FUNCT__ 3159552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 31600adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 31610adebc6cSBarry Smith { 3162552f7358SJed Brown PetscSection section; 3163552f7358SJed Brown PetscErrorCode ierr; 3164552f7358SJed Brown 3165552f7358SJed Brown PetscFunctionBegin; 316638221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 316782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 3168552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 31691d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 3170552f7358SJed Brown PetscFunctionReturn(0); 3171552f7358SJed Brown } 3172552f7358SJed Brown 3173552f7358SJed Brown #undef __FUNCT__ 3174552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 31750adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 31760adebc6cSBarry Smith { 3177552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3178552f7358SJed Brown 3179552f7358SJed Brown PetscFunctionBegin; 3180552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3181552f7358SJed Brown if (section) *section = mesh->coneSection; 3182552f7358SJed Brown PetscFunctionReturn(0); 3183552f7358SJed Brown } 3184552f7358SJed Brown 3185552f7358SJed Brown #undef __FUNCT__ 31868cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 31878cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 31888cb4d582SMatthew G. Knepley { 31898cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 31908cb4d582SMatthew G. Knepley 31918cb4d582SMatthew G. Knepley PetscFunctionBegin; 31928cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 31938cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 31948cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 31958cb4d582SMatthew G. Knepley } 31968cb4d582SMatthew G. Knepley 31978cb4d582SMatthew G. Knepley #undef __FUNCT__ 3198552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 3199a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 3200a6dfd86eSKarl Rupp { 3201552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3202552f7358SJed Brown 3203552f7358SJed Brown PetscFunctionBegin; 3204552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3205552f7358SJed Brown if (cones) *cones = mesh->cones; 3206552f7358SJed Brown PetscFunctionReturn(0); 3207552f7358SJed Brown } 3208552f7358SJed Brown 3209552f7358SJed Brown #undef __FUNCT__ 3210552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 3211a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 3212a6dfd86eSKarl Rupp { 3213552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3214552f7358SJed Brown 3215552f7358SJed Brown PetscFunctionBegin; 3216552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3217552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 3218552f7358SJed Brown PetscFunctionReturn(0); 3219552f7358SJed Brown } 3220552f7358SJed Brown 3221552f7358SJed Brown /******************************** FEM Support **********************************/ 3222552f7358SJed Brown 3223552f7358SJed Brown #undef __FUNCT__ 32241a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 32251a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3226a6dfd86eSKarl Rupp { 3227552f7358SJed Brown PetscScalar *array, *vArray; 3228d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 32291a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 3230552f7358SJed Brown PetscErrorCode ierr; 3231552f7358SJed Brown 32321b406b76SMatthew G. Knepley PetscFunctionBeginHot; 32332a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 32345a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 32355a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 32365a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 32373f7cbbe7SMatthew G. Knepley if (!values || !*values) { 32389df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32399df71ca4SMatthew G. Knepley PetscInt dof; 3240d9917b9dSMatthew G. Knepley 32419df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32429df71ca4SMatthew G. Knepley size += dof; 32439df71ca4SMatthew G. Knepley } 32449df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32459df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32462a3aaacfSMatthew G. Knepley PetscInt dof; 32475a1bb5cfSMatthew G. Knepley 32485a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32492a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32505a1bb5cfSMatthew G. Knepley size += dof; 32515a1bb5cfSMatthew G. Knepley } 32523f7cbbe7SMatthew G. Knepley if (!values) { 32533f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 32543f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 32553f7cbbe7SMatthew G. Knepley } 32565a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 3257982e9ed1SMatthew G. Knepley } else { 3258982e9ed1SMatthew G. Knepley array = *values; 3259982e9ed1SMatthew G. Knepley } 32609df71ca4SMatthew G. Knepley size = 0; 32615a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 32629df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32639df71ca4SMatthew G. Knepley PetscInt dof, off, d; 32649df71ca4SMatthew G. Knepley PetscScalar *varr; 3265d9917b9dSMatthew G. Knepley 32669df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32679df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 32689df71ca4SMatthew G. Knepley varr = &vArray[off]; 32691a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32701a271a75SMatthew G. Knepley array[offset] = varr[d]; 32719df71ca4SMatthew G. Knepley } 32729df71ca4SMatthew G. Knepley size += dof; 32739df71ca4SMatthew G. Knepley } 32749df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32759df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32769df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 32775a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 32785a1bb5cfSMatthew G. Knepley PetscScalar *varr; 32795a1bb5cfSMatthew G. Knepley 328052ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32815a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32825a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 32835a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 32845a1bb5cfSMatthew G. Knepley if (o >= 0) { 32851a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32861a271a75SMatthew G. Knepley array[offset] = varr[d]; 32875a1bb5cfSMatthew G. Knepley } 32885a1bb5cfSMatthew G. Knepley } else { 32891a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 32901a271a75SMatthew G. Knepley array[offset] = varr[d]; 32915a1bb5cfSMatthew G. Knepley } 32925a1bb5cfSMatthew G. Knepley } 32939df71ca4SMatthew G. Knepley size += dof; 32945a1bb5cfSMatthew G. Knepley } 32955a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 32969df71ca4SMatthew G. Knepley if (!*values) { 32975a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 32985a1bb5cfSMatthew G. Knepley *values = array; 32999df71ca4SMatthew G. Knepley } else { 33009df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 33018c312ff3SMatthew G. Knepley *csize = size; 33029df71ca4SMatthew G. Knepley } 33035a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 33045a1bb5cfSMatthew G. Knepley } 3305d9917b9dSMatthew G. Knepley 3306d9917b9dSMatthew G. Knepley #undef __FUNCT__ 33071a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 33081a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 33091a271a75SMatthew G. Knepley { 33101a271a75SMatthew G. Knepley PetscInt offset = 0, p; 33111a271a75SMatthew G. Knepley PetscErrorCode ierr; 33121a271a75SMatthew G. Knepley 33131a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3314fe02ba77SJed Brown *size = 0; 33151a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33161a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33171a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33181a271a75SMatthew G. Knepley PetscInt dof, off, d; 33191a271a75SMatthew G. Knepley const PetscScalar *varr; 33201a271a75SMatthew G. Knepley 33211a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 33221a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 33231a271a75SMatthew G. Knepley varr = &vArray[off]; 33241a271a75SMatthew G. Knepley if (o >= 0) { 33251a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 33261a271a75SMatthew G. Knepley } else { 33271a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 33281a271a75SMatthew G. Knepley } 33291a271a75SMatthew G. Knepley } 33301a271a75SMatthew G. Knepley *size = offset; 33311a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33321a271a75SMatthew G. Knepley } 33331a271a75SMatthew G. Knepley 33341a271a75SMatthew G. Knepley #undef __FUNCT__ 33351a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 33361a271a75SMatthew 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[]) 33371a271a75SMatthew G. Knepley { 33381a271a75SMatthew G. Knepley PetscInt offset = 0, f; 33391a271a75SMatthew G. Knepley PetscErrorCode ierr; 33401a271a75SMatthew G. Knepley 33411a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3342fe02ba77SJed Brown *size = 0; 33431a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 33441a271a75SMatthew G. Knepley PetscInt fcomp, p; 33451a271a75SMatthew G. Knepley 33461a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 33471a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33481a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33491a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33501a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 33511a271a75SMatthew G. Knepley const PetscScalar *varr; 33521a271a75SMatthew G. Knepley 33531a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 33541a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 33551a271a75SMatthew G. Knepley varr = &vArray[foff]; 33561a271a75SMatthew G. Knepley if (o >= 0) { 33571a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 33581a271a75SMatthew G. Knepley } else { 33591a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 33601a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 33611a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 33621a271a75SMatthew G. Knepley } 33631a271a75SMatthew G. Knepley } 33641a271a75SMatthew G. Knepley } 33651a271a75SMatthew G. Knepley } 33661a271a75SMatthew G. Knepley } 33671a271a75SMatthew G. Knepley *size = offset; 33681a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33691a271a75SMatthew G. Knepley } 33701a271a75SMatthew G. Knepley 33711a271a75SMatthew G. Knepley #undef __FUNCT__ 3372552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 3373552f7358SJed Brown /*@C 3374552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 3375552f7358SJed Brown 3376552f7358SJed Brown Not collective 3377552f7358SJed Brown 3378552f7358SJed Brown Input Parameters: 3379552f7358SJed Brown + dm - The DM 3380552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 3381552f7358SJed Brown . v - The local vector 3382552f7358SJed Brown - point - The sieve point in the DM 3383552f7358SJed Brown 3384552f7358SJed Brown Output Parameters: 3385552f7358SJed Brown + csize - The number of values in the closure, or NULL 3386552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3387552f7358SJed Brown 3388552f7358SJed Brown Fortran Notes: 3389552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 3390552f7358SJed Brown include petsc.h90 in your code. 3391552f7358SJed Brown 3392552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 3393552f7358SJed Brown 3394552f7358SJed Brown Level: intermediate 3395552f7358SJed Brown 3396552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3397552f7358SJed Brown @*/ 3398552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3399552f7358SJed Brown { 3400552f7358SJed Brown PetscSection clSection; 3401d9917b9dSMatthew G. Knepley IS clPoints; 3402552f7358SJed Brown PetscScalar *array, *vArray; 3403552f7358SJed Brown PetscInt *points = NULL; 3404d9917b9dSMatthew G. Knepley const PetscInt *clp; 34051a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 3406552f7358SJed Brown PetscErrorCode ierr; 3407552f7358SJed Brown 3408d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 3409552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3410552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 34111a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 34121a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3413552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3414552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3415552f7358SJed Brown if (depth == 1 && numFields < 2) { 34161a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 3417552f7358SJed Brown PetscFunctionReturn(0); 3418552f7358SJed Brown } 34191a271a75SMatthew G. Knepley /* Get points */ 3420d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3421d9917b9dSMatthew G. Knepley if (!clPoints) { 34221a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 3423552f7358SJed Brown 34241a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3425552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3426552f7358SJed Brown /* Compress out points not in the section */ 3427552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3428552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3429552f7358SJed Brown points[q*2] = points[p]; 3430552f7358SJed Brown points[q*2+1] = points[p+1]; 3431552f7358SJed Brown ++q; 3432552f7358SJed Brown } 3433552f7358SJed Brown } 3434552f7358SJed Brown numPoints = q; 3435d9917b9dSMatthew G. Knepley } else { 3436d9917b9dSMatthew G. Knepley PetscInt dof, off; 3437552f7358SJed Brown 3438d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3439d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3440d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 34411a271a75SMatthew G. Knepley numPoints = dof/2; 3442d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3443552f7358SJed Brown } 34441a271a75SMatthew G. Knepley /* Get array */ 3445552f7358SJed Brown if (!values || !*values) { 34461a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 3447552f7358SJed Brown 34481a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3449552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 34501a271a75SMatthew G. Knepley asize += dof; 3451552f7358SJed Brown } 3452bd6c0d32SMatthew G. Knepley if (!values) { 3453d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34541a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34551a271a75SMatthew G. Knepley if (csize) *csize = asize; 3456bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 3457bd6c0d32SMatthew G. Knepley } 34581a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 3459d0f6b257SMatthew G. Knepley } else { 3460d0f6b257SMatthew G. Knepley array = *values; 3461d0f6b257SMatthew G. Knepley } 3462552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 34631a271a75SMatthew G. Knepley /* Get values */ 3464ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 34651a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 34661a271a75SMatthew G. Knepley /* Cleanup points */ 34671a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34681a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34691a271a75SMatthew G. Knepley /* Cleanup array */ 3470552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 3471d0f6b257SMatthew G. Knepley if (!*values) { 3472552f7358SJed Brown if (csize) *csize = size; 3473552f7358SJed Brown *values = array; 3474d0f6b257SMatthew G. Knepley } else { 3475d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 3476d0f6b257SMatthew G. Knepley *csize = size; 3477d0f6b257SMatthew G. Knepley } 3478552f7358SJed Brown PetscFunctionReturn(0); 3479552f7358SJed Brown } 3480552f7358SJed Brown 3481552f7358SJed Brown #undef __FUNCT__ 3482552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 3483552f7358SJed Brown /*@C 3484552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 3485552f7358SJed Brown 3486552f7358SJed Brown Not collective 3487552f7358SJed Brown 3488552f7358SJed Brown Input Parameters: 3489552f7358SJed Brown + dm - The DM 34900298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 3491552f7358SJed Brown . v - The local vector 3492552f7358SJed Brown . point - The sieve point in the DM 34930298fd71SBarry Smith . csize - The number of values in the closure, or NULL 3494552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3495552f7358SJed Brown 34963813dfbdSMatthew G Knepley Fortran Notes: 34973813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 34983813dfbdSMatthew G Knepley include petsc.h90 in your code. 34993813dfbdSMatthew G Knepley 35003813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 35013813dfbdSMatthew G Knepley 3502552f7358SJed Brown Level: intermediate 3503552f7358SJed Brown 3504552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3505552f7358SJed Brown @*/ 35067c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3507a6dfd86eSKarl Rupp { 3508552f7358SJed Brown PetscInt size = 0; 3509552f7358SJed Brown PetscErrorCode ierr; 3510552f7358SJed Brown 3511552f7358SJed Brown PetscFunctionBegin; 3512552f7358SJed Brown /* Should work without recalculating size */ 3513552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 3514552f7358SJed Brown PetscFunctionReturn(0); 3515552f7358SJed Brown } 3516552f7358SJed Brown 3517552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 3518552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 3519552f7358SJed Brown 3520552f7358SJed Brown #undef __FUNCT__ 3521552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 35221a271a75SMatthew 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[]) 3523552f7358SJed Brown { 3524552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3525552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3526552f7358SJed Brown PetscScalar *a; 3527552f7358SJed Brown PetscInt off, cind = 0, k; 3528552f7358SJed Brown PetscErrorCode ierr; 3529552f7358SJed Brown 3530552f7358SJed Brown PetscFunctionBegin; 3531552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3532552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3533552f7358SJed Brown a = &array[off]; 3534552f7358SJed Brown if (!cdof || setBC) { 3535552f7358SJed Brown if (orientation >= 0) { 3536552f7358SJed Brown for (k = 0; k < dof; ++k) { 3537552f7358SJed Brown fuse(&a[k], values[k]); 3538552f7358SJed Brown } 3539552f7358SJed Brown } else { 3540552f7358SJed Brown for (k = 0; k < dof; ++k) { 3541552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3542552f7358SJed Brown } 3543552f7358SJed Brown } 3544552f7358SJed Brown } else { 3545552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3546552f7358SJed Brown if (orientation >= 0) { 3547552f7358SJed Brown for (k = 0; k < dof; ++k) { 3548552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3549552f7358SJed Brown fuse(&a[k], values[k]); 3550552f7358SJed Brown } 3551552f7358SJed Brown } else { 3552552f7358SJed Brown for (k = 0; k < dof; ++k) { 3553552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3554552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3555552f7358SJed Brown } 3556552f7358SJed Brown } 3557552f7358SJed Brown } 3558552f7358SJed Brown PetscFunctionReturn(0); 3559552f7358SJed Brown } 3560552f7358SJed Brown 3561552f7358SJed Brown #undef __FUNCT__ 3562a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 35631a271a75SMatthew 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[]) 3564a5e93ea8SMatthew G. Knepley { 3565a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 3566a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3567a5e93ea8SMatthew G. Knepley PetscScalar *a; 3568a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 3569a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3570a5e93ea8SMatthew G. Knepley 3571a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3572a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3573a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3574a5e93ea8SMatthew G. Knepley a = &array[off]; 3575a5e93ea8SMatthew G. Knepley if (cdof) { 3576a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3577a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 3578a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3579a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3580a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 3581a5e93ea8SMatthew G. Knepley ++cind; 3582a5e93ea8SMatthew G. Knepley } 3583a5e93ea8SMatthew G. Knepley } 3584a5e93ea8SMatthew G. Knepley } else { 3585a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3586a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3587a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 3588a5e93ea8SMatthew G. Knepley ++cind; 3589a5e93ea8SMatthew G. Knepley } 3590a5e93ea8SMatthew G. Knepley } 3591a5e93ea8SMatthew G. Knepley } 3592a5e93ea8SMatthew G. Knepley } 3593a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3594a5e93ea8SMatthew G. Knepley } 3595a5e93ea8SMatthew G. Knepley 3596a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 3597552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 35981a271a75SMatthew 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[]) 3599a6dfd86eSKarl Rupp { 3600552f7358SJed Brown PetscScalar *a; 36011a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 36021a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 36031a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3604552f7358SJed Brown PetscErrorCode ierr; 3605552f7358SJed Brown 3606552f7358SJed Brown PetscFunctionBegin; 3607552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3608552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 36091a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 36101a271a75SMatthew G. Knepley a = &array[foff]; 3611552f7358SJed Brown if (!fcdof || setBC) { 36121a271a75SMatthew G. Knepley if (o >= 0) { 36131a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 3614552f7358SJed Brown } else { 3615552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3616552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 36171a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3618552f7358SJed Brown } 3619552f7358SJed Brown } 3620552f7358SJed Brown } 3621552f7358SJed Brown } else { 3622552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36231a271a75SMatthew G. Knepley if (o >= 0) { 3624552f7358SJed Brown for (k = 0; k < fdof; ++k) { 3625552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 36261a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3627552f7358SJed Brown } 3628552f7358SJed Brown } else { 3629552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3630552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3631552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 36321a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3633552f7358SJed Brown } 3634552f7358SJed Brown } 3635552f7358SJed Brown } 3636552f7358SJed Brown } 36371a271a75SMatthew G. Knepley *offset += fdof; 3638552f7358SJed Brown PetscFunctionReturn(0); 3639552f7358SJed Brown } 3640552f7358SJed Brown 3641552f7358SJed Brown #undef __FUNCT__ 3642a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 36431a271a75SMatthew 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[]) 3644a5e93ea8SMatthew G. Knepley { 3645a5e93ea8SMatthew G. Knepley PetscScalar *a; 36461a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 36471a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 36481a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3649a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3650a5e93ea8SMatthew G. Knepley 3651a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3652a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3653a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 36541a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 36551a271a75SMatthew G. Knepley a = &array[foff]; 3656a5e93ea8SMatthew G. Knepley if (fcdof) { 3657a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36581a271a75SMatthew G. Knepley if (o >= 0) { 3659a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 3660a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 36611a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3662a5e93ea8SMatthew G. Knepley ++cind; 3663a5e93ea8SMatthew G. Knepley } 3664a5e93ea8SMatthew G. Knepley } 3665a5e93ea8SMatthew G. Knepley } else { 3666a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 3667a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 3668a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 36691a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3670a5e93ea8SMatthew G. Knepley ++cind; 3671a5e93ea8SMatthew G. Knepley } 3672a5e93ea8SMatthew G. Knepley } 3673a5e93ea8SMatthew G. Knepley } 3674a5e93ea8SMatthew G. Knepley } 3675a5e93ea8SMatthew G. Knepley } 36761a271a75SMatthew G. Knepley *offset += fdof; 3677a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3678a5e93ea8SMatthew G. Knepley } 3679a5e93ea8SMatthew G. Knepley 3680a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 36811b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 36821a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 3683a6dfd86eSKarl Rupp { 3684552f7358SJed Brown PetscScalar *array; 36851b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 36861b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 3687552f7358SJed Brown PetscErrorCode ierr; 3688552f7358SJed Brown 36891b406b76SMatthew G. Knepley PetscFunctionBeginHot; 3690b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3691b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 3692b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3693b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 3694b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3695b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 3696b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 3697b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 3698b6ebb6e6SMatthew G. Knepley 3699b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 3700b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 3701b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 3702b6ebb6e6SMatthew G. Knepley { 3703b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3704b6ebb6e6SMatthew G. Knepley PetscScalar *a; 3705b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 3706b6ebb6e6SMatthew G. Knepley 3707b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 3708b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 3709b6ebb6e6SMatthew G. Knepley a = &array[coff]; 3710b6ebb6e6SMatthew G. Knepley if (!cdof) { 3711b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3712b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3713b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3714b6ebb6e6SMatthew G. Knepley } 3715b6ebb6e6SMatthew G. Knepley } else { 3716b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3717b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3718b6ebb6e6SMatthew G. Knepley } 3719b6ebb6e6SMatthew G. Knepley } 3720b6ebb6e6SMatthew G. Knepley } else { 3721b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 3722b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3723b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3724b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3725b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3726b6ebb6e6SMatthew G. Knepley } 3727b6ebb6e6SMatthew G. Knepley } else { 3728b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3729b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3730b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3731b6ebb6e6SMatthew G. Knepley } 3732b6ebb6e6SMatthew G. Knepley } 3733b6ebb6e6SMatthew G. Knepley } 3734b6ebb6e6SMatthew G. Knepley } 3735b6ebb6e6SMatthew G. Knepley } 3736b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3737b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 3738b6ebb6e6SMatthew G. Knepley } 37391b406b76SMatthew G. Knepley 37401b406b76SMatthew G. Knepley #undef __FUNCT__ 37411b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 37421b406b76SMatthew G. Knepley /*@C 37431b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 37441b406b76SMatthew G. Knepley 37451b406b76SMatthew G. Knepley Not collective 37461b406b76SMatthew G. Knepley 37471b406b76SMatthew G. Knepley Input Parameters: 37481b406b76SMatthew G. Knepley + dm - The DM 37491b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 37501b406b76SMatthew G. Knepley . v - The local vector 37511b406b76SMatthew G. Knepley . point - The sieve point in the DM 37521b406b76SMatthew G. Knepley . values - The array of values 37531b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 37541b406b76SMatthew G. Knepley 37551b406b76SMatthew G. Knepley Fortran Notes: 37561b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 37571b406b76SMatthew G. Knepley 37581b406b76SMatthew G. Knepley Level: intermediate 37591b406b76SMatthew G. Knepley 37601b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 37611b406b76SMatthew G. Knepley @*/ 37621b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 37631b406b76SMatthew G. Knepley { 37641b406b76SMatthew G. Knepley PetscSection clSection; 37651b406b76SMatthew G. Knepley IS clPoints; 37661b406b76SMatthew G. Knepley PetscScalar *array; 37671b406b76SMatthew G. Knepley PetscInt *points = NULL; 37681b406b76SMatthew G. Knepley const PetscInt *clp; 37691a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 37701b406b76SMatthew G. Knepley PetscErrorCode ierr; 37711b406b76SMatthew G. Knepley 37721a271a75SMatthew G. Knepley PetscFunctionBeginHot; 37731b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 37741b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 37751a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 37761a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 37771b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 37781b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 37791b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 37801a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 37811b406b76SMatthew G. Knepley PetscFunctionReturn(0); 37821b406b76SMatthew G. Knepley } 37831a271a75SMatthew G. Knepley /* Get points */ 37841b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 37851b406b76SMatthew G. Knepley if (!clPoints) { 37861a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 37871a271a75SMatthew G. Knepley 37881a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3789552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3790552f7358SJed Brown /* Compress out points not in the section */ 3791552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3792552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3793552f7358SJed Brown points[q*2] = points[p]; 3794552f7358SJed Brown points[q*2+1] = points[p+1]; 3795552f7358SJed Brown ++q; 3796552f7358SJed Brown } 3797552f7358SJed Brown } 3798552f7358SJed Brown numPoints = q; 37991b406b76SMatthew G. Knepley } else { 38001b406b76SMatthew G. Knepley PetscInt dof, off; 3801552f7358SJed Brown 38021b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 38031b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 38041b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 38051a271a75SMatthew G. Knepley numPoints = dof/2; 38061b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 3807552f7358SJed Brown } 38081a271a75SMatthew G. Knepley /* Get array */ 3809552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 38101a271a75SMatthew G. Knepley /* Get values */ 3811ef90cfe2SMatthew G. Knepley if (numFields > 0) { 38121a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3813552f7358SJed Brown for (f = 0; f < numFields; ++f) { 38141a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3815552f7358SJed Brown switch (mode) { 3816552f7358SJed Brown case INSERT_VALUES: 3817552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38181a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38191a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38201a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3821552f7358SJed Brown } break; 3822552f7358SJed Brown case INSERT_ALL_VALUES: 3823552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38241a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38251a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38261a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3827552f7358SJed Brown } break; 3828a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3829a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 38301a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38311a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38321a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3833a5e93ea8SMatthew G. Knepley } break; 3834552f7358SJed Brown case ADD_VALUES: 3835552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38361a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38371a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38381a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3839552f7358SJed Brown } break; 3840552f7358SJed Brown case ADD_ALL_VALUES: 3841552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38421a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38431a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38441a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3845552f7358SJed Brown } break; 3846552f7358SJed Brown default: 384782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3848552f7358SJed Brown } 38491a271a75SMatthew G. Knepley } 3850552f7358SJed Brown } else { 38511a271a75SMatthew G. Knepley PetscInt dof, off; 38521a271a75SMatthew G. Knepley 3853552f7358SJed Brown switch (mode) { 3854552f7358SJed Brown case INSERT_VALUES: 3855552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3856552f7358SJed Brown PetscInt o = points[p+1]; 3857552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3858552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 3859552f7358SJed Brown } break; 3860552f7358SJed Brown case INSERT_ALL_VALUES: 3861552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3862552f7358SJed Brown PetscInt o = points[p+1]; 3863552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3864552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 3865552f7358SJed Brown } break; 3866a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3867a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3868a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 3869a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3870a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 3871a5e93ea8SMatthew G. Knepley } break; 3872552f7358SJed Brown case ADD_VALUES: 3873552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3874552f7358SJed Brown PetscInt o = points[p+1]; 3875552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3876552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 3877552f7358SJed Brown } break; 3878552f7358SJed Brown case ADD_ALL_VALUES: 3879552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3880552f7358SJed Brown PetscInt o = points[p+1]; 3881552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3882552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 3883552f7358SJed Brown } break; 3884552f7358SJed Brown default: 388582f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3886552f7358SJed Brown } 3887552f7358SJed Brown } 38881a271a75SMatthew G. Knepley /* Cleanup points */ 38891a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 38901a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 38911a271a75SMatthew G. Knepley /* Cleanup array */ 3892552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3893552f7358SJed Brown PetscFunctionReturn(0); 3894552f7358SJed Brown } 3895552f7358SJed Brown 3896552f7358SJed Brown #undef __FUNCT__ 3897e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 3898e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 3899e07394fbSMatthew G. Knepley { 3900e07394fbSMatthew G. Knepley PetscSection clSection; 3901e07394fbSMatthew G. Knepley IS clPoints; 3902e07394fbSMatthew G. Knepley PetscScalar *array; 3903e07394fbSMatthew G. Knepley PetscInt *points = NULL; 3904e07394fbSMatthew G. Knepley const PetscInt *clp; 3905e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 3906e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3907e07394fbSMatthew G. Knepley PetscErrorCode ierr; 3908e07394fbSMatthew G. Knepley 3909e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 3910e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3911e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 3912e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 3913e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3914e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3915e07394fbSMatthew G. Knepley /* Get points */ 3916e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3917e07394fbSMatthew G. Knepley if (!clPoints) { 3918e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 3919e07394fbSMatthew G. Knepley 3920e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3921e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3922e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 3923e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 3924e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 3925e07394fbSMatthew G. Knepley points[q*2] = points[p]; 3926e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 3927e07394fbSMatthew G. Knepley ++q; 3928e07394fbSMatthew G. Knepley } 3929e07394fbSMatthew G. Knepley } 3930e07394fbSMatthew G. Knepley numPoints = q; 3931e07394fbSMatthew G. Knepley } else { 3932e07394fbSMatthew G. Knepley PetscInt dof, off; 3933e07394fbSMatthew G. Knepley 3934e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3935e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3936e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 3937e07394fbSMatthew G. Knepley numPoints = dof/2; 3938e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3939e07394fbSMatthew G. Knepley } 3940e07394fbSMatthew G. Knepley /* Get array */ 3941e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3942e07394fbSMatthew G. Knepley /* Get values */ 3943e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 3944e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3945e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 3946e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3947e07394fbSMatthew G. Knepley PetscInt fdof; 3948e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 3949e07394fbSMatthew G. Knepley offset += fdof; 3950e07394fbSMatthew G. Knepley } 3951e07394fbSMatthew G. Knepley continue; 3952e07394fbSMatthew G. Knepley } 3953e07394fbSMatthew G. Knepley switch (mode) { 3954e07394fbSMatthew G. Knepley case INSERT_VALUES: 3955e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3956e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3957e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3958e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3959e07394fbSMatthew G. Knepley } break; 3960e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 3961e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3962e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3963e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3964e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3965e07394fbSMatthew G. Knepley } break; 3966e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 3967e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3968e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3969e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3970e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3971e07394fbSMatthew G. Knepley } break; 3972e07394fbSMatthew G. Knepley case ADD_VALUES: 3973e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3974e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3975e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3976e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3977e07394fbSMatthew G. Knepley } break; 3978e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 3979e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3980e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3981e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3982e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3983e07394fbSMatthew G. Knepley } break; 3984e07394fbSMatthew G. Knepley default: 3985e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3986e07394fbSMatthew G. Knepley } 3987e07394fbSMatthew G. Knepley } 3988e07394fbSMatthew G. Knepley /* Cleanup points */ 3989e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 3990e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 3991e07394fbSMatthew G. Knepley /* Cleanup array */ 3992e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3993e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 3994e07394fbSMatthew G. Knepley } 3995e07394fbSMatthew G. Knepley 3996e07394fbSMatthew G. Knepley #undef __FUNCT__ 3997552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 3998b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 3999552f7358SJed Brown { 4000552f7358SJed Brown PetscMPIInt rank; 4001552f7358SJed Brown PetscInt i, j; 4002552f7358SJed Brown PetscErrorCode ierr; 4003552f7358SJed Brown 4004552f7358SJed Brown PetscFunctionBegin; 400582f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 400677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 4007b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 4008b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 4009b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 4010b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 401177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 4012b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 4013519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 40147eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 4015552f7358SJed Brown #else 4016b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 4017552f7358SJed Brown #endif 4018552f7358SJed Brown } 401977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 4020552f7358SJed Brown } 4021552f7358SJed Brown PetscFunctionReturn(0); 4022552f7358SJed Brown } 4023552f7358SJed Brown 4024552f7358SJed Brown #undef __FUNCT__ 4025552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 4026552f7358SJed Brown /* . off - The global offset of this point */ 4027e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4028a6dfd86eSKarl Rupp { 4029e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 4030552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4031552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4032552f7358SJed Brown PetscInt cind = 0, k; 4033552f7358SJed Brown PetscErrorCode ierr; 4034552f7358SJed Brown 4035552f7358SJed Brown PetscFunctionBegin; 4036552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 4037552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4038552f7358SJed Brown if (!cdof || setBC) { 4039552f7358SJed Brown if (orientation >= 0) { 4040e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 4041552f7358SJed Brown } else { 4042e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 4043552f7358SJed Brown } 4044552f7358SJed Brown } else { 4045552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4046552f7358SJed Brown if (orientation >= 0) { 4047552f7358SJed Brown for (k = 0; k < dof; ++k) { 4048552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4049552f7358SJed Brown /* Insert check for returning constrained indices */ 4050e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 4051552f7358SJed Brown ++cind; 4052552f7358SJed Brown } else { 4053e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 4054552f7358SJed Brown } 4055552f7358SJed Brown } 4056552f7358SJed Brown } else { 4057552f7358SJed Brown for (k = 0; k < dof; ++k) { 4058552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4059552f7358SJed Brown /* Insert check for returning constrained indices */ 4060e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 4061552f7358SJed Brown ++cind; 4062552f7358SJed Brown } else { 4063e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 4064552f7358SJed Brown } 4065552f7358SJed Brown } 4066552f7358SJed Brown } 4067552f7358SJed Brown } 4068e6ccafaeSMatthew G Knepley *loff += dof; 4069552f7358SJed Brown PetscFunctionReturn(0); 4070552f7358SJed Brown } 4071552f7358SJed Brown 4072552f7358SJed Brown #undef __FUNCT__ 4073552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 4074552f7358SJed Brown /* . off - The global offset of this point */ 4075a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4076a6dfd86eSKarl Rupp { 4077552f7358SJed Brown PetscInt numFields, foff, f; 4078552f7358SJed Brown PetscErrorCode ierr; 4079552f7358SJed Brown 4080552f7358SJed Brown PetscFunctionBegin; 4081552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4082552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 4083552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 4084552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 4085552f7358SJed Brown PetscInt cind = 0, k, c; 4086552f7358SJed Brown 4087552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4088552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4089552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 4090552f7358SJed Brown if (!cfdof || setBC) { 4091552f7358SJed Brown if (orientation >= 0) { 40920d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 4093552f7358SJed Brown } else { 4094552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4095552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4096552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 4097552f7358SJed Brown } 4098552f7358SJed Brown } 4099552f7358SJed Brown } 4100552f7358SJed Brown } else { 4101552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 4102552f7358SJed Brown if (orientation >= 0) { 4103552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4104552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 4105552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 4106552f7358SJed Brown ++cind; 4107552f7358SJed Brown } else { 4108552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 4109552f7358SJed Brown } 4110552f7358SJed Brown } 4111552f7358SJed Brown } else { 4112552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4113552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4114552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 4115552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 4116552f7358SJed Brown ++cind; 4117552f7358SJed Brown } else { 4118552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 4119552f7358SJed Brown } 4120552f7358SJed Brown } 4121552f7358SJed Brown } 4122552f7358SJed Brown } 4123552f7358SJed Brown } 4124552f7358SJed Brown foff += fdof - cfdof; 4125552f7358SJed Brown foffs[f] += fdof; 4126552f7358SJed Brown } 4127552f7358SJed Brown PetscFunctionReturn(0); 4128552f7358SJed Brown } 4129552f7358SJed Brown 4130552f7358SJed Brown #undef __FUNCT__ 4131552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 41327f5d1fdeSMatthew G. Knepley /*@C 41337f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 41347f5d1fdeSMatthew G. Knepley 41357f5d1fdeSMatthew G. Knepley Not collective 41367f5d1fdeSMatthew G. Knepley 41377f5d1fdeSMatthew G. Knepley Input Parameters: 41387f5d1fdeSMatthew G. Knepley + dm - The DM 4139ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4140ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 41417f5d1fdeSMatthew G. Knepley . A - The matrix 41427f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 41437f5d1fdeSMatthew G. Knepley . values - The array of values 41447f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 41457f5d1fdeSMatthew G. Knepley 41467f5d1fdeSMatthew G. Knepley Fortran Notes: 41477f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 41487f5d1fdeSMatthew G. Knepley 41497f5d1fdeSMatthew G. Knepley Level: intermediate 41507f5d1fdeSMatthew G. Knepley 41517f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 41527f5d1fdeSMatthew G. Knepley @*/ 41537c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 4154552f7358SJed Brown { 4155552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 41561b406b76SMatthew G. Knepley PetscSection clSection; 41571b406b76SMatthew G. Knepley IS clPoints; 41580298fd71SBarry Smith PetscInt *points = NULL; 41591b406b76SMatthew G. Knepley const PetscInt *clp; 4160552f7358SJed Brown PetscInt *indices; 4161552f7358SJed Brown PetscInt offsets[32]; 4162552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 4163552f7358SJed Brown PetscErrorCode ierr; 4164552f7358SJed Brown 4165552f7358SJed Brown PetscFunctionBegin; 4166552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4167ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 41683dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4169ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 41703dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 41713dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 4172552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 417382f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4174552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 41751b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 41761b406b76SMatthew G. Knepley if (!clPoints) { 4177552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4178552f7358SJed Brown /* Compress out points not in the section */ 4179552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4180552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4181552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4182552f7358SJed Brown points[q*2] = points[p]; 4183552f7358SJed Brown points[q*2+1] = points[p+1]; 4184552f7358SJed Brown ++q; 4185552f7358SJed Brown } 4186552f7358SJed Brown } 4187552f7358SJed Brown numPoints = q; 41881b406b76SMatthew G. Knepley } else { 41891b406b76SMatthew G. Knepley PetscInt dof, off; 41901b406b76SMatthew G. Knepley 41911b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 41921b406b76SMatthew G. Knepley numPoints = dof/2; 41931b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 41941b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 41951b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 41961b406b76SMatthew G. Knepley } 4197552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 4198552f7358SJed Brown PetscInt fdof; 4199552f7358SJed Brown 4200552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4201552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4202552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 4203552f7358SJed Brown offsets[f+1] += fdof; 4204552f7358SJed Brown } 4205552f7358SJed Brown numIndices += dof; 4206552f7358SJed Brown } 42070d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 42080d644c17SKarl Rupp 420982f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 4210552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4211552f7358SJed Brown if (numFields) { 4212552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4213552f7358SJed Brown PetscInt o = points[p+1]; 4214552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4215552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 4216552f7358SJed Brown } 4217552f7358SJed Brown } else { 4218e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 4219552f7358SJed Brown PetscInt o = points[p+1]; 4220552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4221e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 4222552f7358SJed Brown } 4223552f7358SJed Brown } 4224b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 4225552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 4226552f7358SJed Brown if (ierr) { 4227552f7358SJed Brown PetscMPIInt rank; 4228552f7358SJed Brown PetscErrorCode ierr2; 4229552f7358SJed Brown 423082f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 423177a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4232b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 42336a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 4234552f7358SJed Brown CHKERRQ(ierr); 4235552f7358SJed Brown } 42361b406b76SMatthew G. Knepley if (!clPoints) { 4237552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 42381b406b76SMatthew G. Knepley } else { 42391b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 42401b406b76SMatthew G. Knepley } 4241552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4242552f7358SJed Brown PetscFunctionReturn(0); 4243552f7358SJed Brown } 4244552f7358SJed Brown 4245552f7358SJed Brown #undef __FUNCT__ 4246de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 4247de41b84cSMatthew 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) 4248de41b84cSMatthew G. Knepley { 4249de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 4250de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 4251de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 4252de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 4253de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 4254de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 42554ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 4256de41b84cSMatthew G. Knepley PetscErrorCode ierr; 4257de41b84cSMatthew G. Knepley 4258de41b84cSMatthew G. Knepley PetscFunctionBegin; 4259de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 4260de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 4261de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 4262de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 4263de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 4264de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 4265de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 4266de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 4267de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 4268de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 4269de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 4270de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 4271de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4272de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4273de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4274de41b84cSMatthew G. Knepley /* Column indices */ 4275de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 42764ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 4277de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4278de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 4279de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 4280de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 4281de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 4282de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 4283de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 4284de41b84cSMatthew G. Knepley ++q; 4285de41b84cSMatthew G. Knepley } 4286de41b84cSMatthew G. Knepley } 4287de41b84cSMatthew G. Knepley numCPoints = q; 4288de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 4289de41b84cSMatthew G. Knepley PetscInt fdof; 4290de41b84cSMatthew G. Knepley 4291de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 42924ca5e9f5SMatthew G. Knepley if (!dof) continue; 4293de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4294de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 4295de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 4296de41b84cSMatthew G. Knepley } 4297de41b84cSMatthew G. Knepley numCIndices += dof; 4298de41b84cSMatthew G. Knepley } 4299de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 4300de41b84cSMatthew G. Knepley /* Row indices */ 4301de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 4302de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 43031ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4304de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 4305de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 4306de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4307de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4308de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 4309de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4310de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 43114ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 43124ca5e9f5SMatthew G. Knepley if (!dof) continue; 43134ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 43144ca5e9f5SMatthew G. Knepley if (s < q) continue; 4315de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 4316de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 4317de41b84cSMatthew G. Knepley ++q; 4318de41b84cSMatthew G. Knepley } 4319de41b84cSMatthew G. Knepley } 4320de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4321de41b84cSMatthew G. Knepley } 4322de41b84cSMatthew G. Knepley numFPoints = q; 4323de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 4324de41b84cSMatthew G. Knepley PetscInt fdof; 4325de41b84cSMatthew G. Knepley 4326de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 43274ca5e9f5SMatthew G. Knepley if (!dof) continue; 4328de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4329de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 4330de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 4331de41b84cSMatthew G. Knepley } 4332de41b84cSMatthew G. Knepley numFIndices += dof; 4333de41b84cSMatthew G. Knepley } 4334de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 4335de41b84cSMatthew G. Knepley 4336de41b84cSMatthew 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); 4337de41b84cSMatthew 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); 4338de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4339de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4340de41b84cSMatthew G. Knepley if (numFields) { 4341de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4342de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4343de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4344de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 4345de41b84cSMatthew G. Knepley } 4346de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 4347de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4348de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4349de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 4350de41b84cSMatthew G. Knepley } 4351de41b84cSMatthew G. Knepley } else { 4352de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 4353de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4354de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4355de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 4356de41b84cSMatthew G. Knepley } 4357de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 4358de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4359de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4360de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 4361de41b84cSMatthew G. Knepley } 4362de41b84cSMatthew G. Knepley } 4363de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 4364de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 4365de41b84cSMatthew G. Knepley if (ierr) { 4366de41b84cSMatthew G. Knepley PetscMPIInt rank; 4367de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 4368de41b84cSMatthew G. Knepley 4369de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4370de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4371de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 4372de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 4373de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 4374de41b84cSMatthew G. Knepley CHKERRQ(ierr); 4375de41b84cSMatthew G. Knepley } 4376549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4377de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 4378de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4379de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4380de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 4381de41b84cSMatthew G. Knepley } 4382de41b84cSMatthew G. Knepley 4383de41b84cSMatthew G. Knepley #undef __FUNCT__ 43847c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 43857c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 43867c927364SMatthew G. Knepley { 43877c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 43887c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 43897c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 43907c927364SMatthew G. Knepley CellRefiner cellRefiner; 43917c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 43927c927364SMatthew G. Knepley PetscErrorCode ierr; 43937c927364SMatthew G. Knepley 43947c927364SMatthew G. Knepley PetscFunctionBegin; 43957c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 43967c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 43977c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 43987c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 43997c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 44007c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 44017c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 44027c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 44037c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 44047c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 44057c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 44067c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 44077c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 44087c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 44097c927364SMatthew G. Knepley /* Column indices */ 44107c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 44117c927364SMatthew G. Knepley maxFPoints = numCPoints; 44127c927364SMatthew G. Knepley /* Compress out points not in the section */ 44137c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 44147c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 44157c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 44167c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 44177c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 44187c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 44197c927364SMatthew G. Knepley ++q; 44207c927364SMatthew G. Knepley } 44217c927364SMatthew G. Knepley } 44227c927364SMatthew G. Knepley numCPoints = q; 44237c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 44247c927364SMatthew G. Knepley PetscInt fdof; 44257c927364SMatthew G. Knepley 44267c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 44277c927364SMatthew G. Knepley if (!dof) continue; 44287c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44297c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 44307c927364SMatthew G. Knepley coffsets[f+1] += fdof; 44317c927364SMatthew G. Knepley } 44327c927364SMatthew G. Knepley numCIndices += dof; 44337c927364SMatthew G. Knepley } 44347c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 44357c927364SMatthew G. Knepley /* Row indices */ 44367c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 44377c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 44387c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 44397c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 44407c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 44417c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 44427c927364SMatthew G. Knepley /* Compress out points not in the section */ 44437c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 44447c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 44457c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 44467c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 44477c927364SMatthew G. Knepley if (!dof) continue; 44487c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 44497c927364SMatthew G. Knepley if (s < q) continue; 44507c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 44517c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 44527c927364SMatthew G. Knepley ++q; 44537c927364SMatthew G. Knepley } 44547c927364SMatthew G. Knepley } 44557c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 44567c927364SMatthew G. Knepley } 44577c927364SMatthew G. Knepley numFPoints = q; 44587c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 44597c927364SMatthew G. Knepley PetscInt fdof; 44607c927364SMatthew G. Knepley 44617c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 44627c927364SMatthew G. Knepley if (!dof) continue; 44637c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44647c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 44657c927364SMatthew G. Knepley foffsets[f+1] += fdof; 44667c927364SMatthew G. Knepley } 44677c927364SMatthew G. Knepley numFIndices += dof; 44687c927364SMatthew G. Knepley } 44697c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 44707c927364SMatthew G. Knepley 44717c927364SMatthew 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); 44727c927364SMatthew 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); 44737c927364SMatthew G. Knepley if (numFields) { 44747c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 44757c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 44767c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 44777c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 44787c927364SMatthew G. Knepley } 44797c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 44807c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 44817c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 44827c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 44837c927364SMatthew G. Knepley } 44847c927364SMatthew G. Knepley } else { 44857c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 44867c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 44877c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 44887c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 44897c927364SMatthew G. Knepley } 44907c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 44917c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 44927c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 44937c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 44947c927364SMatthew G. Knepley } 44957c927364SMatthew G. Knepley } 44967c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 44977c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 44987c927364SMatthew G. Knepley PetscFunctionReturn(0); 44997c927364SMatthew G. Knepley } 45007c927364SMatthew G. Knepley 45017c927364SMatthew G. Knepley #undef __FUNCT__ 4502770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 4503f96281f8SMatthew G. Knepley /*@ 4504f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 4505f96281f8SMatthew G. Knepley 4506f96281f8SMatthew G. Knepley Input Parameter: 4507f96281f8SMatthew G. Knepley . dm - The DMPlex object 4508f96281f8SMatthew G. Knepley 4509f96281f8SMatthew G. Knepley Output Parameters: 4510f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 4511dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4512dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4513dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4514f96281f8SMatthew G. Knepley 4515f96281f8SMatthew G. Knepley Level: developer 4516f96281f8SMatthew G. Knepley 4517dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 4518f96281f8SMatthew G. Knepley @*/ 4519770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 4520552f7358SJed Brown { 4521552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4522770b213bSMatthew G Knepley PetscInt dim; 4523770b213bSMatthew G Knepley PetscErrorCode ierr; 4524552f7358SJed Brown 4525552f7358SJed Brown PetscFunctionBegin; 4526552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4527c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4528770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 4529770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 4530770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 4531770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 4532552f7358SJed Brown PetscFunctionReturn(0); 4533552f7358SJed Brown } 4534552f7358SJed Brown 4535552f7358SJed Brown #undef __FUNCT__ 4536770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 4537dc5a3409SMatthew G. Knepley /*@ 4538dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 4539dc5a3409SMatthew G. Knepley 4540dc5a3409SMatthew G. Knepley Input Parameters: 4541dc5a3409SMatthew G. Knepley . dm - The DMPlex object 4542dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 4543dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4544dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4545dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4546dc5a3409SMatthew G. Knepley 4547dc5a3409SMatthew G. Knepley Level: developer 4548dc5a3409SMatthew G. Knepley 4549dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 4550dc5a3409SMatthew G. Knepley @*/ 4551770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 4552552f7358SJed Brown { 4553552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4554770b213bSMatthew G Knepley PetscInt dim; 4555770b213bSMatthew G Knepley PetscErrorCode ierr; 4556552f7358SJed Brown 4557552f7358SJed Brown PetscFunctionBegin; 4558552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4559c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4560770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 4561770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 4562770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 4563770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 4564552f7358SJed Brown PetscFunctionReturn(0); 4565552f7358SJed Brown } 4566552f7358SJed Brown 4567552f7358SJed Brown #undef __FUNCT__ 4568552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 4569552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 4570552f7358SJed Brown { 4571552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4572552f7358SJed Brown 4573552f7358SJed Brown PetscFunctionBegin; 4574552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4575552f7358SJed Brown PetscValidPointer(cellHeight, 2); 4576552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 4577552f7358SJed Brown PetscFunctionReturn(0); 4578552f7358SJed Brown } 4579552f7358SJed Brown 4580552f7358SJed Brown #undef __FUNCT__ 4581552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 4582552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 4583552f7358SJed Brown { 4584552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4585552f7358SJed Brown 4586552f7358SJed Brown PetscFunctionBegin; 4587552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4588552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 4589552f7358SJed Brown PetscFunctionReturn(0); 4590552f7358SJed Brown } 4591552f7358SJed Brown 4592552f7358SJed Brown #undef __FUNCT__ 4593552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 4594552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 4595ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 4596552f7358SJed Brown { 4597552f7358SJed Brown PetscSection section, globalSection; 4598552f7358SJed Brown PetscInt *numbers, p; 4599552f7358SJed Brown PetscErrorCode ierr; 4600552f7358SJed Brown 4601552f7358SJed Brown PetscFunctionBegin; 460282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4603552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 4604552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4605552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 4606552f7358SJed Brown } 4607552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 4608552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 4609785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 4610552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4611552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 4612ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 4613ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 4614552f7358SJed Brown } 461582f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 4616ef48cebcSMatthew G. Knepley if (globalSize) { 4617ef48cebcSMatthew G. Knepley PetscLayout layout; 4618ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 4619ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 4620ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 4621ef48cebcSMatthew G. Knepley } 4622552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4623552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 4624552f7358SJed Brown PetscFunctionReturn(0); 4625552f7358SJed Brown } 4626552f7358SJed Brown 4627552f7358SJed Brown #undef __FUNCT__ 4628552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 4629552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 4630552f7358SJed Brown { 4631552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4632552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 4633552f7358SJed Brown PetscErrorCode ierr; 4634552f7358SJed Brown 4635552f7358SJed Brown PetscFunctionBegin; 4636552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4637552f7358SJed Brown if (!mesh->globalCellNumbers) { 4638552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 4639552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 46400298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 46410d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 4642ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 4643552f7358SJed Brown } 4644552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 4645552f7358SJed Brown PetscFunctionReturn(0); 4646552f7358SJed Brown } 4647552f7358SJed Brown 4648552f7358SJed Brown #undef __FUNCT__ 4649552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 4650552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 4651552f7358SJed Brown { 4652552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4653552f7358SJed Brown PetscInt vStart, vEnd, vMax; 4654552f7358SJed Brown PetscErrorCode ierr; 4655552f7358SJed Brown 4656552f7358SJed Brown PetscFunctionBegin; 4657552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4658552f7358SJed Brown if (!mesh->globalVertexNumbers) { 4659552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 46600298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 46610d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 4662ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 4663552f7358SJed Brown } 4664552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 4665552f7358SJed Brown PetscFunctionReturn(0); 4666552f7358SJed Brown } 4667552f7358SJed Brown 4668ef48cebcSMatthew G. Knepley #undef __FUNCT__ 4669ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 4670ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 4671ef48cebcSMatthew G. Knepley { 4672ef48cebcSMatthew G. Knepley IS nums[4]; 4673ef48cebcSMatthew G. Knepley PetscInt depths[4]; 4674ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 4675ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 4676ef48cebcSMatthew G. Knepley 4677ef48cebcSMatthew G. Knepley PetscFunctionBegin; 4678ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4679ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4680ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 4681ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 4682ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 4683ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 4684ef48cebcSMatthew G. Knepley 4685ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 4686ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 4687ef48cebcSMatthew G. Knepley shift += gsize; 4688ef48cebcSMatthew G. Knepley } 4689ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 4690ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 4691ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 4692ef48cebcSMatthew G. Knepley } 4693ef48cebcSMatthew G. Knepley 4694552f7358SJed Brown 4695552f7358SJed Brown #undef __FUNCT__ 4696552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 4697552f7358SJed Brown /*@C 4698552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 4699552f7358SJed Brown the local section and an SF describing the section point overlap. 4700552f7358SJed Brown 4701552f7358SJed Brown Input Parameters: 4702552f7358SJed Brown + s - The PetscSection for the local field layout 4703552f7358SJed Brown . sf - The SF describing parallel layout of the section points 4704552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 4705552f7358SJed Brown . label - The label specifying the points 4706552f7358SJed Brown - labelValue - The label stratum specifying the points 4707552f7358SJed Brown 4708552f7358SJed Brown Output Parameter: 4709552f7358SJed Brown . gsection - The PetscSection for the global field layout 4710552f7358SJed Brown 4711552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 4712552f7358SJed Brown 4713552f7358SJed Brown Level: developer 4714552f7358SJed Brown 4715552f7358SJed Brown .seealso: PetscSectionCreate() 4716552f7358SJed Brown @*/ 4717552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 4718552f7358SJed Brown { 47197ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 4720552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 4721552f7358SJed Brown PetscErrorCode ierr; 4722552f7358SJed Brown 4723552f7358SJed Brown PetscFunctionBegin; 47244c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 4725552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 4726552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 47277ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 47287ec39499SMatthew G. Knepley if (nroots >= 0) { 47297ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 47301795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 47317ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 47321795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 47337ec39499SMatthew G. Knepley } else { 47347ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 47357ec39499SMatthew G. Knepley } 47367ec39499SMatthew G. Knepley } 4737552f7358SJed Brown /* Mark ghost points with negative dof */ 4738552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4739552f7358SJed Brown PetscInt value; 4740552f7358SJed Brown 4741552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 4742552f7358SJed Brown if (value != labelValue) continue; 4743552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 4744552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 4745552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 4746552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 47477ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 4748552f7358SJed Brown } 4749552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 4750552f7358SJed Brown if (nroots >= 0) { 47517ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 47527ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 4753552f7358SJed Brown if (nroots > pEnd-pStart) { 47547ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 4755552f7358SJed Brown } 4756552f7358SJed Brown } 4757552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 4758552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 4759552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 4760552f7358SJed Brown (*gsection)->atlasOff[p] = off; 4761552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 4762552f7358SJed Brown } 47634c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 4764552f7358SJed Brown globalOff -= off; 4765552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 4766552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 47677ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 4768552f7358SJed Brown } 4769552f7358SJed Brown /* Put in negative offsets for ghost points */ 4770552f7358SJed Brown if (nroots >= 0) { 47717ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 47727ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 4773552f7358SJed Brown if (nroots > pEnd-pStart) { 47747ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 4775552f7358SJed Brown } 4776552f7358SJed Brown } 47777ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 4778552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 4779552f7358SJed Brown PetscFunctionReturn(0); 4780552f7358SJed Brown } 4781ca8062c8SMatthew G. Knepley 4782ca8062c8SMatthew G. Knepley #undef __FUNCT__ 4783ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 4784ca8062c8SMatthew G. Knepley /*@ 4785ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 4786ca8062c8SMatthew G. Knepley 4787ca8062c8SMatthew G. Knepley Input Parameters: 4788ca8062c8SMatthew G. Knepley + dm - The DMPlex object 4789ca8062c8SMatthew G. Knepley 4790ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 4791ca8062c8SMatthew G. Knepley 4792ca8062c8SMatthew G. Knepley Level: developer 4793ca8062c8SMatthew G. Knepley 47949bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 4795ca8062c8SMatthew G. Knepley @*/ 4796ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 4797ca8062c8SMatthew G. Knepley { 4798ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 4799ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 4800ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 4801ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 4802ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 4803ca8062c8SMatthew G. Knepley 4804ca8062c8SMatthew G. Knepley PetscFunctionBegin; 4805ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4806ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 4807ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 4808ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 4809ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4810ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 4811ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 4812ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 4813ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 481442e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 481542e66dfaSMatthew G. Knepley PetscInt d; 481642e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 481742e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 481842e66dfaSMatthew G. Knepley } 4819ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 4820ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 4821ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 4822ca8062c8SMatthew G. Knepley if (support[s] == p) break; 4823ca8062c8SMatthew G. Knepley } 482442e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 4825ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 4826ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 4827ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 4828ca8062c8SMatthew G. Knepley } 4829ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 4830ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 4831ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 4832ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 4833ca8062c8SMatthew G. Knepley } 4834ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 483542e66dfaSMatthew G. Knepley if (dup) { 483642e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 483742e66dfaSMatthew G. Knepley } else { 4838ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 4839ca8062c8SMatthew G. Knepley } 4840ca8062c8SMatthew G. Knepley } 484142e66dfaSMatthew G. Knepley } 4842ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 4843ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 4844ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 4845ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 4846ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 4847ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 4848ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 4849ca8062c8SMatthew G. Knepley } 4850ca8062c8SMatthew G. Knepley if (c >= coneSize) { 4851ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 4852ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 4853ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 4854ca8062c8SMatthew G. Knepley } 4855ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 4856ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 4857ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 4858ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 4859ca8062c8SMatthew G. Knepley } 4860ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 4861ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 4862ca8062c8SMatthew G. Knepley } 4863ca8062c8SMatthew G. Knepley } 4864ca8062c8SMatthew G. Knepley } 4865ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 4866ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 4867ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 4868ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 4869ca8062c8SMatthew G. Knepley } 4870ca8062c8SMatthew G. Knepley 4871ca8062c8SMatthew G. Knepley #undef __FUNCT__ 4872ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 4873ca8062c8SMatthew G. Knepley /*@ 4874ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 4875ca8062c8SMatthew G. Knepley 4876ca8062c8SMatthew G. Knepley Input Parameters: 4877ca8062c8SMatthew G. Knepley + dm - The DMPlex object 487858723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 487958723a97SMatthew G. Knepley - cellHeight - Normally 0 4880ca8062c8SMatthew G. Knepley 4881ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 4882ca8062c8SMatthew G. Knepley 4883ca8062c8SMatthew G. Knepley Level: developer 4884ca8062c8SMatthew G. Knepley 48859bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 4886ca8062c8SMatthew G. Knepley @*/ 488758723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 4888ca8062c8SMatthew G. Knepley { 488942363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 4890ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 4891ca8062c8SMatthew G. Knepley 4892ca8062c8SMatthew G. Knepley PetscFunctionBegin; 4893ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4894c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4895ca8062c8SMatthew G. Knepley switch (dim) { 489642363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 489742363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 489842363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 4899ca8062c8SMatthew G. Knepley default: 4900ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 4901ca8062c8SMatthew G. Knepley } 490258723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 490358723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 4904ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 4905ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 4906ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 490758723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 490858723a97SMatthew G. Knepley 490958723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 491058723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 491158723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 491258723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 491358723a97SMatthew G. Knepley } 491458723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4915ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 4916ca8062c8SMatthew G. Knepley } 491742363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 491842363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 491942363296SMatthew G. Knepley 492042363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 492142363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 492242363296SMatthew G. Knepley const PetscInt p = closure[cl]; 492342363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 492442363296SMatthew G. Knepley } 492542363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 492642363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 492742363296SMatthew G. Knepley } 4928ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 4929ca8062c8SMatthew G. Knepley } 49309bf0dad6SMatthew G. Knepley 49319bf0dad6SMatthew G. Knepley #undef __FUNCT__ 49329bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 49339bf0dad6SMatthew G. Knepley /*@ 49349bf0dad6SMatthew 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 49359bf0dad6SMatthew G. Knepley 49369bf0dad6SMatthew G. Knepley Input Parameters: 49379bf0dad6SMatthew G. Knepley + dm - The DMPlex object 49389bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 49399bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 49409bf0dad6SMatthew G. Knepley 49419bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 49429bf0dad6SMatthew G. Knepley 49439bf0dad6SMatthew G. Knepley Level: developer 49449bf0dad6SMatthew G. Knepley 49459bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 49469bf0dad6SMatthew G. Knepley @*/ 49479bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 49489bf0dad6SMatthew G. Knepley { 49493554e41dSMatthew G. Knepley PetscInt pMax[4]; 49503554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 49519bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 49529bf0dad6SMatthew G. Knepley 49539bf0dad6SMatthew G. Knepley PetscFunctionBegin; 49549bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4955c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 49569bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 495725abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 49583554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 49593554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 49603554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 49619bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 49629bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 49639bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 49649bf0dad6SMatthew G. Knepley 496525abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 49669bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 49679bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 49689bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 49699bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 49709bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 49719bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 49729bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 49739bf0dad6SMatthew G. Knepley } 49743554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 49759bf0dad6SMatthew 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); 49769bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 49779bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 49789bf0dad6SMatthew G. Knepley 49799bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 49809bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 49819bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 49829bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 49839bf0dad6SMatthew G. Knepley } 4984e003ed69SMatthew 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); 49859bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 4986e003ed69SMatthew 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]); 49879bf0dad6SMatthew G. Knepley } 49889bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 49899bf0dad6SMatthew G. Knepley } 49909bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 49919bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 49929bf0dad6SMatthew G. Knepley } 49933554e41dSMatthew G. Knepley } 4994552f7358SJed Brown PetscFunctionReturn(0); 4995552f7358SJed Brown } 49963913d7c8SMatthew G. Knepley 49973913d7c8SMatthew G. Knepley #undef __FUNCT__ 4998bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 4999bceba477SMatthew G. Knepley /* Pointwise interpolation 5000bceba477SMatthew G. Knepley Just code FEM for now 5001bceba477SMatthew G. Knepley u^f = I u^c 50024ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 50034ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 50044ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5005bceba477SMatthew G. Knepley */ 5006bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5007bceba477SMatthew G. Knepley { 5008bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5009bceba477SMatthew G. Knepley PetscInt m, n; 5010a063dac3SMatthew G. Knepley void *ctx; 5011bceba477SMatthew G. Knepley PetscErrorCode ierr; 5012bceba477SMatthew G. Knepley 5013bceba477SMatthew G. Knepley PetscFunctionBegin; 5014bceba477SMatthew G. Knepley /* 5015bceba477SMatthew G. Knepley Loop over coarse cells 5016bceba477SMatthew G. Knepley Loop over coarse basis functions 5017bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5018bceba477SMatthew G. Knepley Loop over fine dual basis functions 5019bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5020bceba477SMatthew G. Knepley Sum 5021bceba477SMatthew G. Knepley Update local element matrix 5022bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5023bceba477SMatthew G. Knepley 5024bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5025bceba477SMatthew G. Knepley */ 5026bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5027bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5028bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5029bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5030bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5031bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5032bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5033bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5034a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5035a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 50365d1c2e58SMatthew G. Knepley /* Use naive scaling */ 50375d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5038a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5039a063dac3SMatthew G. Knepley } 5040bceba477SMatthew G. Knepley 5041a063dac3SMatthew G. Knepley #undef __FUNCT__ 5042a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 5043a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 5044a063dac3SMatthew G. Knepley { 504590748bafSMatthew G. Knepley PetscErrorCode ierr; 504690748bafSMatthew G. Knepley 5047a063dac3SMatthew G. Knepley PetscFunctionBegin; 50487c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 5049bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5050bceba477SMatthew G. Knepley } 5051bceba477SMatthew G. Knepley 5052bceba477SMatthew G. Knepley #undef __FUNCT__ 5053fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5054fd59a867SMatthew G. Knepley /* Pointwise interpolation 5055fd59a867SMatthew G. Knepley Just code FEM for now 5056fd59a867SMatthew G. Knepley u^f = I u^c 5057fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 5058fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 5059fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 5060fd59a867SMatthew G. Knepley */ 5061fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5062fd59a867SMatthew G. Knepley { 5063fd59a867SMatthew G. Knepley PetscSection section; 5064fd59a867SMatthew G. Knepley IS *bcPoints; 5065286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5066286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 5067fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5068fd59a867SMatthew G. Knepley 5069fd59a867SMatthew G. Knepley PetscFunctionBegin; 5070fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 5071286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5072c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5073fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5074fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5075fd59a867SMatthew G. Knepley PetscBool isEssential; 507663d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 5077fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 5078fd59a867SMatthew G. Knepley } 5079fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 5080fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 5081fd59a867SMatthew G. Knepley const char *bdLabel; 5082fd59a867SMatthew G. Knepley DMLabel label; 5083fd59a867SMatthew G. Knepley const PetscInt *values; 50847391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 5085c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 5086fd59a867SMatthew G. Knepley 508763d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 5088fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 5089fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 50907391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 50917391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 50927391c1cbSMatthew G. Knepley const char *bdname; 50932f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 50947391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 50957391c1cbSMatthew G. Knepley if (duplicate) break; 50967391c1cbSMatthew G. Knepley } 50977391c1cbSMatthew G. Knepley if (!duplicate) { 5098fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 509932720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 51007391c1cbSMatthew G. Knepley } 510193a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 5102fd59a867SMatthew G. Knepley if (isEssential) { 510393a5981aSMatthew G. Knepley IS tmp; 510493a5981aSMatthew G. Knepley PetscInt *newidx; 510593a5981aSMatthew G. Knepley const PetscInt *idx; 510693a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 510793a5981aSMatthew G. Knepley 5108fd59a867SMatthew G. Knepley bcFields[bc] = field; 510993a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 511093a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 511193a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 511293a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 511393a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 511493a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 511593a5981aSMatthew G. Knepley newn = 0; 511693a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 511793a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 511893a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 511993a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5120fd59a867SMatthew G. Knepley } 5121fd59a867SMatthew G. Knepley } 5122fd59a867SMatthew G. Knepley /* Handle discretization */ 5123fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5124286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5125fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5126fd59a867SMatthew G. Knepley PetscFE fe; 5127286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5128fd59a867SMatthew G. Knepley PetscInt d; 5129fd59a867SMatthew G. Knepley 513018abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5131fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5132286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5133286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5134fd59a867SMatthew G. Knepley } 5135286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5136286d8613SMatthew G. Knepley PetscInt d; 5137286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5138286d8613SMatthew 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."); 5139286d8613SMatthew G. Knepley } 5140286d8613SMatthew G. Knepley } 5141f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 5142fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5143fd59a867SMatthew G. Knepley PetscFE fe; 5144fd59a867SMatthew G. Knepley const char *name; 514518abd763SMatthew G. Knepley 514618abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5147fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5148fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5149fd59a867SMatthew G. Knepley } 5150fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5151fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5152fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 5153fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 5154286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5155bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5156bceba477SMatthew G. Knepley } 5157bceba477SMatthew G. Knepley 5158bceba477SMatthew G. Knepley #undef __FUNCT__ 51593913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 51603913d7c8SMatthew G. Knepley /*@ 51613913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 51623913d7c8SMatthew G. Knepley 51633913d7c8SMatthew G. Knepley Input Parameter: 51643913d7c8SMatthew G. Knepley . dm - The DMPlex object 51653913d7c8SMatthew G. Knepley 51663913d7c8SMatthew G. Knepley Output Parameter: 51673913d7c8SMatthew G. Knepley . cdm - The coarse DM 51683913d7c8SMatthew G. Knepley 51693913d7c8SMatthew G. Knepley Level: intermediate 51703913d7c8SMatthew G. Knepley 51713913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 51723913d7c8SMatthew G. Knepley @*/ 51733913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 51743913d7c8SMatthew G. Knepley { 51753913d7c8SMatthew G. Knepley PetscFunctionBegin; 51763913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 51773913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 51783913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 51793913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 51803913d7c8SMatthew G. Knepley } 51813913d7c8SMatthew G. Knepley 51823913d7c8SMatthew G. Knepley #undef __FUNCT__ 51833913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 51843913d7c8SMatthew G. Knepley /*@ 51853913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 51863913d7c8SMatthew G. Knepley 51873913d7c8SMatthew G. Knepley Input Parameters: 51883913d7c8SMatthew G. Knepley + dm - The DMPlex object 51893913d7c8SMatthew G. Knepley - cdm - The coarse DM 51903913d7c8SMatthew G. Knepley 51913913d7c8SMatthew G. Knepley Level: intermediate 51923913d7c8SMatthew G. Knepley 51933913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 51943913d7c8SMatthew G. Knepley @*/ 51953913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 51963913d7c8SMatthew G. Knepley { 51973913d7c8SMatthew G. Knepley DM_Plex *mesh; 51983913d7c8SMatthew G. Knepley PetscErrorCode ierr; 51993913d7c8SMatthew G. Knepley 52003913d7c8SMatthew G. Knepley PetscFunctionBegin; 52013913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 52023913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 52033913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 52043913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 52053913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 52063913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 52073913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 52083913d7c8SMatthew G. Knepley } 5209