1af0996ceSBarry Smith #include <petsc/private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2af0996ceSBarry Smith #include <petsc/private/isimpl.h> 30c312b8eSJed Brown #include <petscsf.h> 4e228b242SToby Isaac #include <petscds.h> 5552f7358SJed Brown 6552f7358SJed Brown /* Logging support */ 7c1f031eeSMatthew G. Knepley PetscLogEvent DMPLEX_Interpolate, PETSCPARTITIONER_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeOverlap, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Migrate, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM, DMPLEX_InterpolatorFEM, DMPLEX_InjectorFEM, DMPLEX_IntegralFEM; 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 { 1780d5bdc6SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, cEndInterior, vdof = 0, cdof = 0; 187e42fee7SMatthew G. Knepley PetscErrorCode ierr; 197e42fee7SMatthew G. Knepley 207e42fee7SMatthew G. Knepley PetscFunctionBegin; 217e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 22c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 237e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2580d5bdc6SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 2680d5bdc6SMatthew G. Knepley cEnd = cEndInterior < 0 ? cEnd : cEndInterior; 277e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 287e42fee7SMatthew G. Knepley if (field >= 0) { 297e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 307e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley } else { 327e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 337e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 347e42fee7SMatthew G. Knepley } 357e42fee7SMatthew G. Knepley if (vdof) { 367e42fee7SMatthew G. Knepley *sStart = vStart; 377e42fee7SMatthew G. Knepley *sEnd = vEnd; 387e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 397e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 407e42fee7SMatthew G. Knepley } else if (cdof) { 417e42fee7SMatthew G. Knepley *sStart = cStart; 427e42fee7SMatthew G. Knepley *sEnd = cEnd; 437e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 447e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 457e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 467e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 477e42fee7SMatthew G. Knepley } 487e42fee7SMatthew G. Knepley 49552f7358SJed Brown #undef __FUNCT__ 50552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 51552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 52552f7358SJed Brown { 53552f7358SJed Brown DM dm; 54b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 55552f7358SJed Brown PetscErrorCode ierr; 56552f7358SJed Brown 57552f7358SJed Brown PetscFunctionBegin; 58552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5982f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 60552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 61b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 62b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 63ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 64ef31f671SMatthew G. Knepley PetscInt numFields; 65ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 66ef31f671SMatthew G. Knepley 67ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 68ef31f671SMatthew G. Knepley if (numFields) { 69ef31f671SMatthew G. Knepley PetscObject fe; 70ef31f671SMatthew G. Knepley 71ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 72ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 73ef31f671SMatthew G. Knepley } 74d7ddef95SMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValues(dm, v, 0.0, NULL, NULL, NULL);CHKERRQ(ierr);} 75ef31f671SMatthew G. Knepley } 76552f7358SJed Brown if (isvtk) { 77552f7358SJed Brown PetscSection section; 78b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 79b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 80552f7358SJed Brown 81552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 827afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 83552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 84552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 85552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 86b136c2c9SMatthew G. Knepley } else if (ishdf5) { 87b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 88b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 89b136c2c9SMatthew G. Knepley #else 90b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 91b136c2c9SMatthew G. Knepley #endif 92552f7358SJed Brown } else { 9355f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9455f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 95552f7358SJed Brown } 96552f7358SJed Brown PetscFunctionReturn(0); 97552f7358SJed Brown } 98552f7358SJed Brown 99552f7358SJed Brown #undef __FUNCT__ 100552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 101552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 102552f7358SJed Brown { 103552f7358SJed Brown DM dm; 10455f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 105552f7358SJed Brown PetscErrorCode ierr; 106552f7358SJed Brown 107552f7358SJed Brown PetscFunctionBegin; 108552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 10982f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 110552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 11133c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11255f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 113552f7358SJed Brown if (isvtk) { 114552f7358SJed Brown Vec locv; 115552f7358SJed Brown const char *name; 116552f7358SJed Brown 117552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 118552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 119552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 120552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 122552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 123552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 124b136c2c9SMatthew G. Knepley } else if (ishdf5) { 125b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 126b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 127b136c2c9SMatthew G. Knepley #else 128b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 129b136c2c9SMatthew G. Knepley #endif 130552f7358SJed Brown } else { 13155f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13255f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 133552f7358SJed Brown } 134552f7358SJed Brown PetscFunctionReturn(0); 135552f7358SJed Brown } 136552f7358SJed Brown 137552f7358SJed Brown #undef __FUNCT__ 1382c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1392c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1402c40f234SMatthew G. Knepley { 1412c40f234SMatthew G. Knepley DM dm; 1422c40f234SMatthew G. Knepley PetscBool ishdf5; 1432c40f234SMatthew G. Knepley PetscErrorCode ierr; 1442c40f234SMatthew G. Knepley 1452c40f234SMatthew G. Knepley PetscFunctionBegin; 1462c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1472c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1482c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1492c40f234SMatthew G. Knepley if (ishdf5) { 1502c40f234SMatthew G. Knepley DM dmBC; 1512c40f234SMatthew G. Knepley Vec gv; 1522c40f234SMatthew G. Knepley const char *name; 1532c40f234SMatthew G. Knepley 1542c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1612c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley } else { 1632c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1642c40f234SMatthew G. Knepley } 1652c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1662c40f234SMatthew G. Knepley } 1672c40f234SMatthew G. Knepley 1682c40f234SMatthew G. Knepley #undef __FUNCT__ 1692c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1702c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1712c40f234SMatthew G. Knepley { 1722c40f234SMatthew G. Knepley DM dm; 1732c40f234SMatthew G. Knepley PetscBool ishdf5; 1742c40f234SMatthew G. Knepley PetscErrorCode ierr; 1752c40f234SMatthew G. Knepley 1762c40f234SMatthew G. Knepley PetscFunctionBegin; 1772c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1782c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1792c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1802c40f234SMatthew G. Knepley if (ishdf5) { 181878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 182b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 183b136c2c9SMatthew G. Knepley #else 184b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 185878b459fSMatthew G. Knepley #endif 1862c40f234SMatthew G. Knepley } else { 1872c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 188552f7358SJed Brown } 189552f7358SJed Brown PetscFunctionReturn(0); 190552f7358SJed Brown } 191552f7358SJed Brown 192552f7358SJed Brown #undef __FUNCT__ 193731e8ddeSMatthew G. Knepley #define __FUNCT__ "DMPlexView_Ascii_Geometry" 194731e8ddeSMatthew G. Knepley PetscErrorCode DMPlexView_Ascii_Geometry(DM dm, PetscViewer viewer) 195731e8ddeSMatthew G. Knepley { 196731e8ddeSMatthew G. Knepley PetscSection coordSection; 197731e8ddeSMatthew G. Knepley Vec coordinates; 198731e8ddeSMatthew G. Knepley DMLabel depthLabel; 199731e8ddeSMatthew G. Knepley const char *name[4]; 200731e8ddeSMatthew G. Knepley const PetscScalar *a; 201731e8ddeSMatthew G. Knepley PetscInt dim, pStart, pEnd, cStart, cEnd, c; 202731e8ddeSMatthew G. Knepley PetscErrorCode ierr; 203731e8ddeSMatthew G. Knepley 204731e8ddeSMatthew G. Knepley PetscFunctionBegin; 205731e8ddeSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 206731e8ddeSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 207731e8ddeSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 208731e8ddeSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 209731e8ddeSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 210731e8ddeSMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &pStart, &pEnd);CHKERRQ(ierr); 211731e8ddeSMatthew G. Knepley ierr = VecGetArrayRead(coordinates, &a);CHKERRQ(ierr); 212731e8ddeSMatthew G. Knepley name[0] = "vertex"; 213731e8ddeSMatthew G. Knepley name[1] = "edge"; 214731e8ddeSMatthew G. Knepley name[dim-1] = "face"; 215731e8ddeSMatthew G. Knepley name[dim] = "cell"; 216731e8ddeSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 217731e8ddeSMatthew G. Knepley PetscInt *closure = NULL; 218731e8ddeSMatthew G. Knepley PetscInt closureSize, cl; 219731e8ddeSMatthew G. Knepley 220731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "Geometry for cell %d:\n", c);CHKERRQ(ierr); 221731e8ddeSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 222731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPushTab(viewer);CHKERRQ(ierr); 223731e8ddeSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 224731e8ddeSMatthew G. Knepley PetscInt point = closure[cl], depth, dof, off, d, p; 225731e8ddeSMatthew G. Knepley 226731e8ddeSMatthew G. Knepley if ((point < pStart) || (point >= pEnd)) continue; 227731e8ddeSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, point, &dof);CHKERRQ(ierr); 228731e8ddeSMatthew G. Knepley if (!dof) continue; 229731e8ddeSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &depth);CHKERRQ(ierr); 230731e8ddeSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, point, &off);CHKERRQ(ierr); 231731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%s %d coords:", name[depth], point);CHKERRQ(ierr); 232731e8ddeSMatthew G. Knepley for (p = 0; p < dof/dim; ++p) { 233731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (");CHKERRQ(ierr); 234731e8ddeSMatthew G. Knepley for (d = 0; d < dim; ++d) { 235731e8ddeSMatthew G. Knepley if (d > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 23641477eefSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%g", PetscRealPart(a[off+p*dim+d]));CHKERRQ(ierr); 237731e8ddeSMatthew G. Knepley } 238731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, ")");CHKERRQ(ierr); 239731e8ddeSMatthew G. Knepley } 240731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 241731e8ddeSMatthew G. Knepley } 242731e8ddeSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 243731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPopTab(viewer);CHKERRQ(ierr); 244731e8ddeSMatthew G. Knepley } 245731e8ddeSMatthew G. Knepley ierr = VecRestoreArrayRead(coordinates, &a);CHKERRQ(ierr); 246731e8ddeSMatthew G. Knepley PetscFunctionReturn(0); 247731e8ddeSMatthew G. Knepley } 248731e8ddeSMatthew G. Knepley 249731e8ddeSMatthew G. Knepley #undef __FUNCT__ 250552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 251552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 252552f7358SJed Brown { 253552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 254552f7358SJed Brown DM cdm; 255552f7358SJed Brown DMLabel markers; 256552f7358SJed Brown PetscSection coordSection; 257552f7358SJed Brown Vec coordinates; 258552f7358SJed Brown PetscViewerFormat format; 259552f7358SJed Brown PetscErrorCode ierr; 260552f7358SJed Brown 261552f7358SJed Brown PetscFunctionBegin; 262552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 263552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 264552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 265552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 266552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 267552f7358SJed Brown const char *name; 268552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 269552f7358SJed Brown PetscInt pStart, pEnd, p; 270552f7358SJed Brown PetscMPIInt rank, size; 271552f7358SJed Brown 27282f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 27382f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 274552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 275552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 276552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 277552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 278552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 279552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 280552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 281552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 282552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 283552f7358SJed Brown PetscInt dof, off, s; 284552f7358SJed Brown 285552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 286552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 287552f7358SJed Brown for (s = off; s < off+dof; ++s) { 288e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%d]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 289552f7358SJed Brown } 290552f7358SJed Brown } 291552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 292552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 293552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 294552f7358SJed Brown PetscInt dof, off, c; 295552f7358SJed Brown 296552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 297552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 298552f7358SJed Brown for (c = off; c < off+dof; ++c) { 299e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%d]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 300552f7358SJed Brown } 301552f7358SJed Brown } 302552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 3030298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 304552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 305552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 306552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 307552f7358SJed Brown if (size > 1) { 308552f7358SJed Brown PetscSF sf; 309552f7358SJed Brown 310552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 311552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 312552f7358SJed Brown } 313552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 314552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 3150588280cSMatthew G. Knepley const char *name, *color; 3160588280cSMatthew G. Knepley const char *defcolors[3] = {"gray", "orange", "green"}; 3170588280cSMatthew G. Knepley const char *deflcolors[4] = {"blue", "cyan", "red", "magenta"}; 318552f7358SJed Brown PetscReal scale = 2.0; 3190588280cSMatthew G. Knepley PetscBool useNumbers = PETSC_TRUE, useLabels, useColors; 3200588280cSMatthew G. Knepley double tcoords[3]; 321552f7358SJed Brown PetscScalar *coords; 3220588280cSMatthew G. Knepley PetscInt numLabels, l, numColors, numLColors, dim, depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 323552f7358SJed Brown PetscMPIInt rank, size; 3240588280cSMatthew G. Knepley char **names, **colors, **lcolors; 325552f7358SJed Brown 3260588280cSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 327552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3280588280cSMatthew G. Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 3290588280cSMatthew G. Knepley numLabels = PetscMax(numLabels, 10); 3300588280cSMatthew G. Knepley numColors = 10; 3310588280cSMatthew G. Knepley numLColors = 10; 3320588280cSMatthew G. Knepley ierr = PetscCalloc3(numLabels, &names, numColors, &colors, numLColors, &lcolors);CHKERRQ(ierr); 3330588280cSMatthew G. Knepley ierr = PetscOptionsGetReal(((PetscObject) viewer)->prefix, "-dm_plex_view_scale", &scale, NULL);CHKERRQ(ierr); 3340588280cSMatthew G. Knepley ierr = PetscOptionsGetBool(((PetscObject) viewer)->prefix, "-dm_plex_view_numbers", &useNumbers, NULL);CHKERRQ(ierr); 3350588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_labels", names, &numLabels, &useLabels);CHKERRQ(ierr); 3360588280cSMatthew G. Knepley if (!useLabels) numLabels = 0; 3370588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_colors", colors, &numColors, &useColors);CHKERRQ(ierr); 3380588280cSMatthew G. Knepley if (!useColors) { 3390588280cSMatthew G. Knepley numColors = 3; 3400588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscStrallocpy(defcolors[c], &colors[c]);CHKERRQ(ierr);} 3410588280cSMatthew G. Knepley } 3420588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_lcolors", lcolors, &numLColors, &useColors);CHKERRQ(ierr); 3430588280cSMatthew G. Knepley if (!useColors) { 3440588280cSMatthew G. Knepley numLColors = 4; 3450588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscStrallocpy(deflcolors[c], &lcolors[c]);CHKERRQ(ierr);} 3460588280cSMatthew G. Knepley } 34782f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 34882f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 349552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 350552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 351770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 3520588280cSMatthew G. Knepley \\documentclass[tikz]{standalone}\n\n\ 353552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 354552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 355552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 3560588280cSMatthew G. Knepley \\begin{document}\n");CHKERRQ(ierr); 3570588280cSMatthew G. Knepley if (size > 1) { 358f738dd31SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%s for process ", name);CHKERRQ(ierr); 359770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 360770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 361770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 362770b213bSMatthew G Knepley } else if (p > 0) { 363770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 364770b213bSMatthew G Knepley } 365770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 366770b213bSMatthew G Knepley } 3670588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n");CHKERRQ(ierr); 3680588280cSMatthew G. Knepley } 3690588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n", 1.0);CHKERRQ(ierr); 370552f7358SJed Brown /* Plot vertices */ 371552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 372552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 373552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 374552f7358SJed Brown PetscInt off, dof, d; 3750588280cSMatthew G. Knepley PetscBool isLabeled = PETSC_FALSE; 376552f7358SJed Brown 377552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 378552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3790588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\path (");CHKERRQ(ierr); 3800588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 3810588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[off+d])); 3820588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 3830588280cSMatthew G. Knepley } 3840588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 3850588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 386552f7358SJed Brown for (d = 0; d < dof; ++d) { 387552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3880588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 389552f7358SJed Brown } 3900588280cSMatthew G. Knepley color = colors[rank%numColors]; 3910588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 3920588280cSMatthew G. Knepley PetscInt val; 3930588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 3940588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; isLabeled = PETSC_TRUE; break;} 3950588280cSMatthew G. Knepley } 3960588280cSMatthew G. Knepley if (useNumbers) { 397e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%d) [draw,shape=circle,color=%s] {%D};\n", v, rank, color, v);CHKERRQ(ierr); 3980588280cSMatthew G. Knepley } else { 399e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%d) [fill,inner sep=%dpt,shape=circle,color=%s] {};\n", v, rank, !isLabeled ? 1 : 2, color);CHKERRQ(ierr); 4000588280cSMatthew G. Knepley } 401552f7358SJed Brown } 402552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 403552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 404552f7358SJed Brown /* Plot edges */ 4050588280cSMatthew G. Knepley if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 4060588280cSMatthew G. Knepley if (dim < 3 && useNumbers) { 407552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 408552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 409552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 410552f7358SJed Brown const PetscInt *cone; 411552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 412552f7358SJed Brown 413552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 41482f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 415552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 416552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 417552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 418552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 419552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 420552f7358SJed Brown for (d = 0; d < dof; ++d) { 4210588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[offA+d]+coords[offB+d])); 4220588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 423552f7358SJed Brown } 4240588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 4250588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 4260588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 4270588280cSMatthew G. Knepley if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 4280588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 4290588280cSMatthew G. Knepley } 4300588280cSMatthew G. Knepley color = colors[rank%numColors]; 4310588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 4320588280cSMatthew G. Knepley PetscInt val; 4330588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 4340750fff4SMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 4350588280cSMatthew G. Knepley } 436e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%d) [draw,shape=circle,color=%s] {%D} --\n", e, rank, color, e);CHKERRQ(ierr); 437552f7358SJed Brown } 438552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 439552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 440552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 4410588280cSMatthew G. Knepley } 442552f7358SJed Brown /* Plot cells */ 4430588280cSMatthew G. Knepley if (dim == 3 || !useNumbers) { 4440588280cSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 4450588280cSMatthew G. Knepley const PetscInt *cone; 4460588280cSMatthew G. Knepley 4470588280cSMatthew G. Knepley color = colors[rank%numColors]; 4480588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 4490588280cSMatthew G. Knepley PetscInt val; 4500588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], e, &val);CHKERRQ(ierr); 4510588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 4520588280cSMatthew G. Knepley } 4530588280cSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 454e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] (%D_%d) -- (%D_%d);\n", color, cone[0], rank, cone[1], rank);CHKERRQ(ierr); 4550588280cSMatthew G. Knepley } 4560588280cSMatthew G. Knepley } else { 457552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 458552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4590298fd71SBarry Smith PetscInt *closure = NULL; 460552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 461552f7358SJed Brown 462552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 463552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 464552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 465552f7358SJed Brown const PetscInt point = closure[p]; 466552f7358SJed Brown 467552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 468552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 469e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%d)", point, rank);CHKERRQ(ierr); 470552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 471552f7358SJed Brown } 472552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 473e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%d);\n", firstPoint, rank);CHKERRQ(ierr); 474552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 475552f7358SJed Brown } 4760588280cSMatthew G. Knepley } 477552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 4780588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n");CHKERRQ(ierr); 479770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 4800588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) {ierr = PetscFree(names[l]);CHKERRQ(ierr);} 4810588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscFree(colors[c]);CHKERRQ(ierr);} 4820588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscFree(lcolors[c]);CHKERRQ(ierr);} 4830588280cSMatthew G. Knepley ierr = PetscFree3(names, colors, lcolors);CHKERRQ(ierr); 484552f7358SJed Brown } else { 48582f516ccSBarry Smith MPI_Comm comm; 486834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 487834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 488552f7358SJed Brown PetscInt pStart, pEnd, p; 489a57dd577SMatthew G Knepley PetscInt numLabels, l; 4901143a3c0SMatthew G. Knepley const char *name; 491552f7358SJed Brown PetscMPIInt size; 492552f7358SJed Brown 49382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 494552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 495c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4965f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 4971143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 4981143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 499552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 500552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 501bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 502dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 503552f7358SJed Brown if (depth == 1) { 504552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 505552f7358SJed Brown pEnd = pEnd - pStart; 506552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 507552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 508552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 509552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 510552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 511552f7358SJed Brown pEnd = pEnd - pStart; 512552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 513552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 514552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 515552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 516552f7358SJed Brown } else { 517552f7358SJed Brown for (d = 0; d <= dim; d++) { 518552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 519834065abSMatthew G. Knepley pEnd -= pStart; 520834065abSMatthew G. Knepley pMax[d] -= pStart; 521552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 522834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 523552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 524834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 525834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 526834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 527834065abSMatthew G. Knepley } 528552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 529552f7358SJed Brown } 530552f7358SJed Brown } 531834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 532a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 533a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 534a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 535a57dd577SMatthew G Knepley DMLabel label; 536a57dd577SMatthew G Knepley const char *name; 537a57dd577SMatthew G Knepley IS valueIS; 538a57dd577SMatthew G Knepley const PetscInt *values; 539a57dd577SMatthew G Knepley PetscInt numValues, v; 540a57dd577SMatthew G Knepley 541a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 542a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 543a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 544a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 545a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 546a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 547a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 548a57dd577SMatthew G Knepley PetscInt size; 549a57dd577SMatthew G Knepley 550a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 551a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 552a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 553a57dd577SMatthew G Knepley } 554a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 555a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 5564d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 557a57dd577SMatthew G Knepley } 558552f7358SJed Brown } 559552f7358SJed Brown PetscFunctionReturn(0); 560552f7358SJed Brown } 561552f7358SJed Brown 562552f7358SJed Brown #undef __FUNCT__ 563552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 564552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 565552f7358SJed Brown { 566fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 567552f7358SJed Brown PetscErrorCode ierr; 568552f7358SJed Brown 569552f7358SJed Brown PetscFunctionBegin; 570552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 571552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 572552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 573fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 574c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 575552f7358SJed Brown if (iascii) { 576552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 577c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 578c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 5797afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 580c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 5817afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 582c6ccd67eSMatthew G. Knepley #else 583c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 584552f7358SJed Brown #endif 58511aeaf0aSBarry Smith } 586fcf6c8fdSToby Isaac else if (isvtk) { 587fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 588fcf6c8fdSToby Isaac } 589552f7358SJed Brown PetscFunctionReturn(0); 590552f7358SJed Brown } 591552f7358SJed Brown 5922c40f234SMatthew G. Knepley #undef __FUNCT__ 5932c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 5942c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 5952c40f234SMatthew G. Knepley { 5962c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 5972c40f234SMatthew G. Knepley PetscErrorCode ierr; 5982c40f234SMatthew G. Knepley 5992c40f234SMatthew G. Knepley PetscFunctionBegin; 6002c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6012c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 6022c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 6032c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 6042c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 6052c40f234SMatthew G. Knepley else if (ishdf5) { 6062c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 60710b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 6082c40f234SMatthew G. Knepley #else 6092c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 610552f7358SJed Brown #endif 611552f7358SJed Brown } 612552f7358SJed Brown PetscFunctionReturn(0); 613552f7358SJed Brown } 614552f7358SJed Brown 615552f7358SJed Brown #undef __FUNCT__ 6166c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 6176c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 6186c73c22cSMatthew G. Knepley { 6196c73c22cSMatthew G. Knepley DMBoundary b, next; 6206c73c22cSMatthew G. Knepley PetscErrorCode ierr; 6216c73c22cSMatthew G. Knepley 6228e136ac0SMatthew G. Knepley PetscFunctionBegin; 6236c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 6246c73c22cSMatthew G. Knepley b = *boundary; 6256c73c22cSMatthew G. Knepley *boundary = NULL; 6266c73c22cSMatthew G. Knepley for (; b; b = next) { 6276c73c22cSMatthew G. Knepley next = b->next; 6286c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 6296c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 63063d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 6316c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 6326c73c22cSMatthew G. Knepley } 6336c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 6346c73c22cSMatthew G. Knepley } 6356c73c22cSMatthew G. Knepley 6366c73c22cSMatthew G. Knepley #undef __FUNCT__ 637552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 638552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 639552f7358SJed Brown { 640552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 641a85475f2SMatthew G. Knepley PlexLabel next = mesh->labels; 642552f7358SJed Brown PetscErrorCode ierr; 643552f7358SJed Brown 644552f7358SJed Brown PetscFunctionBegin; 6450d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 646552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 647552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 648552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 649552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 650552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 651552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 652d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->tetgenOpts);CHKERRQ(ierr); 653d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->triangleOpts);CHKERRQ(ierr); 65477623264SMatthew G. Knepley ierr = PetscPartitionerDestroy(&mesh->partitioner);CHKERRQ(ierr); 655552f7358SJed Brown while (next) { 656a85475f2SMatthew G. Knepley PlexLabel tmp = next->next; 657552f7358SJed Brown 658a85475f2SMatthew G. Knepley ierr = DMLabelDestroy(&next->label);CHKERRQ(ierr); 659a85475f2SMatthew G. Knepley ierr = PetscFree(next);CHKERRQ(ierr); 660552f7358SJed Brown next = tmp; 661552f7358SJed Brown } 6623913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 663a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 664552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 665552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 6666c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 667a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 668a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 669d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr); 670d961a43aSToby Isaac ierr = PetscFree(mesh->parents);CHKERRQ(ierr); 671d961a43aSToby Isaac ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr); 672d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr); 673d961a43aSToby Isaac ierr = PetscFree(mesh->children);CHKERRQ(ierr); 674d6a7ad0dSToby Isaac ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr); 675552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 676552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 677552f7358SJed Brown PetscFunctionReturn(0); 678552f7358SJed Brown } 679552f7358SJed Brown 680552f7358SJed Brown #undef __FUNCT__ 681552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 682b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 683552f7358SJed Brown { 6848d1174e4SMatthew G. Knepley PetscSection sectionGlobal; 685552f7358SJed Brown PetscInt bs = -1; 686552f7358SJed Brown PetscInt localSize; 68789545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 688552f7358SJed Brown PetscErrorCode ierr; 689b412c318SBarry Smith MatType mtype; 6901428887cSShri Abhyankar ISLocalToGlobalMapping ltog; 691552f7358SJed Brown 692552f7358SJed Brown PetscFunctionBegin; 693607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 694b412c318SBarry Smith mtype = dm->mattype; 695552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 696552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 697552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 69882f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 699552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 700552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 701552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 702552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 703552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 704552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 705552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 706552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 707552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 708552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 709552f7358SJed Brown if (!isShell) { 710552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 7112a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 712552f7358SJed Brown 713552f7358SJed Brown if (bs < 0) { 714552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 715fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 716552f7358SJed Brown 717552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 718552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 719552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 720fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 721fad22124SMatthew G Knepley if (dof-cdof) { 7222a28c762SMatthew G Knepley if (bs < 0) { 723fad22124SMatthew G Knepley bs = dof-cdof; 724fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 7252a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 7262a28c762SMatthew G Knepley bs = 1; 727552f7358SJed Brown break; 728552f7358SJed Brown } 729552f7358SJed Brown } 7302a28c762SMatthew G Knepley } 7312a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 7322a28c762SMatthew G Knepley bsLocal = bs; 73382f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 7342a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 73582f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 7362a28c762SMatthew G Knepley if (bsMin != bsMax) { 7372a28c762SMatthew G Knepley bs = 1; 7382a28c762SMatthew G Knepley } else { 7392a28c762SMatthew G Knepley bs = bsMax; 7402a28c762SMatthew G Knepley } 741552f7358SJed Brown } else { 742552f7358SJed Brown bs = 1; 743552f7358SJed Brown } 744552f7358SJed Brown } 7451795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 7468d1174e4SMatthew G. Knepley ierr = DMPlexPreallocateOperator(dm, bs, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 747552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 7481428887cSShri Abhyankar 7491428887cSShri Abhyankar /* Set localtoglobalmapping on the matrix for MatSetValuesLocal() to work */ 7501428887cSShri Abhyankar ierr = DMGetLocalToGlobalMapping(dm,<og);CHKERRQ(ierr); 7511428887cSShri Abhyankar ierr = MatSetLocalToGlobalMapping(*J,ltog,ltog);CHKERRQ(ierr); 752552f7358SJed Brown } 753552f7358SJed Brown PetscFunctionReturn(0); 754552f7358SJed Brown } 755552f7358SJed Brown 756552f7358SJed Brown #undef __FUNCT__ 757552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 758552f7358SJed Brown /*@ 759552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 760552f7358SJed Brown 761552f7358SJed Brown Not collective 762552f7358SJed Brown 763552f7358SJed Brown Input Parameter: 764552f7358SJed Brown . mesh - The DMPlex 765552f7358SJed Brown 766552f7358SJed Brown Output Parameters: 767552f7358SJed Brown + pStart - The first mesh point 768552f7358SJed Brown - pEnd - The upper bound for mesh points 769552f7358SJed Brown 770552f7358SJed Brown Level: beginner 771552f7358SJed Brown 772552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 773552f7358SJed Brown @*/ 774552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 775552f7358SJed Brown { 776552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 777552f7358SJed Brown PetscErrorCode ierr; 778552f7358SJed Brown 779552f7358SJed Brown PetscFunctionBegin; 780552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 781552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 782552f7358SJed Brown PetscFunctionReturn(0); 783552f7358SJed Brown } 784552f7358SJed Brown 785552f7358SJed Brown #undef __FUNCT__ 786552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 787552f7358SJed Brown /*@ 788552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 789552f7358SJed Brown 790552f7358SJed Brown Not collective 791552f7358SJed Brown 792552f7358SJed Brown Input Parameters: 793552f7358SJed Brown + mesh - The DMPlex 794552f7358SJed Brown . pStart - The first mesh point 795552f7358SJed Brown - pEnd - The upper bound for mesh points 796552f7358SJed Brown 797552f7358SJed Brown Output Parameters: 798552f7358SJed Brown 799552f7358SJed Brown Level: beginner 800552f7358SJed Brown 801552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 802552f7358SJed Brown @*/ 803552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 804552f7358SJed Brown { 805552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 806552f7358SJed Brown PetscErrorCode ierr; 807552f7358SJed Brown 808552f7358SJed Brown PetscFunctionBegin; 809552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 810552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 811552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 812552f7358SJed Brown PetscFunctionReturn(0); 813552f7358SJed Brown } 814552f7358SJed Brown 815552f7358SJed Brown #undef __FUNCT__ 816552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 817552f7358SJed Brown /*@ 818552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 819552f7358SJed Brown 820552f7358SJed Brown Not collective 821552f7358SJed Brown 822552f7358SJed Brown Input Parameters: 823552f7358SJed Brown + mesh - The DMPlex 824552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 825552f7358SJed Brown 826552f7358SJed Brown Output Parameter: 827552f7358SJed Brown . size - The cone size for point p 828552f7358SJed Brown 829552f7358SJed Brown Level: beginner 830552f7358SJed Brown 831552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 832552f7358SJed Brown @*/ 833552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 834552f7358SJed Brown { 835552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 836552f7358SJed Brown PetscErrorCode ierr; 837552f7358SJed Brown 838552f7358SJed Brown PetscFunctionBegin; 839552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 840552f7358SJed Brown PetscValidPointer(size, 3); 841552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 842552f7358SJed Brown PetscFunctionReturn(0); 843552f7358SJed Brown } 844552f7358SJed Brown 845552f7358SJed Brown #undef __FUNCT__ 846552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 847552f7358SJed Brown /*@ 848552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 849552f7358SJed Brown 850552f7358SJed Brown Not collective 851552f7358SJed Brown 852552f7358SJed Brown Input Parameters: 853552f7358SJed Brown + mesh - The DMPlex 854552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 855552f7358SJed Brown - size - The cone size for point p 856552f7358SJed Brown 857552f7358SJed Brown Output Parameter: 858552f7358SJed Brown 859552f7358SJed Brown Note: 860552f7358SJed Brown This should be called after DMPlexSetChart(). 861552f7358SJed Brown 862552f7358SJed Brown Level: beginner 863552f7358SJed Brown 864552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 865552f7358SJed Brown @*/ 866552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 867552f7358SJed Brown { 868552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 869552f7358SJed Brown PetscErrorCode ierr; 870552f7358SJed Brown 871552f7358SJed Brown PetscFunctionBegin; 872552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 873552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 8740d644c17SKarl Rupp 875552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 876552f7358SJed Brown PetscFunctionReturn(0); 877552f7358SJed Brown } 878552f7358SJed Brown 879552f7358SJed Brown #undef __FUNCT__ 880f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 881f5a469b9SMatthew G. Knepley /*@ 882f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 883f5a469b9SMatthew G. Knepley 884f5a469b9SMatthew G. Knepley Not collective 885f5a469b9SMatthew G. Knepley 886f5a469b9SMatthew G. Knepley Input Parameters: 887f5a469b9SMatthew G. Knepley + mesh - The DMPlex 888f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 889f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 890f5a469b9SMatthew G. Knepley 891f5a469b9SMatthew G. Knepley Output Parameter: 892f5a469b9SMatthew G. Knepley 893f5a469b9SMatthew G. Knepley Note: 894f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 895f5a469b9SMatthew G. Knepley 896f5a469b9SMatthew G. Knepley Level: beginner 897f5a469b9SMatthew G. Knepley 898f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 899f5a469b9SMatthew G. Knepley @*/ 900f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 901f5a469b9SMatthew G. Knepley { 902f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 903f5a469b9SMatthew G. Knepley PetscInt csize; 904f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 905f5a469b9SMatthew G. Knepley 906f5a469b9SMatthew G. Knepley PetscFunctionBegin; 907f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 908f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 909f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 910f5a469b9SMatthew G. Knepley 911f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 912f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 913f5a469b9SMatthew G. Knepley } 914f5a469b9SMatthew G. Knepley 915f5a469b9SMatthew G. Knepley #undef __FUNCT__ 916552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 917552f7358SJed Brown /*@C 918552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 919552f7358SJed Brown 920552f7358SJed Brown Not collective 921552f7358SJed Brown 922552f7358SJed Brown Input Parameters: 923552f7358SJed Brown + mesh - The DMPlex 924552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 925552f7358SJed Brown 926552f7358SJed Brown Output Parameter: 927552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 928552f7358SJed Brown 929552f7358SJed Brown Level: beginner 930552f7358SJed Brown 9313813dfbdSMatthew G Knepley Fortran Notes: 9323813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9333813dfbdSMatthew G Knepley include petsc.h90 in your code. 9343813dfbdSMatthew G Knepley 9353813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 936552f7358SJed Brown 937552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 938552f7358SJed Brown @*/ 939552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 940552f7358SJed Brown { 941552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 942552f7358SJed Brown PetscInt off; 943552f7358SJed Brown PetscErrorCode ierr; 944552f7358SJed Brown 945552f7358SJed Brown PetscFunctionBegin; 946552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 947552f7358SJed Brown PetscValidPointer(cone, 3); 948552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 949552f7358SJed Brown *cone = &mesh->cones[off]; 950552f7358SJed Brown PetscFunctionReturn(0); 951552f7358SJed Brown } 952552f7358SJed Brown 953552f7358SJed Brown #undef __FUNCT__ 954552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 955552f7358SJed Brown /*@ 956552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 957552f7358SJed Brown 958552f7358SJed Brown Not collective 959552f7358SJed Brown 960552f7358SJed Brown Input Parameters: 961552f7358SJed Brown + mesh - The DMPlex 962552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 963552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 964552f7358SJed Brown 965552f7358SJed Brown Output Parameter: 966552f7358SJed Brown 967552f7358SJed Brown Note: 968552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 969552f7358SJed Brown 970552f7358SJed Brown Level: beginner 971552f7358SJed Brown 972552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 973552f7358SJed Brown @*/ 974552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 975552f7358SJed Brown { 976552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 977552f7358SJed Brown PetscInt pStart, pEnd; 978552f7358SJed Brown PetscInt dof, off, c; 979552f7358SJed Brown PetscErrorCode ierr; 980552f7358SJed Brown 981552f7358SJed Brown PetscFunctionBegin; 982552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 983552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 984552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 985552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 986552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98782f516ccSBarry 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); 988552f7358SJed Brown for (c = 0; c < dof; ++c) { 98982f516ccSBarry 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); 990552f7358SJed Brown mesh->cones[off+c] = cone[c]; 991552f7358SJed Brown } 992552f7358SJed Brown PetscFunctionReturn(0); 993552f7358SJed Brown } 994552f7358SJed Brown 995552f7358SJed Brown #undef __FUNCT__ 996552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 997552f7358SJed Brown /*@C 998552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 999552f7358SJed Brown 1000552f7358SJed Brown Not collective 1001552f7358SJed Brown 1002552f7358SJed Brown Input Parameters: 1003552f7358SJed Brown + mesh - The DMPlex 1004552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1005552f7358SJed Brown 1006552f7358SJed Brown Output Parameter: 1007552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1008552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1009552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1010552f7358SJed Brown the index of the cone point on which to start. 1011552f7358SJed Brown 1012552f7358SJed Brown Level: beginner 1013552f7358SJed Brown 10143813dfbdSMatthew G Knepley Fortran Notes: 10153813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10163813dfbdSMatthew G Knepley include petsc.h90 in your code. 10173813dfbdSMatthew G Knepley 10183813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 1019552f7358SJed Brown 1020552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 1021552f7358SJed Brown @*/ 1022552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 1023552f7358SJed Brown { 1024552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1025552f7358SJed Brown PetscInt off; 1026552f7358SJed Brown PetscErrorCode ierr; 1027552f7358SJed Brown 1028552f7358SJed Brown PetscFunctionBegin; 1029552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1030552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 1031552f7358SJed Brown { 1032552f7358SJed Brown PetscInt dof; 1033552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1034552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1035552f7358SJed Brown } 1036552f7358SJed Brown #endif 1037552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 10380d644c17SKarl Rupp 1039552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 1040552f7358SJed Brown PetscFunctionReturn(0); 1041552f7358SJed Brown } 1042552f7358SJed Brown 1043552f7358SJed Brown #undef __FUNCT__ 1044552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 1045552f7358SJed Brown /*@ 1046552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 1047552f7358SJed Brown 1048552f7358SJed Brown Not collective 1049552f7358SJed Brown 1050552f7358SJed Brown Input Parameters: 1051552f7358SJed Brown + mesh - The DMPlex 1052552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1053552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1054552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1055552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1056552f7358SJed Brown the index of the cone point on which to start. 1057552f7358SJed Brown 1058552f7358SJed Brown Output Parameter: 1059552f7358SJed Brown 1060552f7358SJed Brown Note: 1061552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 1062552f7358SJed Brown 1063552f7358SJed Brown Level: beginner 1064552f7358SJed Brown 1065552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 1066552f7358SJed Brown @*/ 1067552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 1068552f7358SJed Brown { 1069552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1070552f7358SJed Brown PetscInt pStart, pEnd; 1071552f7358SJed Brown PetscInt dof, off, c; 1072552f7358SJed Brown PetscErrorCode ierr; 1073552f7358SJed Brown 1074552f7358SJed Brown PetscFunctionBegin; 1075552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1076552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 1077552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1078552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1079552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 108082f516ccSBarry 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); 1081552f7358SJed Brown for (c = 0; c < dof; ++c) { 1082552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 1083552f7358SJed Brown 1084552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 108582f516ccSBarry 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); 1086552f7358SJed Brown mesh->coneOrientations[off+c] = o; 1087552f7358SJed Brown } 1088552f7358SJed Brown PetscFunctionReturn(0); 1089552f7358SJed Brown } 1090552f7358SJed Brown 1091552f7358SJed Brown #undef __FUNCT__ 1092552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 1093552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 1094552f7358SJed Brown { 1095552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1096552f7358SJed Brown PetscInt pStart, pEnd; 1097552f7358SJed Brown PetscInt dof, off; 1098552f7358SJed Brown PetscErrorCode ierr; 1099552f7358SJed Brown 1100552f7358SJed Brown PetscFunctionBegin; 1101552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1102552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 110382f516ccSBarry 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); 110482f516ccSBarry 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); 110577c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 110677c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 110777c88f5bSMatthew 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); 1108552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 1109552f7358SJed Brown PetscFunctionReturn(0); 1110552f7358SJed Brown } 1111552f7358SJed Brown 1112552f7358SJed Brown #undef __FUNCT__ 111377c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 111477c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 111577c88f5bSMatthew G Knepley { 111677c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 111777c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 111877c88f5bSMatthew G Knepley PetscInt dof, off; 111977c88f5bSMatthew G Knepley PetscErrorCode ierr; 112077c88f5bSMatthew G Knepley 112177c88f5bSMatthew G Knepley PetscFunctionBegin; 112277c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 112377c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 112477c88f5bSMatthew 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); 112577c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 112677c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 112777c88f5bSMatthew 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); 112877c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 112977c88f5bSMatthew G Knepley PetscFunctionReturn(0); 113077c88f5bSMatthew G Knepley } 113177c88f5bSMatthew G Knepley 113277c88f5bSMatthew G Knepley #undef __FUNCT__ 1133552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1134552f7358SJed Brown /*@ 1135552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1136552f7358SJed Brown 1137552f7358SJed Brown Not collective 1138552f7358SJed Brown 1139552f7358SJed Brown Input Parameters: 1140552f7358SJed Brown + mesh - The DMPlex 1141552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1142552f7358SJed Brown 1143552f7358SJed Brown Output Parameter: 1144552f7358SJed Brown . size - The support size for point p 1145552f7358SJed Brown 1146552f7358SJed Brown Level: beginner 1147552f7358SJed Brown 1148552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1149552f7358SJed Brown @*/ 1150552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1151552f7358SJed Brown { 1152552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1153552f7358SJed Brown PetscErrorCode ierr; 1154552f7358SJed Brown 1155552f7358SJed Brown PetscFunctionBegin; 1156552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1157552f7358SJed Brown PetscValidPointer(size, 3); 1158552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1159552f7358SJed Brown PetscFunctionReturn(0); 1160552f7358SJed Brown } 1161552f7358SJed Brown 1162552f7358SJed Brown #undef __FUNCT__ 1163552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1164552f7358SJed Brown /*@ 1165552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1166552f7358SJed Brown 1167552f7358SJed Brown Not collective 1168552f7358SJed Brown 1169552f7358SJed Brown Input Parameters: 1170552f7358SJed Brown + mesh - The DMPlex 1171552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1172552f7358SJed Brown - size - The support size for point p 1173552f7358SJed Brown 1174552f7358SJed Brown Output Parameter: 1175552f7358SJed Brown 1176552f7358SJed Brown Note: 1177552f7358SJed Brown This should be called after DMPlexSetChart(). 1178552f7358SJed Brown 1179552f7358SJed Brown Level: beginner 1180552f7358SJed Brown 1181552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1182552f7358SJed Brown @*/ 1183552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1184552f7358SJed Brown { 1185552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1186552f7358SJed Brown PetscErrorCode ierr; 1187552f7358SJed Brown 1188552f7358SJed Brown PetscFunctionBegin; 1189552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1190552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 11910d644c17SKarl Rupp 1192552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1193552f7358SJed Brown PetscFunctionReturn(0); 1194552f7358SJed Brown } 1195552f7358SJed Brown 1196552f7358SJed Brown #undef __FUNCT__ 1197552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1198552f7358SJed Brown /*@C 1199552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1200552f7358SJed Brown 1201552f7358SJed Brown Not collective 1202552f7358SJed Brown 1203552f7358SJed Brown Input Parameters: 1204552f7358SJed Brown + mesh - The DMPlex 1205552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1206552f7358SJed Brown 1207552f7358SJed Brown Output Parameter: 1208552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1209552f7358SJed Brown 1210552f7358SJed Brown Level: beginner 1211552f7358SJed Brown 12123813dfbdSMatthew G Knepley Fortran Notes: 12133813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12143813dfbdSMatthew G Knepley include petsc.h90 in your code. 12153813dfbdSMatthew G Knepley 12163813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 12173813dfbdSMatthew G Knepley 1218552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1219552f7358SJed Brown @*/ 1220552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1221552f7358SJed Brown { 1222552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1223552f7358SJed Brown PetscInt off; 1224552f7358SJed Brown PetscErrorCode ierr; 1225552f7358SJed Brown 1226552f7358SJed Brown PetscFunctionBegin; 1227552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1228552f7358SJed Brown PetscValidPointer(support, 3); 1229552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1230552f7358SJed Brown *support = &mesh->supports[off]; 1231552f7358SJed Brown PetscFunctionReturn(0); 1232552f7358SJed Brown } 1233552f7358SJed Brown 1234552f7358SJed Brown #undef __FUNCT__ 1235552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1236552f7358SJed Brown /*@ 1237552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1238552f7358SJed Brown 1239552f7358SJed Brown Not collective 1240552f7358SJed Brown 1241552f7358SJed Brown Input Parameters: 1242552f7358SJed Brown + mesh - The DMPlex 1243552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1244552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1245552f7358SJed Brown 1246552f7358SJed Brown Output Parameter: 1247552f7358SJed Brown 1248552f7358SJed Brown Note: 1249552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1250552f7358SJed Brown 1251552f7358SJed Brown Level: beginner 1252552f7358SJed Brown 1253552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1254552f7358SJed Brown @*/ 1255552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1256552f7358SJed Brown { 1257552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1258552f7358SJed Brown PetscInt pStart, pEnd; 1259552f7358SJed Brown PetscInt dof, off, c; 1260552f7358SJed Brown PetscErrorCode ierr; 1261552f7358SJed Brown 1262552f7358SJed Brown PetscFunctionBegin; 1263552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1264552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1265552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1266552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1267552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 126882f516ccSBarry 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); 1269552f7358SJed Brown for (c = 0; c < dof; ++c) { 127082f516ccSBarry 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); 1271552f7358SJed Brown mesh->supports[off+c] = support[c]; 1272552f7358SJed Brown } 1273552f7358SJed Brown PetscFunctionReturn(0); 1274552f7358SJed Brown } 1275552f7358SJed Brown 1276552f7358SJed Brown #undef __FUNCT__ 1277552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1278552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1279552f7358SJed Brown { 1280552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1281552f7358SJed Brown PetscInt pStart, pEnd; 1282552f7358SJed Brown PetscInt dof, off; 1283552f7358SJed Brown PetscErrorCode ierr; 1284552f7358SJed Brown 1285552f7358SJed Brown PetscFunctionBegin; 1286552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1287552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1288552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1289552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 129082f516ccSBarry 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); 129182f516ccSBarry 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); 129282f516ccSBarry 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); 1293552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1294552f7358SJed Brown PetscFunctionReturn(0); 1295552f7358SJed Brown } 1296552f7358SJed Brown 1297552f7358SJed Brown #undef __FUNCT__ 1298552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1299552f7358SJed Brown /*@C 1300552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1301552f7358SJed Brown 1302552f7358SJed Brown Not collective 1303552f7358SJed Brown 1304552f7358SJed Brown Input Parameters: 1305552f7358SJed Brown + mesh - The DMPlex 1306552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1307552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13080298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1309552f7358SJed Brown 1310552f7358SJed Brown Output Parameters: 1311552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1312552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1313552f7358SJed Brown 1314552f7358SJed Brown Note: 13150298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1316552f7358SJed Brown 13173813dfbdSMatthew G Knepley Fortran Notes: 13183813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13193813dfbdSMatthew G Knepley include petsc.h90 in your code. 13203813dfbdSMatthew G Knepley 13213813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13223813dfbdSMatthew G Knepley 1323552f7358SJed Brown Level: beginner 1324552f7358SJed Brown 1325552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1326552f7358SJed Brown @*/ 1327552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1328552f7358SJed Brown { 1329552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1330552f7358SJed Brown PetscInt *closure, *fifo; 13310298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1332552f7358SJed Brown PetscInt tmpSize, t; 1333552f7358SJed Brown PetscInt depth = 0, maxSize; 1334552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1335552f7358SJed Brown PetscErrorCode ierr; 1336552f7358SJed Brown 1337552f7358SJed Brown PetscFunctionBegin; 1338552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1339552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1340552f7358SJed Brown /* This is only 1-level */ 1341552f7358SJed Brown if (useCone) { 1342552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1343552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1344552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1345552f7358SJed Brown } else { 1346552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1347552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1348552f7358SJed Brown } 1349bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1350bfbcdd7aSMatthew G. Knepley if (*points) { 1351bfbcdd7aSMatthew G. Knepley closure = *points; 1352bfbcdd7aSMatthew G. Knepley } else { 1353bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1354bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1355bfbcdd7aSMatthew G. Knepley } 1356bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1357bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1358bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1359bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1360bfbcdd7aSMatthew G. Knepley } 1361bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1362bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1363bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1364bfbcdd7aSMatthew G. Knepley } 136524c766afSToby Isaac { 136624c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 136724c766afSToby Isaac 136824c766afSToby Isaac c = mesh->maxConeSize; 136924c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 137024c766afSToby Isaac s = mesh->maxSupportSize; 137124c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 137224c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 137324c766afSToby Isaac } 1374bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1375bfbcdd7aSMatthew G. Knepley if (*points) { 1376bfbcdd7aSMatthew G. Knepley closure = *points; 1377bfbcdd7aSMatthew G. Knepley } else { 1378bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1379bfbcdd7aSMatthew G. Knepley } 1380bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1381552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1382552f7358SJed Brown const PetscInt cp = tmp[t]; 1383552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1384552f7358SJed Brown 1385552f7358SJed Brown closure[closureSize] = cp; 1386552f7358SJed Brown closure[closureSize+1] = co; 1387552f7358SJed Brown fifo[fifoSize] = cp; 1388552f7358SJed Brown fifo[fifoSize+1] = co; 1389552f7358SJed Brown } 1390bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1391552f7358SJed Brown while (fifoSize - fifoStart) { 1392552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1393552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1394552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1395552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1396552f7358SJed Brown 1397552f7358SJed Brown if (useCone) { 1398552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1399552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1400552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1401552f7358SJed Brown } else { 1402552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1403552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14040298fd71SBarry Smith tmpO = NULL; 1405552f7358SJed Brown } 1406552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1407552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1408552f7358SJed Brown const PetscInt cp = tmp[i]; 14092e1b13c2SMatthew 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. */ 14102e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14112e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14122e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1413552f7358SJed Brown PetscInt c; 1414552f7358SJed Brown 14152e1b13c2SMatthew G. Knepley if (rev) { 14162e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 14172e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14182e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14192e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14202e1b13c2SMatthew G. Knepley } 1421552f7358SJed Brown /* Check for duplicate */ 1422552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1423552f7358SJed Brown if (closure[c] == cp) break; 1424552f7358SJed Brown } 1425552f7358SJed Brown if (c == closureSize) { 1426552f7358SJed Brown closure[closureSize] = cp; 1427552f7358SJed Brown closure[closureSize+1] = co; 1428552f7358SJed Brown fifo[fifoSize] = cp; 1429552f7358SJed Brown fifo[fifoSize+1] = co; 1430552f7358SJed Brown closureSize += 2; 1431552f7358SJed Brown fifoSize += 2; 1432552f7358SJed Brown } 1433552f7358SJed Brown } 1434552f7358SJed Brown fifoStart += 2; 1435552f7358SJed Brown } 1436552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1437552f7358SJed Brown if (points) *points = closure; 1438552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1439552f7358SJed Brown PetscFunctionReturn(0); 1440552f7358SJed Brown } 1441552f7358SJed Brown 1442552f7358SJed Brown #undef __FUNCT__ 14439bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 14449bf0dad6SMatthew G. Knepley /*@C 14459bf0dad6SMatthew 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 14469bf0dad6SMatthew G. Knepley 14479bf0dad6SMatthew G. Knepley Not collective 14489bf0dad6SMatthew G. Knepley 14499bf0dad6SMatthew G. Knepley Input Parameters: 14509bf0dad6SMatthew G. Knepley + mesh - The DMPlex 14519bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 14529bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 14539bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 14549bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 14559bf0dad6SMatthew G. Knepley 14569bf0dad6SMatthew G. Knepley Output Parameters: 14579bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 14589bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 14599bf0dad6SMatthew G. Knepley 14609bf0dad6SMatthew G. Knepley Note: 14619bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 14629bf0dad6SMatthew G. Knepley 14639bf0dad6SMatthew G. Knepley Fortran Notes: 14649bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14659bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 14669bf0dad6SMatthew G. Knepley 14679bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14689bf0dad6SMatthew G. Knepley 14699bf0dad6SMatthew G. Knepley Level: beginner 14709bf0dad6SMatthew G. Knepley 14719bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 14729bf0dad6SMatthew G. Knepley @*/ 14739bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 14749bf0dad6SMatthew G. Knepley { 14759bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 14769bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 14779bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 14789bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 14799bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 14809bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 14819bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 14829bf0dad6SMatthew G. Knepley 14839bf0dad6SMatthew G. Knepley PetscFunctionBegin; 14849bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14859bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 14869bf0dad6SMatthew G. Knepley /* This is only 1-level */ 14879bf0dad6SMatthew G. Knepley if (useCone) { 14889bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 14899bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 14909bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 14919bf0dad6SMatthew G. Knepley } else { 14929bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 14939bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 14949bf0dad6SMatthew G. Knepley } 14959bf0dad6SMatthew G. Knepley if (depth == 1) { 14969bf0dad6SMatthew G. Knepley if (*points) { 14979bf0dad6SMatthew G. Knepley closure = *points; 14989bf0dad6SMatthew G. Knepley } else { 14999bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 15009bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 15019bf0dad6SMatthew G. Knepley } 15029bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 15039bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 15049bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 15059bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 15069bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 15079bf0dad6SMatthew G. Knepley } 15089bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15099bf0dad6SMatthew G. Knepley if (points) *points = closure; 15109bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15119bf0dad6SMatthew G. Knepley } 151224c766afSToby Isaac { 151324c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 151424c766afSToby Isaac 151524c766afSToby Isaac c = mesh->maxConeSize; 151624c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 151724c766afSToby Isaac s = mesh->maxSupportSize; 151824c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 151924c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 152024c766afSToby Isaac } 15219bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15229bf0dad6SMatthew G. Knepley if (*points) { 15239bf0dad6SMatthew G. Knepley closure = *points; 15249bf0dad6SMatthew G. Knepley } else { 15259bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 15269bf0dad6SMatthew G. Knepley } 15279bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 15289bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 15299bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 15309bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15319bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15329bf0dad6SMatthew G. Knepley 15339bf0dad6SMatthew G. Knepley if (ornt < 0) { 15349bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15359bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15369bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15379bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15389bf0dad6SMatthew G. Knepley } 15399bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15409bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15419bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15429bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15439bf0dad6SMatthew G. Knepley } 15449bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 15459bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 15469bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 15479bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 15489bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 15499bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 15509bf0dad6SMatthew G. Knepley 15519bf0dad6SMatthew G. Knepley if (useCone) { 15529bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 15539bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 15549bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 15559bf0dad6SMatthew G. Knepley } else { 15569bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 15579bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 15589bf0dad6SMatthew G. Knepley tmpO = NULL; 15599bf0dad6SMatthew G. Knepley } 15609bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 15619bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 15629bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15639bf0dad6SMatthew 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. */ 15649bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 15659bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 15669bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15679bf0dad6SMatthew G. Knepley PetscInt c; 15689bf0dad6SMatthew G. Knepley 15699bf0dad6SMatthew G. Knepley if (rev) { 15709bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15719bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15729bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15739bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15749bf0dad6SMatthew G. Knepley } 15759bf0dad6SMatthew G. Knepley /* Check for duplicate */ 15769bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 15779bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 15789bf0dad6SMatthew G. Knepley } 15799bf0dad6SMatthew G. Knepley if (c == closureSize) { 15809bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15819bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15829bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15839bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15849bf0dad6SMatthew G. Knepley closureSize += 2; 15859bf0dad6SMatthew G. Knepley fifoSize += 2; 15869bf0dad6SMatthew G. Knepley } 15879bf0dad6SMatthew G. Knepley } 15889bf0dad6SMatthew G. Knepley fifoStart += 2; 15899bf0dad6SMatthew G. Knepley } 15909bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15919bf0dad6SMatthew G. Knepley if (points) *points = closure; 15929bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15939bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15949bf0dad6SMatthew G. Knepley } 15959bf0dad6SMatthew G. Knepley 15969bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1597552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1598552f7358SJed Brown /*@C 1599552f7358SJed 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 1600552f7358SJed Brown 1601552f7358SJed Brown Not collective 1602552f7358SJed Brown 1603552f7358SJed Brown Input Parameters: 1604552f7358SJed Brown + mesh - The DMPlex 1605552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1606552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1607e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1608e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1609552f7358SJed Brown 1610552f7358SJed Brown Note: 16110298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1612552f7358SJed Brown 16133813dfbdSMatthew G Knepley Fortran Notes: 16143813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16153813dfbdSMatthew G Knepley include petsc.h90 in your code. 16163813dfbdSMatthew G Knepley 16173813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16183813dfbdSMatthew G Knepley 1619552f7358SJed Brown Level: beginner 1620552f7358SJed Brown 1621552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1622552f7358SJed Brown @*/ 1623552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1624552f7358SJed Brown { 1625552f7358SJed Brown PetscErrorCode ierr; 1626552f7358SJed Brown 1627552f7358SJed Brown PetscFunctionBegin; 1628552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1629e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1630e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1631552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 16324ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1633552f7358SJed Brown PetscFunctionReturn(0); 1634552f7358SJed Brown } 1635552f7358SJed Brown 1636552f7358SJed Brown #undef __FUNCT__ 1637552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1638552f7358SJed Brown /*@ 1639552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1640552f7358SJed Brown 1641552f7358SJed Brown Not collective 1642552f7358SJed Brown 1643552f7358SJed Brown Input Parameter: 1644552f7358SJed Brown . mesh - The DMPlex 1645552f7358SJed Brown 1646552f7358SJed Brown Output Parameters: 1647552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1648552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1649552f7358SJed Brown 1650552f7358SJed Brown Level: beginner 1651552f7358SJed Brown 1652552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1653552f7358SJed Brown @*/ 1654552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1655552f7358SJed Brown { 1656552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1657552f7358SJed Brown 1658552f7358SJed Brown PetscFunctionBegin; 1659552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1660552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1661552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1662552f7358SJed Brown PetscFunctionReturn(0); 1663552f7358SJed Brown } 1664552f7358SJed Brown 1665552f7358SJed Brown #undef __FUNCT__ 1666552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1667552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1668552f7358SJed Brown { 1669552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1670552f7358SJed Brown PetscInt size; 1671552f7358SJed Brown PetscErrorCode ierr; 1672552f7358SJed Brown 1673552f7358SJed Brown PetscFunctionBegin; 1674552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1675552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1676552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 16771795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 16781795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1679552f7358SJed Brown if (mesh->maxSupportSize) { 1680552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1681552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 16821795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1683552f7358SJed Brown } 1684552f7358SJed Brown PetscFunctionReturn(0); 1685552f7358SJed Brown } 1686552f7358SJed Brown 1687552f7358SJed Brown #undef __FUNCT__ 1688552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1689552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1690552f7358SJed Brown { 1691552f7358SJed Brown PetscErrorCode ierr; 1692552f7358SJed Brown 1693552f7358SJed Brown PetscFunctionBegin; 16944d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 16954d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1696552f7358SJed Brown PetscFunctionReturn(0); 1697552f7358SJed Brown } 1698552f7358SJed Brown 1699552f7358SJed Brown #undef __FUNCT__ 1700552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1701552f7358SJed Brown /*@ 1702552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1703552f7358SJed Brown 1704552f7358SJed Brown Not collective 1705552f7358SJed Brown 1706552f7358SJed Brown Input Parameter: 1707552f7358SJed Brown . mesh - The DMPlex 1708552f7358SJed Brown 1709552f7358SJed Brown Output Parameter: 1710552f7358SJed Brown 1711552f7358SJed Brown Note: 1712552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1713552f7358SJed Brown 1714552f7358SJed Brown Level: beginner 1715552f7358SJed Brown 1716552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1717552f7358SJed Brown @*/ 1718552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1719552f7358SJed Brown { 1720552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1721552f7358SJed Brown PetscInt *offsets; 1722552f7358SJed Brown PetscInt supportSize; 1723552f7358SJed Brown PetscInt pStart, pEnd, p; 1724552f7358SJed Brown PetscErrorCode ierr; 1725552f7358SJed Brown 1726552f7358SJed Brown PetscFunctionBegin; 1727552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 172882f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1729552f7358SJed Brown /* Calculate support sizes */ 1730552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1731552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1732552f7358SJed Brown PetscInt dof, off, c; 1733552f7358SJed Brown 1734552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1735552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1736552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1737552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1738552f7358SJed Brown } 1739552f7358SJed Brown } 1740552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1741552f7358SJed Brown PetscInt dof; 1742552f7358SJed Brown 1743552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 17440d644c17SKarl Rupp 1745552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1746552f7358SJed Brown } 1747552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1748552f7358SJed Brown /* Calculate supports */ 1749552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 17501795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 17511795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1752552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1753552f7358SJed Brown PetscInt dof, off, c; 1754552f7358SJed Brown 1755552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1756552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1757552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1758552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1759552f7358SJed Brown PetscInt offS; 1760552f7358SJed Brown 1761552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 17620d644c17SKarl Rupp 1763552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1764552f7358SJed Brown ++offsets[q]; 1765552f7358SJed Brown } 1766552f7358SJed Brown } 1767552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1768552f7358SJed Brown PetscFunctionReturn(0); 1769552f7358SJed Brown } 1770552f7358SJed Brown 1771552f7358SJed Brown #undef __FUNCT__ 1772552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1773552f7358SJed Brown /*@ 1774552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1775552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1776552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1777552f7358SJed Brown the DAG. 1778552f7358SJed Brown 1779552f7358SJed Brown Not collective 1780552f7358SJed Brown 1781552f7358SJed Brown Input Parameter: 1782552f7358SJed Brown . mesh - The DMPlex 1783552f7358SJed Brown 1784552f7358SJed Brown Output Parameter: 1785552f7358SJed Brown 1786552f7358SJed Brown Notes: 1787150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1788150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1789150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1790150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1791552f7358SJed Brown 1792150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1793552f7358SJed Brown 1794552f7358SJed Brown Level: beginner 1795552f7358SJed Brown 1796552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1797552f7358SJed Brown @*/ 1798552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1799552f7358SJed Brown { 1800aa50250dSMatthew G. Knepley DMLabel label; 1801552f7358SJed Brown PetscInt pStart, pEnd, p; 1802552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1803552f7358SJed Brown PetscErrorCode ierr; 1804552f7358SJed Brown 1805552f7358SJed Brown PetscFunctionBegin; 1806552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1807552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1808552f7358SJed Brown /* Calculate depth */ 1809aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1810aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1811aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1812552f7358SJed Brown /* Initialize roots and count leaves */ 1813552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1814552f7358SJed Brown PetscInt coneSize, supportSize; 1815552f7358SJed Brown 1816552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1817552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1818552f7358SJed Brown if (!coneSize && supportSize) { 1819552f7358SJed Brown ++numRoots; 1820aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1821552f7358SJed Brown } else if (!supportSize && coneSize) { 1822552f7358SJed Brown ++numLeaves; 1823552f7358SJed Brown } else if (!supportSize && !coneSize) { 1824552f7358SJed Brown /* Isolated points */ 1825aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1826552f7358SJed Brown } 1827552f7358SJed Brown } 1828552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1829552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1830552f7358SJed Brown PetscInt coneSize, supportSize; 1831552f7358SJed Brown 1832552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1833552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1834552f7358SJed Brown if (!supportSize && coneSize) { 1835aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1836552f7358SJed Brown } 1837552f7358SJed Brown } 1838552f7358SJed Brown } else { 183974ef644bSMatthew G. Knepley IS pointIS; 184074ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1841552f7358SJed Brown 184274ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 184374ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 184474ef644bSMatthew G. Knepley while (numPoints) { 184574ef644bSMatthew G. Knepley const PetscInt *points; 184674ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 184774ef644bSMatthew G. Knepley 184874ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 184974ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 185074ef644bSMatthew G. Knepley const PetscInt point = points[p]; 185174ef644bSMatthew G. Knepley const PetscInt *support; 185274ef644bSMatthew G. Knepley PetscInt supportSize, s; 185374ef644bSMatthew G. Knepley 185474ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 185574ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 185674ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 185774ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1858552f7358SJed Brown } 1859552f7358SJed Brown } 18605edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 186174ef644bSMatthew G. Knepley ++level; 186274ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 186374ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 186474ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 186574ef644bSMatthew G. Knepley else {numPoints = 0;} 186674ef644bSMatthew G. Knepley } 186774ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 186874ef644bSMatthew G. Knepley } 1869552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1870552f7358SJed Brown PetscFunctionReturn(0); 1871552f7358SJed Brown } 1872552f7358SJed Brown 1873552f7358SJed Brown #undef __FUNCT__ 1874552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1875552f7358SJed Brown /*@C 1876552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1877552f7358SJed Brown 1878552f7358SJed Brown Not Collective 1879552f7358SJed Brown 1880552f7358SJed Brown Input Parameters: 1881552f7358SJed Brown + dm - The DMPlex object 1882552f7358SJed Brown . numPoints - The number of input points for the join 1883552f7358SJed Brown - points - The input points 1884552f7358SJed Brown 1885552f7358SJed Brown Output Parameters: 1886552f7358SJed Brown + numCoveredPoints - The number of points in the join 1887552f7358SJed Brown - coveredPoints - The points in the join 1888552f7358SJed Brown 1889552f7358SJed Brown Level: intermediate 1890552f7358SJed Brown 1891552f7358SJed Brown Note: Currently, this is restricted to a single level join 1892552f7358SJed Brown 18933813dfbdSMatthew G Knepley Fortran Notes: 18943813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18953813dfbdSMatthew G Knepley include petsc.h90 in your code. 18963813dfbdSMatthew G Knepley 18973813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18983813dfbdSMatthew G Knepley 1899552f7358SJed Brown .keywords: mesh 1900552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1901552f7358SJed Brown @*/ 1902552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1903552f7358SJed Brown { 1904552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1905552f7358SJed Brown PetscInt *join[2]; 1906552f7358SJed Brown PetscInt joinSize, i = 0; 1907552f7358SJed Brown PetscInt dof, off, p, c, m; 1908552f7358SJed Brown PetscErrorCode ierr; 1909552f7358SJed Brown 1910552f7358SJed Brown PetscFunctionBegin; 1911552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1912552f7358SJed Brown PetscValidPointer(points, 2); 1913552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1914552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1915552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1916552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1917552f7358SJed Brown /* Copy in support of first point */ 1918552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1919552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1920552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1921552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1922552f7358SJed Brown } 1923552f7358SJed Brown /* Check each successive support */ 1924552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1925552f7358SJed Brown PetscInt newJoinSize = 0; 1926552f7358SJed Brown 1927552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1928552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1929552f7358SJed Brown for (c = 0; c < dof; ++c) { 1930552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1931552f7358SJed Brown 1932552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1933552f7358SJed Brown if (point == join[i][m]) { 1934552f7358SJed Brown join[1-i][newJoinSize++] = point; 1935552f7358SJed Brown break; 1936552f7358SJed Brown } 1937552f7358SJed Brown } 1938552f7358SJed Brown } 1939552f7358SJed Brown joinSize = newJoinSize; 1940552f7358SJed Brown i = 1-i; 1941552f7358SJed Brown } 1942552f7358SJed Brown *numCoveredPoints = joinSize; 1943552f7358SJed Brown *coveredPoints = join[i]; 1944552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1945552f7358SJed Brown PetscFunctionReturn(0); 1946552f7358SJed Brown } 1947552f7358SJed Brown 1948552f7358SJed Brown #undef __FUNCT__ 1949552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1950552f7358SJed Brown /*@C 1951552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1952552f7358SJed Brown 1953552f7358SJed Brown Not Collective 1954552f7358SJed Brown 1955552f7358SJed Brown Input Parameters: 1956552f7358SJed Brown + dm - The DMPlex object 1957552f7358SJed Brown . numPoints - The number of input points for the join 1958552f7358SJed Brown - points - The input points 1959552f7358SJed Brown 1960552f7358SJed Brown Output Parameters: 1961552f7358SJed Brown + numCoveredPoints - The number of points in the join 1962552f7358SJed Brown - coveredPoints - The points in the join 1963552f7358SJed Brown 19643813dfbdSMatthew G Knepley Fortran Notes: 19653813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19663813dfbdSMatthew G Knepley include petsc.h90 in your code. 19673813dfbdSMatthew G Knepley 19683813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19693813dfbdSMatthew G Knepley 1970552f7358SJed Brown Level: intermediate 1971552f7358SJed Brown 1972552f7358SJed Brown .keywords: mesh 1973552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1974552f7358SJed Brown @*/ 1975552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1976552f7358SJed Brown { 1977552f7358SJed Brown PetscErrorCode ierr; 1978552f7358SJed Brown 1979552f7358SJed Brown PetscFunctionBegin; 1980552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1981d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1982d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1983d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1984552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1985d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1986552f7358SJed Brown PetscFunctionReturn(0); 1987552f7358SJed Brown } 1988552f7358SJed Brown 1989552f7358SJed Brown #undef __FUNCT__ 1990552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1991552f7358SJed Brown /*@C 1992552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1993552f7358SJed Brown 1994552f7358SJed Brown Not Collective 1995552f7358SJed Brown 1996552f7358SJed Brown Input Parameters: 1997552f7358SJed Brown + dm - The DMPlex object 1998552f7358SJed Brown . numPoints - The number of input points for the join 1999552f7358SJed Brown - points - The input points 2000552f7358SJed Brown 2001552f7358SJed Brown Output Parameters: 2002552f7358SJed Brown + numCoveredPoints - The number of points in the join 2003552f7358SJed Brown - coveredPoints - The points in the join 2004552f7358SJed Brown 20053813dfbdSMatthew G Knepley Fortran Notes: 20063813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20073813dfbdSMatthew G Knepley include petsc.h90 in your code. 20083813dfbdSMatthew G Knepley 20093813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20103813dfbdSMatthew G Knepley 2011552f7358SJed Brown Level: intermediate 2012552f7358SJed Brown 2013552f7358SJed Brown .keywords: mesh 2014552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 2015552f7358SJed Brown @*/ 2016552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2017552f7358SJed Brown { 2018552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2019552f7358SJed Brown PetscInt *offsets, **closures; 2020552f7358SJed Brown PetscInt *join[2]; 2021552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 202224c766afSToby Isaac PetscInt p, d, c, m, ms; 2023552f7358SJed Brown PetscErrorCode ierr; 2024552f7358SJed Brown 2025552f7358SJed Brown PetscFunctionBegin; 2026552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2027552f7358SJed Brown PetscValidPointer(points, 2); 2028552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2029552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2030552f7358SJed Brown 2031552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 20321795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 2033552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 203424c766afSToby Isaac ms = mesh->maxSupportSize; 203524c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 2036552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 2037552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 2038552f7358SJed Brown 2039552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2040552f7358SJed Brown PetscInt closureSize; 2041552f7358SJed Brown 2042552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 20430d644c17SKarl Rupp 2044552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 2045552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2046552f7358SJed Brown PetscInt pStart, pEnd, i; 2047552f7358SJed Brown 2048552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 2049552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 2050552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2051552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 2052552f7358SJed Brown break; 2053552f7358SJed Brown } 2054552f7358SJed Brown } 2055552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 2056552f7358SJed Brown } 205782f516ccSBarry 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); 2058552f7358SJed Brown } 2059552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2060552f7358SJed Brown PetscInt dof; 2061552f7358SJed Brown 2062552f7358SJed Brown /* Copy in support of first point */ 2063552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 2064552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 2065552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 2066552f7358SJed Brown } 2067552f7358SJed Brown /* Check each successive cone */ 2068552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 2069552f7358SJed Brown PetscInt newJoinSize = 0; 2070552f7358SJed Brown 2071552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 2072552f7358SJed Brown for (c = 0; c < dof; ++c) { 2073552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 2074552f7358SJed Brown 2075552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 2076552f7358SJed Brown if (point == join[i][m]) { 2077552f7358SJed Brown join[1-i][newJoinSize++] = point; 2078552f7358SJed Brown break; 2079552f7358SJed Brown } 2080552f7358SJed Brown } 2081552f7358SJed Brown } 2082552f7358SJed Brown joinSize = newJoinSize; 2083552f7358SJed Brown i = 1-i; 2084552f7358SJed Brown } 2085552f7358SJed Brown if (joinSize) break; 2086552f7358SJed Brown } 2087552f7358SJed Brown *numCoveredPoints = joinSize; 2088552f7358SJed Brown *coveredPoints = join[i]; 2089552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20900298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 2091552f7358SJed Brown } 2092552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2093552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2094552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 2095552f7358SJed Brown PetscFunctionReturn(0); 2096552f7358SJed Brown } 2097552f7358SJed Brown 2098552f7358SJed Brown #undef __FUNCT__ 2099552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 2100552f7358SJed Brown /*@C 2101552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 2102552f7358SJed Brown 2103552f7358SJed Brown Not Collective 2104552f7358SJed Brown 2105552f7358SJed Brown Input Parameters: 2106552f7358SJed Brown + dm - The DMPlex object 2107552f7358SJed Brown . numPoints - The number of input points for the meet 2108552f7358SJed Brown - points - The input points 2109552f7358SJed Brown 2110552f7358SJed Brown Output Parameters: 2111552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2112552f7358SJed Brown - coveredPoints - The points in the meet 2113552f7358SJed Brown 2114552f7358SJed Brown Level: intermediate 2115552f7358SJed Brown 2116552f7358SJed Brown Note: Currently, this is restricted to a single level meet 2117552f7358SJed Brown 21183813dfbdSMatthew G Knepley Fortran Notes: 21193813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21203813dfbdSMatthew G Knepley include petsc.h90 in your code. 21213813dfbdSMatthew G Knepley 21223813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21233813dfbdSMatthew G Knepley 2124552f7358SJed Brown .keywords: mesh 2125552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 2126552f7358SJed Brown @*/ 2127552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 2128552f7358SJed Brown { 2129552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2130552f7358SJed Brown PetscInt *meet[2]; 2131552f7358SJed Brown PetscInt meetSize, i = 0; 2132552f7358SJed Brown PetscInt dof, off, p, c, m; 2133552f7358SJed Brown PetscErrorCode ierr; 2134552f7358SJed Brown 2135552f7358SJed Brown PetscFunctionBegin; 2136552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2137552f7358SJed Brown PetscValidPointer(points, 2); 2138552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2139552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2140552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2141552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2142552f7358SJed Brown /* Copy in cone of first point */ 2143552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2144552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2145552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2146552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2147552f7358SJed Brown } 2148552f7358SJed Brown /* Check each successive cone */ 2149552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2150552f7358SJed Brown PetscInt newMeetSize = 0; 2151552f7358SJed Brown 2152552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2153552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2154552f7358SJed Brown for (c = 0; c < dof; ++c) { 2155552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2156552f7358SJed Brown 2157552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2158552f7358SJed Brown if (point == meet[i][m]) { 2159552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2160552f7358SJed Brown break; 2161552f7358SJed Brown } 2162552f7358SJed Brown } 2163552f7358SJed Brown } 2164552f7358SJed Brown meetSize = newMeetSize; 2165552f7358SJed Brown i = 1-i; 2166552f7358SJed Brown } 2167552f7358SJed Brown *numCoveringPoints = meetSize; 2168552f7358SJed Brown *coveringPoints = meet[i]; 2169552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2170552f7358SJed Brown PetscFunctionReturn(0); 2171552f7358SJed Brown } 2172552f7358SJed Brown 2173552f7358SJed Brown #undef __FUNCT__ 2174552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2175552f7358SJed Brown /*@C 2176552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2177552f7358SJed Brown 2178552f7358SJed Brown Not Collective 2179552f7358SJed Brown 2180552f7358SJed Brown Input Parameters: 2181552f7358SJed Brown + dm - The DMPlex object 2182552f7358SJed Brown . numPoints - The number of input points for the meet 2183552f7358SJed Brown - points - The input points 2184552f7358SJed Brown 2185552f7358SJed Brown Output Parameters: 2186552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2187552f7358SJed Brown - coveredPoints - The points in the meet 2188552f7358SJed Brown 2189552f7358SJed Brown Level: intermediate 2190552f7358SJed Brown 21913813dfbdSMatthew G Knepley Fortran Notes: 21923813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21933813dfbdSMatthew G Knepley include petsc.h90 in your code. 21943813dfbdSMatthew G Knepley 21953813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21963813dfbdSMatthew G Knepley 2197552f7358SJed Brown .keywords: mesh 2198552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2199552f7358SJed Brown @*/ 2200552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2201552f7358SJed Brown { 2202552f7358SJed Brown PetscErrorCode ierr; 2203552f7358SJed Brown 2204552f7358SJed Brown PetscFunctionBegin; 2205552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2206d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2207d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2208d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2209552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2210d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2211552f7358SJed Brown PetscFunctionReturn(0); 2212552f7358SJed Brown } 2213552f7358SJed Brown 2214552f7358SJed Brown #undef __FUNCT__ 2215552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2216552f7358SJed Brown /*@C 2217552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2218552f7358SJed Brown 2219552f7358SJed Brown Not Collective 2220552f7358SJed Brown 2221552f7358SJed Brown Input Parameters: 2222552f7358SJed Brown + dm - The DMPlex object 2223552f7358SJed Brown . numPoints - The number of input points for the meet 2224552f7358SJed Brown - points - The input points 2225552f7358SJed Brown 2226552f7358SJed Brown Output Parameters: 2227552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2228552f7358SJed Brown - coveredPoints - The points in the meet 2229552f7358SJed Brown 2230552f7358SJed Brown Level: intermediate 2231552f7358SJed Brown 22323813dfbdSMatthew G Knepley Fortran Notes: 22333813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 22343813dfbdSMatthew G Knepley include petsc.h90 in your code. 22353813dfbdSMatthew G Knepley 22363813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 22373813dfbdSMatthew G Knepley 2238552f7358SJed Brown .keywords: mesh 2239552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2240552f7358SJed Brown @*/ 2241552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2242552f7358SJed Brown { 2243552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2244552f7358SJed Brown PetscInt *offsets, **closures; 2245552f7358SJed Brown PetscInt *meet[2]; 2246552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 224724c766afSToby Isaac PetscInt p, h, c, m, mc; 2248552f7358SJed Brown PetscErrorCode ierr; 2249552f7358SJed Brown 2250552f7358SJed Brown PetscFunctionBegin; 2251552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2252552f7358SJed Brown PetscValidPointer(points, 2); 2253552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2254552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2255552f7358SJed Brown 2256552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2257785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2258552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 225924c766afSToby Isaac mc = mesh->maxConeSize; 226024c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2261552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2262552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2263552f7358SJed Brown 2264552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2265552f7358SJed Brown PetscInt closureSize; 2266552f7358SJed Brown 2267552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 22680d644c17SKarl Rupp 2269552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2270552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2271552f7358SJed Brown PetscInt pStart, pEnd, i; 2272552f7358SJed Brown 2273552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2274552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2275552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2276552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2277552f7358SJed Brown break; 2278552f7358SJed Brown } 2279552f7358SJed Brown } 2280552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2281552f7358SJed Brown } 228282f516ccSBarry 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); 2283552f7358SJed Brown } 2284552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2285552f7358SJed Brown PetscInt dof; 2286552f7358SJed Brown 2287552f7358SJed Brown /* Copy in cone of first point */ 2288552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2289552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2290552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2291552f7358SJed Brown } 2292552f7358SJed Brown /* Check each successive cone */ 2293552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2294552f7358SJed Brown PetscInt newMeetSize = 0; 2295552f7358SJed Brown 2296552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2297552f7358SJed Brown for (c = 0; c < dof; ++c) { 2298552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2299552f7358SJed Brown 2300552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2301552f7358SJed Brown if (point == meet[i][m]) { 2302552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2303552f7358SJed Brown break; 2304552f7358SJed Brown } 2305552f7358SJed Brown } 2306552f7358SJed Brown } 2307552f7358SJed Brown meetSize = newMeetSize; 2308552f7358SJed Brown i = 1-i; 2309552f7358SJed Brown } 2310552f7358SJed Brown if (meetSize) break; 2311552f7358SJed Brown } 2312552f7358SJed Brown *numCoveredPoints = meetSize; 2313552f7358SJed Brown *coveredPoints = meet[i]; 2314552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 23150298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2316552f7358SJed Brown } 2317552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2318552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2319552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2320552f7358SJed Brown PetscFunctionReturn(0); 2321552f7358SJed Brown } 2322552f7358SJed Brown 2323552f7358SJed Brown #undef __FUNCT__ 23244e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 23254e3744c5SMatthew G. Knepley /*@C 23264e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 23274e3744c5SMatthew G. Knepley 23284e3744c5SMatthew G. Knepley Not Collective 23294e3744c5SMatthew G. Knepley 23304e3744c5SMatthew G. Knepley Input Parameters: 23314e3744c5SMatthew G. Knepley + dmA - A DMPlex object 23324e3744c5SMatthew G. Knepley - dmB - A DMPlex object 23334e3744c5SMatthew G. Knepley 23344e3744c5SMatthew G. Knepley Output Parameters: 23354e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 23364e3744c5SMatthew G. Knepley 23374e3744c5SMatthew G. Knepley Level: intermediate 23384e3744c5SMatthew G. Knepley 23394e3744c5SMatthew G. Knepley Notes: 23404e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 23414e3744c5SMatthew G. Knepley 23424e3744c5SMatthew G. Knepley .keywords: mesh 23434e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 23444e3744c5SMatthew G. Knepley @*/ 23454e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 23464e3744c5SMatthew G. Knepley { 23474e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 23484e3744c5SMatthew G. Knepley PetscErrorCode ierr; 23494e3744c5SMatthew G. Knepley 23504e3744c5SMatthew G. Knepley PetscFunctionBegin; 23514e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 23524e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 23534e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 23544e3744c5SMatthew G. Knepley 23554e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 23564e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 23574e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 23584e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 23594e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 23604e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 23614e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 23624e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 23634e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 23644e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 23654e3744c5SMatthew G. Knepley 23664e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 23674e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 23684e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 23694e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 23704e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 23714e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 23724e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 23734e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 23744e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 23754e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 23764e3744c5SMatthew G. Knepley } 23774e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 23784e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 23794e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 23804e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 23814e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 23824e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 23834e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 23844e3744c5SMatthew G. Knepley } 23854e3744c5SMatthew G. Knepley } 23864e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 23874e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 23884e3744c5SMatthew G. Knepley } 23894e3744c5SMatthew G. Knepley 23904e3744c5SMatthew G. Knepley #undef __FUNCT__ 239118ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 239218ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2393a6dfd86eSKarl Rupp { 239482f516ccSBarry Smith MPI_Comm comm; 2395552f7358SJed Brown PetscErrorCode ierr; 2396552f7358SJed Brown 2397552f7358SJed Brown PetscFunctionBegin; 239882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2399552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2400552f7358SJed Brown switch (cellDim) { 2401552f7358SJed Brown case 0: 2402552f7358SJed Brown *numFaceVertices = 0; 2403552f7358SJed Brown break; 2404552f7358SJed Brown case 1: 2405552f7358SJed Brown *numFaceVertices = 1; 2406552f7358SJed Brown break; 2407552f7358SJed Brown case 2: 2408552f7358SJed Brown switch (numCorners) { 240919436ca2SJed Brown case 3: /* triangle */ 241019436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2411552f7358SJed Brown break; 241219436ca2SJed Brown case 4: /* quadrilateral */ 241319436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2414552f7358SJed Brown break; 241519436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 241619436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2417552f7358SJed Brown break; 241819436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 241919436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2420552f7358SJed Brown break; 2421552f7358SJed Brown default: 2422552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2423552f7358SJed Brown } 2424552f7358SJed Brown break; 2425552f7358SJed Brown case 3: 2426552f7358SJed Brown switch (numCorners) { 242719436ca2SJed Brown case 4: /* tetradehdron */ 242819436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2429552f7358SJed Brown break; 243019436ca2SJed Brown case 6: /* tet cohesive cells */ 243119436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2432552f7358SJed Brown break; 243319436ca2SJed Brown case 8: /* hexahedron */ 243419436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2435552f7358SJed Brown break; 243619436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 243719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2438552f7358SJed Brown break; 243919436ca2SJed Brown case 10: /* quadratic tetrahedron */ 244019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2441552f7358SJed Brown break; 244219436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 244319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2444552f7358SJed Brown break; 244519436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 244619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2447552f7358SJed Brown break; 244819436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 244919436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2450552f7358SJed Brown break; 2451552f7358SJed Brown default: 2452552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2453552f7358SJed Brown } 2454552f7358SJed Brown break; 2455552f7358SJed Brown default: 2456552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2457552f7358SJed Brown } 2458552f7358SJed Brown PetscFunctionReturn(0); 2459552f7358SJed Brown } 2460552f7358SJed Brown 2461552f7358SJed Brown #undef __FUNCT__ 2462f05c90a3SMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate" 2463f05c90a3SMatthew G. Knepley /*@ 2464f05c90a3SMatthew G. Knepley DMPlexLocalizeCoordinate - If a mesh is periodic (a torus with lengths L_i, some of which can be infinite), project the coordinate onto [0, L_i) in each dimension. 2465f05c90a3SMatthew G. Knepley 2466f05c90a3SMatthew G. Knepley Input Parameters: 2467f05c90a3SMatthew G. Knepley + dm - The DM 2468f05c90a3SMatthew G. Knepley - in - The input coordinate point (dim numbers) 2469f05c90a3SMatthew G. Knepley 2470f05c90a3SMatthew G. Knepley Output Parameter: 2471f05c90a3SMatthew G. Knepley . out - The localized coordinate point 2472f05c90a3SMatthew G. Knepley 2473f05c90a3SMatthew G. Knepley Level: developer 2474f05c90a3SMatthew G. Knepley 2475f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeAddCoordinate() 2476f05c90a3SMatthew G. Knepley @*/ 2477f05c90a3SMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate(DM dm, const PetscScalar in[], PetscScalar out[]) 2478f05c90a3SMatthew G. Knepley { 2479f05c90a3SMatthew G. Knepley PetscInt dim, d; 2480f05c90a3SMatthew G. Knepley PetscErrorCode ierr; 2481f05c90a3SMatthew G. Knepley 2482f05c90a3SMatthew G. Knepley PetscFunctionBegin; 2483f05c90a3SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 2484f05c90a3SMatthew G. Knepley if (!dm->maxCell) { 2485f05c90a3SMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2486f05c90a3SMatthew G. Knepley } else { 2487f05c90a3SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2488b61239a6SMatthew G. Knepley out[d] = in[d] - dm->L[d]*floor(PetscRealPart(in[d])/dm->L[d]); 2489f05c90a3SMatthew G. Knepley } 2490f05c90a3SMatthew G. Knepley } 2491f05c90a3SMatthew G. Knepley PetscFunctionReturn(0); 2492f05c90a3SMatthew G. Knepley } 2493f05c90a3SMatthew G. Knepley 2494f05c90a3SMatthew G. Knepley #undef __FUNCT__ 2495d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 2496f05c90a3SMatthew G. Knepley /* 2497f05c90a3SMatthew G. Knepley DMPlexLocalizeCoordinate_Internal - If a mesh is periodic, and the input point is far from the anchor, pick the coordinate sheet of the torus which moves it closer. 2498f05c90a3SMatthew G. Knepley 2499f05c90a3SMatthew G. Knepley Input Parameters: 2500f05c90a3SMatthew G. Knepley + dm - The DM 2501f05c90a3SMatthew G. Knepley . dim - The spatial dimension 2502f05c90a3SMatthew G. Knepley . anchor - The anchor point, the input point can be no more than maxCell away from it 2503f05c90a3SMatthew G. Knepley - in - The input coordinate point (dim numbers) 2504f05c90a3SMatthew G. Knepley 2505f05c90a3SMatthew G. Knepley Output Parameter: 2506f05c90a3SMatthew G. Knepley . out - The localized coordinate point 2507f05c90a3SMatthew G. Knepley 2508f05c90a3SMatthew G. Knepley Level: developer 2509f05c90a3SMatthew G. Knepley 2510f05c90a3SMatthew G. Knepley Note: This is meant to get a set of coordinates close to each other, as in a cell. The anchor is usually the one of the vertices on a containing cell 2511f05c90a3SMatthew G. Knepley 2512f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeAddCoordinate() 2513f05c90a3SMatthew G. Knepley */ 2514d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2515d49fcaecSMatthew G. Knepley { 2516d49fcaecSMatthew G. Knepley PetscInt d; 2517d49fcaecSMatthew G. Knepley 2518d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2519d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2520d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2521d49fcaecSMatthew G. Knepley } else { 2522d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2523d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2524858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2525d49fcaecSMatthew G. Knepley } else { 2526d49fcaecSMatthew G. Knepley out[d] = in[d]; 2527d49fcaecSMatthew G. Knepley } 2528d49fcaecSMatthew G. Knepley } 2529d49fcaecSMatthew G. Knepley } 2530d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2531d49fcaecSMatthew G. Knepley } 2532b88fe698SMatthew G. Knepley #undef __FUNCT__ 2533b88fe698SMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinateReal_Internal" 2534b61239a6SMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinateReal_Internal(DM dm, PetscInt dim, const PetscReal anchor[], const PetscReal in[], PetscReal out[]) 2535b61239a6SMatthew G. Knepley { 2536b61239a6SMatthew G. Knepley PetscInt d; 2537b61239a6SMatthew G. Knepley 2538b61239a6SMatthew G. Knepley PetscFunctionBegin; 2539b61239a6SMatthew G. Knepley if (!dm->maxCell) { 2540b61239a6SMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2541b61239a6SMatthew G. Knepley } else { 2542b61239a6SMatthew G. Knepley for (d = 0; d < dim; ++d) { 25434cae2477SMatthew G. Knepley if (PetscAbsReal(anchor[d] - in[d]) > dm->maxCell[d]) { 2544b61239a6SMatthew G. Knepley out[d] = anchor[d] > in[d] ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2545b61239a6SMatthew G. Knepley } else { 2546b61239a6SMatthew G. Knepley out[d] = in[d]; 2547b61239a6SMatthew G. Knepley } 2548b61239a6SMatthew G. Knepley } 2549b61239a6SMatthew G. Knepley } 2550b61239a6SMatthew G. Knepley PetscFunctionReturn(0); 2551b61239a6SMatthew G. Knepley } 2552d49fcaecSMatthew G. Knepley 2553d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2554d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 2555f05c90a3SMatthew G. Knepley /* 2556f05c90a3SMatthew G. Knepley DMPlexLocalizeAddCoordinate_Internal - If a mesh is periodic, and the input point is far from the anchor, pick the coordinate sheet of the torus which moves it closer. 2557f05c90a3SMatthew G. Knepley 2558f05c90a3SMatthew G. Knepley Input Parameters: 2559f05c90a3SMatthew G. Knepley + dm - The DM 2560f05c90a3SMatthew G. Knepley . dim - The spatial dimension 2561f05c90a3SMatthew G. Knepley . anchor - The anchor point, the input point can be no more than maxCell away from it 2562f05c90a3SMatthew G. Knepley . in - The input coordinate delta (dim numbers) 2563f05c90a3SMatthew G. Knepley - out - The input coordinate point (dim numbers) 2564f05c90a3SMatthew G. Knepley 2565f05c90a3SMatthew G. Knepley Output Parameter: 2566f05c90a3SMatthew G. Knepley . out - The localized coordinate in + out 2567f05c90a3SMatthew G. Knepley 2568f05c90a3SMatthew G. Knepley Level: developer 2569f05c90a3SMatthew G. Knepley 2570f05c90a3SMatthew G. Knepley Note: This is meant to get a set of coordinates close to each other, as in a cell. The anchor is usually the one of the vertices on a containing cell 2571f05c90a3SMatthew G. Knepley 2572f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeCoordinate() 2573f05c90a3SMatthew G. Knepley */ 2574d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2575d49fcaecSMatthew G. Knepley { 2576d49fcaecSMatthew G. Knepley PetscInt d; 2577d49fcaecSMatthew G. Knepley 2578d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2579d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2580d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 2581d49fcaecSMatthew G. Knepley } else { 2582d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2583d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2584858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2585d49fcaecSMatthew G. Knepley } else { 2586d49fcaecSMatthew G. Knepley out[d] += in[d]; 2587d49fcaecSMatthew G. Knepley } 2588d49fcaecSMatthew G. Knepley } 2589d49fcaecSMatthew G. Knepley } 2590d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2591d49fcaecSMatthew G. Knepley } 2592d49fcaecSMatthew G. Knepley 2593d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2594d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 2595f05c90a3SMatthew G. Knepley /*@ 2596f05c90a3SMatthew G. Knepley DMPlexLocalizeCoordinates - If a mesh is periodic, create local coordinates for each cell 2597f05c90a3SMatthew G. Knepley 2598f05c90a3SMatthew G. Knepley Input Parameter: 2599f05c90a3SMatthew G. Knepley . dm - The DM 2600f05c90a3SMatthew G. Knepley 2601f05c90a3SMatthew G. Knepley Level: developer 2602f05c90a3SMatthew G. Knepley 2603f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinate(), DMPlexLocalizeAddCoordinate() 2604f05c90a3SMatthew G. Knepley @*/ 2605d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 2606d49fcaecSMatthew G. Knepley { 2607d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 2608d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 2609d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 26108c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 2611d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 2612d49fcaecSMatthew G. Knepley 2613d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2614d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2615d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 2616d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2617d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2618d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2619d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2620d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 26218c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 26228c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 26238c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 2624d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 2625d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2626d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2627d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 26288c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 2629d49fcaecSMatthew G. Knepley } 2630d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2631d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 2632d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 26338c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 2634d49fcaecSMatthew G. Knepley } 2635d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 2636d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 2637d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 2638d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 2639d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 2640d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2641d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 2642d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2643d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 2644d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2645d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2646d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2647d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 2648d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 2649d49fcaecSMatthew G. Knepley } 2650d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2651d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2652d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 2653d49fcaecSMatthew G. Knepley PetscInt b; 2654d49fcaecSMatthew G. Knepley 2655d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2656d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 2657d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 2658d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 2659d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2660d49fcaecSMatthew G. Knepley } 2661d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2662d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2663d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 266446e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 2665d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 2666d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 2667d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 2668d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2669d49fcaecSMatthew G. Knepley } 2670d49fcaecSMatthew G. Knepley 2671d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2672aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 2673552f7358SJed Brown /*@ 2674aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 2675552f7358SJed Brown 2676552f7358SJed Brown Not Collective 2677552f7358SJed Brown 2678aa50250dSMatthew G. Knepley Input Parameter: 2679552f7358SJed Brown . dm - The DMPlex object 2680552f7358SJed Brown 2681aa50250dSMatthew G. Knepley Output Parameter: 2682aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 2683552f7358SJed Brown 2684552f7358SJed Brown Level: developer 2685552f7358SJed Brown 2686aa50250dSMatthew G. Knepley .keywords: mesh, points 2687aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2688aa50250dSMatthew G. Knepley @*/ 2689aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 2690aa50250dSMatthew G. Knepley { 2691aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2692aa50250dSMatthew G. Knepley PetscErrorCode ierr; 2693aa50250dSMatthew G. Knepley 2694aa50250dSMatthew G. Knepley PetscFunctionBegin; 2695aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2696aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 269763d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 2698aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 2699aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 2700aa50250dSMatthew G. Knepley } 2701aa50250dSMatthew G. Knepley 2702aa50250dSMatthew G. Knepley #undef __FUNCT__ 2703aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 2704aa50250dSMatthew G. Knepley /*@ 2705aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 2706aa50250dSMatthew G. Knepley 2707aa50250dSMatthew G. Knepley Not Collective 2708aa50250dSMatthew G. Knepley 2709aa50250dSMatthew G. Knepley Input Parameter: 2710aa50250dSMatthew G. Knepley . dm - The DMPlex object 2711aa50250dSMatthew G. Knepley 2712aa50250dSMatthew G. Knepley Output Parameter: 2713aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 2714aa50250dSMatthew G. Knepley 2715aa50250dSMatthew G. Knepley Level: developer 2716552f7358SJed Brown 2717552f7358SJed Brown .keywords: mesh, points 2718aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2719552f7358SJed Brown @*/ 2720552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 2721552f7358SJed Brown { 2722aa50250dSMatthew G. Knepley DMLabel label; 2723aa50250dSMatthew G. Knepley PetscInt d = 0; 2724552f7358SJed Brown PetscErrorCode ierr; 2725552f7358SJed Brown 2726552f7358SJed Brown PetscFunctionBegin; 2727552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2728552f7358SJed Brown PetscValidPointer(depth, 2); 2729aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2730aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 2731552f7358SJed Brown *depth = d-1; 2732552f7358SJed Brown PetscFunctionReturn(0); 2733552f7358SJed Brown } 2734552f7358SJed Brown 2735552f7358SJed Brown #undef __FUNCT__ 2736552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 2737552f7358SJed Brown /*@ 2738552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 2739552f7358SJed Brown 2740552f7358SJed Brown Not Collective 2741552f7358SJed Brown 2742552f7358SJed Brown Input Parameters: 2743552f7358SJed Brown + dm - The DMPlex object 2744552f7358SJed Brown - stratumValue - The requested depth 2745552f7358SJed Brown 2746552f7358SJed Brown Output Parameters: 2747552f7358SJed Brown + start - The first point at this depth 2748552f7358SJed Brown - end - One beyond the last point at this depth 2749552f7358SJed Brown 2750552f7358SJed Brown Level: developer 2751552f7358SJed Brown 2752552f7358SJed Brown .keywords: mesh, points 2753552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 2754552f7358SJed Brown @*/ 27550adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 27560adebc6cSBarry Smith { 2757aa50250dSMatthew G. Knepley DMLabel label; 275863d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 2759552f7358SJed Brown PetscErrorCode ierr; 2760552f7358SJed Brown 2761552f7358SJed Brown PetscFunctionBegin; 2762552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 276363d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 276463d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2765552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 27660d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 276763d1a920SMatthew G. Knepley if (stratumValue < 0) { 276863d1a920SMatthew G. Knepley if (start) *start = pStart; 276963d1a920SMatthew G. Knepley if (end) *end = pEnd; 277063d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2771552f7358SJed Brown } 2772aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 277363d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 277463d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 2775552f7358SJed Brown PetscFunctionReturn(0); 2776552f7358SJed Brown } 2777552f7358SJed Brown 2778552f7358SJed Brown #undef __FUNCT__ 2779552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 2780552f7358SJed Brown /*@ 2781552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 2782552f7358SJed Brown 2783552f7358SJed Brown Not Collective 2784552f7358SJed Brown 2785552f7358SJed Brown Input Parameters: 2786552f7358SJed Brown + dm - The DMPlex object 2787552f7358SJed Brown - stratumValue - The requested height 2788552f7358SJed Brown 2789552f7358SJed Brown Output Parameters: 2790552f7358SJed Brown + start - The first point at this height 2791552f7358SJed Brown - end - One beyond the last point at this height 2792552f7358SJed Brown 2793552f7358SJed Brown Level: developer 2794552f7358SJed Brown 2795552f7358SJed Brown .keywords: mesh, points 2796552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 2797552f7358SJed Brown @*/ 27980adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 27990adebc6cSBarry Smith { 2800aa50250dSMatthew G. Knepley DMLabel label; 280163d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 2802552f7358SJed Brown PetscErrorCode ierr; 2803552f7358SJed Brown 2804552f7358SJed Brown PetscFunctionBegin; 2805552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 280663d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 280763d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2808552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 28090d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 281063d1a920SMatthew G. Knepley if (stratumValue < 0) { 281163d1a920SMatthew G. Knepley if (start) *start = pStart; 281263d1a920SMatthew G. Knepley if (end) *end = pEnd; 281363d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2814552f7358SJed Brown } 2815aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2816aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 281763d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 281863d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 2819552f7358SJed Brown PetscFunctionReturn(0); 2820552f7358SJed Brown } 2821552f7358SJed Brown 2822552f7358SJed Brown #undef __FUNCT__ 2823552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 2824552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 2825a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 2826a6dfd86eSKarl Rupp { 2827ee55978aSMatthew G. Knepley PetscInt *pMax; 2828916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 2829ee55978aSMatthew G. Knepley PetscInt Nf, p, d, dep, f; 2830fa716be8SMatthew G. Knepley PetscBool *isFE; 2831552f7358SJed Brown PetscErrorCode ierr; 2832552f7358SJed Brown 2833552f7358SJed Brown PetscFunctionBegin; 2834fa716be8SMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 2835ee55978aSMatthew G. Knepley ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr); 2836fa716be8SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 2837fa716be8SMatthew G. Knepley PetscObject obj; 2838fa716be8SMatthew G. Knepley PetscClassId id; 2839fa716be8SMatthew G. Knepley 2840ee55978aSMatthew G. Knepley isFE[f] = PETSC_FALSE; 2841ee55978aSMatthew G. Knepley if (f >= Nf) continue; 2842fa716be8SMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 2843fa716be8SMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 2844fa716be8SMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 2845fa716be8SMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 2846552f7358SJed Brown } 284782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2848552f7358SJed Brown if (numFields > 0) { 2849552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 2850552f7358SJed Brown if (numComp) { 2851552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2852552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 2853552f7358SJed Brown } 2854552f7358SJed Brown } 2855552f7358SJed Brown } 2856552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2857552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 2858916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 28599ac3fadcSMatthew G. Knepley ierr = PetscMalloc1(depth+1,&pMax);CHKERRQ(ierr); 28609ac3fadcSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr); 2861916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 2862916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 2863916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 2864fa716be8SMatthew G. Knepley pMax[dep] = pMax[dep] < 0 ? pEnd : pMax[dep]; 2865552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2866ee55978aSMatthew G. Knepley PetscInt tot = 0; 2867ee55978aSMatthew G. Knepley 2868552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2869fa716be8SMatthew G. Knepley if (isFE[f] && p >= pMax[dep]) continue; 2870552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 2871ee55978aSMatthew G. Knepley tot += numDof[f*(dim+1)+d]; 2872552f7358SJed Brown } 2873ee55978aSMatthew G. Knepley ierr = PetscSectionSetDof(*section, p, tot);CHKERRQ(ierr); 2874552f7358SJed Brown } 2875552f7358SJed Brown } 28769ac3fadcSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 2877fa716be8SMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 2878552f7358SJed Brown PetscFunctionReturn(0); 2879552f7358SJed Brown } 2880552f7358SJed Brown 2881552f7358SJed Brown #undef __FUNCT__ 2882552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 2883552f7358SJed Brown /* Set the number of dof on each point and separate by fields 2884552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 2885552f7358SJed Brown */ 2886a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 2887a6dfd86eSKarl Rupp { 2888552f7358SJed Brown PetscInt numFields; 2889552f7358SJed Brown PetscInt bc; 2890a68b90caSToby Isaac PetscSection aSec; 2891552f7358SJed Brown PetscErrorCode ierr; 2892552f7358SJed Brown 2893552f7358SJed Brown PetscFunctionBegin; 2894552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2895552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 2896552f7358SJed Brown PetscInt field = 0; 2897552f7358SJed Brown const PetscInt *idx; 2898552f7358SJed Brown PetscInt n, i; 2899552f7358SJed Brown 29000d644c17SKarl Rupp if (numFields) field = bcField[bc]; 2901552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2902552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2903552f7358SJed Brown for (i = 0; i < n; ++i) { 2904552f7358SJed Brown const PetscInt p = idx[i]; 2905552f7358SJed Brown PetscInt numConst = constDof; 2906552f7358SJed Brown 2907552f7358SJed Brown /* Constrain every dof on the point */ 2908552f7358SJed Brown if (numConst < 0) { 2909552f7358SJed Brown if (numFields) { 2910552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 2911552f7358SJed Brown } else { 2912552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 2913552f7358SJed Brown } 2914552f7358SJed Brown } 2915552f7358SJed Brown if (numFields) { 2916552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 2917552f7358SJed Brown } 2918552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 2919552f7358SJed Brown } 2920552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2921552f7358SJed Brown } 2922a17985deSToby Isaac ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 2923a68b90caSToby Isaac if (aSec) { 2924a68b90caSToby Isaac PetscInt aStart, aEnd, a; 2925a68b90caSToby Isaac 2926a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 2927a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 2928a68b90caSToby Isaac PetscInt dof; 2929a68b90caSToby Isaac 2930a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 2931a68b90caSToby Isaac if (dof) { 2932a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 2933a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 2934a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 2935a68b90caSToby Isaac if (numFields) { 2936a68b90caSToby Isaac PetscInt f; 2937a68b90caSToby Isaac 2938a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 2939a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 2940a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 2941a68b90caSToby Isaac } 2942a68b90caSToby Isaac } 2943a68b90caSToby Isaac } 2944a68b90caSToby Isaac } 2945a68b90caSToby Isaac } 2946552f7358SJed Brown PetscFunctionReturn(0); 2947552f7358SJed Brown } 2948552f7358SJed Brown 2949552f7358SJed Brown #undef __FUNCT__ 2950552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 2951552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 29520adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 29530adebc6cSBarry Smith { 2954552f7358SJed Brown PetscInt *maxConstraints; 2955552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 2956552f7358SJed Brown PetscErrorCode ierr; 2957552f7358SJed Brown 2958552f7358SJed Brown PetscFunctionBegin; 2959552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2960552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2961854ce69bSBarry Smith ierr = PetscMalloc1(numFields+1, &maxConstraints);CHKERRQ(ierr); 29620d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 2963552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2964552f7358SJed Brown PetscInt cdof; 2965552f7358SJed Brown 2966552f7358SJed Brown if (numFields) { 2967552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2968552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 2969552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 2970552f7358SJed Brown } 2971552f7358SJed Brown } else { 2972552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2973552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 2974552f7358SJed Brown } 2975552f7358SJed Brown } 2976552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2977552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 2978552f7358SJed Brown } 2979552f7358SJed Brown if (maxConstraints[numFields]) { 2980552f7358SJed Brown PetscInt *indices; 2981552f7358SJed Brown 2982785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 2983552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2984552f7358SJed Brown PetscInt cdof, d; 2985552f7358SJed Brown 2986552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2987552f7358SJed Brown if (cdof) { 2988552f7358SJed 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]); 2989552f7358SJed Brown if (numFields) { 2990552f7358SJed Brown PetscInt numConst = 0, foff = 0; 2991552f7358SJed Brown 2992552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2993552f7358SJed Brown PetscInt cfdof, fdof; 2994552f7358SJed Brown 2995552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 2996552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 2997552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 29980d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 2999552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 30000d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 3001552f7358SJed Brown numConst += cfdof; 3002552f7358SJed Brown foff += fdof; 3003552f7358SJed Brown } 3004552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3005552f7358SJed Brown } else { 30060d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 3007552f7358SJed Brown } 3008552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3009552f7358SJed Brown } 3010552f7358SJed Brown } 3011552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3012552f7358SJed Brown } 3013552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 3014552f7358SJed Brown PetscFunctionReturn(0); 3015552f7358SJed Brown } 3016552f7358SJed Brown 3017552f7358SJed Brown #undef __FUNCT__ 3018552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 3019552f7358SJed Brown /* Set the constrained field indices on each point */ 30200adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 30210adebc6cSBarry Smith { 3022552f7358SJed Brown const PetscInt *points, *indices; 3023552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 3024552f7358SJed Brown PetscErrorCode ierr; 3025552f7358SJed Brown 3026552f7358SJed Brown PetscFunctionBegin; 3027552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3028552f7358SJed 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); 3029552f7358SJed Brown 3030552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 3031552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 3032552f7358SJed Brown if (!constraintIndices) { 3033552f7358SJed Brown PetscInt *idx, i; 3034552f7358SJed Brown 3035552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3036785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 30370d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 3038552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3039552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 3040552f7358SJed Brown } 3041552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 3042552f7358SJed Brown } else { 3043552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 3044552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 3045552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3046552f7358SJed Brown PetscInt fcdof; 3047552f7358SJed Brown 3048552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 304982f516ccSBarry 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); 3050552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 3051552f7358SJed Brown } 3052552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 3053552f7358SJed Brown } 3054552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 3055552f7358SJed Brown PetscFunctionReturn(0); 3056552f7358SJed Brown } 3057552f7358SJed Brown 3058552f7358SJed Brown #undef __FUNCT__ 3059552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 3060552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 30610adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 30620adebc6cSBarry Smith { 3063552f7358SJed Brown PetscInt *indices; 3064552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 3065552f7358SJed Brown PetscErrorCode ierr; 3066552f7358SJed Brown 3067552f7358SJed Brown PetscFunctionBegin; 3068552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3069785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 3070552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 307182f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 3072552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3073552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3074552f7358SJed Brown PetscInt cdof, d; 3075552f7358SJed Brown 3076552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3077552f7358SJed Brown if (cdof) { 3078552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3079552f7358SJed Brown 3080552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3081552f7358SJed Brown const PetscInt *fcind; 3082552f7358SJed Brown PetscInt fdof, fcdof; 3083552f7358SJed Brown 3084552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3085552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 3086552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 3087552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 30880d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 3089552f7358SJed Brown foff += fdof; 3090552f7358SJed Brown numConst += fcdof; 3091552f7358SJed Brown } 309282f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3093552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3094552f7358SJed Brown } 3095552f7358SJed Brown } 3096552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3097552f7358SJed Brown PetscFunctionReturn(0); 3098552f7358SJed Brown } 3099552f7358SJed Brown 3100552f7358SJed Brown #undef __FUNCT__ 3101552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 3102552f7358SJed Brown /*@C 3103552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 3104552f7358SJed Brown 3105552f7358SJed Brown Not Collective 3106552f7358SJed Brown 3107552f7358SJed Brown Input Parameters: 3108552f7358SJed Brown + dm - The DMPlex object 3109552f7358SJed Brown . dim - The spatial dimension of the problem 3110552f7358SJed Brown . numFields - The number of fields in the problem 3111552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 3112552f7358SJed 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 3113552f7358SJed Brown . numBC - The number of boundary conditions 3114552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 3115f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 3116f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 3117552f7358SJed Brown 3118552f7358SJed Brown Output Parameter: 3119552f7358SJed Brown . section - The PetscSection object 3120552f7358SJed Brown 3121552f7358SJed 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 3122f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 3123f8f126e8SMatthew G. Knepley 3124f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 3125552f7358SJed Brown 3126552f7358SJed Brown Level: developer 3127552f7358SJed Brown 31283813dfbdSMatthew G Knepley Fortran Notes: 31293813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 31303813dfbdSMatthew G Knepley 3131552f7358SJed Brown .keywords: mesh, elements 3132f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 3133552f7358SJed Brown @*/ 3134f8f126e8SMatthew 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) 3135a6dfd86eSKarl Rupp { 3136a68b90caSToby Isaac PetscSection aSec; 3137552f7358SJed Brown PetscErrorCode ierr; 3138552f7358SJed Brown 3139552f7358SJed Brown PetscFunctionBegin; 3140552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 3141552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 3142f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 3143552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3144a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr); 3145a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 3146ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 3147552f7358SJed Brown PetscFunctionReturn(0); 3148552f7358SJed Brown } 3149552f7358SJed Brown 3150552f7358SJed Brown #undef __FUNCT__ 3151552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 31520adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 31530adebc6cSBarry Smith { 3154552f7358SJed Brown PetscSection section; 3155552f7358SJed Brown PetscErrorCode ierr; 3156552f7358SJed Brown 3157552f7358SJed Brown PetscFunctionBegin; 315838221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 315982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 3160552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 31611d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 3162552f7358SJed Brown PetscFunctionReturn(0); 3163552f7358SJed Brown } 3164552f7358SJed Brown 3165552f7358SJed Brown #undef __FUNCT__ 3166552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 31670adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 31680adebc6cSBarry Smith { 3169552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3170552f7358SJed Brown 3171552f7358SJed Brown PetscFunctionBegin; 3172552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3173552f7358SJed Brown if (section) *section = mesh->coneSection; 3174552f7358SJed Brown PetscFunctionReturn(0); 3175552f7358SJed Brown } 3176552f7358SJed Brown 3177552f7358SJed Brown #undef __FUNCT__ 31788cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 31798cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 31808cb4d582SMatthew G. Knepley { 31818cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 31828cb4d582SMatthew G. Knepley 31838cb4d582SMatthew G. Knepley PetscFunctionBegin; 31848cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 31858cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 31868cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 31878cb4d582SMatthew G. Knepley } 31888cb4d582SMatthew G. Knepley 31898cb4d582SMatthew G. Knepley #undef __FUNCT__ 3190552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 3191a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 3192a6dfd86eSKarl Rupp { 3193552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3194552f7358SJed Brown 3195552f7358SJed Brown PetscFunctionBegin; 3196552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3197552f7358SJed Brown if (cones) *cones = mesh->cones; 3198552f7358SJed Brown PetscFunctionReturn(0); 3199552f7358SJed Brown } 3200552f7358SJed Brown 3201552f7358SJed Brown #undef __FUNCT__ 3202552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 3203a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 3204a6dfd86eSKarl Rupp { 3205552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3206552f7358SJed Brown 3207552f7358SJed Brown PetscFunctionBegin; 3208552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3209552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 3210552f7358SJed Brown PetscFunctionReturn(0); 3211552f7358SJed Brown } 3212552f7358SJed Brown 3213552f7358SJed Brown /******************************** FEM Support **********************************/ 3214552f7358SJed Brown 3215552f7358SJed Brown #undef __FUNCT__ 32161a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 32171a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3218a6dfd86eSKarl Rupp { 3219552f7358SJed Brown PetscScalar *array, *vArray; 3220d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 32211a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 3222552f7358SJed Brown PetscErrorCode ierr; 3223552f7358SJed Brown 32241b406b76SMatthew G. Knepley PetscFunctionBeginHot; 32252a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 32265a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 32275a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 32285a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 32293f7cbbe7SMatthew G. Knepley if (!values || !*values) { 32309df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32319df71ca4SMatthew G. Knepley PetscInt dof; 3232d9917b9dSMatthew G. Knepley 32339df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32349df71ca4SMatthew G. Knepley size += dof; 32359df71ca4SMatthew G. Knepley } 32369df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32379df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32382a3aaacfSMatthew G. Knepley PetscInt dof; 32395a1bb5cfSMatthew G. Knepley 32405a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32412a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32425a1bb5cfSMatthew G. Knepley size += dof; 32435a1bb5cfSMatthew G. Knepley } 32443f7cbbe7SMatthew G. Knepley if (!values) { 32453f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 32463f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 32473f7cbbe7SMatthew G. Knepley } 32485a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 3249982e9ed1SMatthew G. Knepley } else { 3250982e9ed1SMatthew G. Knepley array = *values; 3251982e9ed1SMatthew G. Knepley } 32529df71ca4SMatthew G. Knepley size = 0; 32535a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 32549df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32559df71ca4SMatthew G. Knepley PetscInt dof, off, d; 32569df71ca4SMatthew G. Knepley PetscScalar *varr; 3257d9917b9dSMatthew G. Knepley 32589df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32599df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 32609df71ca4SMatthew G. Knepley varr = &vArray[off]; 32611a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32621a271a75SMatthew G. Knepley array[offset] = varr[d]; 32639df71ca4SMatthew G. Knepley } 32649df71ca4SMatthew G. Knepley size += dof; 32659df71ca4SMatthew G. Knepley } 32669df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32679df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32689df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 32695a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 32705a1bb5cfSMatthew G. Knepley PetscScalar *varr; 32715a1bb5cfSMatthew G. Knepley 327252ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32735a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32745a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 32755a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 32765a1bb5cfSMatthew G. Knepley if (o >= 0) { 32771a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32781a271a75SMatthew G. Knepley array[offset] = varr[d]; 32795a1bb5cfSMatthew G. Knepley } 32805a1bb5cfSMatthew G. Knepley } else { 32811a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 32821a271a75SMatthew G. Knepley array[offset] = varr[d]; 32835a1bb5cfSMatthew G. Knepley } 32845a1bb5cfSMatthew G. Knepley } 32859df71ca4SMatthew G. Knepley size += dof; 32865a1bb5cfSMatthew G. Knepley } 32875a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 32889df71ca4SMatthew G. Knepley if (!*values) { 32895a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 32905a1bb5cfSMatthew G. Knepley *values = array; 32919df71ca4SMatthew G. Knepley } else { 32929df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 32938c312ff3SMatthew G. Knepley *csize = size; 32949df71ca4SMatthew G. Knepley } 32955a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 32965a1bb5cfSMatthew G. Knepley } 3297d9917b9dSMatthew G. Knepley 3298d9917b9dSMatthew G. Knepley #undef __FUNCT__ 32991a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 33001a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 33011a271a75SMatthew G. Knepley { 33021a271a75SMatthew G. Knepley PetscInt offset = 0, p; 33031a271a75SMatthew G. Knepley PetscErrorCode ierr; 33041a271a75SMatthew G. Knepley 33051a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3306fe02ba77SJed Brown *size = 0; 33071a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33081a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33091a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33101a271a75SMatthew G. Knepley PetscInt dof, off, d; 33111a271a75SMatthew G. Knepley const PetscScalar *varr; 33121a271a75SMatthew G. Knepley 33131a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 33141a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 33151a271a75SMatthew G. Knepley varr = &vArray[off]; 33161a271a75SMatthew G. Knepley if (o >= 0) { 33171a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 33181a271a75SMatthew G. Knepley } else { 33191a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 33201a271a75SMatthew G. Knepley } 33211a271a75SMatthew G. Knepley } 33221a271a75SMatthew G. Knepley *size = offset; 33231a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33241a271a75SMatthew G. Knepley } 33251a271a75SMatthew G. Knepley 33261a271a75SMatthew G. Knepley #undef __FUNCT__ 33271a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 33281a271a75SMatthew 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[]) 33291a271a75SMatthew G. Knepley { 33301a271a75SMatthew G. Knepley PetscInt offset = 0, f; 33311a271a75SMatthew G. Knepley PetscErrorCode ierr; 33321a271a75SMatthew G. Knepley 33331a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3334fe02ba77SJed Brown *size = 0; 33351a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 33361a271a75SMatthew G. Knepley PetscInt fcomp, p; 33371a271a75SMatthew G. Knepley 33381a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 33391a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33401a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33411a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33421a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 33431a271a75SMatthew G. Knepley const PetscScalar *varr; 33441a271a75SMatthew G. Knepley 33451a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 33461a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 33471a271a75SMatthew G. Knepley varr = &vArray[foff]; 33481a271a75SMatthew G. Knepley if (o >= 0) { 33491a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 33501a271a75SMatthew G. Knepley } else { 33511a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 33521a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 33531a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 33541a271a75SMatthew G. Knepley } 33551a271a75SMatthew G. Knepley } 33561a271a75SMatthew G. Knepley } 33571a271a75SMatthew G. Knepley } 33581a271a75SMatthew G. Knepley } 33591a271a75SMatthew G. Knepley *size = offset; 33601a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33611a271a75SMatthew G. Knepley } 33621a271a75SMatthew G. Knepley 33631a271a75SMatthew G. Knepley #undef __FUNCT__ 3364552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 3365552f7358SJed Brown /*@C 3366552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 3367552f7358SJed Brown 3368552f7358SJed Brown Not collective 3369552f7358SJed Brown 3370552f7358SJed Brown Input Parameters: 3371552f7358SJed Brown + dm - The DM 3372552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 3373552f7358SJed Brown . v - The local vector 3374552f7358SJed Brown - point - The sieve point in the DM 3375552f7358SJed Brown 3376552f7358SJed Brown Output Parameters: 3377552f7358SJed Brown + csize - The number of values in the closure, or NULL 3378552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3379552f7358SJed Brown 3380552f7358SJed Brown Fortran Notes: 3381552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 3382552f7358SJed Brown include petsc.h90 in your code. 3383552f7358SJed Brown 3384552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 3385552f7358SJed Brown 3386552f7358SJed Brown Level: intermediate 3387552f7358SJed Brown 3388552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3389552f7358SJed Brown @*/ 3390552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3391552f7358SJed Brown { 3392552f7358SJed Brown PetscSection clSection; 3393d9917b9dSMatthew G. Knepley IS clPoints; 3394552f7358SJed Brown PetscScalar *array, *vArray; 3395552f7358SJed Brown PetscInt *points = NULL; 3396d9917b9dSMatthew G. Knepley const PetscInt *clp; 33971a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 3398552f7358SJed Brown PetscErrorCode ierr; 3399552f7358SJed Brown 3400d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 3401552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3402552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 34031a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 34041a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3405552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3406552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3407552f7358SJed Brown if (depth == 1 && numFields < 2) { 34081a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 3409552f7358SJed Brown PetscFunctionReturn(0); 3410552f7358SJed Brown } 34111a271a75SMatthew G. Knepley /* Get points */ 3412d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3413d9917b9dSMatthew G. Knepley if (!clPoints) { 34141a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 3415552f7358SJed Brown 34161a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3417552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3418552f7358SJed Brown /* Compress out points not in the section */ 3419552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3420552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3421552f7358SJed Brown points[q*2] = points[p]; 3422552f7358SJed Brown points[q*2+1] = points[p+1]; 3423552f7358SJed Brown ++q; 3424552f7358SJed Brown } 3425552f7358SJed Brown } 3426552f7358SJed Brown numPoints = q; 3427d9917b9dSMatthew G. Knepley } else { 3428d9917b9dSMatthew G. Knepley PetscInt dof, off; 3429552f7358SJed Brown 3430d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3431d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3432d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 34331a271a75SMatthew G. Knepley numPoints = dof/2; 3434d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3435552f7358SJed Brown } 34361a271a75SMatthew G. Knepley /* Get array */ 3437552f7358SJed Brown if (!values || !*values) { 34381a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 3439552f7358SJed Brown 34401a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3441552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 34421a271a75SMatthew G. Knepley asize += dof; 3443552f7358SJed Brown } 3444bd6c0d32SMatthew G. Knepley if (!values) { 3445d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34461a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34471a271a75SMatthew G. Knepley if (csize) *csize = asize; 3448bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 3449bd6c0d32SMatthew G. Knepley } 34501a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 3451d0f6b257SMatthew G. Knepley } else { 3452d0f6b257SMatthew G. Knepley array = *values; 3453d0f6b257SMatthew G. Knepley } 3454552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 34551a271a75SMatthew G. Knepley /* Get values */ 3456ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 34571a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 34581a271a75SMatthew G. Knepley /* Cleanup points */ 34591a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34601a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34611a271a75SMatthew G. Knepley /* Cleanup array */ 3462552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 3463d0f6b257SMatthew G. Knepley if (!*values) { 3464552f7358SJed Brown if (csize) *csize = size; 3465552f7358SJed Brown *values = array; 3466d0f6b257SMatthew G. Knepley } else { 3467d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 3468d0f6b257SMatthew G. Knepley *csize = size; 3469d0f6b257SMatthew G. Knepley } 3470552f7358SJed Brown PetscFunctionReturn(0); 3471552f7358SJed Brown } 3472552f7358SJed Brown 3473552f7358SJed Brown #undef __FUNCT__ 3474552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 3475552f7358SJed Brown /*@C 3476552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 3477552f7358SJed Brown 3478552f7358SJed Brown Not collective 3479552f7358SJed Brown 3480552f7358SJed Brown Input Parameters: 3481552f7358SJed Brown + dm - The DM 34820298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 3483552f7358SJed Brown . v - The local vector 3484552f7358SJed Brown . point - The sieve point in the DM 34850298fd71SBarry Smith . csize - The number of values in the closure, or NULL 3486552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3487552f7358SJed Brown 34883813dfbdSMatthew G Knepley Fortran Notes: 34893813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 34903813dfbdSMatthew G Knepley include petsc.h90 in your code. 34913813dfbdSMatthew G Knepley 34923813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 34933813dfbdSMatthew G Knepley 3494552f7358SJed Brown Level: intermediate 3495552f7358SJed Brown 3496552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3497552f7358SJed Brown @*/ 34987c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3499a6dfd86eSKarl Rupp { 3500552f7358SJed Brown PetscInt size = 0; 3501552f7358SJed Brown PetscErrorCode ierr; 3502552f7358SJed Brown 3503552f7358SJed Brown PetscFunctionBegin; 3504552f7358SJed Brown /* Should work without recalculating size */ 3505552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 3506552f7358SJed Brown PetscFunctionReturn(0); 3507552f7358SJed Brown } 3508552f7358SJed Brown 3509552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 3510552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 3511552f7358SJed Brown 3512552f7358SJed Brown #undef __FUNCT__ 3513552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 35141a271a75SMatthew 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[]) 3515552f7358SJed Brown { 3516552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3517552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3518552f7358SJed Brown PetscScalar *a; 3519552f7358SJed Brown PetscInt off, cind = 0, k; 3520552f7358SJed Brown PetscErrorCode ierr; 3521552f7358SJed Brown 3522552f7358SJed Brown PetscFunctionBegin; 3523552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3524552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3525552f7358SJed Brown a = &array[off]; 3526552f7358SJed Brown if (!cdof || setBC) { 3527552f7358SJed Brown if (orientation >= 0) { 3528552f7358SJed Brown for (k = 0; k < dof; ++k) { 3529552f7358SJed Brown fuse(&a[k], values[k]); 3530552f7358SJed Brown } 3531552f7358SJed Brown } else { 3532552f7358SJed Brown for (k = 0; k < dof; ++k) { 3533552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3534552f7358SJed Brown } 3535552f7358SJed Brown } 3536552f7358SJed Brown } else { 3537552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3538552f7358SJed Brown if (orientation >= 0) { 3539552f7358SJed Brown for (k = 0; k < dof; ++k) { 3540552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3541552f7358SJed Brown fuse(&a[k], values[k]); 3542552f7358SJed Brown } 3543552f7358SJed Brown } else { 3544552f7358SJed Brown for (k = 0; k < dof; ++k) { 3545552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3546552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3547552f7358SJed Brown } 3548552f7358SJed Brown } 3549552f7358SJed Brown } 3550552f7358SJed Brown PetscFunctionReturn(0); 3551552f7358SJed Brown } 3552552f7358SJed Brown 3553552f7358SJed Brown #undef __FUNCT__ 3554a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 35551a271a75SMatthew 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[]) 3556a5e93ea8SMatthew G. Knepley { 3557a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 3558a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3559a5e93ea8SMatthew G. Knepley PetscScalar *a; 3560a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 3561a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3562a5e93ea8SMatthew G. Knepley 3563a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3564a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3565a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3566a5e93ea8SMatthew G. Knepley a = &array[off]; 3567a5e93ea8SMatthew G. Knepley if (cdof) { 3568a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3569a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 3570a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3571a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3572a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 3573a5e93ea8SMatthew G. Knepley ++cind; 3574a5e93ea8SMatthew G. Knepley } 3575a5e93ea8SMatthew G. Knepley } 3576a5e93ea8SMatthew G. Knepley } else { 3577a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3578a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3579a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 3580a5e93ea8SMatthew G. Knepley ++cind; 3581a5e93ea8SMatthew G. Knepley } 3582a5e93ea8SMatthew G. Knepley } 3583a5e93ea8SMatthew G. Knepley } 3584a5e93ea8SMatthew G. Knepley } 3585a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3586a5e93ea8SMatthew G. Knepley } 3587a5e93ea8SMatthew G. Knepley 3588a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 3589552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 35901a271a75SMatthew 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[]) 3591a6dfd86eSKarl Rupp { 3592552f7358SJed Brown PetscScalar *a; 35931a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 35941a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 35951a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3596552f7358SJed Brown PetscErrorCode ierr; 3597552f7358SJed Brown 3598552f7358SJed Brown PetscFunctionBegin; 3599552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3600552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 36011a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 36021a271a75SMatthew G. Knepley a = &array[foff]; 3603552f7358SJed Brown if (!fcdof || setBC) { 36041a271a75SMatthew G. Knepley if (o >= 0) { 36051a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 3606552f7358SJed Brown } else { 3607552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3608552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 36091a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3610552f7358SJed Brown } 3611552f7358SJed Brown } 3612552f7358SJed Brown } 3613552f7358SJed Brown } else { 3614552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36151a271a75SMatthew G. Knepley if (o >= 0) { 3616552f7358SJed Brown for (k = 0; k < fdof; ++k) { 3617552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 36181a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3619552f7358SJed Brown } 3620552f7358SJed Brown } else { 3621552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3622552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3623552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 36241a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3625552f7358SJed Brown } 3626552f7358SJed Brown } 3627552f7358SJed Brown } 3628552f7358SJed Brown } 36291a271a75SMatthew G. Knepley *offset += fdof; 3630552f7358SJed Brown PetscFunctionReturn(0); 3631552f7358SJed Brown } 3632552f7358SJed Brown 3633552f7358SJed Brown #undef __FUNCT__ 3634a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 36351a271a75SMatthew 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[]) 3636a5e93ea8SMatthew G. Knepley { 3637a5e93ea8SMatthew G. Knepley PetscScalar *a; 36381a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 36391a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 36401a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3641a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3642a5e93ea8SMatthew G. Knepley 3643a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3644a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3645a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 36461a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 36471a271a75SMatthew G. Knepley a = &array[foff]; 3648a5e93ea8SMatthew G. Knepley if (fcdof) { 3649a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36501a271a75SMatthew G. Knepley if (o >= 0) { 3651a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 3652a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 36531a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3654a5e93ea8SMatthew G. Knepley ++cind; 3655a5e93ea8SMatthew G. Knepley } 3656a5e93ea8SMatthew G. Knepley } 3657a5e93ea8SMatthew G. Knepley } else { 3658a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 3659a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 3660a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 36611a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3662a5e93ea8SMatthew G. Knepley ++cind; 3663a5e93ea8SMatthew G. Knepley } 3664a5e93ea8SMatthew G. Knepley } 3665a5e93ea8SMatthew G. Knepley } 3666a5e93ea8SMatthew G. Knepley } 3667a5e93ea8SMatthew G. Knepley } 36681a271a75SMatthew G. Knepley *offset += fdof; 3669a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3670a5e93ea8SMatthew G. Knepley } 3671a5e93ea8SMatthew G. Knepley 3672a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 36731b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 36741a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 3675a6dfd86eSKarl Rupp { 3676552f7358SJed Brown PetscScalar *array; 36771b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 36781b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 3679552f7358SJed Brown PetscErrorCode ierr; 3680552f7358SJed Brown 36811b406b76SMatthew G. Knepley PetscFunctionBeginHot; 3682b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3683b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 3684b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3685b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 3686b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3687b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 3688b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 3689b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 3690b6ebb6e6SMatthew G. Knepley 3691b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 3692b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 3693b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 3694b6ebb6e6SMatthew G. Knepley { 3695b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3696b6ebb6e6SMatthew G. Knepley PetscScalar *a; 3697b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 3698b6ebb6e6SMatthew G. Knepley 3699b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 3700b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 3701b6ebb6e6SMatthew G. Knepley a = &array[coff]; 3702b6ebb6e6SMatthew G. Knepley if (!cdof) { 3703b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3704b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3705b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3706b6ebb6e6SMatthew G. Knepley } 3707b6ebb6e6SMatthew G. Knepley } else { 3708b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3709b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3710b6ebb6e6SMatthew G. Knepley } 3711b6ebb6e6SMatthew G. Knepley } 3712b6ebb6e6SMatthew G. Knepley } else { 3713b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 3714b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3715b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3716b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3717b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3718b6ebb6e6SMatthew G. Knepley } 3719b6ebb6e6SMatthew G. Knepley } else { 3720b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3721b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3722b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3723b6ebb6e6SMatthew G. Knepley } 3724b6ebb6e6SMatthew G. Knepley } 3725b6ebb6e6SMatthew G. Knepley } 3726b6ebb6e6SMatthew G. Knepley } 3727b6ebb6e6SMatthew G. Knepley } 3728b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3729b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 3730b6ebb6e6SMatthew G. Knepley } 37311b406b76SMatthew G. Knepley 37321b406b76SMatthew G. Knepley #undef __FUNCT__ 37331b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 37341b406b76SMatthew G. Knepley /*@C 37351b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 37361b406b76SMatthew G. Knepley 37371b406b76SMatthew G. Knepley Not collective 37381b406b76SMatthew G. Knepley 37391b406b76SMatthew G. Knepley Input Parameters: 37401b406b76SMatthew G. Knepley + dm - The DM 37411b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 37421b406b76SMatthew G. Knepley . v - The local vector 37431b406b76SMatthew G. Knepley . point - The sieve point in the DM 37441b406b76SMatthew G. Knepley . values - The array of values 37451b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 37461b406b76SMatthew G. Knepley 37471b406b76SMatthew G. Knepley Fortran Notes: 37481b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 37491b406b76SMatthew G. Knepley 37501b406b76SMatthew G. Knepley Level: intermediate 37511b406b76SMatthew G. Knepley 37521b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 37531b406b76SMatthew G. Knepley @*/ 37541b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 37551b406b76SMatthew G. Knepley { 37561b406b76SMatthew G. Knepley PetscSection clSection; 37571b406b76SMatthew G. Knepley IS clPoints; 37581b406b76SMatthew G. Knepley PetscScalar *array; 37591b406b76SMatthew G. Knepley PetscInt *points = NULL; 37601b406b76SMatthew G. Knepley const PetscInt *clp; 37611a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 37621b406b76SMatthew G. Knepley PetscErrorCode ierr; 37631b406b76SMatthew G. Knepley 37641a271a75SMatthew G. Knepley PetscFunctionBeginHot; 37651b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 37661b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 37671a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 37681a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 37691b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 37701b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 37711b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 37721a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 37731b406b76SMatthew G. Knepley PetscFunctionReturn(0); 37741b406b76SMatthew G. Knepley } 37751a271a75SMatthew G. Knepley /* Get points */ 37761b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 37771b406b76SMatthew G. Knepley if (!clPoints) { 37781a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 37791a271a75SMatthew G. Knepley 37801a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3781552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3782552f7358SJed Brown /* Compress out points not in the section */ 3783552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3784552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3785552f7358SJed Brown points[q*2] = points[p]; 3786552f7358SJed Brown points[q*2+1] = points[p+1]; 3787552f7358SJed Brown ++q; 3788552f7358SJed Brown } 3789552f7358SJed Brown } 3790552f7358SJed Brown numPoints = q; 37911b406b76SMatthew G. Knepley } else { 37921b406b76SMatthew G. Knepley PetscInt dof, off; 3793552f7358SJed Brown 37941b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 37951b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 37961b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 37971a271a75SMatthew G. Knepley numPoints = dof/2; 37981b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 3799552f7358SJed Brown } 38001a271a75SMatthew G. Knepley /* Get array */ 3801552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 38021a271a75SMatthew G. Knepley /* Get values */ 3803ef90cfe2SMatthew G. Knepley if (numFields > 0) { 38041a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3805552f7358SJed Brown for (f = 0; f < numFields; ++f) { 38061a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3807552f7358SJed Brown switch (mode) { 3808552f7358SJed Brown case INSERT_VALUES: 3809552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38101a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38111a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38121a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3813552f7358SJed Brown } break; 3814552f7358SJed Brown case INSERT_ALL_VALUES: 3815552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38161a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38171a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38181a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3819552f7358SJed Brown } break; 3820a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3821a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 38221a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38231a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38241a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3825a5e93ea8SMatthew G. Knepley } break; 3826552f7358SJed Brown case ADD_VALUES: 3827552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38281a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38291a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38301a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3831552f7358SJed Brown } break; 3832552f7358SJed Brown case ADD_ALL_VALUES: 3833552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38341a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38351a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38361a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3837552f7358SJed Brown } break; 3838552f7358SJed Brown default: 383982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3840552f7358SJed Brown } 38411a271a75SMatthew G. Knepley } 3842552f7358SJed Brown } else { 38431a271a75SMatthew G. Knepley PetscInt dof, off; 38441a271a75SMatthew G. Knepley 3845552f7358SJed Brown switch (mode) { 3846552f7358SJed Brown case INSERT_VALUES: 3847552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3848552f7358SJed Brown PetscInt o = points[p+1]; 3849552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3850552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 3851552f7358SJed Brown } break; 3852552f7358SJed Brown case INSERT_ALL_VALUES: 3853552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3854552f7358SJed Brown PetscInt o = points[p+1]; 3855552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3856552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 3857552f7358SJed Brown } break; 3858a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3859a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3860a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 3861a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3862a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 3863a5e93ea8SMatthew G. Knepley } break; 3864552f7358SJed Brown case ADD_VALUES: 3865552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3866552f7358SJed Brown PetscInt o = points[p+1]; 3867552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3868552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 3869552f7358SJed Brown } break; 3870552f7358SJed Brown case ADD_ALL_VALUES: 3871552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3872552f7358SJed Brown PetscInt o = points[p+1]; 3873552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3874552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 3875552f7358SJed Brown } break; 3876552f7358SJed Brown default: 387782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3878552f7358SJed Brown } 3879552f7358SJed Brown } 38801a271a75SMatthew G. Knepley /* Cleanup points */ 38811a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 38821a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 38831a271a75SMatthew G. Knepley /* Cleanup array */ 3884552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3885552f7358SJed Brown PetscFunctionReturn(0); 3886552f7358SJed Brown } 3887552f7358SJed Brown 3888552f7358SJed Brown #undef __FUNCT__ 3889e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 3890e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 3891e07394fbSMatthew G. Knepley { 3892e07394fbSMatthew G. Knepley PetscSection clSection; 3893e07394fbSMatthew G. Knepley IS clPoints; 3894e07394fbSMatthew G. Knepley PetscScalar *array; 3895e07394fbSMatthew G. Knepley PetscInt *points = NULL; 3896e07394fbSMatthew G. Knepley const PetscInt *clp; 3897e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 3898e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3899e07394fbSMatthew G. Knepley PetscErrorCode ierr; 3900e07394fbSMatthew G. Knepley 3901e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 3902e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3903e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 3904e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 3905e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3906e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3907e07394fbSMatthew G. Knepley /* Get points */ 3908e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3909e07394fbSMatthew G. Knepley if (!clPoints) { 3910e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 3911e07394fbSMatthew G. Knepley 3912e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3913e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3914e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 3915e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 3916e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 3917e07394fbSMatthew G. Knepley points[q*2] = points[p]; 3918e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 3919e07394fbSMatthew G. Knepley ++q; 3920e07394fbSMatthew G. Knepley } 3921e07394fbSMatthew G. Knepley } 3922e07394fbSMatthew G. Knepley numPoints = q; 3923e07394fbSMatthew G. Knepley } else { 3924e07394fbSMatthew G. Knepley PetscInt dof, off; 3925e07394fbSMatthew G. Knepley 3926e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3927e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3928e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 3929e07394fbSMatthew G. Knepley numPoints = dof/2; 3930e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3931e07394fbSMatthew G. Knepley } 3932e07394fbSMatthew G. Knepley /* Get array */ 3933e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3934e07394fbSMatthew G. Knepley /* Get values */ 3935e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 3936e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3937e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 3938e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3939e07394fbSMatthew G. Knepley PetscInt fdof; 3940e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 3941e07394fbSMatthew G. Knepley offset += fdof; 3942e07394fbSMatthew G. Knepley } 3943e07394fbSMatthew G. Knepley continue; 3944e07394fbSMatthew G. Knepley } 3945e07394fbSMatthew G. Knepley switch (mode) { 3946e07394fbSMatthew G. Knepley case INSERT_VALUES: 3947e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3948e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3949e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3950e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3951e07394fbSMatthew G. Knepley } break; 3952e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 3953e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3954e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3955e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3956e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3957e07394fbSMatthew G. Knepley } break; 3958e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 3959e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3960e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3961e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3962e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3963e07394fbSMatthew G. Knepley } break; 3964e07394fbSMatthew G. Knepley case ADD_VALUES: 3965e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3966e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3967e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3968e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3969e07394fbSMatthew G. Knepley } break; 3970e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 3971e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3972e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3973e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3974e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3975e07394fbSMatthew G. Knepley } break; 3976e07394fbSMatthew G. Knepley default: 3977e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3978e07394fbSMatthew G. Knepley } 3979e07394fbSMatthew G. Knepley } 3980e07394fbSMatthew G. Knepley /* Cleanup points */ 3981e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 3982e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 3983e07394fbSMatthew G. Knepley /* Cleanup array */ 3984e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3985e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 3986e07394fbSMatthew G. Knepley } 3987e07394fbSMatthew G. Knepley 3988e07394fbSMatthew G. Knepley #undef __FUNCT__ 3989552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 3990b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 3991552f7358SJed Brown { 3992552f7358SJed Brown PetscMPIInt rank; 3993552f7358SJed Brown PetscInt i, j; 3994552f7358SJed Brown PetscErrorCode ierr; 3995552f7358SJed Brown 3996552f7358SJed Brown PetscFunctionBegin; 399782f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 399877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 3999e4b003c7SBarry Smith for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%d]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 4000e4b003c7SBarry Smith for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%d]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 4001b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 4002b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 4003e4b003c7SBarry Smith ierr = PetscViewerASCIIPrintf(viewer, "[%d]", rank);CHKERRQ(ierr); 4004b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 4005519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 40067eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 4007552f7358SJed Brown #else 4008b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 4009552f7358SJed Brown #endif 4010552f7358SJed Brown } 401177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 4012552f7358SJed Brown } 4013552f7358SJed Brown PetscFunctionReturn(0); 4014552f7358SJed Brown } 4015552f7358SJed Brown 4016552f7358SJed Brown #undef __FUNCT__ 4017552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 4018552f7358SJed Brown /* . off - The global offset of this point */ 4019e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4020a6dfd86eSKarl Rupp { 4021e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 4022552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4023552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4024552f7358SJed Brown PetscInt cind = 0, k; 4025552f7358SJed Brown PetscErrorCode ierr; 4026552f7358SJed Brown 4027552f7358SJed Brown PetscFunctionBegin; 4028552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 4029552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4030552f7358SJed Brown if (!cdof || setBC) { 4031552f7358SJed Brown if (orientation >= 0) { 4032e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 4033552f7358SJed Brown } else { 4034e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 4035552f7358SJed Brown } 4036552f7358SJed Brown } else { 4037552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4038552f7358SJed Brown if (orientation >= 0) { 4039552f7358SJed Brown for (k = 0; k < dof; ++k) { 4040552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4041552f7358SJed Brown /* Insert check for returning constrained indices */ 4042e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 4043552f7358SJed Brown ++cind; 4044552f7358SJed Brown } else { 4045e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 4046552f7358SJed Brown } 4047552f7358SJed Brown } 4048552f7358SJed Brown } else { 4049552f7358SJed Brown for (k = 0; k < dof; ++k) { 4050552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4051552f7358SJed Brown /* Insert check for returning constrained indices */ 4052e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 4053552f7358SJed Brown ++cind; 4054552f7358SJed Brown } else { 4055e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 4056552f7358SJed Brown } 4057552f7358SJed Brown } 4058552f7358SJed Brown } 4059552f7358SJed Brown } 4060e6ccafaeSMatthew G Knepley *loff += dof; 4061552f7358SJed Brown PetscFunctionReturn(0); 4062552f7358SJed Brown } 4063552f7358SJed Brown 4064552f7358SJed Brown #undef __FUNCT__ 4065552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 4066552f7358SJed Brown /* . off - The global offset of this point */ 4067a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4068a6dfd86eSKarl Rupp { 4069552f7358SJed Brown PetscInt numFields, foff, f; 4070552f7358SJed Brown PetscErrorCode ierr; 4071552f7358SJed Brown 4072552f7358SJed Brown PetscFunctionBegin; 4073552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4074552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 4075552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 4076552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 4077552f7358SJed Brown PetscInt cind = 0, k, c; 4078552f7358SJed Brown 4079552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4080552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4081552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 4082552f7358SJed Brown if (!cfdof || setBC) { 4083552f7358SJed Brown if (orientation >= 0) { 40840d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 4085552f7358SJed Brown } else { 4086552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4087552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4088552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 4089552f7358SJed Brown } 4090552f7358SJed Brown } 4091552f7358SJed Brown } 4092552f7358SJed Brown } else { 4093552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 4094552f7358SJed Brown if (orientation >= 0) { 4095552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4096552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 4097552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 4098552f7358SJed Brown ++cind; 4099552f7358SJed Brown } else { 4100552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 4101552f7358SJed Brown } 4102552f7358SJed Brown } 4103552f7358SJed Brown } else { 4104552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4105552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4106552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 4107552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 4108552f7358SJed Brown ++cind; 4109552f7358SJed Brown } else { 4110552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 4111552f7358SJed Brown } 4112552f7358SJed Brown } 4113552f7358SJed Brown } 4114552f7358SJed Brown } 4115552f7358SJed Brown } 4116552f7358SJed Brown foff += fdof - cfdof; 4117552f7358SJed Brown foffs[f] += fdof; 4118552f7358SJed Brown } 4119552f7358SJed Brown PetscFunctionReturn(0); 4120552f7358SJed Brown } 4121552f7358SJed Brown 4122552f7358SJed Brown #undef __FUNCT__ 4123f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat" 4124f7c74593SToby Isaac static PetscErrorCode DMPlexAnchorsModifyMat(DM dm, PetscSection section, PetscInt numPoints, PetscInt numIndices, const PetscInt points[], const PetscScalar values[], PetscInt *outNumPoints, PetscInt *outNumIndices, PetscInt *outPoints[], PetscScalar *outValues[], PetscInt offsets[]) 4125d3d1a6afSToby Isaac { 4126d3d1a6afSToby Isaac Mat cMat; 4127d3d1a6afSToby Isaac PetscSection aSec, cSec; 4128d3d1a6afSToby Isaac IS aIS; 4129d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 4130d3d1a6afSToby Isaac const PetscInt *anchors; 4131e17c06e0SMatthew G. Knepley PetscInt numFields, f, p, q, newP = 0; 4132d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 4133d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 4134d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 4135d3d1a6afSToby Isaac PetscInt newOffsets[32]; 4136d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 4137d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 4138d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 4139d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 4140d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 4141d3d1a6afSToby Isaac PetscErrorCode ierr; 4142d3d1a6afSToby Isaac 4143d3d1a6afSToby Isaac PetscFunctionBegin; 4144d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4145d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4146d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4147d3d1a6afSToby Isaac 4148a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 4149d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 4150d3d1a6afSToby Isaac if (aSec) { 4151d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4152d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 4153d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 4154d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 4155d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 4156d3d1a6afSToby Isaac * into the global matrix anyway) */ 4157d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 4158d3d1a6afSToby Isaac PetscInt b = points[p]; 4159d3d1a6afSToby Isaac PetscInt bDof = 0; 4160d3d1a6afSToby Isaac 4161d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4162d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 4163d3d1a6afSToby Isaac } 4164d3d1a6afSToby Isaac if (bDof) { 4165d3d1a6afSToby Isaac /* this point is constrained */ 4166d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 4167d3d1a6afSToby Isaac PetscInt bOff, q; 4168d3d1a6afSToby Isaac 4169d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 4170d3d1a6afSToby Isaac newNumPoints += bDof; 4171d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 4172d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4173d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4174d3d1a6afSToby Isaac PetscInt aDof; 4175d3d1a6afSToby Isaac 4176d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 4177d3d1a6afSToby Isaac newNumIndices += aDof; 4178d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4179d3d1a6afSToby Isaac PetscInt fDof; 4180d3d1a6afSToby Isaac 4181d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 4182d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4183d3d1a6afSToby Isaac } 4184d3d1a6afSToby Isaac } 4185d3d1a6afSToby Isaac } 4186d3d1a6afSToby Isaac else { 4187d3d1a6afSToby Isaac /* this point is not constrained */ 4188d3d1a6afSToby Isaac newNumPoints++; 4189d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 4190d3d1a6afSToby Isaac newNumIndices += bDof; 4191d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4192d3d1a6afSToby Isaac PetscInt fDof; 4193d3d1a6afSToby Isaac 4194d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4195d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4196d3d1a6afSToby Isaac } 4197d3d1a6afSToby Isaac } 4198d3d1a6afSToby Isaac } 4199d3d1a6afSToby Isaac } 4200d3d1a6afSToby Isaac if (!anyConstrained) { 4201d3d1a6afSToby Isaac *outNumPoints = 0; 4202d3d1a6afSToby Isaac *outNumIndices = 0; 4203d3d1a6afSToby Isaac *outPoints = NULL; 4204d3d1a6afSToby Isaac *outValues = NULL; 4205d3d1a6afSToby Isaac if (aSec) { 4206d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4207d3d1a6afSToby Isaac } 4208d3d1a6afSToby Isaac PetscFunctionReturn(0); 4209d3d1a6afSToby Isaac } 4210d3d1a6afSToby Isaac 4211d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 4212d3d1a6afSToby Isaac 4213d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 4214d3d1a6afSToby Isaac 4215f7c74593SToby Isaac ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr); 4216d3d1a6afSToby Isaac 4217d3d1a6afSToby Isaac /* output arrays */ 4218d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4219d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4220d3d1a6afSToby Isaac 4221d3d1a6afSToby Isaac /* workspaces */ 4222d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4223d3d1a6afSToby Isaac if (numFields) { 4224d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4225d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4226d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4227d3d1a6afSToby Isaac } 4228d3d1a6afSToby Isaac } 4229d3d1a6afSToby Isaac else { 4230d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4231d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4232d3d1a6afSToby Isaac } 4233d3d1a6afSToby Isaac 4234d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 4235d3d1a6afSToby Isaac if (numFields) { 4236d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4237d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4238d3d1a6afSToby Isaac PetscInt bDof = 0; 4239d3d1a6afSToby Isaac 4240d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4241d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4242d3d1a6afSToby Isaac } 4243d3d1a6afSToby Isaac if (bDof) { 4244d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4245d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 4246d3d1a6afSToby Isaac 4247d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4248d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4249d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4250d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4251d3d1a6afSToby Isaac PetscInt aFDof; 4252d3d1a6afSToby Isaac 4253d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 4254d3d1a6afSToby Isaac allFDof += aFDof; 4255d3d1a6afSToby Isaac } 4256d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 4257d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 4258d3d1a6afSToby Isaac } 4259d3d1a6afSToby Isaac } 4260d3d1a6afSToby Isaac else { 4261d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4262d3d1a6afSToby Isaac PetscInt fDof; 4263d3d1a6afSToby Isaac 4264d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4265d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 4266d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 4267d3d1a6afSToby Isaac } 4268d3d1a6afSToby Isaac } 4269d3d1a6afSToby Isaac } 4270d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4271d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 4272d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 4273d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4274d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 4275d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 4276d3d1a6afSToby Isaac } 4277d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4278d3d1a6afSToby Isaac } 4279d3d1a6afSToby Isaac } 4280d3d1a6afSToby Isaac else { 4281d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4282d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4283d3d1a6afSToby Isaac PetscInt bDof = 0; 4284d3d1a6afSToby Isaac 4285d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4286d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4287d3d1a6afSToby Isaac } 4288d3d1a6afSToby Isaac if (bDof) { 4289d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 4290d3d1a6afSToby Isaac 4291d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4292d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4293d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4294d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 4295d3d1a6afSToby Isaac 4296d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 4297d3d1a6afSToby Isaac allDof += aDof; 4298d3d1a6afSToby Isaac } 4299d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 4300d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 4301d3d1a6afSToby Isaac } 4302d3d1a6afSToby Isaac else { 4303d3d1a6afSToby Isaac PetscInt dof; 4304d3d1a6afSToby Isaac 4305d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4306d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 4307d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 4308d3d1a6afSToby Isaac } 4309d3d1a6afSToby Isaac } 4310d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 4311d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 4312d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4313d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 4314d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 4315d3d1a6afSToby Isaac } 4316d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4317d3d1a6afSToby Isaac } 4318d3d1a6afSToby Isaac 4319d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 4320d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 4321d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4322d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4323d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4324d3d1a6afSToby Isaac if (numFields) { 4325d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 4326d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4327d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4328d3d1a6afSToby Isaac PetscInt bDof = 0; 4329d3d1a6afSToby Isaac 4330d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4331d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4332d3d1a6afSToby Isaac } 4333d3d1a6afSToby Isaac if (bDof) { 4334d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 4335d3d1a6afSToby Isaac 4336d3d1a6afSToby Isaac fStart[0] = 0; 4337d3d1a6afSToby Isaac fEnd[0] = 0; 4338d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4339d3d1a6afSToby Isaac PetscInt fDof; 4340d3d1a6afSToby Isaac 4341d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 4342d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 4343d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 4344d3d1a6afSToby Isaac } 4345d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4346d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4347d3d1a6afSToby Isaac 4348d3d1a6afSToby Isaac fAnchorStart[0] = 0; 4349d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 4350d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4351d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 4352d3d1a6afSToby Isaac 4353d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 4354d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 4355d3d1a6afSToby Isaac } 4356d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4357d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4358d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4359d3d1a6afSToby Isaac 4360d3d1a6afSToby Isaac /* we take the orientation of ap into account in the order that we constructed the indices above: the newly added points have no orientation */ 4361d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4362d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4363302440fdSBarry Smith ierr = PetscSectionGetOffset(section, a, &aOff);CHKERRQ(ierr); 4364d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4365d3d1a6afSToby Isaac } 4366d3d1a6afSToby Isaac newP += bDof; 4367d3d1a6afSToby Isaac 4368d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4369d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4370d3d1a6afSToby Isaac ierr = MatGetValues(cMat,fEnd[f]-fStart[f],indices + fStart[f],fAnchorEnd[f] - fAnchorStart[f],newIndices + fAnchorStart[f],pointMat[f] + pointMatOffsets[f][p]);CHKERRQ(ierr); 4371d3d1a6afSToby Isaac } 4372d3d1a6afSToby Isaac } 4373d3d1a6afSToby Isaac else { 4374d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4375d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4376d3d1a6afSToby Isaac newP++; 4377d3d1a6afSToby Isaac } 4378d3d1a6afSToby Isaac } 4379d3d1a6afSToby Isaac } else { 4380d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4381d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4382d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4383d3d1a6afSToby Isaac PetscInt bDof = 0; 4384d3d1a6afSToby Isaac 4385d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4386d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4387d3d1a6afSToby Isaac } 4388d3d1a6afSToby Isaac if (bDof) { 4389d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 4390d3d1a6afSToby Isaac 4391d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4392d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4393d3d1a6afSToby Isaac 4394d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4395d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4396d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4397d3d1a6afSToby Isaac 4398d3d1a6afSToby Isaac /* we take the orientation of ap into account in the order that we constructed the indices above: the newly added points have no orientation */ 4399d3d1a6afSToby Isaac 4400d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4401d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4402302440fdSBarry Smith ierr = PetscSectionGetOffset(section, a, &aOff);CHKERRQ(ierr); 4403d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4404d3d1a6afSToby Isaac } 4405d3d1a6afSToby Isaac newP += bDof; 4406d3d1a6afSToby Isaac 4407d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4408d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 4409d3d1a6afSToby Isaac } 4410d3d1a6afSToby Isaac else { 4411d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4412d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4413d3d1a6afSToby Isaac newP++; 4414d3d1a6afSToby Isaac } 4415d3d1a6afSToby Isaac } 4416d3d1a6afSToby Isaac } 4417d3d1a6afSToby Isaac 4418d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 4419d3d1a6afSToby Isaac /* multiply constraints on the right */ 4420d3d1a6afSToby Isaac if (numFields) { 4421d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4422d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4423d3d1a6afSToby Isaac 4424d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4425d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 4426d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4427d3d1a6afSToby Isaac PetscInt c, r, k; 4428d3d1a6afSToby Isaac PetscInt dof; 4429d3d1a6afSToby Isaac 4430d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4431d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4432d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 4433d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 4434d3d1a6afSToby Isaac 4435d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4436d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4437d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4438d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4439d3d1a6afSToby Isaac } 4440d3d1a6afSToby Isaac } 4441d3d1a6afSToby Isaac } 4442d3d1a6afSToby Isaac } 4443d3d1a6afSToby Isaac else { 4444d3d1a6afSToby Isaac /* copy this column as is */ 4445d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4446d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4447d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4448d3d1a6afSToby Isaac } 4449d3d1a6afSToby Isaac } 4450d3d1a6afSToby Isaac } 4451d3d1a6afSToby Isaac oldOff += dof; 4452d3d1a6afSToby Isaac } 4453d3d1a6afSToby Isaac } 4454d3d1a6afSToby Isaac } 4455d3d1a6afSToby Isaac else { 4456d3d1a6afSToby Isaac PetscInt oldOff = 0; 4457d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4458d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 4459d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4460d3d1a6afSToby Isaac PetscInt c, r, k; 4461d3d1a6afSToby Isaac PetscInt dof; 4462d3d1a6afSToby Isaac 4463d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4464d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4465d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 4466d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 4467d3d1a6afSToby Isaac 4468d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4469d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4470d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4471d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4472d3d1a6afSToby Isaac } 4473d3d1a6afSToby Isaac } 4474d3d1a6afSToby Isaac } 4475d3d1a6afSToby Isaac } 4476d3d1a6afSToby Isaac else { 4477d3d1a6afSToby Isaac /* copy this column as is */ 4478d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4479d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4480d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4481d3d1a6afSToby Isaac } 4482d3d1a6afSToby Isaac } 4483d3d1a6afSToby Isaac } 4484d3d1a6afSToby Isaac oldOff += dof; 4485d3d1a6afSToby Isaac } 4486d3d1a6afSToby Isaac } 4487d3d1a6afSToby Isaac 4488d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 4489d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 4490d3d1a6afSToby Isaac if (numFields) { 4491d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4492d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4493d3d1a6afSToby Isaac 4494d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4495d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 4496d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4497d3d1a6afSToby Isaac PetscInt c, r, k; 4498d3d1a6afSToby Isaac PetscInt dof; 4499d3d1a6afSToby Isaac 4500d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4501d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4502d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 4503d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 4504d3d1a6afSToby Isaac 4505d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4506d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4507d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4508d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4509d3d1a6afSToby Isaac } 4510d3d1a6afSToby Isaac } 4511d3d1a6afSToby Isaac } 4512d3d1a6afSToby Isaac } 4513d3d1a6afSToby Isaac else { 4514d3d1a6afSToby Isaac /* copy this row as is */ 4515d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 4516d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4517d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4518d3d1a6afSToby Isaac } 4519d3d1a6afSToby Isaac } 4520d3d1a6afSToby Isaac } 4521d3d1a6afSToby Isaac oldOff += dof; 4522d3d1a6afSToby Isaac } 4523d3d1a6afSToby Isaac } 4524d3d1a6afSToby Isaac } 4525d3d1a6afSToby Isaac else { 4526d3d1a6afSToby Isaac PetscInt oldOff = 0; 4527d3d1a6afSToby Isaac 4528d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4529d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 4530d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4531d3d1a6afSToby Isaac PetscInt c, r, k; 4532d3d1a6afSToby Isaac PetscInt dof; 4533d3d1a6afSToby Isaac 4534d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4535d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4536d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 4537d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 4538d3d1a6afSToby Isaac 4539d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4540d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4541d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4542d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4543d3d1a6afSToby Isaac } 4544d3d1a6afSToby Isaac } 4545d3d1a6afSToby Isaac } 4546d3d1a6afSToby Isaac } 4547d3d1a6afSToby Isaac else { 4548d3d1a6afSToby Isaac /* copy this row as is */ 4549d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 4550d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4551d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4552d3d1a6afSToby Isaac } 4553d3d1a6afSToby Isaac } 4554d3d1a6afSToby Isaac } 4555d3d1a6afSToby Isaac oldOff += dof; 4556d3d1a6afSToby Isaac } 4557d3d1a6afSToby Isaac } 4558d3d1a6afSToby Isaac 4559d3d1a6afSToby Isaac /* clean up */ 4560d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4561d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4562d3d1a6afSToby Isaac if (numFields) { 4563d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4564d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4565d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4566d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4567d3d1a6afSToby Isaac } 4568d3d1a6afSToby Isaac } 4569d3d1a6afSToby Isaac else { 4570d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4571d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4572d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4573d3d1a6afSToby Isaac } 4574d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4575d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4576d3d1a6afSToby Isaac 4577d3d1a6afSToby Isaac /* output */ 4578d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 4579d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 4580d3d1a6afSToby Isaac *outPoints = newPoints; 4581d3d1a6afSToby Isaac *outValues = newValues; 4582d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4583d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 4584d3d1a6afSToby Isaac } 4585d3d1a6afSToby Isaac PetscFunctionReturn(0); 4586d3d1a6afSToby Isaac } 4587d3d1a6afSToby Isaac 4588d3d1a6afSToby Isaac #undef __FUNCT__ 4589552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 45907f5d1fdeSMatthew G. Knepley /*@C 45917f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 45927f5d1fdeSMatthew G. Knepley 45937f5d1fdeSMatthew G. Knepley Not collective 45947f5d1fdeSMatthew G. Knepley 45957f5d1fdeSMatthew G. Knepley Input Parameters: 45967f5d1fdeSMatthew G. Knepley + dm - The DM 4597ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4598ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 45997f5d1fdeSMatthew G. Knepley . A - The matrix 46007f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 46017f5d1fdeSMatthew G. Knepley . values - The array of values 46027f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 46037f5d1fdeSMatthew G. Knepley 46047f5d1fdeSMatthew G. Knepley Fortran Notes: 46057f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 46067f5d1fdeSMatthew G. Knepley 46077f5d1fdeSMatthew G. Knepley Level: intermediate 46087f5d1fdeSMatthew G. Knepley 46097f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 46107f5d1fdeSMatthew G. Knepley @*/ 46117c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 4612552f7358SJed Brown { 4613552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 46141b406b76SMatthew G. Knepley PetscSection clSection; 46151b406b76SMatthew G. Knepley IS clPoints; 4616d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 46171b406b76SMatthew G. Knepley const PetscInt *clp; 4618552f7358SJed Brown PetscInt *indices; 4619552f7358SJed Brown PetscInt offsets[32]; 4620d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 4621d3d1a6afSToby Isaac PetscScalar *newValues; 4622552f7358SJed Brown PetscErrorCode ierr; 4623552f7358SJed Brown 4624552f7358SJed Brown PetscFunctionBegin; 4625552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4626ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 46273dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4628ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 46293dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 46303dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 4631552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 463282f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4633552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 46341b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 46351b406b76SMatthew G. Knepley if (!clPoints) { 4636552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4637552f7358SJed Brown /* Compress out points not in the section */ 4638552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4639552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4640552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4641552f7358SJed Brown points[q*2] = points[p]; 4642552f7358SJed Brown points[q*2+1] = points[p+1]; 4643552f7358SJed Brown ++q; 4644552f7358SJed Brown } 4645552f7358SJed Brown } 4646552f7358SJed Brown numPoints = q; 46471b406b76SMatthew G. Knepley } else { 46481b406b76SMatthew G. Knepley PetscInt dof, off; 46491b406b76SMatthew G. Knepley 46501b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 46511b406b76SMatthew G. Knepley numPoints = dof/2; 46521b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 46531b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46541b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 46551b406b76SMatthew G. Knepley } 4656552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 4657552f7358SJed Brown PetscInt fdof; 4658552f7358SJed Brown 4659552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4660552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4661552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 4662552f7358SJed Brown offsets[f+1] += fdof; 4663552f7358SJed Brown } 4664552f7358SJed Brown numIndices += dof; 4665552f7358SJed Brown } 46660d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 46670d644c17SKarl Rupp 466882f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 4669f7c74593SToby Isaac ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 4670d3d1a6afSToby Isaac if (newNumPoints) { 4671d3d1a6afSToby Isaac if (!clPoints) { 4672d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4673d3d1a6afSToby Isaac } else { 4674d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 4675d3d1a6afSToby Isaac } 4676d3d1a6afSToby Isaac numPoints = newNumPoints; 4677d3d1a6afSToby Isaac numIndices = newNumIndices; 4678d3d1a6afSToby Isaac points = newPoints; 4679d3d1a6afSToby Isaac values = newValues; 4680d3d1a6afSToby Isaac } 4681552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4682552f7358SJed Brown if (numFields) { 4683552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4684552f7358SJed Brown PetscInt o = points[p+1]; 4685552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4686552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 4687552f7358SJed Brown } 4688552f7358SJed Brown } else { 4689e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 4690552f7358SJed Brown PetscInt o = points[p+1]; 4691552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4692e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 4693552f7358SJed Brown } 4694552f7358SJed Brown } 4695b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 4696552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 4697552f7358SJed Brown if (ierr) { 4698552f7358SJed Brown PetscMPIInt rank; 4699552f7358SJed Brown PetscErrorCode ierr2; 4700552f7358SJed Brown 470182f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4702e4b003c7SBarry Smith ierr2 = (*PetscErrorPrintf)("[%d]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4703b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 47046a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 4705552f7358SJed Brown CHKERRQ(ierr); 4706552f7358SJed Brown } 4707d3d1a6afSToby Isaac if (newNumPoints) { 4708d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4709d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4710d3d1a6afSToby Isaac } 4711d3d1a6afSToby Isaac else { 47121b406b76SMatthew G. Knepley if (!clPoints) { 4713552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 47141b406b76SMatthew G. Knepley } else { 47151b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 47161b406b76SMatthew G. Knepley } 4717d3d1a6afSToby Isaac } 4718552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4719552f7358SJed Brown PetscFunctionReturn(0); 4720552f7358SJed Brown } 4721552f7358SJed Brown 4722552f7358SJed Brown #undef __FUNCT__ 4723de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 4724de41b84cSMatthew 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) 4725de41b84cSMatthew G. Knepley { 4726de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 4727de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 4728de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 4729de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 4730de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 4731de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 47324ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 4733de41b84cSMatthew G. Knepley PetscErrorCode ierr; 4734de41b84cSMatthew G. Knepley 4735de41b84cSMatthew G. Knepley PetscFunctionBegin; 4736de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 4737de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 4738de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 4739de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 4740de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 4741de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 4742de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 4743de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 4744de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 4745de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 4746de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 4747de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 4748de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4749de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4750de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4751de41b84cSMatthew G. Knepley /* Column indices */ 4752de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 47534ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 4754de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4755de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 4756de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 4757de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 4758de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 4759de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 4760de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 4761de41b84cSMatthew G. Knepley ++q; 4762de41b84cSMatthew G. Knepley } 4763de41b84cSMatthew G. Knepley } 4764de41b84cSMatthew G. Knepley numCPoints = q; 4765de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 4766de41b84cSMatthew G. Knepley PetscInt fdof; 4767de41b84cSMatthew G. Knepley 4768de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 47694ca5e9f5SMatthew G. Knepley if (!dof) continue; 4770de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4771de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 4772de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 4773de41b84cSMatthew G. Knepley } 4774de41b84cSMatthew G. Knepley numCIndices += dof; 4775de41b84cSMatthew G. Knepley } 4776de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 4777de41b84cSMatthew G. Knepley /* Row indices */ 4778de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 4779de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 47801ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4781de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 4782de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 4783de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4784de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4785de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 4786de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4787de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 47884ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 47894ca5e9f5SMatthew G. Knepley if (!dof) continue; 47904ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 47914ca5e9f5SMatthew G. Knepley if (s < q) continue; 4792de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 4793de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 4794de41b84cSMatthew G. Knepley ++q; 4795de41b84cSMatthew G. Knepley } 4796de41b84cSMatthew G. Knepley } 4797de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4798de41b84cSMatthew G. Knepley } 4799de41b84cSMatthew G. Knepley numFPoints = q; 4800de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 4801de41b84cSMatthew G. Knepley PetscInt fdof; 4802de41b84cSMatthew G. Knepley 4803de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 48044ca5e9f5SMatthew G. Knepley if (!dof) continue; 4805de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4806de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 4807de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 4808de41b84cSMatthew G. Knepley } 4809de41b84cSMatthew G. Knepley numFIndices += dof; 4810de41b84cSMatthew G. Knepley } 4811de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 4812de41b84cSMatthew G. Knepley 4813de41b84cSMatthew 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); 4814de41b84cSMatthew 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); 4815de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4816de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4817de41b84cSMatthew G. Knepley if (numFields) { 4818de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4819de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4820de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4821de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 4822de41b84cSMatthew G. Knepley } 4823de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 4824de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4825de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4826de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 4827de41b84cSMatthew G. Knepley } 4828de41b84cSMatthew G. Knepley } else { 4829de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 4830de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4831de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4832de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 4833de41b84cSMatthew G. Knepley } 4834de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 4835de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4836de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4837de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 4838de41b84cSMatthew G. Knepley } 4839de41b84cSMatthew G. Knepley } 4840de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 4841de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 4842de41b84cSMatthew G. Knepley if (ierr) { 4843de41b84cSMatthew G. Knepley PetscMPIInt rank; 4844de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 4845de41b84cSMatthew G. Knepley 4846de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4847e4b003c7SBarry Smith ierr2 = (*PetscErrorPrintf)("[%d]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4848de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 4849de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 4850de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 4851de41b84cSMatthew G. Knepley CHKERRQ(ierr); 4852de41b84cSMatthew G. Knepley } 4853549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4854de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 4855de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4856de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4857de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 4858de41b84cSMatthew G. Knepley } 4859de41b84cSMatthew G. Knepley 4860de41b84cSMatthew G. Knepley #undef __FUNCT__ 48617c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 48627c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 48637c927364SMatthew G. Knepley { 48647c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 48657c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 48667c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 48677c927364SMatthew G. Knepley CellRefiner cellRefiner; 48687c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 48697c927364SMatthew G. Knepley PetscErrorCode ierr; 48707c927364SMatthew G. Knepley 48717c927364SMatthew G. Knepley PetscFunctionBegin; 48727c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 48737c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 48747c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 48757c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 48767c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 48777c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 48787c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 48797c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 48807c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 48817c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 48827c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 48837c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 48847c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 48857c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 48867c927364SMatthew G. Knepley /* Column indices */ 48877c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 48887c927364SMatthew G. Knepley maxFPoints = numCPoints; 48897c927364SMatthew G. Knepley /* Compress out points not in the section */ 48907c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 48917c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 48927c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 48937c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 48947c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 48957c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 48967c927364SMatthew G. Knepley ++q; 48977c927364SMatthew G. Knepley } 48987c927364SMatthew G. Knepley } 48997c927364SMatthew G. Knepley numCPoints = q; 49007c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 49017c927364SMatthew G. Knepley PetscInt fdof; 49027c927364SMatthew G. Knepley 49037c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 49047c927364SMatthew G. Knepley if (!dof) continue; 49057c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 49067c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 49077c927364SMatthew G. Knepley coffsets[f+1] += fdof; 49087c927364SMatthew G. Knepley } 49097c927364SMatthew G. Knepley numCIndices += dof; 49107c927364SMatthew G. Knepley } 49117c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 49127c927364SMatthew G. Knepley /* Row indices */ 49137c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 49147c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 49157c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 49167c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 49177c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 49187c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 49197c927364SMatthew G. Knepley /* Compress out points not in the section */ 49207c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 49217c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 49227c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 49237c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 49247c927364SMatthew G. Knepley if (!dof) continue; 49257c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 49267c927364SMatthew G. Knepley if (s < q) continue; 49277c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 49287c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 49297c927364SMatthew G. Knepley ++q; 49307c927364SMatthew G. Knepley } 49317c927364SMatthew G. Knepley } 49327c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 49337c927364SMatthew G. Knepley } 49347c927364SMatthew G. Knepley numFPoints = q; 49357c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 49367c927364SMatthew G. Knepley PetscInt fdof; 49377c927364SMatthew G. Knepley 49387c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 49397c927364SMatthew G. Knepley if (!dof) continue; 49407c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 49417c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 49427c927364SMatthew G. Knepley foffsets[f+1] += fdof; 49437c927364SMatthew G. Knepley } 49447c927364SMatthew G. Knepley numFIndices += dof; 49457c927364SMatthew G. Knepley } 49467c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 49477c927364SMatthew G. Knepley 49487c927364SMatthew 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); 49497c927364SMatthew 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); 49507c927364SMatthew G. Knepley if (numFields) { 49517c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 49527c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 49537c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 49547c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 49557c927364SMatthew G. Knepley } 49567c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 49577c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 49587c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 49597c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 49607c927364SMatthew G. Knepley } 49617c927364SMatthew G. Knepley } else { 49627c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 49637c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 49647c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 49657c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 49667c927364SMatthew G. Knepley } 49677c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 49687c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 49697c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 49707c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 49717c927364SMatthew G. Knepley } 49727c927364SMatthew G. Knepley } 49737c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 49747c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 49757c927364SMatthew G. Knepley PetscFunctionReturn(0); 49767c927364SMatthew G. Knepley } 49777c927364SMatthew G. Knepley 49787c927364SMatthew G. Knepley #undef __FUNCT__ 4979770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 4980f96281f8SMatthew G. Knepley /*@ 4981f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 4982f96281f8SMatthew G. Knepley 4983f96281f8SMatthew G. Knepley Input Parameter: 4984f96281f8SMatthew G. Knepley . dm - The DMPlex object 4985f96281f8SMatthew G. Knepley 4986f96281f8SMatthew G. Knepley Output Parameters: 4987f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 4988dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4989dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4990dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4991f96281f8SMatthew G. Knepley 4992f96281f8SMatthew G. Knepley Level: developer 4993f96281f8SMatthew G. Knepley 4994dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 4995f96281f8SMatthew G. Knepley @*/ 4996770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 4997552f7358SJed Brown { 4998552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4999770b213bSMatthew G Knepley PetscInt dim; 5000770b213bSMatthew G Knepley PetscErrorCode ierr; 5001552f7358SJed Brown 5002552f7358SJed Brown PetscFunctionBegin; 5003552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5004c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5005770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5006770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5007770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5008770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5009552f7358SJed Brown PetscFunctionReturn(0); 5010552f7358SJed Brown } 5011552f7358SJed Brown 5012552f7358SJed Brown #undef __FUNCT__ 5013770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5014dc5a3409SMatthew G. Knepley /*@ 5015dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5016dc5a3409SMatthew G. Knepley 5017dc5a3409SMatthew G. Knepley Input Parameters: 5018dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5019dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5020dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5021dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5022dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5023dc5a3409SMatthew G. Knepley 5024dc5a3409SMatthew G. Knepley Level: developer 5025dc5a3409SMatthew G. Knepley 5026dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5027dc5a3409SMatthew G. Knepley @*/ 5028770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5029552f7358SJed Brown { 5030552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5031770b213bSMatthew G Knepley PetscInt dim; 5032770b213bSMatthew G Knepley PetscErrorCode ierr; 5033552f7358SJed Brown 5034552f7358SJed Brown PetscFunctionBegin; 5035552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5036c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5037770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5038770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5039770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5040770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5041552f7358SJed Brown PetscFunctionReturn(0); 5042552f7358SJed Brown } 5043552f7358SJed Brown 5044552f7358SJed Brown #undef __FUNCT__ 5045552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5046552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5047552f7358SJed Brown { 5048552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5049552f7358SJed Brown 5050552f7358SJed Brown PetscFunctionBegin; 5051552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5052552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5053552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5054552f7358SJed Brown PetscFunctionReturn(0); 5055552f7358SJed Brown } 5056552f7358SJed Brown 5057552f7358SJed Brown #undef __FUNCT__ 5058552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5059552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5060552f7358SJed Brown { 5061552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5062552f7358SJed Brown 5063552f7358SJed Brown PetscFunctionBegin; 5064552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5065552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5066552f7358SJed Brown PetscFunctionReturn(0); 5067552f7358SJed Brown } 5068552f7358SJed Brown 5069552f7358SJed Brown #undef __FUNCT__ 5070552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5071552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5072ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5073552f7358SJed Brown { 5074552f7358SJed Brown PetscSection section, globalSection; 5075552f7358SJed Brown PetscInt *numbers, p; 5076552f7358SJed Brown PetscErrorCode ierr; 5077552f7358SJed Brown 5078552f7358SJed Brown PetscFunctionBegin; 507982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5080552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5081552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5082552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5083552f7358SJed Brown } 5084552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5085552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5086854ce69bSBarry Smith ierr = PetscMalloc1(pEnd - pStart, &numbers);CHKERRQ(ierr); 5087552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5088552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5089ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5090ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5091552f7358SJed Brown } 509282f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5093ef48cebcSMatthew G. Knepley if (globalSize) { 5094ef48cebcSMatthew G. Knepley PetscLayout layout; 5095ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5096ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5097ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5098ef48cebcSMatthew G. Knepley } 5099552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5100552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5101552f7358SJed Brown PetscFunctionReturn(0); 5102552f7358SJed Brown } 5103552f7358SJed Brown 5104552f7358SJed Brown #undef __FUNCT__ 5105552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5106552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5107552f7358SJed Brown { 5108552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5109552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5110552f7358SJed Brown PetscErrorCode ierr; 5111552f7358SJed Brown 5112552f7358SJed Brown PetscFunctionBegin; 5113552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5114552f7358SJed Brown if (!mesh->globalCellNumbers) { 5115552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5116552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 51170298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 51180d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5119ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5120552f7358SJed Brown } 5121552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5122552f7358SJed Brown PetscFunctionReturn(0); 5123552f7358SJed Brown } 5124552f7358SJed Brown 5125552f7358SJed Brown #undef __FUNCT__ 5126552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5127552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5128552f7358SJed Brown { 5129552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5130552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5131552f7358SJed Brown PetscErrorCode ierr; 5132552f7358SJed Brown 5133552f7358SJed Brown PetscFunctionBegin; 5134552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5135552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5136552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 51370298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 51380d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5139ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5140552f7358SJed Brown } 5141552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5142552f7358SJed Brown PetscFunctionReturn(0); 5143552f7358SJed Brown } 5144552f7358SJed Brown 5145ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5146ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5147ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5148ef48cebcSMatthew G. Knepley { 5149ef48cebcSMatthew G. Knepley IS nums[4]; 5150ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5151ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5152ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5153ef48cebcSMatthew G. Knepley 5154ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5155ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5156ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 51578abc87a0SMichael Lange /* For unstratified meshes use dim instead of depth */ 51588abc87a0SMichael Lange if (depth < 0) {ierr = DMGetDimension(dm, &depth);CHKERRQ(ierr);} 5159ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5160ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5161ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5162ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5163ef48cebcSMatthew G. Knepley 5164ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5165ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5166ef48cebcSMatthew G. Knepley shift += gsize; 5167ef48cebcSMatthew G. Knepley } 5168302440fdSBarry Smith ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers);CHKERRQ(ierr); 5169ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5170ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5171ef48cebcSMatthew G. Knepley } 5172ef48cebcSMatthew G. Knepley 5173552f7358SJed Brown 5174552f7358SJed Brown #undef __FUNCT__ 5175552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5176552f7358SJed Brown /*@C 5177552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5178552f7358SJed Brown the local section and an SF describing the section point overlap. 5179552f7358SJed Brown 5180552f7358SJed Brown Input Parameters: 5181552f7358SJed Brown + s - The PetscSection for the local field layout 5182552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5183552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5184552f7358SJed Brown . label - The label specifying the points 5185552f7358SJed Brown - labelValue - The label stratum specifying the points 5186552f7358SJed Brown 5187552f7358SJed Brown Output Parameter: 5188552f7358SJed Brown . gsection - The PetscSection for the global field layout 5189552f7358SJed Brown 5190552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5191552f7358SJed Brown 5192552f7358SJed Brown Level: developer 5193552f7358SJed Brown 5194552f7358SJed Brown .seealso: PetscSectionCreate() 5195552f7358SJed Brown @*/ 5196552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5197552f7358SJed Brown { 51987ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5199552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5200552f7358SJed Brown PetscErrorCode ierr; 5201552f7358SJed Brown 5202552f7358SJed Brown PetscFunctionBegin; 52034c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5204552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5205552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 52067ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 52077ec39499SMatthew G. Knepley if (nroots >= 0) { 52087ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 52091795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 52107ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 52111795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 52127ec39499SMatthew G. Knepley } else { 52137ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 52147ec39499SMatthew G. Knepley } 52157ec39499SMatthew G. Knepley } 5216552f7358SJed Brown /* Mark ghost points with negative dof */ 5217552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5218552f7358SJed Brown PetscInt value; 5219552f7358SJed Brown 5220552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5221552f7358SJed Brown if (value != labelValue) continue; 5222552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5223552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5224552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5225552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 52267ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5227552f7358SJed Brown } 5228552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5229552f7358SJed Brown if (nroots >= 0) { 52307ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 52317ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5232552f7358SJed Brown if (nroots > pEnd-pStart) { 52337ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5234552f7358SJed Brown } 5235552f7358SJed Brown } 5236552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5237552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5238552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5239552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5240552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5241552f7358SJed Brown } 52424c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5243552f7358SJed Brown globalOff -= off; 5244552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5245552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 52467ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5247552f7358SJed Brown } 5248552f7358SJed Brown /* Put in negative offsets for ghost points */ 5249552f7358SJed Brown if (nroots >= 0) { 52507ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 52517ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5252552f7358SJed Brown if (nroots > pEnd-pStart) { 52537ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5254552f7358SJed Brown } 5255552f7358SJed Brown } 52567ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5257552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5258552f7358SJed Brown PetscFunctionReturn(0); 5259552f7358SJed Brown } 5260ca8062c8SMatthew G. Knepley 5261ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5262ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5263ca8062c8SMatthew G. Knepley /*@ 5264ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5265ca8062c8SMatthew G. Knepley 5266ca8062c8SMatthew G. Knepley Input Parameters: 5267ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5268ca8062c8SMatthew G. Knepley 5269ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5270ca8062c8SMatthew G. Knepley 5271ca8062c8SMatthew G. Knepley Level: developer 5272ca8062c8SMatthew G. Knepley 52739bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5274ca8062c8SMatthew G. Knepley @*/ 5275ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5276ca8062c8SMatthew G. Knepley { 5277ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5278ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5279ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5280ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5281ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5282ca8062c8SMatthew G. Knepley 5283ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5284ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5285ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5286ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5287ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5288ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5289ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5290ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5291ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5292ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 529342e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 529442e66dfaSMatthew G. Knepley PetscInt d; 529542e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 529642e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 529742e66dfaSMatthew G. Knepley } 5298ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5299ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5300ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5301ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5302ca8062c8SMatthew G. Knepley } 530342e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5304302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);CHKERRQ(ierr); 5305ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5306302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);CHKERRQ(ierr); 5307ca8062c8SMatthew G. Knepley } 5308302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5309302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);CHKERRQ(ierr); 5310ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5311302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);CHKERRQ(ierr); 5312ca8062c8SMatthew G. Knepley } 5313302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5314302440fdSBarry Smith if (dup) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 5315302440fdSBarry Smith else SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5316ca8062c8SMatthew G. Knepley } 531742e66dfaSMatthew G. Knepley } 5318ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5319ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5320ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5321ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5322ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5323ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5324ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5325ca8062c8SMatthew G. Knepley } 5326ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5327302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);CHKERRQ(ierr); 5328ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5329302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);CHKERRQ(ierr); 5330ca8062c8SMatthew G. Knepley } 5331302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5332302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);CHKERRQ(ierr); 5333ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5334302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);CHKERRQ(ierr); 5335ca8062c8SMatthew G. Knepley } 5336302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5337ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5338ca8062c8SMatthew G. Knepley } 5339ca8062c8SMatthew G. Knepley } 5340ca8062c8SMatthew G. Knepley } 5341ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5342ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5343ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5344ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5345ca8062c8SMatthew G. Knepley } 5346ca8062c8SMatthew G. Knepley 5347ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5348ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5349ca8062c8SMatthew G. Knepley /*@ 5350ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5351ca8062c8SMatthew G. Knepley 5352ca8062c8SMatthew G. Knepley Input Parameters: 5353ca8062c8SMatthew G. Knepley + dm - The DMPlex object 535458723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 535558723a97SMatthew G. Knepley - cellHeight - Normally 0 5356ca8062c8SMatthew G. Knepley 5357ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5358ca8062c8SMatthew G. Knepley 5359ca8062c8SMatthew G. Knepley Level: developer 5360ca8062c8SMatthew G. Knepley 53619bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5362ca8062c8SMatthew G. Knepley @*/ 536358723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5364ca8062c8SMatthew G. Knepley { 536542363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5366ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5367ca8062c8SMatthew G. Knepley 5368ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5369ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5370c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5371ca8062c8SMatthew G. Knepley switch (dim) { 537242363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 537342363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 537442363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5375ca8062c8SMatthew G. Knepley default: 5376ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5377ca8062c8SMatthew G. Knepley } 537858723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 537958723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5380ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5381ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5382ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 538358723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 538458723a97SMatthew G. Knepley 538558723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 538658723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 538758723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 538858723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 538958723a97SMatthew G. Knepley } 539058723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5391ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5392ca8062c8SMatthew G. Knepley } 539342363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 539442363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 539542363296SMatthew G. Knepley 539642363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 539742363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 539842363296SMatthew G. Knepley const PetscInt p = closure[cl]; 539942363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 540042363296SMatthew G. Knepley } 540142363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 540242363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 540342363296SMatthew G. Knepley } 5404ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5405ca8062c8SMatthew G. Knepley } 54069bf0dad6SMatthew G. Knepley 54079bf0dad6SMatthew G. Knepley #undef __FUNCT__ 54089bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 54099bf0dad6SMatthew G. Knepley /*@ 54109bf0dad6SMatthew 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 54119bf0dad6SMatthew G. Knepley 54129bf0dad6SMatthew G. Knepley Input Parameters: 54139bf0dad6SMatthew G. Knepley + dm - The DMPlex object 54149bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 54159bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 54169bf0dad6SMatthew G. Knepley 54179bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 54189bf0dad6SMatthew G. Knepley 54199bf0dad6SMatthew G. Knepley Level: developer 54209bf0dad6SMatthew G. Knepley 54219bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 54229bf0dad6SMatthew G. Knepley @*/ 54239bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 54249bf0dad6SMatthew G. Knepley { 54253554e41dSMatthew G. Knepley PetscInt pMax[4]; 54263554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 54279bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 54289bf0dad6SMatthew G. Knepley 54299bf0dad6SMatthew G. Knepley PetscFunctionBegin; 54309bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5431c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 54329bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 543325abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 54343554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 54353554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 54363554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 54379bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 54389bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 54399bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 54409bf0dad6SMatthew G. Knepley 544125abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 54429bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 54439bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 54449bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 54459bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 54469bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 54479bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 54489bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 54499bf0dad6SMatthew G. Knepley } 54503554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 54519bf0dad6SMatthew 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); 54529bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 54539bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 54549bf0dad6SMatthew G. Knepley 54559bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 54569bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 54579bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 54589bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 54599bf0dad6SMatthew G. Knepley } 5460e003ed69SMatthew 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); 54619bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5462e003ed69SMatthew 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]); 54639bf0dad6SMatthew G. Knepley } 54649bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 54659bf0dad6SMatthew G. Knepley } 54669bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 54679bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 54689bf0dad6SMatthew G. Knepley } 54693554e41dSMatthew G. Knepley } 5470552f7358SJed Brown PetscFunctionReturn(0); 5471552f7358SJed Brown } 54723913d7c8SMatthew G. Knepley 54733913d7c8SMatthew G. Knepley #undef __FUNCT__ 5474bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5475bceba477SMatthew G. Knepley /* Pointwise interpolation 5476bceba477SMatthew G. Knepley Just code FEM for now 5477bceba477SMatthew G. Knepley u^f = I u^c 54784ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 54794ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 54804ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5481bceba477SMatthew G. Knepley */ 5482bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5483bceba477SMatthew G. Knepley { 5484bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5485bceba477SMatthew G. Knepley PetscInt m, n; 5486a063dac3SMatthew G. Knepley void *ctx; 5487bceba477SMatthew G. Knepley PetscErrorCode ierr; 5488bceba477SMatthew G. Knepley 5489bceba477SMatthew G. Knepley PetscFunctionBegin; 5490bceba477SMatthew G. Knepley /* 5491bceba477SMatthew G. Knepley Loop over coarse cells 5492bceba477SMatthew G. Knepley Loop over coarse basis functions 5493bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5494bceba477SMatthew G. Knepley Loop over fine dual basis functions 5495bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5496bceba477SMatthew G. Knepley Sum 5497bceba477SMatthew G. Knepley Update local element matrix 5498bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5499bceba477SMatthew G. Knepley 5500bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5501bceba477SMatthew G. Knepley */ 5502bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5503bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5504bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5505bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5506bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5507bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5508bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5509bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5510a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5511a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 55125d1c2e58SMatthew G. Knepley /* Use naive scaling */ 55135d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5514a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5515a063dac3SMatthew G. Knepley } 5516bceba477SMatthew G. Knepley 5517a063dac3SMatthew G. Knepley #undef __FUNCT__ 5518a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 55196dbf9973SLawrence Mitchell PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, Mat *mat) 5520a063dac3SMatthew G. Knepley { 552190748bafSMatthew G. Knepley PetscErrorCode ierr; 55226dbf9973SLawrence Mitchell VecScatter ctx; 552390748bafSMatthew G. Knepley 5524a063dac3SMatthew G. Knepley PetscFunctionBegin; 55256dbf9973SLawrence Mitchell ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, &ctx, NULL);CHKERRQ(ierr); 55266dbf9973SLawrence Mitchell ierr = MatCreateScatter(PetscObjectComm((PetscObject)ctx), ctx, mat);CHKERRQ(ierr); 55276dbf9973SLawrence Mitchell ierr = VecScatterDestroy(&ctx);CHKERRQ(ierr); 5528bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5529bceba477SMatthew G. Knepley } 5530bceba477SMatthew G. Knepley 5531bceba477SMatthew G. Knepley #undef __FUNCT__ 5532fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5533fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5534fd59a867SMatthew G. Knepley { 5535fd59a867SMatthew G. Knepley PetscSection section; 5536fd59a867SMatthew G. Knepley IS *bcPoints; 5537ebb3236fSMatthew G. Knepley PetscBool *isFE; 5538286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5539ebb3236fSMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc = 0, f; 5540ebb3236fSMatthew G. Knepley PetscInt cStart, cEnd, cEndInterior; 5541fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5542fd59a867SMatthew G. Knepley 5543fd59a867SMatthew G. Knepley PetscFunctionBegin; 5544ebb3236fSMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5545ebb3236fSMatthew G. Knepley /* FE and FV boundary conditions are handled slightly differently */ 5546ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 5547ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5548ebb3236fSMatthew G. Knepley PetscObject obj; 5549ebb3236fSMatthew G. Knepley PetscClassId id; 5550ebb3236fSMatthew G. Knepley 5551ebb3236fSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5552ebb3236fSMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 5553ebb3236fSMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 5554ebb3236fSMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 5555ebb3236fSMatthew G. Knepley else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %d", f); 5556ebb3236fSMatthew G. Knepley } 55572f900235SMatthew G. Knepley /* Allocate boundary point storage for FEM boundaries */ 5558286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5559c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5560ebb3236fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 5561ebb3236fSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 5562fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5563fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 55642f900235SMatthew G. Knepley PetscInt field; 5565fd59a867SMatthew G. Knepley PetscBool isEssential; 55662f900235SMatthew G. Knepley 55672f900235SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, &field, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 55682f900235SMatthew G. Knepley if (isFE[field] && isEssential) ++numBC; 5569fd59a867SMatthew G. Knepley } 55702f900235SMatthew G. Knepley /* Add ghost cell boundaries for FVM */ 5571ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC; 5572fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 5573ebb3236fSMatthew G. Knepley /* Constrain ghost cells for FV */ 5574ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5575ebb3236fSMatthew G. Knepley PetscInt *newidx, c; 5576ebb3236fSMatthew G. Knepley 5577ebb3236fSMatthew G. Knepley if (isFE[f] || cEndInterior < 0) continue; 5578ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr); 5579ebb3236fSMatthew G. Knepley for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c; 5580ebb3236fSMatthew G. Knepley bcFields[bc] = f; 5581ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5582ebb3236fSMatthew G. Knepley } 5583ebb3236fSMatthew G. Knepley /* Handle FEM Dirichlet boundaries */ 5584ebb3236fSMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5585fd59a867SMatthew G. Knepley const char *bdLabel; 5586fd59a867SMatthew G. Knepley DMLabel label; 5587fd59a867SMatthew G. Knepley const PetscInt *values; 55887391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 5589c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 5590fd59a867SMatthew G. Knepley 559163d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 55922f900235SMatthew G. Knepley if (!isFE[field]) continue; 5593fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5594ebb3236fSMatthew G. Knepley /* Only want to modify label once */ 55957391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 55967391c1cbSMatthew G. Knepley const char *bdname; 55972f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 55987391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 55997391c1cbSMatthew G. Knepley if (duplicate) break; 56007391c1cbSMatthew G. Knepley } 5601ebb3236fSMatthew G. Knepley if (!duplicate && (isFE[field])) { 5602fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 560332720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 56047391c1cbSMatthew G. Knepley } 5605ebb3236fSMatthew G. Knepley /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */ 5606fd59a867SMatthew G. Knepley if (isEssential) { 560793a5981aSMatthew G. Knepley PetscInt *newidx; 5608ebb3236fSMatthew G. Knepley PetscInt n, newn = 0, p, v; 560993a5981aSMatthew G. Knepley 5610fd59a867SMatthew G. Knepley bcFields[bc] = field; 5611ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5612ebb3236fSMatthew G. Knepley IS tmp; 5613ebb3236fSMatthew G. Knepley const PetscInt *idx; 5614ebb3236fSMatthew G. Knepley 5615ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5616ebb3236fSMatthew G. Knepley if (!tmp) continue; 561793a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 561893a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5619ebb3236fSMatthew G. Knepley if (isFE[field]) { 562093a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 5621ebb3236fSMatthew G. Knepley } else { 5622ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn; 5623ebb3236fSMatthew G. Knepley } 562493a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 562593a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5626fd59a867SMatthew G. Knepley } 5627ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 5628ebb3236fSMatthew G. Knepley newn = 0; 5629ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5630ebb3236fSMatthew G. Knepley IS tmp; 5631ebb3236fSMatthew G. Knepley const PetscInt *idx; 5632ebb3236fSMatthew G. Knepley 5633ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5634ebb3236fSMatthew G. Knepley if (!tmp) continue; 5635ebb3236fSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 5636ebb3236fSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5637ebb3236fSMatthew G. Knepley if (isFE[field]) { 5638ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 5639ebb3236fSMatthew G. Knepley } else { 5640ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p]; 5641ebb3236fSMatthew G. Knepley } 5642ebb3236fSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 5643ebb3236fSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5644ebb3236fSMatthew G. Knepley } 5645ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5646ebb3236fSMatthew G. Knepley } 5647fd59a867SMatthew G. Knepley } 5648fd59a867SMatthew G. Knepley /* Handle discretization */ 5649ebb3236fSMatthew G. Knepley ierr = PetscCalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5650fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 56510bacfa0aSMatthew G. Knepley PetscObject obj; 56520bacfa0aSMatthew G. Knepley 56530bacfa0aSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5654ebb3236fSMatthew G. Knepley if (isFE[f]) { 56550bacfa0aSMatthew G. Knepley PetscFE fe = (PetscFE) obj; 5656286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5657fd59a867SMatthew G. Knepley PetscInt d; 5658fd59a867SMatthew G. Knepley 5659fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5660286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5661286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5662ebb3236fSMatthew G. Knepley } else { 56630bacfa0aSMatthew G. Knepley PetscFV fv = (PetscFV) obj; 56640bacfa0aSMatthew G. Knepley 56650bacfa0aSMatthew G. Knepley ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr); 56660bacfa0aSMatthew G. Knepley numDof[f*(dim+1)+dim] = numComp[f]; 5667ebb3236fSMatthew G. Knepley } 5668fd59a867SMatthew G. Knepley } 5669286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5670286d8613SMatthew G. Knepley PetscInt d; 5671286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5672286d8613SMatthew 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."); 5673286d8613SMatthew G. Knepley } 5674286d8613SMatthew G. Knepley } 5675f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 5676fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5677fd59a867SMatthew G. Knepley PetscFE fe; 5678fd59a867SMatthew G. Knepley const char *name; 567918abd763SMatthew G. Knepley 568018abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5681fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5682fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5683fd59a867SMatthew G. Knepley } 5684fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5685fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5686fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 5687fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 5688286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5689ebb3236fSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 5690bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5691bceba477SMatthew G. Knepley } 5692bceba477SMatthew G. Knepley 5693bceba477SMatthew G. Knepley #undef __FUNCT__ 56943913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 56953913d7c8SMatthew G. Knepley /*@ 56963913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 56973913d7c8SMatthew G. Knepley 56983913d7c8SMatthew G. Knepley Input Parameter: 56993913d7c8SMatthew G. Knepley . dm - The DMPlex object 57003913d7c8SMatthew G. Knepley 57013913d7c8SMatthew G. Knepley Output Parameter: 57023913d7c8SMatthew G. Knepley . cdm - The coarse DM 57033913d7c8SMatthew G. Knepley 57043913d7c8SMatthew G. Knepley Level: intermediate 57053913d7c8SMatthew G. Knepley 57063913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 57073913d7c8SMatthew G. Knepley @*/ 57083913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 57093913d7c8SMatthew G. Knepley { 57103913d7c8SMatthew G. Knepley PetscFunctionBegin; 57113913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 57123913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 57133913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 57143913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 57153913d7c8SMatthew G. Knepley } 57163913d7c8SMatthew G. Knepley 57173913d7c8SMatthew G. Knepley #undef __FUNCT__ 57183913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 57193913d7c8SMatthew G. Knepley /*@ 57203913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 57213913d7c8SMatthew G. Knepley 57223913d7c8SMatthew G. Knepley Input Parameters: 57233913d7c8SMatthew G. Knepley + dm - The DMPlex object 57243913d7c8SMatthew G. Knepley - cdm - The coarse DM 57253913d7c8SMatthew G. Knepley 57263913d7c8SMatthew G. Knepley Level: intermediate 57273913d7c8SMatthew G. Knepley 57283913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 57293913d7c8SMatthew G. Knepley @*/ 57303913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 57313913d7c8SMatthew G. Knepley { 57323913d7c8SMatthew G. Knepley DM_Plex *mesh; 57333913d7c8SMatthew G. Knepley PetscErrorCode ierr; 57343913d7c8SMatthew G. Knepley 57353913d7c8SMatthew G. Knepley PetscFunctionBegin; 57363913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 57373913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 57383913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 57393913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 57403913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 57413913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 57423913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 57433913d7c8SMatthew G. Knepley } 5744a68b90caSToby Isaac 5745f7c74593SToby Isaac /* anchors */ 5746a68b90caSToby Isaac #undef __FUNCT__ 5747a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors" 5748a68b90caSToby Isaac /*@ 5749f7c74593SToby Isaac DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints. Typically, the user will not have to 5750f7c74593SToby Isaac call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints(). 5751a68b90caSToby Isaac 5752e228b242SToby Isaac not collective 5753a68b90caSToby Isaac 5754a68b90caSToby Isaac Input Parameters: 5755a68b90caSToby Isaac . dm - The DMPlex object 5756a68b90caSToby Isaac 5757a68b90caSToby Isaac Output Parameters: 5758a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 5759a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 5760a68b90caSToby Isaac 5761a68b90caSToby Isaac 5762a68b90caSToby Isaac Level: intermediate 5763a68b90caSToby Isaac 5764f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints() 5765a68b90caSToby Isaac @*/ 5766a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS) 5767a68b90caSToby Isaac { 5768a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 576941e6d900SToby Isaac PetscErrorCode ierr; 5770a68b90caSToby Isaac 5771a68b90caSToby Isaac PetscFunctionBegin; 5772a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 577341e6d900SToby Isaac if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);} 5774a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 5775a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 5776a68b90caSToby Isaac PetscFunctionReturn(0); 5777a68b90caSToby Isaac } 5778a68b90caSToby Isaac 5779a68b90caSToby Isaac #undef __FUNCT__ 5780a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors" 5781a68b90caSToby Isaac /*@ 5782f7c74593SToby Isaac DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints. Unlike boundary conditions, 5783f7c74593SToby Isaac when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a 5784a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 5785a68b90caSToby Isaac 5786a17985deSToby Isaac After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling 5787f7c74593SToby Isaac DMGetConstraints() and filling in the entries in the constraint matrix. 5788a68b90caSToby Isaac 5789e228b242SToby Isaac collective on dm 5790a68b90caSToby Isaac 5791a68b90caSToby Isaac Input Parameters: 5792a68b90caSToby Isaac + dm - The DMPlex object 5793e228b242SToby Isaac . anchorSection - The section that describes the mapping from constrained points to the anchor points listed in anchorIS. Must have a local communicator (PETSC_COMM_SELF or derivative). 5794e228b242SToby Isaac - anchorIS - The list of all anchor points. Must have a local communicator (PETSC_COMM_SELF or derivative). 5795a68b90caSToby Isaac 5796a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 5797a68b90caSToby Isaac 5798a68b90caSToby Isaac Level: intermediate 5799a68b90caSToby Isaac 5800f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints() 5801a68b90caSToby Isaac @*/ 5802a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS) 5803a68b90caSToby Isaac { 5804a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 5805e228b242SToby Isaac PetscMPIInt result; 5806a68b90caSToby Isaac PetscErrorCode ierr; 5807a68b90caSToby Isaac 5808a68b90caSToby Isaac PetscFunctionBegin; 5809a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5810e228b242SToby Isaac if (anchorSection) { 5811e228b242SToby Isaac PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2); 5812e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr); 5813e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator"); 5814e228b242SToby Isaac } 5815e228b242SToby Isaac if (anchorIS) { 5816e228b242SToby Isaac PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3); 5817e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr); 5818e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator"); 5819e228b242SToby Isaac } 5820a68b90caSToby Isaac 5821a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 5822a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 5823a68b90caSToby Isaac plex->anchorSection = anchorSection; 5824a68b90caSToby Isaac 5825a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 5826a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 5827a68b90caSToby Isaac plex->anchorIS = anchorIS; 5828a68b90caSToby Isaac 5829a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 5830a68b90caSToby Isaac if (anchorIS && anchorSection) { 5831a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 5832a68b90caSToby Isaac const PetscInt *anchors; 5833a68b90caSToby Isaac 5834a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5835a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 5836a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 5837a68b90caSToby Isaac for (a = 0; a < size; a++) { 5838a68b90caSToby Isaac PetscInt p; 5839a68b90caSToby Isaac 5840a68b90caSToby Isaac p = anchors[a]; 5841a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 5842a68b90caSToby Isaac PetscInt dof; 5843a68b90caSToby Isaac 5844a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5845a68b90caSToby Isaac if (dof) { 5846a68b90caSToby Isaac PetscErrorCode ierr2; 5847a68b90caSToby Isaac 5848a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 5849a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 5850a68b90caSToby Isaac } 5851a68b90caSToby Isaac } 5852a68b90caSToby Isaac } 5853a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 5854a68b90caSToby Isaac } 5855a68b90caSToby Isaac #endif 5856f7c74593SToby Isaac /* reset the generic constraints */ 5857f7c74593SToby Isaac ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr); 5858a68b90caSToby Isaac PetscFunctionReturn(0); 5859a68b90caSToby Isaac } 5860a68b90caSToby Isaac 5861a68b90caSToby Isaac #undef __FUNCT__ 5862f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors" 5863f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec) 5864a68b90caSToby Isaac { 5865f7c74593SToby Isaac PetscSection anchorSection; 5866*6995de1eSToby Isaac PetscInt pStart, pEnd, sStart, sEnd, p, dof, numFields, f; 5867a68b90caSToby Isaac PetscErrorCode ierr; 5868a68b90caSToby Isaac 5869a68b90caSToby Isaac PetscFunctionBegin; 5870a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5871a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 5872e228b242SToby Isaac ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr); 5873a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 5874*6995de1eSToby Isaac if (numFields) { 5875a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 5876*6995de1eSToby Isaac } 5877a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5878*6995de1eSToby Isaac ierr = PetscSectionGetChart(section,&sStart,&sEnd);CHKERRQ(ierr); 5879*6995de1eSToby Isaac pStart = PetscMax(pStart,sStart); 5880*6995de1eSToby Isaac pEnd = PetscMin(pEnd,sEnd); 5881*6995de1eSToby Isaac pEnd = PetscMax(pStart,pEnd); 5882a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 5883a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 5884a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5885a68b90caSToby Isaac if (dof) { 5886a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 5887a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 5888a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 5889a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 5890a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 5891a68b90caSToby Isaac } 5892a68b90caSToby Isaac } 5893a68b90caSToby Isaac } 5894a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 5895a68b90caSToby Isaac PetscFunctionReturn(0); 5896a68b90caSToby Isaac } 5897a68b90caSToby Isaac 5898a68b90caSToby Isaac #undef __FUNCT__ 5899f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors" 5900f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat) 5901a68b90caSToby Isaac { 5902f7c74593SToby Isaac PetscSection aSec; 59030ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 59040ac89760SToby Isaac const PetscInt *anchors; 59050ac89760SToby Isaac PetscInt numFields, f; 590666ad2231SToby Isaac IS aIS; 59070ac89760SToby Isaac PetscErrorCode ierr; 59080ac89760SToby Isaac 59090ac89760SToby Isaac PetscFunctionBegin; 59100ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59110ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 59120ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 59130ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 59140ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 5915302440fdSBarry Smith ierr = MatSetType(*cMat,MATSEQAIJ);CHKERRQ(ierr); 5916a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 591766ad2231SToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 5918*6995de1eSToby Isaac /* cSec will be a subset of aSec and section */ 5919*6995de1eSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 59200ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 59210ac89760SToby Isaac i[0] = 0; 59220ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 59230ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 59240ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 59250ac89760SToby Isaac if (!dof) continue; 59260ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 59270ac89760SToby Isaac if (numFields) { 59280ac89760SToby Isaac for (f = 0; f < numFields; f++) { 59290ac89760SToby Isaac annz = 0; 59300ac89760SToby Isaac for (q = 0; q < dof; q++) { 59310ac89760SToby Isaac a = anchors[off + q]; 59320ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 59330ac89760SToby Isaac annz += aDof; 59340ac89760SToby Isaac } 59350ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 59360ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 59370ac89760SToby Isaac for (q = 0; q < dof; q++) { 59380ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 59390ac89760SToby Isaac } 59400ac89760SToby Isaac } 59410ac89760SToby Isaac } 59420ac89760SToby Isaac else { 59430ac89760SToby Isaac annz = 0; 59440ac89760SToby Isaac for (q = 0; q < dof; q++) { 59450ac89760SToby Isaac a = anchors[off + q]; 59460ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 59470ac89760SToby Isaac annz += aDof; 59480ac89760SToby Isaac } 59490ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 59500ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 59510ac89760SToby Isaac for (q = 0; q < dof; q++) { 59520ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 59530ac89760SToby Isaac } 59540ac89760SToby Isaac } 59550ac89760SToby Isaac } 59560ac89760SToby Isaac nnz = i[m]; 59570ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 59580ac89760SToby Isaac offset = 0; 59590ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 59600ac89760SToby Isaac if (numFields) { 59610ac89760SToby Isaac for (f = 0; f < numFields; f++) { 59620ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 59630ac89760SToby Isaac for (q = 0; q < dof; q++) { 59640ac89760SToby Isaac PetscInt rDof, rOff, r; 59650ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 59660ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 59670ac89760SToby Isaac for (r = 0; r < rDof; r++) { 59680ac89760SToby Isaac PetscInt s; 59690ac89760SToby Isaac 59700ac89760SToby Isaac a = anchors[rOff + r]; 59710ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 59720ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 59730ac89760SToby Isaac for (s = 0; s < aDof; s++) { 59740ac89760SToby Isaac j[offset++] = aOff + s; 59750ac89760SToby Isaac } 59760ac89760SToby Isaac } 59770ac89760SToby Isaac } 59780ac89760SToby Isaac } 59790ac89760SToby Isaac } 59800ac89760SToby Isaac else { 59810ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 59820ac89760SToby Isaac for (q = 0; q < dof; q++) { 59830ac89760SToby Isaac PetscInt rDof, rOff, r; 59840ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 59850ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 59860ac89760SToby Isaac for (r = 0; r < rDof; r++) { 59870ac89760SToby Isaac PetscInt s; 59880ac89760SToby Isaac 59890ac89760SToby Isaac a = anchors[rOff + r]; 59900ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 59910ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 59920ac89760SToby Isaac for (s = 0; s < aDof; s++) { 59930ac89760SToby Isaac j[offset++] = aOff + s; 59940ac89760SToby Isaac } 59950ac89760SToby Isaac } 59960ac89760SToby Isaac } 59970ac89760SToby Isaac } 59980ac89760SToby Isaac } 59990ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 600025570a81SToby Isaac ierr = PetscFree(i);CHKERRQ(ierr); 600125570a81SToby Isaac ierr = PetscFree(j);CHKERRQ(ierr); 600266ad2231SToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 60030ac89760SToby Isaac PetscFunctionReturn(0); 60040ac89760SToby Isaac } 60050ac89760SToby Isaac 60060ac89760SToby Isaac #undef __FUNCT__ 600766ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex" 600866ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm) 600966ad2231SToby Isaac { 6010f7c74593SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6011f7c74593SToby Isaac PetscSection anchorSection, section, cSec; 601266ad2231SToby Isaac Mat cMat; 601366ad2231SToby Isaac PetscErrorCode ierr; 601466ad2231SToby Isaac 601566ad2231SToby Isaac PetscFunctionBegin; 601666ad2231SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6017a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 601866ad2231SToby Isaac if (anchorSection) { 6019e228b242SToby Isaac PetscDS ds; 6020e228b242SToby Isaac PetscInt nf; 6021e228b242SToby Isaac 6022f7c74593SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6023f7c74593SToby Isaac ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr); 6024f7c74593SToby Isaac ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr); 6025e228b242SToby Isaac ierr = DMGetDS(dm,&ds);CHKERRQ(ierr); 6026302440fdSBarry Smith ierr = PetscDSGetNumFields(ds,&nf);CHKERRQ(ierr); 6027e228b242SToby Isaac if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);} 602866ad2231SToby Isaac ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr); 602966ad2231SToby Isaac ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr); 603066ad2231SToby Isaac ierr = MatDestroy(&cMat);CHKERRQ(ierr); 603166ad2231SToby Isaac } 603266ad2231SToby Isaac PetscFunctionReturn(0); 603366ad2231SToby Isaac } 6034