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; 22*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 237e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 257e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley if (field >= 0) { 277e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 287e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 297e42fee7SMatthew G. Knepley } else { 307e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley } 337e42fee7SMatthew G. Knepley if (vdof) { 347e42fee7SMatthew G. Knepley *sStart = vStart; 357e42fee7SMatthew G. Knepley *sEnd = vEnd; 367e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 377e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 387e42fee7SMatthew G. Knepley } else if (cdof) { 397e42fee7SMatthew G. Knepley *sStart = cStart; 407e42fee7SMatthew G. Knepley *sEnd = cEnd; 417e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 427e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 437e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 447e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 457e42fee7SMatthew G. Knepley } 467e42fee7SMatthew G. Knepley 47552f7358SJed Brown #undef __FUNCT__ 48552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 49552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 50552f7358SJed Brown { 51552f7358SJed Brown DM dm; 52b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 53552f7358SJed Brown PetscErrorCode ierr; 54552f7358SJed Brown 55552f7358SJed Brown PetscFunctionBegin; 56552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 58552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 59b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 60b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 61ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 62ef31f671SMatthew G. Knepley PetscInt numFields; 63ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 64ef31f671SMatthew G. Knepley 65ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 66ef31f671SMatthew G. Knepley if (numFields) { 67ef31f671SMatthew G. Knepley PetscObject fe; 68ef31f671SMatthew G. Knepley 69ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 70ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 71ef31f671SMatthew G. Knepley } 724959657aSMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr);} 73ef31f671SMatthew G. Knepley } 74552f7358SJed Brown if (isvtk) { 75552f7358SJed Brown PetscSection section; 76b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 77b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 78552f7358SJed Brown 79552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 807afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 81552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 82552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 83552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 84b136c2c9SMatthew G. Knepley } else if (ishdf5) { 85b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 86b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 87b136c2c9SMatthew G. Knepley #else 88b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 89b136c2c9SMatthew G. Knepley #endif 90552f7358SJed Brown } else { 9155f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9255f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 93552f7358SJed Brown } 94552f7358SJed Brown PetscFunctionReturn(0); 95552f7358SJed Brown } 96552f7358SJed Brown 97552f7358SJed Brown #undef __FUNCT__ 98552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 99552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 100552f7358SJed Brown { 101552f7358SJed Brown DM dm; 10255f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 103552f7358SJed Brown PetscErrorCode ierr; 104552f7358SJed Brown 105552f7358SJed Brown PetscFunctionBegin; 106552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 10782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 108552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 10933c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11055f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 111552f7358SJed Brown if (isvtk) { 112552f7358SJed Brown Vec locv; 113552f7358SJed Brown const char *name; 114552f7358SJed Brown 115552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 116552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 117552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 118552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 119552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 120552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 122b136c2c9SMatthew G. Knepley } else if (ishdf5) { 123b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 124b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 125b136c2c9SMatthew G. Knepley #else 126b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 127b136c2c9SMatthew G. Knepley #endif 128552f7358SJed Brown } else { 12955f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13055f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 131552f7358SJed Brown } 132552f7358SJed Brown PetscFunctionReturn(0); 133552f7358SJed Brown } 134552f7358SJed Brown 135552f7358SJed Brown #undef __FUNCT__ 1362c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1372c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1382c40f234SMatthew G. Knepley { 1392c40f234SMatthew G. Knepley DM dm; 1402c40f234SMatthew G. Knepley PetscBool ishdf5; 1412c40f234SMatthew G. Knepley PetscErrorCode ierr; 1422c40f234SMatthew G. Knepley 1432c40f234SMatthew G. Knepley PetscFunctionBegin; 1442c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1452c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1462c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1472c40f234SMatthew G. Knepley if (ishdf5) { 1482c40f234SMatthew G. Knepley DM dmBC; 1492c40f234SMatthew G. Knepley Vec gv; 1502c40f234SMatthew G. Knepley const char *name; 1512c40f234SMatthew G. Knepley 1522c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1532c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1542c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley } else { 1612c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley } 1632c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1642c40f234SMatthew G. Knepley } 1652c40f234SMatthew G. Knepley 1662c40f234SMatthew G. Knepley #undef __FUNCT__ 1672c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1682c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1692c40f234SMatthew G. Knepley { 1702c40f234SMatthew G. Knepley DM dm; 1712c40f234SMatthew G. Knepley PetscBool ishdf5; 1722c40f234SMatthew G. Knepley PetscErrorCode ierr; 1732c40f234SMatthew G. Knepley 1742c40f234SMatthew G. Knepley PetscFunctionBegin; 1752c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1762c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1782c40f234SMatthew G. Knepley if (ishdf5) { 179878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 180b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 181b136c2c9SMatthew G. Knepley #else 182b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 183878b459fSMatthew G. Knepley #endif 1842c40f234SMatthew G. Knepley } else { 1852c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 186552f7358SJed Brown } 187552f7358SJed Brown PetscFunctionReturn(0); 188552f7358SJed Brown } 189552f7358SJed Brown 190552f7358SJed Brown #undef __FUNCT__ 191552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 192552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 193552f7358SJed Brown { 194552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 195552f7358SJed Brown DM cdm; 196552f7358SJed Brown DMLabel markers; 197552f7358SJed Brown PetscSection coordSection; 198552f7358SJed Brown Vec coordinates; 199552f7358SJed Brown PetscViewerFormat format; 200552f7358SJed Brown PetscErrorCode ierr; 201552f7358SJed Brown 202552f7358SJed Brown PetscFunctionBegin; 203552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 204552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 205552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 206552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 207552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 208552f7358SJed Brown const char *name; 209552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 210552f7358SJed Brown PetscInt pStart, pEnd, p; 211552f7358SJed Brown PetscMPIInt rank, size; 212552f7358SJed Brown 21382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21482f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 215552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 216552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 217552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 220552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 221552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 223552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 224552f7358SJed Brown PetscInt dof, off, s; 225552f7358SJed Brown 226552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 228552f7358SJed Brown for (s = off; s < off+dof; ++s) { 229552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 230552f7358SJed Brown } 231552f7358SJed Brown } 232552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 233552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 234552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 235552f7358SJed Brown PetscInt dof, off, c; 236552f7358SJed Brown 237552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 238552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 239552f7358SJed Brown for (c = off; c < off+dof; ++c) { 240552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 241552f7358SJed Brown } 242552f7358SJed Brown } 243552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2440298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 245552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 246552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 247552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 248552f7358SJed Brown if (size > 1) { 249552f7358SJed Brown PetscSF sf; 250552f7358SJed Brown 251552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 253552f7358SJed Brown } 254552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 255552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 256552f7358SJed Brown const char *name; 257552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 258552f7358SJed Brown const int numColors = 3; 259552f7358SJed Brown PetscReal scale = 2.0; 260552f7358SJed Brown PetscScalar *coords; 261552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 262552f7358SJed Brown PetscMPIInt rank, size; 263552f7358SJed Brown 264552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 26582f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 26682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 267552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 268552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 269770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 270770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 271552f7358SJed Brown \\usepackage{tikz}\n\ 272552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 273552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 274552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 275552f7358SJed Brown \\begin{document}\n\ 276552f7358SJed Brown \\section{%s}\n\ 277770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 278770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 279770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 280770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 281770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 282770b213bSMatthew G Knepley } else if (p > 0) { 283770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 284770b213bSMatthew G Knepley } 285770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 286770b213bSMatthew G Knepley } 287770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 288770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 289552f7358SJed Brown /* Plot vertices */ 290552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 291552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 292552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 293552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 294552f7358SJed Brown PetscInt off, dof, d; 295552f7358SJed Brown 296552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 297552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 298552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 299552f7358SJed Brown for (d = 0; d < dof; ++d) { 300552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3016712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 302552f7358SJed Brown } 303552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 304552f7358SJed Brown } 305552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 307552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 308552f7358SJed Brown /* Plot edges */ 309552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 310552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 311552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 312552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 313552f7358SJed Brown const PetscInt *cone; 314552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 315552f7358SJed Brown 316552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 31782f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 318552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 319552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 320552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 321552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 322552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 323552f7358SJed Brown for (d = 0; d < dof; ++d) { 324552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3256712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 326552f7358SJed Brown } 327552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 328552f7358SJed Brown } 329552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 330552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 331552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 332552f7358SJed Brown /* Plot cells */ 333552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 334552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3350298fd71SBarry Smith PetscInt *closure = NULL; 336552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 337552f7358SJed Brown 338552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 339552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 340552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 341552f7358SJed Brown const PetscInt point = closure[p]; 342552f7358SJed Brown 343552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 344552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 345552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 346552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 347552f7358SJed Brown } 348552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 349552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 350552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 351552f7358SJed Brown } 352552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 353552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 354770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 355552f7358SJed Brown } else { 35682f516ccSBarry Smith MPI_Comm comm; 357834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 358834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 359552f7358SJed Brown PetscInt pStart, pEnd, p; 360a57dd577SMatthew G Knepley PetscInt numLabels, l; 3611143a3c0SMatthew G. Knepley const char *name; 362552f7358SJed Brown PetscMPIInt size; 363552f7358SJed Brown 36482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 365552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 366*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3675f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3681143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3691143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 370552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 371552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 372bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 373dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 374552f7358SJed Brown if (depth == 1) { 375552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 376552f7358SJed Brown pEnd = pEnd - pStart; 377552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 378552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 379552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 380552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 381552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 382552f7358SJed Brown pEnd = pEnd - pStart; 383552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 384552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 385552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 386552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 387552f7358SJed Brown } else { 388552f7358SJed Brown for (d = 0; d <= dim; d++) { 389552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 390834065abSMatthew G. Knepley pEnd -= pStart; 391834065abSMatthew G. Knepley pMax[d] -= pStart; 392552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 393834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 394552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 395834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 396834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 397834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 398834065abSMatthew G. Knepley } 399552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 400552f7358SJed Brown } 401552f7358SJed Brown } 402834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 403a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 404a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 405a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 406a57dd577SMatthew G Knepley DMLabel label; 407a57dd577SMatthew G Knepley const char *name; 408a57dd577SMatthew G Knepley IS valueIS; 409a57dd577SMatthew G Knepley const PetscInt *values; 410a57dd577SMatthew G Knepley PetscInt numValues, v; 411a57dd577SMatthew G Knepley 412a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 413a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 414a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 415a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 416a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 418a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 419a57dd577SMatthew G Knepley PetscInt size; 420a57dd577SMatthew G Knepley 421a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 422a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 423a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 424a57dd577SMatthew G Knepley } 425a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 426a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4274d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 428a57dd577SMatthew G Knepley } 429552f7358SJed Brown } 430552f7358SJed Brown PetscFunctionReturn(0); 431552f7358SJed Brown } 432552f7358SJed Brown 433552f7358SJed Brown #undef __FUNCT__ 434552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 435552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 436552f7358SJed Brown { 437c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 438552f7358SJed Brown PetscErrorCode ierr; 439552f7358SJed Brown 440552f7358SJed Brown PetscFunctionBegin; 441552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 442552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 443552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 444c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 445552f7358SJed Brown if (iascii) { 446552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 447c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 448c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4497afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 450c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4517afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley #else 453c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 454552f7358SJed Brown #endif 45511aeaf0aSBarry Smith } 456552f7358SJed Brown PetscFunctionReturn(0); 457552f7358SJed Brown } 458552f7358SJed Brown 4592c40f234SMatthew G. Knepley #undef __FUNCT__ 4602c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4612c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4622c40f234SMatthew G. Knepley { 4632c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4642c40f234SMatthew G. Knepley PetscErrorCode ierr; 4652c40f234SMatthew G. Knepley 4662c40f234SMatthew G. Knepley PetscFunctionBegin; 4672c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4682c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4692c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4702c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4712c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4722c40f234SMatthew G. Knepley else if (ishdf5) { 4732c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 47410b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4752c40f234SMatthew G. Knepley #else 4762c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 477552f7358SJed Brown #endif 478552f7358SJed Brown } 479552f7358SJed Brown PetscFunctionReturn(0); 480552f7358SJed Brown } 481552f7358SJed Brown 482552f7358SJed Brown #undef __FUNCT__ 4836c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4846c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4856c73c22cSMatthew G. Knepley { 4866c73c22cSMatthew G. Knepley DMBoundary b, next; 4876c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4886c73c22cSMatthew G. Knepley 4898e136ac0SMatthew G. Knepley PetscFunctionBegin; 4906c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4916c73c22cSMatthew G. Knepley b = *boundary; 4926c73c22cSMatthew G. Knepley *boundary = NULL; 4936c73c22cSMatthew G. Knepley for (; b; b = next) { 4946c73c22cSMatthew G. Knepley next = b->next; 4956c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 4966c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 49763d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 4986c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 4996c73c22cSMatthew G. Knepley } 5006c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5016c73c22cSMatthew G. Knepley } 5026c73c22cSMatthew G. Knepley 5036c73c22cSMatthew G. Knepley #undef __FUNCT__ 504552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 505552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 506552f7358SJed Brown { 507552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 508552f7358SJed Brown DMLabel next = mesh->labels; 509552f7358SJed Brown PetscErrorCode ierr; 510552f7358SJed Brown 511552f7358SJed Brown PetscFunctionBegin; 5120d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 513552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 514552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 515552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 516552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 517552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 518552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 519552f7358SJed Brown while (next) { 520552f7358SJed Brown DMLabel tmp = next->next; 521552f7358SJed Brown 522552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 523552f7358SJed Brown next = tmp; 524552f7358SJed Brown } 5253913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 526a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 527552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 528552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5296c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 530552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 531552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 532552f7358SJed Brown PetscFunctionReturn(0); 533552f7358SJed Brown } 534552f7358SJed Brown 535552f7358SJed Brown #undef __FUNCT__ 536552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 537b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 538552f7358SJed Brown { 539552f7358SJed Brown PetscSection section, sectionGlobal; 540552f7358SJed Brown PetscInt bs = -1; 541552f7358SJed Brown PetscInt localSize; 54289545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 543552f7358SJed Brown PetscErrorCode ierr; 544b412c318SBarry Smith MatType mtype; 545552f7358SJed Brown 546552f7358SJed Brown PetscFunctionBegin; 547607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 548b412c318SBarry Smith mtype = dm->mattype; 549552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 550552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 551552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 552552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 55382f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 554552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 555552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 556552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 557552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 558552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 559552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 560552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 561552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 562552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 563552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 564552f7358SJed Brown if (!isShell) { 565552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5662a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 567552f7358SJed Brown 568552f7358SJed Brown if (bs < 0) { 569552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 570fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 571552f7358SJed Brown 572552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 573552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 574552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 575fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 576fad22124SMatthew G Knepley if (dof-cdof) { 5772a28c762SMatthew G Knepley if (bs < 0) { 578fad22124SMatthew G Knepley bs = dof-cdof; 579fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5802a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5812a28c762SMatthew G Knepley bs = 1; 582552f7358SJed Brown break; 583552f7358SJed Brown } 584552f7358SJed Brown } 5852a28c762SMatthew G Knepley } 5862a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5872a28c762SMatthew G Knepley bsLocal = bs; 58882f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5892a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59082f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5912a28c762SMatthew G Knepley if (bsMin != bsMax) { 5922a28c762SMatthew G Knepley bs = 1; 5932a28c762SMatthew G Knepley } else { 5942a28c762SMatthew G Knepley bs = bsMax; 5952a28c762SMatthew G Knepley } 596552f7358SJed Brown } else { 597552f7358SJed Brown bs = 1; 598552f7358SJed Brown } 599552f7358SJed Brown } 6001795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 601552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 602552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 603552f7358SJed Brown } 604552f7358SJed Brown PetscFunctionReturn(0); 605552f7358SJed Brown } 606552f7358SJed Brown 607552f7358SJed Brown #undef __FUNCT__ 608552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 609552f7358SJed Brown /*@ 610552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 611552f7358SJed Brown 612552f7358SJed Brown Not collective 613552f7358SJed Brown 614552f7358SJed Brown Input Parameter: 615552f7358SJed Brown . mesh - The DMPlex 616552f7358SJed Brown 617552f7358SJed Brown Output Parameters: 618552f7358SJed Brown + pStart - The first mesh point 619552f7358SJed Brown - pEnd - The upper bound for mesh points 620552f7358SJed Brown 621552f7358SJed Brown Level: beginner 622552f7358SJed Brown 623552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 624552f7358SJed Brown @*/ 625552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 626552f7358SJed Brown { 627552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 628552f7358SJed Brown PetscErrorCode ierr; 629552f7358SJed Brown 630552f7358SJed Brown PetscFunctionBegin; 631552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 632552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 633552f7358SJed Brown PetscFunctionReturn(0); 634552f7358SJed Brown } 635552f7358SJed Brown 636552f7358SJed Brown #undef __FUNCT__ 637552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 638552f7358SJed Brown /*@ 639552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 640552f7358SJed Brown 641552f7358SJed Brown Not collective 642552f7358SJed Brown 643552f7358SJed Brown Input Parameters: 644552f7358SJed Brown + mesh - The DMPlex 645552f7358SJed Brown . pStart - The first mesh point 646552f7358SJed Brown - pEnd - The upper bound for mesh points 647552f7358SJed Brown 648552f7358SJed Brown Output Parameters: 649552f7358SJed Brown 650552f7358SJed Brown Level: beginner 651552f7358SJed Brown 652552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 653552f7358SJed Brown @*/ 654552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 655552f7358SJed Brown { 656552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 657552f7358SJed Brown PetscErrorCode ierr; 658552f7358SJed Brown 659552f7358SJed Brown PetscFunctionBegin; 660552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 661552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 662552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 663552f7358SJed Brown PetscFunctionReturn(0); 664552f7358SJed Brown } 665552f7358SJed Brown 666552f7358SJed Brown #undef __FUNCT__ 667552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 668552f7358SJed Brown /*@ 669552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 670552f7358SJed Brown 671552f7358SJed Brown Not collective 672552f7358SJed Brown 673552f7358SJed Brown Input Parameters: 674552f7358SJed Brown + mesh - The DMPlex 675552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 676552f7358SJed Brown 677552f7358SJed Brown Output Parameter: 678552f7358SJed Brown . size - The cone size for point p 679552f7358SJed Brown 680552f7358SJed Brown Level: beginner 681552f7358SJed Brown 682552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 683552f7358SJed Brown @*/ 684552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 685552f7358SJed Brown { 686552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 687552f7358SJed Brown PetscErrorCode ierr; 688552f7358SJed Brown 689552f7358SJed Brown PetscFunctionBegin; 690552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 691552f7358SJed Brown PetscValidPointer(size, 3); 692552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 693552f7358SJed Brown PetscFunctionReturn(0); 694552f7358SJed Brown } 695552f7358SJed Brown 696552f7358SJed Brown #undef __FUNCT__ 697552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 698552f7358SJed Brown /*@ 699552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 700552f7358SJed Brown 701552f7358SJed Brown Not collective 702552f7358SJed Brown 703552f7358SJed Brown Input Parameters: 704552f7358SJed Brown + mesh - The DMPlex 705552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 706552f7358SJed Brown - size - The cone size for point p 707552f7358SJed Brown 708552f7358SJed Brown Output Parameter: 709552f7358SJed Brown 710552f7358SJed Brown Note: 711552f7358SJed Brown This should be called after DMPlexSetChart(). 712552f7358SJed Brown 713552f7358SJed Brown Level: beginner 714552f7358SJed Brown 715552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 716552f7358SJed Brown @*/ 717552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 718552f7358SJed Brown { 719552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 720552f7358SJed Brown PetscErrorCode ierr; 721552f7358SJed Brown 722552f7358SJed Brown PetscFunctionBegin; 723552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 724552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7250d644c17SKarl Rupp 726552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 727552f7358SJed Brown PetscFunctionReturn(0); 728552f7358SJed Brown } 729552f7358SJed Brown 730552f7358SJed Brown #undef __FUNCT__ 731f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 732f5a469b9SMatthew G. Knepley /*@ 733f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 734f5a469b9SMatthew G. Knepley 735f5a469b9SMatthew G. Knepley Not collective 736f5a469b9SMatthew G. Knepley 737f5a469b9SMatthew G. Knepley Input Parameters: 738f5a469b9SMatthew G. Knepley + mesh - The DMPlex 739f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 740f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 741f5a469b9SMatthew G. Knepley 742f5a469b9SMatthew G. Knepley Output Parameter: 743f5a469b9SMatthew G. Knepley 744f5a469b9SMatthew G. Knepley Note: 745f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 746f5a469b9SMatthew G. Knepley 747f5a469b9SMatthew G. Knepley Level: beginner 748f5a469b9SMatthew G. Knepley 749f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 750f5a469b9SMatthew G. Knepley @*/ 751f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 752f5a469b9SMatthew G. Knepley { 753f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 754f5a469b9SMatthew G. Knepley PetscInt csize; 755f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 756f5a469b9SMatthew G. Knepley 757f5a469b9SMatthew G. Knepley PetscFunctionBegin; 758f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 759f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 760f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 761f5a469b9SMatthew G. Knepley 762f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 763f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 764f5a469b9SMatthew G. Knepley } 765f5a469b9SMatthew G. Knepley 766f5a469b9SMatthew G. Knepley #undef __FUNCT__ 767552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 768552f7358SJed Brown /*@C 769552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 770552f7358SJed Brown 771552f7358SJed Brown Not collective 772552f7358SJed Brown 773552f7358SJed Brown Input Parameters: 774552f7358SJed Brown + mesh - The DMPlex 775552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 776552f7358SJed Brown 777552f7358SJed Brown Output Parameter: 778552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 779552f7358SJed Brown 780552f7358SJed Brown Level: beginner 781552f7358SJed Brown 7823813dfbdSMatthew G Knepley Fortran Notes: 7833813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7843813dfbdSMatthew G Knepley include petsc.h90 in your code. 7853813dfbdSMatthew G Knepley 7863813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 787552f7358SJed Brown 788552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 789552f7358SJed Brown @*/ 790552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 791552f7358SJed Brown { 792552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 793552f7358SJed Brown PetscInt off; 794552f7358SJed Brown PetscErrorCode ierr; 795552f7358SJed Brown 796552f7358SJed Brown PetscFunctionBegin; 797552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 798552f7358SJed Brown PetscValidPointer(cone, 3); 799552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 800552f7358SJed Brown *cone = &mesh->cones[off]; 801552f7358SJed Brown PetscFunctionReturn(0); 802552f7358SJed Brown } 803552f7358SJed Brown 804552f7358SJed Brown #undef __FUNCT__ 805552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 806552f7358SJed Brown /*@ 807552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 808552f7358SJed Brown 809552f7358SJed Brown Not collective 810552f7358SJed Brown 811552f7358SJed Brown Input Parameters: 812552f7358SJed Brown + mesh - The DMPlex 813552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 814552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 815552f7358SJed Brown 816552f7358SJed Brown Output Parameter: 817552f7358SJed Brown 818552f7358SJed Brown Note: 819552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 820552f7358SJed Brown 821552f7358SJed Brown Level: beginner 822552f7358SJed Brown 823552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 824552f7358SJed Brown @*/ 825552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 826552f7358SJed Brown { 827552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 828552f7358SJed Brown PetscInt pStart, pEnd; 829552f7358SJed Brown PetscInt dof, off, c; 830552f7358SJed Brown PetscErrorCode ierr; 831552f7358SJed Brown 832552f7358SJed Brown PetscFunctionBegin; 833552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 834552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 835552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 836552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 837552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 83882f516ccSBarry 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); 839552f7358SJed Brown for (c = 0; c < dof; ++c) { 84082f516ccSBarry 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); 841552f7358SJed Brown mesh->cones[off+c] = cone[c]; 842552f7358SJed Brown } 843552f7358SJed Brown PetscFunctionReturn(0); 844552f7358SJed Brown } 845552f7358SJed Brown 846552f7358SJed Brown #undef __FUNCT__ 847552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 848552f7358SJed Brown /*@C 849552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 850552f7358SJed Brown 851552f7358SJed Brown Not collective 852552f7358SJed Brown 853552f7358SJed Brown Input Parameters: 854552f7358SJed Brown + mesh - The DMPlex 855552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 856552f7358SJed Brown 857552f7358SJed Brown Output Parameter: 858552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 859552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 860552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 861552f7358SJed Brown the index of the cone point on which to start. 862552f7358SJed Brown 863552f7358SJed Brown Level: beginner 864552f7358SJed Brown 8653813dfbdSMatthew G Knepley Fortran Notes: 8663813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8673813dfbdSMatthew G Knepley include petsc.h90 in your code. 8683813dfbdSMatthew G Knepley 8693813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 870552f7358SJed Brown 871552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 872552f7358SJed Brown @*/ 873552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 874552f7358SJed Brown { 875552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 876552f7358SJed Brown PetscInt off; 877552f7358SJed Brown PetscErrorCode ierr; 878552f7358SJed Brown 879552f7358SJed Brown PetscFunctionBegin; 880552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 881552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 882552f7358SJed Brown { 883552f7358SJed Brown PetscInt dof; 884552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 885552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 886552f7358SJed Brown } 887552f7358SJed Brown #endif 888552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8890d644c17SKarl Rupp 890552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 891552f7358SJed Brown PetscFunctionReturn(0); 892552f7358SJed Brown } 893552f7358SJed Brown 894552f7358SJed Brown #undef __FUNCT__ 895552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 896552f7358SJed Brown /*@ 897552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 898552f7358SJed Brown 899552f7358SJed Brown Not collective 900552f7358SJed Brown 901552f7358SJed Brown Input Parameters: 902552f7358SJed Brown + mesh - The DMPlex 903552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 904552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 905552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 906552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 907552f7358SJed Brown the index of the cone point on which to start. 908552f7358SJed Brown 909552f7358SJed Brown Output Parameter: 910552f7358SJed Brown 911552f7358SJed Brown Note: 912552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 913552f7358SJed Brown 914552f7358SJed Brown Level: beginner 915552f7358SJed Brown 916552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 917552f7358SJed Brown @*/ 918552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 919552f7358SJed Brown { 920552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 921552f7358SJed Brown PetscInt pStart, pEnd; 922552f7358SJed Brown PetscInt dof, off, c; 923552f7358SJed Brown PetscErrorCode ierr; 924552f7358SJed Brown 925552f7358SJed Brown PetscFunctionBegin; 926552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 927552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 928552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 929552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 930552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 93182f516ccSBarry 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); 932552f7358SJed Brown for (c = 0; c < dof; ++c) { 933552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 934552f7358SJed Brown 935552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 93682f516ccSBarry 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); 937552f7358SJed Brown mesh->coneOrientations[off+c] = o; 938552f7358SJed Brown } 939552f7358SJed Brown PetscFunctionReturn(0); 940552f7358SJed Brown } 941552f7358SJed Brown 942552f7358SJed Brown #undef __FUNCT__ 943552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 944552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 945552f7358SJed Brown { 946552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 947552f7358SJed Brown PetscInt pStart, pEnd; 948552f7358SJed Brown PetscInt dof, off; 949552f7358SJed Brown PetscErrorCode ierr; 950552f7358SJed Brown 951552f7358SJed Brown PetscFunctionBegin; 952552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 953552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 95482f516ccSBarry 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); 95582f516ccSBarry 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); 95677c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 95777c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 95877c88f5bSMatthew 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); 959552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 960552f7358SJed Brown PetscFunctionReturn(0); 961552f7358SJed Brown } 962552f7358SJed Brown 963552f7358SJed Brown #undef __FUNCT__ 96477c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 96577c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 96677c88f5bSMatthew G Knepley { 96777c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 96877c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 96977c88f5bSMatthew G Knepley PetscInt dof, off; 97077c88f5bSMatthew G Knepley PetscErrorCode ierr; 97177c88f5bSMatthew G Knepley 97277c88f5bSMatthew G Knepley PetscFunctionBegin; 97377c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 97477c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97577c88f5bSMatthew 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); 97677c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 97777c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 97877c88f5bSMatthew 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); 97977c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 98077c88f5bSMatthew G Knepley PetscFunctionReturn(0); 98177c88f5bSMatthew G Knepley } 98277c88f5bSMatthew G Knepley 98377c88f5bSMatthew G Knepley #undef __FUNCT__ 984552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 985552f7358SJed Brown /*@ 986552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 987552f7358SJed Brown 988552f7358SJed Brown Not collective 989552f7358SJed Brown 990552f7358SJed Brown Input Parameters: 991552f7358SJed Brown + mesh - The DMPlex 992552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 993552f7358SJed Brown 994552f7358SJed Brown Output Parameter: 995552f7358SJed Brown . size - The support size for point p 996552f7358SJed Brown 997552f7358SJed Brown Level: beginner 998552f7358SJed Brown 999552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1000552f7358SJed Brown @*/ 1001552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1002552f7358SJed Brown { 1003552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1004552f7358SJed Brown PetscErrorCode ierr; 1005552f7358SJed Brown 1006552f7358SJed Brown PetscFunctionBegin; 1007552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1008552f7358SJed Brown PetscValidPointer(size, 3); 1009552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1010552f7358SJed Brown PetscFunctionReturn(0); 1011552f7358SJed Brown } 1012552f7358SJed Brown 1013552f7358SJed Brown #undef __FUNCT__ 1014552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1015552f7358SJed Brown /*@ 1016552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1017552f7358SJed Brown 1018552f7358SJed Brown Not collective 1019552f7358SJed Brown 1020552f7358SJed Brown Input Parameters: 1021552f7358SJed Brown + mesh - The DMPlex 1022552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1023552f7358SJed Brown - size - The support size for point p 1024552f7358SJed Brown 1025552f7358SJed Brown Output Parameter: 1026552f7358SJed Brown 1027552f7358SJed Brown Note: 1028552f7358SJed Brown This should be called after DMPlexSetChart(). 1029552f7358SJed Brown 1030552f7358SJed Brown Level: beginner 1031552f7358SJed Brown 1032552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1033552f7358SJed Brown @*/ 1034552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1035552f7358SJed Brown { 1036552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1037552f7358SJed Brown PetscErrorCode ierr; 1038552f7358SJed Brown 1039552f7358SJed Brown PetscFunctionBegin; 1040552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1041552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10420d644c17SKarl Rupp 1043552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1044552f7358SJed Brown PetscFunctionReturn(0); 1045552f7358SJed Brown } 1046552f7358SJed Brown 1047552f7358SJed Brown #undef __FUNCT__ 1048552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1049552f7358SJed Brown /*@C 1050552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1051552f7358SJed Brown 1052552f7358SJed Brown Not collective 1053552f7358SJed Brown 1054552f7358SJed Brown Input Parameters: 1055552f7358SJed Brown + mesh - The DMPlex 1056552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1057552f7358SJed Brown 1058552f7358SJed Brown Output Parameter: 1059552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1060552f7358SJed Brown 1061552f7358SJed Brown Level: beginner 1062552f7358SJed Brown 10633813dfbdSMatthew G Knepley Fortran Notes: 10643813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10653813dfbdSMatthew G Knepley include petsc.h90 in your code. 10663813dfbdSMatthew G Knepley 10673813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10683813dfbdSMatthew G Knepley 1069552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1070552f7358SJed Brown @*/ 1071552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1072552f7358SJed Brown { 1073552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1074552f7358SJed Brown PetscInt off; 1075552f7358SJed Brown PetscErrorCode ierr; 1076552f7358SJed Brown 1077552f7358SJed Brown PetscFunctionBegin; 1078552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1079552f7358SJed Brown PetscValidPointer(support, 3); 1080552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1081552f7358SJed Brown *support = &mesh->supports[off]; 1082552f7358SJed Brown PetscFunctionReturn(0); 1083552f7358SJed Brown } 1084552f7358SJed Brown 1085552f7358SJed Brown #undef __FUNCT__ 1086552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1087552f7358SJed Brown /*@ 1088552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1089552f7358SJed Brown 1090552f7358SJed Brown Not collective 1091552f7358SJed Brown 1092552f7358SJed Brown Input Parameters: 1093552f7358SJed Brown + mesh - The DMPlex 1094552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1095552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1096552f7358SJed Brown 1097552f7358SJed Brown Output Parameter: 1098552f7358SJed Brown 1099552f7358SJed Brown Note: 1100552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1101552f7358SJed Brown 1102552f7358SJed Brown Level: beginner 1103552f7358SJed Brown 1104552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1105552f7358SJed Brown @*/ 1106552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1107552f7358SJed Brown { 1108552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1109552f7358SJed Brown PetscInt pStart, pEnd; 1110552f7358SJed Brown PetscInt dof, off, c; 1111552f7358SJed Brown PetscErrorCode ierr; 1112552f7358SJed Brown 1113552f7358SJed Brown PetscFunctionBegin; 1114552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1115552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1116552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1117552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1118552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 111982f516ccSBarry 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); 1120552f7358SJed Brown for (c = 0; c < dof; ++c) { 112182f516ccSBarry 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); 1122552f7358SJed Brown mesh->supports[off+c] = support[c]; 1123552f7358SJed Brown } 1124552f7358SJed Brown PetscFunctionReturn(0); 1125552f7358SJed Brown } 1126552f7358SJed Brown 1127552f7358SJed Brown #undef __FUNCT__ 1128552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1129552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1130552f7358SJed Brown { 1131552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1132552f7358SJed Brown PetscInt pStart, pEnd; 1133552f7358SJed Brown PetscInt dof, off; 1134552f7358SJed Brown PetscErrorCode ierr; 1135552f7358SJed Brown 1136552f7358SJed Brown PetscFunctionBegin; 1137552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1138552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1139552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1140552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114182f516ccSBarry 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); 114282f516ccSBarry 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); 114382f516ccSBarry 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); 1144552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1145552f7358SJed Brown PetscFunctionReturn(0); 1146552f7358SJed Brown } 1147552f7358SJed Brown 1148552f7358SJed Brown #undef __FUNCT__ 1149552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1150552f7358SJed Brown /*@C 1151552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1152552f7358SJed Brown 1153552f7358SJed Brown Not collective 1154552f7358SJed Brown 1155552f7358SJed Brown Input Parameters: 1156552f7358SJed Brown + mesh - The DMPlex 1157552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1158552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11590298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1160552f7358SJed Brown 1161552f7358SJed Brown Output Parameters: 1162552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1163552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1164552f7358SJed Brown 1165552f7358SJed Brown Note: 11660298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1167552f7358SJed Brown 11683813dfbdSMatthew G Knepley Fortran Notes: 11693813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11703813dfbdSMatthew G Knepley include petsc.h90 in your code. 11713813dfbdSMatthew G Knepley 11723813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11733813dfbdSMatthew G Knepley 1174552f7358SJed Brown Level: beginner 1175552f7358SJed Brown 1176552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1177552f7358SJed Brown @*/ 1178552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1179552f7358SJed Brown { 1180552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1181552f7358SJed Brown PetscInt *closure, *fifo; 11820298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1183552f7358SJed Brown PetscInt tmpSize, t; 1184552f7358SJed Brown PetscInt depth = 0, maxSize; 1185552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1186552f7358SJed Brown PetscErrorCode ierr; 1187552f7358SJed Brown 1188552f7358SJed Brown PetscFunctionBegin; 1189552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1190552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1191552f7358SJed Brown /* This is only 1-level */ 1192552f7358SJed Brown if (useCone) { 1193552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1194552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1195552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1196552f7358SJed Brown } else { 1197552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1198552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1199552f7358SJed Brown } 1200bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1201bfbcdd7aSMatthew G. Knepley if (*points) { 1202bfbcdd7aSMatthew G. Knepley closure = *points; 1203bfbcdd7aSMatthew G. Knepley } else { 1204bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1205bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1206bfbcdd7aSMatthew G. Knepley } 1207bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1208bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1209bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1210bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1211bfbcdd7aSMatthew G. Knepley } 1212bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1213bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1214bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1215bfbcdd7aSMatthew G. Knepley } 1216bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1217bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1218bfbcdd7aSMatthew G. Knepley if (*points) { 1219bfbcdd7aSMatthew G. Knepley closure = *points; 1220bfbcdd7aSMatthew G. Knepley } else { 1221bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1222bfbcdd7aSMatthew G. Knepley } 1223bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1224552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1225552f7358SJed Brown const PetscInt cp = tmp[t]; 1226552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1227552f7358SJed Brown 1228552f7358SJed Brown closure[closureSize] = cp; 1229552f7358SJed Brown closure[closureSize+1] = co; 1230552f7358SJed Brown fifo[fifoSize] = cp; 1231552f7358SJed Brown fifo[fifoSize+1] = co; 1232552f7358SJed Brown } 1233bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1234552f7358SJed Brown while (fifoSize - fifoStart) { 1235552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1236552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1237552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1238552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1239552f7358SJed Brown 1240552f7358SJed Brown if (useCone) { 1241552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1242552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1243552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1244552f7358SJed Brown } else { 1245552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1246552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12470298fd71SBarry Smith tmpO = NULL; 1248552f7358SJed Brown } 1249552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1250552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1251552f7358SJed Brown const PetscInt cp = tmp[i]; 12522e1b13c2SMatthew 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. */ 12532e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12542e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12552e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1256552f7358SJed Brown PetscInt c; 1257552f7358SJed Brown 12582e1b13c2SMatthew G. Knepley if (rev) { 12592e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12602e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12612e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12622e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12632e1b13c2SMatthew G. Knepley } 1264552f7358SJed Brown /* Check for duplicate */ 1265552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1266552f7358SJed Brown if (closure[c] == cp) break; 1267552f7358SJed Brown } 1268552f7358SJed Brown if (c == closureSize) { 1269552f7358SJed Brown closure[closureSize] = cp; 1270552f7358SJed Brown closure[closureSize+1] = co; 1271552f7358SJed Brown fifo[fifoSize] = cp; 1272552f7358SJed Brown fifo[fifoSize+1] = co; 1273552f7358SJed Brown closureSize += 2; 1274552f7358SJed Brown fifoSize += 2; 1275552f7358SJed Brown } 1276552f7358SJed Brown } 1277552f7358SJed Brown fifoStart += 2; 1278552f7358SJed Brown } 1279552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1280552f7358SJed Brown if (points) *points = closure; 1281552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1282552f7358SJed Brown PetscFunctionReturn(0); 1283552f7358SJed Brown } 1284552f7358SJed Brown 1285552f7358SJed Brown #undef __FUNCT__ 12869bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 12879bf0dad6SMatthew G. Knepley /*@C 12889bf0dad6SMatthew 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 12899bf0dad6SMatthew G. Knepley 12909bf0dad6SMatthew G. Knepley Not collective 12919bf0dad6SMatthew G. Knepley 12929bf0dad6SMatthew G. Knepley Input Parameters: 12939bf0dad6SMatthew G. Knepley + mesh - The DMPlex 12949bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 12959bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 12969bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12979bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 12989bf0dad6SMatthew G. Knepley 12999bf0dad6SMatthew G. Knepley Output Parameters: 13009bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13019bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13029bf0dad6SMatthew G. Knepley 13039bf0dad6SMatthew G. Knepley Note: 13049bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13059bf0dad6SMatthew G. Knepley 13069bf0dad6SMatthew G. Knepley Fortran Notes: 13079bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13089bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13099bf0dad6SMatthew G. Knepley 13109bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13119bf0dad6SMatthew G. Knepley 13129bf0dad6SMatthew G. Knepley Level: beginner 13139bf0dad6SMatthew G. Knepley 13149bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13159bf0dad6SMatthew G. Knepley @*/ 13169bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13179bf0dad6SMatthew G. Knepley { 13189bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13199bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13209bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13219bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13229bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13239bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13249bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13259bf0dad6SMatthew G. Knepley 13269bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13279bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13289bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13299bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13309bf0dad6SMatthew G. Knepley if (useCone) { 13319bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13329bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13339bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13349bf0dad6SMatthew G. Knepley } else { 13359bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13369bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13379bf0dad6SMatthew G. Knepley } 13389bf0dad6SMatthew G. Knepley if (depth == 1) { 13399bf0dad6SMatthew G. Knepley if (*points) { 13409bf0dad6SMatthew G. Knepley closure = *points; 13419bf0dad6SMatthew G. Knepley } else { 13429bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13439bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13449bf0dad6SMatthew G. Knepley } 13459bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13469bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13479bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13489bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13499bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13509bf0dad6SMatthew G. Knepley } 13519bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13529bf0dad6SMatthew G. Knepley if (points) *points = closure; 13539bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13549bf0dad6SMatthew G. Knepley } 13559bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13569bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13579bf0dad6SMatthew G. Knepley if (*points) { 13589bf0dad6SMatthew G. Knepley closure = *points; 13599bf0dad6SMatthew G. Knepley } else { 13609bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13619bf0dad6SMatthew G. Knepley } 13629bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13639bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13649bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13659bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13669bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13679bf0dad6SMatthew G. Knepley 13689bf0dad6SMatthew G. Knepley if (ornt < 0) { 13699bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13709bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13719bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13729bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13739bf0dad6SMatthew G. Knepley } 13749bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13759bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13769bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13779bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13789bf0dad6SMatthew G. Knepley } 13799bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 13809bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 13819bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 13829bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 13839bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 13849bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 13859bf0dad6SMatthew G. Knepley 13869bf0dad6SMatthew G. Knepley if (useCone) { 13879bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13889bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13899bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13909bf0dad6SMatthew G. Knepley } else { 13919bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 13929bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13939bf0dad6SMatthew G. Knepley tmpO = NULL; 13949bf0dad6SMatthew G. Knepley } 13959bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 13969bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 13979bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13989bf0dad6SMatthew 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. */ 13999bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14009bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14019bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14029bf0dad6SMatthew G. Knepley PetscInt c; 14039bf0dad6SMatthew G. Knepley 14049bf0dad6SMatthew G. Knepley if (rev) { 14059bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14069bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14079bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14089bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14099bf0dad6SMatthew G. Knepley } 14109bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14119bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14129bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14139bf0dad6SMatthew G. Knepley } 14149bf0dad6SMatthew G. Knepley if (c == closureSize) { 14159bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14169bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14179bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14189bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14199bf0dad6SMatthew G. Knepley closureSize += 2; 14209bf0dad6SMatthew G. Knepley fifoSize += 2; 14219bf0dad6SMatthew G. Knepley } 14229bf0dad6SMatthew G. Knepley } 14239bf0dad6SMatthew G. Knepley fifoStart += 2; 14249bf0dad6SMatthew G. Knepley } 14259bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14269bf0dad6SMatthew G. Knepley if (points) *points = closure; 14279bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14289bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14299bf0dad6SMatthew G. Knepley } 14309bf0dad6SMatthew G. Knepley 14319bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1432552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1433552f7358SJed Brown /*@C 1434552f7358SJed 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 1435552f7358SJed Brown 1436552f7358SJed Brown Not collective 1437552f7358SJed Brown 1438552f7358SJed Brown Input Parameters: 1439552f7358SJed Brown + mesh - The DMPlex 1440552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1441552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1442e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1443e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1444552f7358SJed Brown 1445552f7358SJed Brown Note: 14460298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1447552f7358SJed Brown 14483813dfbdSMatthew G Knepley Fortran Notes: 14493813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14503813dfbdSMatthew G Knepley include petsc.h90 in your code. 14513813dfbdSMatthew G Knepley 14523813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14533813dfbdSMatthew G Knepley 1454552f7358SJed Brown Level: beginner 1455552f7358SJed Brown 1456552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1457552f7358SJed Brown @*/ 1458552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1459552f7358SJed Brown { 1460552f7358SJed Brown PetscErrorCode ierr; 1461552f7358SJed Brown 1462552f7358SJed Brown PetscFunctionBegin; 1463552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1464e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1465e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1466552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14674ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1468552f7358SJed Brown PetscFunctionReturn(0); 1469552f7358SJed Brown } 1470552f7358SJed Brown 1471552f7358SJed Brown #undef __FUNCT__ 1472552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1473552f7358SJed Brown /*@ 1474552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1475552f7358SJed Brown 1476552f7358SJed Brown Not collective 1477552f7358SJed Brown 1478552f7358SJed Brown Input Parameter: 1479552f7358SJed Brown . mesh - The DMPlex 1480552f7358SJed Brown 1481552f7358SJed Brown Output Parameters: 1482552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1483552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1484552f7358SJed Brown 1485552f7358SJed Brown Level: beginner 1486552f7358SJed Brown 1487552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1488552f7358SJed Brown @*/ 1489552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1490552f7358SJed Brown { 1491552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1492552f7358SJed Brown 1493552f7358SJed Brown PetscFunctionBegin; 1494552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1495552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1496552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1497552f7358SJed Brown PetscFunctionReturn(0); 1498552f7358SJed Brown } 1499552f7358SJed Brown 1500552f7358SJed Brown #undef __FUNCT__ 1501552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1502552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1503552f7358SJed Brown { 1504552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1505552f7358SJed Brown PetscInt size; 1506552f7358SJed Brown PetscErrorCode ierr; 1507552f7358SJed Brown 1508552f7358SJed Brown PetscFunctionBegin; 1509552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1510552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1511552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15121795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15131795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1514552f7358SJed Brown if (mesh->maxSupportSize) { 1515552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1516552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15171795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1518552f7358SJed Brown } 1519552f7358SJed Brown PetscFunctionReturn(0); 1520552f7358SJed Brown } 1521552f7358SJed Brown 1522552f7358SJed Brown #undef __FUNCT__ 1523552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1524552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1525552f7358SJed Brown { 1526552f7358SJed Brown PetscErrorCode ierr; 1527552f7358SJed Brown 1528552f7358SJed Brown PetscFunctionBegin; 15294d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15304d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1531552f7358SJed Brown PetscFunctionReturn(0); 1532552f7358SJed Brown } 1533552f7358SJed Brown 1534552f7358SJed Brown #undef __FUNCT__ 1535552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1536552f7358SJed Brown /*@ 1537552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1538552f7358SJed Brown 1539552f7358SJed Brown Not collective 1540552f7358SJed Brown 1541552f7358SJed Brown Input Parameter: 1542552f7358SJed Brown . mesh - The DMPlex 1543552f7358SJed Brown 1544552f7358SJed Brown Output Parameter: 1545552f7358SJed Brown 1546552f7358SJed Brown Note: 1547552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1548552f7358SJed Brown 1549552f7358SJed Brown Level: beginner 1550552f7358SJed Brown 1551552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1552552f7358SJed Brown @*/ 1553552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1554552f7358SJed Brown { 1555552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1556552f7358SJed Brown PetscInt *offsets; 1557552f7358SJed Brown PetscInt supportSize; 1558552f7358SJed Brown PetscInt pStart, pEnd, p; 1559552f7358SJed Brown PetscErrorCode ierr; 1560552f7358SJed Brown 1561552f7358SJed Brown PetscFunctionBegin; 1562552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 156382f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1564552f7358SJed Brown /* Calculate support sizes */ 1565552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1566552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1567552f7358SJed Brown PetscInt dof, off, c; 1568552f7358SJed Brown 1569552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1570552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1571552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1572552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1573552f7358SJed Brown } 1574552f7358SJed Brown } 1575552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1576552f7358SJed Brown PetscInt dof; 1577552f7358SJed Brown 1578552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 15790d644c17SKarl Rupp 1580552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1581552f7358SJed Brown } 1582552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1583552f7358SJed Brown /* Calculate supports */ 1584552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 15851795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 15861795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1587552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1588552f7358SJed Brown PetscInt dof, off, c; 1589552f7358SJed Brown 1590552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1591552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1592552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1593552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1594552f7358SJed Brown PetscInt offS; 1595552f7358SJed Brown 1596552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 15970d644c17SKarl Rupp 1598552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1599552f7358SJed Brown ++offsets[q]; 1600552f7358SJed Brown } 1601552f7358SJed Brown } 1602552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1603552f7358SJed Brown PetscFunctionReturn(0); 1604552f7358SJed Brown } 1605552f7358SJed Brown 1606552f7358SJed Brown #undef __FUNCT__ 1607552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1608552f7358SJed Brown /*@ 1609552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1610552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1611552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1612552f7358SJed Brown the DAG. 1613552f7358SJed Brown 1614552f7358SJed Brown Not collective 1615552f7358SJed Brown 1616552f7358SJed Brown Input Parameter: 1617552f7358SJed Brown . mesh - The DMPlex 1618552f7358SJed Brown 1619552f7358SJed Brown Output Parameter: 1620552f7358SJed Brown 1621552f7358SJed Brown Notes: 1622150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1623150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1624150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1625150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1626552f7358SJed Brown 1627150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1628552f7358SJed Brown 1629552f7358SJed Brown Level: beginner 1630552f7358SJed Brown 1631552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1632552f7358SJed Brown @*/ 1633552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1634552f7358SJed Brown { 1635aa50250dSMatthew G. Knepley DMLabel label; 1636552f7358SJed Brown PetscInt pStart, pEnd, p; 1637552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1638552f7358SJed Brown PetscErrorCode ierr; 1639552f7358SJed Brown 1640552f7358SJed Brown PetscFunctionBegin; 1641552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1642552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1643552f7358SJed Brown /* Calculate depth */ 1644aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1645aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1646aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1647552f7358SJed Brown /* Initialize roots and count leaves */ 1648552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1649552f7358SJed Brown PetscInt coneSize, supportSize; 1650552f7358SJed Brown 1651552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1652552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1653552f7358SJed Brown if (!coneSize && supportSize) { 1654552f7358SJed Brown ++numRoots; 1655aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1656552f7358SJed Brown } else if (!supportSize && coneSize) { 1657552f7358SJed Brown ++numLeaves; 1658552f7358SJed Brown } else if (!supportSize && !coneSize) { 1659552f7358SJed Brown /* Isolated points */ 1660aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1661552f7358SJed Brown } 1662552f7358SJed Brown } 1663552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1664552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1665552f7358SJed Brown PetscInt coneSize, supportSize; 1666552f7358SJed Brown 1667552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1668552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1669552f7358SJed Brown if (!supportSize && coneSize) { 1670aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1671552f7358SJed Brown } 1672552f7358SJed Brown } 1673552f7358SJed Brown } else { 167474ef644bSMatthew G. Knepley IS pointIS; 167574ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1676552f7358SJed Brown 167774ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 167874ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 167974ef644bSMatthew G. Knepley while (numPoints) { 168074ef644bSMatthew G. Knepley const PetscInt *points; 168174ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 168274ef644bSMatthew G. Knepley 168374ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 168474ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 168574ef644bSMatthew G. Knepley const PetscInt point = points[p]; 168674ef644bSMatthew G. Knepley const PetscInt *support; 168774ef644bSMatthew G. Knepley PetscInt supportSize, s; 168874ef644bSMatthew G. Knepley 168974ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 169074ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 169174ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 169274ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1693552f7358SJed Brown } 1694552f7358SJed Brown } 16955edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 169674ef644bSMatthew G. Knepley ++level; 169774ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 169874ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 169974ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170074ef644bSMatthew G. Knepley else {numPoints = 0;} 170174ef644bSMatthew G. Knepley } 170274ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 170374ef644bSMatthew G. Knepley } 1704552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1705552f7358SJed Brown PetscFunctionReturn(0); 1706552f7358SJed Brown } 1707552f7358SJed Brown 1708552f7358SJed Brown #undef __FUNCT__ 1709552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1710552f7358SJed Brown /*@C 1711552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1712552f7358SJed Brown 1713552f7358SJed Brown Not Collective 1714552f7358SJed Brown 1715552f7358SJed Brown Input Parameters: 1716552f7358SJed Brown + dm - The DMPlex object 1717552f7358SJed Brown . numPoints - The number of input points for the join 1718552f7358SJed Brown - points - The input points 1719552f7358SJed Brown 1720552f7358SJed Brown Output Parameters: 1721552f7358SJed Brown + numCoveredPoints - The number of points in the join 1722552f7358SJed Brown - coveredPoints - The points in the join 1723552f7358SJed Brown 1724552f7358SJed Brown Level: intermediate 1725552f7358SJed Brown 1726552f7358SJed Brown Note: Currently, this is restricted to a single level join 1727552f7358SJed Brown 17283813dfbdSMatthew G Knepley Fortran Notes: 17293813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17303813dfbdSMatthew G Knepley include petsc.h90 in your code. 17313813dfbdSMatthew G Knepley 17323813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17333813dfbdSMatthew G Knepley 1734552f7358SJed Brown .keywords: mesh 1735552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1736552f7358SJed Brown @*/ 1737552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1738552f7358SJed Brown { 1739552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1740552f7358SJed Brown PetscInt *join[2]; 1741552f7358SJed Brown PetscInt joinSize, i = 0; 1742552f7358SJed Brown PetscInt dof, off, p, c, m; 1743552f7358SJed Brown PetscErrorCode ierr; 1744552f7358SJed Brown 1745552f7358SJed Brown PetscFunctionBegin; 1746552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1747552f7358SJed Brown PetscValidPointer(points, 2); 1748552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1749552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1750552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1751552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1752552f7358SJed Brown /* Copy in support of first point */ 1753552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1754552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1755552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1756552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1757552f7358SJed Brown } 1758552f7358SJed Brown /* Check each successive support */ 1759552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1760552f7358SJed Brown PetscInt newJoinSize = 0; 1761552f7358SJed Brown 1762552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1763552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1764552f7358SJed Brown for (c = 0; c < dof; ++c) { 1765552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1766552f7358SJed Brown 1767552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1768552f7358SJed Brown if (point == join[i][m]) { 1769552f7358SJed Brown join[1-i][newJoinSize++] = point; 1770552f7358SJed Brown break; 1771552f7358SJed Brown } 1772552f7358SJed Brown } 1773552f7358SJed Brown } 1774552f7358SJed Brown joinSize = newJoinSize; 1775552f7358SJed Brown i = 1-i; 1776552f7358SJed Brown } 1777552f7358SJed Brown *numCoveredPoints = joinSize; 1778552f7358SJed Brown *coveredPoints = join[i]; 1779552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1780552f7358SJed Brown PetscFunctionReturn(0); 1781552f7358SJed Brown } 1782552f7358SJed Brown 1783552f7358SJed Brown #undef __FUNCT__ 1784552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1785552f7358SJed Brown /*@C 1786552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1787552f7358SJed Brown 1788552f7358SJed Brown Not Collective 1789552f7358SJed Brown 1790552f7358SJed Brown Input Parameters: 1791552f7358SJed Brown + dm - The DMPlex object 1792552f7358SJed Brown . numPoints - The number of input points for the join 1793552f7358SJed Brown - points - The input points 1794552f7358SJed Brown 1795552f7358SJed Brown Output Parameters: 1796552f7358SJed Brown + numCoveredPoints - The number of points in the join 1797552f7358SJed Brown - coveredPoints - The points in the join 1798552f7358SJed Brown 17993813dfbdSMatthew G Knepley Fortran Notes: 18003813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18013813dfbdSMatthew G Knepley include petsc.h90 in your code. 18023813dfbdSMatthew G Knepley 18033813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18043813dfbdSMatthew G Knepley 1805552f7358SJed Brown Level: intermediate 1806552f7358SJed Brown 1807552f7358SJed Brown .keywords: mesh 1808552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1809552f7358SJed Brown @*/ 1810552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1811552f7358SJed Brown { 1812552f7358SJed Brown PetscErrorCode ierr; 1813552f7358SJed Brown 1814552f7358SJed Brown PetscFunctionBegin; 1815552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1816d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1817d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1818d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1819552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1820d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1821552f7358SJed Brown PetscFunctionReturn(0); 1822552f7358SJed Brown } 1823552f7358SJed Brown 1824552f7358SJed Brown #undef __FUNCT__ 1825552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1826552f7358SJed Brown /*@C 1827552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1828552f7358SJed Brown 1829552f7358SJed Brown Not Collective 1830552f7358SJed Brown 1831552f7358SJed Brown Input Parameters: 1832552f7358SJed Brown + dm - The DMPlex object 1833552f7358SJed Brown . numPoints - The number of input points for the join 1834552f7358SJed Brown - points - The input points 1835552f7358SJed Brown 1836552f7358SJed Brown Output Parameters: 1837552f7358SJed Brown + numCoveredPoints - The number of points in the join 1838552f7358SJed Brown - coveredPoints - The points in the join 1839552f7358SJed Brown 18403813dfbdSMatthew G Knepley Fortran Notes: 18413813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18423813dfbdSMatthew G Knepley include petsc.h90 in your code. 18433813dfbdSMatthew G Knepley 18443813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18453813dfbdSMatthew G Knepley 1846552f7358SJed Brown Level: intermediate 1847552f7358SJed Brown 1848552f7358SJed Brown .keywords: mesh 1849552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1850552f7358SJed Brown @*/ 1851552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1852552f7358SJed Brown { 1853552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1854552f7358SJed Brown PetscInt *offsets, **closures; 1855552f7358SJed Brown PetscInt *join[2]; 1856552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1857552f7358SJed Brown PetscInt p, d, c, m; 1858552f7358SJed Brown PetscErrorCode ierr; 1859552f7358SJed Brown 1860552f7358SJed Brown PetscFunctionBegin; 1861552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1862552f7358SJed Brown PetscValidPointer(points, 2); 1863552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1864552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1865552f7358SJed Brown 1866552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18671795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1868552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1869e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1870552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1871552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1872552f7358SJed Brown 1873552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1874552f7358SJed Brown PetscInt closureSize; 1875552f7358SJed Brown 1876552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 18770d644c17SKarl Rupp 1878552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1879552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1880552f7358SJed Brown PetscInt pStart, pEnd, i; 1881552f7358SJed Brown 1882552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1883552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1884552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1885552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1886552f7358SJed Brown break; 1887552f7358SJed Brown } 1888552f7358SJed Brown } 1889552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1890552f7358SJed Brown } 189182f516ccSBarry 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); 1892552f7358SJed Brown } 1893552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1894552f7358SJed Brown PetscInt dof; 1895552f7358SJed Brown 1896552f7358SJed Brown /* Copy in support of first point */ 1897552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1898552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1899552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1900552f7358SJed Brown } 1901552f7358SJed Brown /* Check each successive cone */ 1902552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1903552f7358SJed Brown PetscInt newJoinSize = 0; 1904552f7358SJed Brown 1905552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1906552f7358SJed Brown for (c = 0; c < dof; ++c) { 1907552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1908552f7358SJed Brown 1909552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1910552f7358SJed Brown if (point == join[i][m]) { 1911552f7358SJed Brown join[1-i][newJoinSize++] = point; 1912552f7358SJed Brown break; 1913552f7358SJed Brown } 1914552f7358SJed Brown } 1915552f7358SJed Brown } 1916552f7358SJed Brown joinSize = newJoinSize; 1917552f7358SJed Brown i = 1-i; 1918552f7358SJed Brown } 1919552f7358SJed Brown if (joinSize) break; 1920552f7358SJed Brown } 1921552f7358SJed Brown *numCoveredPoints = joinSize; 1922552f7358SJed Brown *coveredPoints = join[i]; 1923552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19240298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1925552f7358SJed Brown } 1926552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1927552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1928552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1929552f7358SJed Brown PetscFunctionReturn(0); 1930552f7358SJed Brown } 1931552f7358SJed Brown 1932552f7358SJed Brown #undef __FUNCT__ 1933552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1934552f7358SJed Brown /*@C 1935552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1936552f7358SJed Brown 1937552f7358SJed Brown Not Collective 1938552f7358SJed Brown 1939552f7358SJed Brown Input Parameters: 1940552f7358SJed Brown + dm - The DMPlex object 1941552f7358SJed Brown . numPoints - The number of input points for the meet 1942552f7358SJed Brown - points - The input points 1943552f7358SJed Brown 1944552f7358SJed Brown Output Parameters: 1945552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1946552f7358SJed Brown - coveredPoints - The points in the meet 1947552f7358SJed Brown 1948552f7358SJed Brown Level: intermediate 1949552f7358SJed Brown 1950552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1951552f7358SJed Brown 19523813dfbdSMatthew G Knepley Fortran Notes: 19533813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19543813dfbdSMatthew G Knepley include petsc.h90 in your code. 19553813dfbdSMatthew G Knepley 19563813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19573813dfbdSMatthew G Knepley 1958552f7358SJed Brown .keywords: mesh 1959552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1960552f7358SJed Brown @*/ 1961552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1962552f7358SJed Brown { 1963552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1964552f7358SJed Brown PetscInt *meet[2]; 1965552f7358SJed Brown PetscInt meetSize, i = 0; 1966552f7358SJed Brown PetscInt dof, off, p, c, m; 1967552f7358SJed Brown PetscErrorCode ierr; 1968552f7358SJed Brown 1969552f7358SJed Brown PetscFunctionBegin; 1970552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1971552f7358SJed Brown PetscValidPointer(points, 2); 1972552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1973552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1974552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1975552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1976552f7358SJed Brown /* Copy in cone of first point */ 1977552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1978552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1979552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1980552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1981552f7358SJed Brown } 1982552f7358SJed Brown /* Check each successive cone */ 1983552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1984552f7358SJed Brown PetscInt newMeetSize = 0; 1985552f7358SJed Brown 1986552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1987552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1988552f7358SJed Brown for (c = 0; c < dof; ++c) { 1989552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1990552f7358SJed Brown 1991552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1992552f7358SJed Brown if (point == meet[i][m]) { 1993552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1994552f7358SJed Brown break; 1995552f7358SJed Brown } 1996552f7358SJed Brown } 1997552f7358SJed Brown } 1998552f7358SJed Brown meetSize = newMeetSize; 1999552f7358SJed Brown i = 1-i; 2000552f7358SJed Brown } 2001552f7358SJed Brown *numCoveringPoints = meetSize; 2002552f7358SJed Brown *coveringPoints = meet[i]; 2003552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2004552f7358SJed Brown PetscFunctionReturn(0); 2005552f7358SJed Brown } 2006552f7358SJed Brown 2007552f7358SJed Brown #undef __FUNCT__ 2008552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2009552f7358SJed Brown /*@C 2010552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2011552f7358SJed Brown 2012552f7358SJed Brown Not Collective 2013552f7358SJed Brown 2014552f7358SJed Brown Input Parameters: 2015552f7358SJed Brown + dm - The DMPlex object 2016552f7358SJed Brown . numPoints - The number of input points for the meet 2017552f7358SJed Brown - points - The input points 2018552f7358SJed Brown 2019552f7358SJed Brown Output Parameters: 2020552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2021552f7358SJed Brown - coveredPoints - The points in the meet 2022552f7358SJed Brown 2023552f7358SJed Brown Level: intermediate 2024552f7358SJed Brown 20253813dfbdSMatthew G Knepley Fortran Notes: 20263813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20273813dfbdSMatthew G Knepley include petsc.h90 in your code. 20283813dfbdSMatthew G Knepley 20293813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20303813dfbdSMatthew G Knepley 2031552f7358SJed Brown .keywords: mesh 2032552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2033552f7358SJed Brown @*/ 2034552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2035552f7358SJed Brown { 2036552f7358SJed Brown PetscErrorCode ierr; 2037552f7358SJed Brown 2038552f7358SJed Brown PetscFunctionBegin; 2039552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2040d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2041d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2042d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2043552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2044d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2045552f7358SJed Brown PetscFunctionReturn(0); 2046552f7358SJed Brown } 2047552f7358SJed Brown 2048552f7358SJed Brown #undef __FUNCT__ 2049552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2050552f7358SJed Brown /*@C 2051552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2052552f7358SJed Brown 2053552f7358SJed Brown Not Collective 2054552f7358SJed Brown 2055552f7358SJed Brown Input Parameters: 2056552f7358SJed Brown + dm - The DMPlex object 2057552f7358SJed Brown . numPoints - The number of input points for the meet 2058552f7358SJed Brown - points - The input points 2059552f7358SJed Brown 2060552f7358SJed Brown Output Parameters: 2061552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2062552f7358SJed Brown - coveredPoints - The points in the meet 2063552f7358SJed Brown 2064552f7358SJed Brown Level: intermediate 2065552f7358SJed Brown 20663813dfbdSMatthew G Knepley Fortran Notes: 20673813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20683813dfbdSMatthew G Knepley include petsc.h90 in your code. 20693813dfbdSMatthew G Knepley 20703813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20713813dfbdSMatthew G Knepley 2072552f7358SJed Brown .keywords: mesh 2073552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2074552f7358SJed Brown @*/ 2075552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2076552f7358SJed Brown { 2077552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2078552f7358SJed Brown PetscInt *offsets, **closures; 2079552f7358SJed Brown PetscInt *meet[2]; 2080552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2081552f7358SJed Brown PetscInt p, h, c, m; 2082552f7358SJed Brown PetscErrorCode ierr; 2083552f7358SJed Brown 2084552f7358SJed Brown PetscFunctionBegin; 2085552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2086552f7358SJed Brown PetscValidPointer(points, 2); 2087552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2088552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2089552f7358SJed Brown 2090552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2091785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2092552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2093e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2094552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2095552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2096552f7358SJed Brown 2097552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2098552f7358SJed Brown PetscInt closureSize; 2099552f7358SJed Brown 2100552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21010d644c17SKarl Rupp 2102552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2103552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2104552f7358SJed Brown PetscInt pStart, pEnd, i; 2105552f7358SJed Brown 2106552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2107552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2108552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2109552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2110552f7358SJed Brown break; 2111552f7358SJed Brown } 2112552f7358SJed Brown } 2113552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2114552f7358SJed Brown } 211582f516ccSBarry 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); 2116552f7358SJed Brown } 2117552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2118552f7358SJed Brown PetscInt dof; 2119552f7358SJed Brown 2120552f7358SJed Brown /* Copy in cone of first point */ 2121552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2122552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2123552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2124552f7358SJed Brown } 2125552f7358SJed Brown /* Check each successive cone */ 2126552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2127552f7358SJed Brown PetscInt newMeetSize = 0; 2128552f7358SJed Brown 2129552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2130552f7358SJed Brown for (c = 0; c < dof; ++c) { 2131552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2132552f7358SJed Brown 2133552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2134552f7358SJed Brown if (point == meet[i][m]) { 2135552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2136552f7358SJed Brown break; 2137552f7358SJed Brown } 2138552f7358SJed Brown } 2139552f7358SJed Brown } 2140552f7358SJed Brown meetSize = newMeetSize; 2141552f7358SJed Brown i = 1-i; 2142552f7358SJed Brown } 2143552f7358SJed Brown if (meetSize) break; 2144552f7358SJed Brown } 2145552f7358SJed Brown *numCoveredPoints = meetSize; 2146552f7358SJed Brown *coveredPoints = meet[i]; 2147552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21480298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2149552f7358SJed Brown } 2150552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2151552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2152552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2153552f7358SJed Brown PetscFunctionReturn(0); 2154552f7358SJed Brown } 2155552f7358SJed Brown 2156552f7358SJed Brown #undef __FUNCT__ 21574e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21584e3744c5SMatthew G. Knepley /*@C 21594e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21604e3744c5SMatthew G. Knepley 21614e3744c5SMatthew G. Knepley Not Collective 21624e3744c5SMatthew G. Knepley 21634e3744c5SMatthew G. Knepley Input Parameters: 21644e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21654e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21664e3744c5SMatthew G. Knepley 21674e3744c5SMatthew G. Knepley Output Parameters: 21684e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21694e3744c5SMatthew G. Knepley 21704e3744c5SMatthew G. Knepley Level: intermediate 21714e3744c5SMatthew G. Knepley 21724e3744c5SMatthew G. Knepley Notes: 21734e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21744e3744c5SMatthew G. Knepley 21754e3744c5SMatthew G. Knepley .keywords: mesh 21764e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 21774e3744c5SMatthew G. Knepley @*/ 21784e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 21794e3744c5SMatthew G. Knepley { 21804e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 21814e3744c5SMatthew G. Knepley PetscErrorCode ierr; 21824e3744c5SMatthew G. Knepley 21834e3744c5SMatthew G. Knepley PetscFunctionBegin; 21844e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 21854e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 21864e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 21874e3744c5SMatthew G. Knepley 21884e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 21894e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21904e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 21914e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 21924e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 21934e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 21944e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 21954e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 21964e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 21974e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 21984e3744c5SMatthew G. Knepley 21994e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22004e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22014e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22024e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22034e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22044e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22054e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22064e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22074e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22084e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22094e3744c5SMatthew G. Knepley } 22104e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22114e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22124e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22134e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22144e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22154e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22164e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22174e3744c5SMatthew G. Knepley } 22184e3744c5SMatthew G. Knepley } 22194e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22204e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22214e3744c5SMatthew G. Knepley } 22224e3744c5SMatthew G. Knepley 22234e3744c5SMatthew G. Knepley #undef __FUNCT__ 222418ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 222518ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2226a6dfd86eSKarl Rupp { 222782f516ccSBarry Smith MPI_Comm comm; 2228552f7358SJed Brown PetscErrorCode ierr; 2229552f7358SJed Brown 2230552f7358SJed Brown PetscFunctionBegin; 223182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2232552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2233552f7358SJed Brown switch (cellDim) { 2234552f7358SJed Brown case 0: 2235552f7358SJed Brown *numFaceVertices = 0; 2236552f7358SJed Brown break; 2237552f7358SJed Brown case 1: 2238552f7358SJed Brown *numFaceVertices = 1; 2239552f7358SJed Brown break; 2240552f7358SJed Brown case 2: 2241552f7358SJed Brown switch (numCorners) { 224219436ca2SJed Brown case 3: /* triangle */ 224319436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2244552f7358SJed Brown break; 224519436ca2SJed Brown case 4: /* quadrilateral */ 224619436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2247552f7358SJed Brown break; 224819436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 224919436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2250552f7358SJed Brown break; 225119436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 225219436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2253552f7358SJed Brown break; 2254552f7358SJed Brown default: 2255552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2256552f7358SJed Brown } 2257552f7358SJed Brown break; 2258552f7358SJed Brown case 3: 2259552f7358SJed Brown switch (numCorners) { 226019436ca2SJed Brown case 4: /* tetradehdron */ 226119436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2262552f7358SJed Brown break; 226319436ca2SJed Brown case 6: /* tet cohesive cells */ 226419436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2265552f7358SJed Brown break; 226619436ca2SJed Brown case 8: /* hexahedron */ 226719436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2268552f7358SJed Brown break; 226919436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 227019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2271552f7358SJed Brown break; 227219436ca2SJed Brown case 10: /* quadratic tetrahedron */ 227319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2274552f7358SJed Brown break; 227519436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 227619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2277552f7358SJed Brown break; 227819436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 227919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2280552f7358SJed Brown break; 228119436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 228219436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2283552f7358SJed Brown break; 2284552f7358SJed Brown default: 2285552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2286552f7358SJed Brown } 2287552f7358SJed Brown break; 2288552f7358SJed Brown default: 2289552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2290552f7358SJed Brown } 2291552f7358SJed Brown PetscFunctionReturn(0); 2292552f7358SJed Brown } 2293552f7358SJed Brown 2294552f7358SJed Brown #undef __FUNCT__ 2295d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2296d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2297d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2298d27a0f52SMatthew G. Knepley { 2299a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2300a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2301a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2302d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2303d27a0f52SMatthew G. Knepley 2304d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2305d27a0f52SMatthew G. Knepley /* Truth Table 2306d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2307d27a0f52SMatthew G. Knepley F 0 flips no F F F 2308d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2309d27a0f52SMatthew G. Knepley F 2 flips no T F T 2310d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2311d27a0f52SMatthew G. Knepley T 1 flip no 2312d27a0f52SMatthew G. Knepley T 2 flips yes 2313d27a0f52SMatthew G. Knepley */ 2314*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2315d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2316a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2317d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2318a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2319a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2320a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2321a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2322a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2323a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2324785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2325a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2326a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2327defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2328a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2329a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2330a1b4d4a2SMatthew G. Knepley 2331a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2332a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2333a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2334a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2335a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2336a1b4d4a2SMatthew G. Knepley } 2337a1b4d4a2SMatthew G. Knepley } 2338a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2339a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2340d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2341a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2342d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2343d27a0f52SMatthew G. Knepley 2344a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2345a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2346a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2347d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2348d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2349a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 235086cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2351a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 235286cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2353d27a0f52SMatthew G. Knepley 2354d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2355d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2356d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2357d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2358d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2359d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2360a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2361a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2362a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2363a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2364a1b4d4a2SMatthew G. Knepley } 2365a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2366a1b4d4a2SMatthew 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); 2367a1b4d4a2SMatthew G. Knepley } 2368a1b4d4a2SMatthew 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]); 2369a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2370a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2371a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2372a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2373a1b4d4a2SMatthew G. Knepley } 2374a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2375a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2376a1b4d4a2SMatthew G. Knepley } 2377a1b4d4a2SMatthew G. Knepley if (posB < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[1]); 2378d27a0f52SMatthew G. Knepley 2379d27a0f52SMatthew G. Knepley if (dim == 1) { 2380d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2381d27a0f52SMatthew G. Knepley } else { 2382d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2383d27a0f52SMatthew G. Knepley } 2384d27a0f52SMatthew G. Knepley 2385d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2386d27a0f52SMatthew 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]); 2387d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2388a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2389d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2390a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2391d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 239286cff514SMatthew 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"); 2393a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2394a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2395d27a0f52SMatthew G. Knepley } 2396fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2397fedde076SMatthew G. Knepley { 2398fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2399fedde076SMatthew G. Knepley PetscSF sf; 2400fedde076SMatthew G. Knepley const PetscInt *lpoints; 2401fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 240213048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2403fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2404a1b4d4a2SMatthew G. Knepley 2405fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2406fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2407fedde076SMatthew G. Knepley if (numLeaves >= 0) { 240862ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 240962ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 241062ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 241113048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 241262ad4a6aSMatthew G. Knepley 2413fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2414fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2415fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2416fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2417fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2418fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2419fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2420fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2421fedde076SMatthew G. Knepley PetscInt supportSize; 2422fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2423fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2424fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2425fedde076SMatthew G. Knepley } 2426fedde076SMatthew G. Knepley } 2427fedde076SMatthew G. Knepley } 242813048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2429fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2430fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2431fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2432fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2433fedde076SMatthew G. Knepley 2434fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 243562ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2436fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2437fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24385b7033fcSMatthew G. Knepley if (dim == 1) { 24395b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24405b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24415b7033fcSMatthew G. Knepley } else { 2442fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2443fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2444fedde076SMatthew G. Knepley } 24455b7033fcSMatthew G. Knepley } 2446fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2447fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2448fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2449fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2450fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2451fedde076SMatthew G. Knepley 245213048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 245313048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 245413048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2455fedde076SMatthew G. Knepley } 245613048561SMatthew G. Knepley /* Collect the graph on 0 */ 245713048561SMatthew G. Knepley { 245813048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2459e8f90184SMatthew G. Knepley Mat G; 246013048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 246113048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 246213048561SMatthew G. Knepley PetscInt *adj = NULL; 246313048561SMatthew G. Knepley PetscBool *val = NULL; 246413048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 246513048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 246613048561SMatthew G. Knepley PetscInt debug = 0; 246713048561SMatthew G. Knepley 246813048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 246913048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 247013048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 247113048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 247213048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 247313048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 247413048561SMatthew G. Knepley } 247513048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 247613048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 247713048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 247813048561SMatthew G. Knepley if (debug) { 247913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 248013048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 248113048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 248213048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 248313048561SMatthew G. Knepley } 248413048561SMatthew G. Knepley } 248513048561SMatthew G. Knepley } 2486e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2487e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2488e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2489e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2490e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2491e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 24929a4fe19dSMatthew G. Knepley const PetscInt r = p; 2493e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 24947406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2495e8f90184SMatthew G. Knepley 24967406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 24977406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2498e8f90184SMatthew G. Knepley } 2499e8f90184SMatthew G. Knepley } 2500e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2501e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2502e8f90184SMatthew G. Knepley 250313048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 250413048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 250513048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 250613048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 250713048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 250813048561SMatthew G. Knepley pTop = pBottom = 0; 250913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251013048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 251113048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 251213048561SMatthew G. Knepley procFIFO[pBottom++] = p; 251313048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 251413048561SMatthew G. Knepley /* Consider each proc in FIFO */ 251513048561SMatthew G. Knepley while (pTop < pBottom) { 2516e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2517e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2518e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 251913048561SMatthew G. Knepley 252013048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252113048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2522e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 252313048561SMatthew G. Knepley /* Loop over neighboring procs */ 2524e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2525e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25267406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 252713048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 252813048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 252913048561SMatthew G. Knepley 253013048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253113048561SMatthew 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); 253213048561SMatthew G. Knepley if (!flippedB) { 253313048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 253413048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 253513048561SMatthew 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"); 253613048561SMatthew G. Knepley if (!seen) { 253713048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 253813048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 253913048561SMatthew G. Knepley } 254013048561SMatthew G. Knepley } 254113048561SMatthew G. Knepley } 254213048561SMatthew G. Knepley } 254313048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2544e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 254513048561SMatthew G. Knepley 254613048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 254713048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 254813048561SMatthew G. Knepley { 254913048561SMatthew G. Knepley PetscBool *flips; 255013048561SMatthew G. Knepley 255113048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255213048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255313048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 255413048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 255513048561SMatthew G. Knepley } 255613048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 255713048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 255813048561SMatthew G. Knepley } 255913048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256013048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256113048561SMatthew G. Knepley } 256213048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2563fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 256413048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2565fedde076SMatthew G. Knepley } 2566fedde076SMatthew G. Knepley } 2567fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2568d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2569d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2570d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2571a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2572f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2573f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2574d27a0f52SMatthew G. Knepley 2575a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2576a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2577a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2578a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2579a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2580a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2581a1b4d4a2SMatthew G. Knepley 2582a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2583a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2584a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2585d27a0f52SMatthew G. Knepley } 2586a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2587a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2588f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2589f4e909fcSMatthew G. Knepley faceSize = coneSize; 2590f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2591f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2592f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2593f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2594f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2595f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2596f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2597f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2598f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2599f4e909fcSMatthew G. Knepley } 2600f4e909fcSMatthew G. Knepley } 2601d27a0f52SMatthew G. Knepley } 2602d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2603d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2604d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2605a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2606a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2607a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2608d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2609d27a0f52SMatthew G. Knepley } 2610d27a0f52SMatthew G. Knepley 2611d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2612895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2613895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2614895b8c46SMatthew G. Knepley { 2615895b8c46SMatthew G. Knepley int tmpc; 2616895b8c46SMatthew G. Knepley 2617895b8c46SMatthew G. Knepley PetscFunctionBegin; 2618895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2619895b8c46SMatthew G. Knepley switch (numCorners) { 2620895b8c46SMatthew G. Knepley case 4: 2621895b8c46SMatthew G. Knepley tmpc = cone[0]; 2622895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2623895b8c46SMatthew G. Knepley cone[1] = tmpc; 2624895b8c46SMatthew G. Knepley break; 2625895b8c46SMatthew G. Knepley case 8: 2626895b8c46SMatthew G. Knepley tmpc = cone[1]; 2627895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2628895b8c46SMatthew G. Knepley cone[3] = tmpc; 2629895b8c46SMatthew G. Knepley break; 2630895b8c46SMatthew G. Knepley default: break; 2631895b8c46SMatthew G. Knepley } 2632895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2633895b8c46SMatthew G. Knepley } 2634895b8c46SMatthew G. Knepley 2635895b8c46SMatthew G. Knepley #undef __FUNCT__ 26369db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26379db3b87dSMatthew G. Knepley /*@C 26389db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26399db3b87dSMatthew G. Knepley 26409db3b87dSMatthew G. Knepley Input Parameters: 26419db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26429db3b87dSMatthew G. Knepley - cone - The incoming cone 26439db3b87dSMatthew G. Knepley 26449db3b87dSMatthew G. Knepley Output Parameter: 26459db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26469db3b87dSMatthew G. Knepley 26479db3b87dSMatthew G. Knepley Level: developer 26489db3b87dSMatthew G. Knepley 26499db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26509db3b87dSMatthew G. Knepley @*/ 26519db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26522e1b13c2SMatthew G. Knepley { 26539db3b87dSMatthew G. Knepley int tmpc; 26542e1b13c2SMatthew G. Knepley 26552e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26569db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26579db3b87dSMatthew G. Knepley switch (numCorners) { 26589db3b87dSMatthew G. Knepley case 4: 26591885f254SMatthew G. Knepley tmpc = cone[0]; 26601885f254SMatthew G. Knepley cone[0] = cone[1]; 26611885f254SMatthew G. Knepley cone[1] = tmpc; 26629db3b87dSMatthew G. Knepley break; 26639db3b87dSMatthew G. Knepley case 8: 26649db3b87dSMatthew G. Knepley tmpc = cone[1]; 26659db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26669db3b87dSMatthew G. Knepley cone[3] = tmpc; 26679db3b87dSMatthew G. Knepley break; 26689db3b87dSMatthew G. Knepley default: break; 26699db3b87dSMatthew G. Knepley } 26709db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26719db3b87dSMatthew G. Knepley } 26729db3b87dSMatthew G. Knepley 26739db3b87dSMatthew G. Knepley #undef __FUNCT__ 26749db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26759db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26769db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26779db3b87dSMatthew G. Knepley { 26789db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26799db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26809db3b87dSMatthew G. Knepley 26819db3b87dSMatthew G. Knepley PetscFunctionBegin; 26829db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26839db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26842e1b13c2SMatthew G. Knepley } 26852e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26862e1b13c2SMatthew G. Knepley } 26872e1b13c2SMatthew G. Knepley 2688519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2689552f7358SJed Brown #include <triangle.h> 2690552f7358SJed Brown 2691552f7358SJed Brown #undef __FUNCT__ 2692552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 26930adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 26940adebc6cSBarry Smith { 2695552f7358SJed Brown PetscFunctionBegin; 2696552f7358SJed Brown inputCtx->numberofpoints = 0; 2697552f7358SJed Brown inputCtx->numberofpointattributes = 0; 26980298fd71SBarry Smith inputCtx->pointlist = NULL; 26990298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27000298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2701552f7358SJed Brown inputCtx->numberofsegments = 0; 27020298fd71SBarry Smith inputCtx->segmentlist = NULL; 27030298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2704552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27050298fd71SBarry Smith inputCtx->trianglelist = NULL; 2706552f7358SJed Brown inputCtx->numberofholes = 0; 27070298fd71SBarry Smith inputCtx->holelist = NULL; 2708552f7358SJed Brown inputCtx->numberofregions = 0; 27090298fd71SBarry Smith inputCtx->regionlist = NULL; 2710552f7358SJed Brown PetscFunctionReturn(0); 2711552f7358SJed Brown } 2712552f7358SJed Brown 2713552f7358SJed Brown #undef __FUNCT__ 2714552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27150adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27160adebc6cSBarry Smith { 2717552f7358SJed Brown PetscFunctionBegin; 2718552f7358SJed Brown outputCtx->numberofpoints = 0; 27190298fd71SBarry Smith outputCtx->pointlist = NULL; 27200298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27210298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2722552f7358SJed Brown outputCtx->numberoftriangles = 0; 27230298fd71SBarry Smith outputCtx->trianglelist = NULL; 27240298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27250298fd71SBarry Smith outputCtx->neighborlist = NULL; 27260298fd71SBarry Smith outputCtx->segmentlist = NULL; 27270298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2728552f7358SJed Brown outputCtx->numberofedges = 0; 27290298fd71SBarry Smith outputCtx->edgelist = NULL; 27300298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2731552f7358SJed Brown PetscFunctionReturn(0); 2732552f7358SJed Brown } 2733552f7358SJed Brown 2734552f7358SJed Brown #undef __FUNCT__ 2735552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27360adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27370adebc6cSBarry Smith { 2738552f7358SJed Brown PetscFunctionBegin; 273923b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2740552f7358SJed Brown free(outputCtx->pointmarkerlist); 274123b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 274223b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2743552f7358SJed Brown free(outputCtx->edgelist); 2744552f7358SJed Brown free(outputCtx->edgemarkerlist); 2745552f7358SJed Brown free(outputCtx->trianglelist); 2746552f7358SJed Brown free(outputCtx->neighborlist); 2747552f7358SJed Brown PetscFunctionReturn(0); 2748552f7358SJed Brown } 2749552f7358SJed Brown 2750552f7358SJed Brown #undef __FUNCT__ 2751552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2752552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2753552f7358SJed Brown { 275482f516ccSBarry Smith MPI_Comm comm; 2755552f7358SJed Brown PetscInt dim = 2; 2756552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2757552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2758552f7358SJed Brown struct triangulateio in; 2759552f7358SJed Brown struct triangulateio out; 2760552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2761552f7358SJed Brown PetscMPIInt rank; 2762552f7358SJed Brown PetscErrorCode ierr; 2763552f7358SJed Brown 2764552f7358SJed Brown PetscFunctionBegin; 276582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2766552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2767552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2768552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2769552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27700d644c17SKarl Rupp 2771552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2772552f7358SJed Brown if (in.numberofpoints > 0) { 2773552f7358SJed Brown PetscSection coordSection; 2774552f7358SJed Brown Vec coordinates; 2775552f7358SJed Brown PetscScalar *array; 2776552f7358SJed Brown 2777785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2778785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2779552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 278069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2781552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2782552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2783552f7358SJed Brown const PetscInt idx = v - vStart; 2784552f7358SJed Brown PetscInt off, d; 2785552f7358SJed Brown 2786552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2787552f7358SJed Brown for (d = 0; d < dim; ++d) { 2788552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2789552f7358SJed Brown } 2790552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2791552f7358SJed Brown } 2792552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2793552f7358SJed Brown } 2794552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2795552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2796552f7358SJed Brown if (in.numberofsegments > 0) { 2797785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2798785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2799552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2800552f7358SJed Brown const PetscInt idx = e - eStart; 2801552f7358SJed Brown const PetscInt *cone; 2802552f7358SJed Brown 2803552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28040d644c17SKarl Rupp 2805552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2806552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28070d644c17SKarl Rupp 2808552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2809552f7358SJed Brown } 2810552f7358SJed Brown } 2811552f7358SJed Brown #if 0 /* Do not currently support holes */ 2812552f7358SJed Brown PetscReal *holeCoords; 2813552f7358SJed Brown PetscInt h, d; 2814552f7358SJed Brown 2815552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2816552f7358SJed Brown if (in.numberofholes > 0) { 2817785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2818552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2819552f7358SJed Brown for (d = 0; d < dim; ++d) { 2820552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2821552f7358SJed Brown } 2822552f7358SJed Brown } 2823552f7358SJed Brown } 2824552f7358SJed Brown #endif 2825552f7358SJed Brown if (!rank) { 2826552f7358SJed Brown char args[32]; 2827552f7358SJed Brown 2828552f7358SJed Brown /* Take away 'Q' for verbose output */ 2829552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2830552f7358SJed Brown if (createConvexHull) { 2831552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2832552f7358SJed Brown } 2833552f7358SJed Brown if (constrained) { 2834552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2835552f7358SJed Brown } 28360298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2837552f7358SJed Brown } 2838552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2839552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2840552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2841552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2842552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2843552f7358SJed Brown 2844552f7358SJed Brown { 2845552f7358SJed Brown const PetscInt numCorners = 3; 2846552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2847552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2848552f7358SJed Brown const int *cells = out.trianglelist; 2849552f7358SJed Brown const double *meshCoords = out.pointlist; 2850552f7358SJed Brown 28510fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2852552f7358SJed Brown /* Set labels */ 2853552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2854552f7358SJed Brown if (out.pointmarkerlist[v]) { 2855552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2856552f7358SJed Brown } 2857552f7358SJed Brown } 2858552f7358SJed Brown if (interpolate) { 2859552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2860552f7358SJed Brown if (out.edgemarkerlist[e]) { 2861552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2862552f7358SJed Brown const PetscInt *edges; 2863552f7358SJed Brown PetscInt numEdges; 2864552f7358SJed Brown 2865552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2866552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2867552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2868552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2869552f7358SJed Brown } 2870552f7358SJed Brown } 2871552f7358SJed Brown } 2872552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2873552f7358SJed Brown } 2874552f7358SJed Brown #if 0 /* Do not currently support holes */ 2875552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2876552f7358SJed Brown #endif 2877552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2878552f7358SJed Brown PetscFunctionReturn(0); 2879552f7358SJed Brown } 2880552f7358SJed Brown 2881552f7358SJed Brown #undef __FUNCT__ 2882552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2883552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2884552f7358SJed Brown { 288582f516ccSBarry Smith MPI_Comm comm; 2886552f7358SJed Brown PetscInt dim = 2; 2887552f7358SJed Brown struct triangulateio in; 2888552f7358SJed Brown struct triangulateio out; 2889552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2890552f7358SJed Brown PetscMPIInt rank; 2891552f7358SJed Brown PetscErrorCode ierr; 2892552f7358SJed Brown 2893552f7358SJed Brown PetscFunctionBegin; 289482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2895552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2896552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2897552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2898552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2899552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2900552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29010d644c17SKarl Rupp 2902552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2903552f7358SJed Brown if (in.numberofpoints > 0) { 2904552f7358SJed Brown PetscSection coordSection; 2905552f7358SJed Brown Vec coordinates; 2906552f7358SJed Brown PetscScalar *array; 2907552f7358SJed Brown 2908785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2909785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2910552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 291169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2912552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2913552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2914552f7358SJed Brown const PetscInt idx = v - vStart; 2915552f7358SJed Brown PetscInt off, d; 2916552f7358SJed Brown 2917552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2918552f7358SJed Brown for (d = 0; d < dim; ++d) { 2919552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2920552f7358SJed Brown } 2921552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2922552f7358SJed Brown } 2923552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2924552f7358SJed Brown } 2925552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29260d644c17SKarl Rupp 2927552f7358SJed Brown in.numberofcorners = 3; 2928552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29290d644c17SKarl Rupp 2930552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2931552f7358SJed Brown if (in.numberoftriangles > 0) { 2932785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2933552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2934552f7358SJed Brown const PetscInt idx = c - cStart; 29350298fd71SBarry Smith PetscInt *closure = NULL; 2936552f7358SJed Brown PetscInt closureSize; 2937552f7358SJed Brown 2938552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2939552f7358SJed 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); 2940552f7358SJed Brown for (v = 0; v < 3; ++v) { 2941552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2942552f7358SJed Brown } 2943552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2944552f7358SJed Brown } 2945552f7358SJed Brown } 2946552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2947552f7358SJed Brown #if 0 /* Do not currently support holes */ 2948552f7358SJed Brown PetscReal *holeCoords; 2949552f7358SJed Brown PetscInt h, d; 2950552f7358SJed Brown 2951552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2952552f7358SJed Brown if (in.numberofholes > 0) { 2953785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2954552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2955552f7358SJed Brown for (d = 0; d < dim; ++d) { 2956552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2957552f7358SJed Brown } 2958552f7358SJed Brown } 2959552f7358SJed Brown } 2960552f7358SJed Brown #endif 2961552f7358SJed Brown if (!rank) { 2962552f7358SJed Brown char args[32]; 2963552f7358SJed Brown 2964552f7358SJed Brown /* Take away 'Q' for verbose output */ 2965552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29660298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2967552f7358SJed Brown } 2968552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2969552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2970552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2971552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2972552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2973552f7358SJed Brown 2974552f7358SJed Brown { 2975552f7358SJed Brown const PetscInt numCorners = 3; 2976552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2977552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2978552f7358SJed Brown const int *cells = out.trianglelist; 2979552f7358SJed Brown const double *meshCoords = out.pointlist; 2980552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2981552f7358SJed Brown 29820fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2983552f7358SJed Brown /* Set labels */ 2984552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2985552f7358SJed Brown if (out.pointmarkerlist[v]) { 2986552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2987552f7358SJed Brown } 2988552f7358SJed Brown } 2989552f7358SJed Brown if (interpolate) { 2990552f7358SJed Brown PetscInt e; 2991552f7358SJed Brown 2992552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2993552f7358SJed Brown if (out.edgemarkerlist[e]) { 2994552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2995552f7358SJed Brown const PetscInt *edges; 2996552f7358SJed Brown PetscInt numEdges; 2997552f7358SJed Brown 2998552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2999552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3000552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3001552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3002552f7358SJed Brown } 3003552f7358SJed Brown } 3004552f7358SJed Brown } 3005552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3006552f7358SJed Brown } 3007552f7358SJed Brown #if 0 /* Do not currently support holes */ 3008552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3009552f7358SJed Brown #endif 3010552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3011552f7358SJed Brown PetscFunctionReturn(0); 3012552f7358SJed Brown } 3013552f7358SJed Brown #endif 3014552f7358SJed Brown 3015519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3016552f7358SJed Brown #include <tetgen.h> 3017552f7358SJed Brown #undef __FUNCT__ 3018552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3019552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3020552f7358SJed Brown { 302182f516ccSBarry Smith MPI_Comm comm; 3022552f7358SJed Brown const PetscInt dim = 3; 3023552f7358SJed Brown ::tetgenio in; 3024552f7358SJed Brown ::tetgenio out; 3025552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3026552f7358SJed Brown PetscMPIInt rank; 3027552f7358SJed Brown PetscErrorCode ierr; 3028552f7358SJed Brown 3029552f7358SJed Brown PetscFunctionBegin; 303082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3031552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3032552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3033552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3034552f7358SJed Brown if (in.numberofpoints > 0) { 3035552f7358SJed Brown PetscSection coordSection; 3036552f7358SJed Brown Vec coordinates; 3037552f7358SJed Brown PetscScalar *array; 3038552f7358SJed Brown 3039552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3040552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30410d644c17SKarl Rupp 3042552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 304369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3044552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3045552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3046552f7358SJed Brown const PetscInt idx = v - vStart; 3047552f7358SJed Brown PetscInt off, d; 3048552f7358SJed Brown 3049552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3050a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3051552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3052552f7358SJed Brown } 3053552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3054552f7358SJed Brown } 3055552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30560d644c17SKarl Rupp 3057552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3058552f7358SJed Brown if (in.numberoffacets > 0) { 3059552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3060552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3061552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3062552f7358SJed Brown const PetscInt idx = f - fStart; 30630298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3064552f7358SJed Brown 3065552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3066552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3067552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3068552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3069552f7358SJed Brown 3070552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3071552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3072552f7358SJed Brown const PetscInt point = points[p]; 30730d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3074552f7358SJed Brown } 3075552f7358SJed Brown 3076552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3077552f7358SJed Brown poly->numberofvertices = numVertices; 3078552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3079552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3080552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3081552f7358SJed Brown poly->vertexlist[v] = vIdx; 3082552f7358SJed Brown } 3083552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3084552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3085552f7358SJed Brown } 3086552f7358SJed Brown } 3087552f7358SJed Brown if (!rank) { 3088552f7358SJed Brown char args[32]; 3089552f7358SJed Brown 3090552f7358SJed Brown /* Take away 'Q' for verbose output */ 3091552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3092552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3093552f7358SJed Brown } 3094552f7358SJed Brown { 3095552f7358SJed Brown const PetscInt numCorners = 4; 3096552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3097552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3098552f7358SJed Brown const double *meshCoords = out.pointlist; 30991d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3100552f7358SJed Brown 31019db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31020fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3103552f7358SJed Brown /* Set labels */ 3104552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3105552f7358SJed Brown if (out.pointmarkerlist[v]) { 3106552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3107552f7358SJed Brown } 3108552f7358SJed Brown } 3109552f7358SJed Brown if (interpolate) { 3110552f7358SJed Brown PetscInt e; 3111552f7358SJed Brown 3112552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3113552f7358SJed Brown if (out.edgemarkerlist[e]) { 3114552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3115552f7358SJed Brown const PetscInt *edges; 3116552f7358SJed Brown PetscInt numEdges; 3117552f7358SJed Brown 3118552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3119552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3120552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3121552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3122552f7358SJed Brown } 3123552f7358SJed Brown } 3124552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3125552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3126552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3127552f7358SJed Brown const PetscInt *faces; 3128552f7358SJed Brown PetscInt numFaces; 3129552f7358SJed Brown 3130552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3131552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3132552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3133552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3134552f7358SJed Brown } 3135552f7358SJed Brown } 3136552f7358SJed Brown } 3137552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3138552f7358SJed Brown } 3139552f7358SJed Brown PetscFunctionReturn(0); 3140552f7358SJed Brown } 3141552f7358SJed Brown 3142552f7358SJed Brown #undef __FUNCT__ 3143552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3144552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3145552f7358SJed Brown { 314682f516ccSBarry Smith MPI_Comm comm; 3147552f7358SJed Brown const PetscInt dim = 3; 3148552f7358SJed Brown ::tetgenio in; 3149552f7358SJed Brown ::tetgenio out; 3150552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3151552f7358SJed Brown PetscMPIInt rank; 3152552f7358SJed Brown PetscErrorCode ierr; 3153552f7358SJed Brown 3154552f7358SJed Brown PetscFunctionBegin; 315582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3156552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3157552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3158552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3159552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31600d644c17SKarl Rupp 3161552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3162552f7358SJed Brown if (in.numberofpoints > 0) { 3163552f7358SJed Brown PetscSection coordSection; 3164552f7358SJed Brown Vec coordinates; 3165552f7358SJed Brown PetscScalar *array; 3166552f7358SJed Brown 3167552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3168552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31690d644c17SKarl Rupp 3170552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 317169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3172552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3173552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3174552f7358SJed Brown const PetscInt idx = v - vStart; 3175552f7358SJed Brown PetscInt off, d; 3176552f7358SJed Brown 3177552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3178a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3179552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3180552f7358SJed Brown } 3181552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3182552f7358SJed Brown } 3183552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31840d644c17SKarl Rupp 3185552f7358SJed Brown in.numberofcorners = 4; 3186552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3187552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3188552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3189552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3190552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3191552f7358SJed Brown const PetscInt idx = c - cStart; 31920298fd71SBarry Smith PetscInt *closure = NULL; 3193552f7358SJed Brown PetscInt closureSize; 3194552f7358SJed Brown 3195552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3196552f7358SJed 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); 3197552f7358SJed Brown for (v = 0; v < 4; ++v) { 3198552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3199552f7358SJed Brown } 3200552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3201552f7358SJed Brown } 3202552f7358SJed Brown } 320319436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3204552f7358SJed Brown if (!rank) { 3205552f7358SJed Brown char args[32]; 3206552f7358SJed Brown 3207552f7358SJed Brown /* Take away 'Q' for verbose output */ 320819436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3209552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3210552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3211552f7358SJed Brown } 3212552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3213552f7358SJed Brown 3214552f7358SJed Brown { 3215552f7358SJed Brown const PetscInt numCorners = 4; 3216552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3217552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3218552f7358SJed Brown const double *meshCoords = out.pointlist; 32191d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32201d4b4d7bSJed Brown 3221552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3222552f7358SJed Brown 32239db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32240fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3225552f7358SJed Brown /* Set labels */ 3226552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3227552f7358SJed Brown if (out.pointmarkerlist[v]) { 3228552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3229552f7358SJed Brown } 3230552f7358SJed Brown } 3231552f7358SJed Brown if (interpolate) { 3232552f7358SJed Brown PetscInt e, f; 3233552f7358SJed Brown 3234552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3235552f7358SJed Brown if (out.edgemarkerlist[e]) { 3236552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3237552f7358SJed Brown const PetscInt *edges; 3238552f7358SJed Brown PetscInt numEdges; 3239552f7358SJed Brown 3240552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3241552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3242552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3243552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3244552f7358SJed Brown } 3245552f7358SJed Brown } 3246552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3247552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3248552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3249552f7358SJed Brown const PetscInt *faces; 3250552f7358SJed Brown PetscInt numFaces; 3251552f7358SJed Brown 3252552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3253552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3254552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3255552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3256552f7358SJed Brown } 3257552f7358SJed Brown } 3258552f7358SJed Brown } 3259552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3260552f7358SJed Brown } 3261552f7358SJed Brown PetscFunctionReturn(0); 3262552f7358SJed Brown } 3263552f7358SJed Brown #endif 3264552f7358SJed Brown 3265519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3266aaa7dc30SBarry Smith #include <ctetgen.h> 3267552f7358SJed Brown 3268552f7358SJed Brown #undef __FUNCT__ 3269552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3270552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3271552f7358SJed Brown { 327282f516ccSBarry Smith MPI_Comm comm; 3273552f7358SJed Brown const PetscInt dim = 3; 3274552f7358SJed Brown PLC *in, *out; 3275552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3276552f7358SJed Brown PetscMPIInt rank; 3277552f7358SJed Brown PetscErrorCode ierr; 3278552f7358SJed Brown 3279552f7358SJed Brown PetscFunctionBegin; 328082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32810298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3282552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3283552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3284552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3285552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32860d644c17SKarl Rupp 3287552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3288552f7358SJed Brown if (in->numberofpoints > 0) { 3289552f7358SJed Brown PetscSection coordSection; 3290552f7358SJed Brown Vec coordinates; 3291552f7358SJed Brown PetscScalar *array; 3292552f7358SJed Brown 3293785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3294785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3295552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 329669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3297552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3298552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3299552f7358SJed Brown const PetscInt idx = v - vStart; 3300552f7358SJed Brown PetscInt off, d, m; 3301552f7358SJed Brown 3302552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3303552f7358SJed Brown for (d = 0; d < dim; ++d) { 3304552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3305552f7358SJed Brown } 3306552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33070d644c17SKarl Rupp 3308552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3309552f7358SJed Brown } 3310552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3311552f7358SJed Brown } 3312552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33130d644c17SKarl Rupp 3314552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3315552f7358SJed Brown if (in->numberoffacets > 0) { 3316785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3317785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3318552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3319552f7358SJed Brown const PetscInt idx = f - fStart; 33200298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3321552f7358SJed Brown polygon *poly; 3322552f7358SJed Brown 3323552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33240d644c17SKarl Rupp 3325785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33260d644c17SKarl Rupp 3327552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33280298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3329552f7358SJed Brown 3330552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3331552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3332552f7358SJed Brown const PetscInt point = points[p]; 33330d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3334552f7358SJed Brown } 3335552f7358SJed Brown 3336552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3337552f7358SJed Brown poly->numberofvertices = numVertices; 3338785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3339552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3340552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3341552f7358SJed Brown poly->vertexlist[v] = vIdx; 3342552f7358SJed Brown } 3343552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3344552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3345552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3346552f7358SJed Brown } 3347552f7358SJed Brown } 3348552f7358SJed Brown if (!rank) { 3349552f7358SJed Brown TetGenOpts t; 3350552f7358SJed Brown 3351552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3352552f7358SJed Brown t.in = boundary; /* Should go away */ 3353552f7358SJed Brown t.plc = 1; 3354552f7358SJed Brown t.quality = 1; 3355552f7358SJed Brown t.edgesout = 1; 3356552f7358SJed Brown t.zeroindex = 1; 3357552f7358SJed Brown t.quiet = 1; 3358552f7358SJed Brown t.verbose = verbose; 3359552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3360552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3361552f7358SJed Brown } 3362552f7358SJed Brown { 3363552f7358SJed Brown const PetscInt numCorners = 4; 3364552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3365552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3366552f7358SJed Brown const double *meshCoords = out->pointlist; 33671d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3368552f7358SJed Brown 33699db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33700fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3371552f7358SJed Brown /* Set labels */ 3372552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3373552f7358SJed Brown if (out->pointmarkerlist[v]) { 3374552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3375552f7358SJed Brown } 3376552f7358SJed Brown } 3377552f7358SJed Brown if (interpolate) { 3378552f7358SJed Brown PetscInt e; 3379552f7358SJed Brown 3380552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3381552f7358SJed Brown if (out->edgemarkerlist[e]) { 3382552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3383552f7358SJed Brown const PetscInt *edges; 3384552f7358SJed Brown PetscInt numEdges; 3385552f7358SJed Brown 3386552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3387552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3388552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3389552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3390552f7358SJed Brown } 3391552f7358SJed Brown } 3392552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3393552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3394552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3395552f7358SJed Brown const PetscInt *faces; 3396552f7358SJed Brown PetscInt numFaces; 3397552f7358SJed Brown 3398552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3399552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3400552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3401552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3402552f7358SJed Brown } 3403552f7358SJed Brown } 3404552f7358SJed Brown } 3405552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3406552f7358SJed Brown } 3407552f7358SJed Brown 3408552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3409552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3410552f7358SJed Brown PetscFunctionReturn(0); 3411552f7358SJed Brown } 3412552f7358SJed Brown 3413552f7358SJed Brown #undef __FUNCT__ 3414552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3415552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3416552f7358SJed Brown { 341782f516ccSBarry Smith MPI_Comm comm; 3418552f7358SJed Brown const PetscInt dim = 3; 3419552f7358SJed Brown PLC *in, *out; 3420552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3421552f7358SJed Brown PetscMPIInt rank; 3422552f7358SJed Brown PetscErrorCode ierr; 3423552f7358SJed Brown 3424552f7358SJed Brown PetscFunctionBegin; 342582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34260298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3427552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3428552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3429552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3430552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3431552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3432552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34330d644c17SKarl Rupp 3434552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3435552f7358SJed Brown if (in->numberofpoints > 0) { 3436552f7358SJed Brown PetscSection coordSection; 3437552f7358SJed Brown Vec coordinates; 3438552f7358SJed Brown PetscScalar *array; 3439552f7358SJed Brown 3440785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3441785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3442552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 344369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3444552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3445552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3446552f7358SJed Brown const PetscInt idx = v - vStart; 3447552f7358SJed Brown PetscInt off, d, m; 3448552f7358SJed Brown 3449552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3450552f7358SJed Brown for (d = 0; d < dim; ++d) { 3451552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3452552f7358SJed Brown } 3453552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34540d644c17SKarl Rupp 3455552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3456552f7358SJed Brown } 3457552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3458552f7358SJed Brown } 3459552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34600d644c17SKarl Rupp 3461552f7358SJed Brown in->numberofcorners = 4; 3462552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3463552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3464552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3465785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3466552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3467552f7358SJed Brown const PetscInt idx = c - cStart; 34680298fd71SBarry Smith PetscInt *closure = NULL; 3469552f7358SJed Brown PetscInt closureSize; 3470552f7358SJed Brown 3471552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3472552f7358SJed 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); 3473552f7358SJed Brown for (v = 0; v < 4; ++v) { 3474552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3475552f7358SJed Brown } 3476552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3477552f7358SJed Brown } 3478552f7358SJed Brown } 3479552f7358SJed Brown if (!rank) { 3480552f7358SJed Brown TetGenOpts t; 3481552f7358SJed Brown 3482552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34830d644c17SKarl Rupp 3484552f7358SJed Brown t.in = dm; /* Should go away */ 3485552f7358SJed Brown t.refine = 1; 3486552f7358SJed Brown t.varvolume = 1; 3487552f7358SJed Brown t.quality = 1; 3488552f7358SJed Brown t.edgesout = 1; 3489552f7358SJed Brown t.zeroindex = 1; 3490552f7358SJed Brown t.quiet = 1; 3491552f7358SJed Brown t.verbose = verbose; /* Change this */ 34920d644c17SKarl Rupp 3493552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3494552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3495552f7358SJed Brown } 3496552f7358SJed Brown { 3497552f7358SJed Brown const PetscInt numCorners = 4; 3498552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3499552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3500552f7358SJed Brown const double *meshCoords = out->pointlist; 35011d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3502552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3503552f7358SJed Brown 35049db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35050fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3506552f7358SJed Brown /* Set labels */ 3507552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3508552f7358SJed Brown if (out->pointmarkerlist[v]) { 3509552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3510552f7358SJed Brown } 3511552f7358SJed Brown } 3512552f7358SJed Brown if (interpolate) { 3513552f7358SJed Brown PetscInt e, f; 3514552f7358SJed Brown 3515552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3516552f7358SJed Brown if (out->edgemarkerlist[e]) { 3517552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3518552f7358SJed Brown const PetscInt *edges; 3519552f7358SJed Brown PetscInt numEdges; 3520552f7358SJed Brown 3521552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3522552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3523552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3524552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3525552f7358SJed Brown } 3526552f7358SJed Brown } 3527552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3528552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3529552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3530552f7358SJed Brown const PetscInt *faces; 3531552f7358SJed Brown PetscInt numFaces; 3532552f7358SJed Brown 3533552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3534552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3535552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3536552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3537552f7358SJed Brown } 3538552f7358SJed Brown } 3539552f7358SJed Brown } 3540552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3541552f7358SJed Brown } 3542552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3543552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3544552f7358SJed Brown PetscFunctionReturn(0); 3545552f7358SJed Brown } 3546552f7358SJed Brown #endif 3547552f7358SJed Brown 3548552f7358SJed Brown #undef __FUNCT__ 3549552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3550552f7358SJed Brown /*@C 3551552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3552552f7358SJed Brown 3553552f7358SJed Brown Not Collective 3554552f7358SJed Brown 3555552f7358SJed Brown Input Parameters: 3556552f7358SJed Brown + boundary - The DMPlex boundary object 3557552f7358SJed Brown . name - The mesh generation package name 3558552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3559552f7358SJed Brown 3560552f7358SJed Brown Output Parameter: 3561552f7358SJed Brown . mesh - The DMPlex object 3562552f7358SJed Brown 3563552f7358SJed Brown Level: intermediate 3564552f7358SJed Brown 3565552f7358SJed Brown .keywords: mesh, elements 3566552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3567552f7358SJed Brown @*/ 3568552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3569552f7358SJed Brown { 3570552f7358SJed Brown PetscInt dim; 3571552f7358SJed Brown char genname[1024]; 3572552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3573552f7358SJed Brown PetscErrorCode ierr; 3574552f7358SJed Brown 3575552f7358SJed Brown PetscFunctionBegin; 3576552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3577552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3578*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3579552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35800d644c17SKarl Rupp if (flg) name = genname; 3581552f7358SJed Brown if (name) { 3582552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3583552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3584552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3585552f7358SJed Brown } 3586552f7358SJed Brown switch (dim) { 3587552f7358SJed Brown case 1: 3588552f7358SJed Brown if (!name || isTriangle) { 3589519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3590552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3591552f7358SJed Brown #else 359282f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3593552f7358SJed Brown #endif 359482f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3595552f7358SJed Brown break; 3596552f7358SJed Brown case 2: 3597552f7358SJed Brown if (!name || isCTetgen) { 3598519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3599552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3600552f7358SJed Brown #else 360182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3602552f7358SJed Brown #endif 3603552f7358SJed Brown } else if (isTetgen) { 3604519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3605552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3606552f7358SJed Brown #else 360782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3608552f7358SJed Brown #endif 360982f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3610552f7358SJed Brown break; 3611552f7358SJed Brown default: 361282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3613552f7358SJed Brown } 3614552f7358SJed Brown PetscFunctionReturn(0); 3615552f7358SJed Brown } 3616552f7358SJed Brown 3617552f7358SJed Brown #undef __FUNCT__ 3618552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3619552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3620552f7358SJed Brown { 3621552f7358SJed Brown PetscReal refinementLimit; 3622552f7358SJed Brown PetscInt dim, cStart, cEnd; 36230298fd71SBarry Smith char genname[1024], *name = NULL; 3624552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3625552f7358SJed Brown PetscErrorCode ierr; 3626552f7358SJed Brown 3627552f7358SJed Brown PetscFunctionBegin; 3628552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3629552f7358SJed Brown if (isUniform) { 3630552f7358SJed Brown CellRefiner cellRefiner; 3631552f7358SJed Brown 3632509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3633509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36348e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3635552f7358SJed Brown PetscFunctionReturn(0); 3636552f7358SJed Brown } 3637552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3638552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3639*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3640552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3641552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36420d644c17SKarl Rupp if (flg) name = genname; 3643552f7358SJed Brown if (name) { 3644552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3645552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3646552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3647552f7358SJed Brown } 3648552f7358SJed Brown switch (dim) { 3649552f7358SJed Brown case 2: 3650552f7358SJed Brown if (!name || isTriangle) { 3651519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3652552f7358SJed Brown double *maxVolumes; 3653552f7358SJed Brown PetscInt c; 3654552f7358SJed Brown 3655785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36560d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3657552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36586b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3659552f7358SJed Brown #else 366082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3661552f7358SJed Brown #endif 366282f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3663552f7358SJed Brown break; 3664552f7358SJed Brown case 3: 3665552f7358SJed Brown if (!name || isCTetgen) { 3666519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3667552f7358SJed Brown PetscReal *maxVolumes; 3668552f7358SJed Brown PetscInt c; 3669552f7358SJed Brown 3670785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36710d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3672552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3673552f7358SJed Brown #else 367482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3675552f7358SJed Brown #endif 3676552f7358SJed Brown } else if (isTetgen) { 3677519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3678552f7358SJed Brown double *maxVolumes; 3679552f7358SJed Brown PetscInt c; 3680552f7358SJed Brown 3681785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36820d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3683552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3684552f7358SJed Brown #else 368582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3686552f7358SJed Brown #endif 368782f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3688552f7358SJed Brown break; 3689552f7358SJed Brown default: 369082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3691552f7358SJed Brown } 36928e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3693552f7358SJed Brown PetscFunctionReturn(0); 3694552f7358SJed Brown } 3695552f7358SJed Brown 3696552f7358SJed Brown #undef __FUNCT__ 36970a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 36980a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 36990a6ba040SMatthew G. Knepley { 37000a6ba040SMatthew G. Knepley DM cdm = dm; 37010a6ba040SMatthew G. Knepley PetscInt r; 37020a6ba040SMatthew G. Knepley PetscBool isUniform; 37030a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37040a6ba040SMatthew G. Knepley 37050a6ba040SMatthew G. Knepley PetscFunctionBegin; 37060a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37070a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37080a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37090a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37100a6ba040SMatthew G. Knepley 37110a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37120a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37130a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37140a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37150a6ba040SMatthew G. Knepley } 37160a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37170a6ba040SMatthew G. Knepley } 37180a6ba040SMatthew G. Knepley 37190a6ba040SMatthew G. Knepley #undef __FUNCT__ 37200a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37210a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37220a6ba040SMatthew G. Knepley { 37230a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3724549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37250a6ba040SMatthew G. Knepley 37260a6ba040SMatthew G. Knepley PetscFunctionBegin; 3727549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37280a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37290a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37300a6ba040SMatthew G. Knepley } 37310a6ba040SMatthew G. Knepley 37320a6ba040SMatthew G. Knepley #undef __FUNCT__ 3733d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3734d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3735d49fcaecSMatthew G. Knepley { 3736d49fcaecSMatthew G. Knepley PetscInt d; 3737d49fcaecSMatthew G. Knepley 3738d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3739d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3740d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3741d49fcaecSMatthew G. Knepley } else { 3742d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3743d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3744858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3745d49fcaecSMatthew G. Knepley } else { 3746d49fcaecSMatthew G. Knepley out[d] = in[d]; 3747d49fcaecSMatthew G. Knepley } 3748d49fcaecSMatthew G. Knepley } 3749d49fcaecSMatthew G. Knepley } 3750d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3751d49fcaecSMatthew G. Knepley } 3752d49fcaecSMatthew G. Knepley 3753d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3754d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3755d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3756d49fcaecSMatthew G. Knepley { 3757d49fcaecSMatthew G. Knepley PetscInt d; 3758d49fcaecSMatthew G. Knepley 3759d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3760d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3761d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3762d49fcaecSMatthew G. Knepley } else { 3763d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3764d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3765858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3766d49fcaecSMatthew G. Knepley } else { 3767d49fcaecSMatthew G. Knepley out[d] += in[d]; 3768d49fcaecSMatthew G. Knepley } 3769d49fcaecSMatthew G. Knepley } 3770d49fcaecSMatthew G. Knepley } 3771d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3772d49fcaecSMatthew G. Knepley } 3773d49fcaecSMatthew G. Knepley 3774d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3775d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3776d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3777d49fcaecSMatthew G. Knepley { 3778d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3779d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3780d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 37818c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3782d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3783d49fcaecSMatthew G. Knepley 3784d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3785d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3786d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3787d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3788d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3789d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3790d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3791d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 37928c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 37938c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 37948c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3795d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3796d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3797d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3798d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 37998c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3800d49fcaecSMatthew G. Knepley } 3801d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3802d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3803d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38048c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3805d49fcaecSMatthew G. Knepley } 3806d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3807d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3808d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3809d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3810d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3811d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3812d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3813d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3814d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3815d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3816d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3817d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3818d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3819d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3820d49fcaecSMatthew G. Knepley } 3821d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3822d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3823d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3824d49fcaecSMatthew G. Knepley PetscInt b; 3825d49fcaecSMatthew G. Knepley 3826d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3828d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3829d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3830d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3831d49fcaecSMatthew G. Knepley } 3832d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3833d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3834d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 3835d49fcaecSMatthew G. Knepley ierr = DMSetCoordinateSection(dm, cSection);CHKERRQ(ierr); 3836d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3837d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3838d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3839d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3840d49fcaecSMatthew G. Knepley } 3841d49fcaecSMatthew G. Knepley 3842d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3843aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3844552f7358SJed Brown /*@ 3845aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3846552f7358SJed Brown 3847552f7358SJed Brown Not Collective 3848552f7358SJed Brown 3849aa50250dSMatthew G. Knepley Input Parameter: 3850552f7358SJed Brown . dm - The DMPlex object 3851552f7358SJed Brown 3852aa50250dSMatthew G. Knepley Output Parameter: 3853aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3854552f7358SJed Brown 3855552f7358SJed Brown Level: developer 3856552f7358SJed Brown 3857aa50250dSMatthew G. Knepley .keywords: mesh, points 3858aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3859aa50250dSMatthew G. Knepley @*/ 3860aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3861aa50250dSMatthew G. Knepley { 3862aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3863aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3864aa50250dSMatthew G. Knepley 3865aa50250dSMatthew G. Knepley PetscFunctionBegin; 3866aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3867aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 386863d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3869aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3870aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3871aa50250dSMatthew G. Knepley } 3872aa50250dSMatthew G. Knepley 3873aa50250dSMatthew G. Knepley #undef __FUNCT__ 3874aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3875aa50250dSMatthew G. Knepley /*@ 3876aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3877aa50250dSMatthew G. Knepley 3878aa50250dSMatthew G. Knepley Not Collective 3879aa50250dSMatthew G. Knepley 3880aa50250dSMatthew G. Knepley Input Parameter: 3881aa50250dSMatthew G. Knepley . dm - The DMPlex object 3882aa50250dSMatthew G. Knepley 3883aa50250dSMatthew G. Knepley Output Parameter: 3884aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3885aa50250dSMatthew G. Knepley 3886aa50250dSMatthew G. Knepley Level: developer 3887552f7358SJed Brown 3888552f7358SJed Brown .keywords: mesh, points 3889aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3890552f7358SJed Brown @*/ 3891552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3892552f7358SJed Brown { 3893aa50250dSMatthew G. Knepley DMLabel label; 3894aa50250dSMatthew G. Knepley PetscInt d = 0; 3895552f7358SJed Brown PetscErrorCode ierr; 3896552f7358SJed Brown 3897552f7358SJed Brown PetscFunctionBegin; 3898552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3899552f7358SJed Brown PetscValidPointer(depth, 2); 3900aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3901aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3902552f7358SJed Brown *depth = d-1; 3903552f7358SJed Brown PetscFunctionReturn(0); 3904552f7358SJed Brown } 3905552f7358SJed Brown 3906552f7358SJed Brown #undef __FUNCT__ 3907552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3908552f7358SJed Brown /*@ 3909552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3910552f7358SJed Brown 3911552f7358SJed Brown Not Collective 3912552f7358SJed Brown 3913552f7358SJed Brown Input Parameters: 3914552f7358SJed Brown + dm - The DMPlex object 3915552f7358SJed Brown - stratumValue - The requested depth 3916552f7358SJed Brown 3917552f7358SJed Brown Output Parameters: 3918552f7358SJed Brown + start - The first point at this depth 3919552f7358SJed Brown - end - One beyond the last point at this depth 3920552f7358SJed Brown 3921552f7358SJed Brown Level: developer 3922552f7358SJed Brown 3923552f7358SJed Brown .keywords: mesh, points 3924552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3925552f7358SJed Brown @*/ 39260adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39270adebc6cSBarry Smith { 3928aa50250dSMatthew G. Knepley DMLabel label; 392963d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3930552f7358SJed Brown PetscErrorCode ierr; 3931552f7358SJed Brown 3932552f7358SJed Brown PetscFunctionBegin; 3933552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 393463d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 393563d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3936552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39370d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 393863d1a920SMatthew G. Knepley if (stratumValue < 0) { 393963d1a920SMatthew G. Knepley if (start) *start = pStart; 394063d1a920SMatthew G. Knepley if (end) *end = pEnd; 394163d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3942552f7358SJed Brown } 3943aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 394463d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 394563d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3946552f7358SJed Brown PetscFunctionReturn(0); 3947552f7358SJed Brown } 3948552f7358SJed Brown 3949552f7358SJed Brown #undef __FUNCT__ 3950552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3951552f7358SJed Brown /*@ 3952552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3953552f7358SJed Brown 3954552f7358SJed Brown Not Collective 3955552f7358SJed Brown 3956552f7358SJed Brown Input Parameters: 3957552f7358SJed Brown + dm - The DMPlex object 3958552f7358SJed Brown - stratumValue - The requested height 3959552f7358SJed Brown 3960552f7358SJed Brown Output Parameters: 3961552f7358SJed Brown + start - The first point at this height 3962552f7358SJed Brown - end - One beyond the last point at this height 3963552f7358SJed Brown 3964552f7358SJed Brown Level: developer 3965552f7358SJed Brown 3966552f7358SJed Brown .keywords: mesh, points 3967552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3968552f7358SJed Brown @*/ 39690adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39700adebc6cSBarry Smith { 3971aa50250dSMatthew G. Knepley DMLabel label; 397263d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 3973552f7358SJed Brown PetscErrorCode ierr; 3974552f7358SJed Brown 3975552f7358SJed Brown PetscFunctionBegin; 3976552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 397763d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 397863d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3979552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39800d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 398163d1a920SMatthew G. Knepley if (stratumValue < 0) { 398263d1a920SMatthew G. Knepley if (start) *start = pStart; 398363d1a920SMatthew G. Knepley if (end) *end = pEnd; 398463d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3985552f7358SJed Brown } 3986aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3987aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 398863d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 398963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3990552f7358SJed Brown PetscFunctionReturn(0); 3991552f7358SJed Brown } 3992552f7358SJed Brown 3993552f7358SJed Brown #undef __FUNCT__ 3994552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 3995552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 3996a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 3997a6dfd86eSKarl Rupp { 3998552f7358SJed Brown PetscInt *numDofTot; 3999916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4000916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4001552f7358SJed Brown PetscErrorCode ierr; 4002552f7358SJed Brown 4003552f7358SJed Brown PetscFunctionBegin; 4004785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4005552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4006552f7358SJed Brown numDofTot[d] = 0; 40070d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4008552f7358SJed Brown } 400982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4010552f7358SJed Brown if (numFields > 0) { 4011552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4012552f7358SJed Brown if (numComp) { 4013552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4014552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4015552f7358SJed Brown } 4016552f7358SJed Brown } 4017552f7358SJed Brown } 4018552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4019552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4020916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4021916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4022916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4023916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4024552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4025552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4026552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4027552f7358SJed Brown } 4028552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4029552f7358SJed Brown } 4030552f7358SJed Brown } 4031552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4032552f7358SJed Brown PetscFunctionReturn(0); 4033552f7358SJed Brown } 4034552f7358SJed Brown 4035552f7358SJed Brown #undef __FUNCT__ 4036552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4037552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4038552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4039552f7358SJed Brown */ 4040a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4041a6dfd86eSKarl Rupp { 4042552f7358SJed Brown PetscInt numFields; 4043552f7358SJed Brown PetscInt bc; 4044552f7358SJed Brown PetscErrorCode ierr; 4045552f7358SJed Brown 4046552f7358SJed Brown PetscFunctionBegin; 4047552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4048552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4049552f7358SJed Brown PetscInt field = 0; 4050552f7358SJed Brown const PetscInt *idx; 4051552f7358SJed Brown PetscInt n, i; 4052552f7358SJed Brown 40530d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4054552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4055552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4056552f7358SJed Brown for (i = 0; i < n; ++i) { 4057552f7358SJed Brown const PetscInt p = idx[i]; 4058552f7358SJed Brown PetscInt numConst = constDof; 4059552f7358SJed Brown 4060552f7358SJed Brown /* Constrain every dof on the point */ 4061552f7358SJed Brown if (numConst < 0) { 4062552f7358SJed Brown if (numFields) { 4063552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4064552f7358SJed Brown } else { 4065552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4066552f7358SJed Brown } 4067552f7358SJed Brown } 4068552f7358SJed Brown if (numFields) { 4069552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4070552f7358SJed Brown } 4071552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4072552f7358SJed Brown } 4073552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4074552f7358SJed Brown } 4075552f7358SJed Brown PetscFunctionReturn(0); 4076552f7358SJed Brown } 4077552f7358SJed Brown 4078552f7358SJed Brown #undef __FUNCT__ 4079552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4080552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 40810adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 40820adebc6cSBarry Smith { 4083552f7358SJed Brown PetscInt *maxConstraints; 4084552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4085552f7358SJed Brown PetscErrorCode ierr; 4086552f7358SJed Brown 4087552f7358SJed Brown PetscFunctionBegin; 4088552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4089552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4090785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 40910d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4092552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4093552f7358SJed Brown PetscInt cdof; 4094552f7358SJed Brown 4095552f7358SJed Brown if (numFields) { 4096552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4097552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4098552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4099552f7358SJed Brown } 4100552f7358SJed Brown } else { 4101552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4102552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4103552f7358SJed Brown } 4104552f7358SJed Brown } 4105552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4106552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4107552f7358SJed Brown } 4108552f7358SJed Brown if (maxConstraints[numFields]) { 4109552f7358SJed Brown PetscInt *indices; 4110552f7358SJed Brown 4111785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4112552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4113552f7358SJed Brown PetscInt cdof, d; 4114552f7358SJed Brown 4115552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4116552f7358SJed Brown if (cdof) { 4117552f7358SJed 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]); 4118552f7358SJed Brown if (numFields) { 4119552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4120552f7358SJed Brown 4121552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4122552f7358SJed Brown PetscInt cfdof, fdof; 4123552f7358SJed Brown 4124552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4125552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4126552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41270d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4128552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41290d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4130552f7358SJed Brown numConst += cfdof; 4131552f7358SJed Brown foff += fdof; 4132552f7358SJed Brown } 4133552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4134552f7358SJed Brown } else { 41350d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4136552f7358SJed Brown } 4137552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4138552f7358SJed Brown } 4139552f7358SJed Brown } 4140552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4141552f7358SJed Brown } 4142552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4143552f7358SJed Brown PetscFunctionReturn(0); 4144552f7358SJed Brown } 4145552f7358SJed Brown 4146552f7358SJed Brown #undef __FUNCT__ 4147552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4148552f7358SJed Brown /* Set the constrained field indices on each point */ 41490adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 41500adebc6cSBarry Smith { 4151552f7358SJed Brown const PetscInt *points, *indices; 4152552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4153552f7358SJed Brown PetscErrorCode ierr; 4154552f7358SJed Brown 4155552f7358SJed Brown PetscFunctionBegin; 4156552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4157552f7358SJed 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); 4158552f7358SJed Brown 4159552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4160552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4161552f7358SJed Brown if (!constraintIndices) { 4162552f7358SJed Brown PetscInt *idx, i; 4163552f7358SJed Brown 4164552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4165785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 41660d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4167552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4168552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4169552f7358SJed Brown } 4170552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4171552f7358SJed Brown } else { 4172552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4173552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4174552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4175552f7358SJed Brown PetscInt fcdof; 4176552f7358SJed Brown 4177552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 417882f516ccSBarry 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); 4179552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4180552f7358SJed Brown } 4181552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4182552f7358SJed Brown } 4183552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4184552f7358SJed Brown PetscFunctionReturn(0); 4185552f7358SJed Brown } 4186552f7358SJed Brown 4187552f7358SJed Brown #undef __FUNCT__ 4188552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4189552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41900adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 41910adebc6cSBarry Smith { 4192552f7358SJed Brown PetscInt *indices; 4193552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4194552f7358SJed Brown PetscErrorCode ierr; 4195552f7358SJed Brown 4196552f7358SJed Brown PetscFunctionBegin; 4197552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4198785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4199552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 420082f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4201552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4202552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4203552f7358SJed Brown PetscInt cdof, d; 4204552f7358SJed Brown 4205552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4206552f7358SJed Brown if (cdof) { 4207552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4208552f7358SJed Brown 4209552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4210552f7358SJed Brown const PetscInt *fcind; 4211552f7358SJed Brown PetscInt fdof, fcdof; 4212552f7358SJed Brown 4213552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4214552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4215552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4216552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42170d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4218552f7358SJed Brown foff += fdof; 4219552f7358SJed Brown numConst += fcdof; 4220552f7358SJed Brown } 422182f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4222552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4223552f7358SJed Brown } 4224552f7358SJed Brown } 4225552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4226552f7358SJed Brown PetscFunctionReturn(0); 4227552f7358SJed Brown } 4228552f7358SJed Brown 4229552f7358SJed Brown #undef __FUNCT__ 4230552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4231552f7358SJed Brown /*@C 4232552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4233552f7358SJed Brown 4234552f7358SJed Brown Not Collective 4235552f7358SJed Brown 4236552f7358SJed Brown Input Parameters: 4237552f7358SJed Brown + dm - The DMPlex object 4238552f7358SJed Brown . dim - The spatial dimension of the problem 4239552f7358SJed Brown . numFields - The number of fields in the problem 4240552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4241552f7358SJed 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 4242552f7358SJed Brown . numBC - The number of boundary conditions 4243552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4244f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4245f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4246552f7358SJed Brown 4247552f7358SJed Brown Output Parameter: 4248552f7358SJed Brown . section - The PetscSection object 4249552f7358SJed Brown 4250552f7358SJed 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 4251f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4252f8f126e8SMatthew G. Knepley 4253f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4254552f7358SJed Brown 4255552f7358SJed Brown Level: developer 4256552f7358SJed Brown 42573813dfbdSMatthew G Knepley Fortran Notes: 42583813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 42593813dfbdSMatthew G Knepley 4260552f7358SJed Brown .keywords: mesh, elements 4261f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4262552f7358SJed Brown @*/ 4263f8f126e8SMatthew 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) 4264a6dfd86eSKarl Rupp { 4265552f7358SJed Brown PetscErrorCode ierr; 4266552f7358SJed Brown 4267552f7358SJed Brown PetscFunctionBegin; 4268552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4269552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4270f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4271552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4272552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4273ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4274552f7358SJed Brown PetscFunctionReturn(0); 4275552f7358SJed Brown } 4276552f7358SJed Brown 4277552f7358SJed Brown #undef __FUNCT__ 4278552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 42790adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 42800adebc6cSBarry Smith { 4281552f7358SJed Brown PetscSection section; 4282552f7358SJed Brown PetscErrorCode ierr; 4283552f7358SJed Brown 4284552f7358SJed Brown PetscFunctionBegin; 428538221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 428682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4287552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 42881d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4289552f7358SJed Brown PetscFunctionReturn(0); 4290552f7358SJed Brown } 4291552f7358SJed Brown 4292552f7358SJed Brown #undef __FUNCT__ 4293552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 42940adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 42950adebc6cSBarry Smith { 4296552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4297552f7358SJed Brown 4298552f7358SJed Brown PetscFunctionBegin; 4299552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4300552f7358SJed Brown if (section) *section = mesh->coneSection; 4301552f7358SJed Brown PetscFunctionReturn(0); 4302552f7358SJed Brown } 4303552f7358SJed Brown 4304552f7358SJed Brown #undef __FUNCT__ 43058cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43068cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43078cb4d582SMatthew G. Knepley { 43088cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43098cb4d582SMatthew G. Knepley 43108cb4d582SMatthew G. Knepley PetscFunctionBegin; 43118cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43128cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43138cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43148cb4d582SMatthew G. Knepley } 43158cb4d582SMatthew G. Knepley 43168cb4d582SMatthew G. Knepley #undef __FUNCT__ 4317552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4318a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4319a6dfd86eSKarl Rupp { 4320552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4321552f7358SJed Brown 4322552f7358SJed Brown PetscFunctionBegin; 4323552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4324552f7358SJed Brown if (cones) *cones = mesh->cones; 4325552f7358SJed Brown PetscFunctionReturn(0); 4326552f7358SJed Brown } 4327552f7358SJed Brown 4328552f7358SJed Brown #undef __FUNCT__ 4329552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4330a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4331a6dfd86eSKarl Rupp { 4332552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4333552f7358SJed Brown 4334552f7358SJed Brown PetscFunctionBegin; 4335552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4336552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4337552f7358SJed Brown PetscFunctionReturn(0); 4338552f7358SJed Brown } 4339552f7358SJed Brown 4340552f7358SJed Brown /******************************** FEM Support **********************************/ 4341552f7358SJed Brown 4342552f7358SJed Brown #undef __FUNCT__ 43431a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 43441a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4345a6dfd86eSKarl Rupp { 4346552f7358SJed Brown PetscScalar *array, *vArray; 4347d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 43481a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4349552f7358SJed Brown PetscErrorCode ierr; 4350552f7358SJed Brown 43511b406b76SMatthew G. Knepley PetscFunctionBeginHot; 43522a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 43535a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 43545a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 43555a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 43563f7cbbe7SMatthew G. Knepley if (!values || !*values) { 43579df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43589df71ca4SMatthew G. Knepley PetscInt dof; 4359d9917b9dSMatthew G. Knepley 43609df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43619df71ca4SMatthew G. Knepley size += dof; 43629df71ca4SMatthew G. Knepley } 43639df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43649df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43652a3aaacfSMatthew G. Knepley PetscInt dof; 43665a1bb5cfSMatthew G. Knepley 43675a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 43682a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 43695a1bb5cfSMatthew G. Knepley size += dof; 43705a1bb5cfSMatthew G. Knepley } 43713f7cbbe7SMatthew G. Knepley if (!values) { 43723f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 43733f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 43743f7cbbe7SMatthew G. Knepley } 43755a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4376982e9ed1SMatthew G. Knepley } else { 4377982e9ed1SMatthew G. Knepley array = *values; 4378982e9ed1SMatthew G. Knepley } 43799df71ca4SMatthew G. Knepley size = 0; 43805a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 43819df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 43829df71ca4SMatthew G. Knepley PetscInt dof, off, d; 43839df71ca4SMatthew G. Knepley PetscScalar *varr; 4384d9917b9dSMatthew G. Knepley 43859df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43869df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 43879df71ca4SMatthew G. Knepley varr = &vArray[off]; 43881a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 43891a271a75SMatthew G. Knepley array[offset] = varr[d]; 43909df71ca4SMatthew G. Knepley } 43919df71ca4SMatthew G. Knepley size += dof; 43929df71ca4SMatthew G. Knepley } 43939df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 43949df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 43959df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 43965a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 43975a1bb5cfSMatthew G. Knepley PetscScalar *varr; 43985a1bb5cfSMatthew G. Knepley 439952ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44005a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44015a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44025a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44035a1bb5cfSMatthew G. Knepley if (o >= 0) { 44041a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44051a271a75SMatthew G. Knepley array[offset] = varr[d]; 44065a1bb5cfSMatthew G. Knepley } 44075a1bb5cfSMatthew G. Knepley } else { 44081a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44091a271a75SMatthew G. Knepley array[offset] = varr[d]; 44105a1bb5cfSMatthew G. Knepley } 44115a1bb5cfSMatthew G. Knepley } 44129df71ca4SMatthew G. Knepley size += dof; 44135a1bb5cfSMatthew G. Knepley } 44145a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44159df71ca4SMatthew G. Knepley if (!*values) { 44165a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44175a1bb5cfSMatthew G. Knepley *values = array; 44189df71ca4SMatthew G. Knepley } else { 44199df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44208c312ff3SMatthew G. Knepley *csize = size; 44219df71ca4SMatthew G. Knepley } 44225a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44235a1bb5cfSMatthew G. Knepley } 4424d9917b9dSMatthew G. Knepley 4425d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44261a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44271a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44281a271a75SMatthew G. Knepley { 44291a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44301a271a75SMatthew G. Knepley PetscErrorCode ierr; 44311a271a75SMatthew G. Knepley 44321a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4433fe02ba77SJed Brown *size = 0; 44341a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44351a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44361a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44371a271a75SMatthew G. Knepley PetscInt dof, off, d; 44381a271a75SMatthew G. Knepley const PetscScalar *varr; 44391a271a75SMatthew G. Knepley 44401a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44411a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44421a271a75SMatthew G. Knepley varr = &vArray[off]; 44431a271a75SMatthew G. Knepley if (o >= 0) { 44441a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 44451a271a75SMatthew G. Knepley } else { 44461a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 44471a271a75SMatthew G. Knepley } 44481a271a75SMatthew G. Knepley } 44491a271a75SMatthew G. Knepley *size = offset; 44501a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44511a271a75SMatthew G. Knepley } 44521a271a75SMatthew G. Knepley 44531a271a75SMatthew G. Knepley #undef __FUNCT__ 44541a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 44551a271a75SMatthew 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[]) 44561a271a75SMatthew G. Knepley { 44571a271a75SMatthew G. Knepley PetscInt offset = 0, f; 44581a271a75SMatthew G. Knepley PetscErrorCode ierr; 44591a271a75SMatthew G. Knepley 44601a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4461fe02ba77SJed Brown *size = 0; 44621a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 44631a271a75SMatthew G. Knepley PetscInt fcomp, p; 44641a271a75SMatthew G. Knepley 44651a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 44661a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44671a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44681a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44691a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 44701a271a75SMatthew G. Knepley const PetscScalar *varr; 44711a271a75SMatthew G. Knepley 44721a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 44731a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 44741a271a75SMatthew G. Knepley varr = &vArray[foff]; 44751a271a75SMatthew G. Knepley if (o >= 0) { 44761a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 44771a271a75SMatthew G. Knepley } else { 44781a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 44791a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 44801a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 44811a271a75SMatthew G. Knepley } 44821a271a75SMatthew G. Knepley } 44831a271a75SMatthew G. Knepley } 44841a271a75SMatthew G. Knepley } 44851a271a75SMatthew G. Knepley } 44861a271a75SMatthew G. Knepley *size = offset; 44871a271a75SMatthew G. Knepley PetscFunctionReturn(0); 44881a271a75SMatthew G. Knepley } 44891a271a75SMatthew G. Knepley 44901a271a75SMatthew G. Knepley #undef __FUNCT__ 4491552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4492552f7358SJed Brown /*@C 4493552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4494552f7358SJed Brown 4495552f7358SJed Brown Not collective 4496552f7358SJed Brown 4497552f7358SJed Brown Input Parameters: 4498552f7358SJed Brown + dm - The DM 4499552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4500552f7358SJed Brown . v - The local vector 4501552f7358SJed Brown - point - The sieve point in the DM 4502552f7358SJed Brown 4503552f7358SJed Brown Output Parameters: 4504552f7358SJed Brown + csize - The number of values in the closure, or NULL 4505552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4506552f7358SJed Brown 4507552f7358SJed Brown Fortran Notes: 4508552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4509552f7358SJed Brown include petsc.h90 in your code. 4510552f7358SJed Brown 4511552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4512552f7358SJed Brown 4513552f7358SJed Brown Level: intermediate 4514552f7358SJed Brown 4515552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4516552f7358SJed Brown @*/ 4517552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4518552f7358SJed Brown { 4519552f7358SJed Brown PetscSection clSection; 4520d9917b9dSMatthew G. Knepley IS clPoints; 4521552f7358SJed Brown PetscScalar *array, *vArray; 4522552f7358SJed Brown PetscInt *points = NULL; 4523d9917b9dSMatthew G. Knepley const PetscInt *clp; 45241a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4525552f7358SJed Brown PetscErrorCode ierr; 4526552f7358SJed Brown 4527d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4528552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4529552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45301a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45311a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4532552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4533552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4534552f7358SJed Brown if (depth == 1 && numFields < 2) { 45351a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4536552f7358SJed Brown PetscFunctionReturn(0); 4537552f7358SJed Brown } 45381a271a75SMatthew G. Knepley /* Get points */ 4539d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4540d9917b9dSMatthew G. Knepley if (!clPoints) { 45411a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4542552f7358SJed Brown 45431a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4544552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4545552f7358SJed Brown /* Compress out points not in the section */ 4546552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4547552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4548552f7358SJed Brown points[q*2] = points[p]; 4549552f7358SJed Brown points[q*2+1] = points[p+1]; 4550552f7358SJed Brown ++q; 4551552f7358SJed Brown } 4552552f7358SJed Brown } 4553552f7358SJed Brown numPoints = q; 4554d9917b9dSMatthew G. Knepley } else { 4555d9917b9dSMatthew G. Knepley PetscInt dof, off; 4556552f7358SJed Brown 4557d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4558d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4559d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 45601a271a75SMatthew G. Knepley numPoints = dof/2; 4561d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4562552f7358SJed Brown } 45631a271a75SMatthew G. Knepley /* Get array */ 4564552f7358SJed Brown if (!values || !*values) { 45651a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4566552f7358SJed Brown 45671a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4568552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 45691a271a75SMatthew G. Knepley asize += dof; 4570552f7358SJed Brown } 4571bd6c0d32SMatthew G. Knepley if (!values) { 4572d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45731a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45741a271a75SMatthew G. Knepley if (csize) *csize = asize; 4575bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4576bd6c0d32SMatthew G. Knepley } 45771a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4578d0f6b257SMatthew G. Knepley } else { 4579d0f6b257SMatthew G. Knepley array = *values; 4580d0f6b257SMatthew G. Knepley } 4581552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 45821a271a75SMatthew G. Knepley /* Get values */ 4583ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 45841a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 45851a271a75SMatthew G. Knepley /* Cleanup points */ 45861a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 45871a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 45881a271a75SMatthew G. Knepley /* Cleanup array */ 4589552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4590d0f6b257SMatthew G. Knepley if (!*values) { 4591552f7358SJed Brown if (csize) *csize = size; 4592552f7358SJed Brown *values = array; 4593d0f6b257SMatthew G. Knepley } else { 4594d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4595d0f6b257SMatthew G. Knepley *csize = size; 4596d0f6b257SMatthew G. Knepley } 4597552f7358SJed Brown PetscFunctionReturn(0); 4598552f7358SJed Brown } 4599552f7358SJed Brown 4600552f7358SJed Brown #undef __FUNCT__ 4601552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4602552f7358SJed Brown /*@C 4603552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4604552f7358SJed Brown 4605552f7358SJed Brown Not collective 4606552f7358SJed Brown 4607552f7358SJed Brown Input Parameters: 4608552f7358SJed Brown + dm - The DM 46090298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4610552f7358SJed Brown . v - The local vector 4611552f7358SJed Brown . point - The sieve point in the DM 46120298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4613552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4614552f7358SJed Brown 46153813dfbdSMatthew G Knepley Fortran Notes: 46163813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46173813dfbdSMatthew G Knepley include petsc.h90 in your code. 46183813dfbdSMatthew G Knepley 46193813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46203813dfbdSMatthew G Knepley 4621552f7358SJed Brown Level: intermediate 4622552f7358SJed Brown 4623552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4624552f7358SJed Brown @*/ 46257c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4626a6dfd86eSKarl Rupp { 4627552f7358SJed Brown PetscInt size = 0; 4628552f7358SJed Brown PetscErrorCode ierr; 4629552f7358SJed Brown 4630552f7358SJed Brown PetscFunctionBegin; 4631552f7358SJed Brown /* Should work without recalculating size */ 4632552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4633552f7358SJed Brown PetscFunctionReturn(0); 4634552f7358SJed Brown } 4635552f7358SJed Brown 4636552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4637552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4638552f7358SJed Brown 4639552f7358SJed Brown #undef __FUNCT__ 4640552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46411a271a75SMatthew 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[]) 4642552f7358SJed Brown { 4643552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4644552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4645552f7358SJed Brown PetscScalar *a; 4646552f7358SJed Brown PetscInt off, cind = 0, k; 4647552f7358SJed Brown PetscErrorCode ierr; 4648552f7358SJed Brown 4649552f7358SJed Brown PetscFunctionBegin; 4650552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4651552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4652552f7358SJed Brown a = &array[off]; 4653552f7358SJed Brown if (!cdof || setBC) { 4654552f7358SJed Brown if (orientation >= 0) { 4655552f7358SJed Brown for (k = 0; k < dof; ++k) { 4656552f7358SJed Brown fuse(&a[k], values[k]); 4657552f7358SJed Brown } 4658552f7358SJed Brown } else { 4659552f7358SJed Brown for (k = 0; k < dof; ++k) { 4660552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4661552f7358SJed Brown } 4662552f7358SJed Brown } 4663552f7358SJed Brown } else { 4664552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4665552f7358SJed Brown if (orientation >= 0) { 4666552f7358SJed Brown for (k = 0; k < dof; ++k) { 4667552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4668552f7358SJed Brown fuse(&a[k], values[k]); 4669552f7358SJed Brown } 4670552f7358SJed Brown } else { 4671552f7358SJed Brown for (k = 0; k < dof; ++k) { 4672552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4673552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4674552f7358SJed Brown } 4675552f7358SJed Brown } 4676552f7358SJed Brown } 4677552f7358SJed Brown PetscFunctionReturn(0); 4678552f7358SJed Brown } 4679552f7358SJed Brown 4680552f7358SJed Brown #undef __FUNCT__ 4681a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 46821a271a75SMatthew 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[]) 4683a5e93ea8SMatthew G. Knepley { 4684a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4685a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4686a5e93ea8SMatthew G. Knepley PetscScalar *a; 4687a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4688a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4689a5e93ea8SMatthew G. Knepley 4690a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4691a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4692a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4693a5e93ea8SMatthew G. Knepley a = &array[off]; 4694a5e93ea8SMatthew G. Knepley if (cdof) { 4695a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4696a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4697a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4698a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4699a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4700a5e93ea8SMatthew G. Knepley ++cind; 4701a5e93ea8SMatthew G. Knepley } 4702a5e93ea8SMatthew G. Knepley } 4703a5e93ea8SMatthew G. Knepley } else { 4704a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4705a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4706a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4707a5e93ea8SMatthew G. Knepley ++cind; 4708a5e93ea8SMatthew G. Knepley } 4709a5e93ea8SMatthew G. Knepley } 4710a5e93ea8SMatthew G. Knepley } 4711a5e93ea8SMatthew G. Knepley } 4712a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4713a5e93ea8SMatthew G. Knepley } 4714a5e93ea8SMatthew G. Knepley 4715a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4716552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47171a271a75SMatthew 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[]) 4718a6dfd86eSKarl Rupp { 4719552f7358SJed Brown PetscScalar *a; 47201a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47211a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47221a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4723552f7358SJed Brown PetscErrorCode ierr; 4724552f7358SJed Brown 4725552f7358SJed Brown PetscFunctionBegin; 4726552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4727552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47281a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47291a271a75SMatthew G. Knepley a = &array[foff]; 4730552f7358SJed Brown if (!fcdof || setBC) { 47311a271a75SMatthew G. Knepley if (o >= 0) { 47321a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4733552f7358SJed Brown } else { 4734552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4735552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47361a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4737552f7358SJed Brown } 4738552f7358SJed Brown } 4739552f7358SJed Brown } 4740552f7358SJed Brown } else { 4741552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47421a271a75SMatthew G. Knepley if (o >= 0) { 4743552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4744552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 47451a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4746552f7358SJed Brown } 4747552f7358SJed Brown } else { 4748552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4749552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4750552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 47511a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4752552f7358SJed Brown } 4753552f7358SJed Brown } 4754552f7358SJed Brown } 4755552f7358SJed Brown } 47561a271a75SMatthew G. Knepley *offset += fdof; 4757552f7358SJed Brown PetscFunctionReturn(0); 4758552f7358SJed Brown } 4759552f7358SJed Brown 4760552f7358SJed Brown #undef __FUNCT__ 4761a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 47621a271a75SMatthew 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[]) 4763a5e93ea8SMatthew G. Knepley { 4764a5e93ea8SMatthew G. Knepley PetscScalar *a; 47651a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47661a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47671a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4768a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4769a5e93ea8SMatthew G. Knepley 4770a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4771a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4772a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47731a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47741a271a75SMatthew G. Knepley a = &array[foff]; 4775a5e93ea8SMatthew G. Knepley if (fcdof) { 4776a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47771a271a75SMatthew G. Knepley if (o >= 0) { 4778a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4779a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 47801a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4781a5e93ea8SMatthew G. Knepley ++cind; 4782a5e93ea8SMatthew G. Knepley } 4783a5e93ea8SMatthew G. Knepley } 4784a5e93ea8SMatthew G. Knepley } else { 4785a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4786a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4787a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 47881a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4789a5e93ea8SMatthew G. Knepley ++cind; 4790a5e93ea8SMatthew G. Knepley } 4791a5e93ea8SMatthew G. Knepley } 4792a5e93ea8SMatthew G. Knepley } 4793a5e93ea8SMatthew G. Knepley } 4794a5e93ea8SMatthew G. Knepley } 47951a271a75SMatthew G. Knepley *offset += fdof; 4796a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4797a5e93ea8SMatthew G. Knepley } 4798a5e93ea8SMatthew G. Knepley 4799a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48001b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48011a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4802a6dfd86eSKarl Rupp { 4803552f7358SJed Brown PetscScalar *array; 48041b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48051b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4806552f7358SJed Brown PetscErrorCode ierr; 4807552f7358SJed Brown 48081b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4809b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4810b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4811b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4812b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4813b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4814b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4815b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4816b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4817b6ebb6e6SMatthew G. Knepley 4818b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4819b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4820b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4821b6ebb6e6SMatthew G. Knepley { 4822b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4823b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4824b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4825b6ebb6e6SMatthew G. Knepley 4826b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4827b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4828b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4829b6ebb6e6SMatthew G. Knepley if (!cdof) { 4830b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4831b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4832b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4833b6ebb6e6SMatthew G. Knepley } 4834b6ebb6e6SMatthew G. Knepley } else { 4835b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4836b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4837b6ebb6e6SMatthew G. Knepley } 4838b6ebb6e6SMatthew G. Knepley } 4839b6ebb6e6SMatthew G. Knepley } else { 4840b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4841b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4842b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4843b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4844b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4845b6ebb6e6SMatthew G. Knepley } 4846b6ebb6e6SMatthew G. Knepley } else { 4847b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4848b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4849b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4850b6ebb6e6SMatthew G. Knepley } 4851b6ebb6e6SMatthew G. Knepley } 4852b6ebb6e6SMatthew G. Knepley } 4853b6ebb6e6SMatthew G. Knepley } 4854b6ebb6e6SMatthew G. Knepley } 4855b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4856b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4857b6ebb6e6SMatthew G. Knepley } 48581b406b76SMatthew G. Knepley 48591b406b76SMatthew G. Knepley #undef __FUNCT__ 48601b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 48611b406b76SMatthew G. Knepley /*@C 48621b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 48631b406b76SMatthew G. Knepley 48641b406b76SMatthew G. Knepley Not collective 48651b406b76SMatthew G. Knepley 48661b406b76SMatthew G. Knepley Input Parameters: 48671b406b76SMatthew G. Knepley + dm - The DM 48681b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 48691b406b76SMatthew G. Knepley . v - The local vector 48701b406b76SMatthew G. Knepley . point - The sieve point in the DM 48711b406b76SMatthew G. Knepley . values - The array of values 48721b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 48731b406b76SMatthew G. Knepley 48741b406b76SMatthew G. Knepley Fortran Notes: 48751b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 48761b406b76SMatthew G. Knepley 48771b406b76SMatthew G. Knepley Level: intermediate 48781b406b76SMatthew G. Knepley 48791b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 48801b406b76SMatthew G. Knepley @*/ 48811b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 48821b406b76SMatthew G. Knepley { 48831b406b76SMatthew G. Knepley PetscSection clSection; 48841b406b76SMatthew G. Knepley IS clPoints; 48851b406b76SMatthew G. Knepley PetscScalar *array; 48861b406b76SMatthew G. Knepley PetscInt *points = NULL; 48871b406b76SMatthew G. Knepley const PetscInt *clp; 48881a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 48891b406b76SMatthew G. Knepley PetscErrorCode ierr; 48901b406b76SMatthew G. Knepley 48911a271a75SMatthew G. Knepley PetscFunctionBeginHot; 48921b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 48931b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 48941a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 48951a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 48961b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 48971b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 48981b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 48991a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49001b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49011b406b76SMatthew G. Knepley } 49021a271a75SMatthew G. Knepley /* Get points */ 49031b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49041b406b76SMatthew G. Knepley if (!clPoints) { 49051a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49061a271a75SMatthew G. Knepley 49071a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4908552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4909552f7358SJed Brown /* Compress out points not in the section */ 4910552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4911552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4912552f7358SJed Brown points[q*2] = points[p]; 4913552f7358SJed Brown points[q*2+1] = points[p+1]; 4914552f7358SJed Brown ++q; 4915552f7358SJed Brown } 4916552f7358SJed Brown } 4917552f7358SJed Brown numPoints = q; 49181b406b76SMatthew G. Knepley } else { 49191b406b76SMatthew G. Knepley PetscInt dof, off; 4920552f7358SJed Brown 49211b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49221b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49231b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49241a271a75SMatthew G. Knepley numPoints = dof/2; 49251b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4926552f7358SJed Brown } 49271a271a75SMatthew G. Knepley /* Get array */ 4928552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49291a271a75SMatthew G. Knepley /* Get values */ 4930ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49311a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4932552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49331a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4934552f7358SJed Brown switch (mode) { 4935552f7358SJed Brown case INSERT_VALUES: 4936552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49371a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49381a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49391a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4940552f7358SJed Brown } break; 4941552f7358SJed Brown case INSERT_ALL_VALUES: 4942552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49431a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49441a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49451a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4946552f7358SJed Brown } break; 4947a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4948a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 49491a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49501a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49511a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4952a5e93ea8SMatthew G. Knepley } break; 4953552f7358SJed Brown case ADD_VALUES: 4954552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49551a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49561a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49571a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4958552f7358SJed Brown } break; 4959552f7358SJed Brown case ADD_ALL_VALUES: 4960552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49611a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49621a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49631a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 4964552f7358SJed Brown } break; 4965552f7358SJed Brown default: 496682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4967552f7358SJed Brown } 49681a271a75SMatthew G. Knepley } 4969552f7358SJed Brown } else { 49701a271a75SMatthew G. Knepley PetscInt dof, off; 49711a271a75SMatthew G. Knepley 4972552f7358SJed Brown switch (mode) { 4973552f7358SJed Brown case INSERT_VALUES: 4974552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4975552f7358SJed Brown PetscInt o = points[p+1]; 4976552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4977552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 4978552f7358SJed Brown } break; 4979552f7358SJed Brown case INSERT_ALL_VALUES: 4980552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4981552f7358SJed Brown PetscInt o = points[p+1]; 4982552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4983552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 4984552f7358SJed Brown } break; 4985a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4986a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4987a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 4988a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4989a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 4990a5e93ea8SMatthew G. Knepley } break; 4991552f7358SJed Brown case ADD_VALUES: 4992552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4993552f7358SJed Brown PetscInt o = points[p+1]; 4994552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4995552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 4996552f7358SJed Brown } break; 4997552f7358SJed Brown case ADD_ALL_VALUES: 4998552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4999552f7358SJed Brown PetscInt o = points[p+1]; 5000552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5001552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5002552f7358SJed Brown } break; 5003552f7358SJed Brown default: 500482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5005552f7358SJed Brown } 5006552f7358SJed Brown } 50071a271a75SMatthew G. Knepley /* Cleanup points */ 50081a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50091a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50101a271a75SMatthew G. Knepley /* Cleanup array */ 5011552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5012552f7358SJed Brown PetscFunctionReturn(0); 5013552f7358SJed Brown } 5014552f7358SJed Brown 5015552f7358SJed Brown #undef __FUNCT__ 5016e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5017e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5018e07394fbSMatthew G. Knepley { 5019e07394fbSMatthew G. Knepley PetscSection clSection; 5020e07394fbSMatthew G. Knepley IS clPoints; 5021e07394fbSMatthew G. Knepley PetscScalar *array; 5022e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5023e07394fbSMatthew G. Knepley const PetscInt *clp; 5024e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5025e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5026e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5027e07394fbSMatthew G. Knepley 5028e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5029e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5030e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5031e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5032e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5033e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5034e07394fbSMatthew G. Knepley /* Get points */ 5035e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5036e07394fbSMatthew G. Knepley if (!clPoints) { 5037e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5038e07394fbSMatthew G. Knepley 5039e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5040e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5041e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5042e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5043e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5044e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5045e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5046e07394fbSMatthew G. Knepley ++q; 5047e07394fbSMatthew G. Knepley } 5048e07394fbSMatthew G. Knepley } 5049e07394fbSMatthew G. Knepley numPoints = q; 5050e07394fbSMatthew G. Knepley } else { 5051e07394fbSMatthew G. Knepley PetscInt dof, off; 5052e07394fbSMatthew G. Knepley 5053e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5054e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5055e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5056e07394fbSMatthew G. Knepley numPoints = dof/2; 5057e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5058e07394fbSMatthew G. Knepley } 5059e07394fbSMatthew G. Knepley /* Get array */ 5060e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5061e07394fbSMatthew G. Knepley /* Get values */ 5062e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5063e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5064e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5065e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5066e07394fbSMatthew G. Knepley PetscInt fdof; 5067e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5068e07394fbSMatthew G. Knepley offset += fdof; 5069e07394fbSMatthew G. Knepley } 5070e07394fbSMatthew G. Knepley continue; 5071e07394fbSMatthew G. Knepley } 5072e07394fbSMatthew G. Knepley switch (mode) { 5073e07394fbSMatthew G. Knepley case INSERT_VALUES: 5074e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5075e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5076e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5077e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5078e07394fbSMatthew G. Knepley } break; 5079e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5080e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5081e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5082e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5083e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5084e07394fbSMatthew G. Knepley } break; 5085e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5086e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5087e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5088e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5089e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5090e07394fbSMatthew G. Knepley } break; 5091e07394fbSMatthew G. Knepley case ADD_VALUES: 5092e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5093e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5094e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5095e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5096e07394fbSMatthew G. Knepley } break; 5097e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5098e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5099e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5100e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5101e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5102e07394fbSMatthew G. Knepley } break; 5103e07394fbSMatthew G. Knepley default: 5104e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5105e07394fbSMatthew G. Knepley } 5106e07394fbSMatthew G. Knepley } 5107e07394fbSMatthew G. Knepley /* Cleanup points */ 5108e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5109e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5110e07394fbSMatthew G. Knepley /* Cleanup array */ 5111e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5112e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5113e07394fbSMatthew G. Knepley } 5114e07394fbSMatthew G. Knepley 5115e07394fbSMatthew G. Knepley #undef __FUNCT__ 5116552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5117b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5118552f7358SJed Brown { 5119552f7358SJed Brown PetscMPIInt rank; 5120552f7358SJed Brown PetscInt i, j; 5121552f7358SJed Brown PetscErrorCode ierr; 5122552f7358SJed Brown 5123552f7358SJed Brown PetscFunctionBegin; 512482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 512577a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5126b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5127b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5128b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5129b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 513077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5131b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5132519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51337eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5134552f7358SJed Brown #else 5135b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5136552f7358SJed Brown #endif 5137552f7358SJed Brown } 513877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5139552f7358SJed Brown } 5140552f7358SJed Brown PetscFunctionReturn(0); 5141552f7358SJed Brown } 5142552f7358SJed Brown 5143552f7358SJed Brown #undef __FUNCT__ 5144552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5145552f7358SJed Brown /* . off - The global offset of this point */ 5146e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5147a6dfd86eSKarl Rupp { 5148e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5149552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5150552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5151552f7358SJed Brown PetscInt cind = 0, k; 5152552f7358SJed Brown PetscErrorCode ierr; 5153552f7358SJed Brown 5154552f7358SJed Brown PetscFunctionBegin; 5155552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5156552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5157552f7358SJed Brown if (!cdof || setBC) { 5158552f7358SJed Brown if (orientation >= 0) { 5159e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5160552f7358SJed Brown } else { 5161e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5162552f7358SJed Brown } 5163552f7358SJed Brown } else { 5164552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5165552f7358SJed Brown if (orientation >= 0) { 5166552f7358SJed Brown for (k = 0; k < dof; ++k) { 5167552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5168552f7358SJed Brown /* Insert check for returning constrained indices */ 5169e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5170552f7358SJed Brown ++cind; 5171552f7358SJed Brown } else { 5172e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5173552f7358SJed Brown } 5174552f7358SJed Brown } 5175552f7358SJed Brown } else { 5176552f7358SJed Brown for (k = 0; k < dof; ++k) { 5177552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5178552f7358SJed Brown /* Insert check for returning constrained indices */ 5179e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5180552f7358SJed Brown ++cind; 5181552f7358SJed Brown } else { 5182e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5183552f7358SJed Brown } 5184552f7358SJed Brown } 5185552f7358SJed Brown } 5186552f7358SJed Brown } 5187e6ccafaeSMatthew G Knepley *loff += dof; 5188552f7358SJed Brown PetscFunctionReturn(0); 5189552f7358SJed Brown } 5190552f7358SJed Brown 5191552f7358SJed Brown #undef __FUNCT__ 5192552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5193552f7358SJed Brown /* . off - The global offset of this point */ 5194a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5195a6dfd86eSKarl Rupp { 5196552f7358SJed Brown PetscInt numFields, foff, f; 5197552f7358SJed Brown PetscErrorCode ierr; 5198552f7358SJed Brown 5199552f7358SJed Brown PetscFunctionBegin; 5200552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5201552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5202552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5203552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5204552f7358SJed Brown PetscInt cind = 0, k, c; 5205552f7358SJed Brown 5206552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5207552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5208552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5209552f7358SJed Brown if (!cfdof || setBC) { 5210552f7358SJed Brown if (orientation >= 0) { 52110d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5212552f7358SJed Brown } else { 5213552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5214552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5215552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5216552f7358SJed Brown } 5217552f7358SJed Brown } 5218552f7358SJed Brown } 5219552f7358SJed Brown } else { 5220552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5221552f7358SJed Brown if (orientation >= 0) { 5222552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5223552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5224552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5225552f7358SJed Brown ++cind; 5226552f7358SJed Brown } else { 5227552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5228552f7358SJed Brown } 5229552f7358SJed Brown } 5230552f7358SJed Brown } else { 5231552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5232552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5233552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5234552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5235552f7358SJed Brown ++cind; 5236552f7358SJed Brown } else { 5237552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5238552f7358SJed Brown } 5239552f7358SJed Brown } 5240552f7358SJed Brown } 5241552f7358SJed Brown } 5242552f7358SJed Brown } 5243552f7358SJed Brown foff += fdof - cfdof; 5244552f7358SJed Brown foffs[f] += fdof; 5245552f7358SJed Brown } 5246552f7358SJed Brown PetscFunctionReturn(0); 5247552f7358SJed Brown } 5248552f7358SJed Brown 5249552f7358SJed Brown #undef __FUNCT__ 5250552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 52517f5d1fdeSMatthew G. Knepley /*@C 52527f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 52537f5d1fdeSMatthew G. Knepley 52547f5d1fdeSMatthew G. Knepley Not collective 52557f5d1fdeSMatthew G. Knepley 52567f5d1fdeSMatthew G. Knepley Input Parameters: 52577f5d1fdeSMatthew G. Knepley + dm - The DM 5258ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5259ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 52607f5d1fdeSMatthew G. Knepley . A - The matrix 52617f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 52627f5d1fdeSMatthew G. Knepley . values - The array of values 52637f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 52647f5d1fdeSMatthew G. Knepley 52657f5d1fdeSMatthew G. Knepley Fortran Notes: 52667f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 52677f5d1fdeSMatthew G. Knepley 52687f5d1fdeSMatthew G. Knepley Level: intermediate 52697f5d1fdeSMatthew G. Knepley 52707f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 52717f5d1fdeSMatthew G. Knepley @*/ 52727c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5273552f7358SJed Brown { 5274552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 52751b406b76SMatthew G. Knepley PetscSection clSection; 52761b406b76SMatthew G. Knepley IS clPoints; 52770298fd71SBarry Smith PetscInt *points = NULL; 52781b406b76SMatthew G. Knepley const PetscInt *clp; 5279552f7358SJed Brown PetscInt *indices; 5280552f7358SJed Brown PetscInt offsets[32]; 5281552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5282552f7358SJed Brown PetscErrorCode ierr; 5283552f7358SJed Brown 5284552f7358SJed Brown PetscFunctionBegin; 5285552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5286ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 52873dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5288ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 52893dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 52903dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5291552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 529282f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5293552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 52941b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 52951b406b76SMatthew G. Knepley if (!clPoints) { 5296552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5297552f7358SJed Brown /* Compress out points not in the section */ 5298552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5299552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5300552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5301552f7358SJed Brown points[q*2] = points[p]; 5302552f7358SJed Brown points[q*2+1] = points[p+1]; 5303552f7358SJed Brown ++q; 5304552f7358SJed Brown } 5305552f7358SJed Brown } 5306552f7358SJed Brown numPoints = q; 53071b406b76SMatthew G. Knepley } else { 53081b406b76SMatthew G. Knepley PetscInt dof, off; 53091b406b76SMatthew G. Knepley 53101b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 53111b406b76SMatthew G. Knepley numPoints = dof/2; 53121b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 53131b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53141b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 53151b406b76SMatthew G. Knepley } 5316552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5317552f7358SJed Brown PetscInt fdof; 5318552f7358SJed Brown 5319552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5320552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5321552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5322552f7358SJed Brown offsets[f+1] += fdof; 5323552f7358SJed Brown } 5324552f7358SJed Brown numIndices += dof; 5325552f7358SJed Brown } 53260d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 53270d644c17SKarl Rupp 532882f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5329552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5330552f7358SJed Brown if (numFields) { 5331552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5332552f7358SJed Brown PetscInt o = points[p+1]; 5333552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5334552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5335552f7358SJed Brown } 5336552f7358SJed Brown } else { 5337e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5338552f7358SJed Brown PetscInt o = points[p+1]; 5339552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5340e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5341552f7358SJed Brown } 5342552f7358SJed Brown } 5343b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5344552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5345552f7358SJed Brown if (ierr) { 5346552f7358SJed Brown PetscMPIInt rank; 5347552f7358SJed Brown PetscErrorCode ierr2; 5348552f7358SJed Brown 534982f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 535077a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5351b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 53526a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5353552f7358SJed Brown CHKERRQ(ierr); 5354552f7358SJed Brown } 53551b406b76SMatthew G. Knepley if (!clPoints) { 5356552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 53571b406b76SMatthew G. Knepley } else { 53581b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 53591b406b76SMatthew G. Knepley } 5360552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5361552f7358SJed Brown PetscFunctionReturn(0); 5362552f7358SJed Brown } 5363552f7358SJed Brown 5364552f7358SJed Brown #undef __FUNCT__ 5365de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5366de41b84cSMatthew 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) 5367de41b84cSMatthew G. Knepley { 5368de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5369de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5370de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5371de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5372de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5373de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 53744ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5375de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5376de41b84cSMatthew G. Knepley 5377de41b84cSMatthew G. Knepley PetscFunctionBegin; 5378de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5379de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5380de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5381de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5382de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5383de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5384de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5385de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5386de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5387de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5388de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5389de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5390de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5391de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5392de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5393de41b84cSMatthew G. Knepley /* Column indices */ 5394de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 53954ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5396de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5397de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5398de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5399de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5400de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5401de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5402de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5403de41b84cSMatthew G. Knepley ++q; 5404de41b84cSMatthew G. Knepley } 5405de41b84cSMatthew G. Knepley } 5406de41b84cSMatthew G. Knepley numCPoints = q; 5407de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5408de41b84cSMatthew G. Knepley PetscInt fdof; 5409de41b84cSMatthew G. Knepley 5410de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 54114ca5e9f5SMatthew G. Knepley if (!dof) continue; 5412de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5413de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5414de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5415de41b84cSMatthew G. Knepley } 5416de41b84cSMatthew G. Knepley numCIndices += dof; 5417de41b84cSMatthew G. Knepley } 5418de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5419de41b84cSMatthew G. Knepley /* Row indices */ 5420de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5421de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 54221ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5423de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5424de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5425de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5426de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5427de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5428de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5429de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 54304ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 54314ca5e9f5SMatthew G. Knepley if (!dof) continue; 54324ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 54334ca5e9f5SMatthew G. Knepley if (s < q) continue; 5434de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5435de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5436de41b84cSMatthew G. Knepley ++q; 5437de41b84cSMatthew G. Knepley } 5438de41b84cSMatthew G. Knepley } 5439de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5440de41b84cSMatthew G. Knepley } 5441de41b84cSMatthew G. Knepley numFPoints = q; 5442de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5443de41b84cSMatthew G. Knepley PetscInt fdof; 5444de41b84cSMatthew G. Knepley 5445de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 54464ca5e9f5SMatthew G. Knepley if (!dof) continue; 5447de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5448de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5449de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5450de41b84cSMatthew G. Knepley } 5451de41b84cSMatthew G. Knepley numFIndices += dof; 5452de41b84cSMatthew G. Knepley } 5453de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5454de41b84cSMatthew G. Knepley 5455de41b84cSMatthew 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); 5456de41b84cSMatthew 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); 5457de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5458de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5459de41b84cSMatthew G. Knepley if (numFields) { 5460de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5461de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5462de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5463de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5464de41b84cSMatthew G. Knepley } 5465de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5466de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5467de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5468de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5469de41b84cSMatthew G. Knepley } 5470de41b84cSMatthew G. Knepley } else { 5471de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5472de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5473de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5474de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5475de41b84cSMatthew G. Knepley } 5476de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5477de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5478de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5479de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5480de41b84cSMatthew G. Knepley } 5481de41b84cSMatthew G. Knepley } 5482de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5483de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5484de41b84cSMatthew G. Knepley if (ierr) { 5485de41b84cSMatthew G. Knepley PetscMPIInt rank; 5486de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5487de41b84cSMatthew G. Knepley 5488de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5489de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5490de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5491de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5492de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5493de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5494de41b84cSMatthew G. Knepley } 5495549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5496de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5497de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5498de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5499de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5500de41b84cSMatthew G. Knepley } 5501de41b84cSMatthew G. Knepley 5502de41b84cSMatthew G. Knepley #undef __FUNCT__ 55037c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 55047c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 55057c927364SMatthew G. Knepley { 55067c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 55077c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 55087c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 55097c927364SMatthew G. Knepley CellRefiner cellRefiner; 55107c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 55117c927364SMatthew G. Knepley PetscErrorCode ierr; 55127c927364SMatthew G. Knepley 55137c927364SMatthew G. Knepley PetscFunctionBegin; 55147c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 55157c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 55167c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 55177c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 55187c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 55197c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 55207c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 55217c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 55227c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 55237c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 55247c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 55257c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 55267c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55277c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 55287c927364SMatthew G. Knepley /* Column indices */ 55297c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 55307c927364SMatthew G. Knepley maxFPoints = numCPoints; 55317c927364SMatthew G. Knepley /* Compress out points not in the section */ 55327c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 55337c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 55347c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 55357c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 55367c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 55377c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 55387c927364SMatthew G. Knepley ++q; 55397c927364SMatthew G. Knepley } 55407c927364SMatthew G. Knepley } 55417c927364SMatthew G. Knepley numCPoints = q; 55427c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 55437c927364SMatthew G. Knepley PetscInt fdof; 55447c927364SMatthew G. Knepley 55457c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 55467c927364SMatthew G. Knepley if (!dof) continue; 55477c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55487c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 55497c927364SMatthew G. Knepley coffsets[f+1] += fdof; 55507c927364SMatthew G. Knepley } 55517c927364SMatthew G. Knepley numCIndices += dof; 55527c927364SMatthew G. Knepley } 55537c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 55547c927364SMatthew G. Knepley /* Row indices */ 55557c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 55567c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 55577c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 55587c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 55597c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 55607c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55617c927364SMatthew G. Knepley /* Compress out points not in the section */ 55627c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 55637c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 55647c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 55657c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 55667c927364SMatthew G. Knepley if (!dof) continue; 55677c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 55687c927364SMatthew G. Knepley if (s < q) continue; 55697c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 55707c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 55717c927364SMatthew G. Knepley ++q; 55727c927364SMatthew G. Knepley } 55737c927364SMatthew G. Knepley } 55747c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 55757c927364SMatthew G. Knepley } 55767c927364SMatthew G. Knepley numFPoints = q; 55777c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 55787c927364SMatthew G. Knepley PetscInt fdof; 55797c927364SMatthew G. Knepley 55807c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 55817c927364SMatthew G. Knepley if (!dof) continue; 55827c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 55837c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 55847c927364SMatthew G. Knepley foffsets[f+1] += fdof; 55857c927364SMatthew G. Knepley } 55867c927364SMatthew G. Knepley numFIndices += dof; 55877c927364SMatthew G. Knepley } 55887c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 55897c927364SMatthew G. Knepley 55907c927364SMatthew 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); 55917c927364SMatthew 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); 55927c927364SMatthew G. Knepley if (numFields) { 55937c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 55947c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 55957c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 55967c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 55977c927364SMatthew G. Knepley } 55987c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 55997c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56007c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56017c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 56027c927364SMatthew G. Knepley } 56037c927364SMatthew G. Knepley } else { 56047c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 56057c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 56067c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 56077c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 56087c927364SMatthew G. Knepley } 56097c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 56107c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 56117c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 56127c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 56137c927364SMatthew G. Knepley } 56147c927364SMatthew G. Knepley } 56157c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 56167c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 56177c927364SMatthew G. Knepley PetscFunctionReturn(0); 56187c927364SMatthew G. Knepley } 56197c927364SMatthew G. Knepley 56207c927364SMatthew G. Knepley #undef __FUNCT__ 5621770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5622f96281f8SMatthew G. Knepley /*@ 5623f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5624f96281f8SMatthew G. Knepley 5625f96281f8SMatthew G. Knepley Input Parameter: 5626f96281f8SMatthew G. Knepley . dm - The DMPlex object 5627f96281f8SMatthew G. Knepley 5628f96281f8SMatthew G. Knepley Output Parameters: 5629f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5630dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5631dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5632dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5633f96281f8SMatthew G. Knepley 5634f96281f8SMatthew G. Knepley Level: developer 5635f96281f8SMatthew G. Knepley 5636dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 5637f96281f8SMatthew G. Knepley @*/ 5638770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5639552f7358SJed Brown { 5640552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5641770b213bSMatthew G Knepley PetscInt dim; 5642770b213bSMatthew G Knepley PetscErrorCode ierr; 5643552f7358SJed Brown 5644552f7358SJed Brown PetscFunctionBegin; 5645552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5646*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5647770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5648770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5649770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5650770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5651552f7358SJed Brown PetscFunctionReturn(0); 5652552f7358SJed Brown } 5653552f7358SJed Brown 5654552f7358SJed Brown #undef __FUNCT__ 5655770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5656dc5a3409SMatthew G. Knepley /*@ 5657dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5658dc5a3409SMatthew G. Knepley 5659dc5a3409SMatthew G. Knepley Input Parameters: 5660dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5661dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5662dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5663dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5664dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5665dc5a3409SMatthew G. Knepley 5666dc5a3409SMatthew G. Knepley Level: developer 5667dc5a3409SMatthew G. Knepley 5668dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5669dc5a3409SMatthew G. Knepley @*/ 5670770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5671552f7358SJed Brown { 5672552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5673770b213bSMatthew G Knepley PetscInt dim; 5674770b213bSMatthew G Knepley PetscErrorCode ierr; 5675552f7358SJed Brown 5676552f7358SJed Brown PetscFunctionBegin; 5677552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5678*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5679770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5680770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5681770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5682770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5683552f7358SJed Brown PetscFunctionReturn(0); 5684552f7358SJed Brown } 5685552f7358SJed Brown 5686552f7358SJed Brown #undef __FUNCT__ 5687552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5688552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5689552f7358SJed Brown { 5690552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5691552f7358SJed Brown 5692552f7358SJed Brown PetscFunctionBegin; 5693552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5694552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5695552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5696552f7358SJed Brown PetscFunctionReturn(0); 5697552f7358SJed Brown } 5698552f7358SJed Brown 5699552f7358SJed Brown #undef __FUNCT__ 5700552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5701552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5702552f7358SJed Brown { 5703552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5704552f7358SJed Brown 5705552f7358SJed Brown PetscFunctionBegin; 5706552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5707552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5708552f7358SJed Brown PetscFunctionReturn(0); 5709552f7358SJed Brown } 5710552f7358SJed Brown 5711552f7358SJed Brown #undef __FUNCT__ 5712552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5713552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5714ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5715552f7358SJed Brown { 5716552f7358SJed Brown PetscSection section, globalSection; 5717552f7358SJed Brown PetscInt *numbers, p; 5718552f7358SJed Brown PetscErrorCode ierr; 5719552f7358SJed Brown 5720552f7358SJed Brown PetscFunctionBegin; 572182f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5722552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5723552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5724552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5725552f7358SJed Brown } 5726552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5727552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5728785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5729552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5730552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5731ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5732ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5733552f7358SJed Brown } 573482f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5735ef48cebcSMatthew G. Knepley if (globalSize) { 5736ef48cebcSMatthew G. Knepley PetscLayout layout; 5737ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5738ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5739ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5740ef48cebcSMatthew G. Knepley } 5741552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5742552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5743552f7358SJed Brown PetscFunctionReturn(0); 5744552f7358SJed Brown } 5745552f7358SJed Brown 5746552f7358SJed Brown #undef __FUNCT__ 5747552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5748552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5749552f7358SJed Brown { 5750552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5751552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5752552f7358SJed Brown PetscErrorCode ierr; 5753552f7358SJed Brown 5754552f7358SJed Brown PetscFunctionBegin; 5755552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5756552f7358SJed Brown if (!mesh->globalCellNumbers) { 5757552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5758552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 57590298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 57600d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5761ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5762552f7358SJed Brown } 5763552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5764552f7358SJed Brown PetscFunctionReturn(0); 5765552f7358SJed Brown } 5766552f7358SJed Brown 5767552f7358SJed Brown #undef __FUNCT__ 5768552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5769552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5770552f7358SJed Brown { 5771552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5772552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5773552f7358SJed Brown PetscErrorCode ierr; 5774552f7358SJed Brown 5775552f7358SJed Brown PetscFunctionBegin; 5776552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5777552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5778552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 57790298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 57800d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5781ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5782552f7358SJed Brown } 5783552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5784552f7358SJed Brown PetscFunctionReturn(0); 5785552f7358SJed Brown } 5786552f7358SJed Brown 5787ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5788ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5789ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5790ef48cebcSMatthew G. Knepley { 5791ef48cebcSMatthew G. Knepley IS nums[4]; 5792ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5793ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5794ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5795ef48cebcSMatthew G. Knepley 5796ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5797ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5798ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5799ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5800ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5801ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5802ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5803ef48cebcSMatthew G. Knepley 5804ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5805ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5806ef48cebcSMatthew G. Knepley shift += gsize; 5807ef48cebcSMatthew G. Knepley } 5808ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5809ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5810ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5811ef48cebcSMatthew G. Knepley } 5812ef48cebcSMatthew G. Knepley 5813552f7358SJed Brown 5814552f7358SJed Brown #undef __FUNCT__ 5815552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5816552f7358SJed Brown /*@C 5817552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5818552f7358SJed Brown the local section and an SF describing the section point overlap. 5819552f7358SJed Brown 5820552f7358SJed Brown Input Parameters: 5821552f7358SJed Brown + s - The PetscSection for the local field layout 5822552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5823552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5824552f7358SJed Brown . label - The label specifying the points 5825552f7358SJed Brown - labelValue - The label stratum specifying the points 5826552f7358SJed Brown 5827552f7358SJed Brown Output Parameter: 5828552f7358SJed Brown . gsection - The PetscSection for the global field layout 5829552f7358SJed Brown 5830552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5831552f7358SJed Brown 5832552f7358SJed Brown Level: developer 5833552f7358SJed Brown 5834552f7358SJed Brown .seealso: PetscSectionCreate() 5835552f7358SJed Brown @*/ 5836552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5837552f7358SJed Brown { 58387ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5839552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5840552f7358SJed Brown PetscErrorCode ierr; 5841552f7358SJed Brown 5842552f7358SJed Brown PetscFunctionBegin; 58434c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5844552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5845552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 58467ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 58477ec39499SMatthew G. Knepley if (nroots >= 0) { 58487ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 58491795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 58507ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 58511795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 58527ec39499SMatthew G. Knepley } else { 58537ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 58547ec39499SMatthew G. Knepley } 58557ec39499SMatthew G. Knepley } 5856552f7358SJed Brown /* Mark ghost points with negative dof */ 5857552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5858552f7358SJed Brown PetscInt value; 5859552f7358SJed Brown 5860552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5861552f7358SJed Brown if (value != labelValue) continue; 5862552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5863552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5864552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5865552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 58667ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5867552f7358SJed Brown } 5868552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5869552f7358SJed Brown if (nroots >= 0) { 58707ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 58717ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5872552f7358SJed Brown if (nroots > pEnd-pStart) { 58737ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5874552f7358SJed Brown } 5875552f7358SJed Brown } 5876552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5877552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5878552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5879552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5880552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5881552f7358SJed Brown } 58824c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5883552f7358SJed Brown globalOff -= off; 5884552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5885552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 58867ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5887552f7358SJed Brown } 5888552f7358SJed Brown /* Put in negative offsets for ghost points */ 5889552f7358SJed Brown if (nroots >= 0) { 58907ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 58917ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5892552f7358SJed Brown if (nroots > pEnd-pStart) { 58937ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5894552f7358SJed Brown } 5895552f7358SJed Brown } 58967ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5897552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5898552f7358SJed Brown PetscFunctionReturn(0); 5899552f7358SJed Brown } 5900ca8062c8SMatthew G. Knepley 5901ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5902ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5903ca8062c8SMatthew G. Knepley /*@ 5904ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5905ca8062c8SMatthew G. Knepley 5906ca8062c8SMatthew G. Knepley Input Parameters: 5907ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5908ca8062c8SMatthew G. Knepley 5909ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5910ca8062c8SMatthew G. Knepley 5911ca8062c8SMatthew G. Knepley Level: developer 5912ca8062c8SMatthew G. Knepley 59139bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5914ca8062c8SMatthew G. Knepley @*/ 5915ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5916ca8062c8SMatthew G. Knepley { 5917ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5918ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5919ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5920ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5921ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5922ca8062c8SMatthew G. Knepley 5923ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5924ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5925ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5926ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5927ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5928ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5929ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5930ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5931ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5932ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 593342e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 593442e66dfaSMatthew G. Knepley PetscInt d; 593542e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 593642e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 593742e66dfaSMatthew G. Knepley } 5938ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5939ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5940ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5941ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5942ca8062c8SMatthew G. Knepley } 594342e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5944ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5945ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5946ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5947ca8062c8SMatthew G. Knepley } 5948ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5949ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5950ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5951ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5952ca8062c8SMatthew G. Knepley } 5953ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 595442e66dfaSMatthew G. Knepley if (dup) { 595542e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 595642e66dfaSMatthew G. Knepley } else { 5957ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5958ca8062c8SMatthew G. Knepley } 5959ca8062c8SMatthew G. Knepley } 596042e66dfaSMatthew G. Knepley } 5961ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5962ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5963ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5964ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5965ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5966ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5967ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5968ca8062c8SMatthew G. Knepley } 5969ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5970ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5971ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5972ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5973ca8062c8SMatthew G. Knepley } 5974ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5975ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5976ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5977ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5978ca8062c8SMatthew G. Knepley } 5979ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5980ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5981ca8062c8SMatthew G. Knepley } 5982ca8062c8SMatthew G. Knepley } 5983ca8062c8SMatthew G. Knepley } 5984ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5985ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5986ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5987ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5988ca8062c8SMatthew G. Knepley } 5989ca8062c8SMatthew G. Knepley 5990ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5991ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5992ca8062c8SMatthew G. Knepley /*@ 5993ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5994ca8062c8SMatthew G. Knepley 5995ca8062c8SMatthew G. Knepley Input Parameters: 5996ca8062c8SMatthew G. Knepley + dm - The DMPlex object 599758723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 599858723a97SMatthew G. Knepley - cellHeight - Normally 0 5999ca8062c8SMatthew G. Knepley 6000ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6001ca8062c8SMatthew G. Knepley 6002ca8062c8SMatthew G. Knepley Level: developer 6003ca8062c8SMatthew G. Knepley 60049bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6005ca8062c8SMatthew G. Knepley @*/ 600658723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6007ca8062c8SMatthew G. Knepley { 600842363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6009ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6010ca8062c8SMatthew G. Knepley 6011ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6012ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6013*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6014ca8062c8SMatthew G. Knepley switch (dim) { 601542363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 601642363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 601742363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6018ca8062c8SMatthew G. Knepley default: 6019ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6020ca8062c8SMatthew G. Knepley } 602158723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 602258723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6023ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6024ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6025ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 602658723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 602758723a97SMatthew G. Knepley 602858723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 602958723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 603058723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 603158723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 603258723a97SMatthew G. Knepley } 603358723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6034ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6035ca8062c8SMatthew G. Knepley } 603642363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 603742363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 603842363296SMatthew G. Knepley 603942363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 604042363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 604142363296SMatthew G. Knepley const PetscInt p = closure[cl]; 604242363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 604342363296SMatthew G. Knepley } 604442363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 604542363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 604642363296SMatthew G. Knepley } 6047ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6048ca8062c8SMatthew G. Knepley } 60499bf0dad6SMatthew G. Knepley 60509bf0dad6SMatthew G. Knepley #undef __FUNCT__ 60519bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 60529bf0dad6SMatthew G. Knepley /*@ 60539bf0dad6SMatthew 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 60549bf0dad6SMatthew G. Knepley 60559bf0dad6SMatthew G. Knepley Input Parameters: 60569bf0dad6SMatthew G. Knepley + dm - The DMPlex object 60579bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 60589bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 60599bf0dad6SMatthew G. Knepley 60609bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 60619bf0dad6SMatthew G. Knepley 60629bf0dad6SMatthew G. Knepley Level: developer 60639bf0dad6SMatthew G. Knepley 60649bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 60659bf0dad6SMatthew G. Knepley @*/ 60669bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 60679bf0dad6SMatthew G. Knepley { 60683554e41dSMatthew G. Knepley PetscInt pMax[4]; 60693554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 60709bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 60719bf0dad6SMatthew G. Knepley 60729bf0dad6SMatthew G. Knepley PetscFunctionBegin; 60739bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6074*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 60759bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 607625abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 60773554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 60783554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 60793554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 60809bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 60819bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 60829bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 60839bf0dad6SMatthew G. Knepley 608425abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 60859bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 60869bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 60879bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 60889bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 60899bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 60909bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 60919bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 60929bf0dad6SMatthew G. Knepley } 60933554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 60949bf0dad6SMatthew 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); 60959bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 60969bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 60979bf0dad6SMatthew G. Knepley 60989bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 60999bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 61009bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 61019bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 61029bf0dad6SMatthew G. Knepley } 6103e003ed69SMatthew 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); 61049bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6105e003ed69SMatthew 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]); 61069bf0dad6SMatthew G. Knepley } 61079bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 61089bf0dad6SMatthew G. Knepley } 61099bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 61109bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 61119bf0dad6SMatthew G. Knepley } 61123554e41dSMatthew G. Knepley } 6113552f7358SJed Brown PetscFunctionReturn(0); 6114552f7358SJed Brown } 61153913d7c8SMatthew G. Knepley 61163913d7c8SMatthew G. Knepley #undef __FUNCT__ 6117bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6118bceba477SMatthew G. Knepley /* Pointwise interpolation 6119bceba477SMatthew G. Knepley Just code FEM for now 6120bceba477SMatthew G. Knepley u^f = I u^c 61214ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 61224ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 61234ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6124bceba477SMatthew G. Knepley */ 6125bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6126bceba477SMatthew G. Knepley { 6127bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6128bceba477SMatthew G. Knepley PetscInt m, n; 6129a063dac3SMatthew G. Knepley void *ctx; 6130bceba477SMatthew G. Knepley PetscErrorCode ierr; 6131bceba477SMatthew G. Knepley 6132bceba477SMatthew G. Knepley PetscFunctionBegin; 6133bceba477SMatthew G. Knepley /* 6134bceba477SMatthew G. Knepley Loop over coarse cells 6135bceba477SMatthew G. Knepley Loop over coarse basis functions 6136bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6137bceba477SMatthew G. Knepley Loop over fine dual basis functions 6138bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6139bceba477SMatthew G. Knepley Sum 6140bceba477SMatthew G. Knepley Update local element matrix 6141bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6142bceba477SMatthew G. Knepley 6143bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6144bceba477SMatthew G. Knepley */ 6145bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6146bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6147bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6148bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6149bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6150bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6151bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6152bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6153a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6154a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 61555d1c2e58SMatthew G. Knepley /* Use naive scaling */ 61565d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6157a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6158a063dac3SMatthew G. Knepley } 6159bceba477SMatthew G. Knepley 6160a063dac3SMatthew G. Knepley #undef __FUNCT__ 6161a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6162a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6163a063dac3SMatthew G. Knepley { 616490748bafSMatthew G. Knepley PetscErrorCode ierr; 616590748bafSMatthew G. Knepley 6166a063dac3SMatthew G. Knepley PetscFunctionBegin; 61677c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6168bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6169bceba477SMatthew G. Knepley } 6170bceba477SMatthew G. Knepley 6171bceba477SMatthew G. Knepley #undef __FUNCT__ 6172fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6173fd59a867SMatthew G. Knepley /* Pointwise interpolation 6174fd59a867SMatthew G. Knepley Just code FEM for now 6175fd59a867SMatthew G. Knepley u^f = I u^c 6176fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6177fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6178fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6179fd59a867SMatthew G. Knepley */ 6180fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6181fd59a867SMatthew G. Knepley { 6182fd59a867SMatthew G. Knepley PetscSection section; 6183fd59a867SMatthew G. Knepley IS *bcPoints; 6184286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6185286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6186fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6187fd59a867SMatthew G. Knepley 6188fd59a867SMatthew G. Knepley PetscFunctionBegin; 6189fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6190286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6191*c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6192fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6193fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6194fd59a867SMatthew G. Knepley PetscBool isEssential; 619563d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6196fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6197fd59a867SMatthew G. Knepley } 6198fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6199fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6200fd59a867SMatthew G. Knepley const char *bdLabel; 6201fd59a867SMatthew G. Knepley DMLabel label; 6202fd59a867SMatthew G. Knepley const PetscInt *values; 62037391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6204c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6205fd59a867SMatthew G. Knepley 620663d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6207fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6208fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 62097391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 62107391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 62117391c1cbSMatthew G. Knepley const char *bdname; 62122f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 62137391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 62147391c1cbSMatthew G. Knepley if (duplicate) break; 62157391c1cbSMatthew G. Knepley } 62167391c1cbSMatthew G. Knepley if (!duplicate) { 6217fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 621832720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 62197391c1cbSMatthew G. Knepley } 622093a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6221fd59a867SMatthew G. Knepley if (isEssential) { 622293a5981aSMatthew G. Knepley IS tmp; 622393a5981aSMatthew G. Knepley PetscInt *newidx; 622493a5981aSMatthew G. Knepley const PetscInt *idx; 622593a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 622693a5981aSMatthew G. Knepley 6227fd59a867SMatthew G. Knepley bcFields[bc] = field; 622893a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 622993a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 623093a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 623193a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 623293a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 623393a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 623493a5981aSMatthew G. Knepley newn = 0; 623593a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 623693a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 623793a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 623893a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6239fd59a867SMatthew G. Knepley } 6240fd59a867SMatthew G. Knepley } 6241fd59a867SMatthew G. Knepley /* Handle discretization */ 6242fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6243286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6244fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6245fd59a867SMatthew G. Knepley PetscFE fe; 6246286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6247fd59a867SMatthew G. Knepley PetscInt d; 6248fd59a867SMatthew G. Knepley 624918abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6250fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6251286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6252286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6253fd59a867SMatthew G. Knepley } 6254286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6255286d8613SMatthew G. Knepley PetscInt d; 6256286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6257286d8613SMatthew 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."); 6258286d8613SMatthew G. Knepley } 6259286d8613SMatthew G. Knepley } 6260f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6261fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6262fd59a867SMatthew G. Knepley PetscFE fe; 6263fd59a867SMatthew G. Knepley const char *name; 626418abd763SMatthew G. Knepley 626518abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6266fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6267fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6268fd59a867SMatthew G. Knepley } 6269fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6270fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6271fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6272fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6273286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6274bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6275bceba477SMatthew G. Knepley } 6276bceba477SMatthew G. Knepley 6277bceba477SMatthew G. Knepley #undef __FUNCT__ 62783913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 62793913d7c8SMatthew G. Knepley /*@ 62803913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 62813913d7c8SMatthew G. Knepley 62823913d7c8SMatthew G. Knepley Input Parameter: 62833913d7c8SMatthew G. Knepley . dm - The DMPlex object 62843913d7c8SMatthew G. Knepley 62853913d7c8SMatthew G. Knepley Output Parameter: 62863913d7c8SMatthew G. Knepley . cdm - The coarse DM 62873913d7c8SMatthew G. Knepley 62883913d7c8SMatthew G. Knepley Level: intermediate 62893913d7c8SMatthew G. Knepley 62903913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 62913913d7c8SMatthew G. Knepley @*/ 62923913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 62933913d7c8SMatthew G. Knepley { 62943913d7c8SMatthew G. Knepley PetscFunctionBegin; 62953913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 62963913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 62973913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 62983913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 62993913d7c8SMatthew G. Knepley } 63003913d7c8SMatthew G. Knepley 63013913d7c8SMatthew G. Knepley #undef __FUNCT__ 63023913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 63033913d7c8SMatthew G. Knepley /*@ 63043913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 63053913d7c8SMatthew G. Knepley 63063913d7c8SMatthew G. Knepley Input Parameters: 63073913d7c8SMatthew G. Knepley + dm - The DMPlex object 63083913d7c8SMatthew G. Knepley - cdm - The coarse DM 63093913d7c8SMatthew G. Knepley 63103913d7c8SMatthew G. Knepley Level: intermediate 63113913d7c8SMatthew G. Knepley 63123913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 63133913d7c8SMatthew G. Knepley @*/ 63143913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 63153913d7c8SMatthew G. Knepley { 63163913d7c8SMatthew G. Knepley DM_Plex *mesh; 63173913d7c8SMatthew G. Knepley PetscErrorCode ierr; 63183913d7c8SMatthew G. Knepley 63193913d7c8SMatthew G. Knepley PetscFunctionBegin; 63203913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63213913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 63223913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 63233913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 63243913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 63253913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 63263913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 63273913d7c8SMatthew G. Knepley } 6328