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\ 276*f738dd31SMatthew G. Knepley \\vbox{\n");CHKERRQ(ierr); 277*f738dd31SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%s for process ", name);CHKERRQ(ierr); 278770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 279770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 280770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 281770b213bSMatthew G Knepley } else if (p > 0) { 282770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 283770b213bSMatthew G Knepley } 284770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 285770b213bSMatthew G Knepley } 286770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 287*f738dd31SMatthew G. Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n", 8.0/scale);CHKERRQ(ierr); 288552f7358SJed Brown /* Plot vertices */ 289552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 290552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 291552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 292552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 293552f7358SJed Brown PetscInt off, dof, d; 294552f7358SJed Brown 295552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 296552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 297552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 298552f7358SJed Brown for (d = 0; d < dof; ++d) { 299552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3006712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 301552f7358SJed Brown } 302552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 303552f7358SJed Brown } 304552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 305552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 307552f7358SJed Brown /* Plot edges */ 308552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 309552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 310552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 311552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 312552f7358SJed Brown const PetscInt *cone; 313552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 314552f7358SJed Brown 315552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 31682f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 317552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 318552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 319552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 320552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 321552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 322552f7358SJed Brown for (d = 0; d < dof; ++d) { 323552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3246712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 325552f7358SJed Brown } 326552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 327552f7358SJed Brown } 328552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 329552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 330552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 331552f7358SJed Brown /* Plot cells */ 332552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 333552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3340298fd71SBarry Smith PetscInt *closure = NULL; 335552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 336552f7358SJed Brown 337552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 338552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 339552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 340552f7358SJed Brown const PetscInt point = closure[p]; 341552f7358SJed Brown 342552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 343552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 344552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 345552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 346552f7358SJed Brown } 347552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 348552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 349552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 350552f7358SJed Brown } 351552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 352*f738dd31SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n}\n");CHKERRQ(ierr); 353770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 354552f7358SJed Brown } else { 35582f516ccSBarry Smith MPI_Comm comm; 356834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 357834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 358552f7358SJed Brown PetscInt pStart, pEnd, p; 359a57dd577SMatthew G Knepley PetscInt numLabels, l; 3601143a3c0SMatthew G. Knepley const char *name; 361552f7358SJed Brown PetscMPIInt size; 362552f7358SJed Brown 36382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 364552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 365c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3665f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3671143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3681143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 369552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 370552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 371bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 372dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 373552f7358SJed Brown if (depth == 1) { 374552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 375552f7358SJed Brown pEnd = pEnd - pStart; 376552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 377552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 378552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 379552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 380552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 381552f7358SJed Brown pEnd = pEnd - pStart; 382552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 383552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 384552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 385552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 386552f7358SJed Brown } else { 387552f7358SJed Brown for (d = 0; d <= dim; d++) { 388552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 389834065abSMatthew G. Knepley pEnd -= pStart; 390834065abSMatthew G. Knepley pMax[d] -= pStart; 391552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 392834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 393552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 394834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 395834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 396834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 397834065abSMatthew G. Knepley } 398552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 399552f7358SJed Brown } 400552f7358SJed Brown } 401834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 402a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 403a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 404a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 405a57dd577SMatthew G Knepley DMLabel label; 406a57dd577SMatthew G Knepley const char *name; 407a57dd577SMatthew G Knepley IS valueIS; 408a57dd577SMatthew G Knepley const PetscInt *values; 409a57dd577SMatthew G Knepley PetscInt numValues, v; 410a57dd577SMatthew G Knepley 411a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 412a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 413a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 414a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 415a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 416a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 418a57dd577SMatthew G Knepley PetscInt size; 419a57dd577SMatthew G Knepley 420a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 421a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 422a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 423a57dd577SMatthew G Knepley } 424a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 425a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4264d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 427a57dd577SMatthew G Knepley } 428552f7358SJed Brown } 429552f7358SJed Brown PetscFunctionReturn(0); 430552f7358SJed Brown } 431552f7358SJed Brown 432552f7358SJed Brown #undef __FUNCT__ 433552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 434552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 435552f7358SJed Brown { 436c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 437552f7358SJed Brown PetscErrorCode ierr; 438552f7358SJed Brown 439552f7358SJed Brown PetscFunctionBegin; 440552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 441552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 442552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 443c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 444552f7358SJed Brown if (iascii) { 445552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 446c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 447c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4487afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 449c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4507afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 451c6ccd67eSMatthew G. Knepley #else 452c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 453552f7358SJed Brown #endif 45411aeaf0aSBarry Smith } 455552f7358SJed Brown PetscFunctionReturn(0); 456552f7358SJed Brown } 457552f7358SJed Brown 4582c40f234SMatthew G. Knepley #undef __FUNCT__ 4592c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4602c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4612c40f234SMatthew G. Knepley { 4622c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4632c40f234SMatthew G. Knepley PetscErrorCode ierr; 4642c40f234SMatthew G. Knepley 4652c40f234SMatthew G. Knepley PetscFunctionBegin; 4662c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4672c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4682c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4692c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4702c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4712c40f234SMatthew G. Knepley else if (ishdf5) { 4722c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 47310b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4742c40f234SMatthew G. Knepley #else 4752c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 476552f7358SJed Brown #endif 477552f7358SJed Brown } 478552f7358SJed Brown PetscFunctionReturn(0); 479552f7358SJed Brown } 480552f7358SJed Brown 481552f7358SJed Brown #undef __FUNCT__ 4826c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4836c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4846c73c22cSMatthew G. Knepley { 4856c73c22cSMatthew G. Knepley DMBoundary b, next; 4866c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4876c73c22cSMatthew G. Knepley 4888e136ac0SMatthew G. Knepley PetscFunctionBegin; 4896c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4906c73c22cSMatthew G. Knepley b = *boundary; 4916c73c22cSMatthew G. Knepley *boundary = NULL; 4926c73c22cSMatthew G. Knepley for (; b; b = next) { 4936c73c22cSMatthew G. Knepley next = b->next; 4946c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 4956c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 49663d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 4976c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 4986c73c22cSMatthew G. Knepley } 4996c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5006c73c22cSMatthew G. Knepley } 5016c73c22cSMatthew G. Knepley 5026c73c22cSMatthew G. Knepley #undef __FUNCT__ 503552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 504552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 505552f7358SJed Brown { 506552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 507552f7358SJed Brown DMLabel next = mesh->labels; 508552f7358SJed Brown PetscErrorCode ierr; 509552f7358SJed Brown 510552f7358SJed Brown PetscFunctionBegin; 5110d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 512552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 513552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 514552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 515552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 516552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 517552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 518552f7358SJed Brown while (next) { 519552f7358SJed Brown DMLabel tmp = next->next; 520552f7358SJed Brown 521552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 522552f7358SJed Brown next = tmp; 523552f7358SJed Brown } 5243913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 525a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 526552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 527552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5286c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 529552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 530552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 531552f7358SJed Brown PetscFunctionReturn(0); 532552f7358SJed Brown } 533552f7358SJed Brown 534552f7358SJed Brown #undef __FUNCT__ 535552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 536b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 537552f7358SJed Brown { 538552f7358SJed Brown PetscSection section, sectionGlobal; 539552f7358SJed Brown PetscInt bs = -1; 540552f7358SJed Brown PetscInt localSize; 54189545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 542552f7358SJed Brown PetscErrorCode ierr; 543b412c318SBarry Smith MatType mtype; 544552f7358SJed Brown 545552f7358SJed Brown PetscFunctionBegin; 546607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 547b412c318SBarry Smith mtype = dm->mattype; 548552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 549552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 550552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 551552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 55282f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 553552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 554552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 555552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 556552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 557552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 558552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 559552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 560552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 561552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 562552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 563552f7358SJed Brown if (!isShell) { 564552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5652a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 566552f7358SJed Brown 567552f7358SJed Brown if (bs < 0) { 568552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 569fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 570552f7358SJed Brown 571552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 572552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 573552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 574fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 575fad22124SMatthew G Knepley if (dof-cdof) { 5762a28c762SMatthew G Knepley if (bs < 0) { 577fad22124SMatthew G Knepley bs = dof-cdof; 578fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5792a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5802a28c762SMatthew G Knepley bs = 1; 581552f7358SJed Brown break; 582552f7358SJed Brown } 583552f7358SJed Brown } 5842a28c762SMatthew G Knepley } 5852a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5862a28c762SMatthew G Knepley bsLocal = bs; 58782f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5882a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 58982f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5902a28c762SMatthew G Knepley if (bsMin != bsMax) { 5912a28c762SMatthew G Knepley bs = 1; 5922a28c762SMatthew G Knepley } else { 5932a28c762SMatthew G Knepley bs = bsMax; 5942a28c762SMatthew G Knepley } 595552f7358SJed Brown } else { 596552f7358SJed Brown bs = 1; 597552f7358SJed Brown } 598552f7358SJed Brown } 5991795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 600552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 601552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 602552f7358SJed Brown } 603552f7358SJed Brown PetscFunctionReturn(0); 604552f7358SJed Brown } 605552f7358SJed Brown 606552f7358SJed Brown #undef __FUNCT__ 607552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 608552f7358SJed Brown /*@ 609552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 610552f7358SJed Brown 611552f7358SJed Brown Not collective 612552f7358SJed Brown 613552f7358SJed Brown Input Parameter: 614552f7358SJed Brown . mesh - The DMPlex 615552f7358SJed Brown 616552f7358SJed Brown Output Parameters: 617552f7358SJed Brown + pStart - The first mesh point 618552f7358SJed Brown - pEnd - The upper bound for mesh points 619552f7358SJed Brown 620552f7358SJed Brown Level: beginner 621552f7358SJed Brown 622552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 623552f7358SJed Brown @*/ 624552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 625552f7358SJed Brown { 626552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 627552f7358SJed Brown PetscErrorCode ierr; 628552f7358SJed Brown 629552f7358SJed Brown PetscFunctionBegin; 630552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 631552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 632552f7358SJed Brown PetscFunctionReturn(0); 633552f7358SJed Brown } 634552f7358SJed Brown 635552f7358SJed Brown #undef __FUNCT__ 636552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 637552f7358SJed Brown /*@ 638552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 639552f7358SJed Brown 640552f7358SJed Brown Not collective 641552f7358SJed Brown 642552f7358SJed Brown Input Parameters: 643552f7358SJed Brown + mesh - The DMPlex 644552f7358SJed Brown . pStart - The first mesh point 645552f7358SJed Brown - pEnd - The upper bound for mesh points 646552f7358SJed Brown 647552f7358SJed Brown Output Parameters: 648552f7358SJed Brown 649552f7358SJed Brown Level: beginner 650552f7358SJed Brown 651552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 652552f7358SJed Brown @*/ 653552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 654552f7358SJed Brown { 655552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 656552f7358SJed Brown PetscErrorCode ierr; 657552f7358SJed Brown 658552f7358SJed Brown PetscFunctionBegin; 659552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 660552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 661552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 662552f7358SJed Brown PetscFunctionReturn(0); 663552f7358SJed Brown } 664552f7358SJed Brown 665552f7358SJed Brown #undef __FUNCT__ 666552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 667552f7358SJed Brown /*@ 668552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 669552f7358SJed Brown 670552f7358SJed Brown Not collective 671552f7358SJed Brown 672552f7358SJed Brown Input Parameters: 673552f7358SJed Brown + mesh - The DMPlex 674552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 675552f7358SJed Brown 676552f7358SJed Brown Output Parameter: 677552f7358SJed Brown . size - The cone size for point p 678552f7358SJed Brown 679552f7358SJed Brown Level: beginner 680552f7358SJed Brown 681552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 682552f7358SJed Brown @*/ 683552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 684552f7358SJed Brown { 685552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 686552f7358SJed Brown PetscErrorCode ierr; 687552f7358SJed Brown 688552f7358SJed Brown PetscFunctionBegin; 689552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 690552f7358SJed Brown PetscValidPointer(size, 3); 691552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 692552f7358SJed Brown PetscFunctionReturn(0); 693552f7358SJed Brown } 694552f7358SJed Brown 695552f7358SJed Brown #undef __FUNCT__ 696552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 697552f7358SJed Brown /*@ 698552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 699552f7358SJed Brown 700552f7358SJed Brown Not collective 701552f7358SJed Brown 702552f7358SJed Brown Input Parameters: 703552f7358SJed Brown + mesh - The DMPlex 704552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 705552f7358SJed Brown - size - The cone size for point p 706552f7358SJed Brown 707552f7358SJed Brown Output Parameter: 708552f7358SJed Brown 709552f7358SJed Brown Note: 710552f7358SJed Brown This should be called after DMPlexSetChart(). 711552f7358SJed Brown 712552f7358SJed Brown Level: beginner 713552f7358SJed Brown 714552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 715552f7358SJed Brown @*/ 716552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 717552f7358SJed Brown { 718552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 719552f7358SJed Brown PetscErrorCode ierr; 720552f7358SJed Brown 721552f7358SJed Brown PetscFunctionBegin; 722552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 723552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7240d644c17SKarl Rupp 725552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 726552f7358SJed Brown PetscFunctionReturn(0); 727552f7358SJed Brown } 728552f7358SJed Brown 729552f7358SJed Brown #undef __FUNCT__ 730f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 731f5a469b9SMatthew G. Knepley /*@ 732f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 733f5a469b9SMatthew G. Knepley 734f5a469b9SMatthew G. Knepley Not collective 735f5a469b9SMatthew G. Knepley 736f5a469b9SMatthew G. Knepley Input Parameters: 737f5a469b9SMatthew G. Knepley + mesh - The DMPlex 738f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 739f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 740f5a469b9SMatthew G. Knepley 741f5a469b9SMatthew G. Knepley Output Parameter: 742f5a469b9SMatthew G. Knepley 743f5a469b9SMatthew G. Knepley Note: 744f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 745f5a469b9SMatthew G. Knepley 746f5a469b9SMatthew G. Knepley Level: beginner 747f5a469b9SMatthew G. Knepley 748f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 749f5a469b9SMatthew G. Knepley @*/ 750f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 751f5a469b9SMatthew G. Knepley { 752f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 753f5a469b9SMatthew G. Knepley PetscInt csize; 754f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 755f5a469b9SMatthew G. Knepley 756f5a469b9SMatthew G. Knepley PetscFunctionBegin; 757f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 758f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 759f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 760f5a469b9SMatthew G. Knepley 761f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 762f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 763f5a469b9SMatthew G. Knepley } 764f5a469b9SMatthew G. Knepley 765f5a469b9SMatthew G. Knepley #undef __FUNCT__ 766552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 767552f7358SJed Brown /*@C 768552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 769552f7358SJed Brown 770552f7358SJed Brown Not collective 771552f7358SJed Brown 772552f7358SJed Brown Input Parameters: 773552f7358SJed Brown + mesh - The DMPlex 774552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 775552f7358SJed Brown 776552f7358SJed Brown Output Parameter: 777552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 778552f7358SJed Brown 779552f7358SJed Brown Level: beginner 780552f7358SJed Brown 7813813dfbdSMatthew G Knepley Fortran Notes: 7823813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7833813dfbdSMatthew G Knepley include petsc.h90 in your code. 7843813dfbdSMatthew G Knepley 7853813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 786552f7358SJed Brown 787552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 788552f7358SJed Brown @*/ 789552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 790552f7358SJed Brown { 791552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 792552f7358SJed Brown PetscInt off; 793552f7358SJed Brown PetscErrorCode ierr; 794552f7358SJed Brown 795552f7358SJed Brown PetscFunctionBegin; 796552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 797552f7358SJed Brown PetscValidPointer(cone, 3); 798552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 799552f7358SJed Brown *cone = &mesh->cones[off]; 800552f7358SJed Brown PetscFunctionReturn(0); 801552f7358SJed Brown } 802552f7358SJed Brown 803552f7358SJed Brown #undef __FUNCT__ 804552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 805552f7358SJed Brown /*@ 806552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 807552f7358SJed Brown 808552f7358SJed Brown Not collective 809552f7358SJed Brown 810552f7358SJed Brown Input Parameters: 811552f7358SJed Brown + mesh - The DMPlex 812552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 813552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 814552f7358SJed Brown 815552f7358SJed Brown Output Parameter: 816552f7358SJed Brown 817552f7358SJed Brown Note: 818552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 819552f7358SJed Brown 820552f7358SJed Brown Level: beginner 821552f7358SJed Brown 822552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 823552f7358SJed Brown @*/ 824552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 825552f7358SJed Brown { 826552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 827552f7358SJed Brown PetscInt pStart, pEnd; 828552f7358SJed Brown PetscInt dof, off, c; 829552f7358SJed Brown PetscErrorCode ierr; 830552f7358SJed Brown 831552f7358SJed Brown PetscFunctionBegin; 832552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 833552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 834552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 835552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 836552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 83782f516ccSBarry 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); 838552f7358SJed Brown for (c = 0; c < dof; ++c) { 83982f516ccSBarry 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); 840552f7358SJed Brown mesh->cones[off+c] = cone[c]; 841552f7358SJed Brown } 842552f7358SJed Brown PetscFunctionReturn(0); 843552f7358SJed Brown } 844552f7358SJed Brown 845552f7358SJed Brown #undef __FUNCT__ 846552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 847552f7358SJed Brown /*@C 848552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 849552f7358SJed Brown 850552f7358SJed Brown Not collective 851552f7358SJed Brown 852552f7358SJed Brown Input Parameters: 853552f7358SJed Brown + mesh - The DMPlex 854552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 855552f7358SJed Brown 856552f7358SJed Brown Output Parameter: 857552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 858552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 859552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 860552f7358SJed Brown the index of the cone point on which to start. 861552f7358SJed Brown 862552f7358SJed Brown Level: beginner 863552f7358SJed Brown 8643813dfbdSMatthew G Knepley Fortran Notes: 8653813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8663813dfbdSMatthew G Knepley include petsc.h90 in your code. 8673813dfbdSMatthew G Knepley 8683813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 869552f7358SJed Brown 870552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 871552f7358SJed Brown @*/ 872552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 873552f7358SJed Brown { 874552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 875552f7358SJed Brown PetscInt off; 876552f7358SJed Brown PetscErrorCode ierr; 877552f7358SJed Brown 878552f7358SJed Brown PetscFunctionBegin; 879552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 880552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 881552f7358SJed Brown { 882552f7358SJed Brown PetscInt dof; 883552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 884552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 885552f7358SJed Brown } 886552f7358SJed Brown #endif 887552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8880d644c17SKarl Rupp 889552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 890552f7358SJed Brown PetscFunctionReturn(0); 891552f7358SJed Brown } 892552f7358SJed Brown 893552f7358SJed Brown #undef __FUNCT__ 894552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 895552f7358SJed Brown /*@ 896552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 897552f7358SJed Brown 898552f7358SJed Brown Not collective 899552f7358SJed Brown 900552f7358SJed Brown Input Parameters: 901552f7358SJed Brown + mesh - The DMPlex 902552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 903552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 904552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 905552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 906552f7358SJed Brown the index of the cone point on which to start. 907552f7358SJed Brown 908552f7358SJed Brown Output Parameter: 909552f7358SJed Brown 910552f7358SJed Brown Note: 911552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 912552f7358SJed Brown 913552f7358SJed Brown Level: beginner 914552f7358SJed Brown 915552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 916552f7358SJed Brown @*/ 917552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 918552f7358SJed Brown { 919552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 920552f7358SJed Brown PetscInt pStart, pEnd; 921552f7358SJed Brown PetscInt dof, off, c; 922552f7358SJed Brown PetscErrorCode ierr; 923552f7358SJed Brown 924552f7358SJed Brown PetscFunctionBegin; 925552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 926552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 927552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 928552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 929552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 93082f516ccSBarry 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); 931552f7358SJed Brown for (c = 0; c < dof; ++c) { 932552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 933552f7358SJed Brown 934552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 93582f516ccSBarry 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); 936552f7358SJed Brown mesh->coneOrientations[off+c] = o; 937552f7358SJed Brown } 938552f7358SJed Brown PetscFunctionReturn(0); 939552f7358SJed Brown } 940552f7358SJed Brown 941552f7358SJed Brown #undef __FUNCT__ 942552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 943552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 944552f7358SJed Brown { 945552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 946552f7358SJed Brown PetscInt pStart, pEnd; 947552f7358SJed Brown PetscInt dof, off; 948552f7358SJed Brown PetscErrorCode ierr; 949552f7358SJed Brown 950552f7358SJed Brown PetscFunctionBegin; 951552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 952552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 95382f516ccSBarry 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); 95482f516ccSBarry 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); 95577c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 95677c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 95777c88f5bSMatthew 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); 958552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 959552f7358SJed Brown PetscFunctionReturn(0); 960552f7358SJed Brown } 961552f7358SJed Brown 962552f7358SJed Brown #undef __FUNCT__ 96377c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 96477c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 96577c88f5bSMatthew G Knepley { 96677c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 96777c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 96877c88f5bSMatthew G Knepley PetscInt dof, off; 96977c88f5bSMatthew G Knepley PetscErrorCode ierr; 97077c88f5bSMatthew G Knepley 97177c88f5bSMatthew G Knepley PetscFunctionBegin; 97277c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 97377c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97477c88f5bSMatthew 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); 97577c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 97677c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 97777c88f5bSMatthew 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); 97877c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 97977c88f5bSMatthew G Knepley PetscFunctionReturn(0); 98077c88f5bSMatthew G Knepley } 98177c88f5bSMatthew G Knepley 98277c88f5bSMatthew G Knepley #undef __FUNCT__ 983552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 984552f7358SJed Brown /*@ 985552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 986552f7358SJed Brown 987552f7358SJed Brown Not collective 988552f7358SJed Brown 989552f7358SJed Brown Input Parameters: 990552f7358SJed Brown + mesh - The DMPlex 991552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 992552f7358SJed Brown 993552f7358SJed Brown Output Parameter: 994552f7358SJed Brown . size - The support size for point p 995552f7358SJed Brown 996552f7358SJed Brown Level: beginner 997552f7358SJed Brown 998552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 999552f7358SJed Brown @*/ 1000552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1001552f7358SJed Brown { 1002552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1003552f7358SJed Brown PetscErrorCode ierr; 1004552f7358SJed Brown 1005552f7358SJed Brown PetscFunctionBegin; 1006552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1007552f7358SJed Brown PetscValidPointer(size, 3); 1008552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1009552f7358SJed Brown PetscFunctionReturn(0); 1010552f7358SJed Brown } 1011552f7358SJed Brown 1012552f7358SJed Brown #undef __FUNCT__ 1013552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1014552f7358SJed Brown /*@ 1015552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1016552f7358SJed Brown 1017552f7358SJed Brown Not collective 1018552f7358SJed Brown 1019552f7358SJed Brown Input Parameters: 1020552f7358SJed Brown + mesh - The DMPlex 1021552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1022552f7358SJed Brown - size - The support size for point p 1023552f7358SJed Brown 1024552f7358SJed Brown Output Parameter: 1025552f7358SJed Brown 1026552f7358SJed Brown Note: 1027552f7358SJed Brown This should be called after DMPlexSetChart(). 1028552f7358SJed Brown 1029552f7358SJed Brown Level: beginner 1030552f7358SJed Brown 1031552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1032552f7358SJed Brown @*/ 1033552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1034552f7358SJed Brown { 1035552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1036552f7358SJed Brown PetscErrorCode ierr; 1037552f7358SJed Brown 1038552f7358SJed Brown PetscFunctionBegin; 1039552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1040552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10410d644c17SKarl Rupp 1042552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1043552f7358SJed Brown PetscFunctionReturn(0); 1044552f7358SJed Brown } 1045552f7358SJed Brown 1046552f7358SJed Brown #undef __FUNCT__ 1047552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1048552f7358SJed Brown /*@C 1049552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1050552f7358SJed Brown 1051552f7358SJed Brown Not collective 1052552f7358SJed Brown 1053552f7358SJed Brown Input Parameters: 1054552f7358SJed Brown + mesh - The DMPlex 1055552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1056552f7358SJed Brown 1057552f7358SJed Brown Output Parameter: 1058552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1059552f7358SJed Brown 1060552f7358SJed Brown Level: beginner 1061552f7358SJed Brown 10623813dfbdSMatthew G Knepley Fortran Notes: 10633813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10643813dfbdSMatthew G Knepley include petsc.h90 in your code. 10653813dfbdSMatthew G Knepley 10663813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10673813dfbdSMatthew G Knepley 1068552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1069552f7358SJed Brown @*/ 1070552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1071552f7358SJed Brown { 1072552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1073552f7358SJed Brown PetscInt off; 1074552f7358SJed Brown PetscErrorCode ierr; 1075552f7358SJed Brown 1076552f7358SJed Brown PetscFunctionBegin; 1077552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1078552f7358SJed Brown PetscValidPointer(support, 3); 1079552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1080552f7358SJed Brown *support = &mesh->supports[off]; 1081552f7358SJed Brown PetscFunctionReturn(0); 1082552f7358SJed Brown } 1083552f7358SJed Brown 1084552f7358SJed Brown #undef __FUNCT__ 1085552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1086552f7358SJed Brown /*@ 1087552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1088552f7358SJed Brown 1089552f7358SJed Brown Not collective 1090552f7358SJed Brown 1091552f7358SJed Brown Input Parameters: 1092552f7358SJed Brown + mesh - The DMPlex 1093552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1094552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1095552f7358SJed Brown 1096552f7358SJed Brown Output Parameter: 1097552f7358SJed Brown 1098552f7358SJed Brown Note: 1099552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1100552f7358SJed Brown 1101552f7358SJed Brown Level: beginner 1102552f7358SJed Brown 1103552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1104552f7358SJed Brown @*/ 1105552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1106552f7358SJed Brown { 1107552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1108552f7358SJed Brown PetscInt pStart, pEnd; 1109552f7358SJed Brown PetscInt dof, off, c; 1110552f7358SJed Brown PetscErrorCode ierr; 1111552f7358SJed Brown 1112552f7358SJed Brown PetscFunctionBegin; 1113552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1114552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1115552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1116552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1117552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 111882f516ccSBarry 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); 1119552f7358SJed Brown for (c = 0; c < dof; ++c) { 112082f516ccSBarry 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); 1121552f7358SJed Brown mesh->supports[off+c] = support[c]; 1122552f7358SJed Brown } 1123552f7358SJed Brown PetscFunctionReturn(0); 1124552f7358SJed Brown } 1125552f7358SJed Brown 1126552f7358SJed Brown #undef __FUNCT__ 1127552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1128552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1129552f7358SJed Brown { 1130552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1131552f7358SJed Brown PetscInt pStart, pEnd; 1132552f7358SJed Brown PetscInt dof, off; 1133552f7358SJed Brown PetscErrorCode ierr; 1134552f7358SJed Brown 1135552f7358SJed Brown PetscFunctionBegin; 1136552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1137552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1138552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1139552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114082f516ccSBarry 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); 114182f516ccSBarry 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); 114282f516ccSBarry 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); 1143552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1144552f7358SJed Brown PetscFunctionReturn(0); 1145552f7358SJed Brown } 1146552f7358SJed Brown 1147552f7358SJed Brown #undef __FUNCT__ 1148552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1149552f7358SJed Brown /*@C 1150552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1151552f7358SJed Brown 1152552f7358SJed Brown Not collective 1153552f7358SJed Brown 1154552f7358SJed Brown Input Parameters: 1155552f7358SJed Brown + mesh - The DMPlex 1156552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1157552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11580298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1159552f7358SJed Brown 1160552f7358SJed Brown Output Parameters: 1161552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1162552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1163552f7358SJed Brown 1164552f7358SJed Brown Note: 11650298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1166552f7358SJed Brown 11673813dfbdSMatthew G Knepley Fortran Notes: 11683813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11693813dfbdSMatthew G Knepley include petsc.h90 in your code. 11703813dfbdSMatthew G Knepley 11713813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11723813dfbdSMatthew G Knepley 1173552f7358SJed Brown Level: beginner 1174552f7358SJed Brown 1175552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1176552f7358SJed Brown @*/ 1177552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1178552f7358SJed Brown { 1179552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1180552f7358SJed Brown PetscInt *closure, *fifo; 11810298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1182552f7358SJed Brown PetscInt tmpSize, t; 1183552f7358SJed Brown PetscInt depth = 0, maxSize; 1184552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1185552f7358SJed Brown PetscErrorCode ierr; 1186552f7358SJed Brown 1187552f7358SJed Brown PetscFunctionBegin; 1188552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1189552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1190552f7358SJed Brown /* This is only 1-level */ 1191552f7358SJed Brown if (useCone) { 1192552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1193552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1194552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1195552f7358SJed Brown } else { 1196552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1197552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1198552f7358SJed Brown } 1199bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1200bfbcdd7aSMatthew G. Knepley if (*points) { 1201bfbcdd7aSMatthew G. Knepley closure = *points; 1202bfbcdd7aSMatthew G. Knepley } else { 1203bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1204bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1205bfbcdd7aSMatthew G. Knepley } 1206bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1207bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1208bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1209bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1210bfbcdd7aSMatthew G. Knepley } 1211bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1212bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1213bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1214bfbcdd7aSMatthew G. Knepley } 1215bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1216bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1217bfbcdd7aSMatthew G. Knepley if (*points) { 1218bfbcdd7aSMatthew G. Knepley closure = *points; 1219bfbcdd7aSMatthew G. Knepley } else { 1220bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1221bfbcdd7aSMatthew G. Knepley } 1222bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1223552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1224552f7358SJed Brown const PetscInt cp = tmp[t]; 1225552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1226552f7358SJed Brown 1227552f7358SJed Brown closure[closureSize] = cp; 1228552f7358SJed Brown closure[closureSize+1] = co; 1229552f7358SJed Brown fifo[fifoSize] = cp; 1230552f7358SJed Brown fifo[fifoSize+1] = co; 1231552f7358SJed Brown } 1232bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1233552f7358SJed Brown while (fifoSize - fifoStart) { 1234552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1235552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1236552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1237552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1238552f7358SJed Brown 1239552f7358SJed Brown if (useCone) { 1240552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1241552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1242552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1243552f7358SJed Brown } else { 1244552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1245552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12460298fd71SBarry Smith tmpO = NULL; 1247552f7358SJed Brown } 1248552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1249552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1250552f7358SJed Brown const PetscInt cp = tmp[i]; 12512e1b13c2SMatthew 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. */ 12522e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12532e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12542e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1255552f7358SJed Brown PetscInt c; 1256552f7358SJed Brown 12572e1b13c2SMatthew G. Knepley if (rev) { 12582e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12592e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12602e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12612e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12622e1b13c2SMatthew G. Knepley } 1263552f7358SJed Brown /* Check for duplicate */ 1264552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1265552f7358SJed Brown if (closure[c] == cp) break; 1266552f7358SJed Brown } 1267552f7358SJed Brown if (c == closureSize) { 1268552f7358SJed Brown closure[closureSize] = cp; 1269552f7358SJed Brown closure[closureSize+1] = co; 1270552f7358SJed Brown fifo[fifoSize] = cp; 1271552f7358SJed Brown fifo[fifoSize+1] = co; 1272552f7358SJed Brown closureSize += 2; 1273552f7358SJed Brown fifoSize += 2; 1274552f7358SJed Brown } 1275552f7358SJed Brown } 1276552f7358SJed Brown fifoStart += 2; 1277552f7358SJed Brown } 1278552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1279552f7358SJed Brown if (points) *points = closure; 1280552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1281552f7358SJed Brown PetscFunctionReturn(0); 1282552f7358SJed Brown } 1283552f7358SJed Brown 1284552f7358SJed Brown #undef __FUNCT__ 12859bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 12869bf0dad6SMatthew G. Knepley /*@C 12879bf0dad6SMatthew 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 12889bf0dad6SMatthew G. Knepley 12899bf0dad6SMatthew G. Knepley Not collective 12909bf0dad6SMatthew G. Knepley 12919bf0dad6SMatthew G. Knepley Input Parameters: 12929bf0dad6SMatthew G. Knepley + mesh - The DMPlex 12939bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 12949bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 12959bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12969bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 12979bf0dad6SMatthew G. Knepley 12989bf0dad6SMatthew G. Knepley Output Parameters: 12999bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13009bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13019bf0dad6SMatthew G. Knepley 13029bf0dad6SMatthew G. Knepley Note: 13039bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13049bf0dad6SMatthew G. Knepley 13059bf0dad6SMatthew G. Knepley Fortran Notes: 13069bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13079bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13089bf0dad6SMatthew G. Knepley 13099bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13109bf0dad6SMatthew G. Knepley 13119bf0dad6SMatthew G. Knepley Level: beginner 13129bf0dad6SMatthew G. Knepley 13139bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13149bf0dad6SMatthew G. Knepley @*/ 13159bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13169bf0dad6SMatthew G. Knepley { 13179bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13189bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13199bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13209bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13219bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13229bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13239bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13249bf0dad6SMatthew G. Knepley 13259bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13269bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13279bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13289bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13299bf0dad6SMatthew G. Knepley if (useCone) { 13309bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13319bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13329bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13339bf0dad6SMatthew G. Knepley } else { 13349bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13359bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13369bf0dad6SMatthew G. Knepley } 13379bf0dad6SMatthew G. Knepley if (depth == 1) { 13389bf0dad6SMatthew G. Knepley if (*points) { 13399bf0dad6SMatthew G. Knepley closure = *points; 13409bf0dad6SMatthew G. Knepley } else { 13419bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13429bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13439bf0dad6SMatthew G. Knepley } 13449bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13459bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13469bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13479bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13489bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13499bf0dad6SMatthew G. Knepley } 13509bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13519bf0dad6SMatthew G. Knepley if (points) *points = closure; 13529bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13539bf0dad6SMatthew G. Knepley } 13549bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13559bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13569bf0dad6SMatthew G. Knepley if (*points) { 13579bf0dad6SMatthew G. Knepley closure = *points; 13589bf0dad6SMatthew G. Knepley } else { 13599bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13609bf0dad6SMatthew G. Knepley } 13619bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13629bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13639bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13649bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13659bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13669bf0dad6SMatthew G. Knepley 13679bf0dad6SMatthew G. Knepley if (ornt < 0) { 13689bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13699bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13709bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13719bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13729bf0dad6SMatthew G. Knepley } 13739bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13749bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13759bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13769bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13779bf0dad6SMatthew G. Knepley } 13789bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 13799bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 13809bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 13819bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 13829bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 13839bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 13849bf0dad6SMatthew G. Knepley 13859bf0dad6SMatthew G. Knepley if (useCone) { 13869bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13879bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13889bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13899bf0dad6SMatthew G. Knepley } else { 13909bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 13919bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13929bf0dad6SMatthew G. Knepley tmpO = NULL; 13939bf0dad6SMatthew G. Knepley } 13949bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 13959bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 13969bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13979bf0dad6SMatthew 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. */ 13989bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 13999bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14009bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14019bf0dad6SMatthew G. Knepley PetscInt c; 14029bf0dad6SMatthew G. Knepley 14039bf0dad6SMatthew G. Knepley if (rev) { 14049bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14059bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14069bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14079bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14089bf0dad6SMatthew G. Knepley } 14099bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14109bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14119bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14129bf0dad6SMatthew G. Knepley } 14139bf0dad6SMatthew G. Knepley if (c == closureSize) { 14149bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14159bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14169bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14179bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14189bf0dad6SMatthew G. Knepley closureSize += 2; 14199bf0dad6SMatthew G. Knepley fifoSize += 2; 14209bf0dad6SMatthew G. Knepley } 14219bf0dad6SMatthew G. Knepley } 14229bf0dad6SMatthew G. Knepley fifoStart += 2; 14239bf0dad6SMatthew G. Knepley } 14249bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14259bf0dad6SMatthew G. Knepley if (points) *points = closure; 14269bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14279bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14289bf0dad6SMatthew G. Knepley } 14299bf0dad6SMatthew G. Knepley 14309bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1431552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1432552f7358SJed Brown /*@C 1433552f7358SJed 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 1434552f7358SJed Brown 1435552f7358SJed Brown Not collective 1436552f7358SJed Brown 1437552f7358SJed Brown Input Parameters: 1438552f7358SJed Brown + mesh - The DMPlex 1439552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1440552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1441e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1442e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1443552f7358SJed Brown 1444552f7358SJed Brown Note: 14450298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1446552f7358SJed Brown 14473813dfbdSMatthew G Knepley Fortran Notes: 14483813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14493813dfbdSMatthew G Knepley include petsc.h90 in your code. 14503813dfbdSMatthew G Knepley 14513813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14523813dfbdSMatthew G Knepley 1453552f7358SJed Brown Level: beginner 1454552f7358SJed Brown 1455552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1456552f7358SJed Brown @*/ 1457552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1458552f7358SJed Brown { 1459552f7358SJed Brown PetscErrorCode ierr; 1460552f7358SJed Brown 1461552f7358SJed Brown PetscFunctionBegin; 1462552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1463e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1464e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1465552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14664ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1467552f7358SJed Brown PetscFunctionReturn(0); 1468552f7358SJed Brown } 1469552f7358SJed Brown 1470552f7358SJed Brown #undef __FUNCT__ 1471552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1472552f7358SJed Brown /*@ 1473552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1474552f7358SJed Brown 1475552f7358SJed Brown Not collective 1476552f7358SJed Brown 1477552f7358SJed Brown Input Parameter: 1478552f7358SJed Brown . mesh - The DMPlex 1479552f7358SJed Brown 1480552f7358SJed Brown Output Parameters: 1481552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1482552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1483552f7358SJed Brown 1484552f7358SJed Brown Level: beginner 1485552f7358SJed Brown 1486552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1487552f7358SJed Brown @*/ 1488552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1489552f7358SJed Brown { 1490552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1491552f7358SJed Brown 1492552f7358SJed Brown PetscFunctionBegin; 1493552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1494552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1495552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1496552f7358SJed Brown PetscFunctionReturn(0); 1497552f7358SJed Brown } 1498552f7358SJed Brown 1499552f7358SJed Brown #undef __FUNCT__ 1500552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1501552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1502552f7358SJed Brown { 1503552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1504552f7358SJed Brown PetscInt size; 1505552f7358SJed Brown PetscErrorCode ierr; 1506552f7358SJed Brown 1507552f7358SJed Brown PetscFunctionBegin; 1508552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1509552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1510552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15111795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15121795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1513552f7358SJed Brown if (mesh->maxSupportSize) { 1514552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1515552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15161795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1517552f7358SJed Brown } 1518552f7358SJed Brown PetscFunctionReturn(0); 1519552f7358SJed Brown } 1520552f7358SJed Brown 1521552f7358SJed Brown #undef __FUNCT__ 1522552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1523552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1524552f7358SJed Brown { 1525552f7358SJed Brown PetscErrorCode ierr; 1526552f7358SJed Brown 1527552f7358SJed Brown PetscFunctionBegin; 15284d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15294d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1530552f7358SJed Brown PetscFunctionReturn(0); 1531552f7358SJed Brown } 1532552f7358SJed Brown 1533552f7358SJed Brown #undef __FUNCT__ 1534552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1535552f7358SJed Brown /*@ 1536552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1537552f7358SJed Brown 1538552f7358SJed Brown Not collective 1539552f7358SJed Brown 1540552f7358SJed Brown Input Parameter: 1541552f7358SJed Brown . mesh - The DMPlex 1542552f7358SJed Brown 1543552f7358SJed Brown Output Parameter: 1544552f7358SJed Brown 1545552f7358SJed Brown Note: 1546552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1547552f7358SJed Brown 1548552f7358SJed Brown Level: beginner 1549552f7358SJed Brown 1550552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1551552f7358SJed Brown @*/ 1552552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1553552f7358SJed Brown { 1554552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1555552f7358SJed Brown PetscInt *offsets; 1556552f7358SJed Brown PetscInt supportSize; 1557552f7358SJed Brown PetscInt pStart, pEnd, p; 1558552f7358SJed Brown PetscErrorCode ierr; 1559552f7358SJed Brown 1560552f7358SJed Brown PetscFunctionBegin; 1561552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 156282f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1563552f7358SJed Brown /* Calculate support sizes */ 1564552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1565552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1566552f7358SJed Brown PetscInt dof, off, c; 1567552f7358SJed Brown 1568552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1569552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1570552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1571552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1572552f7358SJed Brown } 1573552f7358SJed Brown } 1574552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1575552f7358SJed Brown PetscInt dof; 1576552f7358SJed Brown 1577552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 15780d644c17SKarl Rupp 1579552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1580552f7358SJed Brown } 1581552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1582552f7358SJed Brown /* Calculate supports */ 1583552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 15841795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 15851795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1586552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1587552f7358SJed Brown PetscInt dof, off, c; 1588552f7358SJed Brown 1589552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1590552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1591552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1592552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1593552f7358SJed Brown PetscInt offS; 1594552f7358SJed Brown 1595552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 15960d644c17SKarl Rupp 1597552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1598552f7358SJed Brown ++offsets[q]; 1599552f7358SJed Brown } 1600552f7358SJed Brown } 1601552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1602552f7358SJed Brown PetscFunctionReturn(0); 1603552f7358SJed Brown } 1604552f7358SJed Brown 1605552f7358SJed Brown #undef __FUNCT__ 1606552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1607552f7358SJed Brown /*@ 1608552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1609552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1610552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1611552f7358SJed Brown the DAG. 1612552f7358SJed Brown 1613552f7358SJed Brown Not collective 1614552f7358SJed Brown 1615552f7358SJed Brown Input Parameter: 1616552f7358SJed Brown . mesh - The DMPlex 1617552f7358SJed Brown 1618552f7358SJed Brown Output Parameter: 1619552f7358SJed Brown 1620552f7358SJed Brown Notes: 1621150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1622150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1623150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1624150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1625552f7358SJed Brown 1626150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1627552f7358SJed Brown 1628552f7358SJed Brown Level: beginner 1629552f7358SJed Brown 1630552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1631552f7358SJed Brown @*/ 1632552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1633552f7358SJed Brown { 1634aa50250dSMatthew G. Knepley DMLabel label; 1635552f7358SJed Brown PetscInt pStart, pEnd, p; 1636552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1637552f7358SJed Brown PetscErrorCode ierr; 1638552f7358SJed Brown 1639552f7358SJed Brown PetscFunctionBegin; 1640552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1641552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1642552f7358SJed Brown /* Calculate depth */ 1643aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1644aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1645aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1646552f7358SJed Brown /* Initialize roots and count leaves */ 1647552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1648552f7358SJed Brown PetscInt coneSize, supportSize; 1649552f7358SJed Brown 1650552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1651552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1652552f7358SJed Brown if (!coneSize && supportSize) { 1653552f7358SJed Brown ++numRoots; 1654aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1655552f7358SJed Brown } else if (!supportSize && coneSize) { 1656552f7358SJed Brown ++numLeaves; 1657552f7358SJed Brown } else if (!supportSize && !coneSize) { 1658552f7358SJed Brown /* Isolated points */ 1659aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1660552f7358SJed Brown } 1661552f7358SJed Brown } 1662552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1663552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1664552f7358SJed Brown PetscInt coneSize, supportSize; 1665552f7358SJed Brown 1666552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1667552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1668552f7358SJed Brown if (!supportSize && coneSize) { 1669aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1670552f7358SJed Brown } 1671552f7358SJed Brown } 1672552f7358SJed Brown } else { 167374ef644bSMatthew G. Knepley IS pointIS; 167474ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1675552f7358SJed Brown 167674ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 167774ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 167874ef644bSMatthew G. Knepley while (numPoints) { 167974ef644bSMatthew G. Knepley const PetscInt *points; 168074ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 168174ef644bSMatthew G. Knepley 168274ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 168374ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 168474ef644bSMatthew G. Knepley const PetscInt point = points[p]; 168574ef644bSMatthew G. Knepley const PetscInt *support; 168674ef644bSMatthew G. Knepley PetscInt supportSize, s; 168774ef644bSMatthew G. Knepley 168874ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 168974ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 169074ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 169174ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1692552f7358SJed Brown } 1693552f7358SJed Brown } 16945edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 169574ef644bSMatthew G. Knepley ++level; 169674ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 169774ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 169874ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 169974ef644bSMatthew G. Knepley else {numPoints = 0;} 170074ef644bSMatthew G. Knepley } 170174ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170274ef644bSMatthew G. Knepley } 1703552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1704552f7358SJed Brown PetscFunctionReturn(0); 1705552f7358SJed Brown } 1706552f7358SJed Brown 1707552f7358SJed Brown #undef __FUNCT__ 1708552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1709552f7358SJed Brown /*@C 1710552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1711552f7358SJed Brown 1712552f7358SJed Brown Not Collective 1713552f7358SJed Brown 1714552f7358SJed Brown Input Parameters: 1715552f7358SJed Brown + dm - The DMPlex object 1716552f7358SJed Brown . numPoints - The number of input points for the join 1717552f7358SJed Brown - points - The input points 1718552f7358SJed Brown 1719552f7358SJed Brown Output Parameters: 1720552f7358SJed Brown + numCoveredPoints - The number of points in the join 1721552f7358SJed Brown - coveredPoints - The points in the join 1722552f7358SJed Brown 1723552f7358SJed Brown Level: intermediate 1724552f7358SJed Brown 1725552f7358SJed Brown Note: Currently, this is restricted to a single level join 1726552f7358SJed Brown 17273813dfbdSMatthew G Knepley Fortran Notes: 17283813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17293813dfbdSMatthew G Knepley include petsc.h90 in your code. 17303813dfbdSMatthew G Knepley 17313813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17323813dfbdSMatthew G Knepley 1733552f7358SJed Brown .keywords: mesh 1734552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1735552f7358SJed Brown @*/ 1736552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1737552f7358SJed Brown { 1738552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1739552f7358SJed Brown PetscInt *join[2]; 1740552f7358SJed Brown PetscInt joinSize, i = 0; 1741552f7358SJed Brown PetscInt dof, off, p, c, m; 1742552f7358SJed Brown PetscErrorCode ierr; 1743552f7358SJed Brown 1744552f7358SJed Brown PetscFunctionBegin; 1745552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1746552f7358SJed Brown PetscValidPointer(points, 2); 1747552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1748552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1749552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1750552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1751552f7358SJed Brown /* Copy in support of first point */ 1752552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1753552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1754552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1755552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1756552f7358SJed Brown } 1757552f7358SJed Brown /* Check each successive support */ 1758552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1759552f7358SJed Brown PetscInt newJoinSize = 0; 1760552f7358SJed Brown 1761552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1762552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1763552f7358SJed Brown for (c = 0; c < dof; ++c) { 1764552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1765552f7358SJed Brown 1766552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1767552f7358SJed Brown if (point == join[i][m]) { 1768552f7358SJed Brown join[1-i][newJoinSize++] = point; 1769552f7358SJed Brown break; 1770552f7358SJed Brown } 1771552f7358SJed Brown } 1772552f7358SJed Brown } 1773552f7358SJed Brown joinSize = newJoinSize; 1774552f7358SJed Brown i = 1-i; 1775552f7358SJed Brown } 1776552f7358SJed Brown *numCoveredPoints = joinSize; 1777552f7358SJed Brown *coveredPoints = join[i]; 1778552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1779552f7358SJed Brown PetscFunctionReturn(0); 1780552f7358SJed Brown } 1781552f7358SJed Brown 1782552f7358SJed Brown #undef __FUNCT__ 1783552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1784552f7358SJed Brown /*@C 1785552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1786552f7358SJed Brown 1787552f7358SJed Brown Not Collective 1788552f7358SJed Brown 1789552f7358SJed Brown Input Parameters: 1790552f7358SJed Brown + dm - The DMPlex object 1791552f7358SJed Brown . numPoints - The number of input points for the join 1792552f7358SJed Brown - points - The input points 1793552f7358SJed Brown 1794552f7358SJed Brown Output Parameters: 1795552f7358SJed Brown + numCoveredPoints - The number of points in the join 1796552f7358SJed Brown - coveredPoints - The points in the join 1797552f7358SJed Brown 17983813dfbdSMatthew G Knepley Fortran Notes: 17993813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18003813dfbdSMatthew G Knepley include petsc.h90 in your code. 18013813dfbdSMatthew G Knepley 18023813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18033813dfbdSMatthew G Knepley 1804552f7358SJed Brown Level: intermediate 1805552f7358SJed Brown 1806552f7358SJed Brown .keywords: mesh 1807552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1808552f7358SJed Brown @*/ 1809552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1810552f7358SJed Brown { 1811552f7358SJed Brown PetscErrorCode ierr; 1812552f7358SJed Brown 1813552f7358SJed Brown PetscFunctionBegin; 1814552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1815d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1816d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1817d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1818552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1819d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1820552f7358SJed Brown PetscFunctionReturn(0); 1821552f7358SJed Brown } 1822552f7358SJed Brown 1823552f7358SJed Brown #undef __FUNCT__ 1824552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1825552f7358SJed Brown /*@C 1826552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1827552f7358SJed Brown 1828552f7358SJed Brown Not Collective 1829552f7358SJed Brown 1830552f7358SJed Brown Input Parameters: 1831552f7358SJed Brown + dm - The DMPlex object 1832552f7358SJed Brown . numPoints - The number of input points for the join 1833552f7358SJed Brown - points - The input points 1834552f7358SJed Brown 1835552f7358SJed Brown Output Parameters: 1836552f7358SJed Brown + numCoveredPoints - The number of points in the join 1837552f7358SJed Brown - coveredPoints - The points in the join 1838552f7358SJed Brown 18393813dfbdSMatthew G Knepley Fortran Notes: 18403813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18413813dfbdSMatthew G Knepley include petsc.h90 in your code. 18423813dfbdSMatthew G Knepley 18433813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18443813dfbdSMatthew G Knepley 1845552f7358SJed Brown Level: intermediate 1846552f7358SJed Brown 1847552f7358SJed Brown .keywords: mesh 1848552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1849552f7358SJed Brown @*/ 1850552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1851552f7358SJed Brown { 1852552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1853552f7358SJed Brown PetscInt *offsets, **closures; 1854552f7358SJed Brown PetscInt *join[2]; 1855552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1856552f7358SJed Brown PetscInt p, d, c, m; 1857552f7358SJed Brown PetscErrorCode ierr; 1858552f7358SJed Brown 1859552f7358SJed Brown PetscFunctionBegin; 1860552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1861552f7358SJed Brown PetscValidPointer(points, 2); 1862552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1863552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1864552f7358SJed Brown 1865552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18661795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1867552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1868e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1869552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1870552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1871552f7358SJed Brown 1872552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1873552f7358SJed Brown PetscInt closureSize; 1874552f7358SJed Brown 1875552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 18760d644c17SKarl Rupp 1877552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1878552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1879552f7358SJed Brown PetscInt pStart, pEnd, i; 1880552f7358SJed Brown 1881552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1882552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1883552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1884552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1885552f7358SJed Brown break; 1886552f7358SJed Brown } 1887552f7358SJed Brown } 1888552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1889552f7358SJed Brown } 189082f516ccSBarry 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); 1891552f7358SJed Brown } 1892552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1893552f7358SJed Brown PetscInt dof; 1894552f7358SJed Brown 1895552f7358SJed Brown /* Copy in support of first point */ 1896552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1897552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1898552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1899552f7358SJed Brown } 1900552f7358SJed Brown /* Check each successive cone */ 1901552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1902552f7358SJed Brown PetscInt newJoinSize = 0; 1903552f7358SJed Brown 1904552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1905552f7358SJed Brown for (c = 0; c < dof; ++c) { 1906552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1907552f7358SJed Brown 1908552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1909552f7358SJed Brown if (point == join[i][m]) { 1910552f7358SJed Brown join[1-i][newJoinSize++] = point; 1911552f7358SJed Brown break; 1912552f7358SJed Brown } 1913552f7358SJed Brown } 1914552f7358SJed Brown } 1915552f7358SJed Brown joinSize = newJoinSize; 1916552f7358SJed Brown i = 1-i; 1917552f7358SJed Brown } 1918552f7358SJed Brown if (joinSize) break; 1919552f7358SJed Brown } 1920552f7358SJed Brown *numCoveredPoints = joinSize; 1921552f7358SJed Brown *coveredPoints = join[i]; 1922552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19230298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1924552f7358SJed Brown } 1925552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1926552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1927552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1928552f7358SJed Brown PetscFunctionReturn(0); 1929552f7358SJed Brown } 1930552f7358SJed Brown 1931552f7358SJed Brown #undef __FUNCT__ 1932552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1933552f7358SJed Brown /*@C 1934552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1935552f7358SJed Brown 1936552f7358SJed Brown Not Collective 1937552f7358SJed Brown 1938552f7358SJed Brown Input Parameters: 1939552f7358SJed Brown + dm - The DMPlex object 1940552f7358SJed Brown . numPoints - The number of input points for the meet 1941552f7358SJed Brown - points - The input points 1942552f7358SJed Brown 1943552f7358SJed Brown Output Parameters: 1944552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1945552f7358SJed Brown - coveredPoints - The points in the meet 1946552f7358SJed Brown 1947552f7358SJed Brown Level: intermediate 1948552f7358SJed Brown 1949552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1950552f7358SJed Brown 19513813dfbdSMatthew G Knepley Fortran Notes: 19523813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19533813dfbdSMatthew G Knepley include petsc.h90 in your code. 19543813dfbdSMatthew G Knepley 19553813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19563813dfbdSMatthew G Knepley 1957552f7358SJed Brown .keywords: mesh 1958552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1959552f7358SJed Brown @*/ 1960552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1961552f7358SJed Brown { 1962552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1963552f7358SJed Brown PetscInt *meet[2]; 1964552f7358SJed Brown PetscInt meetSize, i = 0; 1965552f7358SJed Brown PetscInt dof, off, p, c, m; 1966552f7358SJed Brown PetscErrorCode ierr; 1967552f7358SJed Brown 1968552f7358SJed Brown PetscFunctionBegin; 1969552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1970552f7358SJed Brown PetscValidPointer(points, 2); 1971552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1972552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1973552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1974552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1975552f7358SJed Brown /* Copy in cone of first point */ 1976552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1977552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1978552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1979552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1980552f7358SJed Brown } 1981552f7358SJed Brown /* Check each successive cone */ 1982552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1983552f7358SJed Brown PetscInt newMeetSize = 0; 1984552f7358SJed Brown 1985552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1986552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1987552f7358SJed Brown for (c = 0; c < dof; ++c) { 1988552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1989552f7358SJed Brown 1990552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1991552f7358SJed Brown if (point == meet[i][m]) { 1992552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1993552f7358SJed Brown break; 1994552f7358SJed Brown } 1995552f7358SJed Brown } 1996552f7358SJed Brown } 1997552f7358SJed Brown meetSize = newMeetSize; 1998552f7358SJed Brown i = 1-i; 1999552f7358SJed Brown } 2000552f7358SJed Brown *numCoveringPoints = meetSize; 2001552f7358SJed Brown *coveringPoints = meet[i]; 2002552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2003552f7358SJed Brown PetscFunctionReturn(0); 2004552f7358SJed Brown } 2005552f7358SJed Brown 2006552f7358SJed Brown #undef __FUNCT__ 2007552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2008552f7358SJed Brown /*@C 2009552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2010552f7358SJed Brown 2011552f7358SJed Brown Not Collective 2012552f7358SJed Brown 2013552f7358SJed Brown Input Parameters: 2014552f7358SJed Brown + dm - The DMPlex object 2015552f7358SJed Brown . numPoints - The number of input points for the meet 2016552f7358SJed Brown - points - The input points 2017552f7358SJed Brown 2018552f7358SJed Brown Output Parameters: 2019552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2020552f7358SJed Brown - coveredPoints - The points in the meet 2021552f7358SJed Brown 2022552f7358SJed Brown Level: intermediate 2023552f7358SJed Brown 20243813dfbdSMatthew G Knepley Fortran Notes: 20253813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20263813dfbdSMatthew G Knepley include petsc.h90 in your code. 20273813dfbdSMatthew G Knepley 20283813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20293813dfbdSMatthew G Knepley 2030552f7358SJed Brown .keywords: mesh 2031552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2032552f7358SJed Brown @*/ 2033552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2034552f7358SJed Brown { 2035552f7358SJed Brown PetscErrorCode ierr; 2036552f7358SJed Brown 2037552f7358SJed Brown PetscFunctionBegin; 2038552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2039d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2040d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2041d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2042552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2043d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2044552f7358SJed Brown PetscFunctionReturn(0); 2045552f7358SJed Brown } 2046552f7358SJed Brown 2047552f7358SJed Brown #undef __FUNCT__ 2048552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2049552f7358SJed Brown /*@C 2050552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2051552f7358SJed Brown 2052552f7358SJed Brown Not Collective 2053552f7358SJed Brown 2054552f7358SJed Brown Input Parameters: 2055552f7358SJed Brown + dm - The DMPlex object 2056552f7358SJed Brown . numPoints - The number of input points for the meet 2057552f7358SJed Brown - points - The input points 2058552f7358SJed Brown 2059552f7358SJed Brown Output Parameters: 2060552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2061552f7358SJed Brown - coveredPoints - The points in the meet 2062552f7358SJed Brown 2063552f7358SJed Brown Level: intermediate 2064552f7358SJed Brown 20653813dfbdSMatthew G Knepley Fortran Notes: 20663813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20673813dfbdSMatthew G Knepley include petsc.h90 in your code. 20683813dfbdSMatthew G Knepley 20693813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20703813dfbdSMatthew G Knepley 2071552f7358SJed Brown .keywords: mesh 2072552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2073552f7358SJed Brown @*/ 2074552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2075552f7358SJed Brown { 2076552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2077552f7358SJed Brown PetscInt *offsets, **closures; 2078552f7358SJed Brown PetscInt *meet[2]; 2079552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2080552f7358SJed Brown PetscInt p, h, c, m; 2081552f7358SJed Brown PetscErrorCode ierr; 2082552f7358SJed Brown 2083552f7358SJed Brown PetscFunctionBegin; 2084552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2085552f7358SJed Brown PetscValidPointer(points, 2); 2086552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2087552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2088552f7358SJed Brown 2089552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2090785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2091552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2092e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2093552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2094552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2095552f7358SJed Brown 2096552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2097552f7358SJed Brown PetscInt closureSize; 2098552f7358SJed Brown 2099552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21000d644c17SKarl Rupp 2101552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2102552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2103552f7358SJed Brown PetscInt pStart, pEnd, i; 2104552f7358SJed Brown 2105552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2106552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2107552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2108552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2109552f7358SJed Brown break; 2110552f7358SJed Brown } 2111552f7358SJed Brown } 2112552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2113552f7358SJed Brown } 211482f516ccSBarry 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); 2115552f7358SJed Brown } 2116552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2117552f7358SJed Brown PetscInt dof; 2118552f7358SJed Brown 2119552f7358SJed Brown /* Copy in cone of first point */ 2120552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2121552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2122552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2123552f7358SJed Brown } 2124552f7358SJed Brown /* Check each successive cone */ 2125552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2126552f7358SJed Brown PetscInt newMeetSize = 0; 2127552f7358SJed Brown 2128552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2129552f7358SJed Brown for (c = 0; c < dof; ++c) { 2130552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2131552f7358SJed Brown 2132552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2133552f7358SJed Brown if (point == meet[i][m]) { 2134552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2135552f7358SJed Brown break; 2136552f7358SJed Brown } 2137552f7358SJed Brown } 2138552f7358SJed Brown } 2139552f7358SJed Brown meetSize = newMeetSize; 2140552f7358SJed Brown i = 1-i; 2141552f7358SJed Brown } 2142552f7358SJed Brown if (meetSize) break; 2143552f7358SJed Brown } 2144552f7358SJed Brown *numCoveredPoints = meetSize; 2145552f7358SJed Brown *coveredPoints = meet[i]; 2146552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21470298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2148552f7358SJed Brown } 2149552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2150552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2151552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2152552f7358SJed Brown PetscFunctionReturn(0); 2153552f7358SJed Brown } 2154552f7358SJed Brown 2155552f7358SJed Brown #undef __FUNCT__ 21564e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21574e3744c5SMatthew G. Knepley /*@C 21584e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21594e3744c5SMatthew G. Knepley 21604e3744c5SMatthew G. Knepley Not Collective 21614e3744c5SMatthew G. Knepley 21624e3744c5SMatthew G. Knepley Input Parameters: 21634e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21644e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21654e3744c5SMatthew G. Knepley 21664e3744c5SMatthew G. Knepley Output Parameters: 21674e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21684e3744c5SMatthew G. Knepley 21694e3744c5SMatthew G. Knepley Level: intermediate 21704e3744c5SMatthew G. Knepley 21714e3744c5SMatthew G. Knepley Notes: 21724e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21734e3744c5SMatthew G. Knepley 21744e3744c5SMatthew G. Knepley .keywords: mesh 21754e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 21764e3744c5SMatthew G. Knepley @*/ 21774e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 21784e3744c5SMatthew G. Knepley { 21794e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 21804e3744c5SMatthew G. Knepley PetscErrorCode ierr; 21814e3744c5SMatthew G. Knepley 21824e3744c5SMatthew G. Knepley PetscFunctionBegin; 21834e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 21844e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 21854e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 21864e3744c5SMatthew G. Knepley 21874e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 21884e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21894e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 21904e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 21914e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 21924e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 21934e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 21944e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 21954e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 21964e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 21974e3744c5SMatthew G. Knepley 21984e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 21994e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22004e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22014e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22024e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22034e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22044e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22054e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22064e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22074e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22084e3744c5SMatthew G. Knepley } 22094e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22104e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22114e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22124e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22134e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22144e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22154e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22164e3744c5SMatthew G. Knepley } 22174e3744c5SMatthew G. Knepley } 22184e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22194e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22204e3744c5SMatthew G. Knepley } 22214e3744c5SMatthew G. Knepley 22224e3744c5SMatthew G. Knepley #undef __FUNCT__ 222318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 222418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2225a6dfd86eSKarl Rupp { 222682f516ccSBarry Smith MPI_Comm comm; 2227552f7358SJed Brown PetscErrorCode ierr; 2228552f7358SJed Brown 2229552f7358SJed Brown PetscFunctionBegin; 223082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2231552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2232552f7358SJed Brown switch (cellDim) { 2233552f7358SJed Brown case 0: 2234552f7358SJed Brown *numFaceVertices = 0; 2235552f7358SJed Brown break; 2236552f7358SJed Brown case 1: 2237552f7358SJed Brown *numFaceVertices = 1; 2238552f7358SJed Brown break; 2239552f7358SJed Brown case 2: 2240552f7358SJed Brown switch (numCorners) { 224119436ca2SJed Brown case 3: /* triangle */ 224219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2243552f7358SJed Brown break; 224419436ca2SJed Brown case 4: /* quadrilateral */ 224519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2246552f7358SJed Brown break; 224719436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 224819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2249552f7358SJed Brown break; 225019436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 225119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2252552f7358SJed Brown break; 2253552f7358SJed Brown default: 2254552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2255552f7358SJed Brown } 2256552f7358SJed Brown break; 2257552f7358SJed Brown case 3: 2258552f7358SJed Brown switch (numCorners) { 225919436ca2SJed Brown case 4: /* tetradehdron */ 226019436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2261552f7358SJed Brown break; 226219436ca2SJed Brown case 6: /* tet cohesive cells */ 226319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2264552f7358SJed Brown break; 226519436ca2SJed Brown case 8: /* hexahedron */ 226619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2267552f7358SJed Brown break; 226819436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 226919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2270552f7358SJed Brown break; 227119436ca2SJed Brown case 10: /* quadratic tetrahedron */ 227219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2273552f7358SJed Brown break; 227419436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 227519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2276552f7358SJed Brown break; 227719436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 227819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2279552f7358SJed Brown break; 228019436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 228119436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2282552f7358SJed Brown break; 2283552f7358SJed Brown default: 2284552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2285552f7358SJed Brown } 2286552f7358SJed Brown break; 2287552f7358SJed Brown default: 2288552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2289552f7358SJed Brown } 2290552f7358SJed Brown PetscFunctionReturn(0); 2291552f7358SJed Brown } 2292552f7358SJed Brown 2293552f7358SJed Brown #undef __FUNCT__ 2294d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2295d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2296d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2297d27a0f52SMatthew G. Knepley { 2298a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2299a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2300a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2301d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2302d27a0f52SMatthew G. Knepley 2303d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2304d27a0f52SMatthew G. Knepley /* Truth Table 2305d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2306d27a0f52SMatthew G. Knepley F 0 flips no F F F 2307d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2308d27a0f52SMatthew G. Knepley F 2 flips no T F T 2309d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2310d27a0f52SMatthew G. Knepley T 1 flip no 2311d27a0f52SMatthew G. Knepley T 2 flips yes 2312d27a0f52SMatthew G. Knepley */ 2313c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2314d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2315a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2316d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2317a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2318a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2319a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2320a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2321a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2322a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2323785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2324a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2325a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2326defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2327a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2328a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2329a1b4d4a2SMatthew G. Knepley 2330a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2331a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2332a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2333a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2334a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2335a1b4d4a2SMatthew G. Knepley } 2336a1b4d4a2SMatthew G. Knepley } 2337a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2338a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2339d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2340a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2341d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2342d27a0f52SMatthew G. Knepley 2343a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2344a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2346d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2347d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2348a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 234986cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2350a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 235186cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2352d27a0f52SMatthew G. Knepley 2353d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2354d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2355d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2356d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2357d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2358d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2359a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2360a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2361a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2362a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2363a1b4d4a2SMatthew G. Knepley } 2364a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2365a1b4d4a2SMatthew 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); 2366a1b4d4a2SMatthew G. Knepley } 2367a1b4d4a2SMatthew 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]); 2368a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2369a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2370a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2371a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2372a1b4d4a2SMatthew G. Knepley } 2373a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2374a1b4d4a2SMatthew 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); 2375a1b4d4a2SMatthew G. Knepley } 2376a1b4d4a2SMatthew 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]); 2377d27a0f52SMatthew G. Knepley 2378d27a0f52SMatthew G. Knepley if (dim == 1) { 2379d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2380d27a0f52SMatthew G. Knepley } else { 2381d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2382d27a0f52SMatthew G. Knepley } 2383d27a0f52SMatthew G. Knepley 2384d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2385d27a0f52SMatthew 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]); 2386d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2387a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2388d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2389a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2390d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 239186cff514SMatthew 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"); 2392a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2393a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2394d27a0f52SMatthew G. Knepley } 2395fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2396fedde076SMatthew G. Knepley { 2397fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2398fedde076SMatthew G. Knepley PetscSF sf; 2399fedde076SMatthew G. Knepley const PetscInt *lpoints; 2400fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 240113048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2402fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2403a1b4d4a2SMatthew G. Knepley 2404fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2405fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2406fedde076SMatthew G. Knepley if (numLeaves >= 0) { 240762ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 240862ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 240962ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 241013048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 241162ad4a6aSMatthew G. Knepley 2412fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2413fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2414fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2415fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2416fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2417fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2418fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2419fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2420fedde076SMatthew G. Knepley PetscInt supportSize; 2421fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2422fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2423fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2424fedde076SMatthew G. Knepley } 2425fedde076SMatthew G. Knepley } 2426fedde076SMatthew G. Knepley } 242713048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2428fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2429fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2430fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2431fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2432fedde076SMatthew G. Knepley 2433fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 243462ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2435fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2436fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24375b7033fcSMatthew G. Knepley if (dim == 1) { 24385b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24395b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24405b7033fcSMatthew G. Knepley } else { 2441fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2442fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2443fedde076SMatthew G. Knepley } 24445b7033fcSMatthew G. Knepley } 2445fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2446fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2447fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2448fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2449fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2450fedde076SMatthew G. Knepley 245113048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 245213048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 245313048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2454fedde076SMatthew G. Knepley } 245513048561SMatthew G. Knepley /* Collect the graph on 0 */ 245613048561SMatthew G. Knepley { 245713048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2458e8f90184SMatthew G. Knepley Mat G; 245913048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 246013048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 246113048561SMatthew G. Knepley PetscInt *adj = NULL; 246213048561SMatthew G. Knepley PetscBool *val = NULL; 246313048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 246413048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 246513048561SMatthew G. Knepley PetscInt debug = 0; 246613048561SMatthew G. Knepley 246713048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 246813048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 246913048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 247013048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 247113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 247213048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 247313048561SMatthew G. Knepley } 247413048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 247513048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 247613048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 247713048561SMatthew G. Knepley if (debug) { 247813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 247913048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 248013048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 248113048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 248213048561SMatthew G. Knepley } 248313048561SMatthew G. Knepley } 248413048561SMatthew G. Knepley } 2485e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2486e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2487e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2488e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2489e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2490e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 24919a4fe19dSMatthew G. Knepley const PetscInt r = p; 2492e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 24937406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2494e8f90184SMatthew G. Knepley 24957406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 24967406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2497e8f90184SMatthew G. Knepley } 2498e8f90184SMatthew G. Knepley } 2499e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2500e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2501e8f90184SMatthew G. Knepley 250213048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 250313048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 250413048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 250513048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 250613048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 250713048561SMatthew G. Knepley pTop = pBottom = 0; 250813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250913048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 251013048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 251113048561SMatthew G. Knepley procFIFO[pBottom++] = p; 251213048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 251313048561SMatthew G. Knepley /* Consider each proc in FIFO */ 251413048561SMatthew G. Knepley while (pTop < pBottom) { 2515e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2516e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2517e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 251813048561SMatthew G. Knepley 251913048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252013048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2521e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 252213048561SMatthew G. Knepley /* Loop over neighboring procs */ 2523e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2524e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25257406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 252613048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 252713048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 252813048561SMatthew G. Knepley 252913048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253013048561SMatthew 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); 253113048561SMatthew G. Knepley if (!flippedB) { 253213048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 253313048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 253413048561SMatthew 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"); 253513048561SMatthew G. Knepley if (!seen) { 253613048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 253713048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 253813048561SMatthew G. Knepley } 253913048561SMatthew G. Knepley } 254013048561SMatthew G. Knepley } 254113048561SMatthew G. Knepley } 254213048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2543e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 254413048561SMatthew G. Knepley 254513048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 254613048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 254713048561SMatthew G. Knepley { 254813048561SMatthew G. Knepley PetscBool *flips; 254913048561SMatthew G. Knepley 255013048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255213048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 255313048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 255413048561SMatthew G. Knepley } 255513048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 255613048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 255713048561SMatthew G. Knepley } 255813048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 255913048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256013048561SMatthew G. Knepley } 256113048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2562fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 256313048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2564fedde076SMatthew G. Knepley } 2565fedde076SMatthew G. Knepley } 2566fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2567d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2568d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2569d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2570a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2571f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2572f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2573d27a0f52SMatthew G. Knepley 2574a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2575a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2576a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2577a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2578a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2579a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2580a1b4d4a2SMatthew G. Knepley 2581a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2582a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2583a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2584d27a0f52SMatthew G. Knepley } 2585a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2586a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2587f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2588f4e909fcSMatthew G. Knepley faceSize = coneSize; 2589f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2590f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2591f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2592f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2593f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2594f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2595f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2596f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2597f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2598f4e909fcSMatthew G. Knepley } 2599f4e909fcSMatthew G. Knepley } 2600d27a0f52SMatthew G. Knepley } 2601d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2602d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2603d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2604a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2605a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2606a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2607d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2608d27a0f52SMatthew G. Knepley } 2609d27a0f52SMatthew G. Knepley 2610d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2611895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2612895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2613895b8c46SMatthew G. Knepley { 2614895b8c46SMatthew G. Knepley int tmpc; 2615895b8c46SMatthew G. Knepley 2616895b8c46SMatthew G. Knepley PetscFunctionBegin; 2617895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2618895b8c46SMatthew G. Knepley switch (numCorners) { 2619895b8c46SMatthew G. Knepley case 4: 2620895b8c46SMatthew G. Knepley tmpc = cone[0]; 2621895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2622895b8c46SMatthew G. Knepley cone[1] = tmpc; 2623895b8c46SMatthew G. Knepley break; 2624895b8c46SMatthew G. Knepley case 8: 2625895b8c46SMatthew G. Knepley tmpc = cone[1]; 2626895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2627895b8c46SMatthew G. Knepley cone[3] = tmpc; 2628895b8c46SMatthew G. Knepley break; 2629895b8c46SMatthew G. Knepley default: break; 2630895b8c46SMatthew G. Knepley } 2631895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2632895b8c46SMatthew G. Knepley } 2633895b8c46SMatthew G. Knepley 2634895b8c46SMatthew G. Knepley #undef __FUNCT__ 26359db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26369db3b87dSMatthew G. Knepley /*@C 26379db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26389db3b87dSMatthew G. Knepley 26399db3b87dSMatthew G. Knepley Input Parameters: 26409db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26419db3b87dSMatthew G. Knepley - cone - The incoming cone 26429db3b87dSMatthew G. Knepley 26439db3b87dSMatthew G. Knepley Output Parameter: 26449db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26459db3b87dSMatthew G. Knepley 26469db3b87dSMatthew G. Knepley Level: developer 26479db3b87dSMatthew G. Knepley 26489db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26499db3b87dSMatthew G. Knepley @*/ 26509db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26512e1b13c2SMatthew G. Knepley { 26529db3b87dSMatthew G. Knepley int tmpc; 26532e1b13c2SMatthew G. Knepley 26542e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26559db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26569db3b87dSMatthew G. Knepley switch (numCorners) { 26579db3b87dSMatthew G. Knepley case 4: 26581885f254SMatthew G. Knepley tmpc = cone[0]; 26591885f254SMatthew G. Knepley cone[0] = cone[1]; 26601885f254SMatthew G. Knepley cone[1] = tmpc; 26619db3b87dSMatthew G. Knepley break; 26629db3b87dSMatthew G. Knepley case 8: 26639db3b87dSMatthew G. Knepley tmpc = cone[1]; 26649db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26659db3b87dSMatthew G. Knepley cone[3] = tmpc; 26669db3b87dSMatthew G. Knepley break; 26679db3b87dSMatthew G. Knepley default: break; 26689db3b87dSMatthew G. Knepley } 26699db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26709db3b87dSMatthew G. Knepley } 26719db3b87dSMatthew G. Knepley 26729db3b87dSMatthew G. Knepley #undef __FUNCT__ 26739db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26749db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26759db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26769db3b87dSMatthew G. Knepley { 26779db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26789db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26799db3b87dSMatthew G. Knepley 26809db3b87dSMatthew G. Knepley PetscFunctionBegin; 26819db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26829db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26832e1b13c2SMatthew G. Knepley } 26842e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26852e1b13c2SMatthew G. Knepley } 26862e1b13c2SMatthew G. Knepley 2687519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2688552f7358SJed Brown #include <triangle.h> 2689552f7358SJed Brown 2690552f7358SJed Brown #undef __FUNCT__ 2691552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 26920adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 26930adebc6cSBarry Smith { 2694552f7358SJed Brown PetscFunctionBegin; 2695552f7358SJed Brown inputCtx->numberofpoints = 0; 2696552f7358SJed Brown inputCtx->numberofpointattributes = 0; 26970298fd71SBarry Smith inputCtx->pointlist = NULL; 26980298fd71SBarry Smith inputCtx->pointattributelist = NULL; 26990298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2700552f7358SJed Brown inputCtx->numberofsegments = 0; 27010298fd71SBarry Smith inputCtx->segmentlist = NULL; 27020298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2703552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27040298fd71SBarry Smith inputCtx->trianglelist = NULL; 2705552f7358SJed Brown inputCtx->numberofholes = 0; 27060298fd71SBarry Smith inputCtx->holelist = NULL; 2707552f7358SJed Brown inputCtx->numberofregions = 0; 27080298fd71SBarry Smith inputCtx->regionlist = NULL; 2709552f7358SJed Brown PetscFunctionReturn(0); 2710552f7358SJed Brown } 2711552f7358SJed Brown 2712552f7358SJed Brown #undef __FUNCT__ 2713552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27140adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27150adebc6cSBarry Smith { 2716552f7358SJed Brown PetscFunctionBegin; 2717552f7358SJed Brown outputCtx->numberofpoints = 0; 27180298fd71SBarry Smith outputCtx->pointlist = NULL; 27190298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27200298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2721552f7358SJed Brown outputCtx->numberoftriangles = 0; 27220298fd71SBarry Smith outputCtx->trianglelist = NULL; 27230298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27240298fd71SBarry Smith outputCtx->neighborlist = NULL; 27250298fd71SBarry Smith outputCtx->segmentlist = NULL; 27260298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2727552f7358SJed Brown outputCtx->numberofedges = 0; 27280298fd71SBarry Smith outputCtx->edgelist = NULL; 27290298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2730552f7358SJed Brown PetscFunctionReturn(0); 2731552f7358SJed Brown } 2732552f7358SJed Brown 2733552f7358SJed Brown #undef __FUNCT__ 2734552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27350adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27360adebc6cSBarry Smith { 2737552f7358SJed Brown PetscFunctionBegin; 273823b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2739552f7358SJed Brown free(outputCtx->pointmarkerlist); 274023b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 274123b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2742552f7358SJed Brown free(outputCtx->edgelist); 2743552f7358SJed Brown free(outputCtx->edgemarkerlist); 2744552f7358SJed Brown free(outputCtx->trianglelist); 2745552f7358SJed Brown free(outputCtx->neighborlist); 2746552f7358SJed Brown PetscFunctionReturn(0); 2747552f7358SJed Brown } 2748552f7358SJed Brown 2749552f7358SJed Brown #undef __FUNCT__ 2750552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2751552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2752552f7358SJed Brown { 275382f516ccSBarry Smith MPI_Comm comm; 2754552f7358SJed Brown PetscInt dim = 2; 2755552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2756552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2757552f7358SJed Brown struct triangulateio in; 2758552f7358SJed Brown struct triangulateio out; 2759552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2760552f7358SJed Brown PetscMPIInt rank; 2761552f7358SJed Brown PetscErrorCode ierr; 2762552f7358SJed Brown 2763552f7358SJed Brown PetscFunctionBegin; 276482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2765552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2766552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2767552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2768552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27690d644c17SKarl Rupp 2770552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2771552f7358SJed Brown if (in.numberofpoints > 0) { 2772552f7358SJed Brown PetscSection coordSection; 2773552f7358SJed Brown Vec coordinates; 2774552f7358SJed Brown PetscScalar *array; 2775552f7358SJed Brown 2776785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2777785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2778552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 277969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2780552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2781552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2782552f7358SJed Brown const PetscInt idx = v - vStart; 2783552f7358SJed Brown PetscInt off, d; 2784552f7358SJed Brown 2785552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2786552f7358SJed Brown for (d = 0; d < dim; ++d) { 2787552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2788552f7358SJed Brown } 2789552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2790552f7358SJed Brown } 2791552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2792552f7358SJed Brown } 2793552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2794552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2795552f7358SJed Brown if (in.numberofsegments > 0) { 2796785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2797785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2798552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2799552f7358SJed Brown const PetscInt idx = e - eStart; 2800552f7358SJed Brown const PetscInt *cone; 2801552f7358SJed Brown 2802552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28030d644c17SKarl Rupp 2804552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2805552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28060d644c17SKarl Rupp 2807552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2808552f7358SJed Brown } 2809552f7358SJed Brown } 2810552f7358SJed Brown #if 0 /* Do not currently support holes */ 2811552f7358SJed Brown PetscReal *holeCoords; 2812552f7358SJed Brown PetscInt h, d; 2813552f7358SJed Brown 2814552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2815552f7358SJed Brown if (in.numberofholes > 0) { 2816785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2817552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2818552f7358SJed Brown for (d = 0; d < dim; ++d) { 2819552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2820552f7358SJed Brown } 2821552f7358SJed Brown } 2822552f7358SJed Brown } 2823552f7358SJed Brown #endif 2824552f7358SJed Brown if (!rank) { 2825552f7358SJed Brown char args[32]; 2826552f7358SJed Brown 2827552f7358SJed Brown /* Take away 'Q' for verbose output */ 2828552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2829552f7358SJed Brown if (createConvexHull) { 2830552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2831552f7358SJed Brown } 2832552f7358SJed Brown if (constrained) { 2833552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2834552f7358SJed Brown } 28350298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2836552f7358SJed Brown } 2837552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2838552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2839552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2840552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2841552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2842552f7358SJed Brown 2843552f7358SJed Brown { 2844552f7358SJed Brown const PetscInt numCorners = 3; 2845552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2846552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2847552f7358SJed Brown const int *cells = out.trianglelist; 2848552f7358SJed Brown const double *meshCoords = out.pointlist; 2849552f7358SJed Brown 28500fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2851552f7358SJed Brown /* Set labels */ 2852552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2853552f7358SJed Brown if (out.pointmarkerlist[v]) { 2854552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2855552f7358SJed Brown } 2856552f7358SJed Brown } 2857552f7358SJed Brown if (interpolate) { 2858552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2859552f7358SJed Brown if (out.edgemarkerlist[e]) { 2860552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2861552f7358SJed Brown const PetscInt *edges; 2862552f7358SJed Brown PetscInt numEdges; 2863552f7358SJed Brown 2864552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2865552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2866552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2867552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2868552f7358SJed Brown } 2869552f7358SJed Brown } 2870552f7358SJed Brown } 2871552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2872552f7358SJed Brown } 2873552f7358SJed Brown #if 0 /* Do not currently support holes */ 2874552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2875552f7358SJed Brown #endif 2876552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2877552f7358SJed Brown PetscFunctionReturn(0); 2878552f7358SJed Brown } 2879552f7358SJed Brown 2880552f7358SJed Brown #undef __FUNCT__ 2881552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2882552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2883552f7358SJed Brown { 288482f516ccSBarry Smith MPI_Comm comm; 2885552f7358SJed Brown PetscInt dim = 2; 2886552f7358SJed Brown struct triangulateio in; 2887552f7358SJed Brown struct triangulateio out; 2888552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2889552f7358SJed Brown PetscMPIInt rank; 2890552f7358SJed Brown PetscErrorCode ierr; 2891552f7358SJed Brown 2892552f7358SJed Brown PetscFunctionBegin; 289382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2894552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2895552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2896552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2897552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2898552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2899552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29000d644c17SKarl Rupp 2901552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2902552f7358SJed Brown if (in.numberofpoints > 0) { 2903552f7358SJed Brown PetscSection coordSection; 2904552f7358SJed Brown Vec coordinates; 2905552f7358SJed Brown PetscScalar *array; 2906552f7358SJed Brown 2907785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2908785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2909552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 291069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2911552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2912552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2913552f7358SJed Brown const PetscInt idx = v - vStart; 2914552f7358SJed Brown PetscInt off, d; 2915552f7358SJed Brown 2916552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2917552f7358SJed Brown for (d = 0; d < dim; ++d) { 2918552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2919552f7358SJed Brown } 2920552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2921552f7358SJed Brown } 2922552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2923552f7358SJed Brown } 2924552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29250d644c17SKarl Rupp 2926552f7358SJed Brown in.numberofcorners = 3; 2927552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29280d644c17SKarl Rupp 2929552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2930552f7358SJed Brown if (in.numberoftriangles > 0) { 2931785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2932552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2933552f7358SJed Brown const PetscInt idx = c - cStart; 29340298fd71SBarry Smith PetscInt *closure = NULL; 2935552f7358SJed Brown PetscInt closureSize; 2936552f7358SJed Brown 2937552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2938552f7358SJed 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); 2939552f7358SJed Brown for (v = 0; v < 3; ++v) { 2940552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2941552f7358SJed Brown } 2942552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2943552f7358SJed Brown } 2944552f7358SJed Brown } 2945552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2946552f7358SJed Brown #if 0 /* Do not currently support holes */ 2947552f7358SJed Brown PetscReal *holeCoords; 2948552f7358SJed Brown PetscInt h, d; 2949552f7358SJed Brown 2950552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2951552f7358SJed Brown if (in.numberofholes > 0) { 2952785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2953552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2954552f7358SJed Brown for (d = 0; d < dim; ++d) { 2955552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2956552f7358SJed Brown } 2957552f7358SJed Brown } 2958552f7358SJed Brown } 2959552f7358SJed Brown #endif 2960552f7358SJed Brown if (!rank) { 2961552f7358SJed Brown char args[32]; 2962552f7358SJed Brown 2963552f7358SJed Brown /* Take away 'Q' for verbose output */ 2964552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29650298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2966552f7358SJed Brown } 2967552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2968552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2969552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2970552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2971552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2972552f7358SJed Brown 2973552f7358SJed Brown { 2974552f7358SJed Brown const PetscInt numCorners = 3; 2975552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2976552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2977552f7358SJed Brown const int *cells = out.trianglelist; 2978552f7358SJed Brown const double *meshCoords = out.pointlist; 2979552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2980552f7358SJed Brown 29810fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2982552f7358SJed Brown /* Set labels */ 2983552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2984552f7358SJed Brown if (out.pointmarkerlist[v]) { 2985552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2986552f7358SJed Brown } 2987552f7358SJed Brown } 2988552f7358SJed Brown if (interpolate) { 2989552f7358SJed Brown PetscInt e; 2990552f7358SJed Brown 2991552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2992552f7358SJed Brown if (out.edgemarkerlist[e]) { 2993552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2994552f7358SJed Brown const PetscInt *edges; 2995552f7358SJed Brown PetscInt numEdges; 2996552f7358SJed Brown 2997552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2998552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2999552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3000552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3001552f7358SJed Brown } 3002552f7358SJed Brown } 3003552f7358SJed Brown } 3004552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3005552f7358SJed Brown } 3006552f7358SJed Brown #if 0 /* Do not currently support holes */ 3007552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3008552f7358SJed Brown #endif 3009552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3010552f7358SJed Brown PetscFunctionReturn(0); 3011552f7358SJed Brown } 3012552f7358SJed Brown #endif 3013552f7358SJed Brown 3014519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3015552f7358SJed Brown #include <tetgen.h> 3016552f7358SJed Brown #undef __FUNCT__ 3017552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3018552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3019552f7358SJed Brown { 302082f516ccSBarry Smith MPI_Comm comm; 3021552f7358SJed Brown const PetscInt dim = 3; 3022552f7358SJed Brown ::tetgenio in; 3023552f7358SJed Brown ::tetgenio out; 3024552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3025552f7358SJed Brown PetscMPIInt rank; 3026552f7358SJed Brown PetscErrorCode ierr; 3027552f7358SJed Brown 3028552f7358SJed Brown PetscFunctionBegin; 302982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3030552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3031552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3032552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3033552f7358SJed Brown if (in.numberofpoints > 0) { 3034552f7358SJed Brown PetscSection coordSection; 3035552f7358SJed Brown Vec coordinates; 3036552f7358SJed Brown PetscScalar *array; 3037552f7358SJed Brown 3038552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3039552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30400d644c17SKarl Rupp 3041552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 304269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3043552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3044552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3045552f7358SJed Brown const PetscInt idx = v - vStart; 3046552f7358SJed Brown PetscInt off, d; 3047552f7358SJed Brown 3048552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3049a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3050552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3051552f7358SJed Brown } 3052552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3053552f7358SJed Brown } 3054552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30550d644c17SKarl Rupp 3056552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3057552f7358SJed Brown if (in.numberoffacets > 0) { 3058552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3059552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3060552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3061552f7358SJed Brown const PetscInt idx = f - fStart; 30620298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3063552f7358SJed Brown 3064552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3065552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3066552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3067552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3068552f7358SJed Brown 3069552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3070552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3071552f7358SJed Brown const PetscInt point = points[p]; 30720d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3073552f7358SJed Brown } 3074552f7358SJed Brown 3075552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3076552f7358SJed Brown poly->numberofvertices = numVertices; 3077552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3078552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3079552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3080552f7358SJed Brown poly->vertexlist[v] = vIdx; 3081552f7358SJed Brown } 3082552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3083552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3084552f7358SJed Brown } 3085552f7358SJed Brown } 3086552f7358SJed Brown if (!rank) { 3087552f7358SJed Brown char args[32]; 3088552f7358SJed Brown 3089552f7358SJed Brown /* Take away 'Q' for verbose output */ 3090552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3091552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3092552f7358SJed Brown } 3093552f7358SJed Brown { 3094552f7358SJed Brown const PetscInt numCorners = 4; 3095552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3096552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3097552f7358SJed Brown const double *meshCoords = out.pointlist; 30981d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3099552f7358SJed Brown 31009db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31010fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3102552f7358SJed Brown /* Set labels */ 3103552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3104552f7358SJed Brown if (out.pointmarkerlist[v]) { 3105552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3106552f7358SJed Brown } 3107552f7358SJed Brown } 3108552f7358SJed Brown if (interpolate) { 3109552f7358SJed Brown PetscInt e; 3110552f7358SJed Brown 3111552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3112552f7358SJed Brown if (out.edgemarkerlist[e]) { 3113552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3114552f7358SJed Brown const PetscInt *edges; 3115552f7358SJed Brown PetscInt numEdges; 3116552f7358SJed Brown 3117552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3118552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3119552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3120552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3121552f7358SJed Brown } 3122552f7358SJed Brown } 3123552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3124552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3125552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3126552f7358SJed Brown const PetscInt *faces; 3127552f7358SJed Brown PetscInt numFaces; 3128552f7358SJed Brown 3129552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3130552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3131552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3132552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3133552f7358SJed Brown } 3134552f7358SJed Brown } 3135552f7358SJed Brown } 3136552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3137552f7358SJed Brown } 3138552f7358SJed Brown PetscFunctionReturn(0); 3139552f7358SJed Brown } 3140552f7358SJed Brown 3141552f7358SJed Brown #undef __FUNCT__ 3142552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3143552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3144552f7358SJed Brown { 314582f516ccSBarry Smith MPI_Comm comm; 3146552f7358SJed Brown const PetscInt dim = 3; 3147552f7358SJed Brown ::tetgenio in; 3148552f7358SJed Brown ::tetgenio out; 3149552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3150552f7358SJed Brown PetscMPIInt rank; 3151552f7358SJed Brown PetscErrorCode ierr; 3152552f7358SJed Brown 3153552f7358SJed Brown PetscFunctionBegin; 315482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3155552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3156552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3157552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3158552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31590d644c17SKarl Rupp 3160552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3161552f7358SJed Brown if (in.numberofpoints > 0) { 3162552f7358SJed Brown PetscSection coordSection; 3163552f7358SJed Brown Vec coordinates; 3164552f7358SJed Brown PetscScalar *array; 3165552f7358SJed Brown 3166552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3167552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31680d644c17SKarl Rupp 3169552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 317069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3171552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3172552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3173552f7358SJed Brown const PetscInt idx = v - vStart; 3174552f7358SJed Brown PetscInt off, d; 3175552f7358SJed Brown 3176552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3177a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3178552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3179552f7358SJed Brown } 3180552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3181552f7358SJed Brown } 3182552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31830d644c17SKarl Rupp 3184552f7358SJed Brown in.numberofcorners = 4; 3185552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3186552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3187552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3188552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3189552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3190552f7358SJed Brown const PetscInt idx = c - cStart; 31910298fd71SBarry Smith PetscInt *closure = NULL; 3192552f7358SJed Brown PetscInt closureSize; 3193552f7358SJed Brown 3194552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3195552f7358SJed 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); 3196552f7358SJed Brown for (v = 0; v < 4; ++v) { 3197552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3198552f7358SJed Brown } 3199552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3200552f7358SJed Brown } 3201552f7358SJed Brown } 320219436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3203552f7358SJed Brown if (!rank) { 3204552f7358SJed Brown char args[32]; 3205552f7358SJed Brown 3206552f7358SJed Brown /* Take away 'Q' for verbose output */ 320719436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3208552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3209552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3210552f7358SJed Brown } 3211552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3212552f7358SJed Brown 3213552f7358SJed Brown { 3214552f7358SJed Brown const PetscInt numCorners = 4; 3215552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3216552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3217552f7358SJed Brown const double *meshCoords = out.pointlist; 32181d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32191d4b4d7bSJed Brown 3220552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3221552f7358SJed Brown 32229db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32230fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3224552f7358SJed Brown /* Set labels */ 3225552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3226552f7358SJed Brown if (out.pointmarkerlist[v]) { 3227552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3228552f7358SJed Brown } 3229552f7358SJed Brown } 3230552f7358SJed Brown if (interpolate) { 3231552f7358SJed Brown PetscInt e, f; 3232552f7358SJed Brown 3233552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3234552f7358SJed Brown if (out.edgemarkerlist[e]) { 3235552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3236552f7358SJed Brown const PetscInt *edges; 3237552f7358SJed Brown PetscInt numEdges; 3238552f7358SJed Brown 3239552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3240552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3241552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3242552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3243552f7358SJed Brown } 3244552f7358SJed Brown } 3245552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3246552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3247552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3248552f7358SJed Brown const PetscInt *faces; 3249552f7358SJed Brown PetscInt numFaces; 3250552f7358SJed Brown 3251552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3252552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3253552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3254552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3255552f7358SJed Brown } 3256552f7358SJed Brown } 3257552f7358SJed Brown } 3258552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3259552f7358SJed Brown } 3260552f7358SJed Brown PetscFunctionReturn(0); 3261552f7358SJed Brown } 3262552f7358SJed Brown #endif 3263552f7358SJed Brown 3264519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3265aaa7dc30SBarry Smith #include <ctetgen.h> 3266552f7358SJed Brown 3267552f7358SJed Brown #undef __FUNCT__ 3268552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3269552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3270552f7358SJed Brown { 327182f516ccSBarry Smith MPI_Comm comm; 3272552f7358SJed Brown const PetscInt dim = 3; 3273552f7358SJed Brown PLC *in, *out; 3274552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3275552f7358SJed Brown PetscMPIInt rank; 3276552f7358SJed Brown PetscErrorCode ierr; 3277552f7358SJed Brown 3278552f7358SJed Brown PetscFunctionBegin; 327982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32800298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3281552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3282552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3283552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3284552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32850d644c17SKarl Rupp 3286552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3287552f7358SJed Brown if (in->numberofpoints > 0) { 3288552f7358SJed Brown PetscSection coordSection; 3289552f7358SJed Brown Vec coordinates; 3290552f7358SJed Brown PetscScalar *array; 3291552f7358SJed Brown 3292785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3293785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3294552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 329569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3296552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3297552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3298552f7358SJed Brown const PetscInt idx = v - vStart; 3299552f7358SJed Brown PetscInt off, d, m; 3300552f7358SJed Brown 3301552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3302552f7358SJed Brown for (d = 0; d < dim; ++d) { 3303552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3304552f7358SJed Brown } 3305552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33060d644c17SKarl Rupp 3307552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3308552f7358SJed Brown } 3309552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3310552f7358SJed Brown } 3311552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33120d644c17SKarl Rupp 3313552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3314552f7358SJed Brown if (in->numberoffacets > 0) { 3315785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3316785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3317552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3318552f7358SJed Brown const PetscInt idx = f - fStart; 33190298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3320552f7358SJed Brown polygon *poly; 3321552f7358SJed Brown 3322552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33230d644c17SKarl Rupp 3324785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33250d644c17SKarl Rupp 3326552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33270298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3328552f7358SJed Brown 3329552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3330552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3331552f7358SJed Brown const PetscInt point = points[p]; 33320d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3333552f7358SJed Brown } 3334552f7358SJed Brown 3335552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3336552f7358SJed Brown poly->numberofvertices = numVertices; 3337785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3338552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3339552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3340552f7358SJed Brown poly->vertexlist[v] = vIdx; 3341552f7358SJed Brown } 3342552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3343552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3344552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3345552f7358SJed Brown } 3346552f7358SJed Brown } 3347552f7358SJed Brown if (!rank) { 3348552f7358SJed Brown TetGenOpts t; 3349552f7358SJed Brown 3350552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3351552f7358SJed Brown t.in = boundary; /* Should go away */ 3352552f7358SJed Brown t.plc = 1; 3353552f7358SJed Brown t.quality = 1; 3354552f7358SJed Brown t.edgesout = 1; 3355552f7358SJed Brown t.zeroindex = 1; 3356552f7358SJed Brown t.quiet = 1; 3357552f7358SJed Brown t.verbose = verbose; 3358552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3359552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3360552f7358SJed Brown } 3361552f7358SJed Brown { 3362552f7358SJed Brown const PetscInt numCorners = 4; 3363552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3364552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3365552f7358SJed Brown const double *meshCoords = out->pointlist; 33661d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3367552f7358SJed Brown 33689db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33690fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3370552f7358SJed Brown /* Set labels */ 3371552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3372552f7358SJed Brown if (out->pointmarkerlist[v]) { 3373552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3374552f7358SJed Brown } 3375552f7358SJed Brown } 3376552f7358SJed Brown if (interpolate) { 3377552f7358SJed Brown PetscInt e; 3378552f7358SJed Brown 3379552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3380552f7358SJed Brown if (out->edgemarkerlist[e]) { 3381552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3382552f7358SJed Brown const PetscInt *edges; 3383552f7358SJed Brown PetscInt numEdges; 3384552f7358SJed Brown 3385552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3386552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3387552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3388552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3389552f7358SJed Brown } 3390552f7358SJed Brown } 3391552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3392552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3393552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3394552f7358SJed Brown const PetscInt *faces; 3395552f7358SJed Brown PetscInt numFaces; 3396552f7358SJed Brown 3397552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3398552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3399552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3400552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3401552f7358SJed Brown } 3402552f7358SJed Brown } 3403552f7358SJed Brown } 3404552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3405552f7358SJed Brown } 3406552f7358SJed Brown 3407552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3408552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3409552f7358SJed Brown PetscFunctionReturn(0); 3410552f7358SJed Brown } 3411552f7358SJed Brown 3412552f7358SJed Brown #undef __FUNCT__ 3413552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3414552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3415552f7358SJed Brown { 341682f516ccSBarry Smith MPI_Comm comm; 3417552f7358SJed Brown const PetscInt dim = 3; 3418552f7358SJed Brown PLC *in, *out; 3419552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3420552f7358SJed Brown PetscMPIInt rank; 3421552f7358SJed Brown PetscErrorCode ierr; 3422552f7358SJed Brown 3423552f7358SJed Brown PetscFunctionBegin; 342482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34250298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3426552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3427552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3428552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3429552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3430552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3431552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34320d644c17SKarl Rupp 3433552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3434552f7358SJed Brown if (in->numberofpoints > 0) { 3435552f7358SJed Brown PetscSection coordSection; 3436552f7358SJed Brown Vec coordinates; 3437552f7358SJed Brown PetscScalar *array; 3438552f7358SJed Brown 3439785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3440785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3441552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 344269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3443552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3444552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3445552f7358SJed Brown const PetscInt idx = v - vStart; 3446552f7358SJed Brown PetscInt off, d, m; 3447552f7358SJed Brown 3448552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3449552f7358SJed Brown for (d = 0; d < dim; ++d) { 3450552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3451552f7358SJed Brown } 3452552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34530d644c17SKarl Rupp 3454552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3455552f7358SJed Brown } 3456552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3457552f7358SJed Brown } 3458552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34590d644c17SKarl Rupp 3460552f7358SJed Brown in->numberofcorners = 4; 3461552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3462552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3463552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3464785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3465552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3466552f7358SJed Brown const PetscInt idx = c - cStart; 34670298fd71SBarry Smith PetscInt *closure = NULL; 3468552f7358SJed Brown PetscInt closureSize; 3469552f7358SJed Brown 3470552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3471552f7358SJed 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); 3472552f7358SJed Brown for (v = 0; v < 4; ++v) { 3473552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3474552f7358SJed Brown } 3475552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3476552f7358SJed Brown } 3477552f7358SJed Brown } 3478552f7358SJed Brown if (!rank) { 3479552f7358SJed Brown TetGenOpts t; 3480552f7358SJed Brown 3481552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34820d644c17SKarl Rupp 3483552f7358SJed Brown t.in = dm; /* Should go away */ 3484552f7358SJed Brown t.refine = 1; 3485552f7358SJed Brown t.varvolume = 1; 3486552f7358SJed Brown t.quality = 1; 3487552f7358SJed Brown t.edgesout = 1; 3488552f7358SJed Brown t.zeroindex = 1; 3489552f7358SJed Brown t.quiet = 1; 3490552f7358SJed Brown t.verbose = verbose; /* Change this */ 34910d644c17SKarl Rupp 3492552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3493552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3494552f7358SJed Brown } 3495552f7358SJed Brown { 3496552f7358SJed Brown const PetscInt numCorners = 4; 3497552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3498552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3499552f7358SJed Brown const double *meshCoords = out->pointlist; 35001d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3501552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3502552f7358SJed Brown 35039db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35040fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3505552f7358SJed Brown /* Set labels */ 3506552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3507552f7358SJed Brown if (out->pointmarkerlist[v]) { 3508552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3509552f7358SJed Brown } 3510552f7358SJed Brown } 3511552f7358SJed Brown if (interpolate) { 3512552f7358SJed Brown PetscInt e, f; 3513552f7358SJed Brown 3514552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3515552f7358SJed Brown if (out->edgemarkerlist[e]) { 3516552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3517552f7358SJed Brown const PetscInt *edges; 3518552f7358SJed Brown PetscInt numEdges; 3519552f7358SJed Brown 3520552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3521552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3522552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3523552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3524552f7358SJed Brown } 3525552f7358SJed Brown } 3526552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3527552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3528552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3529552f7358SJed Brown const PetscInt *faces; 3530552f7358SJed Brown PetscInt numFaces; 3531552f7358SJed Brown 3532552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3533552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3534552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3535552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3536552f7358SJed Brown } 3537552f7358SJed Brown } 3538552f7358SJed Brown } 3539552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3540552f7358SJed Brown } 3541552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3542552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3543552f7358SJed Brown PetscFunctionReturn(0); 3544552f7358SJed Brown } 3545552f7358SJed Brown #endif 3546552f7358SJed Brown 3547552f7358SJed Brown #undef __FUNCT__ 3548552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3549552f7358SJed Brown /*@C 3550552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3551552f7358SJed Brown 3552552f7358SJed Brown Not Collective 3553552f7358SJed Brown 3554552f7358SJed Brown Input Parameters: 3555552f7358SJed Brown + boundary - The DMPlex boundary object 3556552f7358SJed Brown . name - The mesh generation package name 3557552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3558552f7358SJed Brown 3559552f7358SJed Brown Output Parameter: 3560552f7358SJed Brown . mesh - The DMPlex object 3561552f7358SJed Brown 3562552f7358SJed Brown Level: intermediate 3563552f7358SJed Brown 3564552f7358SJed Brown .keywords: mesh, elements 3565552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3566552f7358SJed Brown @*/ 3567552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3568552f7358SJed Brown { 3569552f7358SJed Brown PetscInt dim; 3570552f7358SJed Brown char genname[1024]; 3571552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3572552f7358SJed Brown PetscErrorCode ierr; 3573552f7358SJed Brown 3574552f7358SJed Brown PetscFunctionBegin; 3575552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3576552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3577c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3578552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35790d644c17SKarl Rupp if (flg) name = genname; 3580552f7358SJed Brown if (name) { 3581552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3582552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3583552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3584552f7358SJed Brown } 3585552f7358SJed Brown switch (dim) { 3586552f7358SJed Brown case 1: 3587552f7358SJed Brown if (!name || isTriangle) { 3588519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3589552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3590552f7358SJed Brown #else 359182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3592552f7358SJed Brown #endif 359382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3594552f7358SJed Brown break; 3595552f7358SJed Brown case 2: 3596552f7358SJed Brown if (!name || isCTetgen) { 3597519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3598552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3599552f7358SJed Brown #else 360082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3601552f7358SJed Brown #endif 3602552f7358SJed Brown } else if (isTetgen) { 3603519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3604552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3605552f7358SJed Brown #else 360682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3607552f7358SJed Brown #endif 360882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3609552f7358SJed Brown break; 3610552f7358SJed Brown default: 361182f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3612552f7358SJed Brown } 3613552f7358SJed Brown PetscFunctionReturn(0); 3614552f7358SJed Brown } 3615552f7358SJed Brown 3616552f7358SJed Brown #undef __FUNCT__ 3617552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3618552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3619552f7358SJed Brown { 3620552f7358SJed Brown PetscReal refinementLimit; 3621552f7358SJed Brown PetscInt dim, cStart, cEnd; 36220298fd71SBarry Smith char genname[1024], *name = NULL; 3623552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3624552f7358SJed Brown PetscErrorCode ierr; 3625552f7358SJed Brown 3626552f7358SJed Brown PetscFunctionBegin; 3627552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3628552f7358SJed Brown if (isUniform) { 3629552f7358SJed Brown CellRefiner cellRefiner; 3630552f7358SJed Brown 3631509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3632509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36338e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3634552f7358SJed Brown PetscFunctionReturn(0); 3635552f7358SJed Brown } 3636552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3637552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3638c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3639552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3640552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36410d644c17SKarl Rupp if (flg) name = genname; 3642552f7358SJed Brown if (name) { 3643552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3644552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3645552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3646552f7358SJed Brown } 3647552f7358SJed Brown switch (dim) { 3648552f7358SJed Brown case 2: 3649552f7358SJed Brown if (!name || isTriangle) { 3650519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3651552f7358SJed Brown double *maxVolumes; 3652552f7358SJed Brown PetscInt c; 3653552f7358SJed Brown 3654785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36550d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3656552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36576b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3658552f7358SJed Brown #else 365982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3660552f7358SJed Brown #endif 366182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3662552f7358SJed Brown break; 3663552f7358SJed Brown case 3: 3664552f7358SJed Brown if (!name || isCTetgen) { 3665519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3666552f7358SJed Brown PetscReal *maxVolumes; 3667552f7358SJed Brown PetscInt c; 3668552f7358SJed Brown 3669785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36700d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3671552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3672552f7358SJed Brown #else 367382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3674552f7358SJed Brown #endif 3675552f7358SJed Brown } else if (isTetgen) { 3676519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3677552f7358SJed Brown double *maxVolumes; 3678552f7358SJed Brown PetscInt c; 3679552f7358SJed Brown 3680785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36810d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3682552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3683552f7358SJed Brown #else 368482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3685552f7358SJed Brown #endif 368682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3687552f7358SJed Brown break; 3688552f7358SJed Brown default: 368982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3690552f7358SJed Brown } 36918e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3692552f7358SJed Brown PetscFunctionReturn(0); 3693552f7358SJed Brown } 3694552f7358SJed Brown 3695552f7358SJed Brown #undef __FUNCT__ 36960a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 36970a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 36980a6ba040SMatthew G. Knepley { 36990a6ba040SMatthew G. Knepley DM cdm = dm; 37000a6ba040SMatthew G. Knepley PetscInt r; 37010a6ba040SMatthew G. Knepley PetscBool isUniform; 37020a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37030a6ba040SMatthew G. Knepley 37040a6ba040SMatthew G. Knepley PetscFunctionBegin; 37050a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37060a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37070a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37080a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37090a6ba040SMatthew G. Knepley 37100a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37110a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37120a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37130a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37140a6ba040SMatthew G. Knepley } 37150a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37160a6ba040SMatthew G. Knepley } 37170a6ba040SMatthew G. Knepley 37180a6ba040SMatthew G. Knepley #undef __FUNCT__ 37190a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37200a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37210a6ba040SMatthew G. Knepley { 37220a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3723549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37240a6ba040SMatthew G. Knepley 37250a6ba040SMatthew G. Knepley PetscFunctionBegin; 3726549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37270a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37280a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37290a6ba040SMatthew G. Knepley } 37300a6ba040SMatthew G. Knepley 37310a6ba040SMatthew G. Knepley #undef __FUNCT__ 3732d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3733d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3734d49fcaecSMatthew G. Knepley { 3735d49fcaecSMatthew G. Knepley PetscInt d; 3736d49fcaecSMatthew G. Knepley 3737d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3738d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3739d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3740d49fcaecSMatthew G. Knepley } else { 3741d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3742d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3743858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3744d49fcaecSMatthew G. Knepley } else { 3745d49fcaecSMatthew G. Knepley out[d] = in[d]; 3746d49fcaecSMatthew G. Knepley } 3747d49fcaecSMatthew G. Knepley } 3748d49fcaecSMatthew G. Knepley } 3749d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3750d49fcaecSMatthew G. Knepley } 3751d49fcaecSMatthew G. Knepley 3752d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3753d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3754d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3755d49fcaecSMatthew G. Knepley { 3756d49fcaecSMatthew G. Knepley PetscInt d; 3757d49fcaecSMatthew G. Knepley 3758d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3759d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3760d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3761d49fcaecSMatthew G. Knepley } else { 3762d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3763d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3764858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3765d49fcaecSMatthew G. Knepley } else { 3766d49fcaecSMatthew G. Knepley out[d] += in[d]; 3767d49fcaecSMatthew G. Knepley } 3768d49fcaecSMatthew G. Knepley } 3769d49fcaecSMatthew G. Knepley } 3770d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3771d49fcaecSMatthew G. Knepley } 3772d49fcaecSMatthew G. Knepley 3773d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3774d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3775d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3776d49fcaecSMatthew G. Knepley { 3777d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3778d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3779d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 37808c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3781d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3782d49fcaecSMatthew G. Knepley 3783d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3784d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3785d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3786d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3787d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3788d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3789d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3790d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 37918c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 37928c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 37938c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3794d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3795d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3796d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3797d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 37988c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3799d49fcaecSMatthew G. Knepley } 3800d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3801d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3802d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38038c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3804d49fcaecSMatthew G. Knepley } 3805d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3806d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3807d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3808d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3809d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3810d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3811d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3812d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3813d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3814d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3815d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3816d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3817d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3818d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3819d49fcaecSMatthew G. Knepley } 3820d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3821d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3822d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3823d49fcaecSMatthew G. Knepley PetscInt b; 3824d49fcaecSMatthew G. Knepley 3825d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3826d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3828d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3829d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3830d49fcaecSMatthew G. Knepley } 3831d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3832d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3833d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 383446e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 3835d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3836d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3837d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3838d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3839d49fcaecSMatthew G. Knepley } 3840d49fcaecSMatthew G. Knepley 3841d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3842aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3843552f7358SJed Brown /*@ 3844aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3845552f7358SJed Brown 3846552f7358SJed Brown Not Collective 3847552f7358SJed Brown 3848aa50250dSMatthew G. Knepley Input Parameter: 3849552f7358SJed Brown . dm - The DMPlex object 3850552f7358SJed Brown 3851aa50250dSMatthew G. Knepley Output Parameter: 3852aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3853552f7358SJed Brown 3854552f7358SJed Brown Level: developer 3855552f7358SJed Brown 3856aa50250dSMatthew G. Knepley .keywords: mesh, points 3857aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3858aa50250dSMatthew G. Knepley @*/ 3859aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3860aa50250dSMatthew G. Knepley { 3861aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3862aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3863aa50250dSMatthew G. Knepley 3864aa50250dSMatthew G. Knepley PetscFunctionBegin; 3865aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3866aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 386763d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3868aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3869aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3870aa50250dSMatthew G. Knepley } 3871aa50250dSMatthew G. Knepley 3872aa50250dSMatthew G. Knepley #undef __FUNCT__ 3873aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3874aa50250dSMatthew G. Knepley /*@ 3875aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3876aa50250dSMatthew G. Knepley 3877aa50250dSMatthew G. Knepley Not Collective 3878aa50250dSMatthew G. Knepley 3879aa50250dSMatthew G. Knepley Input Parameter: 3880aa50250dSMatthew G. Knepley . dm - The DMPlex object 3881aa50250dSMatthew G. Knepley 3882aa50250dSMatthew G. Knepley Output Parameter: 3883aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3884aa50250dSMatthew G. Knepley 3885aa50250dSMatthew G. Knepley Level: developer 3886552f7358SJed Brown 3887552f7358SJed Brown .keywords: mesh, points 3888aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3889552f7358SJed Brown @*/ 3890552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3891552f7358SJed Brown { 3892aa50250dSMatthew G. Knepley DMLabel label; 3893aa50250dSMatthew G. Knepley PetscInt d = 0; 3894552f7358SJed Brown PetscErrorCode ierr; 3895552f7358SJed Brown 3896552f7358SJed Brown PetscFunctionBegin; 3897552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3898552f7358SJed Brown PetscValidPointer(depth, 2); 3899aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3900aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3901552f7358SJed Brown *depth = d-1; 3902552f7358SJed Brown PetscFunctionReturn(0); 3903552f7358SJed Brown } 3904552f7358SJed Brown 3905552f7358SJed Brown #undef __FUNCT__ 3906552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3907552f7358SJed Brown /*@ 3908552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3909552f7358SJed Brown 3910552f7358SJed Brown Not Collective 3911552f7358SJed Brown 3912552f7358SJed Brown Input Parameters: 3913552f7358SJed Brown + dm - The DMPlex object 3914552f7358SJed Brown - stratumValue - The requested depth 3915552f7358SJed Brown 3916552f7358SJed Brown Output Parameters: 3917552f7358SJed Brown + start - The first point at this depth 3918552f7358SJed Brown - end - One beyond the last point at this depth 3919552f7358SJed Brown 3920552f7358SJed Brown Level: developer 3921552f7358SJed Brown 3922552f7358SJed Brown .keywords: mesh, points 3923552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3924552f7358SJed Brown @*/ 39250adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39260adebc6cSBarry Smith { 3927aa50250dSMatthew G. Knepley DMLabel label; 392863d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3929552f7358SJed Brown PetscErrorCode ierr; 3930552f7358SJed Brown 3931552f7358SJed Brown PetscFunctionBegin; 3932552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 393363d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 393463d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3935552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39360d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 393763d1a920SMatthew G. Knepley if (stratumValue < 0) { 393863d1a920SMatthew G. Knepley if (start) *start = pStart; 393963d1a920SMatthew G. Knepley if (end) *end = pEnd; 394063d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3941552f7358SJed Brown } 3942aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 394363d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 394463d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3945552f7358SJed Brown PetscFunctionReturn(0); 3946552f7358SJed Brown } 3947552f7358SJed Brown 3948552f7358SJed Brown #undef __FUNCT__ 3949552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3950552f7358SJed Brown /*@ 3951552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3952552f7358SJed Brown 3953552f7358SJed Brown Not Collective 3954552f7358SJed Brown 3955552f7358SJed Brown Input Parameters: 3956552f7358SJed Brown + dm - The DMPlex object 3957552f7358SJed Brown - stratumValue - The requested height 3958552f7358SJed Brown 3959552f7358SJed Brown Output Parameters: 3960552f7358SJed Brown + start - The first point at this height 3961552f7358SJed Brown - end - One beyond the last point at this height 3962552f7358SJed Brown 3963552f7358SJed Brown Level: developer 3964552f7358SJed Brown 3965552f7358SJed Brown .keywords: mesh, points 3966552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3967552f7358SJed Brown @*/ 39680adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39690adebc6cSBarry Smith { 3970aa50250dSMatthew G. Knepley DMLabel label; 397163d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 3972552f7358SJed Brown PetscErrorCode ierr; 3973552f7358SJed Brown 3974552f7358SJed Brown PetscFunctionBegin; 3975552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 397663d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 397763d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3978552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39790d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 398063d1a920SMatthew G. Knepley if (stratumValue < 0) { 398163d1a920SMatthew G. Knepley if (start) *start = pStart; 398263d1a920SMatthew G. Knepley if (end) *end = pEnd; 398363d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3984552f7358SJed Brown } 3985aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3986aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 398763d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 398863d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3989552f7358SJed Brown PetscFunctionReturn(0); 3990552f7358SJed Brown } 3991552f7358SJed Brown 3992552f7358SJed Brown #undef __FUNCT__ 3993552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 3994552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 3995a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 3996a6dfd86eSKarl Rupp { 3997552f7358SJed Brown PetscInt *numDofTot; 3998916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 3999916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4000552f7358SJed Brown PetscErrorCode ierr; 4001552f7358SJed Brown 4002552f7358SJed Brown PetscFunctionBegin; 4003785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4004552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4005552f7358SJed Brown numDofTot[d] = 0; 40060d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4007552f7358SJed Brown } 400882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4009552f7358SJed Brown if (numFields > 0) { 4010552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4011552f7358SJed Brown if (numComp) { 4012552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4013552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4014552f7358SJed Brown } 4015552f7358SJed Brown } 4016552f7358SJed Brown } 4017552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4018552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4019916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4020916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4021916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4022916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4023552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4024552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4025552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4026552f7358SJed Brown } 4027552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4028552f7358SJed Brown } 4029552f7358SJed Brown } 4030552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4031552f7358SJed Brown PetscFunctionReturn(0); 4032552f7358SJed Brown } 4033552f7358SJed Brown 4034552f7358SJed Brown #undef __FUNCT__ 4035552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4036552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4037552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4038552f7358SJed Brown */ 4039a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4040a6dfd86eSKarl Rupp { 4041552f7358SJed Brown PetscInt numFields; 4042552f7358SJed Brown PetscInt bc; 4043552f7358SJed Brown PetscErrorCode ierr; 4044552f7358SJed Brown 4045552f7358SJed Brown PetscFunctionBegin; 4046552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4047552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4048552f7358SJed Brown PetscInt field = 0; 4049552f7358SJed Brown const PetscInt *idx; 4050552f7358SJed Brown PetscInt n, i; 4051552f7358SJed Brown 40520d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4053552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4054552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4055552f7358SJed Brown for (i = 0; i < n; ++i) { 4056552f7358SJed Brown const PetscInt p = idx[i]; 4057552f7358SJed Brown PetscInt numConst = constDof; 4058552f7358SJed Brown 4059552f7358SJed Brown /* Constrain every dof on the point */ 4060552f7358SJed Brown if (numConst < 0) { 4061552f7358SJed Brown if (numFields) { 4062552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4063552f7358SJed Brown } else { 4064552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4065552f7358SJed Brown } 4066552f7358SJed Brown } 4067552f7358SJed Brown if (numFields) { 4068552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4069552f7358SJed Brown } 4070552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4071552f7358SJed Brown } 4072552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4073552f7358SJed Brown } 4074552f7358SJed Brown PetscFunctionReturn(0); 4075552f7358SJed Brown } 4076552f7358SJed Brown 4077552f7358SJed Brown #undef __FUNCT__ 4078552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4079552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 40800adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 40810adebc6cSBarry Smith { 4082552f7358SJed Brown PetscInt *maxConstraints; 4083552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4084552f7358SJed Brown PetscErrorCode ierr; 4085552f7358SJed Brown 4086552f7358SJed Brown PetscFunctionBegin; 4087552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4088552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4089785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 40900d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4091552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4092552f7358SJed Brown PetscInt cdof; 4093552f7358SJed Brown 4094552f7358SJed Brown if (numFields) { 4095552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4096552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4097552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4098552f7358SJed Brown } 4099552f7358SJed Brown } else { 4100552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4101552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4102552f7358SJed Brown } 4103552f7358SJed Brown } 4104552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4105552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4106552f7358SJed Brown } 4107552f7358SJed Brown if (maxConstraints[numFields]) { 4108552f7358SJed Brown PetscInt *indices; 4109552f7358SJed Brown 4110785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4111552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4112552f7358SJed Brown PetscInt cdof, d; 4113552f7358SJed Brown 4114552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4115552f7358SJed Brown if (cdof) { 4116552f7358SJed 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]); 4117552f7358SJed Brown if (numFields) { 4118552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4119552f7358SJed Brown 4120552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4121552f7358SJed Brown PetscInt cfdof, fdof; 4122552f7358SJed Brown 4123552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4124552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4125552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41260d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4127552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41280d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4129552f7358SJed Brown numConst += cfdof; 4130552f7358SJed Brown foff += fdof; 4131552f7358SJed Brown } 4132552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4133552f7358SJed Brown } else { 41340d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4135552f7358SJed Brown } 4136552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4137552f7358SJed Brown } 4138552f7358SJed Brown } 4139552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4140552f7358SJed Brown } 4141552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4142552f7358SJed Brown PetscFunctionReturn(0); 4143552f7358SJed Brown } 4144552f7358SJed Brown 4145552f7358SJed Brown #undef __FUNCT__ 4146552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4147552f7358SJed Brown /* Set the constrained field indices on each point */ 41480adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 41490adebc6cSBarry Smith { 4150552f7358SJed Brown const PetscInt *points, *indices; 4151552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4152552f7358SJed Brown PetscErrorCode ierr; 4153552f7358SJed Brown 4154552f7358SJed Brown PetscFunctionBegin; 4155552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4156552f7358SJed 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); 4157552f7358SJed Brown 4158552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4159552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4160552f7358SJed Brown if (!constraintIndices) { 4161552f7358SJed Brown PetscInt *idx, i; 4162552f7358SJed Brown 4163552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4164785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 41650d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4166552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4167552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4168552f7358SJed Brown } 4169552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4170552f7358SJed Brown } else { 4171552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4172552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4173552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4174552f7358SJed Brown PetscInt fcdof; 4175552f7358SJed Brown 4176552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 417782f516ccSBarry 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); 4178552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4179552f7358SJed Brown } 4180552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4181552f7358SJed Brown } 4182552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4183552f7358SJed Brown PetscFunctionReturn(0); 4184552f7358SJed Brown } 4185552f7358SJed Brown 4186552f7358SJed Brown #undef __FUNCT__ 4187552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4188552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41890adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 41900adebc6cSBarry Smith { 4191552f7358SJed Brown PetscInt *indices; 4192552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4193552f7358SJed Brown PetscErrorCode ierr; 4194552f7358SJed Brown 4195552f7358SJed Brown PetscFunctionBegin; 4196552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4197785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4198552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 419982f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4200552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4201552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4202552f7358SJed Brown PetscInt cdof, d; 4203552f7358SJed Brown 4204552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4205552f7358SJed Brown if (cdof) { 4206552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4207552f7358SJed Brown 4208552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4209552f7358SJed Brown const PetscInt *fcind; 4210552f7358SJed Brown PetscInt fdof, fcdof; 4211552f7358SJed Brown 4212552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4213552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4214552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4215552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42160d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4217552f7358SJed Brown foff += fdof; 4218552f7358SJed Brown numConst += fcdof; 4219552f7358SJed Brown } 422082f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4221552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4222552f7358SJed Brown } 4223552f7358SJed Brown } 4224552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4225552f7358SJed Brown PetscFunctionReturn(0); 4226552f7358SJed Brown } 4227552f7358SJed Brown 4228552f7358SJed Brown #undef __FUNCT__ 4229552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4230552f7358SJed Brown /*@C 4231552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4232552f7358SJed Brown 4233552f7358SJed Brown Not Collective 4234552f7358SJed Brown 4235552f7358SJed Brown Input Parameters: 4236552f7358SJed Brown + dm - The DMPlex object 4237552f7358SJed Brown . dim - The spatial dimension of the problem 4238552f7358SJed Brown . numFields - The number of fields in the problem 4239552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4240552f7358SJed 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 4241552f7358SJed Brown . numBC - The number of boundary conditions 4242552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4243f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4244f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4245552f7358SJed Brown 4246552f7358SJed Brown Output Parameter: 4247552f7358SJed Brown . section - The PetscSection object 4248552f7358SJed Brown 4249552f7358SJed 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 4250f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4251f8f126e8SMatthew G. Knepley 4252f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4253552f7358SJed Brown 4254552f7358SJed Brown Level: developer 4255552f7358SJed Brown 42563813dfbdSMatthew G Knepley Fortran Notes: 42573813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 42583813dfbdSMatthew G Knepley 4259552f7358SJed Brown .keywords: mesh, elements 4260f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4261552f7358SJed Brown @*/ 4262f8f126e8SMatthew 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) 4263a6dfd86eSKarl Rupp { 4264552f7358SJed Brown PetscErrorCode ierr; 4265552f7358SJed Brown 4266552f7358SJed Brown PetscFunctionBegin; 4267552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4268552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4269f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4270552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4271552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4272ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4273552f7358SJed Brown PetscFunctionReturn(0); 4274552f7358SJed Brown } 4275552f7358SJed Brown 4276552f7358SJed Brown #undef __FUNCT__ 4277552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 42780adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 42790adebc6cSBarry Smith { 4280552f7358SJed Brown PetscSection section; 4281552f7358SJed Brown PetscErrorCode ierr; 4282552f7358SJed Brown 4283552f7358SJed Brown PetscFunctionBegin; 428438221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 428582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4286552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 42871d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4288552f7358SJed Brown PetscFunctionReturn(0); 4289552f7358SJed Brown } 4290552f7358SJed Brown 4291552f7358SJed Brown #undef __FUNCT__ 4292552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 42930adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 42940adebc6cSBarry Smith { 4295552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4296552f7358SJed Brown 4297552f7358SJed Brown PetscFunctionBegin; 4298552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4299552f7358SJed Brown if (section) *section = mesh->coneSection; 4300552f7358SJed Brown PetscFunctionReturn(0); 4301552f7358SJed Brown } 4302552f7358SJed Brown 4303552f7358SJed Brown #undef __FUNCT__ 43048cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43058cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43068cb4d582SMatthew G. Knepley { 43078cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43088cb4d582SMatthew G. Knepley 43098cb4d582SMatthew G. Knepley PetscFunctionBegin; 43108cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43118cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43128cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43138cb4d582SMatthew G. Knepley } 43148cb4d582SMatthew G. Knepley 43158cb4d582SMatthew G. Knepley #undef __FUNCT__ 4316552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4317a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4318a6dfd86eSKarl Rupp { 4319552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4320552f7358SJed Brown 4321552f7358SJed Brown PetscFunctionBegin; 4322552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4323552f7358SJed Brown if (cones) *cones = mesh->cones; 4324552f7358SJed Brown PetscFunctionReturn(0); 4325552f7358SJed Brown } 4326552f7358SJed Brown 4327552f7358SJed Brown #undef __FUNCT__ 4328552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4329a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4330a6dfd86eSKarl Rupp { 4331552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4332552f7358SJed Brown 4333552f7358SJed Brown PetscFunctionBegin; 4334552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4335552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4336552f7358SJed Brown PetscFunctionReturn(0); 4337552f7358SJed Brown } 4338552f7358SJed Brown 4339552f7358SJed Brown /******************************** FEM Support **********************************/ 4340552f7358SJed Brown 4341552f7358SJed Brown #undef __FUNCT__ 43421a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43431a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4344a6dfd86eSKarl Rupp { 4345552f7358SJed Brown PetscScalar *array, *vArray; 4346d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 43471a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4348552f7358SJed Brown PetscErrorCode ierr; 4349552f7358SJed Brown 43501b406b76SMatthew G. Knepley PetscFunctionBeginHot; 43512a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 43525a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 43535a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 43545a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 43553f7cbbe7SMatthew G. Knepley if (!values || !*values) { 43569df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43579df71ca4SMatthew G. Knepley PetscInt dof; 4358d9917b9dSMatthew G. Knepley 43599df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43609df71ca4SMatthew G. Knepley size += dof; 43619df71ca4SMatthew G. Knepley } 43629df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43639df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43642a3aaacfSMatthew G. Knepley PetscInt dof; 43655a1bb5cfSMatthew G. Knepley 43665a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 43672a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 43685a1bb5cfSMatthew G. Knepley size += dof; 43695a1bb5cfSMatthew G. Knepley } 43703f7cbbe7SMatthew G. Knepley if (!values) { 43713f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 43723f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 43733f7cbbe7SMatthew G. Knepley } 43745a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4375982e9ed1SMatthew G. Knepley } else { 4376982e9ed1SMatthew G. Knepley array = *values; 4377982e9ed1SMatthew G. Knepley } 43789df71ca4SMatthew G. Knepley size = 0; 43795a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 43809df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43819df71ca4SMatthew G. Knepley PetscInt dof, off, d; 43829df71ca4SMatthew G. Knepley PetscScalar *varr; 4383d9917b9dSMatthew G. Knepley 43849df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43859df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 43869df71ca4SMatthew G. Knepley varr = &vArray[off]; 43871a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 43881a271a75SMatthew G. Knepley array[offset] = varr[d]; 43899df71ca4SMatthew G. Knepley } 43909df71ca4SMatthew G. Knepley size += dof; 43919df71ca4SMatthew G. Knepley } 43929df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43939df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43949df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 43955a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 43965a1bb5cfSMatthew G. Knepley PetscScalar *varr; 43975a1bb5cfSMatthew G. Knepley 439852ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 43995a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44005a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44015a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44025a1bb5cfSMatthew G. Knepley if (o >= 0) { 44031a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44041a271a75SMatthew G. Knepley array[offset] = varr[d]; 44055a1bb5cfSMatthew G. Knepley } 44065a1bb5cfSMatthew G. Knepley } else { 44071a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44081a271a75SMatthew G. Knepley array[offset] = varr[d]; 44095a1bb5cfSMatthew G. Knepley } 44105a1bb5cfSMatthew G. Knepley } 44119df71ca4SMatthew G. Knepley size += dof; 44125a1bb5cfSMatthew G. Knepley } 44135a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44149df71ca4SMatthew G. Knepley if (!*values) { 44155a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44165a1bb5cfSMatthew G. Knepley *values = array; 44179df71ca4SMatthew G. Knepley } else { 44189df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44198c312ff3SMatthew G. Knepley *csize = size; 44209df71ca4SMatthew G. Knepley } 44215a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44225a1bb5cfSMatthew G. Knepley } 4423d9917b9dSMatthew G. Knepley 4424d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44251a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44261a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44271a271a75SMatthew G. Knepley { 44281a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44291a271a75SMatthew G. Knepley PetscErrorCode ierr; 44301a271a75SMatthew G. Knepley 44311a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4432fe02ba77SJed Brown *size = 0; 44331a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44341a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44351a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44361a271a75SMatthew G. Knepley PetscInt dof, off, d; 44371a271a75SMatthew G. Knepley const PetscScalar *varr; 44381a271a75SMatthew G. Knepley 44391a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44401a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44411a271a75SMatthew G. Knepley varr = &vArray[off]; 44421a271a75SMatthew G. Knepley if (o >= 0) { 44431a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44441a271a75SMatthew G. Knepley } else { 44451a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 44461a271a75SMatthew G. Knepley } 44471a271a75SMatthew G. Knepley } 44481a271a75SMatthew G. Knepley *size = offset; 44491a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44501a271a75SMatthew G. Knepley } 44511a271a75SMatthew G. Knepley 44521a271a75SMatthew G. Knepley #undef __FUNCT__ 44531a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 44541a271a75SMatthew 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[]) 44551a271a75SMatthew G. Knepley { 44561a271a75SMatthew G. Knepley PetscInt offset = 0, f; 44571a271a75SMatthew G. Knepley PetscErrorCode ierr; 44581a271a75SMatthew G. Knepley 44591a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4460fe02ba77SJed Brown *size = 0; 44611a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44621a271a75SMatthew G. Knepley PetscInt fcomp, p; 44631a271a75SMatthew G. Knepley 44641a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 44651a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44661a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44671a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44681a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 44691a271a75SMatthew G. Knepley const PetscScalar *varr; 44701a271a75SMatthew G. Knepley 44711a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 44721a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 44731a271a75SMatthew G. Knepley varr = &vArray[foff]; 44741a271a75SMatthew G. Knepley if (o >= 0) { 44751a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 44761a271a75SMatthew G. Knepley } else { 44771a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 44781a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 44791a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 44801a271a75SMatthew G. Knepley } 44811a271a75SMatthew G. Knepley } 44821a271a75SMatthew G. Knepley } 44831a271a75SMatthew G. Knepley } 44841a271a75SMatthew G. Knepley } 44851a271a75SMatthew G. Knepley *size = offset; 44861a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44871a271a75SMatthew G. Knepley } 44881a271a75SMatthew G. Knepley 44891a271a75SMatthew G. Knepley #undef __FUNCT__ 4490552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4491552f7358SJed Brown /*@C 4492552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4493552f7358SJed Brown 4494552f7358SJed Brown Not collective 4495552f7358SJed Brown 4496552f7358SJed Brown Input Parameters: 4497552f7358SJed Brown + dm - The DM 4498552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4499552f7358SJed Brown . v - The local vector 4500552f7358SJed Brown - point - The sieve point in the DM 4501552f7358SJed Brown 4502552f7358SJed Brown Output Parameters: 4503552f7358SJed Brown + csize - The number of values in the closure, or NULL 4504552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4505552f7358SJed Brown 4506552f7358SJed Brown Fortran Notes: 4507552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4508552f7358SJed Brown include petsc.h90 in your code. 4509552f7358SJed Brown 4510552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4511552f7358SJed Brown 4512552f7358SJed Brown Level: intermediate 4513552f7358SJed Brown 4514552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4515552f7358SJed Brown @*/ 4516552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4517552f7358SJed Brown { 4518552f7358SJed Brown PetscSection clSection; 4519d9917b9dSMatthew G. Knepley IS clPoints; 4520552f7358SJed Brown PetscScalar *array, *vArray; 4521552f7358SJed Brown PetscInt *points = NULL; 4522d9917b9dSMatthew G. Knepley const PetscInt *clp; 45231a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4524552f7358SJed Brown PetscErrorCode ierr; 4525552f7358SJed Brown 4526d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4527552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4528552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45291a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45301a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4531552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4532552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4533552f7358SJed Brown if (depth == 1 && numFields < 2) { 45341a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4535552f7358SJed Brown PetscFunctionReturn(0); 4536552f7358SJed Brown } 45371a271a75SMatthew G. Knepley /* Get points */ 4538d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4539d9917b9dSMatthew G. Knepley if (!clPoints) { 45401a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4541552f7358SJed Brown 45421a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4543552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4544552f7358SJed Brown /* Compress out points not in the section */ 4545552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4546552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4547552f7358SJed Brown points[q*2] = points[p]; 4548552f7358SJed Brown points[q*2+1] = points[p+1]; 4549552f7358SJed Brown ++q; 4550552f7358SJed Brown } 4551552f7358SJed Brown } 4552552f7358SJed Brown numPoints = q; 4553d9917b9dSMatthew G. Knepley } else { 4554d9917b9dSMatthew G. Knepley PetscInt dof, off; 4555552f7358SJed Brown 4556d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4557d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4558d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 45591a271a75SMatthew G. Knepley numPoints = dof/2; 4560d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4561552f7358SJed Brown } 45621a271a75SMatthew G. Knepley /* Get array */ 4563552f7358SJed Brown if (!values || !*values) { 45641a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4565552f7358SJed Brown 45661a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4567552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 45681a271a75SMatthew G. Knepley asize += dof; 4569552f7358SJed Brown } 4570bd6c0d32SMatthew G. Knepley if (!values) { 4571d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45721a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45731a271a75SMatthew G. Knepley if (csize) *csize = asize; 4574bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4575bd6c0d32SMatthew G. Knepley } 45761a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4577d0f6b257SMatthew G. Knepley } else { 4578d0f6b257SMatthew G. Knepley array = *values; 4579d0f6b257SMatthew G. Knepley } 4580552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 45811a271a75SMatthew G. Knepley /* Get values */ 4582ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 45831a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 45841a271a75SMatthew G. Knepley /* Cleanup points */ 45851a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45861a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45871a271a75SMatthew G. Knepley /* Cleanup array */ 4588552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4589d0f6b257SMatthew G. Knepley if (!*values) { 4590552f7358SJed Brown if (csize) *csize = size; 4591552f7358SJed Brown *values = array; 4592d0f6b257SMatthew G. Knepley } else { 4593d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4594d0f6b257SMatthew G. Knepley *csize = size; 4595d0f6b257SMatthew G. Knepley } 4596552f7358SJed Brown PetscFunctionReturn(0); 4597552f7358SJed Brown } 4598552f7358SJed Brown 4599552f7358SJed Brown #undef __FUNCT__ 4600552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4601552f7358SJed Brown /*@C 4602552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4603552f7358SJed Brown 4604552f7358SJed Brown Not collective 4605552f7358SJed Brown 4606552f7358SJed Brown Input Parameters: 4607552f7358SJed Brown + dm - The DM 46080298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4609552f7358SJed Brown . v - The local vector 4610552f7358SJed Brown . point - The sieve point in the DM 46110298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4612552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4613552f7358SJed Brown 46143813dfbdSMatthew G Knepley Fortran Notes: 46153813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46163813dfbdSMatthew G Knepley include petsc.h90 in your code. 46173813dfbdSMatthew G Knepley 46183813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46193813dfbdSMatthew G Knepley 4620552f7358SJed Brown Level: intermediate 4621552f7358SJed Brown 4622552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4623552f7358SJed Brown @*/ 46247c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4625a6dfd86eSKarl Rupp { 4626552f7358SJed Brown PetscInt size = 0; 4627552f7358SJed Brown PetscErrorCode ierr; 4628552f7358SJed Brown 4629552f7358SJed Brown PetscFunctionBegin; 4630552f7358SJed Brown /* Should work without recalculating size */ 4631552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4632552f7358SJed Brown PetscFunctionReturn(0); 4633552f7358SJed Brown } 4634552f7358SJed Brown 4635552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4636552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4637552f7358SJed Brown 4638552f7358SJed Brown #undef __FUNCT__ 4639552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46401a271a75SMatthew 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[]) 4641552f7358SJed Brown { 4642552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4643552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4644552f7358SJed Brown PetscScalar *a; 4645552f7358SJed Brown PetscInt off, cind = 0, k; 4646552f7358SJed Brown PetscErrorCode ierr; 4647552f7358SJed Brown 4648552f7358SJed Brown PetscFunctionBegin; 4649552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4650552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4651552f7358SJed Brown a = &array[off]; 4652552f7358SJed Brown if (!cdof || setBC) { 4653552f7358SJed Brown if (orientation >= 0) { 4654552f7358SJed Brown for (k = 0; k < dof; ++k) { 4655552f7358SJed Brown fuse(&a[k], values[k]); 4656552f7358SJed Brown } 4657552f7358SJed Brown } else { 4658552f7358SJed Brown for (k = 0; k < dof; ++k) { 4659552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4660552f7358SJed Brown } 4661552f7358SJed Brown } 4662552f7358SJed Brown } else { 4663552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4664552f7358SJed Brown if (orientation >= 0) { 4665552f7358SJed Brown for (k = 0; k < dof; ++k) { 4666552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4667552f7358SJed Brown fuse(&a[k], values[k]); 4668552f7358SJed Brown } 4669552f7358SJed Brown } else { 4670552f7358SJed Brown for (k = 0; k < dof; ++k) { 4671552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4672552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4673552f7358SJed Brown } 4674552f7358SJed Brown } 4675552f7358SJed Brown } 4676552f7358SJed Brown PetscFunctionReturn(0); 4677552f7358SJed Brown } 4678552f7358SJed Brown 4679552f7358SJed Brown #undef __FUNCT__ 4680a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 46811a271a75SMatthew 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[]) 4682a5e93ea8SMatthew G. Knepley { 4683a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4684a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4685a5e93ea8SMatthew G. Knepley PetscScalar *a; 4686a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4687a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4688a5e93ea8SMatthew G. Knepley 4689a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4690a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4691a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4692a5e93ea8SMatthew G. Knepley a = &array[off]; 4693a5e93ea8SMatthew G. Knepley if (cdof) { 4694a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4695a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4696a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4697a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4698a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4699a5e93ea8SMatthew G. Knepley ++cind; 4700a5e93ea8SMatthew G. Knepley } 4701a5e93ea8SMatthew G. Knepley } 4702a5e93ea8SMatthew G. Knepley } else { 4703a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4704a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4705a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4706a5e93ea8SMatthew G. Knepley ++cind; 4707a5e93ea8SMatthew G. Knepley } 4708a5e93ea8SMatthew G. Knepley } 4709a5e93ea8SMatthew G. Knepley } 4710a5e93ea8SMatthew G. Knepley } 4711a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4712a5e93ea8SMatthew G. Knepley } 4713a5e93ea8SMatthew G. Knepley 4714a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4715552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47161a271a75SMatthew 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[]) 4717a6dfd86eSKarl Rupp { 4718552f7358SJed Brown PetscScalar *a; 47191a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47201a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47211a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4722552f7358SJed Brown PetscErrorCode ierr; 4723552f7358SJed Brown 4724552f7358SJed Brown PetscFunctionBegin; 4725552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4726552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47271a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47281a271a75SMatthew G. Knepley a = &array[foff]; 4729552f7358SJed Brown if (!fcdof || setBC) { 47301a271a75SMatthew G. Knepley if (o >= 0) { 47311a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4732552f7358SJed Brown } else { 4733552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4734552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47351a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4736552f7358SJed Brown } 4737552f7358SJed Brown } 4738552f7358SJed Brown } 4739552f7358SJed Brown } else { 4740552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47411a271a75SMatthew G. Knepley if (o >= 0) { 4742552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4743552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47441a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4745552f7358SJed Brown } 4746552f7358SJed Brown } else { 4747552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4748552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4749552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 47501a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4751552f7358SJed Brown } 4752552f7358SJed Brown } 4753552f7358SJed Brown } 4754552f7358SJed Brown } 47551a271a75SMatthew G. Knepley *offset += fdof; 4756552f7358SJed Brown PetscFunctionReturn(0); 4757552f7358SJed Brown } 4758552f7358SJed Brown 4759552f7358SJed Brown #undef __FUNCT__ 4760a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 47611a271a75SMatthew 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[]) 4762a5e93ea8SMatthew G. Knepley { 4763a5e93ea8SMatthew G. Knepley PetscScalar *a; 47641a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47651a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47661a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4767a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4768a5e93ea8SMatthew G. Knepley 4769a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4770a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4771a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47721a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47731a271a75SMatthew G. Knepley a = &array[foff]; 4774a5e93ea8SMatthew G. Knepley if (fcdof) { 4775a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47761a271a75SMatthew G. Knepley if (o >= 0) { 4777a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4778a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 47791a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4780a5e93ea8SMatthew G. Knepley ++cind; 4781a5e93ea8SMatthew G. Knepley } 4782a5e93ea8SMatthew G. Knepley } 4783a5e93ea8SMatthew G. Knepley } else { 4784a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4785a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4786a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 47871a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4788a5e93ea8SMatthew G. Knepley ++cind; 4789a5e93ea8SMatthew G. Knepley } 4790a5e93ea8SMatthew G. Knepley } 4791a5e93ea8SMatthew G. Knepley } 4792a5e93ea8SMatthew G. Knepley } 4793a5e93ea8SMatthew G. Knepley } 47941a271a75SMatthew G. Knepley *offset += fdof; 4795a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4796a5e93ea8SMatthew G. Knepley } 4797a5e93ea8SMatthew G. Knepley 4798a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 47991b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48001a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4801a6dfd86eSKarl Rupp { 4802552f7358SJed Brown PetscScalar *array; 48031b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48041b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4805552f7358SJed Brown PetscErrorCode ierr; 4806552f7358SJed Brown 48071b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4808b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4809b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4810b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4811b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4812b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4813b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4814b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4815b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4816b6ebb6e6SMatthew G. Knepley 4817b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4818b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4819b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4820b6ebb6e6SMatthew G. Knepley { 4821b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4822b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4823b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4824b6ebb6e6SMatthew G. Knepley 4825b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4826b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4827b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4828b6ebb6e6SMatthew G. Knepley if (!cdof) { 4829b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4830b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4831b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4832b6ebb6e6SMatthew G. Knepley } 4833b6ebb6e6SMatthew G. Knepley } else { 4834b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4835b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4836b6ebb6e6SMatthew G. Knepley } 4837b6ebb6e6SMatthew G. Knepley } 4838b6ebb6e6SMatthew G. Knepley } else { 4839b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4840b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4841b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4842b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4843b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4844b6ebb6e6SMatthew G. Knepley } 4845b6ebb6e6SMatthew G. Knepley } else { 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+dof-k-1]; 4849b6ebb6e6SMatthew G. Knepley } 4850b6ebb6e6SMatthew G. Knepley } 4851b6ebb6e6SMatthew G. Knepley } 4852b6ebb6e6SMatthew G. Knepley } 4853b6ebb6e6SMatthew G. Knepley } 4854b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4855b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4856b6ebb6e6SMatthew G. Knepley } 48571b406b76SMatthew G. Knepley 48581b406b76SMatthew G. Knepley #undef __FUNCT__ 48591b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 48601b406b76SMatthew G. Knepley /*@C 48611b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 48621b406b76SMatthew G. Knepley 48631b406b76SMatthew G. Knepley Not collective 48641b406b76SMatthew G. Knepley 48651b406b76SMatthew G. Knepley Input Parameters: 48661b406b76SMatthew G. Knepley + dm - The DM 48671b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 48681b406b76SMatthew G. Knepley . v - The local vector 48691b406b76SMatthew G. Knepley . point - The sieve point in the DM 48701b406b76SMatthew G. Knepley . values - The array of values 48711b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 48721b406b76SMatthew G. Knepley 48731b406b76SMatthew G. Knepley Fortran Notes: 48741b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 48751b406b76SMatthew G. Knepley 48761b406b76SMatthew G. Knepley Level: intermediate 48771b406b76SMatthew G. Knepley 48781b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 48791b406b76SMatthew G. Knepley @*/ 48801b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 48811b406b76SMatthew G. Knepley { 48821b406b76SMatthew G. Knepley PetscSection clSection; 48831b406b76SMatthew G. Knepley IS clPoints; 48841b406b76SMatthew G. Knepley PetscScalar *array; 48851b406b76SMatthew G. Knepley PetscInt *points = NULL; 48861b406b76SMatthew G. Knepley const PetscInt *clp; 48871a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 48881b406b76SMatthew G. Knepley PetscErrorCode ierr; 48891b406b76SMatthew G. Knepley 48901a271a75SMatthew G. Knepley PetscFunctionBeginHot; 48911b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 48921b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 48931a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 48941a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 48951b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 48961b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 48971b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 48981a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 48991b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49001b406b76SMatthew G. Knepley } 49011a271a75SMatthew G. Knepley /* Get points */ 49021b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49031b406b76SMatthew G. Knepley if (!clPoints) { 49041a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49051a271a75SMatthew G. Knepley 49061a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4907552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4908552f7358SJed Brown /* Compress out points not in the section */ 4909552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4910552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4911552f7358SJed Brown points[q*2] = points[p]; 4912552f7358SJed Brown points[q*2+1] = points[p+1]; 4913552f7358SJed Brown ++q; 4914552f7358SJed Brown } 4915552f7358SJed Brown } 4916552f7358SJed Brown numPoints = q; 49171b406b76SMatthew G. Knepley } else { 49181b406b76SMatthew G. Knepley PetscInt dof, off; 4919552f7358SJed Brown 49201b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49211b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49221b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49231a271a75SMatthew G. Knepley numPoints = dof/2; 49241b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4925552f7358SJed Brown } 49261a271a75SMatthew G. Knepley /* Get array */ 4927552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49281a271a75SMatthew G. Knepley /* Get values */ 4929ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49301a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4931552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49321a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4933552f7358SJed Brown switch (mode) { 4934552f7358SJed Brown case INSERT_VALUES: 4935552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49361a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49371a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49381a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4939552f7358SJed Brown } break; 4940552f7358SJed Brown case INSERT_ALL_VALUES: 4941552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49421a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49431a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49441a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4945552f7358SJed Brown } break; 4946a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4947a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 49481a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49491a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49501a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4951a5e93ea8SMatthew G. Knepley } break; 4952552f7358SJed Brown case ADD_VALUES: 4953552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49541a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49551a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49561a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4957552f7358SJed Brown } break; 4958552f7358SJed Brown case ADD_ALL_VALUES: 4959552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49601a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49611a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49621a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 4963552f7358SJed Brown } break; 4964552f7358SJed Brown default: 496582f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4966552f7358SJed Brown } 49671a271a75SMatthew G. Knepley } 4968552f7358SJed Brown } else { 49691a271a75SMatthew G. Knepley PetscInt dof, off; 49701a271a75SMatthew G. Knepley 4971552f7358SJed Brown switch (mode) { 4972552f7358SJed Brown case INSERT_VALUES: 4973552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4974552f7358SJed Brown PetscInt o = points[p+1]; 4975552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4976552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 4977552f7358SJed Brown } break; 4978552f7358SJed Brown case INSERT_ALL_VALUES: 4979552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4980552f7358SJed Brown PetscInt o = points[p+1]; 4981552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4982552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 4983552f7358SJed Brown } break; 4984a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4985a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4986a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 4987a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4988a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 4989a5e93ea8SMatthew G. Knepley } break; 4990552f7358SJed Brown case ADD_VALUES: 4991552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4992552f7358SJed Brown PetscInt o = points[p+1]; 4993552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4994552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 4995552f7358SJed Brown } break; 4996552f7358SJed Brown case ADD_ALL_VALUES: 4997552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4998552f7358SJed Brown PetscInt o = points[p+1]; 4999552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5000552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5001552f7358SJed Brown } break; 5002552f7358SJed Brown default: 500382f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5004552f7358SJed Brown } 5005552f7358SJed Brown } 50061a271a75SMatthew G. Knepley /* Cleanup points */ 50071a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50081a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50091a271a75SMatthew G. Knepley /* Cleanup array */ 5010552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5011552f7358SJed Brown PetscFunctionReturn(0); 5012552f7358SJed Brown } 5013552f7358SJed Brown 5014552f7358SJed Brown #undef __FUNCT__ 5015e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5016e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5017e07394fbSMatthew G. Knepley { 5018e07394fbSMatthew G. Knepley PetscSection clSection; 5019e07394fbSMatthew G. Knepley IS clPoints; 5020e07394fbSMatthew G. Knepley PetscScalar *array; 5021e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5022e07394fbSMatthew G. Knepley const PetscInt *clp; 5023e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5024e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5025e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5026e07394fbSMatthew G. Knepley 5027e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5028e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5029e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5030e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5031e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5032e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5033e07394fbSMatthew G. Knepley /* Get points */ 5034e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5035e07394fbSMatthew G. Knepley if (!clPoints) { 5036e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5037e07394fbSMatthew G. Knepley 5038e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5039e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5040e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5041e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5042e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5043e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5044e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5045e07394fbSMatthew G. Knepley ++q; 5046e07394fbSMatthew G. Knepley } 5047e07394fbSMatthew G. Knepley } 5048e07394fbSMatthew G. Knepley numPoints = q; 5049e07394fbSMatthew G. Knepley } else { 5050e07394fbSMatthew G. Knepley PetscInt dof, off; 5051e07394fbSMatthew G. Knepley 5052e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5053e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5054e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5055e07394fbSMatthew G. Knepley numPoints = dof/2; 5056e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5057e07394fbSMatthew G. Knepley } 5058e07394fbSMatthew G. Knepley /* Get array */ 5059e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5060e07394fbSMatthew G. Knepley /* Get values */ 5061e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5062e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5063e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5064e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5065e07394fbSMatthew G. Knepley PetscInt fdof; 5066e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5067e07394fbSMatthew G. Knepley offset += fdof; 5068e07394fbSMatthew G. Knepley } 5069e07394fbSMatthew G. Knepley continue; 5070e07394fbSMatthew G. Knepley } 5071e07394fbSMatthew G. Knepley switch (mode) { 5072e07394fbSMatthew G. Knepley case INSERT_VALUES: 5073e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5074e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5075e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5076e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5077e07394fbSMatthew G. Knepley } break; 5078e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5079e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5080e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5081e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5082e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5083e07394fbSMatthew G. Knepley } break; 5084e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5085e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5086e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5087e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5088e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5089e07394fbSMatthew G. Knepley } break; 5090e07394fbSMatthew G. Knepley case ADD_VALUES: 5091e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5092e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5093e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5094e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5095e07394fbSMatthew G. Knepley } break; 5096e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5097e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5098e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5099e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5100e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5101e07394fbSMatthew G. Knepley } break; 5102e07394fbSMatthew G. Knepley default: 5103e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5104e07394fbSMatthew G. Knepley } 5105e07394fbSMatthew G. Knepley } 5106e07394fbSMatthew G. Knepley /* Cleanup points */ 5107e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5108e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5109e07394fbSMatthew G. Knepley /* Cleanup array */ 5110e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5111e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5112e07394fbSMatthew G. Knepley } 5113e07394fbSMatthew G. Knepley 5114e07394fbSMatthew G. Knepley #undef __FUNCT__ 5115552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5116b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5117552f7358SJed Brown { 5118552f7358SJed Brown PetscMPIInt rank; 5119552f7358SJed Brown PetscInt i, j; 5120552f7358SJed Brown PetscErrorCode ierr; 5121552f7358SJed Brown 5122552f7358SJed Brown PetscFunctionBegin; 512382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 512477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5125b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5126b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5127b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5128b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 512977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5130b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5131519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51327eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5133552f7358SJed Brown #else 5134b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5135552f7358SJed Brown #endif 5136552f7358SJed Brown } 513777a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5138552f7358SJed Brown } 5139552f7358SJed Brown PetscFunctionReturn(0); 5140552f7358SJed Brown } 5141552f7358SJed Brown 5142552f7358SJed Brown #undef __FUNCT__ 5143552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5144552f7358SJed Brown /* . off - The global offset of this point */ 5145e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5146a6dfd86eSKarl Rupp { 5147e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5148552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5149552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5150552f7358SJed Brown PetscInt cind = 0, k; 5151552f7358SJed Brown PetscErrorCode ierr; 5152552f7358SJed Brown 5153552f7358SJed Brown PetscFunctionBegin; 5154552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5155552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5156552f7358SJed Brown if (!cdof || setBC) { 5157552f7358SJed Brown if (orientation >= 0) { 5158e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5159552f7358SJed Brown } else { 5160e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5161552f7358SJed Brown } 5162552f7358SJed Brown } else { 5163552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5164552f7358SJed Brown if (orientation >= 0) { 5165552f7358SJed Brown for (k = 0; k < dof; ++k) { 5166552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5167552f7358SJed Brown /* Insert check for returning constrained indices */ 5168e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5169552f7358SJed Brown ++cind; 5170552f7358SJed Brown } else { 5171e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5172552f7358SJed Brown } 5173552f7358SJed Brown } 5174552f7358SJed Brown } else { 5175552f7358SJed Brown for (k = 0; k < dof; ++k) { 5176552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5177552f7358SJed Brown /* Insert check for returning constrained indices */ 5178e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5179552f7358SJed Brown ++cind; 5180552f7358SJed Brown } else { 5181e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5182552f7358SJed Brown } 5183552f7358SJed Brown } 5184552f7358SJed Brown } 5185552f7358SJed Brown } 5186e6ccafaeSMatthew G Knepley *loff += dof; 5187552f7358SJed Brown PetscFunctionReturn(0); 5188552f7358SJed Brown } 5189552f7358SJed Brown 5190552f7358SJed Brown #undef __FUNCT__ 5191552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5192552f7358SJed Brown /* . off - The global offset of this point */ 5193a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5194a6dfd86eSKarl Rupp { 5195552f7358SJed Brown PetscInt numFields, foff, f; 5196552f7358SJed Brown PetscErrorCode ierr; 5197552f7358SJed Brown 5198552f7358SJed Brown PetscFunctionBegin; 5199552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5200552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5201552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5202552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5203552f7358SJed Brown PetscInt cind = 0, k, c; 5204552f7358SJed Brown 5205552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5206552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5207552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5208552f7358SJed Brown if (!cfdof || setBC) { 5209552f7358SJed Brown if (orientation >= 0) { 52100d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5211552f7358SJed Brown } else { 5212552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5213552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5214552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5215552f7358SJed Brown } 5216552f7358SJed Brown } 5217552f7358SJed Brown } 5218552f7358SJed Brown } else { 5219552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5220552f7358SJed Brown if (orientation >= 0) { 5221552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5222552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5223552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5224552f7358SJed Brown ++cind; 5225552f7358SJed Brown } else { 5226552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5227552f7358SJed Brown } 5228552f7358SJed Brown } 5229552f7358SJed Brown } else { 5230552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5231552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5232552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5233552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5234552f7358SJed Brown ++cind; 5235552f7358SJed Brown } else { 5236552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5237552f7358SJed Brown } 5238552f7358SJed Brown } 5239552f7358SJed Brown } 5240552f7358SJed Brown } 5241552f7358SJed Brown } 5242552f7358SJed Brown foff += fdof - cfdof; 5243552f7358SJed Brown foffs[f] += fdof; 5244552f7358SJed Brown } 5245552f7358SJed Brown PetscFunctionReturn(0); 5246552f7358SJed Brown } 5247552f7358SJed Brown 5248552f7358SJed Brown #undef __FUNCT__ 5249552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 52507f5d1fdeSMatthew G. Knepley /*@C 52517f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 52527f5d1fdeSMatthew G. Knepley 52537f5d1fdeSMatthew G. Knepley Not collective 52547f5d1fdeSMatthew G. Knepley 52557f5d1fdeSMatthew G. Knepley Input Parameters: 52567f5d1fdeSMatthew G. Knepley + dm - The DM 5257ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5258ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 52597f5d1fdeSMatthew G. Knepley . A - The matrix 52607f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 52617f5d1fdeSMatthew G. Knepley . values - The array of values 52627f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 52637f5d1fdeSMatthew G. Knepley 52647f5d1fdeSMatthew G. Knepley Fortran Notes: 52657f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 52667f5d1fdeSMatthew G. Knepley 52677f5d1fdeSMatthew G. Knepley Level: intermediate 52687f5d1fdeSMatthew G. Knepley 52697f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 52707f5d1fdeSMatthew G. Knepley @*/ 52717c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5272552f7358SJed Brown { 5273552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 52741b406b76SMatthew G. Knepley PetscSection clSection; 52751b406b76SMatthew G. Knepley IS clPoints; 52760298fd71SBarry Smith PetscInt *points = NULL; 52771b406b76SMatthew G. Knepley const PetscInt *clp; 5278552f7358SJed Brown PetscInt *indices; 5279552f7358SJed Brown PetscInt offsets[32]; 5280552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5281552f7358SJed Brown PetscErrorCode ierr; 5282552f7358SJed Brown 5283552f7358SJed Brown PetscFunctionBegin; 5284552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5285ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 52863dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5287ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 52883dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 52893dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5290552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 529182f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5292552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 52931b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 52941b406b76SMatthew G. Knepley if (!clPoints) { 5295552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5296552f7358SJed Brown /* Compress out points not in the section */ 5297552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5298552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5299552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5300552f7358SJed Brown points[q*2] = points[p]; 5301552f7358SJed Brown points[q*2+1] = points[p+1]; 5302552f7358SJed Brown ++q; 5303552f7358SJed Brown } 5304552f7358SJed Brown } 5305552f7358SJed Brown numPoints = q; 53061b406b76SMatthew G. Knepley } else { 53071b406b76SMatthew G. Knepley PetscInt dof, off; 53081b406b76SMatthew G. Knepley 53091b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 53101b406b76SMatthew G. Knepley numPoints = dof/2; 53111b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 53121b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53131b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 53141b406b76SMatthew G. Knepley } 5315552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5316552f7358SJed Brown PetscInt fdof; 5317552f7358SJed Brown 5318552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5319552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5320552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5321552f7358SJed Brown offsets[f+1] += fdof; 5322552f7358SJed Brown } 5323552f7358SJed Brown numIndices += dof; 5324552f7358SJed Brown } 53250d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 53260d644c17SKarl Rupp 532782f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5328552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5329552f7358SJed Brown if (numFields) { 5330552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5331552f7358SJed Brown PetscInt o = points[p+1]; 5332552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5333552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5334552f7358SJed Brown } 5335552f7358SJed Brown } else { 5336e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5337552f7358SJed Brown PetscInt o = points[p+1]; 5338552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5339e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5340552f7358SJed Brown } 5341552f7358SJed Brown } 5342b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5343552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5344552f7358SJed Brown if (ierr) { 5345552f7358SJed Brown PetscMPIInt rank; 5346552f7358SJed Brown PetscErrorCode ierr2; 5347552f7358SJed Brown 534882f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 534977a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5350b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 53516a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5352552f7358SJed Brown CHKERRQ(ierr); 5353552f7358SJed Brown } 53541b406b76SMatthew G. Knepley if (!clPoints) { 5355552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 53561b406b76SMatthew G. Knepley } else { 53571b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 53581b406b76SMatthew G. Knepley } 5359552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5360552f7358SJed Brown PetscFunctionReturn(0); 5361552f7358SJed Brown } 5362552f7358SJed Brown 5363552f7358SJed Brown #undef __FUNCT__ 5364de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5365de41b84cSMatthew 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) 5366de41b84cSMatthew G. Knepley { 5367de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5368de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5369de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5370de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5371de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5372de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 53734ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5374de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5375de41b84cSMatthew G. Knepley 5376de41b84cSMatthew G. Knepley PetscFunctionBegin; 5377de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5378de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5379de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5380de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5381de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5382de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5383de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5384de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5385de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5386de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5387de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5388de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5389de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5390de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5391de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5392de41b84cSMatthew G. Knepley /* Column indices */ 5393de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 53944ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5395de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5396de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5397de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5398de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5399de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5400de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5401de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5402de41b84cSMatthew G. Knepley ++q; 5403de41b84cSMatthew G. Knepley } 5404de41b84cSMatthew G. Knepley } 5405de41b84cSMatthew G. Knepley numCPoints = q; 5406de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5407de41b84cSMatthew G. Knepley PetscInt fdof; 5408de41b84cSMatthew G. Knepley 5409de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 54104ca5e9f5SMatthew G. Knepley if (!dof) continue; 5411de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5412de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5413de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5414de41b84cSMatthew G. Knepley } 5415de41b84cSMatthew G. Knepley numCIndices += dof; 5416de41b84cSMatthew G. Knepley } 5417de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5418de41b84cSMatthew G. Knepley /* Row indices */ 5419de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5420de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 54211ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5422de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5423de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5424de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5425de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5426de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5427de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5428de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 54294ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 54304ca5e9f5SMatthew G. Knepley if (!dof) continue; 54314ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 54324ca5e9f5SMatthew G. Knepley if (s < q) continue; 5433de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5434de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5435de41b84cSMatthew G. Knepley ++q; 5436de41b84cSMatthew G. Knepley } 5437de41b84cSMatthew G. Knepley } 5438de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5439de41b84cSMatthew G. Knepley } 5440de41b84cSMatthew G. Knepley numFPoints = q; 5441de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5442de41b84cSMatthew G. Knepley PetscInt fdof; 5443de41b84cSMatthew G. Knepley 5444de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 54454ca5e9f5SMatthew G. Knepley if (!dof) continue; 5446de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5447de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5448de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5449de41b84cSMatthew G. Knepley } 5450de41b84cSMatthew G. Knepley numFIndices += dof; 5451de41b84cSMatthew G. Knepley } 5452de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5453de41b84cSMatthew G. Knepley 5454de41b84cSMatthew 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); 5455de41b84cSMatthew 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); 5456de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5457de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5458de41b84cSMatthew G. Knepley if (numFields) { 5459de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5460de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5461de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5462de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5463de41b84cSMatthew G. Knepley } 5464de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5465de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5466de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5467de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5468de41b84cSMatthew G. Knepley } 5469de41b84cSMatthew G. Knepley } else { 5470de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5471de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5472de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5473de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5474de41b84cSMatthew G. Knepley } 5475de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5476de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5477de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5478de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5479de41b84cSMatthew G. Knepley } 5480de41b84cSMatthew G. Knepley } 5481de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5482de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5483de41b84cSMatthew G. Knepley if (ierr) { 5484de41b84cSMatthew G. Knepley PetscMPIInt rank; 5485de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5486de41b84cSMatthew G. Knepley 5487de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5488de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5489de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5490de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5491de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5492de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5493de41b84cSMatthew G. Knepley } 5494549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5495de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5496de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5497de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5498de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5499de41b84cSMatthew G. Knepley } 5500de41b84cSMatthew G. Knepley 5501de41b84cSMatthew G. Knepley #undef __FUNCT__ 55027c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 55037c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 55047c927364SMatthew G. Knepley { 55057c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 55067c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 55077c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 55087c927364SMatthew G. Knepley CellRefiner cellRefiner; 55097c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 55107c927364SMatthew G. Knepley PetscErrorCode ierr; 55117c927364SMatthew G. Knepley 55127c927364SMatthew G. Knepley PetscFunctionBegin; 55137c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 55147c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 55157c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 55167c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 55177c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 55187c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 55197c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 55207c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 55217c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 55227c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 55237c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 55247c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 55257c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55267c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55277c927364SMatthew G. Knepley /* Column indices */ 55287c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 55297c927364SMatthew G. Knepley maxFPoints = numCPoints; 55307c927364SMatthew G. Knepley /* Compress out points not in the section */ 55317c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 55327c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 55337c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 55347c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 55357c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 55367c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 55377c927364SMatthew G. Knepley ++q; 55387c927364SMatthew G. Knepley } 55397c927364SMatthew G. Knepley } 55407c927364SMatthew G. Knepley numCPoints = q; 55417c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 55427c927364SMatthew G. Knepley PetscInt fdof; 55437c927364SMatthew G. Knepley 55447c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 55457c927364SMatthew G. Knepley if (!dof) continue; 55467c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55477c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 55487c927364SMatthew G. Knepley coffsets[f+1] += fdof; 55497c927364SMatthew G. Knepley } 55507c927364SMatthew G. Knepley numCIndices += dof; 55517c927364SMatthew G. Knepley } 55527c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 55537c927364SMatthew G. Knepley /* Row indices */ 55547c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 55557c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 55567c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 55577c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 55587c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 55597c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55607c927364SMatthew G. Knepley /* Compress out points not in the section */ 55617c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 55627c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 55637c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 55647c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 55657c927364SMatthew G. Knepley if (!dof) continue; 55667c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 55677c927364SMatthew G. Knepley if (s < q) continue; 55687c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 55697c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 55707c927364SMatthew G. Knepley ++q; 55717c927364SMatthew G. Knepley } 55727c927364SMatthew G. Knepley } 55737c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55747c927364SMatthew G. Knepley } 55757c927364SMatthew G. Knepley numFPoints = q; 55767c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 55777c927364SMatthew G. Knepley PetscInt fdof; 55787c927364SMatthew G. Knepley 55797c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 55807c927364SMatthew G. Knepley if (!dof) continue; 55817c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55827c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 55837c927364SMatthew G. Knepley foffsets[f+1] += fdof; 55847c927364SMatthew G. Knepley } 55857c927364SMatthew G. Knepley numFIndices += dof; 55867c927364SMatthew G. Knepley } 55877c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 55887c927364SMatthew G. Knepley 55897c927364SMatthew 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); 55907c927364SMatthew 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); 55917c927364SMatthew G. Knepley if (numFields) { 55927c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 55937c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 55947c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 55957c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 55967c927364SMatthew G. Knepley } 55977c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 55987c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 55997c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56007c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 56017c927364SMatthew G. Knepley } 56027c927364SMatthew G. Knepley } else { 56037c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 56047c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56057c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56067c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 56077c927364SMatthew G. Knepley } 56087c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 56097c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56107c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56117c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 56127c927364SMatthew G. Knepley } 56137c927364SMatthew G. Knepley } 56147c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 56157c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 56167c927364SMatthew G. Knepley PetscFunctionReturn(0); 56177c927364SMatthew G. Knepley } 56187c927364SMatthew G. Knepley 56197c927364SMatthew G. Knepley #undef __FUNCT__ 5620770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5621f96281f8SMatthew G. Knepley /*@ 5622f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5623f96281f8SMatthew G. Knepley 5624f96281f8SMatthew G. Knepley Input Parameter: 5625f96281f8SMatthew G. Knepley . dm - The DMPlex object 5626f96281f8SMatthew G. Knepley 5627f96281f8SMatthew G. Knepley Output Parameters: 5628f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5629dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5630dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5631dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5632f96281f8SMatthew G. Knepley 5633f96281f8SMatthew G. Knepley Level: developer 5634f96281f8SMatthew G. Knepley 5635dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 5636f96281f8SMatthew G. Knepley @*/ 5637770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5638552f7358SJed Brown { 5639552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5640770b213bSMatthew G Knepley PetscInt dim; 5641770b213bSMatthew G Knepley PetscErrorCode ierr; 5642552f7358SJed Brown 5643552f7358SJed Brown PetscFunctionBegin; 5644552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5645c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5646770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5647770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5648770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5649770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5650552f7358SJed Brown PetscFunctionReturn(0); 5651552f7358SJed Brown } 5652552f7358SJed Brown 5653552f7358SJed Brown #undef __FUNCT__ 5654770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5655dc5a3409SMatthew G. Knepley /*@ 5656dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5657dc5a3409SMatthew G. Knepley 5658dc5a3409SMatthew G. Knepley Input Parameters: 5659dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5660dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5661dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5662dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5663dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5664dc5a3409SMatthew G. Knepley 5665dc5a3409SMatthew G. Knepley Level: developer 5666dc5a3409SMatthew G. Knepley 5667dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5668dc5a3409SMatthew G. Knepley @*/ 5669770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5670552f7358SJed Brown { 5671552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5672770b213bSMatthew G Knepley PetscInt dim; 5673770b213bSMatthew G Knepley PetscErrorCode ierr; 5674552f7358SJed Brown 5675552f7358SJed Brown PetscFunctionBegin; 5676552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5677c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5678770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5679770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5680770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5681770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5682552f7358SJed Brown PetscFunctionReturn(0); 5683552f7358SJed Brown } 5684552f7358SJed Brown 5685552f7358SJed Brown #undef __FUNCT__ 5686552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5687552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5688552f7358SJed Brown { 5689552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5690552f7358SJed Brown 5691552f7358SJed Brown PetscFunctionBegin; 5692552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5693552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5694552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5695552f7358SJed Brown PetscFunctionReturn(0); 5696552f7358SJed Brown } 5697552f7358SJed Brown 5698552f7358SJed Brown #undef __FUNCT__ 5699552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5700552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5701552f7358SJed Brown { 5702552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5703552f7358SJed Brown 5704552f7358SJed Brown PetscFunctionBegin; 5705552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5706552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5707552f7358SJed Brown PetscFunctionReturn(0); 5708552f7358SJed Brown } 5709552f7358SJed Brown 5710552f7358SJed Brown #undef __FUNCT__ 5711552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5712552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5713ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5714552f7358SJed Brown { 5715552f7358SJed Brown PetscSection section, globalSection; 5716552f7358SJed Brown PetscInt *numbers, p; 5717552f7358SJed Brown PetscErrorCode ierr; 5718552f7358SJed Brown 5719552f7358SJed Brown PetscFunctionBegin; 572082f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5721552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5722552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5723552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5724552f7358SJed Brown } 5725552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5726552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5727785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5728552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5729552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5730ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5731ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5732552f7358SJed Brown } 573382f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5734ef48cebcSMatthew G. Knepley if (globalSize) { 5735ef48cebcSMatthew G. Knepley PetscLayout layout; 5736ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5737ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5738ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5739ef48cebcSMatthew G. Knepley } 5740552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5741552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5742552f7358SJed Brown PetscFunctionReturn(0); 5743552f7358SJed Brown } 5744552f7358SJed Brown 5745552f7358SJed Brown #undef __FUNCT__ 5746552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5747552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5748552f7358SJed Brown { 5749552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5750552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5751552f7358SJed Brown PetscErrorCode ierr; 5752552f7358SJed Brown 5753552f7358SJed Brown PetscFunctionBegin; 5754552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5755552f7358SJed Brown if (!mesh->globalCellNumbers) { 5756552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5757552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 57580298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 57590d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5760ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5761552f7358SJed Brown } 5762552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5763552f7358SJed Brown PetscFunctionReturn(0); 5764552f7358SJed Brown } 5765552f7358SJed Brown 5766552f7358SJed Brown #undef __FUNCT__ 5767552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5768552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5769552f7358SJed Brown { 5770552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5771552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5772552f7358SJed Brown PetscErrorCode ierr; 5773552f7358SJed Brown 5774552f7358SJed Brown PetscFunctionBegin; 5775552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5776552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5777552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 57780298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 57790d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5780ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5781552f7358SJed Brown } 5782552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5783552f7358SJed Brown PetscFunctionReturn(0); 5784552f7358SJed Brown } 5785552f7358SJed Brown 5786ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5787ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5788ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5789ef48cebcSMatthew G. Knepley { 5790ef48cebcSMatthew G. Knepley IS nums[4]; 5791ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5792ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5793ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5794ef48cebcSMatthew G. Knepley 5795ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5796ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5797ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5798ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5799ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5800ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5801ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5802ef48cebcSMatthew G. Knepley 5803ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5804ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5805ef48cebcSMatthew G. Knepley shift += gsize; 5806ef48cebcSMatthew G. Knepley } 5807ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5808ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5809ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5810ef48cebcSMatthew G. Knepley } 5811ef48cebcSMatthew G. Knepley 5812552f7358SJed Brown 5813552f7358SJed Brown #undef __FUNCT__ 5814552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5815552f7358SJed Brown /*@C 5816552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5817552f7358SJed Brown the local section and an SF describing the section point overlap. 5818552f7358SJed Brown 5819552f7358SJed Brown Input Parameters: 5820552f7358SJed Brown + s - The PetscSection for the local field layout 5821552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5822552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5823552f7358SJed Brown . label - The label specifying the points 5824552f7358SJed Brown - labelValue - The label stratum specifying the points 5825552f7358SJed Brown 5826552f7358SJed Brown Output Parameter: 5827552f7358SJed Brown . gsection - The PetscSection for the global field layout 5828552f7358SJed Brown 5829552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5830552f7358SJed Brown 5831552f7358SJed Brown Level: developer 5832552f7358SJed Brown 5833552f7358SJed Brown .seealso: PetscSectionCreate() 5834552f7358SJed Brown @*/ 5835552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5836552f7358SJed Brown { 58377ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5838552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5839552f7358SJed Brown PetscErrorCode ierr; 5840552f7358SJed Brown 5841552f7358SJed Brown PetscFunctionBegin; 58424c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5843552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5844552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 58457ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 58467ec39499SMatthew G. Knepley if (nroots >= 0) { 58477ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 58481795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 58497ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 58501795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 58517ec39499SMatthew G. Knepley } else { 58527ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 58537ec39499SMatthew G. Knepley } 58547ec39499SMatthew G. Knepley } 5855552f7358SJed Brown /* Mark ghost points with negative dof */ 5856552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5857552f7358SJed Brown PetscInt value; 5858552f7358SJed Brown 5859552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5860552f7358SJed Brown if (value != labelValue) continue; 5861552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5862552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5863552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5864552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 58657ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5866552f7358SJed Brown } 5867552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5868552f7358SJed Brown if (nroots >= 0) { 58697ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 58707ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5871552f7358SJed Brown if (nroots > pEnd-pStart) { 58727ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5873552f7358SJed Brown } 5874552f7358SJed Brown } 5875552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5876552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5877552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5878552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5879552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5880552f7358SJed Brown } 58814c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5882552f7358SJed Brown globalOff -= off; 5883552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5884552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 58857ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5886552f7358SJed Brown } 5887552f7358SJed Brown /* Put in negative offsets for ghost points */ 5888552f7358SJed Brown if (nroots >= 0) { 58897ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 58907ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5891552f7358SJed Brown if (nroots > pEnd-pStart) { 58927ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5893552f7358SJed Brown } 5894552f7358SJed Brown } 58957ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5896552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5897552f7358SJed Brown PetscFunctionReturn(0); 5898552f7358SJed Brown } 5899ca8062c8SMatthew G. Knepley 5900ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5901ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5902ca8062c8SMatthew G. Knepley /*@ 5903ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5904ca8062c8SMatthew G. Knepley 5905ca8062c8SMatthew G. Knepley Input Parameters: 5906ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5907ca8062c8SMatthew G. Knepley 5908ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5909ca8062c8SMatthew G. Knepley 5910ca8062c8SMatthew G. Knepley Level: developer 5911ca8062c8SMatthew G. Knepley 59129bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5913ca8062c8SMatthew G. Knepley @*/ 5914ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5915ca8062c8SMatthew G. Knepley { 5916ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5917ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5918ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5919ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5920ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5921ca8062c8SMatthew G. Knepley 5922ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5923ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5924ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5925ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5926ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5927ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5928ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5929ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5930ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5931ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 593242e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 593342e66dfaSMatthew G. Knepley PetscInt d; 593442e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 593542e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 593642e66dfaSMatthew G. Knepley } 5937ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5938ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5939ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5940ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5941ca8062c8SMatthew G. Knepley } 594242e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5943ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5944ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5945ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5946ca8062c8SMatthew G. Knepley } 5947ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5948ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5949ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5950ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5951ca8062c8SMatthew G. Knepley } 5952ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 595342e66dfaSMatthew G. Knepley if (dup) { 595442e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 595542e66dfaSMatthew G. Knepley } else { 5956ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5957ca8062c8SMatthew G. Knepley } 5958ca8062c8SMatthew G. Knepley } 595942e66dfaSMatthew G. Knepley } 5960ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5961ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5962ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5963ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5964ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5965ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5966ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5967ca8062c8SMatthew G. Knepley } 5968ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5969ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5970ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5971ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5972ca8062c8SMatthew G. Knepley } 5973ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5974ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5975ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5976ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5977ca8062c8SMatthew G. Knepley } 5978ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5979ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5980ca8062c8SMatthew G. Knepley } 5981ca8062c8SMatthew G. Knepley } 5982ca8062c8SMatthew G. Knepley } 5983ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5984ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5985ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5986ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5987ca8062c8SMatthew G. Knepley } 5988ca8062c8SMatthew G. Knepley 5989ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5990ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5991ca8062c8SMatthew G. Knepley /*@ 5992ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5993ca8062c8SMatthew G. Knepley 5994ca8062c8SMatthew G. Knepley Input Parameters: 5995ca8062c8SMatthew G. Knepley + dm - The DMPlex object 599658723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 599758723a97SMatthew G. Knepley - cellHeight - Normally 0 5998ca8062c8SMatthew G. Knepley 5999ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6000ca8062c8SMatthew G. Knepley 6001ca8062c8SMatthew G. Knepley Level: developer 6002ca8062c8SMatthew G. Knepley 60039bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6004ca8062c8SMatthew G. Knepley @*/ 600558723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6006ca8062c8SMatthew G. Knepley { 600742363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6008ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6009ca8062c8SMatthew G. Knepley 6010ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6011ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6012c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6013ca8062c8SMatthew G. Knepley switch (dim) { 601442363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 601542363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 601642363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6017ca8062c8SMatthew G. Knepley default: 6018ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6019ca8062c8SMatthew G. Knepley } 602058723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 602158723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6022ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6023ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6024ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 602558723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 602658723a97SMatthew G. Knepley 602758723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 602858723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 602958723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 603058723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 603158723a97SMatthew G. Knepley } 603258723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6033ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6034ca8062c8SMatthew G. Knepley } 603542363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 603642363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 603742363296SMatthew G. Knepley 603842363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 603942363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 604042363296SMatthew G. Knepley const PetscInt p = closure[cl]; 604142363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 604242363296SMatthew G. Knepley } 604342363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 604442363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 604542363296SMatthew G. Knepley } 6046ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6047ca8062c8SMatthew G. Knepley } 60489bf0dad6SMatthew G. Knepley 60499bf0dad6SMatthew G. Knepley #undef __FUNCT__ 60509bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 60519bf0dad6SMatthew G. Knepley /*@ 60529bf0dad6SMatthew 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 60539bf0dad6SMatthew G. Knepley 60549bf0dad6SMatthew G. Knepley Input Parameters: 60559bf0dad6SMatthew G. Knepley + dm - The DMPlex object 60569bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 60579bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 60589bf0dad6SMatthew G. Knepley 60599bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 60609bf0dad6SMatthew G. Knepley 60619bf0dad6SMatthew G. Knepley Level: developer 60629bf0dad6SMatthew G. Knepley 60639bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 60649bf0dad6SMatthew G. Knepley @*/ 60659bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 60669bf0dad6SMatthew G. Knepley { 60673554e41dSMatthew G. Knepley PetscInt pMax[4]; 60683554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 60699bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 60709bf0dad6SMatthew G. Knepley 60719bf0dad6SMatthew G. Knepley PetscFunctionBegin; 60729bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6073c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 60749bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 607525abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 60763554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 60773554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 60783554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 60799bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 60809bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 60819bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 60829bf0dad6SMatthew G. Knepley 608325abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 60849bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 60859bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 60869bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 60879bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 60889bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 60899bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 60909bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 60919bf0dad6SMatthew G. Knepley } 60923554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 60939bf0dad6SMatthew 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); 60949bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 60959bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 60969bf0dad6SMatthew G. Knepley 60979bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 60989bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 60999bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 61009bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 61019bf0dad6SMatthew G. Knepley } 6102e003ed69SMatthew 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); 61039bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6104e003ed69SMatthew 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]); 61059bf0dad6SMatthew G. Knepley } 61069bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61079bf0dad6SMatthew G. Knepley } 61089bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61099bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61109bf0dad6SMatthew G. Knepley } 61113554e41dSMatthew G. Knepley } 6112552f7358SJed Brown PetscFunctionReturn(0); 6113552f7358SJed Brown } 61143913d7c8SMatthew G. Knepley 61153913d7c8SMatthew G. Knepley #undef __FUNCT__ 6116bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6117bceba477SMatthew G. Knepley /* Pointwise interpolation 6118bceba477SMatthew G. Knepley Just code FEM for now 6119bceba477SMatthew G. Knepley u^f = I u^c 61204ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 61214ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 61224ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6123bceba477SMatthew G. Knepley */ 6124bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6125bceba477SMatthew G. Knepley { 6126bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6127bceba477SMatthew G. Knepley PetscInt m, n; 6128a063dac3SMatthew G. Knepley void *ctx; 6129bceba477SMatthew G. Knepley PetscErrorCode ierr; 6130bceba477SMatthew G. Knepley 6131bceba477SMatthew G. Knepley PetscFunctionBegin; 6132bceba477SMatthew G. Knepley /* 6133bceba477SMatthew G. Knepley Loop over coarse cells 6134bceba477SMatthew G. Knepley Loop over coarse basis functions 6135bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6136bceba477SMatthew G. Knepley Loop over fine dual basis functions 6137bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6138bceba477SMatthew G. Knepley Sum 6139bceba477SMatthew G. Knepley Update local element matrix 6140bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6141bceba477SMatthew G. Knepley 6142bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6143bceba477SMatthew G. Knepley */ 6144bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6145bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6146bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6147bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6148bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6149bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6150bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6151bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6152a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6153a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 61545d1c2e58SMatthew G. Knepley /* Use naive scaling */ 61555d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6156a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6157a063dac3SMatthew G. Knepley } 6158bceba477SMatthew G. Knepley 6159a063dac3SMatthew G. Knepley #undef __FUNCT__ 6160a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6161a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6162a063dac3SMatthew G. Knepley { 616390748bafSMatthew G. Knepley PetscErrorCode ierr; 616490748bafSMatthew G. Knepley 6165a063dac3SMatthew G. Knepley PetscFunctionBegin; 61667c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6167bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6168bceba477SMatthew G. Knepley } 6169bceba477SMatthew G. Knepley 6170bceba477SMatthew G. Knepley #undef __FUNCT__ 6171fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6172fd59a867SMatthew G. Knepley /* Pointwise interpolation 6173fd59a867SMatthew G. Knepley Just code FEM for now 6174fd59a867SMatthew G. Knepley u^f = I u^c 6175fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6176fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6177fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6178fd59a867SMatthew G. Knepley */ 6179fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6180fd59a867SMatthew G. Knepley { 6181fd59a867SMatthew G. Knepley PetscSection section; 6182fd59a867SMatthew G. Knepley IS *bcPoints; 6183286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6184286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6185fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6186fd59a867SMatthew G. Knepley 6187fd59a867SMatthew G. Knepley PetscFunctionBegin; 6188fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6189286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6190c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6191fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6192fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6193fd59a867SMatthew G. Knepley PetscBool isEssential; 619463d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6195fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6196fd59a867SMatthew G. Knepley } 6197fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6198fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6199fd59a867SMatthew G. Knepley const char *bdLabel; 6200fd59a867SMatthew G. Knepley DMLabel label; 6201fd59a867SMatthew G. Knepley const PetscInt *values; 62027391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6203c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6204fd59a867SMatthew G. Knepley 620563d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6206fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6207fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 62087391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 62097391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 62107391c1cbSMatthew G. Knepley const char *bdname; 62112f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 62127391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 62137391c1cbSMatthew G. Knepley if (duplicate) break; 62147391c1cbSMatthew G. Knepley } 62157391c1cbSMatthew G. Knepley if (!duplicate) { 6216fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 621732720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 62187391c1cbSMatthew G. Knepley } 621993a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6220fd59a867SMatthew G. Knepley if (isEssential) { 622193a5981aSMatthew G. Knepley IS tmp; 622293a5981aSMatthew G. Knepley PetscInt *newidx; 622393a5981aSMatthew G. Knepley const PetscInt *idx; 622493a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 622593a5981aSMatthew G. Knepley 6226fd59a867SMatthew G. Knepley bcFields[bc] = field; 622793a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 622893a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 622993a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 623093a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 623193a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 623293a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 623393a5981aSMatthew G. Knepley newn = 0; 623493a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 623593a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 623693a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 623793a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6238fd59a867SMatthew G. Knepley } 6239fd59a867SMatthew G. Knepley } 6240fd59a867SMatthew G. Knepley /* Handle discretization */ 6241fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6242286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6243fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6244fd59a867SMatthew G. Knepley PetscFE fe; 6245286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6246fd59a867SMatthew G. Knepley PetscInt d; 6247fd59a867SMatthew G. Knepley 624818abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6249fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6250286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6251286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6252fd59a867SMatthew G. Knepley } 6253286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6254286d8613SMatthew G. Knepley PetscInt d; 6255286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6256286d8613SMatthew 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."); 6257286d8613SMatthew G. Knepley } 6258286d8613SMatthew G. Knepley } 6259f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6260fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6261fd59a867SMatthew G. Knepley PetscFE fe; 6262fd59a867SMatthew G. Knepley const char *name; 626318abd763SMatthew G. Knepley 626418abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6265fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6266fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6267fd59a867SMatthew G. Knepley } 6268fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6269fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6270fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6271fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6272286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6273bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6274bceba477SMatthew G. Knepley } 6275bceba477SMatthew G. Knepley 6276bceba477SMatthew G. Knepley #undef __FUNCT__ 62773913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 62783913d7c8SMatthew G. Knepley /*@ 62793913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 62803913d7c8SMatthew G. Knepley 62813913d7c8SMatthew G. Knepley Input Parameter: 62823913d7c8SMatthew G. Knepley . dm - The DMPlex object 62833913d7c8SMatthew G. Knepley 62843913d7c8SMatthew G. Knepley Output Parameter: 62853913d7c8SMatthew G. Knepley . cdm - The coarse DM 62863913d7c8SMatthew G. Knepley 62873913d7c8SMatthew G. Knepley Level: intermediate 62883913d7c8SMatthew G. Knepley 62893913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 62903913d7c8SMatthew G. Knepley @*/ 62913913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 62923913d7c8SMatthew G. Knepley { 62933913d7c8SMatthew G. Knepley PetscFunctionBegin; 62943913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 62953913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 62963913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 62973913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 62983913d7c8SMatthew G. Knepley } 62993913d7c8SMatthew G. Knepley 63003913d7c8SMatthew G. Knepley #undef __FUNCT__ 63013913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 63023913d7c8SMatthew G. Knepley /*@ 63033913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 63043913d7c8SMatthew G. Knepley 63053913d7c8SMatthew G. Knepley Input Parameters: 63063913d7c8SMatthew G. Knepley + dm - The DMPlex object 63073913d7c8SMatthew G. Knepley - cdm - The coarse DM 63083913d7c8SMatthew G. Knepley 63093913d7c8SMatthew G. Knepley Level: intermediate 63103913d7c8SMatthew G. Knepley 63113913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 63123913d7c8SMatthew G. Knepley @*/ 63133913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 63143913d7c8SMatthew G. Knepley { 63153913d7c8SMatthew G. Knepley DM_Plex *mesh; 63163913d7c8SMatthew G. Knepley PetscErrorCode ierr; 63173913d7c8SMatthew G. Knepley 63183913d7c8SMatthew G. Knepley PetscFunctionBegin; 63193913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63203913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 63213913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 63223913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 63233913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 63243913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 63253913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63263913d7c8SMatthew G. Knepley } 6327