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 { 437*fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 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); 444*fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 445c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 446552f7358SJed Brown if (iascii) { 447552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 448c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 449c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4507afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 451c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4527afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 453c6ccd67eSMatthew G. Knepley #else 454c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 455552f7358SJed Brown #endif 45611aeaf0aSBarry Smith } 457*fcf6c8fdSToby Isaac else if (isvtk) { 458*fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 459*fcf6c8fdSToby Isaac } 460552f7358SJed Brown PetscFunctionReturn(0); 461552f7358SJed Brown } 462552f7358SJed Brown 4632c40f234SMatthew G. Knepley #undef __FUNCT__ 4642c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4652c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4662c40f234SMatthew G. Knepley { 4672c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4682c40f234SMatthew G. Knepley PetscErrorCode ierr; 4692c40f234SMatthew G. Knepley 4702c40f234SMatthew G. Knepley PetscFunctionBegin; 4712c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4722c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4732c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4742c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4752c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4762c40f234SMatthew G. Knepley else if (ishdf5) { 4772c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 47810b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4792c40f234SMatthew G. Knepley #else 4802c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 481552f7358SJed Brown #endif 482552f7358SJed Brown } 483552f7358SJed Brown PetscFunctionReturn(0); 484552f7358SJed Brown } 485552f7358SJed Brown 486552f7358SJed Brown #undef __FUNCT__ 4876c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4886c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4896c73c22cSMatthew G. Knepley { 4906c73c22cSMatthew G. Knepley DMBoundary b, next; 4916c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4926c73c22cSMatthew G. Knepley 4938e136ac0SMatthew G. Knepley PetscFunctionBegin; 4946c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4956c73c22cSMatthew G. Knepley b = *boundary; 4966c73c22cSMatthew G. Knepley *boundary = NULL; 4976c73c22cSMatthew G. Knepley for (; b; b = next) { 4986c73c22cSMatthew G. Knepley next = b->next; 4996c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5006c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 50163d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 5026c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5036c73c22cSMatthew G. Knepley } 5046c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5056c73c22cSMatthew G. Knepley } 5066c73c22cSMatthew G. Knepley 5076c73c22cSMatthew G. Knepley #undef __FUNCT__ 508552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 509552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 510552f7358SJed Brown { 511552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 512552f7358SJed Brown DMLabel next = mesh->labels; 513552f7358SJed Brown PetscErrorCode ierr; 514552f7358SJed Brown 515552f7358SJed Brown PetscFunctionBegin; 5160d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 517552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 518552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 519552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 520552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 521552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 522552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 523552f7358SJed Brown while (next) { 524552f7358SJed Brown DMLabel tmp = next->next; 525552f7358SJed Brown 526552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 527552f7358SJed Brown next = tmp; 528552f7358SJed Brown } 5293913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 530a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 531552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 532552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5336c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 534552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 535552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 536552f7358SJed Brown PetscFunctionReturn(0); 537552f7358SJed Brown } 538552f7358SJed Brown 539552f7358SJed Brown #undef __FUNCT__ 540552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 541b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 542552f7358SJed Brown { 543552f7358SJed Brown PetscSection section, sectionGlobal; 544552f7358SJed Brown PetscInt bs = -1; 545552f7358SJed Brown PetscInt localSize; 54689545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 547552f7358SJed Brown PetscErrorCode ierr; 548b412c318SBarry Smith MatType mtype; 549552f7358SJed Brown 550552f7358SJed Brown PetscFunctionBegin; 551607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 552b412c318SBarry Smith mtype = dm->mattype; 553552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 554552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 555552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 556552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 55782f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 558552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 559552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 560552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 561552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 562552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 563552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 564552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 565552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 566552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 567552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 568552f7358SJed Brown if (!isShell) { 569552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5702a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 571552f7358SJed Brown 572552f7358SJed Brown if (bs < 0) { 573552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 574fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 575552f7358SJed Brown 576552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 577552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 578552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 579fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 580fad22124SMatthew G Knepley if (dof-cdof) { 5812a28c762SMatthew G Knepley if (bs < 0) { 582fad22124SMatthew G Knepley bs = dof-cdof; 583fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5842a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5852a28c762SMatthew G Knepley bs = 1; 586552f7358SJed Brown break; 587552f7358SJed Brown } 588552f7358SJed Brown } 5892a28c762SMatthew G Knepley } 5902a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5912a28c762SMatthew G Knepley bsLocal = bs; 59282f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5932a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59482f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5952a28c762SMatthew G Knepley if (bsMin != bsMax) { 5962a28c762SMatthew G Knepley bs = 1; 5972a28c762SMatthew G Knepley } else { 5982a28c762SMatthew G Knepley bs = bsMax; 5992a28c762SMatthew G Knepley } 600552f7358SJed Brown } else { 601552f7358SJed Brown bs = 1; 602552f7358SJed Brown } 603552f7358SJed Brown } 6041795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 605552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 606552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 607552f7358SJed Brown } 608552f7358SJed Brown PetscFunctionReturn(0); 609552f7358SJed Brown } 610552f7358SJed Brown 611552f7358SJed Brown #undef __FUNCT__ 612552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 613552f7358SJed Brown /*@ 614552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 615552f7358SJed Brown 616552f7358SJed Brown Not collective 617552f7358SJed Brown 618552f7358SJed Brown Input Parameter: 619552f7358SJed Brown . mesh - The DMPlex 620552f7358SJed Brown 621552f7358SJed Brown Output Parameters: 622552f7358SJed Brown + pStart - The first mesh point 623552f7358SJed Brown - pEnd - The upper bound for mesh points 624552f7358SJed Brown 625552f7358SJed Brown Level: beginner 626552f7358SJed Brown 627552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 628552f7358SJed Brown @*/ 629552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 630552f7358SJed Brown { 631552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 632552f7358SJed Brown PetscErrorCode ierr; 633552f7358SJed Brown 634552f7358SJed Brown PetscFunctionBegin; 635552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 636552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 637552f7358SJed Brown PetscFunctionReturn(0); 638552f7358SJed Brown } 639552f7358SJed Brown 640552f7358SJed Brown #undef __FUNCT__ 641552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 642552f7358SJed Brown /*@ 643552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 644552f7358SJed Brown 645552f7358SJed Brown Not collective 646552f7358SJed Brown 647552f7358SJed Brown Input Parameters: 648552f7358SJed Brown + mesh - The DMPlex 649552f7358SJed Brown . pStart - The first mesh point 650552f7358SJed Brown - pEnd - The upper bound for mesh points 651552f7358SJed Brown 652552f7358SJed Brown Output Parameters: 653552f7358SJed Brown 654552f7358SJed Brown Level: beginner 655552f7358SJed Brown 656552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 657552f7358SJed Brown @*/ 658552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 659552f7358SJed Brown { 660552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 661552f7358SJed Brown PetscErrorCode ierr; 662552f7358SJed Brown 663552f7358SJed Brown PetscFunctionBegin; 664552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 665552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 666552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 667552f7358SJed Brown PetscFunctionReturn(0); 668552f7358SJed Brown } 669552f7358SJed Brown 670552f7358SJed Brown #undef __FUNCT__ 671552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 672552f7358SJed Brown /*@ 673552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 674552f7358SJed Brown 675552f7358SJed Brown Not collective 676552f7358SJed Brown 677552f7358SJed Brown Input Parameters: 678552f7358SJed Brown + mesh - The DMPlex 679552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 680552f7358SJed Brown 681552f7358SJed Brown Output Parameter: 682552f7358SJed Brown . size - The cone size for point p 683552f7358SJed Brown 684552f7358SJed Brown Level: beginner 685552f7358SJed Brown 686552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 687552f7358SJed Brown @*/ 688552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 689552f7358SJed Brown { 690552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 691552f7358SJed Brown PetscErrorCode ierr; 692552f7358SJed Brown 693552f7358SJed Brown PetscFunctionBegin; 694552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 695552f7358SJed Brown PetscValidPointer(size, 3); 696552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 697552f7358SJed Brown PetscFunctionReturn(0); 698552f7358SJed Brown } 699552f7358SJed Brown 700552f7358SJed Brown #undef __FUNCT__ 701552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 702552f7358SJed Brown /*@ 703552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 704552f7358SJed Brown 705552f7358SJed Brown Not collective 706552f7358SJed Brown 707552f7358SJed Brown Input Parameters: 708552f7358SJed Brown + mesh - The DMPlex 709552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 710552f7358SJed Brown - size - The cone size for point p 711552f7358SJed Brown 712552f7358SJed Brown Output Parameter: 713552f7358SJed Brown 714552f7358SJed Brown Note: 715552f7358SJed Brown This should be called after DMPlexSetChart(). 716552f7358SJed Brown 717552f7358SJed Brown Level: beginner 718552f7358SJed Brown 719552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 720552f7358SJed Brown @*/ 721552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 722552f7358SJed Brown { 723552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 724552f7358SJed Brown PetscErrorCode ierr; 725552f7358SJed Brown 726552f7358SJed Brown PetscFunctionBegin; 727552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 728552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7290d644c17SKarl Rupp 730552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 731552f7358SJed Brown PetscFunctionReturn(0); 732552f7358SJed Brown } 733552f7358SJed Brown 734552f7358SJed Brown #undef __FUNCT__ 735f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 736f5a469b9SMatthew G. Knepley /*@ 737f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 738f5a469b9SMatthew G. Knepley 739f5a469b9SMatthew G. Knepley Not collective 740f5a469b9SMatthew G. Knepley 741f5a469b9SMatthew G. Knepley Input Parameters: 742f5a469b9SMatthew G. Knepley + mesh - The DMPlex 743f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 744f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 745f5a469b9SMatthew G. Knepley 746f5a469b9SMatthew G. Knepley Output Parameter: 747f5a469b9SMatthew G. Knepley 748f5a469b9SMatthew G. Knepley Note: 749f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 750f5a469b9SMatthew G. Knepley 751f5a469b9SMatthew G. Knepley Level: beginner 752f5a469b9SMatthew G. Knepley 753f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 754f5a469b9SMatthew G. Knepley @*/ 755f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 756f5a469b9SMatthew G. Knepley { 757f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 758f5a469b9SMatthew G. Knepley PetscInt csize; 759f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 760f5a469b9SMatthew G. Knepley 761f5a469b9SMatthew G. Knepley PetscFunctionBegin; 762f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 763f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 764f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 765f5a469b9SMatthew G. Knepley 766f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 767f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 768f5a469b9SMatthew G. Knepley } 769f5a469b9SMatthew G. Knepley 770f5a469b9SMatthew G. Knepley #undef __FUNCT__ 771552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 772552f7358SJed Brown /*@C 773552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 774552f7358SJed Brown 775552f7358SJed Brown Not collective 776552f7358SJed Brown 777552f7358SJed Brown Input Parameters: 778552f7358SJed Brown + mesh - The DMPlex 779552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 780552f7358SJed Brown 781552f7358SJed Brown Output Parameter: 782552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 783552f7358SJed Brown 784552f7358SJed Brown Level: beginner 785552f7358SJed Brown 7863813dfbdSMatthew G Knepley Fortran Notes: 7873813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7883813dfbdSMatthew G Knepley include petsc.h90 in your code. 7893813dfbdSMatthew G Knepley 7903813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 791552f7358SJed Brown 792552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 793552f7358SJed Brown @*/ 794552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 795552f7358SJed Brown { 796552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 797552f7358SJed Brown PetscInt off; 798552f7358SJed Brown PetscErrorCode ierr; 799552f7358SJed Brown 800552f7358SJed Brown PetscFunctionBegin; 801552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 802552f7358SJed Brown PetscValidPointer(cone, 3); 803552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 804552f7358SJed Brown *cone = &mesh->cones[off]; 805552f7358SJed Brown PetscFunctionReturn(0); 806552f7358SJed Brown } 807552f7358SJed Brown 808552f7358SJed Brown #undef __FUNCT__ 809552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 810552f7358SJed Brown /*@ 811552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 812552f7358SJed Brown 813552f7358SJed Brown Not collective 814552f7358SJed Brown 815552f7358SJed Brown Input Parameters: 816552f7358SJed Brown + mesh - The DMPlex 817552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 818552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 819552f7358SJed Brown 820552f7358SJed Brown Output Parameter: 821552f7358SJed Brown 822552f7358SJed Brown Note: 823552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 824552f7358SJed Brown 825552f7358SJed Brown Level: beginner 826552f7358SJed Brown 827552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 828552f7358SJed Brown @*/ 829552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 830552f7358SJed Brown { 831552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 832552f7358SJed Brown PetscInt pStart, pEnd; 833552f7358SJed Brown PetscInt dof, off, c; 834552f7358SJed Brown PetscErrorCode ierr; 835552f7358SJed Brown 836552f7358SJed Brown PetscFunctionBegin; 837552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 838552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 839552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 840552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 841552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84282f516ccSBarry 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); 843552f7358SJed Brown for (c = 0; c < dof; ++c) { 84482f516ccSBarry 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); 845552f7358SJed Brown mesh->cones[off+c] = cone[c]; 846552f7358SJed Brown } 847552f7358SJed Brown PetscFunctionReturn(0); 848552f7358SJed Brown } 849552f7358SJed Brown 850552f7358SJed Brown #undef __FUNCT__ 851552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 852552f7358SJed Brown /*@C 853552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 854552f7358SJed Brown 855552f7358SJed Brown Not collective 856552f7358SJed Brown 857552f7358SJed Brown Input Parameters: 858552f7358SJed Brown + mesh - The DMPlex 859552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 860552f7358SJed Brown 861552f7358SJed Brown Output Parameter: 862552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 863552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 864552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 865552f7358SJed Brown the index of the cone point on which to start. 866552f7358SJed Brown 867552f7358SJed Brown Level: beginner 868552f7358SJed Brown 8693813dfbdSMatthew G Knepley Fortran Notes: 8703813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8713813dfbdSMatthew G Knepley include petsc.h90 in your code. 8723813dfbdSMatthew G Knepley 8733813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 874552f7358SJed Brown 875552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 876552f7358SJed Brown @*/ 877552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 878552f7358SJed Brown { 879552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 880552f7358SJed Brown PetscInt off; 881552f7358SJed Brown PetscErrorCode ierr; 882552f7358SJed Brown 883552f7358SJed Brown PetscFunctionBegin; 884552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 885552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 886552f7358SJed Brown { 887552f7358SJed Brown PetscInt dof; 888552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 889552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 890552f7358SJed Brown } 891552f7358SJed Brown #endif 892552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8930d644c17SKarl Rupp 894552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 895552f7358SJed Brown PetscFunctionReturn(0); 896552f7358SJed Brown } 897552f7358SJed Brown 898552f7358SJed Brown #undef __FUNCT__ 899552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 900552f7358SJed Brown /*@ 901552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 902552f7358SJed Brown 903552f7358SJed Brown Not collective 904552f7358SJed Brown 905552f7358SJed Brown Input Parameters: 906552f7358SJed Brown + mesh - The DMPlex 907552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 908552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 909552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 910552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 911552f7358SJed Brown the index of the cone point on which to start. 912552f7358SJed Brown 913552f7358SJed Brown Output Parameter: 914552f7358SJed Brown 915552f7358SJed Brown Note: 916552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 917552f7358SJed Brown 918552f7358SJed Brown Level: beginner 919552f7358SJed Brown 920552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 921552f7358SJed Brown @*/ 922552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 923552f7358SJed Brown { 924552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 925552f7358SJed Brown PetscInt pStart, pEnd; 926552f7358SJed Brown PetscInt dof, off, c; 927552f7358SJed Brown PetscErrorCode ierr; 928552f7358SJed Brown 929552f7358SJed Brown PetscFunctionBegin; 930552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 931552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 932552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 933552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 934552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 93582f516ccSBarry 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); 936552f7358SJed Brown for (c = 0; c < dof; ++c) { 937552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 938552f7358SJed Brown 939552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 94082f516ccSBarry 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); 941552f7358SJed Brown mesh->coneOrientations[off+c] = o; 942552f7358SJed Brown } 943552f7358SJed Brown PetscFunctionReturn(0); 944552f7358SJed Brown } 945552f7358SJed Brown 946552f7358SJed Brown #undef __FUNCT__ 947552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 948552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 949552f7358SJed Brown { 950552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 951552f7358SJed Brown PetscInt pStart, pEnd; 952552f7358SJed Brown PetscInt dof, off; 953552f7358SJed Brown PetscErrorCode ierr; 954552f7358SJed Brown 955552f7358SJed Brown PetscFunctionBegin; 956552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 957552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 95882f516ccSBarry 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); 95982f516ccSBarry 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); 96077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 96177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 96277c88f5bSMatthew 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); 963552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 964552f7358SJed Brown PetscFunctionReturn(0); 965552f7358SJed Brown } 966552f7358SJed Brown 967552f7358SJed Brown #undef __FUNCT__ 96877c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 96977c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 97077c88f5bSMatthew G Knepley { 97177c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 97277c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 97377c88f5bSMatthew G Knepley PetscInt dof, off; 97477c88f5bSMatthew G Knepley PetscErrorCode ierr; 97577c88f5bSMatthew G Knepley 97677c88f5bSMatthew G Knepley PetscFunctionBegin; 97777c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 97877c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97977c88f5bSMatthew 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); 98077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 98177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98277c88f5bSMatthew 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); 98377c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 98477c88f5bSMatthew G Knepley PetscFunctionReturn(0); 98577c88f5bSMatthew G Knepley } 98677c88f5bSMatthew G Knepley 98777c88f5bSMatthew G Knepley #undef __FUNCT__ 988552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 989552f7358SJed Brown /*@ 990552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 991552f7358SJed Brown 992552f7358SJed Brown Not collective 993552f7358SJed Brown 994552f7358SJed Brown Input Parameters: 995552f7358SJed Brown + mesh - The DMPlex 996552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 997552f7358SJed Brown 998552f7358SJed Brown Output Parameter: 999552f7358SJed Brown . size - The support size for point p 1000552f7358SJed Brown 1001552f7358SJed Brown Level: beginner 1002552f7358SJed Brown 1003552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1004552f7358SJed Brown @*/ 1005552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1006552f7358SJed Brown { 1007552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1008552f7358SJed Brown PetscErrorCode ierr; 1009552f7358SJed Brown 1010552f7358SJed Brown PetscFunctionBegin; 1011552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1012552f7358SJed Brown PetscValidPointer(size, 3); 1013552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1014552f7358SJed Brown PetscFunctionReturn(0); 1015552f7358SJed Brown } 1016552f7358SJed Brown 1017552f7358SJed Brown #undef __FUNCT__ 1018552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1019552f7358SJed Brown /*@ 1020552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1021552f7358SJed Brown 1022552f7358SJed Brown Not collective 1023552f7358SJed Brown 1024552f7358SJed Brown Input Parameters: 1025552f7358SJed Brown + mesh - The DMPlex 1026552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1027552f7358SJed Brown - size - The support size for point p 1028552f7358SJed Brown 1029552f7358SJed Brown Output Parameter: 1030552f7358SJed Brown 1031552f7358SJed Brown Note: 1032552f7358SJed Brown This should be called after DMPlexSetChart(). 1033552f7358SJed Brown 1034552f7358SJed Brown Level: beginner 1035552f7358SJed Brown 1036552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1037552f7358SJed Brown @*/ 1038552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1039552f7358SJed Brown { 1040552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1041552f7358SJed Brown PetscErrorCode ierr; 1042552f7358SJed Brown 1043552f7358SJed Brown PetscFunctionBegin; 1044552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1045552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10460d644c17SKarl Rupp 1047552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1048552f7358SJed Brown PetscFunctionReturn(0); 1049552f7358SJed Brown } 1050552f7358SJed Brown 1051552f7358SJed Brown #undef __FUNCT__ 1052552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1053552f7358SJed Brown /*@C 1054552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1055552f7358SJed Brown 1056552f7358SJed Brown Not collective 1057552f7358SJed Brown 1058552f7358SJed Brown Input Parameters: 1059552f7358SJed Brown + mesh - The DMPlex 1060552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1061552f7358SJed Brown 1062552f7358SJed Brown Output Parameter: 1063552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1064552f7358SJed Brown 1065552f7358SJed Brown Level: beginner 1066552f7358SJed Brown 10673813dfbdSMatthew G Knepley Fortran Notes: 10683813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10693813dfbdSMatthew G Knepley include petsc.h90 in your code. 10703813dfbdSMatthew G Knepley 10713813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10723813dfbdSMatthew G Knepley 1073552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1074552f7358SJed Brown @*/ 1075552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1076552f7358SJed Brown { 1077552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1078552f7358SJed Brown PetscInt off; 1079552f7358SJed Brown PetscErrorCode ierr; 1080552f7358SJed Brown 1081552f7358SJed Brown PetscFunctionBegin; 1082552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1083552f7358SJed Brown PetscValidPointer(support, 3); 1084552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1085552f7358SJed Brown *support = &mesh->supports[off]; 1086552f7358SJed Brown PetscFunctionReturn(0); 1087552f7358SJed Brown } 1088552f7358SJed Brown 1089552f7358SJed Brown #undef __FUNCT__ 1090552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1091552f7358SJed Brown /*@ 1092552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1093552f7358SJed Brown 1094552f7358SJed Brown Not collective 1095552f7358SJed Brown 1096552f7358SJed Brown Input Parameters: 1097552f7358SJed Brown + mesh - The DMPlex 1098552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1099552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1100552f7358SJed Brown 1101552f7358SJed Brown Output Parameter: 1102552f7358SJed Brown 1103552f7358SJed Brown Note: 1104552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1105552f7358SJed Brown 1106552f7358SJed Brown Level: beginner 1107552f7358SJed Brown 1108552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1109552f7358SJed Brown @*/ 1110552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1111552f7358SJed Brown { 1112552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1113552f7358SJed Brown PetscInt pStart, pEnd; 1114552f7358SJed Brown PetscInt dof, off, c; 1115552f7358SJed Brown PetscErrorCode ierr; 1116552f7358SJed Brown 1117552f7358SJed Brown PetscFunctionBegin; 1118552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1119552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1120552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1121552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1122552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 112382f516ccSBarry 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); 1124552f7358SJed Brown for (c = 0; c < dof; ++c) { 112582f516ccSBarry 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); 1126552f7358SJed Brown mesh->supports[off+c] = support[c]; 1127552f7358SJed Brown } 1128552f7358SJed Brown PetscFunctionReturn(0); 1129552f7358SJed Brown } 1130552f7358SJed Brown 1131552f7358SJed Brown #undef __FUNCT__ 1132552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1133552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1134552f7358SJed Brown { 1135552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1136552f7358SJed Brown PetscInt pStart, pEnd; 1137552f7358SJed Brown PetscInt dof, off; 1138552f7358SJed Brown PetscErrorCode ierr; 1139552f7358SJed Brown 1140552f7358SJed Brown PetscFunctionBegin; 1141552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1142552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1143552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1144552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114582f516ccSBarry 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); 114682f516ccSBarry 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); 114782f516ccSBarry 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); 1148552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1149552f7358SJed Brown PetscFunctionReturn(0); 1150552f7358SJed Brown } 1151552f7358SJed Brown 1152552f7358SJed Brown #undef __FUNCT__ 1153552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1154552f7358SJed Brown /*@C 1155552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1156552f7358SJed Brown 1157552f7358SJed Brown Not collective 1158552f7358SJed Brown 1159552f7358SJed Brown Input Parameters: 1160552f7358SJed Brown + mesh - The DMPlex 1161552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1162552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11630298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1164552f7358SJed Brown 1165552f7358SJed Brown Output Parameters: 1166552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1167552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1168552f7358SJed Brown 1169552f7358SJed Brown Note: 11700298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1171552f7358SJed Brown 11723813dfbdSMatthew G Knepley Fortran Notes: 11733813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11743813dfbdSMatthew G Knepley include petsc.h90 in your code. 11753813dfbdSMatthew G Knepley 11763813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11773813dfbdSMatthew G Knepley 1178552f7358SJed Brown Level: beginner 1179552f7358SJed Brown 1180552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1181552f7358SJed Brown @*/ 1182552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1183552f7358SJed Brown { 1184552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1185552f7358SJed Brown PetscInt *closure, *fifo; 11860298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1187552f7358SJed Brown PetscInt tmpSize, t; 1188552f7358SJed Brown PetscInt depth = 0, maxSize; 1189552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1190552f7358SJed Brown PetscErrorCode ierr; 1191552f7358SJed Brown 1192552f7358SJed Brown PetscFunctionBegin; 1193552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1194552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1195552f7358SJed Brown /* This is only 1-level */ 1196552f7358SJed Brown if (useCone) { 1197552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1198552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1199552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1200552f7358SJed Brown } else { 1201552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1202552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1203552f7358SJed Brown } 1204bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1205bfbcdd7aSMatthew G. Knepley if (*points) { 1206bfbcdd7aSMatthew G. Knepley closure = *points; 1207bfbcdd7aSMatthew G. Knepley } else { 1208bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1209bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1210bfbcdd7aSMatthew G. Knepley } 1211bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1212bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1213bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1214bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1215bfbcdd7aSMatthew G. Knepley } 1216bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1217bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1218bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1219bfbcdd7aSMatthew G. Knepley } 1220bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1221bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1222bfbcdd7aSMatthew G. Knepley if (*points) { 1223bfbcdd7aSMatthew G. Knepley closure = *points; 1224bfbcdd7aSMatthew G. Knepley } else { 1225bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1226bfbcdd7aSMatthew G. Knepley } 1227bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1228552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1229552f7358SJed Brown const PetscInt cp = tmp[t]; 1230552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1231552f7358SJed Brown 1232552f7358SJed Brown closure[closureSize] = cp; 1233552f7358SJed Brown closure[closureSize+1] = co; 1234552f7358SJed Brown fifo[fifoSize] = cp; 1235552f7358SJed Brown fifo[fifoSize+1] = co; 1236552f7358SJed Brown } 1237bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1238552f7358SJed Brown while (fifoSize - fifoStart) { 1239552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1240552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1241552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1242552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1243552f7358SJed Brown 1244552f7358SJed Brown if (useCone) { 1245552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1246552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1247552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1248552f7358SJed Brown } else { 1249552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1250552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12510298fd71SBarry Smith tmpO = NULL; 1252552f7358SJed Brown } 1253552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1254552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1255552f7358SJed Brown const PetscInt cp = tmp[i]; 12562e1b13c2SMatthew 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. */ 12572e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12582e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12592e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1260552f7358SJed Brown PetscInt c; 1261552f7358SJed Brown 12622e1b13c2SMatthew G. Knepley if (rev) { 12632e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12642e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12652e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12662e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12672e1b13c2SMatthew G. Knepley } 1268552f7358SJed Brown /* Check for duplicate */ 1269552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1270552f7358SJed Brown if (closure[c] == cp) break; 1271552f7358SJed Brown } 1272552f7358SJed Brown if (c == closureSize) { 1273552f7358SJed Brown closure[closureSize] = cp; 1274552f7358SJed Brown closure[closureSize+1] = co; 1275552f7358SJed Brown fifo[fifoSize] = cp; 1276552f7358SJed Brown fifo[fifoSize+1] = co; 1277552f7358SJed Brown closureSize += 2; 1278552f7358SJed Brown fifoSize += 2; 1279552f7358SJed Brown } 1280552f7358SJed Brown } 1281552f7358SJed Brown fifoStart += 2; 1282552f7358SJed Brown } 1283552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1284552f7358SJed Brown if (points) *points = closure; 1285552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1286552f7358SJed Brown PetscFunctionReturn(0); 1287552f7358SJed Brown } 1288552f7358SJed Brown 1289552f7358SJed Brown #undef __FUNCT__ 12909bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 12919bf0dad6SMatthew G. Knepley /*@C 12929bf0dad6SMatthew 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 12939bf0dad6SMatthew G. Knepley 12949bf0dad6SMatthew G. Knepley Not collective 12959bf0dad6SMatthew G. Knepley 12969bf0dad6SMatthew G. Knepley Input Parameters: 12979bf0dad6SMatthew G. Knepley + mesh - The DMPlex 12989bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 12999bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13009bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13019bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13029bf0dad6SMatthew G. Knepley 13039bf0dad6SMatthew G. Knepley Output Parameters: 13049bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13059bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13069bf0dad6SMatthew G. Knepley 13079bf0dad6SMatthew G. Knepley Note: 13089bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13099bf0dad6SMatthew G. Knepley 13109bf0dad6SMatthew G. Knepley Fortran Notes: 13119bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13129bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13139bf0dad6SMatthew G. Knepley 13149bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley Level: beginner 13179bf0dad6SMatthew G. Knepley 13189bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13199bf0dad6SMatthew G. Knepley @*/ 13209bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13219bf0dad6SMatthew G. Knepley { 13229bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13239bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13249bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13259bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13269bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13279bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13289bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13299bf0dad6SMatthew G. Knepley 13309bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13319bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13329bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13339bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13349bf0dad6SMatthew G. Knepley if (useCone) { 13359bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13369bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13379bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13389bf0dad6SMatthew G. Knepley } else { 13399bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13409bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13419bf0dad6SMatthew G. Knepley } 13429bf0dad6SMatthew G. Knepley if (depth == 1) { 13439bf0dad6SMatthew G. Knepley if (*points) { 13449bf0dad6SMatthew G. Knepley closure = *points; 13459bf0dad6SMatthew G. Knepley } else { 13469bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13479bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13489bf0dad6SMatthew G. Knepley } 13499bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13509bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13519bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13529bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13539bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13549bf0dad6SMatthew G. Knepley } 13559bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13569bf0dad6SMatthew G. Knepley if (points) *points = closure; 13579bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13589bf0dad6SMatthew G. Knepley } 13599bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13609bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13619bf0dad6SMatthew G. Knepley if (*points) { 13629bf0dad6SMatthew G. Knepley closure = *points; 13639bf0dad6SMatthew G. Knepley } else { 13649bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13659bf0dad6SMatthew G. Knepley } 13669bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13679bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13689bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13699bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13709bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13719bf0dad6SMatthew G. Knepley 13729bf0dad6SMatthew G. Knepley if (ornt < 0) { 13739bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13749bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13759bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13769bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13779bf0dad6SMatthew G. Knepley } 13789bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13799bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13809bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13819bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13829bf0dad6SMatthew G. Knepley } 13839bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 13849bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 13859bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 13869bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 13879bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 13889bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 13899bf0dad6SMatthew G. Knepley 13909bf0dad6SMatthew G. Knepley if (useCone) { 13919bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13929bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13939bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13949bf0dad6SMatthew G. Knepley } else { 13959bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 13969bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13979bf0dad6SMatthew G. Knepley tmpO = NULL; 13989bf0dad6SMatthew G. Knepley } 13999bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14009bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14019bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14029bf0dad6SMatthew 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. */ 14039bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14049bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14059bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14069bf0dad6SMatthew G. Knepley PetscInt c; 14079bf0dad6SMatthew G. Knepley 14089bf0dad6SMatthew G. Knepley if (rev) { 14099bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14109bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14119bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14129bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14139bf0dad6SMatthew G. Knepley } 14149bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14159bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14169bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14179bf0dad6SMatthew G. Knepley } 14189bf0dad6SMatthew G. Knepley if (c == closureSize) { 14199bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14209bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14219bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14229bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14239bf0dad6SMatthew G. Knepley closureSize += 2; 14249bf0dad6SMatthew G. Knepley fifoSize += 2; 14259bf0dad6SMatthew G. Knepley } 14269bf0dad6SMatthew G. Knepley } 14279bf0dad6SMatthew G. Knepley fifoStart += 2; 14289bf0dad6SMatthew G. Knepley } 14299bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14309bf0dad6SMatthew G. Knepley if (points) *points = closure; 14319bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14329bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14339bf0dad6SMatthew G. Knepley } 14349bf0dad6SMatthew G. Knepley 14359bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1436552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1437552f7358SJed Brown /*@C 1438552f7358SJed 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 1439552f7358SJed Brown 1440552f7358SJed Brown Not collective 1441552f7358SJed Brown 1442552f7358SJed Brown Input Parameters: 1443552f7358SJed Brown + mesh - The DMPlex 1444552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1445552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1446e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1447e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1448552f7358SJed Brown 1449552f7358SJed Brown Note: 14500298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1451552f7358SJed Brown 14523813dfbdSMatthew G Knepley Fortran Notes: 14533813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14543813dfbdSMatthew G Knepley include petsc.h90 in your code. 14553813dfbdSMatthew G Knepley 14563813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14573813dfbdSMatthew G Knepley 1458552f7358SJed Brown Level: beginner 1459552f7358SJed Brown 1460552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1461552f7358SJed Brown @*/ 1462552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1463552f7358SJed Brown { 1464552f7358SJed Brown PetscErrorCode ierr; 1465552f7358SJed Brown 1466552f7358SJed Brown PetscFunctionBegin; 1467552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1468e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1469e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1470552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14714ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1472552f7358SJed Brown PetscFunctionReturn(0); 1473552f7358SJed Brown } 1474552f7358SJed Brown 1475552f7358SJed Brown #undef __FUNCT__ 1476552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1477552f7358SJed Brown /*@ 1478552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1479552f7358SJed Brown 1480552f7358SJed Brown Not collective 1481552f7358SJed Brown 1482552f7358SJed Brown Input Parameter: 1483552f7358SJed Brown . mesh - The DMPlex 1484552f7358SJed Brown 1485552f7358SJed Brown Output Parameters: 1486552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1487552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1488552f7358SJed Brown 1489552f7358SJed Brown Level: beginner 1490552f7358SJed Brown 1491552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1492552f7358SJed Brown @*/ 1493552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1494552f7358SJed Brown { 1495552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1496552f7358SJed Brown 1497552f7358SJed Brown PetscFunctionBegin; 1498552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1499552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1500552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1501552f7358SJed Brown PetscFunctionReturn(0); 1502552f7358SJed Brown } 1503552f7358SJed Brown 1504552f7358SJed Brown #undef __FUNCT__ 1505552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1506552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1507552f7358SJed Brown { 1508552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1509552f7358SJed Brown PetscInt size; 1510552f7358SJed Brown PetscErrorCode ierr; 1511552f7358SJed Brown 1512552f7358SJed Brown PetscFunctionBegin; 1513552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1514552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1515552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15161795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15171795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1518552f7358SJed Brown if (mesh->maxSupportSize) { 1519552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1520552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15211795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1522552f7358SJed Brown } 1523552f7358SJed Brown PetscFunctionReturn(0); 1524552f7358SJed Brown } 1525552f7358SJed Brown 1526552f7358SJed Brown #undef __FUNCT__ 1527552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1528552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1529552f7358SJed Brown { 1530552f7358SJed Brown PetscErrorCode ierr; 1531552f7358SJed Brown 1532552f7358SJed Brown PetscFunctionBegin; 15334d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15344d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1535552f7358SJed Brown PetscFunctionReturn(0); 1536552f7358SJed Brown } 1537552f7358SJed Brown 1538552f7358SJed Brown #undef __FUNCT__ 1539552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1540552f7358SJed Brown /*@ 1541552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1542552f7358SJed Brown 1543552f7358SJed Brown Not collective 1544552f7358SJed Brown 1545552f7358SJed Brown Input Parameter: 1546552f7358SJed Brown . mesh - The DMPlex 1547552f7358SJed Brown 1548552f7358SJed Brown Output Parameter: 1549552f7358SJed Brown 1550552f7358SJed Brown Note: 1551552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1552552f7358SJed Brown 1553552f7358SJed Brown Level: beginner 1554552f7358SJed Brown 1555552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1556552f7358SJed Brown @*/ 1557552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1558552f7358SJed Brown { 1559552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1560552f7358SJed Brown PetscInt *offsets; 1561552f7358SJed Brown PetscInt supportSize; 1562552f7358SJed Brown PetscInt pStart, pEnd, p; 1563552f7358SJed Brown PetscErrorCode ierr; 1564552f7358SJed Brown 1565552f7358SJed Brown PetscFunctionBegin; 1566552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 156782f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1568552f7358SJed Brown /* Calculate support sizes */ 1569552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1570552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1571552f7358SJed Brown PetscInt dof, off, c; 1572552f7358SJed Brown 1573552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1574552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1575552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1576552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1577552f7358SJed Brown } 1578552f7358SJed Brown } 1579552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1580552f7358SJed Brown PetscInt dof; 1581552f7358SJed Brown 1582552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 15830d644c17SKarl Rupp 1584552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1585552f7358SJed Brown } 1586552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1587552f7358SJed Brown /* Calculate supports */ 1588552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 15891795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 15901795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1591552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1592552f7358SJed Brown PetscInt dof, off, c; 1593552f7358SJed Brown 1594552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1595552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1596552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1597552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1598552f7358SJed Brown PetscInt offS; 1599552f7358SJed Brown 1600552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16010d644c17SKarl Rupp 1602552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1603552f7358SJed Brown ++offsets[q]; 1604552f7358SJed Brown } 1605552f7358SJed Brown } 1606552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1607552f7358SJed Brown PetscFunctionReturn(0); 1608552f7358SJed Brown } 1609552f7358SJed Brown 1610552f7358SJed Brown #undef __FUNCT__ 1611552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1612552f7358SJed Brown /*@ 1613552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1614552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1615552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1616552f7358SJed Brown the DAG. 1617552f7358SJed Brown 1618552f7358SJed Brown Not collective 1619552f7358SJed Brown 1620552f7358SJed Brown Input Parameter: 1621552f7358SJed Brown . mesh - The DMPlex 1622552f7358SJed Brown 1623552f7358SJed Brown Output Parameter: 1624552f7358SJed Brown 1625552f7358SJed Brown Notes: 1626150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1627150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1628150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1629150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1630552f7358SJed Brown 1631150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1632552f7358SJed Brown 1633552f7358SJed Brown Level: beginner 1634552f7358SJed Brown 1635552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1636552f7358SJed Brown @*/ 1637552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1638552f7358SJed Brown { 1639aa50250dSMatthew G. Knepley DMLabel label; 1640552f7358SJed Brown PetscInt pStart, pEnd, p; 1641552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1642552f7358SJed Brown PetscErrorCode ierr; 1643552f7358SJed Brown 1644552f7358SJed Brown PetscFunctionBegin; 1645552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1646552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1647552f7358SJed Brown /* Calculate depth */ 1648aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1649aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1650aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1651552f7358SJed Brown /* Initialize roots and count leaves */ 1652552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1653552f7358SJed Brown PetscInt coneSize, supportSize; 1654552f7358SJed Brown 1655552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1656552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1657552f7358SJed Brown if (!coneSize && supportSize) { 1658552f7358SJed Brown ++numRoots; 1659aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1660552f7358SJed Brown } else if (!supportSize && coneSize) { 1661552f7358SJed Brown ++numLeaves; 1662552f7358SJed Brown } else if (!supportSize && !coneSize) { 1663552f7358SJed Brown /* Isolated points */ 1664aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1665552f7358SJed Brown } 1666552f7358SJed Brown } 1667552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1668552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1669552f7358SJed Brown PetscInt coneSize, supportSize; 1670552f7358SJed Brown 1671552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1672552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1673552f7358SJed Brown if (!supportSize && coneSize) { 1674aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1675552f7358SJed Brown } 1676552f7358SJed Brown } 1677552f7358SJed Brown } else { 167874ef644bSMatthew G. Knepley IS pointIS; 167974ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1680552f7358SJed Brown 168174ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 168274ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 168374ef644bSMatthew G. Knepley while (numPoints) { 168474ef644bSMatthew G. Knepley const PetscInt *points; 168574ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 168674ef644bSMatthew G. Knepley 168774ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 168874ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 168974ef644bSMatthew G. Knepley const PetscInt point = points[p]; 169074ef644bSMatthew G. Knepley const PetscInt *support; 169174ef644bSMatthew G. Knepley PetscInt supportSize, s; 169274ef644bSMatthew G. Knepley 169374ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 169474ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 169574ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 169674ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1697552f7358SJed Brown } 1698552f7358SJed Brown } 16995edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 170074ef644bSMatthew G. Knepley ++level; 170174ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170274ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170374ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170474ef644bSMatthew G. Knepley else {numPoints = 0;} 170574ef644bSMatthew G. Knepley } 170674ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170774ef644bSMatthew G. Knepley } 1708552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1709552f7358SJed Brown PetscFunctionReturn(0); 1710552f7358SJed Brown } 1711552f7358SJed Brown 1712552f7358SJed Brown #undef __FUNCT__ 1713552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1714552f7358SJed Brown /*@C 1715552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1716552f7358SJed Brown 1717552f7358SJed Brown Not Collective 1718552f7358SJed Brown 1719552f7358SJed Brown Input Parameters: 1720552f7358SJed Brown + dm - The DMPlex object 1721552f7358SJed Brown . numPoints - The number of input points for the join 1722552f7358SJed Brown - points - The input points 1723552f7358SJed Brown 1724552f7358SJed Brown Output Parameters: 1725552f7358SJed Brown + numCoveredPoints - The number of points in the join 1726552f7358SJed Brown - coveredPoints - The points in the join 1727552f7358SJed Brown 1728552f7358SJed Brown Level: intermediate 1729552f7358SJed Brown 1730552f7358SJed Brown Note: Currently, this is restricted to a single level join 1731552f7358SJed Brown 17323813dfbdSMatthew G Knepley Fortran Notes: 17333813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17343813dfbdSMatthew G Knepley include petsc.h90 in your code. 17353813dfbdSMatthew G Knepley 17363813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17373813dfbdSMatthew G Knepley 1738552f7358SJed Brown .keywords: mesh 1739552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1740552f7358SJed Brown @*/ 1741552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1742552f7358SJed Brown { 1743552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1744552f7358SJed Brown PetscInt *join[2]; 1745552f7358SJed Brown PetscInt joinSize, i = 0; 1746552f7358SJed Brown PetscInt dof, off, p, c, m; 1747552f7358SJed Brown PetscErrorCode ierr; 1748552f7358SJed Brown 1749552f7358SJed Brown PetscFunctionBegin; 1750552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1751552f7358SJed Brown PetscValidPointer(points, 2); 1752552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1753552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1754552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1755552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1756552f7358SJed Brown /* Copy in support of first point */ 1757552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1758552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1759552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1760552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1761552f7358SJed Brown } 1762552f7358SJed Brown /* Check each successive support */ 1763552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1764552f7358SJed Brown PetscInt newJoinSize = 0; 1765552f7358SJed Brown 1766552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1767552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1768552f7358SJed Brown for (c = 0; c < dof; ++c) { 1769552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1770552f7358SJed Brown 1771552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1772552f7358SJed Brown if (point == join[i][m]) { 1773552f7358SJed Brown join[1-i][newJoinSize++] = point; 1774552f7358SJed Brown break; 1775552f7358SJed Brown } 1776552f7358SJed Brown } 1777552f7358SJed Brown } 1778552f7358SJed Brown joinSize = newJoinSize; 1779552f7358SJed Brown i = 1-i; 1780552f7358SJed Brown } 1781552f7358SJed Brown *numCoveredPoints = joinSize; 1782552f7358SJed Brown *coveredPoints = join[i]; 1783552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1784552f7358SJed Brown PetscFunctionReturn(0); 1785552f7358SJed Brown } 1786552f7358SJed Brown 1787552f7358SJed Brown #undef __FUNCT__ 1788552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1789552f7358SJed Brown /*@C 1790552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1791552f7358SJed Brown 1792552f7358SJed Brown Not Collective 1793552f7358SJed Brown 1794552f7358SJed Brown Input Parameters: 1795552f7358SJed Brown + dm - The DMPlex object 1796552f7358SJed Brown . numPoints - The number of input points for the join 1797552f7358SJed Brown - points - The input points 1798552f7358SJed Brown 1799552f7358SJed Brown Output Parameters: 1800552f7358SJed Brown + numCoveredPoints - The number of points in the join 1801552f7358SJed Brown - coveredPoints - The points in the join 1802552f7358SJed Brown 18033813dfbdSMatthew G Knepley Fortran Notes: 18043813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18053813dfbdSMatthew G Knepley include petsc.h90 in your code. 18063813dfbdSMatthew G Knepley 18073813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18083813dfbdSMatthew G Knepley 1809552f7358SJed Brown Level: intermediate 1810552f7358SJed Brown 1811552f7358SJed Brown .keywords: mesh 1812552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1813552f7358SJed Brown @*/ 1814552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1815552f7358SJed Brown { 1816552f7358SJed Brown PetscErrorCode ierr; 1817552f7358SJed Brown 1818552f7358SJed Brown PetscFunctionBegin; 1819552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1820d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1821d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1822d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1823552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1824d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1825552f7358SJed Brown PetscFunctionReturn(0); 1826552f7358SJed Brown } 1827552f7358SJed Brown 1828552f7358SJed Brown #undef __FUNCT__ 1829552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1830552f7358SJed Brown /*@C 1831552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1832552f7358SJed Brown 1833552f7358SJed Brown Not Collective 1834552f7358SJed Brown 1835552f7358SJed Brown Input Parameters: 1836552f7358SJed Brown + dm - The DMPlex object 1837552f7358SJed Brown . numPoints - The number of input points for the join 1838552f7358SJed Brown - points - The input points 1839552f7358SJed Brown 1840552f7358SJed Brown Output Parameters: 1841552f7358SJed Brown + numCoveredPoints - The number of points in the join 1842552f7358SJed Brown - coveredPoints - The points in the join 1843552f7358SJed Brown 18443813dfbdSMatthew G Knepley Fortran Notes: 18453813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18463813dfbdSMatthew G Knepley include petsc.h90 in your code. 18473813dfbdSMatthew G Knepley 18483813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18493813dfbdSMatthew G Knepley 1850552f7358SJed Brown Level: intermediate 1851552f7358SJed Brown 1852552f7358SJed Brown .keywords: mesh 1853552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1854552f7358SJed Brown @*/ 1855552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1856552f7358SJed Brown { 1857552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1858552f7358SJed Brown PetscInt *offsets, **closures; 1859552f7358SJed Brown PetscInt *join[2]; 1860552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1861552f7358SJed Brown PetscInt p, d, c, m; 1862552f7358SJed Brown PetscErrorCode ierr; 1863552f7358SJed Brown 1864552f7358SJed Brown PetscFunctionBegin; 1865552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1866552f7358SJed Brown PetscValidPointer(points, 2); 1867552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1868552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1869552f7358SJed Brown 1870552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18711795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1872552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1873e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1874552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1875552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1876552f7358SJed Brown 1877552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1878552f7358SJed Brown PetscInt closureSize; 1879552f7358SJed Brown 1880552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 18810d644c17SKarl Rupp 1882552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1883552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1884552f7358SJed Brown PetscInt pStart, pEnd, i; 1885552f7358SJed Brown 1886552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1887552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1888552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1889552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1890552f7358SJed Brown break; 1891552f7358SJed Brown } 1892552f7358SJed Brown } 1893552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1894552f7358SJed Brown } 189582f516ccSBarry 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); 1896552f7358SJed Brown } 1897552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1898552f7358SJed Brown PetscInt dof; 1899552f7358SJed Brown 1900552f7358SJed Brown /* Copy in support of first point */ 1901552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1902552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1903552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1904552f7358SJed Brown } 1905552f7358SJed Brown /* Check each successive cone */ 1906552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1907552f7358SJed Brown PetscInt newJoinSize = 0; 1908552f7358SJed Brown 1909552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1910552f7358SJed Brown for (c = 0; c < dof; ++c) { 1911552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1912552f7358SJed Brown 1913552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1914552f7358SJed Brown if (point == join[i][m]) { 1915552f7358SJed Brown join[1-i][newJoinSize++] = point; 1916552f7358SJed Brown break; 1917552f7358SJed Brown } 1918552f7358SJed Brown } 1919552f7358SJed Brown } 1920552f7358SJed Brown joinSize = newJoinSize; 1921552f7358SJed Brown i = 1-i; 1922552f7358SJed Brown } 1923552f7358SJed Brown if (joinSize) break; 1924552f7358SJed Brown } 1925552f7358SJed Brown *numCoveredPoints = joinSize; 1926552f7358SJed Brown *coveredPoints = join[i]; 1927552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19280298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1929552f7358SJed Brown } 1930552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1931552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1932552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1933552f7358SJed Brown PetscFunctionReturn(0); 1934552f7358SJed Brown } 1935552f7358SJed Brown 1936552f7358SJed Brown #undef __FUNCT__ 1937552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1938552f7358SJed Brown /*@C 1939552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1940552f7358SJed Brown 1941552f7358SJed Brown Not Collective 1942552f7358SJed Brown 1943552f7358SJed Brown Input Parameters: 1944552f7358SJed Brown + dm - The DMPlex object 1945552f7358SJed Brown . numPoints - The number of input points for the meet 1946552f7358SJed Brown - points - The input points 1947552f7358SJed Brown 1948552f7358SJed Brown Output Parameters: 1949552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1950552f7358SJed Brown - coveredPoints - The points in the meet 1951552f7358SJed Brown 1952552f7358SJed Brown Level: intermediate 1953552f7358SJed Brown 1954552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1955552f7358SJed Brown 19563813dfbdSMatthew G Knepley Fortran Notes: 19573813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19583813dfbdSMatthew G Knepley include petsc.h90 in your code. 19593813dfbdSMatthew G Knepley 19603813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19613813dfbdSMatthew G Knepley 1962552f7358SJed Brown .keywords: mesh 1963552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1964552f7358SJed Brown @*/ 1965552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1966552f7358SJed Brown { 1967552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1968552f7358SJed Brown PetscInt *meet[2]; 1969552f7358SJed Brown PetscInt meetSize, i = 0; 1970552f7358SJed Brown PetscInt dof, off, p, c, m; 1971552f7358SJed Brown PetscErrorCode ierr; 1972552f7358SJed Brown 1973552f7358SJed Brown PetscFunctionBegin; 1974552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1975552f7358SJed Brown PetscValidPointer(points, 2); 1976552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1977552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1978552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1979552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1980552f7358SJed Brown /* Copy in cone of first point */ 1981552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1982552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1983552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1984552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1985552f7358SJed Brown } 1986552f7358SJed Brown /* Check each successive cone */ 1987552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1988552f7358SJed Brown PetscInt newMeetSize = 0; 1989552f7358SJed Brown 1990552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1991552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1992552f7358SJed Brown for (c = 0; c < dof; ++c) { 1993552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1994552f7358SJed Brown 1995552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1996552f7358SJed Brown if (point == meet[i][m]) { 1997552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1998552f7358SJed Brown break; 1999552f7358SJed Brown } 2000552f7358SJed Brown } 2001552f7358SJed Brown } 2002552f7358SJed Brown meetSize = newMeetSize; 2003552f7358SJed Brown i = 1-i; 2004552f7358SJed Brown } 2005552f7358SJed Brown *numCoveringPoints = meetSize; 2006552f7358SJed Brown *coveringPoints = meet[i]; 2007552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2008552f7358SJed Brown PetscFunctionReturn(0); 2009552f7358SJed Brown } 2010552f7358SJed Brown 2011552f7358SJed Brown #undef __FUNCT__ 2012552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2013552f7358SJed Brown /*@C 2014552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2015552f7358SJed Brown 2016552f7358SJed Brown Not Collective 2017552f7358SJed Brown 2018552f7358SJed Brown Input Parameters: 2019552f7358SJed Brown + dm - The DMPlex object 2020552f7358SJed Brown . numPoints - The number of input points for the meet 2021552f7358SJed Brown - points - The input points 2022552f7358SJed Brown 2023552f7358SJed Brown Output Parameters: 2024552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2025552f7358SJed Brown - coveredPoints - The points in the meet 2026552f7358SJed Brown 2027552f7358SJed Brown Level: intermediate 2028552f7358SJed Brown 20293813dfbdSMatthew G Knepley Fortran Notes: 20303813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20313813dfbdSMatthew G Knepley include petsc.h90 in your code. 20323813dfbdSMatthew G Knepley 20333813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20343813dfbdSMatthew G Knepley 2035552f7358SJed Brown .keywords: mesh 2036552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2037552f7358SJed Brown @*/ 2038552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2039552f7358SJed Brown { 2040552f7358SJed Brown PetscErrorCode ierr; 2041552f7358SJed Brown 2042552f7358SJed Brown PetscFunctionBegin; 2043552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2044d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2045d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2046d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2047552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2048d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2049552f7358SJed Brown PetscFunctionReturn(0); 2050552f7358SJed Brown } 2051552f7358SJed Brown 2052552f7358SJed Brown #undef __FUNCT__ 2053552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2054552f7358SJed Brown /*@C 2055552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2056552f7358SJed Brown 2057552f7358SJed Brown Not Collective 2058552f7358SJed Brown 2059552f7358SJed Brown Input Parameters: 2060552f7358SJed Brown + dm - The DMPlex object 2061552f7358SJed Brown . numPoints - The number of input points for the meet 2062552f7358SJed Brown - points - The input points 2063552f7358SJed Brown 2064552f7358SJed Brown Output Parameters: 2065552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2066552f7358SJed Brown - coveredPoints - The points in the meet 2067552f7358SJed Brown 2068552f7358SJed Brown Level: intermediate 2069552f7358SJed Brown 20703813dfbdSMatthew G Knepley Fortran Notes: 20713813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20723813dfbdSMatthew G Knepley include petsc.h90 in your code. 20733813dfbdSMatthew G Knepley 20743813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20753813dfbdSMatthew G Knepley 2076552f7358SJed Brown .keywords: mesh 2077552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2078552f7358SJed Brown @*/ 2079552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2080552f7358SJed Brown { 2081552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2082552f7358SJed Brown PetscInt *offsets, **closures; 2083552f7358SJed Brown PetscInt *meet[2]; 2084552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2085552f7358SJed Brown PetscInt p, h, c, m; 2086552f7358SJed Brown PetscErrorCode ierr; 2087552f7358SJed Brown 2088552f7358SJed Brown PetscFunctionBegin; 2089552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2090552f7358SJed Brown PetscValidPointer(points, 2); 2091552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2092552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2093552f7358SJed Brown 2094552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2095785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2096552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2097e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2098552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2099552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2100552f7358SJed Brown 2101552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2102552f7358SJed Brown PetscInt closureSize; 2103552f7358SJed Brown 2104552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21050d644c17SKarl Rupp 2106552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2107552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2108552f7358SJed Brown PetscInt pStart, pEnd, i; 2109552f7358SJed Brown 2110552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2111552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2112552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2113552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2114552f7358SJed Brown break; 2115552f7358SJed Brown } 2116552f7358SJed Brown } 2117552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2118552f7358SJed Brown } 211982f516ccSBarry 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); 2120552f7358SJed Brown } 2121552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2122552f7358SJed Brown PetscInt dof; 2123552f7358SJed Brown 2124552f7358SJed Brown /* Copy in cone of first point */ 2125552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2126552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2127552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2128552f7358SJed Brown } 2129552f7358SJed Brown /* Check each successive cone */ 2130552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2131552f7358SJed Brown PetscInt newMeetSize = 0; 2132552f7358SJed Brown 2133552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2134552f7358SJed Brown for (c = 0; c < dof; ++c) { 2135552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2136552f7358SJed Brown 2137552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2138552f7358SJed Brown if (point == meet[i][m]) { 2139552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2140552f7358SJed Brown break; 2141552f7358SJed Brown } 2142552f7358SJed Brown } 2143552f7358SJed Brown } 2144552f7358SJed Brown meetSize = newMeetSize; 2145552f7358SJed Brown i = 1-i; 2146552f7358SJed Brown } 2147552f7358SJed Brown if (meetSize) break; 2148552f7358SJed Brown } 2149552f7358SJed Brown *numCoveredPoints = meetSize; 2150552f7358SJed Brown *coveredPoints = meet[i]; 2151552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21520298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2153552f7358SJed Brown } 2154552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2155552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2156552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2157552f7358SJed Brown PetscFunctionReturn(0); 2158552f7358SJed Brown } 2159552f7358SJed Brown 2160552f7358SJed Brown #undef __FUNCT__ 21614e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21624e3744c5SMatthew G. Knepley /*@C 21634e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21644e3744c5SMatthew G. Knepley 21654e3744c5SMatthew G. Knepley Not Collective 21664e3744c5SMatthew G. Knepley 21674e3744c5SMatthew G. Knepley Input Parameters: 21684e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21694e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21704e3744c5SMatthew G. Knepley 21714e3744c5SMatthew G. Knepley Output Parameters: 21724e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21734e3744c5SMatthew G. Knepley 21744e3744c5SMatthew G. Knepley Level: intermediate 21754e3744c5SMatthew G. Knepley 21764e3744c5SMatthew G. Knepley Notes: 21774e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21784e3744c5SMatthew G. Knepley 21794e3744c5SMatthew G. Knepley .keywords: mesh 21804e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 21814e3744c5SMatthew G. Knepley @*/ 21824e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 21834e3744c5SMatthew G. Knepley { 21844e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 21854e3744c5SMatthew G. Knepley PetscErrorCode ierr; 21864e3744c5SMatthew G. Knepley 21874e3744c5SMatthew G. Knepley PetscFunctionBegin; 21884e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 21894e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 21904e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 21914e3744c5SMatthew G. Knepley 21924e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 21934e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21944e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 21954e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 21964e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 21974e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 21984e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 21994e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22004e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22014e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22024e3744c5SMatthew G. Knepley 22034e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22044e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22054e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22064e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22074e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22084e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22094e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22104e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22114e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22124e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22134e3744c5SMatthew G. Knepley } 22144e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22154e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22164e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22174e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22184e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22194e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22204e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22214e3744c5SMatthew G. Knepley } 22224e3744c5SMatthew G. Knepley } 22234e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22244e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22254e3744c5SMatthew G. Knepley } 22264e3744c5SMatthew G. Knepley 22274e3744c5SMatthew G. Knepley #undef __FUNCT__ 222818ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 222918ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2230a6dfd86eSKarl Rupp { 223182f516ccSBarry Smith MPI_Comm comm; 2232552f7358SJed Brown PetscErrorCode ierr; 2233552f7358SJed Brown 2234552f7358SJed Brown PetscFunctionBegin; 223582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2236552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2237552f7358SJed Brown switch (cellDim) { 2238552f7358SJed Brown case 0: 2239552f7358SJed Brown *numFaceVertices = 0; 2240552f7358SJed Brown break; 2241552f7358SJed Brown case 1: 2242552f7358SJed Brown *numFaceVertices = 1; 2243552f7358SJed Brown break; 2244552f7358SJed Brown case 2: 2245552f7358SJed Brown switch (numCorners) { 224619436ca2SJed Brown case 3: /* triangle */ 224719436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2248552f7358SJed Brown break; 224919436ca2SJed Brown case 4: /* quadrilateral */ 225019436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2251552f7358SJed Brown break; 225219436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 225319436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2254552f7358SJed Brown break; 225519436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 225619436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2257552f7358SJed Brown break; 2258552f7358SJed Brown default: 2259552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2260552f7358SJed Brown } 2261552f7358SJed Brown break; 2262552f7358SJed Brown case 3: 2263552f7358SJed Brown switch (numCorners) { 226419436ca2SJed Brown case 4: /* tetradehdron */ 226519436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2266552f7358SJed Brown break; 226719436ca2SJed Brown case 6: /* tet cohesive cells */ 226819436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2269552f7358SJed Brown break; 227019436ca2SJed Brown case 8: /* hexahedron */ 227119436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2272552f7358SJed Brown break; 227319436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 227419436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2275552f7358SJed Brown break; 227619436ca2SJed Brown case 10: /* quadratic tetrahedron */ 227719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2278552f7358SJed Brown break; 227919436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 228019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2281552f7358SJed Brown break; 228219436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 228319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2284552f7358SJed Brown break; 228519436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 228619436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2287552f7358SJed Brown break; 2288552f7358SJed Brown default: 2289552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2290552f7358SJed Brown } 2291552f7358SJed Brown break; 2292552f7358SJed Brown default: 2293552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2294552f7358SJed Brown } 2295552f7358SJed Brown PetscFunctionReturn(0); 2296552f7358SJed Brown } 2297552f7358SJed Brown 2298552f7358SJed Brown #undef __FUNCT__ 2299d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2300d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2301d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2302d27a0f52SMatthew G. Knepley { 2303a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2304a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2305a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2306d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2307d27a0f52SMatthew G. Knepley 2308d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2309d27a0f52SMatthew G. Knepley /* Truth Table 2310d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2311d27a0f52SMatthew G. Knepley F 0 flips no F F F 2312d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2313d27a0f52SMatthew G. Knepley F 2 flips no T F T 2314d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2315d27a0f52SMatthew G. Knepley T 1 flip no 2316d27a0f52SMatthew G. Knepley T 2 flips yes 2317d27a0f52SMatthew G. Knepley */ 2318c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2319d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2320a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2321d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2322a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2323a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2324a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2325a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2326a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2327a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2328785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2329a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2330a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2331defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2332a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2333a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2334a1b4d4a2SMatthew G. Knepley 2335a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2336a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2337a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2338a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2339a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2340a1b4d4a2SMatthew G. Knepley } 2341a1b4d4a2SMatthew G. Knepley } 2342a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2343a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2344d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2345a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2346d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2347d27a0f52SMatthew G. Knepley 2348a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2349a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2350a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2351d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2352d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2353a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 235486cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2355a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 235686cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2357d27a0f52SMatthew G. Knepley 2358d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2359d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2360d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2361d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2362d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2363d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2364a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2365a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2366a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2367a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2368a1b4d4a2SMatthew G. Knepley } 2369a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2370a1b4d4a2SMatthew 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); 2371a1b4d4a2SMatthew G. Knepley } 2372a1b4d4a2SMatthew 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]); 2373a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2374a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2375a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2376a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2377a1b4d4a2SMatthew G. Knepley } 2378a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2379a1b4d4a2SMatthew 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); 2380a1b4d4a2SMatthew G. Knepley } 2381a1b4d4a2SMatthew 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]); 2382d27a0f52SMatthew G. Knepley 2383d27a0f52SMatthew G. Knepley if (dim == 1) { 2384d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2385d27a0f52SMatthew G. Knepley } else { 2386d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2387d27a0f52SMatthew G. Knepley } 2388d27a0f52SMatthew G. Knepley 2389d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2390d27a0f52SMatthew 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]); 2391d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2392a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2393d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2394a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2395d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 239686cff514SMatthew 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"); 2397a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2398a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2399d27a0f52SMatthew G. Knepley } 2400fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2401fedde076SMatthew G. Knepley { 2402fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2403fedde076SMatthew G. Knepley PetscSF sf; 2404fedde076SMatthew G. Knepley const PetscInt *lpoints; 2405fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 240613048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2407fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2408a1b4d4a2SMatthew G. Knepley 2409fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2410fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2411fedde076SMatthew G. Knepley if (numLeaves >= 0) { 241262ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 241362ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 241462ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 241513048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 241662ad4a6aSMatthew G. Knepley 2417fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2418fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2419fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2420fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2421fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2422fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2423fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2424fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2425fedde076SMatthew G. Knepley PetscInt supportSize; 2426fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2427fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2428fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2429fedde076SMatthew G. Knepley } 2430fedde076SMatthew G. Knepley } 2431fedde076SMatthew G. Knepley } 243213048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2433fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2434fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2435fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2436fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2437fedde076SMatthew G. Knepley 2438fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 243962ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2440fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2441fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24425b7033fcSMatthew G. Knepley if (dim == 1) { 24435b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24445b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24455b7033fcSMatthew G. Knepley } else { 2446fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2447fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2448fedde076SMatthew G. Knepley } 24495b7033fcSMatthew G. Knepley } 2450fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2451fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2452fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2453fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2454fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2455fedde076SMatthew G. Knepley 245613048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 245713048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 245813048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2459fedde076SMatthew G. Knepley } 246013048561SMatthew G. Knepley /* Collect the graph on 0 */ 246113048561SMatthew G. Knepley { 246213048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2463e8f90184SMatthew G. Knepley Mat G; 246413048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 246513048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 246613048561SMatthew G. Knepley PetscInt *adj = NULL; 246713048561SMatthew G. Knepley PetscBool *val = NULL; 246813048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 246913048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 247013048561SMatthew G. Knepley PetscInt debug = 0; 247113048561SMatthew G. Knepley 247213048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 247313048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 247413048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 247513048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 247613048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 247713048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 247813048561SMatthew G. Knepley } 247913048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 248013048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 248113048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 248213048561SMatthew G. Knepley if (debug) { 248313048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 248413048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 248513048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 248613048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 248713048561SMatthew G. Knepley } 248813048561SMatthew G. Knepley } 248913048561SMatthew G. Knepley } 2490e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2491e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2492e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2493e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2494e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2495e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 24969a4fe19dSMatthew G. Knepley const PetscInt r = p; 2497e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 24987406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2499e8f90184SMatthew G. Knepley 25007406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 25017406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2502e8f90184SMatthew G. Knepley } 2503e8f90184SMatthew G. Knepley } 2504e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2505e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2506e8f90184SMatthew G. Knepley 250713048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 250813048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 250913048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 251013048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 251113048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 251213048561SMatthew G. Knepley pTop = pBottom = 0; 251313048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251413048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 251513048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 251613048561SMatthew G. Knepley procFIFO[pBottom++] = p; 251713048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 251813048561SMatthew G. Knepley /* Consider each proc in FIFO */ 251913048561SMatthew G. Knepley while (pTop < pBottom) { 2520e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2521e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2522e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 252313048561SMatthew G. Knepley 252413048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252513048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2526e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 252713048561SMatthew G. Knepley /* Loop over neighboring procs */ 2528e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2529e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25307406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 253113048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 253213048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 253313048561SMatthew G. Knepley 253413048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253513048561SMatthew 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); 253613048561SMatthew G. Knepley if (!flippedB) { 253713048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 253813048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 253913048561SMatthew 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"); 254013048561SMatthew G. Knepley if (!seen) { 254113048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 254213048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 254313048561SMatthew G. Knepley } 254413048561SMatthew G. Knepley } 254513048561SMatthew G. Knepley } 254613048561SMatthew G. Knepley } 254713048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2548e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 254913048561SMatthew G. Knepley 255013048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 255113048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 255213048561SMatthew G. Knepley { 255313048561SMatthew G. Knepley PetscBool *flips; 255413048561SMatthew G. Knepley 255513048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255613048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255713048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 255813048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 255913048561SMatthew G. Knepley } 256013048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 256113048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 256213048561SMatthew G. Knepley } 256313048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256413048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256513048561SMatthew G. Knepley } 256613048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2567fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 256813048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2569fedde076SMatthew G. Knepley } 2570fedde076SMatthew G. Knepley } 2571fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2572d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2573d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2574d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2575a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2576f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2577f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2578d27a0f52SMatthew G. Knepley 2579a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2580a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2581a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2582a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2583a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2584a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2585a1b4d4a2SMatthew G. Knepley 2586a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2587a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2588a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2589d27a0f52SMatthew G. Knepley } 2590a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2591a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2592f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2593f4e909fcSMatthew G. Knepley faceSize = coneSize; 2594f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2595f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2596f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2597f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2598f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2599f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2600f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2601f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2602f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2603f4e909fcSMatthew G. Knepley } 2604f4e909fcSMatthew G. Knepley } 2605d27a0f52SMatthew G. Knepley } 2606d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2607d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2608d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2609a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2610a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2611a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2612d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2613d27a0f52SMatthew G. Knepley } 2614d27a0f52SMatthew G. Knepley 2615d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2616895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2617895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2618895b8c46SMatthew G. Knepley { 2619895b8c46SMatthew G. Knepley int tmpc; 2620895b8c46SMatthew G. Knepley 2621895b8c46SMatthew G. Knepley PetscFunctionBegin; 2622895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2623895b8c46SMatthew G. Knepley switch (numCorners) { 2624895b8c46SMatthew G. Knepley case 4: 2625895b8c46SMatthew G. Knepley tmpc = cone[0]; 2626895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2627895b8c46SMatthew G. Knepley cone[1] = tmpc; 2628895b8c46SMatthew G. Knepley break; 2629895b8c46SMatthew G. Knepley case 8: 2630895b8c46SMatthew G. Knepley tmpc = cone[1]; 2631895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2632895b8c46SMatthew G. Knepley cone[3] = tmpc; 2633895b8c46SMatthew G. Knepley break; 2634895b8c46SMatthew G. Knepley default: break; 2635895b8c46SMatthew G. Knepley } 2636895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2637895b8c46SMatthew G. Knepley } 2638895b8c46SMatthew G. Knepley 2639895b8c46SMatthew G. Knepley #undef __FUNCT__ 26409db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26419db3b87dSMatthew G. Knepley /*@C 26429db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26439db3b87dSMatthew G. Knepley 26449db3b87dSMatthew G. Knepley Input Parameters: 26459db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26469db3b87dSMatthew G. Knepley - cone - The incoming cone 26479db3b87dSMatthew G. Knepley 26489db3b87dSMatthew G. Knepley Output Parameter: 26499db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26509db3b87dSMatthew G. Knepley 26519db3b87dSMatthew G. Knepley Level: developer 26529db3b87dSMatthew G. Knepley 26539db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26549db3b87dSMatthew G. Knepley @*/ 26559db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26562e1b13c2SMatthew G. Knepley { 26579db3b87dSMatthew G. Knepley int tmpc; 26582e1b13c2SMatthew G. Knepley 26592e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26609db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26619db3b87dSMatthew G. Knepley switch (numCorners) { 26629db3b87dSMatthew G. Knepley case 4: 26631885f254SMatthew G. Knepley tmpc = cone[0]; 26641885f254SMatthew G. Knepley cone[0] = cone[1]; 26651885f254SMatthew G. Knepley cone[1] = tmpc; 26669db3b87dSMatthew G. Knepley break; 26679db3b87dSMatthew G. Knepley case 8: 26689db3b87dSMatthew G. Knepley tmpc = cone[1]; 26699db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26709db3b87dSMatthew G. Knepley cone[3] = tmpc; 26719db3b87dSMatthew G. Knepley break; 26729db3b87dSMatthew G. Knepley default: break; 26739db3b87dSMatthew G. Knepley } 26749db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26759db3b87dSMatthew G. Knepley } 26769db3b87dSMatthew G. Knepley 26779db3b87dSMatthew G. Knepley #undef __FUNCT__ 26789db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26799db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26809db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26819db3b87dSMatthew G. Knepley { 26829db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26839db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26849db3b87dSMatthew G. Knepley 26859db3b87dSMatthew G. Knepley PetscFunctionBegin; 26869db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26879db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26882e1b13c2SMatthew G. Knepley } 26892e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26902e1b13c2SMatthew G. Knepley } 26912e1b13c2SMatthew G. Knepley 2692519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2693552f7358SJed Brown #include <triangle.h> 2694552f7358SJed Brown 2695552f7358SJed Brown #undef __FUNCT__ 2696552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 26970adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 26980adebc6cSBarry Smith { 2699552f7358SJed Brown PetscFunctionBegin; 2700552f7358SJed Brown inputCtx->numberofpoints = 0; 2701552f7358SJed Brown inputCtx->numberofpointattributes = 0; 27020298fd71SBarry Smith inputCtx->pointlist = NULL; 27030298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27040298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2705552f7358SJed Brown inputCtx->numberofsegments = 0; 27060298fd71SBarry Smith inputCtx->segmentlist = NULL; 27070298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2708552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27090298fd71SBarry Smith inputCtx->trianglelist = NULL; 2710552f7358SJed Brown inputCtx->numberofholes = 0; 27110298fd71SBarry Smith inputCtx->holelist = NULL; 2712552f7358SJed Brown inputCtx->numberofregions = 0; 27130298fd71SBarry Smith inputCtx->regionlist = NULL; 2714552f7358SJed Brown PetscFunctionReturn(0); 2715552f7358SJed Brown } 2716552f7358SJed Brown 2717552f7358SJed Brown #undef __FUNCT__ 2718552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27190adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27200adebc6cSBarry Smith { 2721552f7358SJed Brown PetscFunctionBegin; 2722552f7358SJed Brown outputCtx->numberofpoints = 0; 27230298fd71SBarry Smith outputCtx->pointlist = NULL; 27240298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27250298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2726552f7358SJed Brown outputCtx->numberoftriangles = 0; 27270298fd71SBarry Smith outputCtx->trianglelist = NULL; 27280298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27290298fd71SBarry Smith outputCtx->neighborlist = NULL; 27300298fd71SBarry Smith outputCtx->segmentlist = NULL; 27310298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2732552f7358SJed Brown outputCtx->numberofedges = 0; 27330298fd71SBarry Smith outputCtx->edgelist = NULL; 27340298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2735552f7358SJed Brown PetscFunctionReturn(0); 2736552f7358SJed Brown } 2737552f7358SJed Brown 2738552f7358SJed Brown #undef __FUNCT__ 2739552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27400adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27410adebc6cSBarry Smith { 2742552f7358SJed Brown PetscFunctionBegin; 274323b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2744552f7358SJed Brown free(outputCtx->pointmarkerlist); 274523b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 274623b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2747552f7358SJed Brown free(outputCtx->edgelist); 2748552f7358SJed Brown free(outputCtx->edgemarkerlist); 2749552f7358SJed Brown free(outputCtx->trianglelist); 2750552f7358SJed Brown free(outputCtx->neighborlist); 2751552f7358SJed Brown PetscFunctionReturn(0); 2752552f7358SJed Brown } 2753552f7358SJed Brown 2754552f7358SJed Brown #undef __FUNCT__ 2755552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2756552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2757552f7358SJed Brown { 275882f516ccSBarry Smith MPI_Comm comm; 2759552f7358SJed Brown PetscInt dim = 2; 2760552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2761552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2762552f7358SJed Brown struct triangulateio in; 2763552f7358SJed Brown struct triangulateio out; 2764552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2765552f7358SJed Brown PetscMPIInt rank; 2766552f7358SJed Brown PetscErrorCode ierr; 2767552f7358SJed Brown 2768552f7358SJed Brown PetscFunctionBegin; 276982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2770552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2771552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2772552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2773552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27740d644c17SKarl Rupp 2775552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2776552f7358SJed Brown if (in.numberofpoints > 0) { 2777552f7358SJed Brown PetscSection coordSection; 2778552f7358SJed Brown Vec coordinates; 2779552f7358SJed Brown PetscScalar *array; 2780552f7358SJed Brown 2781785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2782785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2783552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 278469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2785552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2786552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2787552f7358SJed Brown const PetscInt idx = v - vStart; 2788552f7358SJed Brown PetscInt off, d; 2789552f7358SJed Brown 2790552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2791552f7358SJed Brown for (d = 0; d < dim; ++d) { 2792552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2793552f7358SJed Brown } 2794552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2795552f7358SJed Brown } 2796552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2797552f7358SJed Brown } 2798552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2799552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2800552f7358SJed Brown if (in.numberofsegments > 0) { 2801785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2802785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2803552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2804552f7358SJed Brown const PetscInt idx = e - eStart; 2805552f7358SJed Brown const PetscInt *cone; 2806552f7358SJed Brown 2807552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28080d644c17SKarl Rupp 2809552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2810552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28110d644c17SKarl Rupp 2812552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2813552f7358SJed Brown } 2814552f7358SJed Brown } 2815552f7358SJed Brown #if 0 /* Do not currently support holes */ 2816552f7358SJed Brown PetscReal *holeCoords; 2817552f7358SJed Brown PetscInt h, d; 2818552f7358SJed Brown 2819552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2820552f7358SJed Brown if (in.numberofholes > 0) { 2821785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2822552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2823552f7358SJed Brown for (d = 0; d < dim; ++d) { 2824552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2825552f7358SJed Brown } 2826552f7358SJed Brown } 2827552f7358SJed Brown } 2828552f7358SJed Brown #endif 2829552f7358SJed Brown if (!rank) { 2830552f7358SJed Brown char args[32]; 2831552f7358SJed Brown 2832552f7358SJed Brown /* Take away 'Q' for verbose output */ 2833552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2834552f7358SJed Brown if (createConvexHull) { 2835552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2836552f7358SJed Brown } 2837552f7358SJed Brown if (constrained) { 2838552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2839552f7358SJed Brown } 28400298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2841552f7358SJed Brown } 2842552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2843552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2844552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2845552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2846552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2847552f7358SJed Brown 2848552f7358SJed Brown { 2849552f7358SJed Brown const PetscInt numCorners = 3; 2850552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2851552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2852552f7358SJed Brown const int *cells = out.trianglelist; 2853552f7358SJed Brown const double *meshCoords = out.pointlist; 2854552f7358SJed Brown 28550fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2856552f7358SJed Brown /* Set labels */ 2857552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2858552f7358SJed Brown if (out.pointmarkerlist[v]) { 2859552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2860552f7358SJed Brown } 2861552f7358SJed Brown } 2862552f7358SJed Brown if (interpolate) { 2863552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2864552f7358SJed Brown if (out.edgemarkerlist[e]) { 2865552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2866552f7358SJed Brown const PetscInt *edges; 2867552f7358SJed Brown PetscInt numEdges; 2868552f7358SJed Brown 2869552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2870552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2871552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2872552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2873552f7358SJed Brown } 2874552f7358SJed Brown } 2875552f7358SJed Brown } 2876552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2877552f7358SJed Brown } 2878552f7358SJed Brown #if 0 /* Do not currently support holes */ 2879552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2880552f7358SJed Brown #endif 2881552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2882552f7358SJed Brown PetscFunctionReturn(0); 2883552f7358SJed Brown } 2884552f7358SJed Brown 2885552f7358SJed Brown #undef __FUNCT__ 2886552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2887552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2888552f7358SJed Brown { 288982f516ccSBarry Smith MPI_Comm comm; 2890552f7358SJed Brown PetscInt dim = 2; 2891552f7358SJed Brown struct triangulateio in; 2892552f7358SJed Brown struct triangulateio out; 2893552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2894552f7358SJed Brown PetscMPIInt rank; 2895552f7358SJed Brown PetscErrorCode ierr; 2896552f7358SJed Brown 2897552f7358SJed Brown PetscFunctionBegin; 289882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2899552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2900552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2901552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2902552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2903552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2904552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29050d644c17SKarl Rupp 2906552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2907552f7358SJed Brown if (in.numberofpoints > 0) { 2908552f7358SJed Brown PetscSection coordSection; 2909552f7358SJed Brown Vec coordinates; 2910552f7358SJed Brown PetscScalar *array; 2911552f7358SJed Brown 2912785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2913785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2914552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 291569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2916552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2917552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2918552f7358SJed Brown const PetscInt idx = v - vStart; 2919552f7358SJed Brown PetscInt off, d; 2920552f7358SJed Brown 2921552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2922552f7358SJed Brown for (d = 0; d < dim; ++d) { 2923552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2924552f7358SJed Brown } 2925552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2926552f7358SJed Brown } 2927552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2928552f7358SJed Brown } 2929552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29300d644c17SKarl Rupp 2931552f7358SJed Brown in.numberofcorners = 3; 2932552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29330d644c17SKarl Rupp 2934552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2935552f7358SJed Brown if (in.numberoftriangles > 0) { 2936785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2937552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2938552f7358SJed Brown const PetscInt idx = c - cStart; 29390298fd71SBarry Smith PetscInt *closure = NULL; 2940552f7358SJed Brown PetscInt closureSize; 2941552f7358SJed Brown 2942552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2943552f7358SJed Brown if ((closureSize != 4) && (closureSize != 7)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a triangle, %D vertices in closure", closureSize); 2944552f7358SJed Brown for (v = 0; v < 3; ++v) { 2945552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2946552f7358SJed Brown } 2947552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2948552f7358SJed Brown } 2949552f7358SJed Brown } 2950552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2951552f7358SJed Brown #if 0 /* Do not currently support holes */ 2952552f7358SJed Brown PetscReal *holeCoords; 2953552f7358SJed Brown PetscInt h, d; 2954552f7358SJed Brown 2955552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2956552f7358SJed Brown if (in.numberofholes > 0) { 2957785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2958552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2959552f7358SJed Brown for (d = 0; d < dim; ++d) { 2960552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2961552f7358SJed Brown } 2962552f7358SJed Brown } 2963552f7358SJed Brown } 2964552f7358SJed Brown #endif 2965552f7358SJed Brown if (!rank) { 2966552f7358SJed Brown char args[32]; 2967552f7358SJed Brown 2968552f7358SJed Brown /* Take away 'Q' for verbose output */ 2969552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29700298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2971552f7358SJed Brown } 2972552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2973552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2974552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2975552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2976552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2977552f7358SJed Brown 2978552f7358SJed Brown { 2979552f7358SJed Brown const PetscInt numCorners = 3; 2980552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2981552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2982552f7358SJed Brown const int *cells = out.trianglelist; 2983552f7358SJed Brown const double *meshCoords = out.pointlist; 2984552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2985552f7358SJed Brown 29860fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2987552f7358SJed Brown /* Set labels */ 2988552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2989552f7358SJed Brown if (out.pointmarkerlist[v]) { 2990552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2991552f7358SJed Brown } 2992552f7358SJed Brown } 2993552f7358SJed Brown if (interpolate) { 2994552f7358SJed Brown PetscInt e; 2995552f7358SJed Brown 2996552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2997552f7358SJed Brown if (out.edgemarkerlist[e]) { 2998552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2999552f7358SJed Brown const PetscInt *edges; 3000552f7358SJed Brown PetscInt numEdges; 3001552f7358SJed Brown 3002552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3003552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3004552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3005552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3006552f7358SJed Brown } 3007552f7358SJed Brown } 3008552f7358SJed Brown } 3009552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3010552f7358SJed Brown } 3011552f7358SJed Brown #if 0 /* Do not currently support holes */ 3012552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3013552f7358SJed Brown #endif 3014552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3015552f7358SJed Brown PetscFunctionReturn(0); 3016552f7358SJed Brown } 3017552f7358SJed Brown #endif 3018552f7358SJed Brown 3019519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3020552f7358SJed Brown #include <tetgen.h> 3021552f7358SJed Brown #undef __FUNCT__ 3022552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3023552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3024552f7358SJed Brown { 302582f516ccSBarry Smith MPI_Comm comm; 3026552f7358SJed Brown const PetscInt dim = 3; 3027552f7358SJed Brown ::tetgenio in; 3028552f7358SJed Brown ::tetgenio out; 3029552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3030552f7358SJed Brown PetscMPIInt rank; 3031552f7358SJed Brown PetscErrorCode ierr; 3032552f7358SJed Brown 3033552f7358SJed Brown PetscFunctionBegin; 303482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3035552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3036552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3037552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3038552f7358SJed Brown if (in.numberofpoints > 0) { 3039552f7358SJed Brown PetscSection coordSection; 3040552f7358SJed Brown Vec coordinates; 3041552f7358SJed Brown PetscScalar *array; 3042552f7358SJed Brown 3043552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3044552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30450d644c17SKarl Rupp 3046552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 304769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3048552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3049552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3050552f7358SJed Brown const PetscInt idx = v - vStart; 3051552f7358SJed Brown PetscInt off, d; 3052552f7358SJed Brown 3053552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3054a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3055552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3056552f7358SJed Brown } 3057552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3058552f7358SJed Brown } 3059552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30600d644c17SKarl Rupp 3061552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3062552f7358SJed Brown if (in.numberoffacets > 0) { 3063552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3064552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3065552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3066552f7358SJed Brown const PetscInt idx = f - fStart; 30670298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3068552f7358SJed Brown 3069552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3070552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3071552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3072552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3073552f7358SJed Brown 3074552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3075552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3076552f7358SJed Brown const PetscInt point = points[p]; 30770d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3078552f7358SJed Brown } 3079552f7358SJed Brown 3080552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3081552f7358SJed Brown poly->numberofvertices = numVertices; 3082552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3083552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3084552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3085552f7358SJed Brown poly->vertexlist[v] = vIdx; 3086552f7358SJed Brown } 3087552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3088552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3089552f7358SJed Brown } 3090552f7358SJed Brown } 3091552f7358SJed Brown if (!rank) { 3092552f7358SJed Brown char args[32]; 3093552f7358SJed Brown 3094552f7358SJed Brown /* Take away 'Q' for verbose output */ 3095552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3096552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3097552f7358SJed Brown } 3098552f7358SJed Brown { 3099552f7358SJed Brown const PetscInt numCorners = 4; 3100552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3101552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3102552f7358SJed Brown const double *meshCoords = out.pointlist; 31031d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3104552f7358SJed Brown 31059db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31060fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3107552f7358SJed Brown /* Set labels */ 3108552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3109552f7358SJed Brown if (out.pointmarkerlist[v]) { 3110552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3111552f7358SJed Brown } 3112552f7358SJed Brown } 3113552f7358SJed Brown if (interpolate) { 3114552f7358SJed Brown PetscInt e; 3115552f7358SJed Brown 3116552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3117552f7358SJed Brown if (out.edgemarkerlist[e]) { 3118552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3119552f7358SJed Brown const PetscInt *edges; 3120552f7358SJed Brown PetscInt numEdges; 3121552f7358SJed Brown 3122552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3123552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3124552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3125552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3126552f7358SJed Brown } 3127552f7358SJed Brown } 3128552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3129552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3130552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3131552f7358SJed Brown const PetscInt *faces; 3132552f7358SJed Brown PetscInt numFaces; 3133552f7358SJed Brown 3134552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3135552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3136552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3137552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3138552f7358SJed Brown } 3139552f7358SJed Brown } 3140552f7358SJed Brown } 3141552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3142552f7358SJed Brown } 3143552f7358SJed Brown PetscFunctionReturn(0); 3144552f7358SJed Brown } 3145552f7358SJed Brown 3146552f7358SJed Brown #undef __FUNCT__ 3147552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3148552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3149552f7358SJed Brown { 315082f516ccSBarry Smith MPI_Comm comm; 3151552f7358SJed Brown const PetscInt dim = 3; 3152552f7358SJed Brown ::tetgenio in; 3153552f7358SJed Brown ::tetgenio out; 3154552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3155552f7358SJed Brown PetscMPIInt rank; 3156552f7358SJed Brown PetscErrorCode ierr; 3157552f7358SJed Brown 3158552f7358SJed Brown PetscFunctionBegin; 315982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3160552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3161552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3162552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3163552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31640d644c17SKarl Rupp 3165552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3166552f7358SJed Brown if (in.numberofpoints > 0) { 3167552f7358SJed Brown PetscSection coordSection; 3168552f7358SJed Brown Vec coordinates; 3169552f7358SJed Brown PetscScalar *array; 3170552f7358SJed Brown 3171552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3172552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31730d644c17SKarl Rupp 3174552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 317569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3176552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3177552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3178552f7358SJed Brown const PetscInt idx = v - vStart; 3179552f7358SJed Brown PetscInt off, d; 3180552f7358SJed Brown 3181552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3182a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3183552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3184552f7358SJed Brown } 3185552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3186552f7358SJed Brown } 3187552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31880d644c17SKarl Rupp 3189552f7358SJed Brown in.numberofcorners = 4; 3190552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3191552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3192552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3193552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3194552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3195552f7358SJed Brown const PetscInt idx = c - cStart; 31960298fd71SBarry Smith PetscInt *closure = NULL; 3197552f7358SJed Brown PetscInt closureSize; 3198552f7358SJed Brown 3199552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3200552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3201552f7358SJed Brown for (v = 0; v < 4; ++v) { 3202552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3203552f7358SJed Brown } 3204552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3205552f7358SJed Brown } 3206552f7358SJed Brown } 320719436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3208552f7358SJed Brown if (!rank) { 3209552f7358SJed Brown char args[32]; 3210552f7358SJed Brown 3211552f7358SJed Brown /* Take away 'Q' for verbose output */ 321219436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3213552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3214552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3215552f7358SJed Brown } 3216552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3217552f7358SJed Brown 3218552f7358SJed Brown { 3219552f7358SJed Brown const PetscInt numCorners = 4; 3220552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3221552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3222552f7358SJed Brown const double *meshCoords = out.pointlist; 32231d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32241d4b4d7bSJed Brown 3225552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3226552f7358SJed Brown 32279db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32280fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3229552f7358SJed Brown /* Set labels */ 3230552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3231552f7358SJed Brown if (out.pointmarkerlist[v]) { 3232552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3233552f7358SJed Brown } 3234552f7358SJed Brown } 3235552f7358SJed Brown if (interpolate) { 3236552f7358SJed Brown PetscInt e, f; 3237552f7358SJed Brown 3238552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3239552f7358SJed Brown if (out.edgemarkerlist[e]) { 3240552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3241552f7358SJed Brown const PetscInt *edges; 3242552f7358SJed Brown PetscInt numEdges; 3243552f7358SJed Brown 3244552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3245552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3246552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3247552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3248552f7358SJed Brown } 3249552f7358SJed Brown } 3250552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3251552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3252552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3253552f7358SJed Brown const PetscInt *faces; 3254552f7358SJed Brown PetscInt numFaces; 3255552f7358SJed Brown 3256552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3257552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3258552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3259552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3260552f7358SJed Brown } 3261552f7358SJed Brown } 3262552f7358SJed Brown } 3263552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3264552f7358SJed Brown } 3265552f7358SJed Brown PetscFunctionReturn(0); 3266552f7358SJed Brown } 3267552f7358SJed Brown #endif 3268552f7358SJed Brown 3269519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3270aaa7dc30SBarry Smith #include <ctetgen.h> 3271552f7358SJed Brown 3272552f7358SJed Brown #undef __FUNCT__ 3273552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3274552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3275552f7358SJed Brown { 327682f516ccSBarry Smith MPI_Comm comm; 3277552f7358SJed Brown const PetscInt dim = 3; 3278552f7358SJed Brown PLC *in, *out; 3279552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3280552f7358SJed Brown PetscMPIInt rank; 3281552f7358SJed Brown PetscErrorCode ierr; 3282552f7358SJed Brown 3283552f7358SJed Brown PetscFunctionBegin; 328482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32850298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3286552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3287552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3288552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3289552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32900d644c17SKarl Rupp 3291552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3292552f7358SJed Brown if (in->numberofpoints > 0) { 3293552f7358SJed Brown PetscSection coordSection; 3294552f7358SJed Brown Vec coordinates; 3295552f7358SJed Brown PetscScalar *array; 3296552f7358SJed Brown 3297785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3298785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3299552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 330069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3301552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3302552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3303552f7358SJed Brown const PetscInt idx = v - vStart; 3304552f7358SJed Brown PetscInt off, d, m; 3305552f7358SJed Brown 3306552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3307552f7358SJed Brown for (d = 0; d < dim; ++d) { 3308552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3309552f7358SJed Brown } 3310552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33110d644c17SKarl Rupp 3312552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3313552f7358SJed Brown } 3314552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3315552f7358SJed Brown } 3316552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33170d644c17SKarl Rupp 3318552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3319552f7358SJed Brown if (in->numberoffacets > 0) { 3320785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3321785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3322552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3323552f7358SJed Brown const PetscInt idx = f - fStart; 33240298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3325552f7358SJed Brown polygon *poly; 3326552f7358SJed Brown 3327552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33280d644c17SKarl Rupp 3329785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33300d644c17SKarl Rupp 3331552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33320298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3333552f7358SJed Brown 3334552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3335552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3336552f7358SJed Brown const PetscInt point = points[p]; 33370d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3338552f7358SJed Brown } 3339552f7358SJed Brown 3340552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3341552f7358SJed Brown poly->numberofvertices = numVertices; 3342785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3343552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3344552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3345552f7358SJed Brown poly->vertexlist[v] = vIdx; 3346552f7358SJed Brown } 3347552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3348552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3349552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3350552f7358SJed Brown } 3351552f7358SJed Brown } 3352552f7358SJed Brown if (!rank) { 3353552f7358SJed Brown TetGenOpts t; 3354552f7358SJed Brown 3355552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3356552f7358SJed Brown t.in = boundary; /* Should go away */ 3357552f7358SJed Brown t.plc = 1; 3358552f7358SJed Brown t.quality = 1; 3359552f7358SJed Brown t.edgesout = 1; 3360552f7358SJed Brown t.zeroindex = 1; 3361552f7358SJed Brown t.quiet = 1; 3362552f7358SJed Brown t.verbose = verbose; 3363552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3364552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3365552f7358SJed Brown } 3366552f7358SJed Brown { 3367552f7358SJed Brown const PetscInt numCorners = 4; 3368552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3369552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3370552f7358SJed Brown const double *meshCoords = out->pointlist; 33711d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3372552f7358SJed Brown 33739db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33740fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3375552f7358SJed Brown /* Set labels */ 3376552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3377552f7358SJed Brown if (out->pointmarkerlist[v]) { 3378552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3379552f7358SJed Brown } 3380552f7358SJed Brown } 3381552f7358SJed Brown if (interpolate) { 3382552f7358SJed Brown PetscInt e; 3383552f7358SJed Brown 3384552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3385552f7358SJed Brown if (out->edgemarkerlist[e]) { 3386552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3387552f7358SJed Brown const PetscInt *edges; 3388552f7358SJed Brown PetscInt numEdges; 3389552f7358SJed Brown 3390552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3391552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3392552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3393552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3394552f7358SJed Brown } 3395552f7358SJed Brown } 3396552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3397552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3398552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3399552f7358SJed Brown const PetscInt *faces; 3400552f7358SJed Brown PetscInt numFaces; 3401552f7358SJed Brown 3402552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3403552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3404552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3405552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3406552f7358SJed Brown } 3407552f7358SJed Brown } 3408552f7358SJed Brown } 3409552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3410552f7358SJed Brown } 3411552f7358SJed Brown 3412552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3413552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3414552f7358SJed Brown PetscFunctionReturn(0); 3415552f7358SJed Brown } 3416552f7358SJed Brown 3417552f7358SJed Brown #undef __FUNCT__ 3418552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3419552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3420552f7358SJed Brown { 342182f516ccSBarry Smith MPI_Comm comm; 3422552f7358SJed Brown const PetscInt dim = 3; 3423552f7358SJed Brown PLC *in, *out; 3424552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3425552f7358SJed Brown PetscMPIInt rank; 3426552f7358SJed Brown PetscErrorCode ierr; 3427552f7358SJed Brown 3428552f7358SJed Brown PetscFunctionBegin; 342982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34300298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3431552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3432552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3433552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3434552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3435552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3436552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34370d644c17SKarl Rupp 3438552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3439552f7358SJed Brown if (in->numberofpoints > 0) { 3440552f7358SJed Brown PetscSection coordSection; 3441552f7358SJed Brown Vec coordinates; 3442552f7358SJed Brown PetscScalar *array; 3443552f7358SJed Brown 3444785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3445785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3446552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 344769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3448552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3449552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3450552f7358SJed Brown const PetscInt idx = v - vStart; 3451552f7358SJed Brown PetscInt off, d, m; 3452552f7358SJed Brown 3453552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3454552f7358SJed Brown for (d = 0; d < dim; ++d) { 3455552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3456552f7358SJed Brown } 3457552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34580d644c17SKarl Rupp 3459552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3460552f7358SJed Brown } 3461552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3462552f7358SJed Brown } 3463552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34640d644c17SKarl Rupp 3465552f7358SJed Brown in->numberofcorners = 4; 3466552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3467552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3468552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3469785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3470552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3471552f7358SJed Brown const PetscInt idx = c - cStart; 34720298fd71SBarry Smith PetscInt *closure = NULL; 3473552f7358SJed Brown PetscInt closureSize; 3474552f7358SJed Brown 3475552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3476552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3477552f7358SJed Brown for (v = 0; v < 4; ++v) { 3478552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3479552f7358SJed Brown } 3480552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3481552f7358SJed Brown } 3482552f7358SJed Brown } 3483552f7358SJed Brown if (!rank) { 3484552f7358SJed Brown TetGenOpts t; 3485552f7358SJed Brown 3486552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34870d644c17SKarl Rupp 3488552f7358SJed Brown t.in = dm; /* Should go away */ 3489552f7358SJed Brown t.refine = 1; 3490552f7358SJed Brown t.varvolume = 1; 3491552f7358SJed Brown t.quality = 1; 3492552f7358SJed Brown t.edgesout = 1; 3493552f7358SJed Brown t.zeroindex = 1; 3494552f7358SJed Brown t.quiet = 1; 3495552f7358SJed Brown t.verbose = verbose; /* Change this */ 34960d644c17SKarl Rupp 3497552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3498552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3499552f7358SJed Brown } 3500552f7358SJed Brown { 3501552f7358SJed Brown const PetscInt numCorners = 4; 3502552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3503552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3504552f7358SJed Brown const double *meshCoords = out->pointlist; 35051d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3506552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3507552f7358SJed Brown 35089db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35090fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3510552f7358SJed Brown /* Set labels */ 3511552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3512552f7358SJed Brown if (out->pointmarkerlist[v]) { 3513552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3514552f7358SJed Brown } 3515552f7358SJed Brown } 3516552f7358SJed Brown if (interpolate) { 3517552f7358SJed Brown PetscInt e, f; 3518552f7358SJed Brown 3519552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3520552f7358SJed Brown if (out->edgemarkerlist[e]) { 3521552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3522552f7358SJed Brown const PetscInt *edges; 3523552f7358SJed Brown PetscInt numEdges; 3524552f7358SJed Brown 3525552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3526552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3527552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3528552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3529552f7358SJed Brown } 3530552f7358SJed Brown } 3531552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3532552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3533552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3534552f7358SJed Brown const PetscInt *faces; 3535552f7358SJed Brown PetscInt numFaces; 3536552f7358SJed Brown 3537552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3538552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3539552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3540552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3541552f7358SJed Brown } 3542552f7358SJed Brown } 3543552f7358SJed Brown } 3544552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3545552f7358SJed Brown } 3546552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3547552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3548552f7358SJed Brown PetscFunctionReturn(0); 3549552f7358SJed Brown } 3550552f7358SJed Brown #endif 3551552f7358SJed Brown 3552552f7358SJed Brown #undef __FUNCT__ 3553552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3554552f7358SJed Brown /*@C 3555552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3556552f7358SJed Brown 3557552f7358SJed Brown Not Collective 3558552f7358SJed Brown 3559552f7358SJed Brown Input Parameters: 3560552f7358SJed Brown + boundary - The DMPlex boundary object 3561552f7358SJed Brown . name - The mesh generation package name 3562552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3563552f7358SJed Brown 3564552f7358SJed Brown Output Parameter: 3565552f7358SJed Brown . mesh - The DMPlex object 3566552f7358SJed Brown 3567552f7358SJed Brown Level: intermediate 3568552f7358SJed Brown 3569552f7358SJed Brown .keywords: mesh, elements 3570552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3571552f7358SJed Brown @*/ 3572552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3573552f7358SJed Brown { 3574552f7358SJed Brown PetscInt dim; 3575552f7358SJed Brown char genname[1024]; 3576552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3577552f7358SJed Brown PetscErrorCode ierr; 3578552f7358SJed Brown 3579552f7358SJed Brown PetscFunctionBegin; 3580552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3581552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3582c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3583552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35840d644c17SKarl Rupp if (flg) name = genname; 3585552f7358SJed Brown if (name) { 3586552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3587552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3588552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3589552f7358SJed Brown } 3590552f7358SJed Brown switch (dim) { 3591552f7358SJed Brown case 1: 3592552f7358SJed Brown if (!name || isTriangle) { 3593519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3594552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3595552f7358SJed Brown #else 359682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3597552f7358SJed Brown #endif 359882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3599552f7358SJed Brown break; 3600552f7358SJed Brown case 2: 3601552f7358SJed Brown if (!name || isCTetgen) { 3602519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3603552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3604552f7358SJed Brown #else 360582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3606552f7358SJed Brown #endif 3607552f7358SJed Brown } else if (isTetgen) { 3608519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3609552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3610552f7358SJed Brown #else 361182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3612552f7358SJed Brown #endif 361382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3614552f7358SJed Brown break; 3615552f7358SJed Brown default: 361682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3617552f7358SJed Brown } 3618552f7358SJed Brown PetscFunctionReturn(0); 3619552f7358SJed Brown } 3620552f7358SJed Brown 3621552f7358SJed Brown #undef __FUNCT__ 3622552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3623552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3624552f7358SJed Brown { 3625552f7358SJed Brown PetscReal refinementLimit; 3626552f7358SJed Brown PetscInt dim, cStart, cEnd; 36270298fd71SBarry Smith char genname[1024], *name = NULL; 3628552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3629552f7358SJed Brown PetscErrorCode ierr; 3630552f7358SJed Brown 3631552f7358SJed Brown PetscFunctionBegin; 3632552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3633552f7358SJed Brown if (isUniform) { 3634552f7358SJed Brown CellRefiner cellRefiner; 3635552f7358SJed Brown 3636509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3637509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36388e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3639552f7358SJed Brown PetscFunctionReturn(0); 3640552f7358SJed Brown } 3641552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3642552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3643c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3644552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3645552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36460d644c17SKarl Rupp if (flg) name = genname; 3647552f7358SJed Brown if (name) { 3648552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3649552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3650552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3651552f7358SJed Brown } 3652552f7358SJed Brown switch (dim) { 3653552f7358SJed Brown case 2: 3654552f7358SJed Brown if (!name || isTriangle) { 3655519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3656552f7358SJed Brown double *maxVolumes; 3657552f7358SJed Brown PetscInt c; 3658552f7358SJed Brown 3659785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36600d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3661552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36626b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3663552f7358SJed Brown #else 366482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3665552f7358SJed Brown #endif 366682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3667552f7358SJed Brown break; 3668552f7358SJed Brown case 3: 3669552f7358SJed Brown if (!name || isCTetgen) { 3670519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3671552f7358SJed Brown PetscReal *maxVolumes; 3672552f7358SJed Brown PetscInt c; 3673552f7358SJed Brown 3674785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36750d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3676552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3677552f7358SJed Brown #else 367882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3679552f7358SJed Brown #endif 3680552f7358SJed Brown } else if (isTetgen) { 3681519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3682552f7358SJed Brown double *maxVolumes; 3683552f7358SJed Brown PetscInt c; 3684552f7358SJed Brown 3685785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36860d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3687552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3688552f7358SJed Brown #else 368982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3690552f7358SJed Brown #endif 369182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3692552f7358SJed Brown break; 3693552f7358SJed Brown default: 369482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3695552f7358SJed Brown } 36968e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3697552f7358SJed Brown PetscFunctionReturn(0); 3698552f7358SJed Brown } 3699552f7358SJed Brown 3700552f7358SJed Brown #undef __FUNCT__ 37010a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 37020a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 37030a6ba040SMatthew G. Knepley { 37040a6ba040SMatthew G. Knepley DM cdm = dm; 37050a6ba040SMatthew G. Knepley PetscInt r; 37060a6ba040SMatthew G. Knepley PetscBool isUniform; 37070a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37080a6ba040SMatthew G. Knepley 37090a6ba040SMatthew G. Knepley PetscFunctionBegin; 37100a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37110a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37120a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37130a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37140a6ba040SMatthew G. Knepley 37150a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37160a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37170a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37180a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37190a6ba040SMatthew G. Knepley } 37200a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37210a6ba040SMatthew G. Knepley } 37220a6ba040SMatthew G. Knepley 37230a6ba040SMatthew G. Knepley #undef __FUNCT__ 37240a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37250a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37260a6ba040SMatthew G. Knepley { 37270a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3728549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37290a6ba040SMatthew G. Knepley 37300a6ba040SMatthew G. Knepley PetscFunctionBegin; 3731549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37320a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37330a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37340a6ba040SMatthew G. Knepley } 37350a6ba040SMatthew G. Knepley 37360a6ba040SMatthew G. Knepley #undef __FUNCT__ 3737d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3738d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3739d49fcaecSMatthew G. Knepley { 3740d49fcaecSMatthew G. Knepley PetscInt d; 3741d49fcaecSMatthew G. Knepley 3742d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3743d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3744d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3745d49fcaecSMatthew G. Knepley } else { 3746d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3747d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3748858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3749d49fcaecSMatthew G. Knepley } else { 3750d49fcaecSMatthew G. Knepley out[d] = in[d]; 3751d49fcaecSMatthew G. Knepley } 3752d49fcaecSMatthew G. Knepley } 3753d49fcaecSMatthew G. Knepley } 3754d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3755d49fcaecSMatthew G. Knepley } 3756d49fcaecSMatthew G. Knepley 3757d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3758d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3759d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3760d49fcaecSMatthew G. Knepley { 3761d49fcaecSMatthew G. Knepley PetscInt d; 3762d49fcaecSMatthew G. Knepley 3763d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3764d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3765d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3766d49fcaecSMatthew G. Knepley } else { 3767d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3768d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3769858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3770d49fcaecSMatthew G. Knepley } else { 3771d49fcaecSMatthew G. Knepley out[d] += in[d]; 3772d49fcaecSMatthew G. Knepley } 3773d49fcaecSMatthew G. Knepley } 3774d49fcaecSMatthew G. Knepley } 3775d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3776d49fcaecSMatthew G. Knepley } 3777d49fcaecSMatthew G. Knepley 3778d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3779d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3780d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3781d49fcaecSMatthew G. Knepley { 3782d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3783d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3784d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 37858c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3786d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3787d49fcaecSMatthew G. Knepley 3788d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3789d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3790d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3791d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3792d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3793d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3794d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3795d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 37968c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 37978c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 37988c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3799d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3800d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3801d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3802d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 38038c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3804d49fcaecSMatthew G. Knepley } 3805d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3806d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3807d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38088c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3809d49fcaecSMatthew G. Knepley } 3810d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3811d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3812d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3813d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3814d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3815d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3816d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3817d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3818d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3819d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3820d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3821d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3822d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3823d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3824d49fcaecSMatthew G. Knepley } 3825d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3826d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3827d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3828d49fcaecSMatthew G. Knepley PetscInt b; 3829d49fcaecSMatthew G. Knepley 3830d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3831d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3832d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3833d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3834d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3835d49fcaecSMatthew G. Knepley } 3836d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3837d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3838d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 383946e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 3840d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3841d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3842d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3843d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3844d49fcaecSMatthew G. Knepley } 3845d49fcaecSMatthew G. Knepley 3846d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3847aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3848552f7358SJed Brown /*@ 3849aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3850552f7358SJed Brown 3851552f7358SJed Brown Not Collective 3852552f7358SJed Brown 3853aa50250dSMatthew G. Knepley Input Parameter: 3854552f7358SJed Brown . dm - The DMPlex object 3855552f7358SJed Brown 3856aa50250dSMatthew G. Knepley Output Parameter: 3857aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3858552f7358SJed Brown 3859552f7358SJed Brown Level: developer 3860552f7358SJed Brown 3861aa50250dSMatthew G. Knepley .keywords: mesh, points 3862aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3863aa50250dSMatthew G. Knepley @*/ 3864aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3865aa50250dSMatthew G. Knepley { 3866aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3867aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3868aa50250dSMatthew G. Knepley 3869aa50250dSMatthew G. Knepley PetscFunctionBegin; 3870aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3871aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 387263d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3873aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3874aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3875aa50250dSMatthew G. Knepley } 3876aa50250dSMatthew G. Knepley 3877aa50250dSMatthew G. Knepley #undef __FUNCT__ 3878aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3879aa50250dSMatthew G. Knepley /*@ 3880aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3881aa50250dSMatthew G. Knepley 3882aa50250dSMatthew G. Knepley Not Collective 3883aa50250dSMatthew G. Knepley 3884aa50250dSMatthew G. Knepley Input Parameter: 3885aa50250dSMatthew G. Knepley . dm - The DMPlex object 3886aa50250dSMatthew G. Knepley 3887aa50250dSMatthew G. Knepley Output Parameter: 3888aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3889aa50250dSMatthew G. Knepley 3890aa50250dSMatthew G. Knepley Level: developer 3891552f7358SJed Brown 3892552f7358SJed Brown .keywords: mesh, points 3893aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3894552f7358SJed Brown @*/ 3895552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3896552f7358SJed Brown { 3897aa50250dSMatthew G. Knepley DMLabel label; 3898aa50250dSMatthew G. Knepley PetscInt d = 0; 3899552f7358SJed Brown PetscErrorCode ierr; 3900552f7358SJed Brown 3901552f7358SJed Brown PetscFunctionBegin; 3902552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3903552f7358SJed Brown PetscValidPointer(depth, 2); 3904aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3905aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3906552f7358SJed Brown *depth = d-1; 3907552f7358SJed Brown PetscFunctionReturn(0); 3908552f7358SJed Brown } 3909552f7358SJed Brown 3910552f7358SJed Brown #undef __FUNCT__ 3911552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3912552f7358SJed Brown /*@ 3913552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3914552f7358SJed Brown 3915552f7358SJed Brown Not Collective 3916552f7358SJed Brown 3917552f7358SJed Brown Input Parameters: 3918552f7358SJed Brown + dm - The DMPlex object 3919552f7358SJed Brown - stratumValue - The requested depth 3920552f7358SJed Brown 3921552f7358SJed Brown Output Parameters: 3922552f7358SJed Brown + start - The first point at this depth 3923552f7358SJed Brown - end - One beyond the last point at this depth 3924552f7358SJed Brown 3925552f7358SJed Brown Level: developer 3926552f7358SJed Brown 3927552f7358SJed Brown .keywords: mesh, points 3928552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3929552f7358SJed Brown @*/ 39300adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39310adebc6cSBarry Smith { 3932aa50250dSMatthew G. Knepley DMLabel label; 393363d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3934552f7358SJed Brown PetscErrorCode ierr; 3935552f7358SJed Brown 3936552f7358SJed Brown PetscFunctionBegin; 3937552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 393863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 393963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3940552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39410d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 394263d1a920SMatthew G. Knepley if (stratumValue < 0) { 394363d1a920SMatthew G. Knepley if (start) *start = pStart; 394463d1a920SMatthew G. Knepley if (end) *end = pEnd; 394563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3946552f7358SJed Brown } 3947aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 394863d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 394963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3950552f7358SJed Brown PetscFunctionReturn(0); 3951552f7358SJed Brown } 3952552f7358SJed Brown 3953552f7358SJed Brown #undef __FUNCT__ 3954552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3955552f7358SJed Brown /*@ 3956552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3957552f7358SJed Brown 3958552f7358SJed Brown Not Collective 3959552f7358SJed Brown 3960552f7358SJed Brown Input Parameters: 3961552f7358SJed Brown + dm - The DMPlex object 3962552f7358SJed Brown - stratumValue - The requested height 3963552f7358SJed Brown 3964552f7358SJed Brown Output Parameters: 3965552f7358SJed Brown + start - The first point at this height 3966552f7358SJed Brown - end - One beyond the last point at this height 3967552f7358SJed Brown 3968552f7358SJed Brown Level: developer 3969552f7358SJed Brown 3970552f7358SJed Brown .keywords: mesh, points 3971552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3972552f7358SJed Brown @*/ 39730adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39740adebc6cSBarry Smith { 3975aa50250dSMatthew G. Knepley DMLabel label; 397663d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 3977552f7358SJed Brown PetscErrorCode ierr; 3978552f7358SJed Brown 3979552f7358SJed Brown PetscFunctionBegin; 3980552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 398163d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 398263d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3983552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39840d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 398563d1a920SMatthew G. Knepley if (stratumValue < 0) { 398663d1a920SMatthew G. Knepley if (start) *start = pStart; 398763d1a920SMatthew G. Knepley if (end) *end = pEnd; 398863d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3989552f7358SJed Brown } 3990aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3991aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 399263d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 399363d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3994552f7358SJed Brown PetscFunctionReturn(0); 3995552f7358SJed Brown } 3996552f7358SJed Brown 3997552f7358SJed Brown #undef __FUNCT__ 3998552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 3999552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4000a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4001a6dfd86eSKarl Rupp { 4002552f7358SJed Brown PetscInt *numDofTot; 4003916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4004916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4005552f7358SJed Brown PetscErrorCode ierr; 4006552f7358SJed Brown 4007552f7358SJed Brown PetscFunctionBegin; 4008785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4009552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4010552f7358SJed Brown numDofTot[d] = 0; 40110d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4012552f7358SJed Brown } 401382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4014552f7358SJed Brown if (numFields > 0) { 4015552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4016552f7358SJed Brown if (numComp) { 4017552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4018552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4019552f7358SJed Brown } 4020552f7358SJed Brown } 4021552f7358SJed Brown } 4022552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4023552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4024916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4025916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4026916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4027916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4028552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4029552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4030552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4031552f7358SJed Brown } 4032552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4033552f7358SJed Brown } 4034552f7358SJed Brown } 4035552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4036552f7358SJed Brown PetscFunctionReturn(0); 4037552f7358SJed Brown } 4038552f7358SJed Brown 4039552f7358SJed Brown #undef __FUNCT__ 4040552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4041552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4042552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4043552f7358SJed Brown */ 4044a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4045a6dfd86eSKarl Rupp { 4046552f7358SJed Brown PetscInt numFields; 4047552f7358SJed Brown PetscInt bc; 4048552f7358SJed Brown PetscErrorCode ierr; 4049552f7358SJed Brown 4050552f7358SJed Brown PetscFunctionBegin; 4051552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4052552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4053552f7358SJed Brown PetscInt field = 0; 4054552f7358SJed Brown const PetscInt *idx; 4055552f7358SJed Brown PetscInt n, i; 4056552f7358SJed Brown 40570d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4058552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4059552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4060552f7358SJed Brown for (i = 0; i < n; ++i) { 4061552f7358SJed Brown const PetscInt p = idx[i]; 4062552f7358SJed Brown PetscInt numConst = constDof; 4063552f7358SJed Brown 4064552f7358SJed Brown /* Constrain every dof on the point */ 4065552f7358SJed Brown if (numConst < 0) { 4066552f7358SJed Brown if (numFields) { 4067552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4068552f7358SJed Brown } else { 4069552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4070552f7358SJed Brown } 4071552f7358SJed Brown } 4072552f7358SJed Brown if (numFields) { 4073552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4074552f7358SJed Brown } 4075552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4076552f7358SJed Brown } 4077552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4078552f7358SJed Brown } 4079552f7358SJed Brown PetscFunctionReturn(0); 4080552f7358SJed Brown } 4081552f7358SJed Brown 4082552f7358SJed Brown #undef __FUNCT__ 4083552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4084552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 40850adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 40860adebc6cSBarry Smith { 4087552f7358SJed Brown PetscInt *maxConstraints; 4088552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4089552f7358SJed Brown PetscErrorCode ierr; 4090552f7358SJed Brown 4091552f7358SJed Brown PetscFunctionBegin; 4092552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4093552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4094785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 40950d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4096552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4097552f7358SJed Brown PetscInt cdof; 4098552f7358SJed Brown 4099552f7358SJed Brown if (numFields) { 4100552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4101552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4102552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4103552f7358SJed Brown } 4104552f7358SJed Brown } else { 4105552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4106552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4107552f7358SJed Brown } 4108552f7358SJed Brown } 4109552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4110552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4111552f7358SJed Brown } 4112552f7358SJed Brown if (maxConstraints[numFields]) { 4113552f7358SJed Brown PetscInt *indices; 4114552f7358SJed Brown 4115785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4116552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4117552f7358SJed Brown PetscInt cdof, d; 4118552f7358SJed Brown 4119552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4120552f7358SJed Brown if (cdof) { 4121552f7358SJed 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]); 4122552f7358SJed Brown if (numFields) { 4123552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4124552f7358SJed Brown 4125552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4126552f7358SJed Brown PetscInt cfdof, fdof; 4127552f7358SJed Brown 4128552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4129552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4130552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41310d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4132552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41330d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4134552f7358SJed Brown numConst += cfdof; 4135552f7358SJed Brown foff += fdof; 4136552f7358SJed Brown } 4137552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4138552f7358SJed Brown } else { 41390d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4140552f7358SJed Brown } 4141552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4142552f7358SJed Brown } 4143552f7358SJed Brown } 4144552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4145552f7358SJed Brown } 4146552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4147552f7358SJed Brown PetscFunctionReturn(0); 4148552f7358SJed Brown } 4149552f7358SJed Brown 4150552f7358SJed Brown #undef __FUNCT__ 4151552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4152552f7358SJed Brown /* Set the constrained field indices on each point */ 41530adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 41540adebc6cSBarry Smith { 4155552f7358SJed Brown const PetscInt *points, *indices; 4156552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4157552f7358SJed Brown PetscErrorCode ierr; 4158552f7358SJed Brown 4159552f7358SJed Brown PetscFunctionBegin; 4160552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4161552f7358SJed 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); 4162552f7358SJed Brown 4163552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4164552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4165552f7358SJed Brown if (!constraintIndices) { 4166552f7358SJed Brown PetscInt *idx, i; 4167552f7358SJed Brown 4168552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4169785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 41700d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4171552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4172552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4173552f7358SJed Brown } 4174552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4175552f7358SJed Brown } else { 4176552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4177552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4178552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4179552f7358SJed Brown PetscInt fcdof; 4180552f7358SJed Brown 4181552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 418282f516ccSBarry 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); 4183552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4184552f7358SJed Brown } 4185552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4186552f7358SJed Brown } 4187552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4188552f7358SJed Brown PetscFunctionReturn(0); 4189552f7358SJed Brown } 4190552f7358SJed Brown 4191552f7358SJed Brown #undef __FUNCT__ 4192552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4193552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41940adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 41950adebc6cSBarry Smith { 4196552f7358SJed Brown PetscInt *indices; 4197552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4198552f7358SJed Brown PetscErrorCode ierr; 4199552f7358SJed Brown 4200552f7358SJed Brown PetscFunctionBegin; 4201552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4202785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4203552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 420482f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4205552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4206552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4207552f7358SJed Brown PetscInt cdof, d; 4208552f7358SJed Brown 4209552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4210552f7358SJed Brown if (cdof) { 4211552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4212552f7358SJed Brown 4213552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4214552f7358SJed Brown const PetscInt *fcind; 4215552f7358SJed Brown PetscInt fdof, fcdof; 4216552f7358SJed Brown 4217552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4218552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4219552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4220552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42210d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4222552f7358SJed Brown foff += fdof; 4223552f7358SJed Brown numConst += fcdof; 4224552f7358SJed Brown } 422582f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4226552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4227552f7358SJed Brown } 4228552f7358SJed Brown } 4229552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4230552f7358SJed Brown PetscFunctionReturn(0); 4231552f7358SJed Brown } 4232552f7358SJed Brown 4233552f7358SJed Brown #undef __FUNCT__ 4234552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4235552f7358SJed Brown /*@C 4236552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4237552f7358SJed Brown 4238552f7358SJed Brown Not Collective 4239552f7358SJed Brown 4240552f7358SJed Brown Input Parameters: 4241552f7358SJed Brown + dm - The DMPlex object 4242552f7358SJed Brown . dim - The spatial dimension of the problem 4243552f7358SJed Brown . numFields - The number of fields in the problem 4244552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4245552f7358SJed 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 4246552f7358SJed Brown . numBC - The number of boundary conditions 4247552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4248f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4249f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4250552f7358SJed Brown 4251552f7358SJed Brown Output Parameter: 4252552f7358SJed Brown . section - The PetscSection object 4253552f7358SJed Brown 4254552f7358SJed 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 4255f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4256f8f126e8SMatthew G. Knepley 4257f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4258552f7358SJed Brown 4259552f7358SJed Brown Level: developer 4260552f7358SJed Brown 42613813dfbdSMatthew G Knepley Fortran Notes: 42623813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 42633813dfbdSMatthew G Knepley 4264552f7358SJed Brown .keywords: mesh, elements 4265f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4266552f7358SJed Brown @*/ 4267f8f126e8SMatthew 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) 4268a6dfd86eSKarl Rupp { 4269552f7358SJed Brown PetscErrorCode ierr; 4270552f7358SJed Brown 4271552f7358SJed Brown PetscFunctionBegin; 4272552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4273552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4274f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4275552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4276552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4277ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4278552f7358SJed Brown PetscFunctionReturn(0); 4279552f7358SJed Brown } 4280552f7358SJed Brown 4281552f7358SJed Brown #undef __FUNCT__ 4282552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 42830adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 42840adebc6cSBarry Smith { 4285552f7358SJed Brown PetscSection section; 4286552f7358SJed Brown PetscErrorCode ierr; 4287552f7358SJed Brown 4288552f7358SJed Brown PetscFunctionBegin; 428938221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 429082f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4291552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 42921d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4293552f7358SJed Brown PetscFunctionReturn(0); 4294552f7358SJed Brown } 4295552f7358SJed Brown 4296552f7358SJed Brown #undef __FUNCT__ 4297552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 42980adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 42990adebc6cSBarry Smith { 4300552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4301552f7358SJed Brown 4302552f7358SJed Brown PetscFunctionBegin; 4303552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4304552f7358SJed Brown if (section) *section = mesh->coneSection; 4305552f7358SJed Brown PetscFunctionReturn(0); 4306552f7358SJed Brown } 4307552f7358SJed Brown 4308552f7358SJed Brown #undef __FUNCT__ 43098cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43108cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43118cb4d582SMatthew G. Knepley { 43128cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43138cb4d582SMatthew G. Knepley 43148cb4d582SMatthew G. Knepley PetscFunctionBegin; 43158cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43168cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43178cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43188cb4d582SMatthew G. Knepley } 43198cb4d582SMatthew G. Knepley 43208cb4d582SMatthew G. Knepley #undef __FUNCT__ 4321552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4322a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4323a6dfd86eSKarl Rupp { 4324552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4325552f7358SJed Brown 4326552f7358SJed Brown PetscFunctionBegin; 4327552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4328552f7358SJed Brown if (cones) *cones = mesh->cones; 4329552f7358SJed Brown PetscFunctionReturn(0); 4330552f7358SJed Brown } 4331552f7358SJed Brown 4332552f7358SJed Brown #undef __FUNCT__ 4333552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4334a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4335a6dfd86eSKarl Rupp { 4336552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4337552f7358SJed Brown 4338552f7358SJed Brown PetscFunctionBegin; 4339552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4340552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4341552f7358SJed Brown PetscFunctionReturn(0); 4342552f7358SJed Brown } 4343552f7358SJed Brown 4344552f7358SJed Brown /******************************** FEM Support **********************************/ 4345552f7358SJed Brown 4346552f7358SJed Brown #undef __FUNCT__ 43471a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43481a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4349a6dfd86eSKarl Rupp { 4350552f7358SJed Brown PetscScalar *array, *vArray; 4351d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 43521a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4353552f7358SJed Brown PetscErrorCode ierr; 4354552f7358SJed Brown 43551b406b76SMatthew G. Knepley PetscFunctionBeginHot; 43562a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 43575a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 43585a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 43595a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 43603f7cbbe7SMatthew G. Knepley if (!values || !*values) { 43619df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43629df71ca4SMatthew G. Knepley PetscInt dof; 4363d9917b9dSMatthew G. Knepley 43649df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43659df71ca4SMatthew G. Knepley size += dof; 43669df71ca4SMatthew G. Knepley } 43679df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43689df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43692a3aaacfSMatthew G. Knepley PetscInt dof; 43705a1bb5cfSMatthew G. Knepley 43715a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 43722a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 43735a1bb5cfSMatthew G. Knepley size += dof; 43745a1bb5cfSMatthew G. Knepley } 43753f7cbbe7SMatthew G. Knepley if (!values) { 43763f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 43773f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 43783f7cbbe7SMatthew G. Knepley } 43795a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4380982e9ed1SMatthew G. Knepley } else { 4381982e9ed1SMatthew G. Knepley array = *values; 4382982e9ed1SMatthew G. Knepley } 43839df71ca4SMatthew G. Knepley size = 0; 43845a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 43859df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43869df71ca4SMatthew G. Knepley PetscInt dof, off, d; 43879df71ca4SMatthew G. Knepley PetscScalar *varr; 4388d9917b9dSMatthew G. Knepley 43899df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43909df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 43919df71ca4SMatthew G. Knepley varr = &vArray[off]; 43921a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 43931a271a75SMatthew G. Knepley array[offset] = varr[d]; 43949df71ca4SMatthew G. Knepley } 43959df71ca4SMatthew G. Knepley size += dof; 43969df71ca4SMatthew G. Knepley } 43979df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43989df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43999df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 44005a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 44015a1bb5cfSMatthew G. Knepley PetscScalar *varr; 44025a1bb5cfSMatthew G. Knepley 440352ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44045a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44055a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44065a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44075a1bb5cfSMatthew G. Knepley if (o >= 0) { 44081a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44091a271a75SMatthew G. Knepley array[offset] = varr[d]; 44105a1bb5cfSMatthew G. Knepley } 44115a1bb5cfSMatthew G. Knepley } else { 44121a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44131a271a75SMatthew G. Knepley array[offset] = varr[d]; 44145a1bb5cfSMatthew G. Knepley } 44155a1bb5cfSMatthew G. Knepley } 44169df71ca4SMatthew G. Knepley size += dof; 44175a1bb5cfSMatthew G. Knepley } 44185a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44199df71ca4SMatthew G. Knepley if (!*values) { 44205a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44215a1bb5cfSMatthew G. Knepley *values = array; 44229df71ca4SMatthew G. Knepley } else { 44239df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44248c312ff3SMatthew G. Knepley *csize = size; 44259df71ca4SMatthew G. Knepley } 44265a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44275a1bb5cfSMatthew G. Knepley } 4428d9917b9dSMatthew G. Knepley 4429d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44301a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44311a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44321a271a75SMatthew G. Knepley { 44331a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44341a271a75SMatthew G. Knepley PetscErrorCode ierr; 44351a271a75SMatthew G. Knepley 44361a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4437fe02ba77SJed Brown *size = 0; 44381a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44391a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44401a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44411a271a75SMatthew G. Knepley PetscInt dof, off, d; 44421a271a75SMatthew G. Knepley const PetscScalar *varr; 44431a271a75SMatthew G. Knepley 44441a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44451a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44461a271a75SMatthew G. Knepley varr = &vArray[off]; 44471a271a75SMatthew G. Knepley if (o >= 0) { 44481a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44491a271a75SMatthew G. Knepley } else { 44501a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 44511a271a75SMatthew G. Knepley } 44521a271a75SMatthew G. Knepley } 44531a271a75SMatthew G. Knepley *size = offset; 44541a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44551a271a75SMatthew G. Knepley } 44561a271a75SMatthew G. Knepley 44571a271a75SMatthew G. Knepley #undef __FUNCT__ 44581a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 44591a271a75SMatthew 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[]) 44601a271a75SMatthew G. Knepley { 44611a271a75SMatthew G. Knepley PetscInt offset = 0, f; 44621a271a75SMatthew G. Knepley PetscErrorCode ierr; 44631a271a75SMatthew G. Knepley 44641a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4465fe02ba77SJed Brown *size = 0; 44661a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44671a271a75SMatthew G. Knepley PetscInt fcomp, p; 44681a271a75SMatthew G. Knepley 44691a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 44701a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44711a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44721a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44731a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 44741a271a75SMatthew G. Knepley const PetscScalar *varr; 44751a271a75SMatthew G. Knepley 44761a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 44771a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 44781a271a75SMatthew G. Knepley varr = &vArray[foff]; 44791a271a75SMatthew G. Knepley if (o >= 0) { 44801a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 44811a271a75SMatthew G. Knepley } else { 44821a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 44831a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 44841a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 44851a271a75SMatthew G. Knepley } 44861a271a75SMatthew G. Knepley } 44871a271a75SMatthew G. Knepley } 44881a271a75SMatthew G. Knepley } 44891a271a75SMatthew G. Knepley } 44901a271a75SMatthew G. Knepley *size = offset; 44911a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44921a271a75SMatthew G. Knepley } 44931a271a75SMatthew G. Knepley 44941a271a75SMatthew G. Knepley #undef __FUNCT__ 4495552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4496552f7358SJed Brown /*@C 4497552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4498552f7358SJed Brown 4499552f7358SJed Brown Not collective 4500552f7358SJed Brown 4501552f7358SJed Brown Input Parameters: 4502552f7358SJed Brown + dm - The DM 4503552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4504552f7358SJed Brown . v - The local vector 4505552f7358SJed Brown - point - The sieve point in the DM 4506552f7358SJed Brown 4507552f7358SJed Brown Output Parameters: 4508552f7358SJed Brown + csize - The number of values in the closure, or NULL 4509552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4510552f7358SJed Brown 4511552f7358SJed Brown Fortran Notes: 4512552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4513552f7358SJed Brown include petsc.h90 in your code. 4514552f7358SJed Brown 4515552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4516552f7358SJed Brown 4517552f7358SJed Brown Level: intermediate 4518552f7358SJed Brown 4519552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4520552f7358SJed Brown @*/ 4521552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4522552f7358SJed Brown { 4523552f7358SJed Brown PetscSection clSection; 4524d9917b9dSMatthew G. Knepley IS clPoints; 4525552f7358SJed Brown PetscScalar *array, *vArray; 4526552f7358SJed Brown PetscInt *points = NULL; 4527d9917b9dSMatthew G. Knepley const PetscInt *clp; 45281a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4529552f7358SJed Brown PetscErrorCode ierr; 4530552f7358SJed Brown 4531d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4532552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4533552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45341a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45351a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4536552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4537552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4538552f7358SJed Brown if (depth == 1 && numFields < 2) { 45391a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4540552f7358SJed Brown PetscFunctionReturn(0); 4541552f7358SJed Brown } 45421a271a75SMatthew G. Knepley /* Get points */ 4543d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4544d9917b9dSMatthew G. Knepley if (!clPoints) { 45451a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4546552f7358SJed Brown 45471a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4548552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4549552f7358SJed Brown /* Compress out points not in the section */ 4550552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4551552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4552552f7358SJed Brown points[q*2] = points[p]; 4553552f7358SJed Brown points[q*2+1] = points[p+1]; 4554552f7358SJed Brown ++q; 4555552f7358SJed Brown } 4556552f7358SJed Brown } 4557552f7358SJed Brown numPoints = q; 4558d9917b9dSMatthew G. Knepley } else { 4559d9917b9dSMatthew G. Knepley PetscInt dof, off; 4560552f7358SJed Brown 4561d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4562d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4563d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 45641a271a75SMatthew G. Knepley numPoints = dof/2; 4565d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4566552f7358SJed Brown } 45671a271a75SMatthew G. Knepley /* Get array */ 4568552f7358SJed Brown if (!values || !*values) { 45691a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4570552f7358SJed Brown 45711a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4572552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 45731a271a75SMatthew G. Knepley asize += dof; 4574552f7358SJed Brown } 4575bd6c0d32SMatthew G. Knepley if (!values) { 4576d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45771a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45781a271a75SMatthew G. Knepley if (csize) *csize = asize; 4579bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4580bd6c0d32SMatthew G. Knepley } 45811a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4582d0f6b257SMatthew G. Knepley } else { 4583d0f6b257SMatthew G. Knepley array = *values; 4584d0f6b257SMatthew G. Knepley } 4585552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 45861a271a75SMatthew G. Knepley /* Get values */ 4587ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 45881a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 45891a271a75SMatthew G. Knepley /* Cleanup points */ 45901a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45911a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45921a271a75SMatthew G. Knepley /* Cleanup array */ 4593552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4594d0f6b257SMatthew G. Knepley if (!*values) { 4595552f7358SJed Brown if (csize) *csize = size; 4596552f7358SJed Brown *values = array; 4597d0f6b257SMatthew G. Knepley } else { 4598d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4599d0f6b257SMatthew G. Knepley *csize = size; 4600d0f6b257SMatthew G. Knepley } 4601552f7358SJed Brown PetscFunctionReturn(0); 4602552f7358SJed Brown } 4603552f7358SJed Brown 4604552f7358SJed Brown #undef __FUNCT__ 4605552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4606552f7358SJed Brown /*@C 4607552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4608552f7358SJed Brown 4609552f7358SJed Brown Not collective 4610552f7358SJed Brown 4611552f7358SJed Brown Input Parameters: 4612552f7358SJed Brown + dm - The DM 46130298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4614552f7358SJed Brown . v - The local vector 4615552f7358SJed Brown . point - The sieve point in the DM 46160298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4617552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4618552f7358SJed Brown 46193813dfbdSMatthew G Knepley Fortran Notes: 46203813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46213813dfbdSMatthew G Knepley include petsc.h90 in your code. 46223813dfbdSMatthew G Knepley 46233813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46243813dfbdSMatthew G Knepley 4625552f7358SJed Brown Level: intermediate 4626552f7358SJed Brown 4627552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4628552f7358SJed Brown @*/ 46297c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4630a6dfd86eSKarl Rupp { 4631552f7358SJed Brown PetscInt size = 0; 4632552f7358SJed Brown PetscErrorCode ierr; 4633552f7358SJed Brown 4634552f7358SJed Brown PetscFunctionBegin; 4635552f7358SJed Brown /* Should work without recalculating size */ 4636552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4637552f7358SJed Brown PetscFunctionReturn(0); 4638552f7358SJed Brown } 4639552f7358SJed Brown 4640552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4641552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4642552f7358SJed Brown 4643552f7358SJed Brown #undef __FUNCT__ 4644552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46451a271a75SMatthew 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[]) 4646552f7358SJed Brown { 4647552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4648552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4649552f7358SJed Brown PetscScalar *a; 4650552f7358SJed Brown PetscInt off, cind = 0, k; 4651552f7358SJed Brown PetscErrorCode ierr; 4652552f7358SJed Brown 4653552f7358SJed Brown PetscFunctionBegin; 4654552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4655552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4656552f7358SJed Brown a = &array[off]; 4657552f7358SJed Brown if (!cdof || setBC) { 4658552f7358SJed Brown if (orientation >= 0) { 4659552f7358SJed Brown for (k = 0; k < dof; ++k) { 4660552f7358SJed Brown fuse(&a[k], values[k]); 4661552f7358SJed Brown } 4662552f7358SJed Brown } else { 4663552f7358SJed Brown for (k = 0; k < dof; ++k) { 4664552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4665552f7358SJed Brown } 4666552f7358SJed Brown } 4667552f7358SJed Brown } else { 4668552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4669552f7358SJed Brown if (orientation >= 0) { 4670552f7358SJed Brown for (k = 0; k < dof; ++k) { 4671552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4672552f7358SJed Brown fuse(&a[k], values[k]); 4673552f7358SJed Brown } 4674552f7358SJed Brown } else { 4675552f7358SJed Brown for (k = 0; k < dof; ++k) { 4676552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4677552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4678552f7358SJed Brown } 4679552f7358SJed Brown } 4680552f7358SJed Brown } 4681552f7358SJed Brown PetscFunctionReturn(0); 4682552f7358SJed Brown } 4683552f7358SJed Brown 4684552f7358SJed Brown #undef __FUNCT__ 4685a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 46861a271a75SMatthew 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[]) 4687a5e93ea8SMatthew G. Knepley { 4688a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4689a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4690a5e93ea8SMatthew G. Knepley PetscScalar *a; 4691a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4692a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4693a5e93ea8SMatthew G. Knepley 4694a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4695a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4696a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4697a5e93ea8SMatthew G. Knepley a = &array[off]; 4698a5e93ea8SMatthew G. Knepley if (cdof) { 4699a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4700a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4701a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4702a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4703a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4704a5e93ea8SMatthew G. Knepley ++cind; 4705a5e93ea8SMatthew G. Knepley } 4706a5e93ea8SMatthew G. Knepley } 4707a5e93ea8SMatthew G. Knepley } else { 4708a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4709a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4710a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4711a5e93ea8SMatthew G. Knepley ++cind; 4712a5e93ea8SMatthew G. Knepley } 4713a5e93ea8SMatthew G. Knepley } 4714a5e93ea8SMatthew G. Knepley } 4715a5e93ea8SMatthew G. Knepley } 4716a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4717a5e93ea8SMatthew G. Knepley } 4718a5e93ea8SMatthew G. Knepley 4719a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4720552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47211a271a75SMatthew 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[]) 4722a6dfd86eSKarl Rupp { 4723552f7358SJed Brown PetscScalar *a; 47241a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47251a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47261a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4727552f7358SJed Brown PetscErrorCode ierr; 4728552f7358SJed Brown 4729552f7358SJed Brown PetscFunctionBegin; 4730552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4731552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47321a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47331a271a75SMatthew G. Knepley a = &array[foff]; 4734552f7358SJed Brown if (!fcdof || setBC) { 47351a271a75SMatthew G. Knepley if (o >= 0) { 47361a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4737552f7358SJed Brown } else { 4738552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4739552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47401a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4741552f7358SJed Brown } 4742552f7358SJed Brown } 4743552f7358SJed Brown } 4744552f7358SJed Brown } else { 4745552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47461a271a75SMatthew G. Knepley if (o >= 0) { 4747552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4748552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47491a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4750552f7358SJed Brown } 4751552f7358SJed Brown } else { 4752552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4753552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4754552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 47551a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4756552f7358SJed Brown } 4757552f7358SJed Brown } 4758552f7358SJed Brown } 4759552f7358SJed Brown } 47601a271a75SMatthew G. Knepley *offset += fdof; 4761552f7358SJed Brown PetscFunctionReturn(0); 4762552f7358SJed Brown } 4763552f7358SJed Brown 4764552f7358SJed Brown #undef __FUNCT__ 4765a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 47661a271a75SMatthew 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[]) 4767a5e93ea8SMatthew G. Knepley { 4768a5e93ea8SMatthew G. Knepley PetscScalar *a; 47691a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47701a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47711a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4772a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4773a5e93ea8SMatthew G. Knepley 4774a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4775a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4776a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47771a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47781a271a75SMatthew G. Knepley a = &array[foff]; 4779a5e93ea8SMatthew G. Knepley if (fcdof) { 4780a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47811a271a75SMatthew G. Knepley if (o >= 0) { 4782a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4783a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 47841a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4785a5e93ea8SMatthew G. Knepley ++cind; 4786a5e93ea8SMatthew G. Knepley } 4787a5e93ea8SMatthew G. Knepley } 4788a5e93ea8SMatthew G. Knepley } else { 4789a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4790a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4791a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 47921a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4793a5e93ea8SMatthew G. Knepley ++cind; 4794a5e93ea8SMatthew G. Knepley } 4795a5e93ea8SMatthew G. Knepley } 4796a5e93ea8SMatthew G. Knepley } 4797a5e93ea8SMatthew G. Knepley } 4798a5e93ea8SMatthew G. Knepley } 47991a271a75SMatthew G. Knepley *offset += fdof; 4800a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4801a5e93ea8SMatthew G. Knepley } 4802a5e93ea8SMatthew G. Knepley 4803a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48041b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48051a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4806a6dfd86eSKarl Rupp { 4807552f7358SJed Brown PetscScalar *array; 48081b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48091b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4810552f7358SJed Brown PetscErrorCode ierr; 4811552f7358SJed Brown 48121b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4813b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4814b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4815b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4816b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4817b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4818b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4819b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4820b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4821b6ebb6e6SMatthew G. Knepley 4822b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4823b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4824b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4825b6ebb6e6SMatthew G. Knepley { 4826b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4827b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4828b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4829b6ebb6e6SMatthew G. Knepley 4830b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4831b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4832b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4833b6ebb6e6SMatthew G. Knepley if (!cdof) { 4834b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4835b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4836b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4837b6ebb6e6SMatthew G. Knepley } 4838b6ebb6e6SMatthew G. Knepley } else { 4839b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4840b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4841b6ebb6e6SMatthew G. Knepley } 4842b6ebb6e6SMatthew G. Knepley } 4843b6ebb6e6SMatthew G. Knepley } else { 4844b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4845b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4846b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4847b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4848b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4849b6ebb6e6SMatthew G. Knepley } 4850b6ebb6e6SMatthew G. Knepley } else { 4851b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4852b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4853b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4854b6ebb6e6SMatthew G. Knepley } 4855b6ebb6e6SMatthew G. Knepley } 4856b6ebb6e6SMatthew G. Knepley } 4857b6ebb6e6SMatthew G. Knepley } 4858b6ebb6e6SMatthew G. Knepley } 4859b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4860b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4861b6ebb6e6SMatthew G. Knepley } 48621b406b76SMatthew G. Knepley 48631b406b76SMatthew G. Knepley #undef __FUNCT__ 48641b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 48651b406b76SMatthew G. Knepley /*@C 48661b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 48671b406b76SMatthew G. Knepley 48681b406b76SMatthew G. Knepley Not collective 48691b406b76SMatthew G. Knepley 48701b406b76SMatthew G. Knepley Input Parameters: 48711b406b76SMatthew G. Knepley + dm - The DM 48721b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 48731b406b76SMatthew G. Knepley . v - The local vector 48741b406b76SMatthew G. Knepley . point - The sieve point in the DM 48751b406b76SMatthew G. Knepley . values - The array of values 48761b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 48771b406b76SMatthew G. Knepley 48781b406b76SMatthew G. Knepley Fortran Notes: 48791b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 48801b406b76SMatthew G. Knepley 48811b406b76SMatthew G. Knepley Level: intermediate 48821b406b76SMatthew G. Knepley 48831b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 48841b406b76SMatthew G. Knepley @*/ 48851b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 48861b406b76SMatthew G. Knepley { 48871b406b76SMatthew G. Knepley PetscSection clSection; 48881b406b76SMatthew G. Knepley IS clPoints; 48891b406b76SMatthew G. Knepley PetscScalar *array; 48901b406b76SMatthew G. Knepley PetscInt *points = NULL; 48911b406b76SMatthew G. Knepley const PetscInt *clp; 48921a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 48931b406b76SMatthew G. Knepley PetscErrorCode ierr; 48941b406b76SMatthew G. Knepley 48951a271a75SMatthew G. Knepley PetscFunctionBeginHot; 48961b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 48971b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 48981a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 48991a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 49001b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49011b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49021b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 49031a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49041b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49051b406b76SMatthew G. Knepley } 49061a271a75SMatthew G. Knepley /* Get points */ 49071b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49081b406b76SMatthew G. Knepley if (!clPoints) { 49091a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49101a271a75SMatthew G. Knepley 49111a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4912552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4913552f7358SJed Brown /* Compress out points not in the section */ 4914552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4915552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4916552f7358SJed Brown points[q*2] = points[p]; 4917552f7358SJed Brown points[q*2+1] = points[p+1]; 4918552f7358SJed Brown ++q; 4919552f7358SJed Brown } 4920552f7358SJed Brown } 4921552f7358SJed Brown numPoints = q; 49221b406b76SMatthew G. Knepley } else { 49231b406b76SMatthew G. Knepley PetscInt dof, off; 4924552f7358SJed Brown 49251b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49261b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49271b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49281a271a75SMatthew G. Knepley numPoints = dof/2; 49291b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4930552f7358SJed Brown } 49311a271a75SMatthew G. Knepley /* Get array */ 4932552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49331a271a75SMatthew G. Knepley /* Get values */ 4934ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49351a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4936552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49371a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4938552f7358SJed Brown switch (mode) { 4939552f7358SJed Brown case INSERT_VALUES: 4940552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49411a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49421a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49431a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4944552f7358SJed Brown } break; 4945552f7358SJed Brown case INSERT_ALL_VALUES: 4946552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49471a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49481a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49491a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4950552f7358SJed Brown } break; 4951a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4952a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 49531a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49541a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49551a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4956a5e93ea8SMatthew G. Knepley } break; 4957552f7358SJed Brown case ADD_VALUES: 4958552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49591a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49601a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49611a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4962552f7358SJed Brown } break; 4963552f7358SJed Brown case ADD_ALL_VALUES: 4964552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49651a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49661a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49671a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 4968552f7358SJed Brown } break; 4969552f7358SJed Brown default: 497082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4971552f7358SJed Brown } 49721a271a75SMatthew G. Knepley } 4973552f7358SJed Brown } else { 49741a271a75SMatthew G. Knepley PetscInt dof, off; 49751a271a75SMatthew G. Knepley 4976552f7358SJed Brown switch (mode) { 4977552f7358SJed Brown case INSERT_VALUES: 4978552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4979552f7358SJed Brown PetscInt o = points[p+1]; 4980552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4981552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 4982552f7358SJed Brown } break; 4983552f7358SJed Brown case INSERT_ALL_VALUES: 4984552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4985552f7358SJed Brown PetscInt o = points[p+1]; 4986552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4987552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 4988552f7358SJed Brown } break; 4989a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4990a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4991a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 4992a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4993a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 4994a5e93ea8SMatthew G. Knepley } break; 4995552f7358SJed Brown case ADD_VALUES: 4996552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4997552f7358SJed Brown PetscInt o = points[p+1]; 4998552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4999552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5000552f7358SJed Brown } break; 5001552f7358SJed Brown case ADD_ALL_VALUES: 5002552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5003552f7358SJed Brown PetscInt o = points[p+1]; 5004552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5005552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5006552f7358SJed Brown } break; 5007552f7358SJed Brown default: 500882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5009552f7358SJed Brown } 5010552f7358SJed Brown } 50111a271a75SMatthew G. Knepley /* Cleanup points */ 50121a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50131a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50141a271a75SMatthew G. Knepley /* Cleanup array */ 5015552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5016552f7358SJed Brown PetscFunctionReturn(0); 5017552f7358SJed Brown } 5018552f7358SJed Brown 5019552f7358SJed Brown #undef __FUNCT__ 5020e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5021e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5022e07394fbSMatthew G. Knepley { 5023e07394fbSMatthew G. Knepley PetscSection clSection; 5024e07394fbSMatthew G. Knepley IS clPoints; 5025e07394fbSMatthew G. Knepley PetscScalar *array; 5026e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5027e07394fbSMatthew G. Knepley const PetscInt *clp; 5028e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5029e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5030e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5031e07394fbSMatthew G. Knepley 5032e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5033e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5034e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5035e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5036e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5037e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5038e07394fbSMatthew G. Knepley /* Get points */ 5039e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5040e07394fbSMatthew G. Knepley if (!clPoints) { 5041e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5042e07394fbSMatthew G. Knepley 5043e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5044e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5045e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5046e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5047e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5048e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5049e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5050e07394fbSMatthew G. Knepley ++q; 5051e07394fbSMatthew G. Knepley } 5052e07394fbSMatthew G. Knepley } 5053e07394fbSMatthew G. Knepley numPoints = q; 5054e07394fbSMatthew G. Knepley } else { 5055e07394fbSMatthew G. Knepley PetscInt dof, off; 5056e07394fbSMatthew G. Knepley 5057e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5058e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5059e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5060e07394fbSMatthew G. Knepley numPoints = dof/2; 5061e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5062e07394fbSMatthew G. Knepley } 5063e07394fbSMatthew G. Knepley /* Get array */ 5064e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5065e07394fbSMatthew G. Knepley /* Get values */ 5066e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5067e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5068e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5069e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5070e07394fbSMatthew G. Knepley PetscInt fdof; 5071e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5072e07394fbSMatthew G. Knepley offset += fdof; 5073e07394fbSMatthew G. Knepley } 5074e07394fbSMatthew G. Knepley continue; 5075e07394fbSMatthew G. Knepley } 5076e07394fbSMatthew G. Knepley switch (mode) { 5077e07394fbSMatthew G. Knepley case INSERT_VALUES: 5078e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5079e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5080e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5081e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5082e07394fbSMatthew G. Knepley } break; 5083e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5084e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5085e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5086e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5087e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5088e07394fbSMatthew G. Knepley } break; 5089e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5090e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5091e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5092e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5093e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5094e07394fbSMatthew G. Knepley } break; 5095e07394fbSMatthew G. Knepley case ADD_VALUES: 5096e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5097e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5098e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5099e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5100e07394fbSMatthew G. Knepley } break; 5101e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5102e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5103e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5104e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5105e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5106e07394fbSMatthew G. Knepley } break; 5107e07394fbSMatthew G. Knepley default: 5108e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5109e07394fbSMatthew G. Knepley } 5110e07394fbSMatthew G. Knepley } 5111e07394fbSMatthew G. Knepley /* Cleanup points */ 5112e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5113e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5114e07394fbSMatthew G. Knepley /* Cleanup array */ 5115e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5116e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5117e07394fbSMatthew G. Knepley } 5118e07394fbSMatthew G. Knepley 5119e07394fbSMatthew G. Knepley #undef __FUNCT__ 5120552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5121b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5122552f7358SJed Brown { 5123552f7358SJed Brown PetscMPIInt rank; 5124552f7358SJed Brown PetscInt i, j; 5125552f7358SJed Brown PetscErrorCode ierr; 5126552f7358SJed Brown 5127552f7358SJed Brown PetscFunctionBegin; 512882f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 512977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5130b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5131b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5132b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5133b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 513477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5135b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5136519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51377eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5138552f7358SJed Brown #else 5139b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5140552f7358SJed Brown #endif 5141552f7358SJed Brown } 514277a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5143552f7358SJed Brown } 5144552f7358SJed Brown PetscFunctionReturn(0); 5145552f7358SJed Brown } 5146552f7358SJed Brown 5147552f7358SJed Brown #undef __FUNCT__ 5148552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5149552f7358SJed Brown /* . off - The global offset of this point */ 5150e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5151a6dfd86eSKarl Rupp { 5152e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5153552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5154552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5155552f7358SJed Brown PetscInt cind = 0, k; 5156552f7358SJed Brown PetscErrorCode ierr; 5157552f7358SJed Brown 5158552f7358SJed Brown PetscFunctionBegin; 5159552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5160552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5161552f7358SJed Brown if (!cdof || setBC) { 5162552f7358SJed Brown if (orientation >= 0) { 5163e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5164552f7358SJed Brown } else { 5165e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5166552f7358SJed Brown } 5167552f7358SJed Brown } else { 5168552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5169552f7358SJed Brown if (orientation >= 0) { 5170552f7358SJed Brown for (k = 0; k < dof; ++k) { 5171552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5172552f7358SJed Brown /* Insert check for returning constrained indices */ 5173e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5174552f7358SJed Brown ++cind; 5175552f7358SJed Brown } else { 5176e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5177552f7358SJed Brown } 5178552f7358SJed Brown } 5179552f7358SJed Brown } else { 5180552f7358SJed Brown for (k = 0; k < dof; ++k) { 5181552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5182552f7358SJed Brown /* Insert check for returning constrained indices */ 5183e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5184552f7358SJed Brown ++cind; 5185552f7358SJed Brown } else { 5186e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5187552f7358SJed Brown } 5188552f7358SJed Brown } 5189552f7358SJed Brown } 5190552f7358SJed Brown } 5191e6ccafaeSMatthew G Knepley *loff += dof; 5192552f7358SJed Brown PetscFunctionReturn(0); 5193552f7358SJed Brown } 5194552f7358SJed Brown 5195552f7358SJed Brown #undef __FUNCT__ 5196552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5197552f7358SJed Brown /* . off - The global offset of this point */ 5198a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5199a6dfd86eSKarl Rupp { 5200552f7358SJed Brown PetscInt numFields, foff, f; 5201552f7358SJed Brown PetscErrorCode ierr; 5202552f7358SJed Brown 5203552f7358SJed Brown PetscFunctionBegin; 5204552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5205552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5206552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5207552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5208552f7358SJed Brown PetscInt cind = 0, k, c; 5209552f7358SJed Brown 5210552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5211552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5212552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5213552f7358SJed Brown if (!cfdof || setBC) { 5214552f7358SJed Brown if (orientation >= 0) { 52150d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5216552f7358SJed Brown } else { 5217552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5218552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5219552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5220552f7358SJed Brown } 5221552f7358SJed Brown } 5222552f7358SJed Brown } 5223552f7358SJed Brown } else { 5224552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5225552f7358SJed Brown if (orientation >= 0) { 5226552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5227552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5228552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5229552f7358SJed Brown ++cind; 5230552f7358SJed Brown } else { 5231552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5232552f7358SJed Brown } 5233552f7358SJed Brown } 5234552f7358SJed Brown } else { 5235552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5236552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5237552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5238552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5239552f7358SJed Brown ++cind; 5240552f7358SJed Brown } else { 5241552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5242552f7358SJed Brown } 5243552f7358SJed Brown } 5244552f7358SJed Brown } 5245552f7358SJed Brown } 5246552f7358SJed Brown } 5247552f7358SJed Brown foff += fdof - cfdof; 5248552f7358SJed Brown foffs[f] += fdof; 5249552f7358SJed Brown } 5250552f7358SJed Brown PetscFunctionReturn(0); 5251552f7358SJed Brown } 5252552f7358SJed Brown 5253552f7358SJed Brown #undef __FUNCT__ 5254552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 52557f5d1fdeSMatthew G. Knepley /*@C 52567f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 52577f5d1fdeSMatthew G. Knepley 52587f5d1fdeSMatthew G. Knepley Not collective 52597f5d1fdeSMatthew G. Knepley 52607f5d1fdeSMatthew G. Knepley Input Parameters: 52617f5d1fdeSMatthew G. Knepley + dm - The DM 5262ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5263ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 52647f5d1fdeSMatthew G. Knepley . A - The matrix 52657f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 52667f5d1fdeSMatthew G. Knepley . values - The array of values 52677f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 52687f5d1fdeSMatthew G. Knepley 52697f5d1fdeSMatthew G. Knepley Fortran Notes: 52707f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 52717f5d1fdeSMatthew G. Knepley 52727f5d1fdeSMatthew G. Knepley Level: intermediate 52737f5d1fdeSMatthew G. Knepley 52747f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 52757f5d1fdeSMatthew G. Knepley @*/ 52767c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5277552f7358SJed Brown { 5278552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 52791b406b76SMatthew G. Knepley PetscSection clSection; 52801b406b76SMatthew G. Knepley IS clPoints; 52810298fd71SBarry Smith PetscInt *points = NULL; 52821b406b76SMatthew G. Knepley const PetscInt *clp; 5283552f7358SJed Brown PetscInt *indices; 5284552f7358SJed Brown PetscInt offsets[32]; 5285552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5286552f7358SJed Brown PetscErrorCode ierr; 5287552f7358SJed Brown 5288552f7358SJed Brown PetscFunctionBegin; 5289552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5290ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 52913dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5292ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 52933dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 52943dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5295552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 529682f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5297552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 52981b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 52991b406b76SMatthew G. Knepley if (!clPoints) { 5300552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5301552f7358SJed Brown /* Compress out points not in the section */ 5302552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5303552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5304552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5305552f7358SJed Brown points[q*2] = points[p]; 5306552f7358SJed Brown points[q*2+1] = points[p+1]; 5307552f7358SJed Brown ++q; 5308552f7358SJed Brown } 5309552f7358SJed Brown } 5310552f7358SJed Brown numPoints = q; 53111b406b76SMatthew G. Knepley } else { 53121b406b76SMatthew G. Knepley PetscInt dof, off; 53131b406b76SMatthew G. Knepley 53141b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 53151b406b76SMatthew G. Knepley numPoints = dof/2; 53161b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 53171b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53181b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 53191b406b76SMatthew G. Knepley } 5320552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5321552f7358SJed Brown PetscInt fdof; 5322552f7358SJed Brown 5323552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5324552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5325552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5326552f7358SJed Brown offsets[f+1] += fdof; 5327552f7358SJed Brown } 5328552f7358SJed Brown numIndices += dof; 5329552f7358SJed Brown } 53300d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 53310d644c17SKarl Rupp 533282f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5333552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5334552f7358SJed Brown if (numFields) { 5335552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5336552f7358SJed Brown PetscInt o = points[p+1]; 5337552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5338552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5339552f7358SJed Brown } 5340552f7358SJed Brown } else { 5341e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5342552f7358SJed Brown PetscInt o = points[p+1]; 5343552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5344e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5345552f7358SJed Brown } 5346552f7358SJed Brown } 5347b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5348552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5349552f7358SJed Brown if (ierr) { 5350552f7358SJed Brown PetscMPIInt rank; 5351552f7358SJed Brown PetscErrorCode ierr2; 5352552f7358SJed Brown 535382f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 535477a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5355b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 53566a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5357552f7358SJed Brown CHKERRQ(ierr); 5358552f7358SJed Brown } 53591b406b76SMatthew G. Knepley if (!clPoints) { 5360552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 53611b406b76SMatthew G. Knepley } else { 53621b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 53631b406b76SMatthew G. Knepley } 5364552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5365552f7358SJed Brown PetscFunctionReturn(0); 5366552f7358SJed Brown } 5367552f7358SJed Brown 5368552f7358SJed Brown #undef __FUNCT__ 5369de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5370de41b84cSMatthew 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) 5371de41b84cSMatthew G. Knepley { 5372de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5373de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5374de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5375de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5376de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5377de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 53784ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5379de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5380de41b84cSMatthew G. Knepley 5381de41b84cSMatthew G. Knepley PetscFunctionBegin; 5382de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5383de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5384de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5385de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5386de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5387de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5388de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5389de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5390de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5391de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5392de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5393de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5394de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5395de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5396de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5397de41b84cSMatthew G. Knepley /* Column indices */ 5398de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 53994ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5400de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5401de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5402de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5403de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5404de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5405de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5406de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5407de41b84cSMatthew G. Knepley ++q; 5408de41b84cSMatthew G. Knepley } 5409de41b84cSMatthew G. Knepley } 5410de41b84cSMatthew G. Knepley numCPoints = q; 5411de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5412de41b84cSMatthew G. Knepley PetscInt fdof; 5413de41b84cSMatthew G. Knepley 5414de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 54154ca5e9f5SMatthew G. Knepley if (!dof) continue; 5416de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5417de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5418de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5419de41b84cSMatthew G. Knepley } 5420de41b84cSMatthew G. Knepley numCIndices += dof; 5421de41b84cSMatthew G. Knepley } 5422de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5423de41b84cSMatthew G. Knepley /* Row indices */ 5424de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5425de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 54261ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5427de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5428de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5429de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5430de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5431de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5432de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5433de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 54344ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 54354ca5e9f5SMatthew G. Knepley if (!dof) continue; 54364ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 54374ca5e9f5SMatthew G. Knepley if (s < q) continue; 5438de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5439de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5440de41b84cSMatthew G. Knepley ++q; 5441de41b84cSMatthew G. Knepley } 5442de41b84cSMatthew G. Knepley } 5443de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5444de41b84cSMatthew G. Knepley } 5445de41b84cSMatthew G. Knepley numFPoints = q; 5446de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5447de41b84cSMatthew G. Knepley PetscInt fdof; 5448de41b84cSMatthew G. Knepley 5449de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 54504ca5e9f5SMatthew G. Knepley if (!dof) continue; 5451de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5452de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5453de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5454de41b84cSMatthew G. Knepley } 5455de41b84cSMatthew G. Knepley numFIndices += dof; 5456de41b84cSMatthew G. Knepley } 5457de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5458de41b84cSMatthew G. Knepley 5459de41b84cSMatthew 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); 5460de41b84cSMatthew 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); 5461de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5462de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5463de41b84cSMatthew G. Knepley if (numFields) { 5464de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5465de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5466de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5467de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5468de41b84cSMatthew G. Knepley } 5469de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5470de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5471de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5472de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5473de41b84cSMatthew G. Knepley } 5474de41b84cSMatthew G. Knepley } else { 5475de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5476de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5477de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5478de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5479de41b84cSMatthew G. Knepley } 5480de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5481de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5482de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5483de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5484de41b84cSMatthew G. Knepley } 5485de41b84cSMatthew G. Knepley } 5486de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5487de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5488de41b84cSMatthew G. Knepley if (ierr) { 5489de41b84cSMatthew G. Knepley PetscMPIInt rank; 5490de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5491de41b84cSMatthew G. Knepley 5492de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5493de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5494de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5495de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5496de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5497de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5498de41b84cSMatthew G. Knepley } 5499549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5500de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5501de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5502de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5503de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5504de41b84cSMatthew G. Knepley } 5505de41b84cSMatthew G. Knepley 5506de41b84cSMatthew G. Knepley #undef __FUNCT__ 55077c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 55087c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 55097c927364SMatthew G. Knepley { 55107c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 55117c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 55127c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 55137c927364SMatthew G. Knepley CellRefiner cellRefiner; 55147c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 55157c927364SMatthew G. Knepley PetscErrorCode ierr; 55167c927364SMatthew G. Knepley 55177c927364SMatthew G. Knepley PetscFunctionBegin; 55187c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 55197c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 55207c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 55217c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 55227c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 55237c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 55247c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 55257c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 55267c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 55277c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 55287c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 55297c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 55307c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55317c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55327c927364SMatthew G. Knepley /* Column indices */ 55337c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 55347c927364SMatthew G. Knepley maxFPoints = numCPoints; 55357c927364SMatthew G. Knepley /* Compress out points not in the section */ 55367c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 55377c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 55387c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 55397c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 55407c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 55417c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 55427c927364SMatthew G. Knepley ++q; 55437c927364SMatthew G. Knepley } 55447c927364SMatthew G. Knepley } 55457c927364SMatthew G. Knepley numCPoints = q; 55467c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 55477c927364SMatthew G. Knepley PetscInt fdof; 55487c927364SMatthew G. Knepley 55497c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 55507c927364SMatthew G. Knepley if (!dof) continue; 55517c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55527c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 55537c927364SMatthew G. Knepley coffsets[f+1] += fdof; 55547c927364SMatthew G. Knepley } 55557c927364SMatthew G. Knepley numCIndices += dof; 55567c927364SMatthew G. Knepley } 55577c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 55587c927364SMatthew G. Knepley /* Row indices */ 55597c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 55607c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 55617c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 55627c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 55637c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 55647c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55657c927364SMatthew G. Knepley /* Compress out points not in the section */ 55667c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 55677c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 55687c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 55697c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 55707c927364SMatthew G. Knepley if (!dof) continue; 55717c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 55727c927364SMatthew G. Knepley if (s < q) continue; 55737c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 55747c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 55757c927364SMatthew G. Knepley ++q; 55767c927364SMatthew G. Knepley } 55777c927364SMatthew G. Knepley } 55787c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55797c927364SMatthew G. Knepley } 55807c927364SMatthew G. Knepley numFPoints = q; 55817c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 55827c927364SMatthew G. Knepley PetscInt fdof; 55837c927364SMatthew G. Knepley 55847c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 55857c927364SMatthew G. Knepley if (!dof) continue; 55867c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55877c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 55887c927364SMatthew G. Knepley foffsets[f+1] += fdof; 55897c927364SMatthew G. Knepley } 55907c927364SMatthew G. Knepley numFIndices += dof; 55917c927364SMatthew G. Knepley } 55927c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 55937c927364SMatthew G. Knepley 55947c927364SMatthew 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); 55957c927364SMatthew 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); 55967c927364SMatthew G. Knepley if (numFields) { 55977c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 55987c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 55997c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56007c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 56017c927364SMatthew G. Knepley } 56027c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 56037c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56047c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56057c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 56067c927364SMatthew G. Knepley } 56077c927364SMatthew G. Knepley } else { 56087c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 56097c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56107c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56117c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 56127c927364SMatthew G. Knepley } 56137c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 56147c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56157c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56167c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 56177c927364SMatthew G. Knepley } 56187c927364SMatthew G. Knepley } 56197c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 56207c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 56217c927364SMatthew G. Knepley PetscFunctionReturn(0); 56227c927364SMatthew G. Knepley } 56237c927364SMatthew G. Knepley 56247c927364SMatthew G. Knepley #undef __FUNCT__ 5625770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5626f96281f8SMatthew G. Knepley /*@ 5627f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5628f96281f8SMatthew G. Knepley 5629f96281f8SMatthew G. Knepley Input Parameter: 5630f96281f8SMatthew G. Knepley . dm - The DMPlex object 5631f96281f8SMatthew G. Knepley 5632f96281f8SMatthew G. Knepley Output Parameters: 5633f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5634dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5635dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5636dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5637f96281f8SMatthew G. Knepley 5638f96281f8SMatthew G. Knepley Level: developer 5639f96281f8SMatthew G. Knepley 5640dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 5641f96281f8SMatthew G. Knepley @*/ 5642770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5643552f7358SJed Brown { 5644552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5645770b213bSMatthew G Knepley PetscInt dim; 5646770b213bSMatthew G Knepley PetscErrorCode ierr; 5647552f7358SJed Brown 5648552f7358SJed Brown PetscFunctionBegin; 5649552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5650c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5651770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5652770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5653770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5654770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5655552f7358SJed Brown PetscFunctionReturn(0); 5656552f7358SJed Brown } 5657552f7358SJed Brown 5658552f7358SJed Brown #undef __FUNCT__ 5659770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5660dc5a3409SMatthew G. Knepley /*@ 5661dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5662dc5a3409SMatthew G. Knepley 5663dc5a3409SMatthew G. Knepley Input Parameters: 5664dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5665dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5666dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5667dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5668dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5669dc5a3409SMatthew G. Knepley 5670dc5a3409SMatthew G. Knepley Level: developer 5671dc5a3409SMatthew G. Knepley 5672dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5673dc5a3409SMatthew G. Knepley @*/ 5674770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5675552f7358SJed Brown { 5676552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5677770b213bSMatthew G Knepley PetscInt dim; 5678770b213bSMatthew G Knepley PetscErrorCode ierr; 5679552f7358SJed Brown 5680552f7358SJed Brown PetscFunctionBegin; 5681552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5682c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5683770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5684770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5685770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5686770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5687552f7358SJed Brown PetscFunctionReturn(0); 5688552f7358SJed Brown } 5689552f7358SJed Brown 5690552f7358SJed Brown #undef __FUNCT__ 5691552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5692552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5693552f7358SJed Brown { 5694552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5695552f7358SJed Brown 5696552f7358SJed Brown PetscFunctionBegin; 5697552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5698552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5699552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5700552f7358SJed Brown PetscFunctionReturn(0); 5701552f7358SJed Brown } 5702552f7358SJed Brown 5703552f7358SJed Brown #undef __FUNCT__ 5704552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5705552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5706552f7358SJed Brown { 5707552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5708552f7358SJed Brown 5709552f7358SJed Brown PetscFunctionBegin; 5710552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5711552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5712552f7358SJed Brown PetscFunctionReturn(0); 5713552f7358SJed Brown } 5714552f7358SJed Brown 5715552f7358SJed Brown #undef __FUNCT__ 5716552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5717552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5718ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5719552f7358SJed Brown { 5720552f7358SJed Brown PetscSection section, globalSection; 5721552f7358SJed Brown PetscInt *numbers, p; 5722552f7358SJed Brown PetscErrorCode ierr; 5723552f7358SJed Brown 5724552f7358SJed Brown PetscFunctionBegin; 572582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5726552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5727552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5728552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5729552f7358SJed Brown } 5730552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5731552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5732785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5733552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5734552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5735ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5736ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5737552f7358SJed Brown } 573882f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5739ef48cebcSMatthew G. Knepley if (globalSize) { 5740ef48cebcSMatthew G. Knepley PetscLayout layout; 5741ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5742ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5743ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5744ef48cebcSMatthew G. Knepley } 5745552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5746552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5747552f7358SJed Brown PetscFunctionReturn(0); 5748552f7358SJed Brown } 5749552f7358SJed Brown 5750552f7358SJed Brown #undef __FUNCT__ 5751552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5752552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5753552f7358SJed Brown { 5754552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5755552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5756552f7358SJed Brown PetscErrorCode ierr; 5757552f7358SJed Brown 5758552f7358SJed Brown PetscFunctionBegin; 5759552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5760552f7358SJed Brown if (!mesh->globalCellNumbers) { 5761552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5762552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 57630298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 57640d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5765ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5766552f7358SJed Brown } 5767552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5768552f7358SJed Brown PetscFunctionReturn(0); 5769552f7358SJed Brown } 5770552f7358SJed Brown 5771552f7358SJed Brown #undef __FUNCT__ 5772552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5773552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5774552f7358SJed Brown { 5775552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5776552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5777552f7358SJed Brown PetscErrorCode ierr; 5778552f7358SJed Brown 5779552f7358SJed Brown PetscFunctionBegin; 5780552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5781552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5782552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 57830298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 57840d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5785ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5786552f7358SJed Brown } 5787552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5788552f7358SJed Brown PetscFunctionReturn(0); 5789552f7358SJed Brown } 5790552f7358SJed Brown 5791ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5792ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5793ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5794ef48cebcSMatthew G. Knepley { 5795ef48cebcSMatthew G. Knepley IS nums[4]; 5796ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5797ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5798ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5799ef48cebcSMatthew G. Knepley 5800ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5801ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5802ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5803ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5804ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5805ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5806ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5807ef48cebcSMatthew G. Knepley 5808ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5809ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5810ef48cebcSMatthew G. Knepley shift += gsize; 5811ef48cebcSMatthew G. Knepley } 5812ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5813ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5814ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5815ef48cebcSMatthew G. Knepley } 5816ef48cebcSMatthew G. Knepley 5817552f7358SJed Brown 5818552f7358SJed Brown #undef __FUNCT__ 5819552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5820552f7358SJed Brown /*@C 5821552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5822552f7358SJed Brown the local section and an SF describing the section point overlap. 5823552f7358SJed Brown 5824552f7358SJed Brown Input Parameters: 5825552f7358SJed Brown + s - The PetscSection for the local field layout 5826552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5827552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5828552f7358SJed Brown . label - The label specifying the points 5829552f7358SJed Brown - labelValue - The label stratum specifying the points 5830552f7358SJed Brown 5831552f7358SJed Brown Output Parameter: 5832552f7358SJed Brown . gsection - The PetscSection for the global field layout 5833552f7358SJed Brown 5834552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5835552f7358SJed Brown 5836552f7358SJed Brown Level: developer 5837552f7358SJed Brown 5838552f7358SJed Brown .seealso: PetscSectionCreate() 5839552f7358SJed Brown @*/ 5840552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5841552f7358SJed Brown { 58427ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5843552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5844552f7358SJed Brown PetscErrorCode ierr; 5845552f7358SJed Brown 5846552f7358SJed Brown PetscFunctionBegin; 58474c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5848552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5849552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 58507ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 58517ec39499SMatthew G. Knepley if (nroots >= 0) { 58527ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 58531795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 58547ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 58551795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 58567ec39499SMatthew G. Knepley } else { 58577ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 58587ec39499SMatthew G. Knepley } 58597ec39499SMatthew G. Knepley } 5860552f7358SJed Brown /* Mark ghost points with negative dof */ 5861552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5862552f7358SJed Brown PetscInt value; 5863552f7358SJed Brown 5864552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5865552f7358SJed Brown if (value != labelValue) continue; 5866552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5867552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5868552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5869552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 58707ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5871552f7358SJed Brown } 5872552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5873552f7358SJed Brown if (nroots >= 0) { 58747ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 58757ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5876552f7358SJed Brown if (nroots > pEnd-pStart) { 58777ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5878552f7358SJed Brown } 5879552f7358SJed Brown } 5880552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5881552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5882552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5883552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5884552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5885552f7358SJed Brown } 58864c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5887552f7358SJed Brown globalOff -= off; 5888552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5889552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 58907ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5891552f7358SJed Brown } 5892552f7358SJed Brown /* Put in negative offsets for ghost points */ 5893552f7358SJed Brown if (nroots >= 0) { 58947ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 58957ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5896552f7358SJed Brown if (nroots > pEnd-pStart) { 58977ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5898552f7358SJed Brown } 5899552f7358SJed Brown } 59007ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5901552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5902552f7358SJed Brown PetscFunctionReturn(0); 5903552f7358SJed Brown } 5904ca8062c8SMatthew G. Knepley 5905ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5906ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5907ca8062c8SMatthew G. Knepley /*@ 5908ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5909ca8062c8SMatthew G. Knepley 5910ca8062c8SMatthew G. Knepley Input Parameters: 5911ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5912ca8062c8SMatthew G. Knepley 5913ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5914ca8062c8SMatthew G. Knepley 5915ca8062c8SMatthew G. Knepley Level: developer 5916ca8062c8SMatthew G. Knepley 59179bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5918ca8062c8SMatthew G. Knepley @*/ 5919ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5920ca8062c8SMatthew G. Knepley { 5921ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5922ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5923ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5924ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5925ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5926ca8062c8SMatthew G. Knepley 5927ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5928ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5929ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5930ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5931ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5932ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5933ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5934ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5935ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5936ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 593742e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 593842e66dfaSMatthew G. Knepley PetscInt d; 593942e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 594042e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 594142e66dfaSMatthew G. Knepley } 5942ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5943ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5944ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5945ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5946ca8062c8SMatthew G. Knepley } 594742e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5948ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5949ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5950ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5951ca8062c8SMatthew G. Knepley } 5952ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5953ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5954ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5955ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5956ca8062c8SMatthew G. Knepley } 5957ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 595842e66dfaSMatthew G. Knepley if (dup) { 595942e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 596042e66dfaSMatthew G. Knepley } else { 5961ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5962ca8062c8SMatthew G. Knepley } 5963ca8062c8SMatthew G. Knepley } 596442e66dfaSMatthew G. Knepley } 5965ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5966ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5967ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5968ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5969ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5970ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5971ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5972ca8062c8SMatthew G. Knepley } 5973ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5974ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5975ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5976ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5977ca8062c8SMatthew G. Knepley } 5978ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5979ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5980ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5981ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5982ca8062c8SMatthew G. Knepley } 5983ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5984ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5985ca8062c8SMatthew G. Knepley } 5986ca8062c8SMatthew G. Knepley } 5987ca8062c8SMatthew G. Knepley } 5988ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5989ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5990ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5991ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5992ca8062c8SMatthew G. Knepley } 5993ca8062c8SMatthew G. Knepley 5994ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5995ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5996ca8062c8SMatthew G. Knepley /*@ 5997ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5998ca8062c8SMatthew G. Knepley 5999ca8062c8SMatthew G. Knepley Input Parameters: 6000ca8062c8SMatthew G. Knepley + dm - The DMPlex object 600158723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 600258723a97SMatthew G. Knepley - cellHeight - Normally 0 6003ca8062c8SMatthew G. Knepley 6004ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6005ca8062c8SMatthew G. Knepley 6006ca8062c8SMatthew G. Knepley Level: developer 6007ca8062c8SMatthew G. Knepley 60089bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6009ca8062c8SMatthew G. Knepley @*/ 601058723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6011ca8062c8SMatthew G. Knepley { 601242363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6013ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6014ca8062c8SMatthew G. Knepley 6015ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6016ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6017c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6018ca8062c8SMatthew G. Knepley switch (dim) { 601942363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 602042363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 602142363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6022ca8062c8SMatthew G. Knepley default: 6023ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6024ca8062c8SMatthew G. Knepley } 602558723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 602658723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6027ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6028ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6029ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 603058723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 603158723a97SMatthew G. Knepley 603258723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 603358723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 603458723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 603558723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 603658723a97SMatthew G. Knepley } 603758723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6038ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6039ca8062c8SMatthew G. Knepley } 604042363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 604142363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 604242363296SMatthew G. Knepley 604342363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 604442363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 604542363296SMatthew G. Knepley const PetscInt p = closure[cl]; 604642363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 604742363296SMatthew G. Knepley } 604842363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 604942363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 605042363296SMatthew G. Knepley } 6051ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6052ca8062c8SMatthew G. Knepley } 60539bf0dad6SMatthew G. Knepley 60549bf0dad6SMatthew G. Knepley #undef __FUNCT__ 60559bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 60569bf0dad6SMatthew G. Knepley /*@ 60579bf0dad6SMatthew 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 60589bf0dad6SMatthew G. Knepley 60599bf0dad6SMatthew G. Knepley Input Parameters: 60609bf0dad6SMatthew G. Knepley + dm - The DMPlex object 60619bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 60629bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 60639bf0dad6SMatthew G. Knepley 60649bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 60659bf0dad6SMatthew G. Knepley 60669bf0dad6SMatthew G. Knepley Level: developer 60679bf0dad6SMatthew G. Knepley 60689bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 60699bf0dad6SMatthew G. Knepley @*/ 60709bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 60719bf0dad6SMatthew G. Knepley { 60723554e41dSMatthew G. Knepley PetscInt pMax[4]; 60733554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 60749bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 60759bf0dad6SMatthew G. Knepley 60769bf0dad6SMatthew G. Knepley PetscFunctionBegin; 60779bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6078c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 60799bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 608025abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 60813554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 60823554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 60833554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 60849bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 60859bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 60869bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 60879bf0dad6SMatthew G. Knepley 608825abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 60899bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 60909bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 60919bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 60929bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 60939bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 60949bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 60959bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 60969bf0dad6SMatthew G. Knepley } 60973554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 60989bf0dad6SMatthew 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); 60999bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 61009bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 61019bf0dad6SMatthew G. Knepley 61029bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61039bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 61049bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 61059bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 61069bf0dad6SMatthew G. Knepley } 6107e003ed69SMatthew 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); 61089bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6109e003ed69SMatthew 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]); 61109bf0dad6SMatthew G. Knepley } 61119bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61129bf0dad6SMatthew G. Knepley } 61139bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61149bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61159bf0dad6SMatthew G. Knepley } 61163554e41dSMatthew G. Knepley } 6117552f7358SJed Brown PetscFunctionReturn(0); 6118552f7358SJed Brown } 61193913d7c8SMatthew G. Knepley 61203913d7c8SMatthew G. Knepley #undef __FUNCT__ 6121bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6122bceba477SMatthew G. Knepley /* Pointwise interpolation 6123bceba477SMatthew G. Knepley Just code FEM for now 6124bceba477SMatthew G. Knepley u^f = I u^c 61254ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 61264ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 61274ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6128bceba477SMatthew G. Knepley */ 6129bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6130bceba477SMatthew G. Knepley { 6131bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6132bceba477SMatthew G. Knepley PetscInt m, n; 6133a063dac3SMatthew G. Knepley void *ctx; 6134bceba477SMatthew G. Knepley PetscErrorCode ierr; 6135bceba477SMatthew G. Knepley 6136bceba477SMatthew G. Knepley PetscFunctionBegin; 6137bceba477SMatthew G. Knepley /* 6138bceba477SMatthew G. Knepley Loop over coarse cells 6139bceba477SMatthew G. Knepley Loop over coarse basis functions 6140bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6141bceba477SMatthew G. Knepley Loop over fine dual basis functions 6142bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6143bceba477SMatthew G. Knepley Sum 6144bceba477SMatthew G. Knepley Update local element matrix 6145bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6146bceba477SMatthew G. Knepley 6147bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6148bceba477SMatthew G. Knepley */ 6149bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6150bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6151bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6152bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6153bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6154bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6155bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6156bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6157a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6158a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 61595d1c2e58SMatthew G. Knepley /* Use naive scaling */ 61605d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6161a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6162a063dac3SMatthew G. Knepley } 6163bceba477SMatthew G. Knepley 6164a063dac3SMatthew G. Knepley #undef __FUNCT__ 6165a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6166a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6167a063dac3SMatthew G. Knepley { 616890748bafSMatthew G. Knepley PetscErrorCode ierr; 616990748bafSMatthew G. Knepley 6170a063dac3SMatthew G. Knepley PetscFunctionBegin; 61717c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6172bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6173bceba477SMatthew G. Knepley } 6174bceba477SMatthew G. Knepley 6175bceba477SMatthew G. Knepley #undef __FUNCT__ 6176fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6177fd59a867SMatthew G. Knepley /* Pointwise interpolation 6178fd59a867SMatthew G. Knepley Just code FEM for now 6179fd59a867SMatthew G. Knepley u^f = I u^c 6180fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6181fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6182fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6183fd59a867SMatthew G. Knepley */ 6184fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6185fd59a867SMatthew G. Knepley { 6186fd59a867SMatthew G. Knepley PetscSection section; 6187fd59a867SMatthew G. Knepley IS *bcPoints; 6188286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6189286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6190fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6191fd59a867SMatthew G. Knepley 6192fd59a867SMatthew G. Knepley PetscFunctionBegin; 6193fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6194286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6195c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6196fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6197fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6198fd59a867SMatthew G. Knepley PetscBool isEssential; 619963d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6200fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6201fd59a867SMatthew G. Knepley } 6202fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6203fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6204fd59a867SMatthew G. Knepley const char *bdLabel; 6205fd59a867SMatthew G. Knepley DMLabel label; 6206fd59a867SMatthew G. Knepley const PetscInt *values; 62077391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6208c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6209fd59a867SMatthew G. Knepley 621063d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6211fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6212fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 62137391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 62147391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 62157391c1cbSMatthew G. Knepley const char *bdname; 62162f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 62177391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 62187391c1cbSMatthew G. Knepley if (duplicate) break; 62197391c1cbSMatthew G. Knepley } 62207391c1cbSMatthew G. Knepley if (!duplicate) { 6221fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 622232720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 62237391c1cbSMatthew G. Knepley } 622493a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6225fd59a867SMatthew G. Knepley if (isEssential) { 622693a5981aSMatthew G. Knepley IS tmp; 622793a5981aSMatthew G. Knepley PetscInt *newidx; 622893a5981aSMatthew G. Knepley const PetscInt *idx; 622993a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 623093a5981aSMatthew G. Knepley 6231fd59a867SMatthew G. Knepley bcFields[bc] = field; 623293a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 623393a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 623493a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 623593a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 623693a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 623793a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 623893a5981aSMatthew G. Knepley newn = 0; 623993a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 624093a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 624193a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 624293a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6243fd59a867SMatthew G. Knepley } 6244fd59a867SMatthew G. Knepley } 6245fd59a867SMatthew G. Knepley /* Handle discretization */ 6246fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6247286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6248fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6249fd59a867SMatthew G. Knepley PetscFE fe; 6250286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6251fd59a867SMatthew G. Knepley PetscInt d; 6252fd59a867SMatthew G. Knepley 625318abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6254fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6255286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6256286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6257fd59a867SMatthew G. Knepley } 6258286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6259286d8613SMatthew G. Knepley PetscInt d; 6260286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6261286d8613SMatthew 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."); 6262286d8613SMatthew G. Knepley } 6263286d8613SMatthew G. Knepley } 6264f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6265fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6266fd59a867SMatthew G. Knepley PetscFE fe; 6267fd59a867SMatthew G. Knepley const char *name; 626818abd763SMatthew G. Knepley 626918abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6270fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6271fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6272fd59a867SMatthew G. Knepley } 6273fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6274fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6275fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6276fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6277286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6278bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6279bceba477SMatthew G. Knepley } 6280bceba477SMatthew G. Knepley 6281bceba477SMatthew G. Knepley #undef __FUNCT__ 62823913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 62833913d7c8SMatthew G. Knepley /*@ 62843913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 62853913d7c8SMatthew G. Knepley 62863913d7c8SMatthew G. Knepley Input Parameter: 62873913d7c8SMatthew G. Knepley . dm - The DMPlex object 62883913d7c8SMatthew G. Knepley 62893913d7c8SMatthew G. Knepley Output Parameter: 62903913d7c8SMatthew G. Knepley . cdm - The coarse DM 62913913d7c8SMatthew G. Knepley 62923913d7c8SMatthew G. Knepley Level: intermediate 62933913d7c8SMatthew G. Knepley 62943913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 62953913d7c8SMatthew G. Knepley @*/ 62963913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 62973913d7c8SMatthew G. Knepley { 62983913d7c8SMatthew G. Knepley PetscFunctionBegin; 62993913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63003913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 63013913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 63023913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63033913d7c8SMatthew G. Knepley } 63043913d7c8SMatthew G. Knepley 63053913d7c8SMatthew G. Knepley #undef __FUNCT__ 63063913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 63073913d7c8SMatthew G. Knepley /*@ 63083913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 63093913d7c8SMatthew G. Knepley 63103913d7c8SMatthew G. Knepley Input Parameters: 63113913d7c8SMatthew G. Knepley + dm - The DMPlex object 63123913d7c8SMatthew G. Knepley - cdm - The coarse DM 63133913d7c8SMatthew G. Knepley 63143913d7c8SMatthew G. Knepley Level: intermediate 63153913d7c8SMatthew G. Knepley 63163913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 63173913d7c8SMatthew G. Knepley @*/ 63183913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 63193913d7c8SMatthew G. Knepley { 63203913d7c8SMatthew G. Knepley DM_Plex *mesh; 63213913d7c8SMatthew G. Knepley PetscErrorCode ierr; 63223913d7c8SMatthew G. Knepley 63233913d7c8SMatthew G. Knepley PetscFunctionBegin; 63243913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63253913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 63263913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 63273913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 63283913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 63293913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 63303913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63313913d7c8SMatthew G. Knepley } 6332