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 */ 73b3bc66dSMichael Lange 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, DMPLEX_CreateGmsh; 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); 380*f6dae198SJed Brown if (PetscUnlikely(dof > 3)) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"coordSection vertex %D has dof %D > 3",v,dof); 3810588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 3820588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[off+d])); 3830588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 3840588280cSMatthew G. Knepley } 3850588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 3860588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 387552f7358SJed Brown for (d = 0; d < dof; ++d) { 388552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3890588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 390552f7358SJed Brown } 3910588280cSMatthew G. Knepley color = colors[rank%numColors]; 3920588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 3930588280cSMatthew G. Knepley PetscInt val; 3940588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 3950588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; isLabeled = PETSC_TRUE; break;} 3960588280cSMatthew G. Knepley } 3970588280cSMatthew G. Knepley if (useNumbers) { 398e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%d) [draw,shape=circle,color=%s] {%D};\n", v, rank, color, v);CHKERRQ(ierr); 3990588280cSMatthew G. Knepley } else { 400e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%d) [fill,inner sep=%dpt,shape=circle,color=%s] {};\n", v, rank, !isLabeled ? 1 : 2, color);CHKERRQ(ierr); 4010588280cSMatthew G. Knepley } 402552f7358SJed Brown } 403552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 404552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 405552f7358SJed Brown /* Plot edges */ 4060588280cSMatthew G. Knepley if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 4070588280cSMatthew G. Knepley if (dim < 3 && useNumbers) { 408552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 409552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 410552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 411552f7358SJed Brown const PetscInt *cone; 412552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 413552f7358SJed Brown 414552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 41582f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 416552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 417552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 418552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 419552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 420552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 421552f7358SJed Brown for (d = 0; d < dof; ++d) { 4220588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[offA+d]+coords[offB+d])); 4230588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 424552f7358SJed Brown } 4250588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 4260588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 4270588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 4280588280cSMatthew G. Knepley if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 4290588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 4300588280cSMatthew G. Knepley } 4310588280cSMatthew G. Knepley color = colors[rank%numColors]; 4320588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 4330588280cSMatthew G. Knepley PetscInt val; 4340588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 4350750fff4SMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 4360588280cSMatthew G. Knepley } 437e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%d) [draw,shape=circle,color=%s] {%D} --\n", e, rank, color, e);CHKERRQ(ierr); 438552f7358SJed Brown } 439552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 440552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 441552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 4420588280cSMatthew G. Knepley } 443552f7358SJed Brown /* Plot cells */ 4440588280cSMatthew G. Knepley if (dim == 3 || !useNumbers) { 4450588280cSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 4460588280cSMatthew G. Knepley const PetscInt *cone; 4470588280cSMatthew G. Knepley 4480588280cSMatthew G. Knepley color = colors[rank%numColors]; 4490588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 4500588280cSMatthew G. Knepley PetscInt val; 4510588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], e, &val);CHKERRQ(ierr); 4520588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 4530588280cSMatthew G. Knepley } 4540588280cSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 455e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] (%D_%d) -- (%D_%d);\n", color, cone[0], rank, cone[1], rank);CHKERRQ(ierr); 4560588280cSMatthew G. Knepley } 4570588280cSMatthew G. Knepley } else { 458552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 459552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4600298fd71SBarry Smith PetscInt *closure = NULL; 461552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 462552f7358SJed Brown 463552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 464552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 465552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 466552f7358SJed Brown const PetscInt point = closure[p]; 467552f7358SJed Brown 468552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 469552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 470e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%d)", point, rank);CHKERRQ(ierr); 471552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 472552f7358SJed Brown } 473552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 474e4b003c7SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%d);\n", firstPoint, rank);CHKERRQ(ierr); 475552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 476552f7358SJed Brown } 4770588280cSMatthew G. Knepley } 478552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 4790588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n");CHKERRQ(ierr); 480770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 4810588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) {ierr = PetscFree(names[l]);CHKERRQ(ierr);} 4820588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscFree(colors[c]);CHKERRQ(ierr);} 4830588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscFree(lcolors[c]);CHKERRQ(ierr);} 4840588280cSMatthew G. Knepley ierr = PetscFree3(names, colors, lcolors);CHKERRQ(ierr); 485552f7358SJed Brown } else { 48682f516ccSBarry Smith MPI_Comm comm; 487834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 488834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 489552f7358SJed Brown PetscInt pStart, pEnd, p; 490a57dd577SMatthew G Knepley PetscInt numLabels, l; 4911143a3c0SMatthew G. Knepley const char *name; 492552f7358SJed Brown PetscMPIInt size; 493552f7358SJed Brown 49482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 495552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 496c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4975f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 4981143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 4991143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 500552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 501552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 502bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 503dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 504552f7358SJed Brown if (depth == 1) { 505552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 506552f7358SJed Brown pEnd = pEnd - pStart; 507552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 508552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 509552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 510552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 511552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 512552f7358SJed Brown pEnd = pEnd - pStart; 513552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 514552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 515552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 516552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 517552f7358SJed Brown } else { 518552f7358SJed Brown for (d = 0; d <= dim; d++) { 519552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 520834065abSMatthew G. Knepley pEnd -= pStart; 521834065abSMatthew G. Knepley pMax[d] -= pStart; 522552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 523834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 524552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 525834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 526834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 527834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 528834065abSMatthew G. Knepley } 529552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 530552f7358SJed Brown } 531552f7358SJed Brown } 532834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 533a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 534a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 535a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 536a57dd577SMatthew G Knepley DMLabel label; 537a57dd577SMatthew G Knepley const char *name; 538a57dd577SMatthew G Knepley IS valueIS; 539a57dd577SMatthew G Knepley const PetscInt *values; 540a57dd577SMatthew G Knepley PetscInt numValues, v; 541a57dd577SMatthew G Knepley 542a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 543a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 544a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 545a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 546a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 547a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 548a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 549a57dd577SMatthew G Knepley PetscInt size; 550a57dd577SMatthew G Knepley 551a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 552a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 553a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 554a57dd577SMatthew G Knepley } 555a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 556a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 5574d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 558a57dd577SMatthew G Knepley } 559552f7358SJed Brown } 560552f7358SJed Brown PetscFunctionReturn(0); 561552f7358SJed Brown } 562552f7358SJed Brown 563552f7358SJed Brown #undef __FUNCT__ 564552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 565552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 566552f7358SJed Brown { 567fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 568552f7358SJed Brown PetscErrorCode ierr; 569552f7358SJed Brown 570552f7358SJed Brown PetscFunctionBegin; 571552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 572552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 573552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 574fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 575c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 576552f7358SJed Brown if (iascii) { 577552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 578c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 579c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 5807afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 581c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 5827afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 583c6ccd67eSMatthew G. Knepley #else 584c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 585552f7358SJed Brown #endif 58611aeaf0aSBarry Smith } 587fcf6c8fdSToby Isaac else if (isvtk) { 588fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 589fcf6c8fdSToby Isaac } 590552f7358SJed Brown PetscFunctionReturn(0); 591552f7358SJed Brown } 592552f7358SJed Brown 5932c40f234SMatthew G. Knepley #undef __FUNCT__ 5942c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 5952c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 5962c40f234SMatthew G. Knepley { 5972c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 5982c40f234SMatthew G. Knepley PetscErrorCode ierr; 5992c40f234SMatthew G. Knepley 6002c40f234SMatthew G. Knepley PetscFunctionBegin; 6012c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6022c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 6032c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 6042c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 6052c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 6062c40f234SMatthew G. Knepley else if (ishdf5) { 6072c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 60810b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 6092c40f234SMatthew G. Knepley #else 6102c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 611552f7358SJed Brown #endif 612552f7358SJed Brown } 613552f7358SJed Brown PetscFunctionReturn(0); 614552f7358SJed Brown } 615552f7358SJed Brown 616552f7358SJed Brown #undef __FUNCT__ 6176c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 6186c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 6196c73c22cSMatthew G. Knepley { 6206c73c22cSMatthew G. Knepley DMBoundary b, next; 6216c73c22cSMatthew G. Knepley PetscErrorCode ierr; 6226c73c22cSMatthew G. Knepley 6238e136ac0SMatthew G. Knepley PetscFunctionBegin; 6246c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 6256c73c22cSMatthew G. Knepley b = *boundary; 6266c73c22cSMatthew G. Knepley *boundary = NULL; 6276c73c22cSMatthew G. Knepley for (; b; b = next) { 6286c73c22cSMatthew G. Knepley next = b->next; 6290e0f25f2SMatthew G. Knepley ierr = PetscFree(b->comps);CHKERRQ(ierr); 6306c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 6316c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 63263d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 6336c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 6346c73c22cSMatthew G. Knepley } 6356c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 6366c73c22cSMatthew G. Knepley } 6376c73c22cSMatthew G. Knepley 6386c73c22cSMatthew G. Knepley #undef __FUNCT__ 639552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 640552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 641552f7358SJed Brown { 642552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 643a85475f2SMatthew G. Knepley PlexLabel next = mesh->labels; 644552f7358SJed Brown PetscErrorCode ierr; 645552f7358SJed Brown 646552f7358SJed Brown PetscFunctionBegin; 6470d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 648552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 649552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 650552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 651552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 652552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 653552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 654d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->tetgenOpts);CHKERRQ(ierr); 655d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->triangleOpts);CHKERRQ(ierr); 65677623264SMatthew G. Knepley ierr = PetscPartitionerDestroy(&mesh->partitioner);CHKERRQ(ierr); 657552f7358SJed Brown while (next) { 658a85475f2SMatthew G. Knepley PlexLabel tmp = next->next; 659552f7358SJed Brown 660a85475f2SMatthew G. Knepley ierr = DMLabelDestroy(&next->label);CHKERRQ(ierr); 661a85475f2SMatthew G. Knepley ierr = PetscFree(next);CHKERRQ(ierr); 662552f7358SJed Brown next = tmp; 663552f7358SJed Brown } 6643913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 665a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 666552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 667552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 6686c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 669a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 670a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 671d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr); 672d961a43aSToby Isaac ierr = PetscFree(mesh->parents);CHKERRQ(ierr); 673d961a43aSToby Isaac ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr); 674d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr); 675d961a43aSToby Isaac ierr = PetscFree(mesh->children);CHKERRQ(ierr); 676d6a7ad0dSToby Isaac ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr); 677552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 678552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 679552f7358SJed Brown PetscFunctionReturn(0); 680552f7358SJed Brown } 681552f7358SJed Brown 682552f7358SJed Brown #undef __FUNCT__ 683552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 684b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 685552f7358SJed Brown { 6868d1174e4SMatthew G. Knepley PetscSection sectionGlobal; 687552f7358SJed Brown PetscInt bs = -1; 688552f7358SJed Brown PetscInt localSize; 68989545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 690552f7358SJed Brown PetscErrorCode ierr; 691b412c318SBarry Smith MatType mtype; 6921428887cSShri Abhyankar ISLocalToGlobalMapping ltog; 693552f7358SJed Brown 694552f7358SJed Brown PetscFunctionBegin; 695607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 696b412c318SBarry Smith mtype = dm->mattype; 697552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 698552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 699552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 70082f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 701552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 702552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 703552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 704552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 705552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 706552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 707552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 708552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 709552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 710552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 711552f7358SJed Brown if (!isShell) { 712552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 7132a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 714552f7358SJed Brown 715552f7358SJed Brown if (bs < 0) { 716552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 717fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 718552f7358SJed Brown 719552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 720552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 721552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 722fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 723fad22124SMatthew G Knepley if (dof-cdof) { 7242a28c762SMatthew G Knepley if (bs < 0) { 725fad22124SMatthew G Knepley bs = dof-cdof; 726fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 7272a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 7282a28c762SMatthew G Knepley bs = 1; 729552f7358SJed Brown break; 730552f7358SJed Brown } 731552f7358SJed Brown } 7322a28c762SMatthew G Knepley } 7332a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 7342a28c762SMatthew G Knepley bsLocal = bs; 73582f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 7362a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 73782f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 7382a28c762SMatthew G Knepley if (bsMin != bsMax) { 7392a28c762SMatthew G Knepley bs = 1; 7402a28c762SMatthew G Knepley } else { 7412a28c762SMatthew G Knepley bs = bsMax; 7422a28c762SMatthew G Knepley } 743552f7358SJed Brown } else { 744552f7358SJed Brown bs = 1; 745552f7358SJed Brown } 746552f7358SJed Brown } 7471795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 7488d1174e4SMatthew G. Knepley ierr = DMPlexPreallocateOperator(dm, bs, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 749552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 7501428887cSShri Abhyankar 7511428887cSShri Abhyankar /* Set localtoglobalmapping on the matrix for MatSetValuesLocal() to work */ 7521428887cSShri Abhyankar ierr = DMGetLocalToGlobalMapping(dm,<og);CHKERRQ(ierr); 7531428887cSShri Abhyankar ierr = MatSetLocalToGlobalMapping(*J,ltog,ltog);CHKERRQ(ierr); 754552f7358SJed Brown } 755552f7358SJed Brown PetscFunctionReturn(0); 756552f7358SJed Brown } 757552f7358SJed Brown 758552f7358SJed Brown #undef __FUNCT__ 759552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 760552f7358SJed Brown /*@ 761552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 762552f7358SJed Brown 763552f7358SJed Brown Not collective 764552f7358SJed Brown 765552f7358SJed Brown Input Parameter: 766552f7358SJed Brown . mesh - The DMPlex 767552f7358SJed Brown 768552f7358SJed Brown Output Parameters: 769552f7358SJed Brown + pStart - The first mesh point 770552f7358SJed Brown - pEnd - The upper bound for mesh points 771552f7358SJed Brown 772552f7358SJed Brown Level: beginner 773552f7358SJed Brown 774552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 775552f7358SJed Brown @*/ 776552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 777552f7358SJed Brown { 778552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 779552f7358SJed Brown PetscErrorCode ierr; 780552f7358SJed Brown 781552f7358SJed Brown PetscFunctionBegin; 782552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 783552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 784552f7358SJed Brown PetscFunctionReturn(0); 785552f7358SJed Brown } 786552f7358SJed Brown 787552f7358SJed Brown #undef __FUNCT__ 788552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 789552f7358SJed Brown /*@ 790552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 791552f7358SJed Brown 792552f7358SJed Brown Not collective 793552f7358SJed Brown 794552f7358SJed Brown Input Parameters: 795552f7358SJed Brown + mesh - The DMPlex 796552f7358SJed Brown . pStart - The first mesh point 797552f7358SJed Brown - pEnd - The upper bound for mesh points 798552f7358SJed Brown 799552f7358SJed Brown Output Parameters: 800552f7358SJed Brown 801552f7358SJed Brown Level: beginner 802552f7358SJed Brown 803552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 804552f7358SJed Brown @*/ 805552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 806552f7358SJed Brown { 807552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 808552f7358SJed Brown PetscErrorCode ierr; 809552f7358SJed Brown 810552f7358SJed Brown PetscFunctionBegin; 811552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 812552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 813552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 814552f7358SJed Brown PetscFunctionReturn(0); 815552f7358SJed Brown } 816552f7358SJed Brown 817552f7358SJed Brown #undef __FUNCT__ 818552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 819552f7358SJed Brown /*@ 820552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 821552f7358SJed Brown 822552f7358SJed Brown Not collective 823552f7358SJed Brown 824552f7358SJed Brown Input Parameters: 825552f7358SJed Brown + mesh - The DMPlex 826552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 827552f7358SJed Brown 828552f7358SJed Brown Output Parameter: 829552f7358SJed Brown . size - The cone size for point p 830552f7358SJed Brown 831552f7358SJed Brown Level: beginner 832552f7358SJed Brown 833552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 834552f7358SJed Brown @*/ 835552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 836552f7358SJed Brown { 837552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 838552f7358SJed Brown PetscErrorCode ierr; 839552f7358SJed Brown 840552f7358SJed Brown PetscFunctionBegin; 841552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 842552f7358SJed Brown PetscValidPointer(size, 3); 843552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 844552f7358SJed Brown PetscFunctionReturn(0); 845552f7358SJed Brown } 846552f7358SJed Brown 847552f7358SJed Brown #undef __FUNCT__ 848552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 849552f7358SJed Brown /*@ 850552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 851552f7358SJed Brown 852552f7358SJed Brown Not collective 853552f7358SJed Brown 854552f7358SJed Brown Input Parameters: 855552f7358SJed Brown + mesh - The DMPlex 856552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 857552f7358SJed Brown - size - The cone size for point p 858552f7358SJed Brown 859552f7358SJed Brown Output Parameter: 860552f7358SJed Brown 861552f7358SJed Brown Note: 862552f7358SJed Brown This should be called after DMPlexSetChart(). 863552f7358SJed Brown 864552f7358SJed Brown Level: beginner 865552f7358SJed Brown 866552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 867552f7358SJed Brown @*/ 868552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 869552f7358SJed Brown { 870552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 871552f7358SJed Brown PetscErrorCode ierr; 872552f7358SJed Brown 873552f7358SJed Brown PetscFunctionBegin; 874552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 875552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 8760d644c17SKarl Rupp 877552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 878552f7358SJed Brown PetscFunctionReturn(0); 879552f7358SJed Brown } 880552f7358SJed Brown 881552f7358SJed Brown #undef __FUNCT__ 882f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 883f5a469b9SMatthew G. Knepley /*@ 884f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 885f5a469b9SMatthew G. Knepley 886f5a469b9SMatthew G. Knepley Not collective 887f5a469b9SMatthew G. Knepley 888f5a469b9SMatthew G. Knepley Input Parameters: 889f5a469b9SMatthew G. Knepley + mesh - The DMPlex 890f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 891f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 892f5a469b9SMatthew G. Knepley 893f5a469b9SMatthew G. Knepley Output Parameter: 894f5a469b9SMatthew G. Knepley 895f5a469b9SMatthew G. Knepley Note: 896f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 897f5a469b9SMatthew G. Knepley 898f5a469b9SMatthew G. Knepley Level: beginner 899f5a469b9SMatthew G. Knepley 900f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 901f5a469b9SMatthew G. Knepley @*/ 902f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 903f5a469b9SMatthew G. Knepley { 904f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 905f5a469b9SMatthew G. Knepley PetscInt csize; 906f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 907f5a469b9SMatthew G. Knepley 908f5a469b9SMatthew G. Knepley PetscFunctionBegin; 909f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 910f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 911f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 912f5a469b9SMatthew G. Knepley 913f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 914f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 915f5a469b9SMatthew G. Knepley } 916f5a469b9SMatthew G. Knepley 917f5a469b9SMatthew G. Knepley #undef __FUNCT__ 918552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 919552f7358SJed Brown /*@C 920552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 921552f7358SJed Brown 922552f7358SJed Brown Not collective 923552f7358SJed Brown 924552f7358SJed Brown Input Parameters: 925552f7358SJed Brown + mesh - The DMPlex 926552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 927552f7358SJed Brown 928552f7358SJed Brown Output Parameter: 929552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 930552f7358SJed Brown 931552f7358SJed Brown Level: beginner 932552f7358SJed Brown 9333813dfbdSMatthew G Knepley Fortran Notes: 9343813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9353813dfbdSMatthew G Knepley include petsc.h90 in your code. 9363813dfbdSMatthew G Knepley 9373813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 938552f7358SJed Brown 939552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 940552f7358SJed Brown @*/ 941552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 942552f7358SJed Brown { 943552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 944552f7358SJed Brown PetscInt off; 945552f7358SJed Brown PetscErrorCode ierr; 946552f7358SJed Brown 947552f7358SJed Brown PetscFunctionBegin; 948552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 949552f7358SJed Brown PetscValidPointer(cone, 3); 950552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 951552f7358SJed Brown *cone = &mesh->cones[off]; 952552f7358SJed Brown PetscFunctionReturn(0); 953552f7358SJed Brown } 954552f7358SJed Brown 955552f7358SJed Brown #undef __FUNCT__ 956552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 957552f7358SJed Brown /*@ 958552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 959552f7358SJed Brown 960552f7358SJed Brown Not collective 961552f7358SJed Brown 962552f7358SJed Brown Input Parameters: 963552f7358SJed Brown + mesh - The DMPlex 964552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 965552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 966552f7358SJed Brown 967552f7358SJed Brown Output Parameter: 968552f7358SJed Brown 969552f7358SJed Brown Note: 970552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 971552f7358SJed Brown 972552f7358SJed Brown Level: beginner 973552f7358SJed Brown 974552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 975552f7358SJed Brown @*/ 976552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 977552f7358SJed Brown { 978552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 979552f7358SJed Brown PetscInt pStart, pEnd; 980552f7358SJed Brown PetscInt dof, off, c; 981552f7358SJed Brown PetscErrorCode ierr; 982552f7358SJed Brown 983552f7358SJed Brown PetscFunctionBegin; 984552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 985552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 986552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 987552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 988552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98982f516ccSBarry 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); 990552f7358SJed Brown for (c = 0; c < dof; ++c) { 99182f516ccSBarry 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); 992552f7358SJed Brown mesh->cones[off+c] = cone[c]; 993552f7358SJed Brown } 994552f7358SJed Brown PetscFunctionReturn(0); 995552f7358SJed Brown } 996552f7358SJed Brown 997552f7358SJed Brown #undef __FUNCT__ 998552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 999552f7358SJed Brown /*@C 1000552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 1001552f7358SJed Brown 1002552f7358SJed Brown Not collective 1003552f7358SJed Brown 1004552f7358SJed Brown Input Parameters: 1005552f7358SJed Brown + mesh - The DMPlex 1006552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1007552f7358SJed Brown 1008552f7358SJed Brown Output Parameter: 1009552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1010552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1011552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1012552f7358SJed Brown the index of the cone point on which to start. 1013552f7358SJed Brown 1014552f7358SJed Brown Level: beginner 1015552f7358SJed Brown 10163813dfbdSMatthew G Knepley Fortran Notes: 10173813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10183813dfbdSMatthew G Knepley include petsc.h90 in your code. 10193813dfbdSMatthew G Knepley 10203813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 1021552f7358SJed Brown 1022552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 1023552f7358SJed Brown @*/ 1024552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 1025552f7358SJed Brown { 1026552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1027552f7358SJed Brown PetscInt off; 1028552f7358SJed Brown PetscErrorCode ierr; 1029552f7358SJed Brown 1030552f7358SJed Brown PetscFunctionBegin; 1031552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1032552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 1033552f7358SJed Brown { 1034552f7358SJed Brown PetscInt dof; 1035552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1036552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1037552f7358SJed Brown } 1038552f7358SJed Brown #endif 1039552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 10400d644c17SKarl Rupp 1041552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 1042552f7358SJed Brown PetscFunctionReturn(0); 1043552f7358SJed Brown } 1044552f7358SJed Brown 1045552f7358SJed Brown #undef __FUNCT__ 1046552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 1047552f7358SJed Brown /*@ 1048552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 1049552f7358SJed Brown 1050552f7358SJed Brown Not collective 1051552f7358SJed Brown 1052552f7358SJed Brown Input Parameters: 1053552f7358SJed Brown + mesh - The DMPlex 1054552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1055552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1056552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1057552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1058552f7358SJed Brown the index of the cone point on which to start. 1059552f7358SJed Brown 1060552f7358SJed Brown Output Parameter: 1061552f7358SJed Brown 1062552f7358SJed Brown Note: 1063552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 1064552f7358SJed Brown 1065552f7358SJed Brown Level: beginner 1066552f7358SJed Brown 1067552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 1068552f7358SJed Brown @*/ 1069552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 1070552f7358SJed Brown { 1071552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1072552f7358SJed Brown PetscInt pStart, pEnd; 1073552f7358SJed Brown PetscInt dof, off, c; 1074552f7358SJed Brown PetscErrorCode ierr; 1075552f7358SJed Brown 1076552f7358SJed Brown PetscFunctionBegin; 1077552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1078552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 1079552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1080552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1081552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 108282f516ccSBarry 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); 1083552f7358SJed Brown for (c = 0; c < dof; ++c) { 1084552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 1085552f7358SJed Brown 1086552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 108782f516ccSBarry 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); 1088552f7358SJed Brown mesh->coneOrientations[off+c] = o; 1089552f7358SJed Brown } 1090552f7358SJed Brown PetscFunctionReturn(0); 1091552f7358SJed Brown } 1092552f7358SJed Brown 1093552f7358SJed Brown #undef __FUNCT__ 1094552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 1095552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 1096552f7358SJed Brown { 1097552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1098552f7358SJed Brown PetscInt pStart, pEnd; 1099552f7358SJed Brown PetscInt dof, off; 1100552f7358SJed Brown PetscErrorCode ierr; 1101552f7358SJed Brown 1102552f7358SJed Brown PetscFunctionBegin; 1103552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1104552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 110582f516ccSBarry 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); 110682f516ccSBarry 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); 110777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 110877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 110977c88f5bSMatthew 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); 1110552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 1111552f7358SJed Brown PetscFunctionReturn(0); 1112552f7358SJed Brown } 1113552f7358SJed Brown 1114552f7358SJed Brown #undef __FUNCT__ 111577c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 111677c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 111777c88f5bSMatthew G Knepley { 111877c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 111977c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 112077c88f5bSMatthew G Knepley PetscInt dof, off; 112177c88f5bSMatthew G Knepley PetscErrorCode ierr; 112277c88f5bSMatthew G Knepley 112377c88f5bSMatthew G Knepley PetscFunctionBegin; 112477c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 112577c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 112677c88f5bSMatthew 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); 112777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 112877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 112977c88f5bSMatthew 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); 113077c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 113177c88f5bSMatthew G Knepley PetscFunctionReturn(0); 113277c88f5bSMatthew G Knepley } 113377c88f5bSMatthew G Knepley 113477c88f5bSMatthew G Knepley #undef __FUNCT__ 1135552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1136552f7358SJed Brown /*@ 1137552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1138552f7358SJed Brown 1139552f7358SJed Brown Not collective 1140552f7358SJed Brown 1141552f7358SJed Brown Input Parameters: 1142552f7358SJed Brown + mesh - The DMPlex 1143552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1144552f7358SJed Brown 1145552f7358SJed Brown Output Parameter: 1146552f7358SJed Brown . size - The support size for point p 1147552f7358SJed Brown 1148552f7358SJed Brown Level: beginner 1149552f7358SJed Brown 1150552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1151552f7358SJed Brown @*/ 1152552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1153552f7358SJed Brown { 1154552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1155552f7358SJed Brown PetscErrorCode ierr; 1156552f7358SJed Brown 1157552f7358SJed Brown PetscFunctionBegin; 1158552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1159552f7358SJed Brown PetscValidPointer(size, 3); 1160552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1161552f7358SJed Brown PetscFunctionReturn(0); 1162552f7358SJed Brown } 1163552f7358SJed Brown 1164552f7358SJed Brown #undef __FUNCT__ 1165552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1166552f7358SJed Brown /*@ 1167552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1168552f7358SJed Brown 1169552f7358SJed Brown Not collective 1170552f7358SJed Brown 1171552f7358SJed Brown Input Parameters: 1172552f7358SJed Brown + mesh - The DMPlex 1173552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1174552f7358SJed Brown - size - The support size for point p 1175552f7358SJed Brown 1176552f7358SJed Brown Output Parameter: 1177552f7358SJed Brown 1178552f7358SJed Brown Note: 1179552f7358SJed Brown This should be called after DMPlexSetChart(). 1180552f7358SJed Brown 1181552f7358SJed Brown Level: beginner 1182552f7358SJed Brown 1183552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1184552f7358SJed Brown @*/ 1185552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1186552f7358SJed Brown { 1187552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1188552f7358SJed Brown PetscErrorCode ierr; 1189552f7358SJed Brown 1190552f7358SJed Brown PetscFunctionBegin; 1191552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1192552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 11930d644c17SKarl Rupp 1194552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1195552f7358SJed Brown PetscFunctionReturn(0); 1196552f7358SJed Brown } 1197552f7358SJed Brown 1198552f7358SJed Brown #undef __FUNCT__ 1199552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1200552f7358SJed Brown /*@C 1201552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1202552f7358SJed Brown 1203552f7358SJed Brown Not collective 1204552f7358SJed Brown 1205552f7358SJed Brown Input Parameters: 1206552f7358SJed Brown + mesh - The DMPlex 1207552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1208552f7358SJed Brown 1209552f7358SJed Brown Output Parameter: 1210552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1211552f7358SJed Brown 1212552f7358SJed Brown Level: beginner 1213552f7358SJed Brown 12143813dfbdSMatthew G Knepley Fortran Notes: 12153813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12163813dfbdSMatthew G Knepley include petsc.h90 in your code. 12173813dfbdSMatthew G Knepley 12183813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 12193813dfbdSMatthew G Knepley 1220552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1221552f7358SJed Brown @*/ 1222552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1223552f7358SJed Brown { 1224552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1225552f7358SJed Brown PetscInt off; 1226552f7358SJed Brown PetscErrorCode ierr; 1227552f7358SJed Brown 1228552f7358SJed Brown PetscFunctionBegin; 1229552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1230552f7358SJed Brown PetscValidPointer(support, 3); 1231552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1232552f7358SJed Brown *support = &mesh->supports[off]; 1233552f7358SJed Brown PetscFunctionReturn(0); 1234552f7358SJed Brown } 1235552f7358SJed Brown 1236552f7358SJed Brown #undef __FUNCT__ 1237552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1238552f7358SJed Brown /*@ 1239552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1240552f7358SJed Brown 1241552f7358SJed Brown Not collective 1242552f7358SJed Brown 1243552f7358SJed Brown Input Parameters: 1244552f7358SJed Brown + mesh - The DMPlex 1245552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1246552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1247552f7358SJed Brown 1248552f7358SJed Brown Output Parameter: 1249552f7358SJed Brown 1250552f7358SJed Brown Note: 1251552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1252552f7358SJed Brown 1253552f7358SJed Brown Level: beginner 1254552f7358SJed Brown 1255552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1256552f7358SJed Brown @*/ 1257552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1258552f7358SJed Brown { 1259552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1260552f7358SJed Brown PetscInt pStart, pEnd; 1261552f7358SJed Brown PetscInt dof, off, c; 1262552f7358SJed Brown PetscErrorCode ierr; 1263552f7358SJed Brown 1264552f7358SJed Brown PetscFunctionBegin; 1265552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1266552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1267552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1268552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1269552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 127082f516ccSBarry 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); 1271552f7358SJed Brown for (c = 0; c < dof; ++c) { 127282f516ccSBarry 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); 1273552f7358SJed Brown mesh->supports[off+c] = support[c]; 1274552f7358SJed Brown } 1275552f7358SJed Brown PetscFunctionReturn(0); 1276552f7358SJed Brown } 1277552f7358SJed Brown 1278552f7358SJed Brown #undef __FUNCT__ 1279552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1280552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1281552f7358SJed Brown { 1282552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1283552f7358SJed Brown PetscInt pStart, pEnd; 1284552f7358SJed Brown PetscInt dof, off; 1285552f7358SJed Brown PetscErrorCode ierr; 1286552f7358SJed Brown 1287552f7358SJed Brown PetscFunctionBegin; 1288552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1289552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1290552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1291552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 129282f516ccSBarry 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); 129382f516ccSBarry 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); 129482f516ccSBarry 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); 1295552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1296552f7358SJed Brown PetscFunctionReturn(0); 1297552f7358SJed Brown } 1298552f7358SJed Brown 1299552f7358SJed Brown #undef __FUNCT__ 1300552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1301552f7358SJed Brown /*@C 1302552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1303552f7358SJed Brown 1304552f7358SJed Brown Not collective 1305552f7358SJed Brown 1306552f7358SJed Brown Input Parameters: 1307552f7358SJed Brown + mesh - The DMPlex 1308552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1309552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13100298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1311552f7358SJed Brown 1312552f7358SJed Brown Output Parameters: 1313552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1314552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1315552f7358SJed Brown 1316552f7358SJed Brown Note: 13170298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1318552f7358SJed Brown 13193813dfbdSMatthew G Knepley Fortran Notes: 13203813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13213813dfbdSMatthew G Knepley include petsc.h90 in your code. 13223813dfbdSMatthew G Knepley 13233813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13243813dfbdSMatthew G Knepley 1325552f7358SJed Brown Level: beginner 1326552f7358SJed Brown 1327552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1328552f7358SJed Brown @*/ 1329552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1330552f7358SJed Brown { 1331552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1332552f7358SJed Brown PetscInt *closure, *fifo; 13330298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1334552f7358SJed Brown PetscInt tmpSize, t; 1335552f7358SJed Brown PetscInt depth = 0, maxSize; 1336552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1337552f7358SJed Brown PetscErrorCode ierr; 1338552f7358SJed Brown 1339552f7358SJed Brown PetscFunctionBegin; 1340552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1341552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1342552f7358SJed Brown /* This is only 1-level */ 1343552f7358SJed Brown if (useCone) { 1344552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1345552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1346552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1347552f7358SJed Brown } else { 1348552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1349552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1350552f7358SJed Brown } 1351bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1352bfbcdd7aSMatthew G. Knepley if (*points) { 1353bfbcdd7aSMatthew G. Knepley closure = *points; 1354bfbcdd7aSMatthew G. Knepley } else { 1355bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1356bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1357bfbcdd7aSMatthew G. Knepley } 1358bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1359bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1360bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1361bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1362bfbcdd7aSMatthew G. Knepley } 1363bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1364bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1365bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1366bfbcdd7aSMatthew G. Knepley } 136724c766afSToby Isaac { 136824c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 136924c766afSToby Isaac 137024c766afSToby Isaac c = mesh->maxConeSize; 137124c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 137224c766afSToby Isaac s = mesh->maxSupportSize; 137324c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 137424c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 137524c766afSToby Isaac } 1376bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1377bfbcdd7aSMatthew G. Knepley if (*points) { 1378bfbcdd7aSMatthew G. Knepley closure = *points; 1379bfbcdd7aSMatthew G. Knepley } else { 1380bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1381bfbcdd7aSMatthew G. Knepley } 1382bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1383552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1384552f7358SJed Brown const PetscInt cp = tmp[t]; 1385552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1386552f7358SJed Brown 1387552f7358SJed Brown closure[closureSize] = cp; 1388552f7358SJed Brown closure[closureSize+1] = co; 1389552f7358SJed Brown fifo[fifoSize] = cp; 1390552f7358SJed Brown fifo[fifoSize+1] = co; 1391552f7358SJed Brown } 1392bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1393552f7358SJed Brown while (fifoSize - fifoStart) { 1394552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1395552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1396552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1397552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1398552f7358SJed Brown 1399552f7358SJed Brown if (useCone) { 1400552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1401552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1402552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1403552f7358SJed Brown } else { 1404552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1405552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14060298fd71SBarry Smith tmpO = NULL; 1407552f7358SJed Brown } 1408552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1409552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1410552f7358SJed Brown const PetscInt cp = tmp[i]; 14112e1b13c2SMatthew 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. */ 14122e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14132e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14142e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1415552f7358SJed Brown PetscInt c; 1416552f7358SJed Brown 14172e1b13c2SMatthew G. Knepley if (rev) { 14182e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 14192e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14202e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14212e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14222e1b13c2SMatthew G. Knepley } 1423552f7358SJed Brown /* Check for duplicate */ 1424552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1425552f7358SJed Brown if (closure[c] == cp) break; 1426552f7358SJed Brown } 1427552f7358SJed Brown if (c == closureSize) { 1428552f7358SJed Brown closure[closureSize] = cp; 1429552f7358SJed Brown closure[closureSize+1] = co; 1430552f7358SJed Brown fifo[fifoSize] = cp; 1431552f7358SJed Brown fifo[fifoSize+1] = co; 1432552f7358SJed Brown closureSize += 2; 1433552f7358SJed Brown fifoSize += 2; 1434552f7358SJed Brown } 1435552f7358SJed Brown } 1436552f7358SJed Brown fifoStart += 2; 1437552f7358SJed Brown } 1438552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1439552f7358SJed Brown if (points) *points = closure; 1440552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1441552f7358SJed Brown PetscFunctionReturn(0); 1442552f7358SJed Brown } 1443552f7358SJed Brown 1444552f7358SJed Brown #undef __FUNCT__ 14459bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 14469bf0dad6SMatthew G. Knepley /*@C 14479bf0dad6SMatthew 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 14489bf0dad6SMatthew G. Knepley 14499bf0dad6SMatthew G. Knepley Not collective 14509bf0dad6SMatthew G. Knepley 14519bf0dad6SMatthew G. Knepley Input Parameters: 14529bf0dad6SMatthew G. Knepley + mesh - The DMPlex 14539bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 14549bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 14559bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 14569bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 14579bf0dad6SMatthew G. Knepley 14589bf0dad6SMatthew G. Knepley Output Parameters: 14599bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 14609bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 14619bf0dad6SMatthew G. Knepley 14629bf0dad6SMatthew G. Knepley Note: 14639bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 14649bf0dad6SMatthew G. Knepley 14659bf0dad6SMatthew G. Knepley Fortran Notes: 14669bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14679bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 14689bf0dad6SMatthew G. Knepley 14699bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14709bf0dad6SMatthew G. Knepley 14719bf0dad6SMatthew G. Knepley Level: beginner 14729bf0dad6SMatthew G. Knepley 14739bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 14749bf0dad6SMatthew G. Knepley @*/ 14759bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 14769bf0dad6SMatthew G. Knepley { 14779bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 14789bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 14799bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 14809bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 14819bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 14829bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 14839bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 14849bf0dad6SMatthew G. Knepley 14859bf0dad6SMatthew G. Knepley PetscFunctionBegin; 14869bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14879bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 14889bf0dad6SMatthew G. Knepley /* This is only 1-level */ 14899bf0dad6SMatthew G. Knepley if (useCone) { 14909bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 14919bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 14929bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 14939bf0dad6SMatthew G. Knepley } else { 14949bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 14959bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 14969bf0dad6SMatthew G. Knepley } 14979bf0dad6SMatthew G. Knepley if (depth == 1) { 14989bf0dad6SMatthew G. Knepley if (*points) { 14999bf0dad6SMatthew G. Knepley closure = *points; 15009bf0dad6SMatthew G. Knepley } else { 15019bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 15029bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 15039bf0dad6SMatthew G. Knepley } 15049bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 15059bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 15069bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 15079bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 15089bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 15099bf0dad6SMatthew G. Knepley } 15109bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15119bf0dad6SMatthew G. Knepley if (points) *points = closure; 15129bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15139bf0dad6SMatthew G. Knepley } 151424c766afSToby Isaac { 151524c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 151624c766afSToby Isaac 151724c766afSToby Isaac c = mesh->maxConeSize; 151824c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 151924c766afSToby Isaac s = mesh->maxSupportSize; 152024c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 152124c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 152224c766afSToby Isaac } 15239bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15249bf0dad6SMatthew G. Knepley if (*points) { 15259bf0dad6SMatthew G. Knepley closure = *points; 15269bf0dad6SMatthew G. Knepley } else { 15279bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 15289bf0dad6SMatthew G. Knepley } 15299bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 15309bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 15319bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 15329bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15339bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15349bf0dad6SMatthew G. Knepley 15359bf0dad6SMatthew G. Knepley if (ornt < 0) { 15369bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15379bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15389bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15399bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15409bf0dad6SMatthew G. Knepley } 15419bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15429bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15439bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15449bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15459bf0dad6SMatthew G. Knepley } 15469bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 15479bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 15489bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 15499bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 15509bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 15519bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 15529bf0dad6SMatthew G. Knepley 15539bf0dad6SMatthew G. Knepley if (useCone) { 15549bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 15559bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 15569bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 15579bf0dad6SMatthew G. Knepley } else { 15589bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 15599bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 15609bf0dad6SMatthew G. Knepley tmpO = NULL; 15619bf0dad6SMatthew G. Knepley } 15629bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 15639bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 15649bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15659bf0dad6SMatthew 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. */ 15669bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 15679bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 15689bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15699bf0dad6SMatthew G. Knepley PetscInt c; 15709bf0dad6SMatthew G. Knepley 15719bf0dad6SMatthew G. Knepley if (rev) { 15729bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15739bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15749bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15759bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15769bf0dad6SMatthew G. Knepley } 15779bf0dad6SMatthew G. Knepley /* Check for duplicate */ 15789bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 15799bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 15809bf0dad6SMatthew G. Knepley } 15819bf0dad6SMatthew G. Knepley if (c == closureSize) { 15829bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15839bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15849bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15859bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15869bf0dad6SMatthew G. Knepley closureSize += 2; 15879bf0dad6SMatthew G. Knepley fifoSize += 2; 15889bf0dad6SMatthew G. Knepley } 15899bf0dad6SMatthew G. Knepley } 15909bf0dad6SMatthew G. Knepley fifoStart += 2; 15919bf0dad6SMatthew G. Knepley } 15929bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15939bf0dad6SMatthew G. Knepley if (points) *points = closure; 15949bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15959bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15969bf0dad6SMatthew G. Knepley } 15979bf0dad6SMatthew G. Knepley 15989bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1599552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1600552f7358SJed Brown /*@C 1601552f7358SJed 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 1602552f7358SJed Brown 1603552f7358SJed Brown Not collective 1604552f7358SJed Brown 1605552f7358SJed Brown Input Parameters: 1606552f7358SJed Brown + mesh - The DMPlex 1607552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1608552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1609e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1610e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1611552f7358SJed Brown 1612552f7358SJed Brown Note: 16130298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1614552f7358SJed Brown 16153813dfbdSMatthew G Knepley Fortran Notes: 16163813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16173813dfbdSMatthew G Knepley include petsc.h90 in your code. 16183813dfbdSMatthew G Knepley 16193813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16203813dfbdSMatthew G Knepley 1621552f7358SJed Brown Level: beginner 1622552f7358SJed Brown 1623552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1624552f7358SJed Brown @*/ 1625552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1626552f7358SJed Brown { 1627552f7358SJed Brown PetscErrorCode ierr; 1628552f7358SJed Brown 1629552f7358SJed Brown PetscFunctionBegin; 1630552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1631e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1632e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1633552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 16344ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1635552f7358SJed Brown PetscFunctionReturn(0); 1636552f7358SJed Brown } 1637552f7358SJed Brown 1638552f7358SJed Brown #undef __FUNCT__ 1639552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1640552f7358SJed Brown /*@ 1641552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1642552f7358SJed Brown 1643552f7358SJed Brown Not collective 1644552f7358SJed Brown 1645552f7358SJed Brown Input Parameter: 1646552f7358SJed Brown . mesh - The DMPlex 1647552f7358SJed Brown 1648552f7358SJed Brown Output Parameters: 1649552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1650552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1651552f7358SJed Brown 1652552f7358SJed Brown Level: beginner 1653552f7358SJed Brown 1654552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1655552f7358SJed Brown @*/ 1656552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1657552f7358SJed Brown { 1658552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1659552f7358SJed Brown 1660552f7358SJed Brown PetscFunctionBegin; 1661552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1662552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1663552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1664552f7358SJed Brown PetscFunctionReturn(0); 1665552f7358SJed Brown } 1666552f7358SJed Brown 1667552f7358SJed Brown #undef __FUNCT__ 1668552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1669552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1670552f7358SJed Brown { 1671552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1672552f7358SJed Brown PetscInt size; 1673552f7358SJed Brown PetscErrorCode ierr; 1674552f7358SJed Brown 1675552f7358SJed Brown PetscFunctionBegin; 1676552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1677552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1678552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 16791795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 16801795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1681552f7358SJed Brown if (mesh->maxSupportSize) { 1682552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1683552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 16841795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1685552f7358SJed Brown } 1686552f7358SJed Brown PetscFunctionReturn(0); 1687552f7358SJed Brown } 1688552f7358SJed Brown 1689552f7358SJed Brown #undef __FUNCT__ 1690552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1691552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1692552f7358SJed Brown { 1693552f7358SJed Brown PetscErrorCode ierr; 1694552f7358SJed Brown 1695552f7358SJed Brown PetscFunctionBegin; 16964d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 16974d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1698552f7358SJed Brown PetscFunctionReturn(0); 1699552f7358SJed Brown } 1700552f7358SJed Brown 1701552f7358SJed Brown #undef __FUNCT__ 1702552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1703552f7358SJed Brown /*@ 1704552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1705552f7358SJed Brown 1706552f7358SJed Brown Not collective 1707552f7358SJed Brown 1708552f7358SJed Brown Input Parameter: 1709552f7358SJed Brown . mesh - The DMPlex 1710552f7358SJed Brown 1711552f7358SJed Brown Output Parameter: 1712552f7358SJed Brown 1713552f7358SJed Brown Note: 1714552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1715552f7358SJed Brown 1716552f7358SJed Brown Level: beginner 1717552f7358SJed Brown 1718552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1719552f7358SJed Brown @*/ 1720552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1721552f7358SJed Brown { 1722552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1723552f7358SJed Brown PetscInt *offsets; 1724552f7358SJed Brown PetscInt supportSize; 1725552f7358SJed Brown PetscInt pStart, pEnd, p; 1726552f7358SJed Brown PetscErrorCode ierr; 1727552f7358SJed Brown 1728552f7358SJed Brown PetscFunctionBegin; 1729552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 173082f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1731552f7358SJed Brown /* Calculate support sizes */ 1732552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1733552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1734552f7358SJed Brown PetscInt dof, off, c; 1735552f7358SJed Brown 1736552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1737552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1738552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1739552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1740552f7358SJed Brown } 1741552f7358SJed Brown } 1742552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1743552f7358SJed Brown PetscInt dof; 1744552f7358SJed Brown 1745552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 17460d644c17SKarl Rupp 1747552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1748552f7358SJed Brown } 1749552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1750552f7358SJed Brown /* Calculate supports */ 1751552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 17521795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 17531795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1754552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1755552f7358SJed Brown PetscInt dof, off, c; 1756552f7358SJed Brown 1757552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1758552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1759552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1760552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1761552f7358SJed Brown PetscInt offS; 1762552f7358SJed Brown 1763552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 17640d644c17SKarl Rupp 1765552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1766552f7358SJed Brown ++offsets[q]; 1767552f7358SJed Brown } 1768552f7358SJed Brown } 1769552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1770552f7358SJed Brown PetscFunctionReturn(0); 1771552f7358SJed Brown } 1772552f7358SJed Brown 1773552f7358SJed Brown #undef __FUNCT__ 1774552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1775552f7358SJed Brown /*@ 1776552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1777552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1778552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1779552f7358SJed Brown the DAG. 1780552f7358SJed Brown 1781552f7358SJed Brown Not collective 1782552f7358SJed Brown 1783552f7358SJed Brown Input Parameter: 1784552f7358SJed Brown . mesh - The DMPlex 1785552f7358SJed Brown 1786552f7358SJed Brown Output Parameter: 1787552f7358SJed Brown 1788552f7358SJed Brown Notes: 1789150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1790150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1791150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1792150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1793552f7358SJed Brown 1794150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1795552f7358SJed Brown 1796552f7358SJed Brown Level: beginner 1797552f7358SJed Brown 1798552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1799552f7358SJed Brown @*/ 1800552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1801552f7358SJed Brown { 1802aa50250dSMatthew G. Knepley DMLabel label; 1803552f7358SJed Brown PetscInt pStart, pEnd, p; 1804552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1805552f7358SJed Brown PetscErrorCode ierr; 1806552f7358SJed Brown 1807552f7358SJed Brown PetscFunctionBegin; 1808552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1809552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1810552f7358SJed Brown /* Calculate depth */ 1811aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1812aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1813aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1814552f7358SJed Brown /* Initialize roots and count leaves */ 1815552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1816552f7358SJed Brown PetscInt coneSize, supportSize; 1817552f7358SJed Brown 1818552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1819552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1820552f7358SJed Brown if (!coneSize && supportSize) { 1821552f7358SJed Brown ++numRoots; 1822aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1823552f7358SJed Brown } else if (!supportSize && coneSize) { 1824552f7358SJed Brown ++numLeaves; 1825552f7358SJed Brown } else if (!supportSize && !coneSize) { 1826552f7358SJed Brown /* Isolated points */ 1827aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1828552f7358SJed Brown } 1829552f7358SJed Brown } 1830552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1831552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1832552f7358SJed Brown PetscInt coneSize, supportSize; 1833552f7358SJed Brown 1834552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1835552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1836552f7358SJed Brown if (!supportSize && coneSize) { 1837aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1838552f7358SJed Brown } 1839552f7358SJed Brown } 1840552f7358SJed Brown } else { 184174ef644bSMatthew G. Knepley IS pointIS; 184274ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1843552f7358SJed Brown 184474ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 184574ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 184674ef644bSMatthew G. Knepley while (numPoints) { 184774ef644bSMatthew G. Knepley const PetscInt *points; 184874ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 184974ef644bSMatthew G. Knepley 185074ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 185174ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 185274ef644bSMatthew G. Knepley const PetscInt point = points[p]; 185374ef644bSMatthew G. Knepley const PetscInt *support; 185474ef644bSMatthew G. Knepley PetscInt supportSize, s; 185574ef644bSMatthew G. Knepley 185674ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 185774ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 185874ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 185974ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1860552f7358SJed Brown } 1861552f7358SJed Brown } 18625edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 186374ef644bSMatthew G. Knepley ++level; 186474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 186574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 186674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 186774ef644bSMatthew G. Knepley else {numPoints = 0;} 186874ef644bSMatthew G. Knepley } 186974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 187074ef644bSMatthew G. Knepley } 1871552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1872552f7358SJed Brown PetscFunctionReturn(0); 1873552f7358SJed Brown } 1874552f7358SJed Brown 1875552f7358SJed Brown #undef __FUNCT__ 1876552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1877552f7358SJed Brown /*@C 1878552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1879552f7358SJed Brown 1880552f7358SJed Brown Not Collective 1881552f7358SJed Brown 1882552f7358SJed Brown Input Parameters: 1883552f7358SJed Brown + dm - The DMPlex object 1884552f7358SJed Brown . numPoints - The number of input points for the join 1885552f7358SJed Brown - points - The input points 1886552f7358SJed Brown 1887552f7358SJed Brown Output Parameters: 1888552f7358SJed Brown + numCoveredPoints - The number of points in the join 1889552f7358SJed Brown - coveredPoints - The points in the join 1890552f7358SJed Brown 1891552f7358SJed Brown Level: intermediate 1892552f7358SJed Brown 1893552f7358SJed Brown Note: Currently, this is restricted to a single level join 1894552f7358SJed Brown 18953813dfbdSMatthew G Knepley Fortran Notes: 18963813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18973813dfbdSMatthew G Knepley include petsc.h90 in your code. 18983813dfbdSMatthew G Knepley 18993813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19003813dfbdSMatthew G Knepley 1901552f7358SJed Brown .keywords: mesh 1902552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1903552f7358SJed Brown @*/ 1904552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1905552f7358SJed Brown { 1906552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1907552f7358SJed Brown PetscInt *join[2]; 1908552f7358SJed Brown PetscInt joinSize, i = 0; 1909552f7358SJed Brown PetscInt dof, off, p, c, m; 1910552f7358SJed Brown PetscErrorCode ierr; 1911552f7358SJed Brown 1912552f7358SJed Brown PetscFunctionBegin; 1913552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1914552f7358SJed Brown PetscValidPointer(points, 2); 1915552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1916552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1917552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1918552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1919552f7358SJed Brown /* Copy in support of first point */ 1920552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1921552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1922552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1923552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1924552f7358SJed Brown } 1925552f7358SJed Brown /* Check each successive support */ 1926552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1927552f7358SJed Brown PetscInt newJoinSize = 0; 1928552f7358SJed Brown 1929552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1930552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1931552f7358SJed Brown for (c = 0; c < dof; ++c) { 1932552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1933552f7358SJed Brown 1934552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1935552f7358SJed Brown if (point == join[i][m]) { 1936552f7358SJed Brown join[1-i][newJoinSize++] = point; 1937552f7358SJed Brown break; 1938552f7358SJed Brown } 1939552f7358SJed Brown } 1940552f7358SJed Brown } 1941552f7358SJed Brown joinSize = newJoinSize; 1942552f7358SJed Brown i = 1-i; 1943552f7358SJed Brown } 1944552f7358SJed Brown *numCoveredPoints = joinSize; 1945552f7358SJed Brown *coveredPoints = join[i]; 1946552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1947552f7358SJed Brown PetscFunctionReturn(0); 1948552f7358SJed Brown } 1949552f7358SJed Brown 1950552f7358SJed Brown #undef __FUNCT__ 1951552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1952552f7358SJed Brown /*@C 1953552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1954552f7358SJed Brown 1955552f7358SJed Brown Not Collective 1956552f7358SJed Brown 1957552f7358SJed Brown Input Parameters: 1958552f7358SJed Brown + dm - The DMPlex object 1959552f7358SJed Brown . numPoints - The number of input points for the join 1960552f7358SJed Brown - points - The input points 1961552f7358SJed Brown 1962552f7358SJed Brown Output Parameters: 1963552f7358SJed Brown + numCoveredPoints - The number of points in the join 1964552f7358SJed Brown - coveredPoints - The points in the join 1965552f7358SJed Brown 19663813dfbdSMatthew G Knepley Fortran Notes: 19673813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19683813dfbdSMatthew G Knepley include petsc.h90 in your code. 19693813dfbdSMatthew G Knepley 19703813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19713813dfbdSMatthew G Knepley 1972552f7358SJed Brown Level: intermediate 1973552f7358SJed Brown 1974552f7358SJed Brown .keywords: mesh 1975552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1976552f7358SJed Brown @*/ 1977552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1978552f7358SJed Brown { 1979552f7358SJed Brown PetscErrorCode ierr; 1980552f7358SJed Brown 1981552f7358SJed Brown PetscFunctionBegin; 1982552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1983d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1984d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1985d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1986552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1987d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1988552f7358SJed Brown PetscFunctionReturn(0); 1989552f7358SJed Brown } 1990552f7358SJed Brown 1991552f7358SJed Brown #undef __FUNCT__ 1992552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1993552f7358SJed Brown /*@C 1994552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1995552f7358SJed Brown 1996552f7358SJed Brown Not Collective 1997552f7358SJed Brown 1998552f7358SJed Brown Input Parameters: 1999552f7358SJed Brown + dm - The DMPlex object 2000552f7358SJed Brown . numPoints - The number of input points for the join 2001552f7358SJed Brown - points - The input points 2002552f7358SJed Brown 2003552f7358SJed Brown Output Parameters: 2004552f7358SJed Brown + numCoveredPoints - The number of points in the join 2005552f7358SJed Brown - coveredPoints - The points in the join 2006552f7358SJed Brown 20073813dfbdSMatthew G Knepley Fortran Notes: 20083813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20093813dfbdSMatthew G Knepley include petsc.h90 in your code. 20103813dfbdSMatthew G Knepley 20113813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20123813dfbdSMatthew G Knepley 2013552f7358SJed Brown Level: intermediate 2014552f7358SJed Brown 2015552f7358SJed Brown .keywords: mesh 2016552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 2017552f7358SJed Brown @*/ 2018552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2019552f7358SJed Brown { 2020552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2021552f7358SJed Brown PetscInt *offsets, **closures; 2022552f7358SJed Brown PetscInt *join[2]; 2023552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 202424c766afSToby Isaac PetscInt p, d, c, m, ms; 2025552f7358SJed Brown PetscErrorCode ierr; 2026552f7358SJed Brown 2027552f7358SJed Brown PetscFunctionBegin; 2028552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2029552f7358SJed Brown PetscValidPointer(points, 2); 2030552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2031552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2032552f7358SJed Brown 2033552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 20341795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 2035552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 203624c766afSToby Isaac ms = mesh->maxSupportSize; 203724c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 2038552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 2039552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 2040552f7358SJed Brown 2041552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2042552f7358SJed Brown PetscInt closureSize; 2043552f7358SJed Brown 2044552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 20450d644c17SKarl Rupp 2046552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 2047552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2048552f7358SJed Brown PetscInt pStart, pEnd, i; 2049552f7358SJed Brown 2050552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 2051552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 2052552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2053552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 2054552f7358SJed Brown break; 2055552f7358SJed Brown } 2056552f7358SJed Brown } 2057552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 2058552f7358SJed Brown } 205982f516ccSBarry 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); 2060552f7358SJed Brown } 2061552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2062552f7358SJed Brown PetscInt dof; 2063552f7358SJed Brown 2064552f7358SJed Brown /* Copy in support of first point */ 2065552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 2066552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 2067552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 2068552f7358SJed Brown } 2069552f7358SJed Brown /* Check each successive cone */ 2070552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 2071552f7358SJed Brown PetscInt newJoinSize = 0; 2072552f7358SJed Brown 2073552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 2074552f7358SJed Brown for (c = 0; c < dof; ++c) { 2075552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 2076552f7358SJed Brown 2077552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 2078552f7358SJed Brown if (point == join[i][m]) { 2079552f7358SJed Brown join[1-i][newJoinSize++] = point; 2080552f7358SJed Brown break; 2081552f7358SJed Brown } 2082552f7358SJed Brown } 2083552f7358SJed Brown } 2084552f7358SJed Brown joinSize = newJoinSize; 2085552f7358SJed Brown i = 1-i; 2086552f7358SJed Brown } 2087552f7358SJed Brown if (joinSize) break; 2088552f7358SJed Brown } 2089552f7358SJed Brown *numCoveredPoints = joinSize; 2090552f7358SJed Brown *coveredPoints = join[i]; 2091552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20920298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 2093552f7358SJed Brown } 2094552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2095552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2096552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 2097552f7358SJed Brown PetscFunctionReturn(0); 2098552f7358SJed Brown } 2099552f7358SJed Brown 2100552f7358SJed Brown #undef __FUNCT__ 2101552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 2102552f7358SJed Brown /*@C 2103552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 2104552f7358SJed Brown 2105552f7358SJed Brown Not Collective 2106552f7358SJed Brown 2107552f7358SJed Brown Input Parameters: 2108552f7358SJed Brown + dm - The DMPlex object 2109552f7358SJed Brown . numPoints - The number of input points for the meet 2110552f7358SJed Brown - points - The input points 2111552f7358SJed Brown 2112552f7358SJed Brown Output Parameters: 2113552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2114552f7358SJed Brown - coveredPoints - The points in the meet 2115552f7358SJed Brown 2116552f7358SJed Brown Level: intermediate 2117552f7358SJed Brown 2118552f7358SJed Brown Note: Currently, this is restricted to a single level meet 2119552f7358SJed Brown 21203813dfbdSMatthew G Knepley Fortran Notes: 21213813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21223813dfbdSMatthew G Knepley include petsc.h90 in your code. 21233813dfbdSMatthew G Knepley 21243813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21253813dfbdSMatthew G Knepley 2126552f7358SJed Brown .keywords: mesh 2127552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 2128552f7358SJed Brown @*/ 2129552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 2130552f7358SJed Brown { 2131552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2132552f7358SJed Brown PetscInt *meet[2]; 2133552f7358SJed Brown PetscInt meetSize, i = 0; 2134552f7358SJed Brown PetscInt dof, off, p, c, m; 2135552f7358SJed Brown PetscErrorCode ierr; 2136552f7358SJed Brown 2137552f7358SJed Brown PetscFunctionBegin; 2138552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2139552f7358SJed Brown PetscValidPointer(points, 2); 2140552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2141552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2142552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2143552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2144552f7358SJed Brown /* Copy in cone of first point */ 2145552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2146552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2147552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2148552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2149552f7358SJed Brown } 2150552f7358SJed Brown /* Check each successive cone */ 2151552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2152552f7358SJed Brown PetscInt newMeetSize = 0; 2153552f7358SJed Brown 2154552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2155552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2156552f7358SJed Brown for (c = 0; c < dof; ++c) { 2157552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2158552f7358SJed Brown 2159552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2160552f7358SJed Brown if (point == meet[i][m]) { 2161552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2162552f7358SJed Brown break; 2163552f7358SJed Brown } 2164552f7358SJed Brown } 2165552f7358SJed Brown } 2166552f7358SJed Brown meetSize = newMeetSize; 2167552f7358SJed Brown i = 1-i; 2168552f7358SJed Brown } 2169552f7358SJed Brown *numCoveringPoints = meetSize; 2170552f7358SJed Brown *coveringPoints = meet[i]; 2171552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2172552f7358SJed Brown PetscFunctionReturn(0); 2173552f7358SJed Brown } 2174552f7358SJed Brown 2175552f7358SJed Brown #undef __FUNCT__ 2176552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2177552f7358SJed Brown /*@C 2178552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2179552f7358SJed Brown 2180552f7358SJed Brown Not Collective 2181552f7358SJed Brown 2182552f7358SJed Brown Input Parameters: 2183552f7358SJed Brown + dm - The DMPlex object 2184552f7358SJed Brown . numPoints - The number of input points for the meet 2185552f7358SJed Brown - points - The input points 2186552f7358SJed Brown 2187552f7358SJed Brown Output Parameters: 2188552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2189552f7358SJed Brown - coveredPoints - The points in the meet 2190552f7358SJed Brown 2191552f7358SJed Brown Level: intermediate 2192552f7358SJed Brown 21933813dfbdSMatthew G Knepley Fortran Notes: 21943813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21953813dfbdSMatthew G Knepley include petsc.h90 in your code. 21963813dfbdSMatthew G Knepley 21973813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21983813dfbdSMatthew G Knepley 2199552f7358SJed Brown .keywords: mesh 2200552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2201552f7358SJed Brown @*/ 2202552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2203552f7358SJed Brown { 2204552f7358SJed Brown PetscErrorCode ierr; 2205552f7358SJed Brown 2206552f7358SJed Brown PetscFunctionBegin; 2207552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2208d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2209d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2210d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2211552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2212d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2213552f7358SJed Brown PetscFunctionReturn(0); 2214552f7358SJed Brown } 2215552f7358SJed Brown 2216552f7358SJed Brown #undef __FUNCT__ 2217552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2218552f7358SJed Brown /*@C 2219552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2220552f7358SJed Brown 2221552f7358SJed Brown Not Collective 2222552f7358SJed Brown 2223552f7358SJed Brown Input Parameters: 2224552f7358SJed Brown + dm - The DMPlex object 2225552f7358SJed Brown . numPoints - The number of input points for the meet 2226552f7358SJed Brown - points - The input points 2227552f7358SJed Brown 2228552f7358SJed Brown Output Parameters: 2229552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2230552f7358SJed Brown - coveredPoints - The points in the meet 2231552f7358SJed Brown 2232552f7358SJed Brown Level: intermediate 2233552f7358SJed Brown 22343813dfbdSMatthew G Knepley Fortran Notes: 22353813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 22363813dfbdSMatthew G Knepley include petsc.h90 in your code. 22373813dfbdSMatthew G Knepley 22383813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 22393813dfbdSMatthew G Knepley 2240552f7358SJed Brown .keywords: mesh 2241552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2242552f7358SJed Brown @*/ 2243552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2244552f7358SJed Brown { 2245552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2246552f7358SJed Brown PetscInt *offsets, **closures; 2247552f7358SJed Brown PetscInt *meet[2]; 2248552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 224924c766afSToby Isaac PetscInt p, h, c, m, mc; 2250552f7358SJed Brown PetscErrorCode ierr; 2251552f7358SJed Brown 2252552f7358SJed Brown PetscFunctionBegin; 2253552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2254552f7358SJed Brown PetscValidPointer(points, 2); 2255552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2256552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2257552f7358SJed Brown 2258552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2259785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2260552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 226124c766afSToby Isaac mc = mesh->maxConeSize; 226224c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2263552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2264552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2265552f7358SJed Brown 2266552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2267552f7358SJed Brown PetscInt closureSize; 2268552f7358SJed Brown 2269552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 22700d644c17SKarl Rupp 2271552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2272552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2273552f7358SJed Brown PetscInt pStart, pEnd, i; 2274552f7358SJed Brown 2275552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2276552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2277552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2278552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2279552f7358SJed Brown break; 2280552f7358SJed Brown } 2281552f7358SJed Brown } 2282552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2283552f7358SJed Brown } 228482f516ccSBarry 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); 2285552f7358SJed Brown } 2286552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2287552f7358SJed Brown PetscInt dof; 2288552f7358SJed Brown 2289552f7358SJed Brown /* Copy in cone of first point */ 2290552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2291552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2292552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2293552f7358SJed Brown } 2294552f7358SJed Brown /* Check each successive cone */ 2295552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2296552f7358SJed Brown PetscInt newMeetSize = 0; 2297552f7358SJed Brown 2298552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2299552f7358SJed Brown for (c = 0; c < dof; ++c) { 2300552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2301552f7358SJed Brown 2302552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2303552f7358SJed Brown if (point == meet[i][m]) { 2304552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2305552f7358SJed Brown break; 2306552f7358SJed Brown } 2307552f7358SJed Brown } 2308552f7358SJed Brown } 2309552f7358SJed Brown meetSize = newMeetSize; 2310552f7358SJed Brown i = 1-i; 2311552f7358SJed Brown } 2312552f7358SJed Brown if (meetSize) break; 2313552f7358SJed Brown } 2314552f7358SJed Brown *numCoveredPoints = meetSize; 2315552f7358SJed Brown *coveredPoints = meet[i]; 2316552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 23170298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2318552f7358SJed Brown } 2319552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2320552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2321552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2322552f7358SJed Brown PetscFunctionReturn(0); 2323552f7358SJed Brown } 2324552f7358SJed Brown 2325552f7358SJed Brown #undef __FUNCT__ 23264e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 23274e3744c5SMatthew G. Knepley /*@C 23284e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 23294e3744c5SMatthew G. Knepley 23304e3744c5SMatthew G. Knepley Not Collective 23314e3744c5SMatthew G. Knepley 23324e3744c5SMatthew G. Knepley Input Parameters: 23334e3744c5SMatthew G. Knepley + dmA - A DMPlex object 23344e3744c5SMatthew G. Knepley - dmB - A DMPlex object 23354e3744c5SMatthew G. Knepley 23364e3744c5SMatthew G. Knepley Output Parameters: 23374e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 23384e3744c5SMatthew G. Knepley 23394e3744c5SMatthew G. Knepley Level: intermediate 23404e3744c5SMatthew G. Knepley 23414e3744c5SMatthew G. Knepley Notes: 23424e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 23434e3744c5SMatthew G. Knepley 23444e3744c5SMatthew G. Knepley .keywords: mesh 23454e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 23464e3744c5SMatthew G. Knepley @*/ 23474e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 23484e3744c5SMatthew G. Knepley { 23494e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 23504e3744c5SMatthew G. Knepley PetscErrorCode ierr; 23514e3744c5SMatthew G. Knepley 23524e3744c5SMatthew G. Knepley PetscFunctionBegin; 23534e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 23544e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 23554e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 23564e3744c5SMatthew G. Knepley 23574e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 23584e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 23594e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 23604e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 23614e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 23624e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 23634e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 23644e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 23654e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 23664e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 23674e3744c5SMatthew G. Knepley 23684e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 23694e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 23704e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 23714e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 23724e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 23734e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 23744e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 23754e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 23764e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 23774e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 23784e3744c5SMatthew G. Knepley } 23794e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 23804e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 23814e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 23824e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 23834e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 23844e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 23854e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 23864e3744c5SMatthew G. Knepley } 23874e3744c5SMatthew G. Knepley } 23884e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 23894e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 23904e3744c5SMatthew G. Knepley } 23914e3744c5SMatthew G. Knepley 23924e3744c5SMatthew G. Knepley #undef __FUNCT__ 239318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 239418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2395a6dfd86eSKarl Rupp { 239682f516ccSBarry Smith MPI_Comm comm; 2397552f7358SJed Brown PetscErrorCode ierr; 2398552f7358SJed Brown 2399552f7358SJed Brown PetscFunctionBegin; 240082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2401552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2402552f7358SJed Brown switch (cellDim) { 2403552f7358SJed Brown case 0: 2404552f7358SJed Brown *numFaceVertices = 0; 2405552f7358SJed Brown break; 2406552f7358SJed Brown case 1: 2407552f7358SJed Brown *numFaceVertices = 1; 2408552f7358SJed Brown break; 2409552f7358SJed Brown case 2: 2410552f7358SJed Brown switch (numCorners) { 241119436ca2SJed Brown case 3: /* triangle */ 241219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2413552f7358SJed Brown break; 241419436ca2SJed Brown case 4: /* quadrilateral */ 241519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2416552f7358SJed Brown break; 241719436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 241819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2419552f7358SJed Brown break; 242019436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 242119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2422552f7358SJed Brown break; 2423552f7358SJed Brown default: 2424552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2425552f7358SJed Brown } 2426552f7358SJed Brown break; 2427552f7358SJed Brown case 3: 2428552f7358SJed Brown switch (numCorners) { 242919436ca2SJed Brown case 4: /* tetradehdron */ 243019436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2431552f7358SJed Brown break; 243219436ca2SJed Brown case 6: /* tet cohesive cells */ 243319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2434552f7358SJed Brown break; 243519436ca2SJed Brown case 8: /* hexahedron */ 243619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2437552f7358SJed Brown break; 243819436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 243919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2440552f7358SJed Brown break; 244119436ca2SJed Brown case 10: /* quadratic tetrahedron */ 244219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2443552f7358SJed Brown break; 244419436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 244519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2446552f7358SJed Brown break; 244719436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 244819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2449552f7358SJed Brown break; 245019436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 245119436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2452552f7358SJed Brown break; 2453552f7358SJed Brown default: 2454552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2455552f7358SJed Brown } 2456552f7358SJed Brown break; 2457552f7358SJed Brown default: 2458552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2459552f7358SJed Brown } 2460552f7358SJed Brown PetscFunctionReturn(0); 2461552f7358SJed Brown } 2462552f7358SJed Brown 2463552f7358SJed Brown #undef __FUNCT__ 2464f05c90a3SMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate" 2465f05c90a3SMatthew G. Knepley /*@ 2466f05c90a3SMatthew 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. 2467f05c90a3SMatthew G. Knepley 2468f05c90a3SMatthew G. Knepley Input Parameters: 2469f05c90a3SMatthew G. Knepley + dm - The DM 2470f05c90a3SMatthew G. Knepley - in - The input coordinate point (dim numbers) 2471f05c90a3SMatthew G. Knepley 2472f05c90a3SMatthew G. Knepley Output Parameter: 2473f05c90a3SMatthew G. Knepley . out - The localized coordinate point 2474f05c90a3SMatthew G. Knepley 2475f05c90a3SMatthew G. Knepley Level: developer 2476f05c90a3SMatthew G. Knepley 2477f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeAddCoordinate() 2478f05c90a3SMatthew G. Knepley @*/ 2479f05c90a3SMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate(DM dm, const PetscScalar in[], PetscScalar out[]) 2480f05c90a3SMatthew G. Knepley { 2481f05c90a3SMatthew G. Knepley PetscInt dim, d; 2482f05c90a3SMatthew G. Knepley PetscErrorCode ierr; 2483f05c90a3SMatthew G. Knepley 2484f05c90a3SMatthew G. Knepley PetscFunctionBegin; 2485f05c90a3SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 2486f05c90a3SMatthew G. Knepley if (!dm->maxCell) { 2487f05c90a3SMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2488f05c90a3SMatthew G. Knepley } else { 2489f05c90a3SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2490b61239a6SMatthew G. Knepley out[d] = in[d] - dm->L[d]*floor(PetscRealPart(in[d])/dm->L[d]); 2491f05c90a3SMatthew G. Knepley } 2492f05c90a3SMatthew G. Knepley } 2493f05c90a3SMatthew G. Knepley PetscFunctionReturn(0); 2494f05c90a3SMatthew G. Knepley } 2495f05c90a3SMatthew G. Knepley 2496f05c90a3SMatthew G. Knepley #undef __FUNCT__ 2497d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 2498f05c90a3SMatthew G. Knepley /* 2499f05c90a3SMatthew 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. 2500f05c90a3SMatthew G. Knepley 2501f05c90a3SMatthew G. Knepley Input Parameters: 2502f05c90a3SMatthew G. Knepley + dm - The DM 2503f05c90a3SMatthew G. Knepley . dim - The spatial dimension 2504f05c90a3SMatthew G. Knepley . anchor - The anchor point, the input point can be no more than maxCell away from it 2505f05c90a3SMatthew G. Knepley - in - The input coordinate point (dim numbers) 2506f05c90a3SMatthew G. Knepley 2507f05c90a3SMatthew G. Knepley Output Parameter: 2508f05c90a3SMatthew G. Knepley . out - The localized coordinate point 2509f05c90a3SMatthew G. Knepley 2510f05c90a3SMatthew G. Knepley Level: developer 2511f05c90a3SMatthew G. Knepley 2512f05c90a3SMatthew 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 2513f05c90a3SMatthew G. Knepley 2514f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeAddCoordinate() 2515f05c90a3SMatthew G. Knepley */ 2516d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2517d49fcaecSMatthew G. Knepley { 2518d49fcaecSMatthew G. Knepley PetscInt d; 2519d49fcaecSMatthew G. Knepley 2520d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2521d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2522d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2523d49fcaecSMatthew G. Knepley } else { 2524d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2525d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2526858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2527d49fcaecSMatthew G. Knepley } else { 2528d49fcaecSMatthew G. Knepley out[d] = in[d]; 2529d49fcaecSMatthew G. Knepley } 2530d49fcaecSMatthew G. Knepley } 2531d49fcaecSMatthew G. Knepley } 2532d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2533d49fcaecSMatthew G. Knepley } 2534b88fe698SMatthew G. Knepley #undef __FUNCT__ 2535b88fe698SMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinateReal_Internal" 2536b61239a6SMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinateReal_Internal(DM dm, PetscInt dim, const PetscReal anchor[], const PetscReal in[], PetscReal out[]) 2537b61239a6SMatthew G. Knepley { 2538b61239a6SMatthew G. Knepley PetscInt d; 2539b61239a6SMatthew G. Knepley 2540b61239a6SMatthew G. Knepley PetscFunctionBegin; 2541b61239a6SMatthew G. Knepley if (!dm->maxCell) { 2542b61239a6SMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2543b61239a6SMatthew G. Knepley } else { 2544b61239a6SMatthew G. Knepley for (d = 0; d < dim; ++d) { 25454cae2477SMatthew G. Knepley if (PetscAbsReal(anchor[d] - in[d]) > dm->maxCell[d]) { 2546b61239a6SMatthew G. Knepley out[d] = anchor[d] > in[d] ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2547b61239a6SMatthew G. Knepley } else { 2548b61239a6SMatthew G. Knepley out[d] = in[d]; 2549b61239a6SMatthew G. Knepley } 2550b61239a6SMatthew G. Knepley } 2551b61239a6SMatthew G. Knepley } 2552b61239a6SMatthew G. Knepley PetscFunctionReturn(0); 2553b61239a6SMatthew G. Knepley } 2554d49fcaecSMatthew G. Knepley 2555d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2556d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 2557f05c90a3SMatthew G. Knepley /* 2558f05c90a3SMatthew 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. 2559f05c90a3SMatthew G. Knepley 2560f05c90a3SMatthew G. Knepley Input Parameters: 2561f05c90a3SMatthew G. Knepley + dm - The DM 2562f05c90a3SMatthew G. Knepley . dim - The spatial dimension 2563f05c90a3SMatthew G. Knepley . anchor - The anchor point, the input point can be no more than maxCell away from it 2564f05c90a3SMatthew G. Knepley . in - The input coordinate delta (dim numbers) 2565f05c90a3SMatthew G. Knepley - out - The input coordinate point (dim numbers) 2566f05c90a3SMatthew G. Knepley 2567f05c90a3SMatthew G. Knepley Output Parameter: 2568f05c90a3SMatthew G. Knepley . out - The localized coordinate in + out 2569f05c90a3SMatthew G. Knepley 2570f05c90a3SMatthew G. Knepley Level: developer 2571f05c90a3SMatthew G. Knepley 2572f05c90a3SMatthew 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 2573f05c90a3SMatthew G. Knepley 2574f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeCoordinate() 2575f05c90a3SMatthew G. Knepley */ 2576d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2577d49fcaecSMatthew G. Knepley { 2578d49fcaecSMatthew G. Knepley PetscInt d; 2579d49fcaecSMatthew G. Knepley 2580d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2581d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2582d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 2583d49fcaecSMatthew G. Knepley } else { 2584d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2585d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2586858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2587d49fcaecSMatthew G. Knepley } else { 2588d49fcaecSMatthew G. Knepley out[d] += in[d]; 2589d49fcaecSMatthew G. Knepley } 2590d49fcaecSMatthew G. Knepley } 2591d49fcaecSMatthew G. Knepley } 2592d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2593d49fcaecSMatthew G. Knepley } 2594d49fcaecSMatthew G. Knepley 2595d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2596d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 2597f05c90a3SMatthew G. Knepley /*@ 2598f05c90a3SMatthew G. Knepley DMPlexLocalizeCoordinates - If a mesh is periodic, create local coordinates for each cell 2599f05c90a3SMatthew G. Knepley 2600f05c90a3SMatthew G. Knepley Input Parameter: 2601f05c90a3SMatthew G. Knepley . dm - The DM 2602f05c90a3SMatthew G. Knepley 2603f05c90a3SMatthew G. Knepley Level: developer 2604f05c90a3SMatthew G. Knepley 2605f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinate(), DMPlexLocalizeAddCoordinate() 2606f05c90a3SMatthew G. Knepley @*/ 2607d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 2608d49fcaecSMatthew G. Knepley { 2609d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 2610d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 2611d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 26128c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 2613d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 2614d49fcaecSMatthew G. Knepley 2615d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2616d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2617d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 2618d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2619d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2620d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2621d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2622d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 26238c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 26248c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 26258c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 2626d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 2627d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2628d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2629d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 26308c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 2631d49fcaecSMatthew G. Knepley } 2632d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2633d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 2634d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 26358c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 2636d49fcaecSMatthew G. Knepley } 2637d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 2638d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 2639d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 2640d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 2641d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 2642d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2643d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 2644d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2645d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 2646d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2647d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2648d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2649d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 2650d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 2651d49fcaecSMatthew G. Knepley } 2652d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2653d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2654d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 2655d49fcaecSMatthew G. Knepley PetscInt b; 2656d49fcaecSMatthew G. Knepley 2657d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2658d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 2659d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 2660d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 2661d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2662d49fcaecSMatthew G. Knepley } 2663d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2664d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2665d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 266646e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 2667d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 2668d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 2669d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 2670d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2671d49fcaecSMatthew G. Knepley } 2672d49fcaecSMatthew G. Knepley 2673d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2674aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 2675552f7358SJed Brown /*@ 2676aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 2677552f7358SJed Brown 2678552f7358SJed Brown Not Collective 2679552f7358SJed Brown 2680aa50250dSMatthew G. Knepley Input Parameter: 2681552f7358SJed Brown . dm - The DMPlex object 2682552f7358SJed Brown 2683aa50250dSMatthew G. Knepley Output Parameter: 2684aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 2685552f7358SJed Brown 2686552f7358SJed Brown Level: developer 2687552f7358SJed Brown 2688aa50250dSMatthew G. Knepley .keywords: mesh, points 2689aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2690aa50250dSMatthew G. Knepley @*/ 2691aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 2692aa50250dSMatthew G. Knepley { 2693aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2694aa50250dSMatthew G. Knepley PetscErrorCode ierr; 2695aa50250dSMatthew G. Knepley 2696aa50250dSMatthew G. Knepley PetscFunctionBegin; 2697aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2698aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 269963d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 2700aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 2701aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 2702aa50250dSMatthew G. Knepley } 2703aa50250dSMatthew G. Knepley 2704aa50250dSMatthew G. Knepley #undef __FUNCT__ 2705aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 2706aa50250dSMatthew G. Knepley /*@ 2707aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 2708aa50250dSMatthew G. Knepley 2709aa50250dSMatthew G. Knepley Not Collective 2710aa50250dSMatthew G. Knepley 2711aa50250dSMatthew G. Knepley Input Parameter: 2712aa50250dSMatthew G. Knepley . dm - The DMPlex object 2713aa50250dSMatthew G. Knepley 2714aa50250dSMatthew G. Knepley Output Parameter: 2715aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 2716aa50250dSMatthew G. Knepley 2717aa50250dSMatthew G. Knepley Level: developer 2718552f7358SJed Brown 2719552f7358SJed Brown .keywords: mesh, points 2720aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2721552f7358SJed Brown @*/ 2722552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 2723552f7358SJed Brown { 2724aa50250dSMatthew G. Knepley DMLabel label; 2725aa50250dSMatthew G. Knepley PetscInt d = 0; 2726552f7358SJed Brown PetscErrorCode ierr; 2727552f7358SJed Brown 2728552f7358SJed Brown PetscFunctionBegin; 2729552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2730552f7358SJed Brown PetscValidPointer(depth, 2); 2731aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2732aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 2733552f7358SJed Brown *depth = d-1; 2734552f7358SJed Brown PetscFunctionReturn(0); 2735552f7358SJed Brown } 2736552f7358SJed Brown 2737552f7358SJed Brown #undef __FUNCT__ 2738552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 2739552f7358SJed Brown /*@ 2740552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 2741552f7358SJed Brown 2742552f7358SJed Brown Not Collective 2743552f7358SJed Brown 2744552f7358SJed Brown Input Parameters: 2745552f7358SJed Brown + dm - The DMPlex object 2746552f7358SJed Brown - stratumValue - The requested depth 2747552f7358SJed Brown 2748552f7358SJed Brown Output Parameters: 2749552f7358SJed Brown + start - The first point at this depth 2750552f7358SJed Brown - end - One beyond the last point at this depth 2751552f7358SJed Brown 2752552f7358SJed Brown Level: developer 2753552f7358SJed Brown 2754552f7358SJed Brown .keywords: mesh, points 2755552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 2756552f7358SJed Brown @*/ 27570adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 27580adebc6cSBarry Smith { 2759aa50250dSMatthew G. Knepley DMLabel label; 276063d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 2761552f7358SJed Brown PetscErrorCode ierr; 2762552f7358SJed Brown 2763552f7358SJed Brown PetscFunctionBegin; 2764552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 276563d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 276663d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2767552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 27680d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 276963d1a920SMatthew G. Knepley if (stratumValue < 0) { 277063d1a920SMatthew G. Knepley if (start) *start = pStart; 277163d1a920SMatthew G. Knepley if (end) *end = pEnd; 277263d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2773552f7358SJed Brown } 2774aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 277563d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 277663d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 2777552f7358SJed Brown PetscFunctionReturn(0); 2778552f7358SJed Brown } 2779552f7358SJed Brown 2780552f7358SJed Brown #undef __FUNCT__ 2781552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 2782552f7358SJed Brown /*@ 2783552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 2784552f7358SJed Brown 2785552f7358SJed Brown Not Collective 2786552f7358SJed Brown 2787552f7358SJed Brown Input Parameters: 2788552f7358SJed Brown + dm - The DMPlex object 2789552f7358SJed Brown - stratumValue - The requested height 2790552f7358SJed Brown 2791552f7358SJed Brown Output Parameters: 2792552f7358SJed Brown + start - The first point at this height 2793552f7358SJed Brown - end - One beyond the last point at this height 2794552f7358SJed Brown 2795552f7358SJed Brown Level: developer 2796552f7358SJed Brown 2797552f7358SJed Brown .keywords: mesh, points 2798552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 2799552f7358SJed Brown @*/ 28000adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 28010adebc6cSBarry Smith { 2802aa50250dSMatthew G. Knepley DMLabel label; 280363d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 2804552f7358SJed Brown PetscErrorCode ierr; 2805552f7358SJed Brown 2806552f7358SJed Brown PetscFunctionBegin; 2807552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 280863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 280963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2810552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 28110d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 281263d1a920SMatthew G. Knepley if (stratumValue < 0) { 281363d1a920SMatthew G. Knepley if (start) *start = pStart; 281463d1a920SMatthew G. Knepley if (end) *end = pEnd; 281563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2816552f7358SJed Brown } 2817aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2818aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 281963d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 282063d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 2821552f7358SJed Brown PetscFunctionReturn(0); 2822552f7358SJed Brown } 2823552f7358SJed Brown 2824552f7358SJed Brown #undef __FUNCT__ 2825552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 2826552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 2827a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 2828a6dfd86eSKarl Rupp { 2829ee55978aSMatthew G. Knepley PetscInt *pMax; 2830916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 2831ee55978aSMatthew G. Knepley PetscInt Nf, p, d, dep, f; 2832fa716be8SMatthew G. Knepley PetscBool *isFE; 2833552f7358SJed Brown PetscErrorCode ierr; 2834552f7358SJed Brown 2835552f7358SJed Brown PetscFunctionBegin; 2836fa716be8SMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 2837ee55978aSMatthew G. Knepley ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr); 2838fa716be8SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 2839fa716be8SMatthew G. Knepley PetscObject obj; 2840fa716be8SMatthew G. Knepley PetscClassId id; 2841fa716be8SMatthew G. Knepley 2842ee55978aSMatthew G. Knepley isFE[f] = PETSC_FALSE; 2843ee55978aSMatthew G. Knepley if (f >= Nf) continue; 2844fa716be8SMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 2845fa716be8SMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 2846fa716be8SMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 2847fa716be8SMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 2848552f7358SJed Brown } 284982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2850552f7358SJed Brown if (numFields > 0) { 2851552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 2852552f7358SJed Brown if (numComp) { 2853552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2854552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 2855552f7358SJed Brown } 2856552f7358SJed Brown } 2857552f7358SJed Brown } 2858552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2859552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 2860916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 28619ac3fadcSMatthew G. Knepley ierr = PetscMalloc1(depth+1,&pMax);CHKERRQ(ierr); 28629ac3fadcSMatthew 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); 2863916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 2864916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 2865916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 2866fa716be8SMatthew G. Knepley pMax[dep] = pMax[dep] < 0 ? pEnd : pMax[dep]; 2867552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2868ee55978aSMatthew G. Knepley PetscInt tot = 0; 2869ee55978aSMatthew G. Knepley 2870552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2871fa716be8SMatthew G. Knepley if (isFE[f] && p >= pMax[dep]) continue; 2872552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 2873ee55978aSMatthew G. Knepley tot += numDof[f*(dim+1)+d]; 2874552f7358SJed Brown } 2875ee55978aSMatthew G. Knepley ierr = PetscSectionSetDof(*section, p, tot);CHKERRQ(ierr); 2876552f7358SJed Brown } 2877552f7358SJed Brown } 28789ac3fadcSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 2879fa716be8SMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 2880552f7358SJed Brown PetscFunctionReturn(0); 2881552f7358SJed Brown } 2882552f7358SJed Brown 2883552f7358SJed Brown #undef __FUNCT__ 2884552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 2885552f7358SJed Brown /* Set the number of dof on each point and separate by fields 2886ab1d0545SMatthew G. Knepley If bcComps is NULL or the IS is NULL, constrain every dof on the point 2887552f7358SJed Brown */ 2888ab1d0545SMatthew G. Knepley PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC, const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], PetscSection section) 2889a6dfd86eSKarl Rupp { 2890552f7358SJed Brown PetscInt numFields; 2891552f7358SJed Brown PetscInt bc; 2892a68b90caSToby Isaac PetscSection aSec; 2893552f7358SJed Brown PetscErrorCode ierr; 2894552f7358SJed Brown 2895552f7358SJed Brown PetscFunctionBegin; 2896552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2897552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 2898552f7358SJed Brown PetscInt field = 0; 2899ab1d0545SMatthew G. Knepley const PetscInt *comp; 2900552f7358SJed Brown const PetscInt *idx; 2901ab1d0545SMatthew G. Knepley PetscInt Nc = -1, n, i; 2902552f7358SJed Brown 29030d644c17SKarl Rupp if (numFields) field = bcField[bc]; 2904ab1d0545SMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetLocalSize(bcComps[bc], &Nc);CHKERRQ(ierr);} 2905ab1d0545SMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 2906552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2907552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2908552f7358SJed Brown for (i = 0; i < n; ++i) { 2909552f7358SJed Brown const PetscInt p = idx[i]; 291006ff1081SMatthew G. Knepley PetscInt numConst; 2911552f7358SJed Brown 2912552f7358SJed Brown if (numFields) { 2913552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 2914552f7358SJed Brown } else { 2915552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 2916552f7358SJed Brown } 291706ff1081SMatthew G. Knepley /* If Nc < 0, constrain every dof on the point */ 291806ff1081SMatthew G. Knepley if (Nc > 0) numConst = PetscMin(numConst, Nc); 291906ff1081SMatthew G. Knepley if (numFields) {ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);} 2920552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 2921552f7358SJed Brown } 2922552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 292306ff1081SMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISRestoreIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 2924552f7358SJed Brown } 2925a17985deSToby Isaac ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 2926a68b90caSToby Isaac if (aSec) { 2927a68b90caSToby Isaac PetscInt aStart, aEnd, a; 2928a68b90caSToby Isaac 2929a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 2930a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 2931ab1d0545SMatthew G. Knepley PetscInt dof, f; 2932a68b90caSToby Isaac 2933a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 2934a68b90caSToby Isaac if (dof) { 2935a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 2936a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 2937a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 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 } 2945552f7358SJed Brown PetscFunctionReturn(0); 2946552f7358SJed Brown } 2947552f7358SJed Brown 2948552f7358SJed Brown #undef __FUNCT__ 2949ab1d0545SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 2950ab1d0545SMatthew G. Knepley /* Set the constrained field indices on each point 2951ab1d0545SMatthew G. Knepley If bcComps is NULL or the IS is NULL, constrain every dof on the point 2952ab1d0545SMatthew G. Knepley */ 2953ab1d0545SMatthew G. Knepley PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt numBC,const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], PetscSection section) 29540adebc6cSBarry Smith { 2955ab1d0545SMatthew G. Knepley PetscSection aSec; 2956ab1d0545SMatthew G. Knepley PetscInt *indices; 2957ab1d0545SMatthew G. Knepley PetscInt numFields, maxDof, pStart, pEnd, p, bc, f, d; 2958552f7358SJed Brown PetscErrorCode ierr; 2959552f7358SJed Brown 2960552f7358SJed Brown PetscFunctionBegin; 2961552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2962ab1d0545SMatthew G. Knepley if (!numFields) PetscFunctionReturn(0); 2963ab1d0545SMatthew G. Knepley /* Initialize all field indices to -1 */ 2964552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2965ab1d0545SMatthew G. Knepley ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 2966ab1d0545SMatthew G. Knepley ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 2967ab1d0545SMatthew G. Knepley for (d = 0; d < maxDof; ++d) indices[d] = -1; 2968ab1d0545SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) for (f = 0; f < numFields; ++f) {ierr = PetscSectionSetFieldConstraintIndices(section, p, f, indices);CHKERRQ(ierr);} 2969ab1d0545SMatthew G. Knepley /* Handle BC constraints */ 2970ab1d0545SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) { 2971ab1d0545SMatthew G. Knepley const PetscInt field = bcField[bc]; 2972ab1d0545SMatthew G. Knepley const PetscInt *comp, *idx; 2973ab1d0545SMatthew G. Knepley PetscInt Nc = -1, n, i; 2974552f7358SJed Brown 2975ab1d0545SMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetLocalSize(bcComps[bc], &Nc);CHKERRQ(ierr);} 2976ab1d0545SMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISGetIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 2977ab1d0545SMatthew G. Knepley ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2978ab1d0545SMatthew G. Knepley ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2979ab1d0545SMatthew G. Knepley for (i = 0; i < n; ++i) { 2980ab1d0545SMatthew G. Knepley const PetscInt p = idx[i]; 2981ab1d0545SMatthew G. Knepley const PetscInt *find; 2982ab1d0545SMatthew G. Knepley PetscInt fcdof, c; 2983ab1d0545SMatthew G. Knepley 2984ab1d0545SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, p, field, &fcdof);CHKERRQ(ierr); 2985ab1d0545SMatthew G. Knepley if (Nc < 0) { 2986ab1d0545SMatthew G. Knepley for (d = 0; d < fcdof; ++d) indices[d] = d; 2987552f7358SJed Brown } else { 2988ab1d0545SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, p, field, &find);CHKERRQ(ierr); 2989ab1d0545SMatthew G. Knepley for (d = 0; d < fcdof; ++d) {if (find[d] < 0) break; indices[d] = find[d];} 2990ab1d0545SMatthew G. Knepley for (c = 0; c < Nc; ++c) indices[d+c] = comp[c]; 2991ab1d0545SMatthew G. Knepley ierr = PetscSortInt(d+Nc, indices);CHKERRQ(ierr); 2992ab1d0545SMatthew G. Knepley for (c = d+Nc; c < fcdof; ++c) indices[c] = -1; 2993552f7358SJed Brown } 2994ab1d0545SMatthew G. Knepley ierr = PetscSectionSetFieldConstraintIndices(section, p, field, indices);CHKERRQ(ierr); 2995552f7358SJed Brown } 2996ab1d0545SMatthew G. Knepley if (bcComps && bcComps[bc]) {ierr = ISRestoreIndices(bcComps[bc], &comp);CHKERRQ(ierr);} 2997ab1d0545SMatthew G. Knepley ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2998552f7358SJed Brown } 2999ab1d0545SMatthew G. Knepley /* Handle anchors */ 3000ab1d0545SMatthew G. Knepley ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 3001ab1d0545SMatthew G. Knepley if (aSec) { 3002ab1d0545SMatthew G. Knepley PetscInt aStart, aEnd, a; 3003552f7358SJed Brown 3004ab1d0545SMatthew G. Knepley for (d = 0; d < maxDof; ++d) indices[d] = d; 3005ab1d0545SMatthew G. Knepley ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 3006ab1d0545SMatthew G. Knepley for (a = aStart; a < aEnd; a++) { 3007ab1d0545SMatthew G. Knepley PetscInt dof, fdof, f; 3008ab1d0545SMatthew G. Knepley 3009ab1d0545SMatthew G. Knepley ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 3010ab1d0545SMatthew G. Knepley if (dof) { 3011ab1d0545SMatthew G. Knepley /* if there are point-to-point constraints, then all dofs are constrained */ 3012ab1d0545SMatthew G. Knepley for (f = 0; f < numFields; f++) { 3013ab1d0545SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, a, f, &fdof);CHKERRQ(ierr); 3014ab1d0545SMatthew G. Knepley ierr = PetscSectionSetFieldConstraintIndices(section, a, f, indices);CHKERRQ(ierr); 3015ab1d0545SMatthew G. Knepley } 3016ab1d0545SMatthew G. Knepley } 3017ab1d0545SMatthew G. Knepley } 3018ab1d0545SMatthew G. Knepley } 3019ab1d0545SMatthew G. Knepley ierr = PetscFree(indices);CHKERRQ(ierr); 3020ab1d0545SMatthew G. Knepley PetscFunctionReturn(0); 3021ab1d0545SMatthew G. Knepley } 3022ab1d0545SMatthew G. Knepley 3023ab1d0545SMatthew G. Knepley #undef __FUNCT__ 3024ab1d0545SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSectionBCIndices" 3025ab1d0545SMatthew G. Knepley /* Set the constrained indices on each point */ 3026ab1d0545SMatthew G. Knepley PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 3027ab1d0545SMatthew G. Knepley { 3028ab1d0545SMatthew G. Knepley PetscInt *indices; 3029ab1d0545SMatthew G. Knepley PetscInt numFields, maxDof, pStart, pEnd, p, f, d; 3030ab1d0545SMatthew G. Knepley PetscErrorCode ierr; 3031ab1d0545SMatthew G. Knepley 3032ab1d0545SMatthew G. Knepley PetscFunctionBegin; 3033ab1d0545SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3034ab1d0545SMatthew G. Knepley ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3035ab1d0545SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3036ab1d0545SMatthew G. Knepley ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 3037ab1d0545SMatthew G. Knepley for (d = 0; d < maxDof; ++d) indices[d] = -1; 3038552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3039552f7358SJed Brown PetscInt cdof, d; 3040552f7358SJed Brown 3041552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3042552f7358SJed Brown if (cdof) { 3043552f7358SJed Brown if (numFields) { 3044552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3045552f7358SJed Brown 3046552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3047ab1d0545SMatthew G. Knepley const PetscInt *find; 3048ab1d0545SMatthew G. Knepley PetscInt fcdof, fdof; 3049552f7358SJed Brown 3050552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3051ab1d0545SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 3052ab1d0545SMatthew G. Knepley /* Change constraint numbering from field component to local dof number */ 3053ab1d0545SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &find);CHKERRQ(ierr); 3054ab1d0545SMatthew G. Knepley for (d = 0; d < fcdof; ++d) indices[numConst+d] = find[d] + foff; 3055ab1d0545SMatthew G. Knepley numConst += fcdof; 3056552f7358SJed Brown foff += fdof; 3057552f7358SJed Brown } 3058552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3059552f7358SJed Brown } else { 30600d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 3061552f7358SJed Brown } 3062552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3063552f7358SJed Brown } 3064552f7358SJed Brown } 3065552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3066552f7358SJed Brown PetscFunctionReturn(0); 3067552f7358SJed Brown } 3068552f7358SJed Brown 3069552f7358SJed Brown #undef __FUNCT__ 3070552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 3071552f7358SJed Brown /*@C 3072552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 3073552f7358SJed Brown 3074552f7358SJed Brown Not Collective 3075552f7358SJed Brown 3076552f7358SJed Brown Input Parameters: 3077552f7358SJed Brown + dm - The DMPlex object 3078552f7358SJed Brown . dim - The spatial dimension of the problem 3079552f7358SJed Brown . numFields - The number of fields in the problem 3080552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 3081552f7358SJed 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 3082552f7358SJed Brown . numBC - The number of boundary conditions 3083552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 3084ab1d0545SMatthew G. Knepley . bcComps - [Optional] An array of size numBC giving an IS holding the field components to which each boundary condition applies 3085ab1d0545SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the Plex points to which each boundary condition applies 3086f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 3087552f7358SJed Brown 3088552f7358SJed Brown Output Parameter: 3089552f7358SJed Brown . section - The PetscSection object 3090552f7358SJed Brown 3091552f7358SJed 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 3092f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 3093f8f126e8SMatthew G. Knepley 3094f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 3095552f7358SJed Brown 3096552f7358SJed Brown Level: developer 3097552f7358SJed Brown 30983813dfbdSMatthew G Knepley Fortran Notes: 30993813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 31003813dfbdSMatthew G Knepley 3101552f7358SJed Brown .keywords: mesh, elements 3102f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 3103552f7358SJed Brown @*/ 3104ab1d0545SMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[], const IS bcComps[], const IS bcPoints[], IS perm, PetscSection *section) 3105a6dfd86eSKarl Rupp { 3106a68b90caSToby Isaac PetscSection aSec; 3107552f7358SJed Brown PetscErrorCode ierr; 3108552f7358SJed Brown 3109552f7358SJed Brown PetscFunctionBegin; 3110552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 3111ab1d0545SMatthew G. Knepley ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcComps, bcPoints, *section);CHKERRQ(ierr); 3112f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 3113552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3114a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr); 3115ab1d0545SMatthew G. Knepley if (numBC || aSec) { 3116ab1d0545SMatthew G. Knepley ierr = DMPlexCreateSectionBCIndicesField(dm, numBC, bcField, bcComps, bcPoints, *section);CHKERRQ(ierr); 3117ab1d0545SMatthew G. Knepley ierr = DMPlexCreateSectionBCIndices(dm, *section);CHKERRQ(ierr); 3118ab1d0545SMatthew G. Knepley } 3119ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 3120552f7358SJed Brown PetscFunctionReturn(0); 3121552f7358SJed Brown } 3122552f7358SJed Brown 3123552f7358SJed Brown #undef __FUNCT__ 3124552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 31250adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 31260adebc6cSBarry Smith { 3127552f7358SJed Brown PetscSection section; 3128552f7358SJed Brown PetscErrorCode ierr; 3129552f7358SJed Brown 3130552f7358SJed Brown PetscFunctionBegin; 313138221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 313282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 3133552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 31341d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 3135552f7358SJed Brown PetscFunctionReturn(0); 3136552f7358SJed Brown } 3137552f7358SJed Brown 3138552f7358SJed Brown #undef __FUNCT__ 3139552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 31400adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 31410adebc6cSBarry Smith { 3142552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3143552f7358SJed Brown 3144552f7358SJed Brown PetscFunctionBegin; 3145552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3146552f7358SJed Brown if (section) *section = mesh->coneSection; 3147552f7358SJed Brown PetscFunctionReturn(0); 3148552f7358SJed Brown } 3149552f7358SJed Brown 3150552f7358SJed Brown #undef __FUNCT__ 31518cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 31528cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 31538cb4d582SMatthew G. Knepley { 31548cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 31558cb4d582SMatthew G. Knepley 31568cb4d582SMatthew G. Knepley PetscFunctionBegin; 31578cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 31588cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 31598cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 31608cb4d582SMatthew G. Knepley } 31618cb4d582SMatthew G. Knepley 31628cb4d582SMatthew G. Knepley #undef __FUNCT__ 3163552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 3164a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 3165a6dfd86eSKarl Rupp { 3166552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3167552f7358SJed Brown 3168552f7358SJed Brown PetscFunctionBegin; 3169552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3170552f7358SJed Brown if (cones) *cones = mesh->cones; 3171552f7358SJed Brown PetscFunctionReturn(0); 3172552f7358SJed Brown } 3173552f7358SJed Brown 3174552f7358SJed Brown #undef __FUNCT__ 3175552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 3176a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 3177a6dfd86eSKarl Rupp { 3178552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3179552f7358SJed Brown 3180552f7358SJed Brown PetscFunctionBegin; 3181552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3182552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 3183552f7358SJed Brown PetscFunctionReturn(0); 3184552f7358SJed Brown } 3185552f7358SJed Brown 3186552f7358SJed Brown /******************************** FEM Support **********************************/ 3187552f7358SJed Brown 3188552f7358SJed Brown #undef __FUNCT__ 31891a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 31901a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3191a6dfd86eSKarl Rupp { 3192552f7358SJed Brown PetscScalar *array, *vArray; 3193d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 31941a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 3195552f7358SJed Brown PetscErrorCode ierr; 3196552f7358SJed Brown 31971b406b76SMatthew G. Knepley PetscFunctionBeginHot; 31982a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 31995a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 32005a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 32015a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 32023f7cbbe7SMatthew G. Knepley if (!values || !*values) { 32039df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32049df71ca4SMatthew G. Knepley PetscInt dof; 3205d9917b9dSMatthew G. Knepley 32069df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32079df71ca4SMatthew G. Knepley size += dof; 32089df71ca4SMatthew G. Knepley } 32099df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32109df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32112a3aaacfSMatthew G. Knepley PetscInt dof; 32125a1bb5cfSMatthew G. Knepley 32135a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32142a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32155a1bb5cfSMatthew G. Knepley size += dof; 32165a1bb5cfSMatthew G. Knepley } 32173f7cbbe7SMatthew G. Knepley if (!values) { 32183f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 32193f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 32203f7cbbe7SMatthew G. Knepley } 32215a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 3222982e9ed1SMatthew G. Knepley } else { 3223982e9ed1SMatthew G. Knepley array = *values; 3224982e9ed1SMatthew G. Knepley } 32259df71ca4SMatthew G. Knepley size = 0; 32265a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 32279df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32289df71ca4SMatthew G. Knepley PetscInt dof, off, d; 32299df71ca4SMatthew G. Knepley PetscScalar *varr; 3230d9917b9dSMatthew G. Knepley 32319df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32329df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 32339df71ca4SMatthew G. Knepley varr = &vArray[off]; 32341a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32351a271a75SMatthew G. Knepley array[offset] = varr[d]; 32369df71ca4SMatthew G. Knepley } 32379df71ca4SMatthew G. Knepley size += dof; 32389df71ca4SMatthew G. Knepley } 32399df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32409df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32419df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 32425a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 32435a1bb5cfSMatthew G. Knepley PetscScalar *varr; 32445a1bb5cfSMatthew G. Knepley 324552ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32465a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32475a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 32485a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 32495a1bb5cfSMatthew G. Knepley if (o >= 0) { 32501a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32511a271a75SMatthew G. Knepley array[offset] = varr[d]; 32525a1bb5cfSMatthew G. Knepley } 32535a1bb5cfSMatthew G. Knepley } else { 32541a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 32551a271a75SMatthew G. Knepley array[offset] = varr[d]; 32565a1bb5cfSMatthew G. Knepley } 32575a1bb5cfSMatthew G. Knepley } 32589df71ca4SMatthew G. Knepley size += dof; 32595a1bb5cfSMatthew G. Knepley } 32605a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 32619df71ca4SMatthew G. Knepley if (!*values) { 32625a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 32635a1bb5cfSMatthew G. Knepley *values = array; 32649df71ca4SMatthew G. Knepley } else { 32659df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 32668c312ff3SMatthew G. Knepley *csize = size; 32679df71ca4SMatthew G. Knepley } 32685a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 32695a1bb5cfSMatthew G. Knepley } 3270d9917b9dSMatthew G. Knepley 3271d9917b9dSMatthew G. Knepley #undef __FUNCT__ 32721a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 32731a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 32741a271a75SMatthew G. Knepley { 32751a271a75SMatthew G. Knepley PetscInt offset = 0, p; 32761a271a75SMatthew G. Knepley PetscErrorCode ierr; 32771a271a75SMatthew G. Knepley 32781a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3279fe02ba77SJed Brown *size = 0; 32801a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 32811a271a75SMatthew G. Knepley const PetscInt point = points[p]; 32821a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 32831a271a75SMatthew G. Knepley PetscInt dof, off, d; 32841a271a75SMatthew G. Knepley const PetscScalar *varr; 32851a271a75SMatthew G. Knepley 32861a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32871a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 32881a271a75SMatthew G. Knepley varr = &vArray[off]; 32891a271a75SMatthew G. Knepley if (o >= 0) { 32901a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 32911a271a75SMatthew G. Knepley } else { 32921a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 32931a271a75SMatthew G. Knepley } 32941a271a75SMatthew G. Knepley } 32951a271a75SMatthew G. Knepley *size = offset; 32961a271a75SMatthew G. Knepley PetscFunctionReturn(0); 32971a271a75SMatthew G. Knepley } 32981a271a75SMatthew G. Knepley 32991a271a75SMatthew G. Knepley #undef __FUNCT__ 33001a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 33011a271a75SMatthew 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[]) 33021a271a75SMatthew G. Knepley { 33031a271a75SMatthew G. Knepley PetscInt offset = 0, f; 33041a271a75SMatthew G. Knepley PetscErrorCode ierr; 33051a271a75SMatthew G. Knepley 33061a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3307fe02ba77SJed Brown *size = 0; 33081a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 33091a271a75SMatthew G. Knepley PetscInt fcomp, p; 33101a271a75SMatthew G. Knepley 33111a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 33121a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33131a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33141a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33151a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 33161a271a75SMatthew G. Knepley const PetscScalar *varr; 33171a271a75SMatthew G. Knepley 33181a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 33191a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 33201a271a75SMatthew G. Knepley varr = &vArray[foff]; 33211a271a75SMatthew G. Knepley if (o >= 0) { 33221a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 33231a271a75SMatthew G. Knepley } else { 33241a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 33251a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 33261a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 33271a271a75SMatthew G. Knepley } 33281a271a75SMatthew G. Knepley } 33291a271a75SMatthew G. Knepley } 33301a271a75SMatthew G. Knepley } 33311a271a75SMatthew G. Knepley } 33321a271a75SMatthew G. Knepley *size = offset; 33331a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33341a271a75SMatthew G. Knepley } 33351a271a75SMatthew G. Knepley 33361a271a75SMatthew G. Knepley #undef __FUNCT__ 3337552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 3338552f7358SJed Brown /*@C 3339552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 3340552f7358SJed Brown 3341552f7358SJed Brown Not collective 3342552f7358SJed Brown 3343552f7358SJed Brown Input Parameters: 3344552f7358SJed Brown + dm - The DM 3345552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 3346552f7358SJed Brown . v - The local vector 3347552f7358SJed Brown - point - The sieve point in the DM 3348552f7358SJed Brown 3349552f7358SJed Brown Output Parameters: 3350552f7358SJed Brown + csize - The number of values in the closure, or NULL 3351552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3352552f7358SJed Brown 3353552f7358SJed Brown Fortran Notes: 3354552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 3355552f7358SJed Brown include petsc.h90 in your code. 3356552f7358SJed Brown 3357552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 3358552f7358SJed Brown 3359552f7358SJed Brown Level: intermediate 3360552f7358SJed Brown 3361552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3362552f7358SJed Brown @*/ 3363552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3364552f7358SJed Brown { 3365552f7358SJed Brown PetscSection clSection; 3366d9917b9dSMatthew G. Knepley IS clPoints; 3367552f7358SJed Brown PetscScalar *array, *vArray; 3368552f7358SJed Brown PetscInt *points = NULL; 3369d9917b9dSMatthew G. Knepley const PetscInt *clp; 33701a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 3371552f7358SJed Brown PetscErrorCode ierr; 3372552f7358SJed Brown 3373d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 3374552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3375552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 33761a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 33771a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3378552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3379552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3380552f7358SJed Brown if (depth == 1 && numFields < 2) { 33811a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 3382552f7358SJed Brown PetscFunctionReturn(0); 3383552f7358SJed Brown } 33841a271a75SMatthew G. Knepley /* Get points */ 3385d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3386d9917b9dSMatthew G. Knepley if (!clPoints) { 33871a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 3388552f7358SJed Brown 33891a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3390552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3391552f7358SJed Brown /* Compress out points not in the section */ 3392552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3393552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3394552f7358SJed Brown points[q*2] = points[p]; 3395552f7358SJed Brown points[q*2+1] = points[p+1]; 3396552f7358SJed Brown ++q; 3397552f7358SJed Brown } 3398552f7358SJed Brown } 3399552f7358SJed Brown numPoints = q; 3400d9917b9dSMatthew G. Knepley } else { 3401d9917b9dSMatthew G. Knepley PetscInt dof, off; 3402552f7358SJed Brown 3403d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3404d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3405d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 34061a271a75SMatthew G. Knepley numPoints = dof/2; 3407d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3408552f7358SJed Brown } 34091a271a75SMatthew G. Knepley /* Get array */ 3410552f7358SJed Brown if (!values || !*values) { 34111a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 3412552f7358SJed Brown 34131a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3414552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 34151a271a75SMatthew G. Knepley asize += dof; 3416552f7358SJed Brown } 3417bd6c0d32SMatthew G. Knepley if (!values) { 3418d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34191a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34201a271a75SMatthew G. Knepley if (csize) *csize = asize; 3421bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 3422bd6c0d32SMatthew G. Knepley } 34231a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 3424d0f6b257SMatthew G. Knepley } else { 3425d0f6b257SMatthew G. Knepley array = *values; 3426d0f6b257SMatthew G. Knepley } 3427552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 34281a271a75SMatthew G. Knepley /* Get values */ 3429ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 34301a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 34311a271a75SMatthew G. Knepley /* Cleanup points */ 34321a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34331a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34341a271a75SMatthew G. Knepley /* Cleanup array */ 3435552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 3436d0f6b257SMatthew G. Knepley if (!*values) { 3437552f7358SJed Brown if (csize) *csize = size; 3438552f7358SJed Brown *values = array; 3439d0f6b257SMatthew G. Knepley } else { 3440d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 3441d0f6b257SMatthew G. Knepley *csize = size; 3442d0f6b257SMatthew G. Knepley } 3443552f7358SJed Brown PetscFunctionReturn(0); 3444552f7358SJed Brown } 3445552f7358SJed Brown 3446552f7358SJed Brown #undef __FUNCT__ 3447552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 3448552f7358SJed Brown /*@C 3449552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 3450552f7358SJed Brown 3451552f7358SJed Brown Not collective 3452552f7358SJed Brown 3453552f7358SJed Brown Input Parameters: 3454552f7358SJed Brown + dm - The DM 34550298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 3456552f7358SJed Brown . v - The local vector 3457552f7358SJed Brown . point - The sieve point in the DM 34580298fd71SBarry Smith . csize - The number of values in the closure, or NULL 3459552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3460552f7358SJed Brown 34613813dfbdSMatthew G Knepley Fortran Notes: 34623813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 34633813dfbdSMatthew G Knepley include petsc.h90 in your code. 34643813dfbdSMatthew G Knepley 34653813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 34663813dfbdSMatthew G Knepley 3467552f7358SJed Brown Level: intermediate 3468552f7358SJed Brown 3469552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3470552f7358SJed Brown @*/ 34717c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3472a6dfd86eSKarl Rupp { 3473552f7358SJed Brown PetscInt size = 0; 3474552f7358SJed Brown PetscErrorCode ierr; 3475552f7358SJed Brown 3476552f7358SJed Brown PetscFunctionBegin; 3477552f7358SJed Brown /* Should work without recalculating size */ 3478552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 3479552f7358SJed Brown PetscFunctionReturn(0); 3480552f7358SJed Brown } 3481552f7358SJed Brown 3482552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 3483552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 3484552f7358SJed Brown 3485552f7358SJed Brown #undef __FUNCT__ 3486552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 34871a271a75SMatthew 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[]) 3488552f7358SJed Brown { 3489552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3490552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3491552f7358SJed Brown PetscScalar *a; 3492552f7358SJed Brown PetscInt off, cind = 0, k; 3493552f7358SJed Brown PetscErrorCode ierr; 3494552f7358SJed Brown 3495552f7358SJed Brown PetscFunctionBegin; 3496552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3497552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3498552f7358SJed Brown a = &array[off]; 3499552f7358SJed Brown if (!cdof || setBC) { 3500552f7358SJed Brown if (orientation >= 0) { 3501552f7358SJed Brown for (k = 0; k < dof; ++k) { 3502552f7358SJed Brown fuse(&a[k], values[k]); 3503552f7358SJed Brown } 3504552f7358SJed Brown } else { 3505552f7358SJed Brown for (k = 0; k < dof; ++k) { 3506552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3507552f7358SJed Brown } 3508552f7358SJed Brown } 3509552f7358SJed Brown } else { 3510552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3511552f7358SJed Brown if (orientation >= 0) { 3512552f7358SJed Brown for (k = 0; k < dof; ++k) { 3513552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3514552f7358SJed Brown fuse(&a[k], values[k]); 3515552f7358SJed Brown } 3516552f7358SJed Brown } else { 3517552f7358SJed Brown for (k = 0; k < dof; ++k) { 3518552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3519552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3520552f7358SJed Brown } 3521552f7358SJed Brown } 3522552f7358SJed Brown } 3523552f7358SJed Brown PetscFunctionReturn(0); 3524552f7358SJed Brown } 3525552f7358SJed Brown 3526552f7358SJed Brown #undef __FUNCT__ 3527a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 35281a271a75SMatthew 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[]) 3529a5e93ea8SMatthew G. Knepley { 3530a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 3531a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3532a5e93ea8SMatthew G. Knepley PetscScalar *a; 3533a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 3534a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3535a5e93ea8SMatthew G. Knepley 3536a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3537a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3538a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3539a5e93ea8SMatthew G. Knepley a = &array[off]; 3540a5e93ea8SMatthew G. Knepley if (cdof) { 3541a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3542a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 3543a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3544a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3545a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 3546a5e93ea8SMatthew G. Knepley ++cind; 3547a5e93ea8SMatthew G. Knepley } 3548a5e93ea8SMatthew G. Knepley } 3549a5e93ea8SMatthew G. Knepley } else { 3550a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3551a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3552a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 3553a5e93ea8SMatthew G. Knepley ++cind; 3554a5e93ea8SMatthew G. Knepley } 3555a5e93ea8SMatthew G. Knepley } 3556a5e93ea8SMatthew G. Knepley } 3557a5e93ea8SMatthew G. Knepley } 3558a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3559a5e93ea8SMatthew G. Knepley } 3560a5e93ea8SMatthew G. Knepley 3561a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 3562552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 35631a271a75SMatthew 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[]) 3564a6dfd86eSKarl Rupp { 3565552f7358SJed Brown PetscScalar *a; 35661a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 35671a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 35681a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3569552f7358SJed Brown PetscErrorCode ierr; 3570552f7358SJed Brown 3571552f7358SJed Brown PetscFunctionBegin; 3572552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3573552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 35741a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 35751a271a75SMatthew G. Knepley a = &array[foff]; 3576552f7358SJed Brown if (!fcdof || setBC) { 35771a271a75SMatthew G. Knepley if (o >= 0) { 35781a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 3579552f7358SJed Brown } else { 3580552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3581552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 35821a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3583552f7358SJed Brown } 3584552f7358SJed Brown } 3585552f7358SJed Brown } 3586552f7358SJed Brown } else { 3587552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 35881a271a75SMatthew G. Knepley if (o >= 0) { 3589552f7358SJed Brown for (k = 0; k < fdof; ++k) { 3590552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 35911a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3592552f7358SJed Brown } 3593552f7358SJed Brown } else { 3594552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3595552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3596552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 35971a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3598552f7358SJed Brown } 3599552f7358SJed Brown } 3600552f7358SJed Brown } 3601552f7358SJed Brown } 36021a271a75SMatthew G. Knepley *offset += fdof; 3603552f7358SJed Brown PetscFunctionReturn(0); 3604552f7358SJed Brown } 3605552f7358SJed Brown 3606552f7358SJed Brown #undef __FUNCT__ 3607a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 36081a271a75SMatthew 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[]) 3609a5e93ea8SMatthew G. Knepley { 3610a5e93ea8SMatthew G. Knepley PetscScalar *a; 36111a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 36121a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 36131a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3614a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3615a5e93ea8SMatthew G. Knepley 3616a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3617a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3618a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 36191a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 36201a271a75SMatthew G. Knepley a = &array[foff]; 3621a5e93ea8SMatthew G. Knepley if (fcdof) { 3622a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36231a271a75SMatthew G. Knepley if (o >= 0) { 3624a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 3625a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 36261a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3627a5e93ea8SMatthew G. Knepley ++cind; 3628a5e93ea8SMatthew G. Knepley } 3629a5e93ea8SMatthew G. Knepley } 3630a5e93ea8SMatthew G. Knepley } else { 3631a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 3632a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 3633a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 36341a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3635a5e93ea8SMatthew G. Knepley ++cind; 3636a5e93ea8SMatthew G. Knepley } 3637a5e93ea8SMatthew G. Knepley } 3638a5e93ea8SMatthew G. Knepley } 3639a5e93ea8SMatthew G. Knepley } 3640a5e93ea8SMatthew G. Knepley } 36411a271a75SMatthew G. Knepley *offset += fdof; 3642a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3643a5e93ea8SMatthew G. Knepley } 3644a5e93ea8SMatthew G. Knepley 3645a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 36461b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 36471a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 3648a6dfd86eSKarl Rupp { 3649552f7358SJed Brown PetscScalar *array; 36501b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 36511b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 3652552f7358SJed Brown PetscErrorCode ierr; 3653552f7358SJed Brown 36541b406b76SMatthew G. Knepley PetscFunctionBeginHot; 3655b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3656b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 3657b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3658b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 3659b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3660b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 3661b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 3662b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 3663b6ebb6e6SMatthew G. Knepley 3664b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 3665b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 3666b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 3667b6ebb6e6SMatthew G. Knepley { 3668b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3669b6ebb6e6SMatthew G. Knepley PetscScalar *a; 3670b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 3671b6ebb6e6SMatthew G. Knepley 3672b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 3673b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 3674b6ebb6e6SMatthew G. Knepley a = &array[coff]; 3675b6ebb6e6SMatthew G. Knepley if (!cdof) { 3676b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3677b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3678b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3679b6ebb6e6SMatthew G. Knepley } 3680b6ebb6e6SMatthew G. Knepley } else { 3681b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3682b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3683b6ebb6e6SMatthew G. Knepley } 3684b6ebb6e6SMatthew G. Knepley } 3685b6ebb6e6SMatthew G. Knepley } else { 3686b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 3687b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3688b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3689b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3690b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3691b6ebb6e6SMatthew G. Knepley } 3692b6ebb6e6SMatthew G. Knepley } else { 3693b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3694b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3695b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3696b6ebb6e6SMatthew G. Knepley } 3697b6ebb6e6SMatthew G. Knepley } 3698b6ebb6e6SMatthew G. Knepley } 3699b6ebb6e6SMatthew G. Knepley } 3700b6ebb6e6SMatthew G. Knepley } 3701b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3702b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 3703b6ebb6e6SMatthew G. Knepley } 37041b406b76SMatthew G. Knepley 37051b406b76SMatthew G. Knepley #undef __FUNCT__ 37061b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 37071b406b76SMatthew G. Knepley /*@C 37081b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 37091b406b76SMatthew G. Knepley 37101b406b76SMatthew G. Knepley Not collective 37111b406b76SMatthew G. Knepley 37121b406b76SMatthew G. Knepley Input Parameters: 37131b406b76SMatthew G. Knepley + dm - The DM 37141b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 37151b406b76SMatthew G. Knepley . v - The local vector 37161b406b76SMatthew G. Knepley . point - The sieve point in the DM 37171b406b76SMatthew G. Knepley . values - The array of values 37181b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 37191b406b76SMatthew G. Knepley 37201b406b76SMatthew G. Knepley Fortran Notes: 37211b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 37221b406b76SMatthew G. Knepley 37231b406b76SMatthew G. Knepley Level: intermediate 37241b406b76SMatthew G. Knepley 37251b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 37261b406b76SMatthew G. Knepley @*/ 37271b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 37281b406b76SMatthew G. Knepley { 37291b406b76SMatthew G. Knepley PetscSection clSection; 37301b406b76SMatthew G. Knepley IS clPoints; 37311b406b76SMatthew G. Knepley PetscScalar *array; 37321b406b76SMatthew G. Knepley PetscInt *points = NULL; 37331b406b76SMatthew G. Knepley const PetscInt *clp; 37341a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 37351b406b76SMatthew G. Knepley PetscErrorCode ierr; 37361b406b76SMatthew G. Knepley 37371a271a75SMatthew G. Knepley PetscFunctionBeginHot; 37381b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 37391b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 37401a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 37411a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 37421b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 37431b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 37441b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 37451a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 37461b406b76SMatthew G. Knepley PetscFunctionReturn(0); 37471b406b76SMatthew G. Knepley } 37481a271a75SMatthew G. Knepley /* Get points */ 37491b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 37501b406b76SMatthew G. Knepley if (!clPoints) { 37511a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 37521a271a75SMatthew G. Knepley 37531a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3754552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3755552f7358SJed Brown /* Compress out points not in the section */ 3756552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3757552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3758552f7358SJed Brown points[q*2] = points[p]; 3759552f7358SJed Brown points[q*2+1] = points[p+1]; 3760552f7358SJed Brown ++q; 3761552f7358SJed Brown } 3762552f7358SJed Brown } 3763552f7358SJed Brown numPoints = q; 37641b406b76SMatthew G. Knepley } else { 37651b406b76SMatthew G. Knepley PetscInt dof, off; 3766552f7358SJed Brown 37671b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 37681b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 37691b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 37701a271a75SMatthew G. Knepley numPoints = dof/2; 37711b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 3772552f7358SJed Brown } 37731a271a75SMatthew G. Knepley /* Get array */ 3774552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 37751a271a75SMatthew G. Knepley /* Get values */ 3776ef90cfe2SMatthew G. Knepley if (numFields > 0) { 37771a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3778552f7358SJed Brown for (f = 0; f < numFields; ++f) { 37791a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3780552f7358SJed Brown switch (mode) { 3781552f7358SJed Brown case INSERT_VALUES: 3782552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 37831a271a75SMatthew G. Knepley const PetscInt point = points[p]; 37841a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 37851a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3786552f7358SJed Brown } break; 3787552f7358SJed Brown case INSERT_ALL_VALUES: 3788552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 37891a271a75SMatthew G. Knepley const PetscInt point = points[p]; 37901a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 37911a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3792552f7358SJed Brown } break; 3793a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3794a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 37951a271a75SMatthew G. Knepley const PetscInt point = points[p]; 37961a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 37971a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3798a5e93ea8SMatthew G. Knepley } break; 3799552f7358SJed Brown case ADD_VALUES: 3800552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38011a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38021a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38031a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3804552f7358SJed Brown } break; 3805552f7358SJed Brown case ADD_ALL_VALUES: 3806552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38071a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38081a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38091a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3810552f7358SJed Brown } break; 3811552f7358SJed Brown default: 381282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3813552f7358SJed Brown } 38141a271a75SMatthew G. Knepley } 3815552f7358SJed Brown } else { 38161a271a75SMatthew G. Knepley PetscInt dof, off; 38171a271a75SMatthew G. Knepley 3818552f7358SJed Brown switch (mode) { 3819552f7358SJed Brown case INSERT_VALUES: 3820552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3821552f7358SJed Brown PetscInt o = points[p+1]; 3822552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3823552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 3824552f7358SJed Brown } break; 3825552f7358SJed Brown case INSERT_ALL_VALUES: 3826552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3827552f7358SJed Brown PetscInt o = points[p+1]; 3828552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3829552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 3830552f7358SJed Brown } break; 3831a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3832a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3833a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 3834a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3835a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 3836a5e93ea8SMatthew G. Knepley } break; 3837552f7358SJed Brown case ADD_VALUES: 3838552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3839552f7358SJed Brown PetscInt o = points[p+1]; 3840552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3841552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 3842552f7358SJed Brown } break; 3843552f7358SJed Brown case ADD_ALL_VALUES: 3844552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3845552f7358SJed Brown PetscInt o = points[p+1]; 3846552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3847552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 3848552f7358SJed Brown } break; 3849552f7358SJed Brown default: 385082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3851552f7358SJed Brown } 3852552f7358SJed Brown } 38531a271a75SMatthew G. Knepley /* Cleanup points */ 38541a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 38551a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 38561a271a75SMatthew G. Knepley /* Cleanup array */ 3857552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3858552f7358SJed Brown PetscFunctionReturn(0); 3859552f7358SJed Brown } 3860552f7358SJed Brown 3861552f7358SJed Brown #undef __FUNCT__ 3862e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 3863e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 3864e07394fbSMatthew G. Knepley { 3865e07394fbSMatthew G. Knepley PetscSection clSection; 3866e07394fbSMatthew G. Knepley IS clPoints; 3867e07394fbSMatthew G. Knepley PetscScalar *array; 3868e07394fbSMatthew G. Knepley PetscInt *points = NULL; 3869e07394fbSMatthew G. Knepley const PetscInt *clp; 3870e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 3871e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3872e07394fbSMatthew G. Knepley PetscErrorCode ierr; 3873e07394fbSMatthew G. Knepley 3874e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 3875e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3876e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 3877e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 3878e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3879e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3880e07394fbSMatthew G. Knepley /* Get points */ 3881e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3882e07394fbSMatthew G. Knepley if (!clPoints) { 3883e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 3884e07394fbSMatthew G. Knepley 3885e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3886e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3887e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 3888e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 3889e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 3890e07394fbSMatthew G. Knepley points[q*2] = points[p]; 3891e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 3892e07394fbSMatthew G. Knepley ++q; 3893e07394fbSMatthew G. Knepley } 3894e07394fbSMatthew G. Knepley } 3895e07394fbSMatthew G. Knepley numPoints = q; 3896e07394fbSMatthew G. Knepley } else { 3897e07394fbSMatthew G. Knepley PetscInt dof, off; 3898e07394fbSMatthew G. Knepley 3899e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3900e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3901e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 3902e07394fbSMatthew G. Knepley numPoints = dof/2; 3903e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3904e07394fbSMatthew G. Knepley } 3905e07394fbSMatthew G. Knepley /* Get array */ 3906e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3907e07394fbSMatthew G. Knepley /* Get values */ 3908e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 3909e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3910e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 3911e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3912e07394fbSMatthew G. Knepley PetscInt fdof; 3913e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 3914e07394fbSMatthew G. Knepley offset += fdof; 3915e07394fbSMatthew G. Knepley } 3916e07394fbSMatthew G. Knepley continue; 3917e07394fbSMatthew G. Knepley } 3918e07394fbSMatthew G. Knepley switch (mode) { 3919e07394fbSMatthew G. Knepley case INSERT_VALUES: 3920e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3921e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3922e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3923e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3924e07394fbSMatthew G. Knepley } break; 3925e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 3926e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3927e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3928e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3929e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3930e07394fbSMatthew G. Knepley } break; 3931e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 3932e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3933e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3934e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3935e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3936e07394fbSMatthew G. Knepley } break; 3937e07394fbSMatthew G. Knepley case ADD_VALUES: 3938e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3939e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3940e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3941e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3942e07394fbSMatthew G. Knepley } break; 3943e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 3944e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3945e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3946e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3947e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3948e07394fbSMatthew G. Knepley } break; 3949e07394fbSMatthew G. Knepley default: 3950e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3951e07394fbSMatthew G. Knepley } 3952e07394fbSMatthew G. Knepley } 3953e07394fbSMatthew G. Knepley /* Cleanup points */ 3954e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 3955e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 3956e07394fbSMatthew G. Knepley /* Cleanup array */ 3957e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3958e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 3959e07394fbSMatthew G. Knepley } 3960e07394fbSMatthew G. Knepley 3961e07394fbSMatthew G. Knepley #undef __FUNCT__ 3962552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 3963b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 3964552f7358SJed Brown { 3965552f7358SJed Brown PetscMPIInt rank; 3966552f7358SJed Brown PetscInt i, j; 3967552f7358SJed Brown PetscErrorCode ierr; 3968552f7358SJed Brown 3969552f7358SJed Brown PetscFunctionBegin; 397082f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 397177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 3972e4b003c7SBarry Smith for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%d]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 3973e4b003c7SBarry Smith for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%d]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 3974b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 3975b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 3976e4b003c7SBarry Smith ierr = PetscViewerASCIIPrintf(viewer, "[%d]", rank);CHKERRQ(ierr); 3977b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 3978519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 39797eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 3980552f7358SJed Brown #else 3981b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 3982552f7358SJed Brown #endif 3983552f7358SJed Brown } 398477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 3985552f7358SJed Brown } 3986552f7358SJed Brown PetscFunctionReturn(0); 3987552f7358SJed Brown } 3988552f7358SJed Brown 3989552f7358SJed Brown #undef __FUNCT__ 3990552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 3991552f7358SJed Brown /* . off - The global offset of this point */ 3992e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 3993a6dfd86eSKarl Rupp { 3994e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 3995552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3996552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3997552f7358SJed Brown PetscInt cind = 0, k; 3998552f7358SJed Brown PetscErrorCode ierr; 3999552f7358SJed Brown 4000552f7358SJed Brown PetscFunctionBegin; 4001552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 4002552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4003552f7358SJed Brown if (!cdof || setBC) { 4004552f7358SJed Brown if (orientation >= 0) { 4005e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 4006552f7358SJed Brown } else { 4007e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 4008552f7358SJed Brown } 4009552f7358SJed Brown } else { 4010552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4011552f7358SJed Brown if (orientation >= 0) { 4012552f7358SJed Brown for (k = 0; k < dof; ++k) { 4013552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4014552f7358SJed Brown /* Insert check for returning constrained indices */ 4015e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 4016552f7358SJed Brown ++cind; 4017552f7358SJed Brown } else { 4018e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 4019552f7358SJed Brown } 4020552f7358SJed Brown } 4021552f7358SJed Brown } else { 4022552f7358SJed Brown for (k = 0; k < dof; ++k) { 4023552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4024552f7358SJed Brown /* Insert check for returning constrained indices */ 4025e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 4026552f7358SJed Brown ++cind; 4027552f7358SJed Brown } else { 4028e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 4029552f7358SJed Brown } 4030552f7358SJed Brown } 4031552f7358SJed Brown } 4032552f7358SJed Brown } 4033e6ccafaeSMatthew G Knepley *loff += dof; 4034552f7358SJed Brown PetscFunctionReturn(0); 4035552f7358SJed Brown } 4036552f7358SJed Brown 4037552f7358SJed Brown #undef __FUNCT__ 4038552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 4039552f7358SJed Brown /* . off - The global offset of this point */ 4040a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4041a6dfd86eSKarl Rupp { 4042552f7358SJed Brown PetscInt numFields, foff, f; 4043552f7358SJed Brown PetscErrorCode ierr; 4044552f7358SJed Brown 4045552f7358SJed Brown PetscFunctionBegin; 4046552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4047552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 4048552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 4049552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 4050552f7358SJed Brown PetscInt cind = 0, k, c; 4051552f7358SJed Brown 4052552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4053552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4054552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 4055552f7358SJed Brown if (!cfdof || setBC) { 4056552f7358SJed Brown if (orientation >= 0) { 40570d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 4058552f7358SJed Brown } else { 4059552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4060552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4061552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 4062552f7358SJed Brown } 4063552f7358SJed Brown } 4064552f7358SJed Brown } 4065552f7358SJed Brown } else { 4066552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 4067552f7358SJed Brown if (orientation >= 0) { 4068552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4069552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 4070552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 4071552f7358SJed Brown ++cind; 4072552f7358SJed Brown } else { 4073552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 4074552f7358SJed Brown } 4075552f7358SJed Brown } 4076552f7358SJed Brown } else { 4077552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4078552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4079552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 4080552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 4081552f7358SJed Brown ++cind; 4082552f7358SJed Brown } else { 4083552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 4084552f7358SJed Brown } 4085552f7358SJed Brown } 4086552f7358SJed Brown } 4087552f7358SJed Brown } 4088552f7358SJed Brown } 4089552f7358SJed Brown foff += fdof - cfdof; 4090552f7358SJed Brown foffs[f] += fdof; 4091552f7358SJed Brown } 4092552f7358SJed Brown PetscFunctionReturn(0); 4093552f7358SJed Brown } 4094552f7358SJed Brown 4095552f7358SJed Brown #undef __FUNCT__ 4096f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat" 4097f7c74593SToby 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[]) 4098d3d1a6afSToby Isaac { 4099d3d1a6afSToby Isaac Mat cMat; 4100d3d1a6afSToby Isaac PetscSection aSec, cSec; 4101d3d1a6afSToby Isaac IS aIS; 4102d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 4103d3d1a6afSToby Isaac const PetscInt *anchors; 4104e17c06e0SMatthew G. Knepley PetscInt numFields, f, p, q, newP = 0; 4105d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 4106d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 4107d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 4108d3d1a6afSToby Isaac PetscInt newOffsets[32]; 4109d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 4110d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 4111d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 4112d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 4113d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 4114d3d1a6afSToby Isaac PetscErrorCode ierr; 4115d3d1a6afSToby Isaac 4116d3d1a6afSToby Isaac PetscFunctionBegin; 4117d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4118d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4119d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4120d3d1a6afSToby Isaac 4121a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 4122d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 4123d3d1a6afSToby Isaac if (aSec) { 4124d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4125d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 4126d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 4127d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 4128d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 4129d3d1a6afSToby Isaac * into the global matrix anyway) */ 4130d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 4131d3d1a6afSToby Isaac PetscInt b = points[p]; 4132d3d1a6afSToby Isaac PetscInt bDof = 0; 4133d3d1a6afSToby Isaac 4134d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4135d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 4136d3d1a6afSToby Isaac } 4137d3d1a6afSToby Isaac if (bDof) { 4138d3d1a6afSToby Isaac /* this point is constrained */ 4139d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 4140d3d1a6afSToby Isaac PetscInt bOff, q; 4141d3d1a6afSToby Isaac 4142d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 4143d3d1a6afSToby Isaac newNumPoints += bDof; 4144d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 4145d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4146d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4147d3d1a6afSToby Isaac PetscInt aDof; 4148d3d1a6afSToby Isaac 4149d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 4150d3d1a6afSToby Isaac newNumIndices += aDof; 4151d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4152d3d1a6afSToby Isaac PetscInt fDof; 4153d3d1a6afSToby Isaac 4154d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 4155d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4156d3d1a6afSToby Isaac } 4157d3d1a6afSToby Isaac } 4158d3d1a6afSToby Isaac } 4159d3d1a6afSToby Isaac else { 4160d3d1a6afSToby Isaac /* this point is not constrained */ 4161d3d1a6afSToby Isaac newNumPoints++; 4162d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 4163d3d1a6afSToby Isaac newNumIndices += bDof; 4164d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4165d3d1a6afSToby Isaac PetscInt fDof; 4166d3d1a6afSToby Isaac 4167d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4168d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4169d3d1a6afSToby Isaac } 4170d3d1a6afSToby Isaac } 4171d3d1a6afSToby Isaac } 4172d3d1a6afSToby Isaac } 4173d3d1a6afSToby Isaac if (!anyConstrained) { 4174d3d1a6afSToby Isaac *outNumPoints = 0; 4175d3d1a6afSToby Isaac *outNumIndices = 0; 4176d3d1a6afSToby Isaac *outPoints = NULL; 4177d3d1a6afSToby Isaac *outValues = NULL; 4178d3d1a6afSToby Isaac if (aSec) { 4179d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4180d3d1a6afSToby Isaac } 4181d3d1a6afSToby Isaac PetscFunctionReturn(0); 4182d3d1a6afSToby Isaac } 4183d3d1a6afSToby Isaac 4184d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 4185d3d1a6afSToby Isaac 4186d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 4187d3d1a6afSToby Isaac 4188f7c74593SToby Isaac ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr); 4189d3d1a6afSToby Isaac 4190d3d1a6afSToby Isaac /* output arrays */ 4191d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4192d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4193d3d1a6afSToby Isaac 4194d3d1a6afSToby Isaac /* workspaces */ 4195d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4196d3d1a6afSToby Isaac if (numFields) { 4197d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4198d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4199d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4200d3d1a6afSToby Isaac } 4201d3d1a6afSToby Isaac } 4202d3d1a6afSToby Isaac else { 4203d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4204d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4205d3d1a6afSToby Isaac } 4206d3d1a6afSToby Isaac 4207d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 4208d3d1a6afSToby Isaac if (numFields) { 4209d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4210d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4211d3d1a6afSToby Isaac PetscInt bDof = 0; 4212d3d1a6afSToby Isaac 4213d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4214d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4215d3d1a6afSToby Isaac } 4216d3d1a6afSToby Isaac if (bDof) { 4217d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4218d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 4219d3d1a6afSToby Isaac 4220d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4221d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4222d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4223d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4224d3d1a6afSToby Isaac PetscInt aFDof; 4225d3d1a6afSToby Isaac 4226d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 4227d3d1a6afSToby Isaac allFDof += aFDof; 4228d3d1a6afSToby Isaac } 4229d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 4230d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 4231d3d1a6afSToby Isaac } 4232d3d1a6afSToby Isaac } 4233d3d1a6afSToby Isaac else { 4234d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4235d3d1a6afSToby Isaac PetscInt fDof; 4236d3d1a6afSToby Isaac 4237d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4238d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 4239d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 4240d3d1a6afSToby Isaac } 4241d3d1a6afSToby Isaac } 4242d3d1a6afSToby Isaac } 4243d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4244d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 4245d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 4246d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4247d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 4248d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 4249d3d1a6afSToby Isaac } 4250d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4251d3d1a6afSToby Isaac } 4252d3d1a6afSToby Isaac } 4253d3d1a6afSToby Isaac else { 4254d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4255d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4256d3d1a6afSToby Isaac PetscInt bDof = 0; 4257d3d1a6afSToby Isaac 4258d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4259d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4260d3d1a6afSToby Isaac } 4261d3d1a6afSToby Isaac if (bDof) { 4262d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 4263d3d1a6afSToby Isaac 4264d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4265d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4266d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4267d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 4268d3d1a6afSToby Isaac 4269d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 4270d3d1a6afSToby Isaac allDof += aDof; 4271d3d1a6afSToby Isaac } 4272d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 4273d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 4274d3d1a6afSToby Isaac } 4275d3d1a6afSToby Isaac else { 4276d3d1a6afSToby Isaac PetscInt dof; 4277d3d1a6afSToby Isaac 4278d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4279d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 4280d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 4281d3d1a6afSToby Isaac } 4282d3d1a6afSToby Isaac } 4283d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 4284d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 4285d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4286d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 4287d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 4288d3d1a6afSToby Isaac } 4289d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4290d3d1a6afSToby Isaac } 4291d3d1a6afSToby Isaac 4292d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 4293d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 4294d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4295d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4296d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4297d3d1a6afSToby Isaac if (numFields) { 4298d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 4299d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4300d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4301d3d1a6afSToby Isaac PetscInt bDof = 0; 4302d3d1a6afSToby Isaac 4303d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4304d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4305d3d1a6afSToby Isaac } 4306d3d1a6afSToby Isaac if (bDof) { 4307d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 4308d3d1a6afSToby Isaac 4309d3d1a6afSToby Isaac fStart[0] = 0; 4310d3d1a6afSToby Isaac fEnd[0] = 0; 4311d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4312d3d1a6afSToby Isaac PetscInt fDof; 4313d3d1a6afSToby Isaac 4314d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 4315d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 4316d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 4317d3d1a6afSToby Isaac } 4318d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4319d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4320d3d1a6afSToby Isaac 4321d3d1a6afSToby Isaac fAnchorStart[0] = 0; 4322d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 4323d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4324d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 4325d3d1a6afSToby Isaac 4326d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 4327d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 4328d3d1a6afSToby Isaac } 4329d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4330d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4331d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4332d3d1a6afSToby Isaac 4333d3d1a6afSToby 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 */ 4334d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4335d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4336302440fdSBarry Smith ierr = PetscSectionGetOffset(section, a, &aOff);CHKERRQ(ierr); 4337d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4338d3d1a6afSToby Isaac } 4339d3d1a6afSToby Isaac newP += bDof; 4340d3d1a6afSToby Isaac 4341d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4342d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4343d3d1a6afSToby 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); 4344d3d1a6afSToby Isaac } 4345d3d1a6afSToby Isaac } 4346d3d1a6afSToby Isaac else { 4347d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4348d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4349d3d1a6afSToby Isaac newP++; 4350d3d1a6afSToby Isaac } 4351d3d1a6afSToby Isaac } 4352d3d1a6afSToby Isaac } else { 4353d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4354d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4355d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4356d3d1a6afSToby Isaac PetscInt bDof = 0; 4357d3d1a6afSToby Isaac 4358d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4359d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4360d3d1a6afSToby Isaac } 4361d3d1a6afSToby Isaac if (bDof) { 4362d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 4363d3d1a6afSToby Isaac 4364d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4365d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4366d3d1a6afSToby Isaac 4367d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4368d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4369d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4370d3d1a6afSToby Isaac 4371d3d1a6afSToby 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 */ 4372d3d1a6afSToby Isaac 4373d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4374d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4375302440fdSBarry Smith ierr = PetscSectionGetOffset(section, a, &aOff);CHKERRQ(ierr); 4376d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4377d3d1a6afSToby Isaac } 4378d3d1a6afSToby Isaac newP += bDof; 4379d3d1a6afSToby Isaac 4380d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4381d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 4382d3d1a6afSToby Isaac } 4383d3d1a6afSToby Isaac else { 4384d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4385d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4386d3d1a6afSToby Isaac newP++; 4387d3d1a6afSToby Isaac } 4388d3d1a6afSToby Isaac } 4389d3d1a6afSToby Isaac } 4390d3d1a6afSToby Isaac 4391d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 4392d3d1a6afSToby Isaac /* multiply constraints on the right */ 4393d3d1a6afSToby Isaac if (numFields) { 4394d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4395d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4396d3d1a6afSToby Isaac 4397d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4398d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 4399d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4400d3d1a6afSToby Isaac PetscInt c, r, k; 4401d3d1a6afSToby Isaac PetscInt dof; 4402d3d1a6afSToby Isaac 4403d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4404d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4405d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 4406d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 4407d3d1a6afSToby Isaac 4408d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4409d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4410d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4411d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4412d3d1a6afSToby Isaac } 4413d3d1a6afSToby Isaac } 4414d3d1a6afSToby Isaac } 4415d3d1a6afSToby Isaac } 4416d3d1a6afSToby Isaac else { 4417d3d1a6afSToby Isaac /* copy this column as is */ 4418d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4419d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4420d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4421d3d1a6afSToby Isaac } 4422d3d1a6afSToby Isaac } 4423d3d1a6afSToby Isaac } 4424d3d1a6afSToby Isaac oldOff += dof; 4425d3d1a6afSToby Isaac } 4426d3d1a6afSToby Isaac } 4427d3d1a6afSToby Isaac } 4428d3d1a6afSToby Isaac else { 4429d3d1a6afSToby Isaac PetscInt oldOff = 0; 4430d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4431d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 4432d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4433d3d1a6afSToby Isaac PetscInt c, r, k; 4434d3d1a6afSToby Isaac PetscInt dof; 4435d3d1a6afSToby Isaac 4436d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4437d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4438d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 4439d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 4440d3d1a6afSToby Isaac 4441d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4442d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4443d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4444d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4445d3d1a6afSToby Isaac } 4446d3d1a6afSToby Isaac } 4447d3d1a6afSToby Isaac } 4448d3d1a6afSToby Isaac } 4449d3d1a6afSToby Isaac else { 4450d3d1a6afSToby Isaac /* copy this column as is */ 4451d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4452d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4453d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4454d3d1a6afSToby Isaac } 4455d3d1a6afSToby Isaac } 4456d3d1a6afSToby Isaac } 4457d3d1a6afSToby Isaac oldOff += dof; 4458d3d1a6afSToby Isaac } 4459d3d1a6afSToby Isaac } 4460d3d1a6afSToby Isaac 4461d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 4462d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 4463d3d1a6afSToby Isaac if (numFields) { 4464d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4465d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4466d3d1a6afSToby Isaac 4467d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4468d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 4469d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4470d3d1a6afSToby Isaac PetscInt c, r, k; 4471d3d1a6afSToby Isaac PetscInt dof; 4472d3d1a6afSToby Isaac 4473d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4474d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4475d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 4476d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 4477d3d1a6afSToby Isaac 4478d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4479d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4480d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4481d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4482d3d1a6afSToby Isaac } 4483d3d1a6afSToby Isaac } 4484d3d1a6afSToby Isaac } 4485d3d1a6afSToby Isaac } 4486d3d1a6afSToby Isaac else { 4487d3d1a6afSToby Isaac /* copy this row as is */ 4488d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 4489d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4490d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4491d3d1a6afSToby Isaac } 4492d3d1a6afSToby Isaac } 4493d3d1a6afSToby Isaac } 4494d3d1a6afSToby Isaac oldOff += dof; 4495d3d1a6afSToby Isaac } 4496d3d1a6afSToby Isaac } 4497d3d1a6afSToby Isaac } 4498d3d1a6afSToby Isaac else { 4499d3d1a6afSToby Isaac PetscInt oldOff = 0; 4500d3d1a6afSToby Isaac 4501d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4502d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 4503d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4504d3d1a6afSToby Isaac PetscInt c, r, k; 4505d3d1a6afSToby Isaac PetscInt dof; 4506d3d1a6afSToby Isaac 4507d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4508d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4509d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 4510d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 4511d3d1a6afSToby Isaac 4512d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4513d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4514d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4515d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4516d3d1a6afSToby Isaac } 4517d3d1a6afSToby Isaac } 4518d3d1a6afSToby Isaac } 4519d3d1a6afSToby Isaac } 4520d3d1a6afSToby Isaac else { 4521d3d1a6afSToby Isaac /* copy this row as is */ 4522d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 4523d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4524d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4525d3d1a6afSToby Isaac } 4526d3d1a6afSToby Isaac } 4527d3d1a6afSToby Isaac } 4528d3d1a6afSToby Isaac oldOff += dof; 4529d3d1a6afSToby Isaac } 4530d3d1a6afSToby Isaac } 4531d3d1a6afSToby Isaac 4532d3d1a6afSToby Isaac /* clean up */ 4533d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4534d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4535d3d1a6afSToby Isaac if (numFields) { 4536d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4537d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4538d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4539d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4540d3d1a6afSToby Isaac } 4541d3d1a6afSToby Isaac } 4542d3d1a6afSToby Isaac else { 4543d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4544d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4545d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4546d3d1a6afSToby Isaac } 4547d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4548d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4549d3d1a6afSToby Isaac 4550d3d1a6afSToby Isaac /* output */ 4551d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 4552d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 4553d3d1a6afSToby Isaac *outPoints = newPoints; 4554d3d1a6afSToby Isaac *outValues = newValues; 4555d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4556d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 4557d3d1a6afSToby Isaac } 4558d3d1a6afSToby Isaac PetscFunctionReturn(0); 4559d3d1a6afSToby Isaac } 4560d3d1a6afSToby Isaac 4561d3d1a6afSToby Isaac #undef __FUNCT__ 4562552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 45637f5d1fdeSMatthew G. Knepley /*@C 45647f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 45657f5d1fdeSMatthew G. Knepley 45667f5d1fdeSMatthew G. Knepley Not collective 45677f5d1fdeSMatthew G. Knepley 45687f5d1fdeSMatthew G. Knepley Input Parameters: 45697f5d1fdeSMatthew G. Knepley + dm - The DM 4570ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4571ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 45727f5d1fdeSMatthew G. Knepley . A - The matrix 45737f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 45747f5d1fdeSMatthew G. Knepley . values - The array of values 45757f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 45767f5d1fdeSMatthew G. Knepley 45777f5d1fdeSMatthew G. Knepley Fortran Notes: 45787f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 45797f5d1fdeSMatthew G. Knepley 45807f5d1fdeSMatthew G. Knepley Level: intermediate 45817f5d1fdeSMatthew G. Knepley 45827f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 45837f5d1fdeSMatthew G. Knepley @*/ 45847c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 4585552f7358SJed Brown { 4586552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 45871b406b76SMatthew G. Knepley PetscSection clSection; 45881b406b76SMatthew G. Knepley IS clPoints; 4589d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 45901b406b76SMatthew G. Knepley const PetscInt *clp; 4591552f7358SJed Brown PetscInt *indices; 4592552f7358SJed Brown PetscInt offsets[32]; 4593d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 4594d3d1a6afSToby Isaac PetscScalar *newValues; 4595552f7358SJed Brown PetscErrorCode ierr; 4596552f7358SJed Brown 4597552f7358SJed Brown PetscFunctionBegin; 4598552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4599ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 46003dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4601ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 46023dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 46033dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 4604552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 460582f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4606552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 46071b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 46081b406b76SMatthew G. Knepley if (!clPoints) { 4609552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4610552f7358SJed Brown /* Compress out points not in the section */ 4611552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4612552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4613552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4614552f7358SJed Brown points[q*2] = points[p]; 4615552f7358SJed Brown points[q*2+1] = points[p+1]; 4616552f7358SJed Brown ++q; 4617552f7358SJed Brown } 4618552f7358SJed Brown } 4619552f7358SJed Brown numPoints = q; 46201b406b76SMatthew G. Knepley } else { 46211b406b76SMatthew G. Knepley PetscInt dof, off; 46221b406b76SMatthew G. Knepley 46231b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 46241b406b76SMatthew G. Knepley numPoints = dof/2; 46251b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 46261b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46271b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 46281b406b76SMatthew G. Knepley } 4629552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 4630552f7358SJed Brown PetscInt fdof; 4631552f7358SJed Brown 4632552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4633552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4634552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 4635552f7358SJed Brown offsets[f+1] += fdof; 4636552f7358SJed Brown } 4637552f7358SJed Brown numIndices += dof; 4638552f7358SJed Brown } 46390d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 46400d644c17SKarl Rupp 464182f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 4642f7c74593SToby Isaac ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 4643d3d1a6afSToby Isaac if (newNumPoints) { 4644d3d1a6afSToby Isaac if (!clPoints) { 4645d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4646d3d1a6afSToby Isaac } else { 4647d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 4648d3d1a6afSToby Isaac } 4649d3d1a6afSToby Isaac numPoints = newNumPoints; 4650d3d1a6afSToby Isaac numIndices = newNumIndices; 4651d3d1a6afSToby Isaac points = newPoints; 4652d3d1a6afSToby Isaac values = newValues; 4653d3d1a6afSToby Isaac } 4654552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4655552f7358SJed Brown if (numFields) { 4656552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4657552f7358SJed Brown PetscInt o = points[p+1]; 4658552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4659552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 4660552f7358SJed Brown } 4661552f7358SJed Brown } else { 4662e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 4663552f7358SJed Brown PetscInt o = points[p+1]; 4664552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4665e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 4666552f7358SJed Brown } 4667552f7358SJed Brown } 4668b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 4669552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 4670ab1d0545SMatthew G. Knepley if (mesh->printFEM > 1) { 4671ab1d0545SMatthew G. Knepley PetscInt i; 4672ab1d0545SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, " Indices:");CHKERRQ(ierr); 4673ab1d0545SMatthew G. Knepley for (i = 0; i < numIndices; ++i) {ierr = PetscPrintf(PETSC_COMM_SELF, " %d", indices[i]);CHKERRQ(ierr);} 4674ab1d0545SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 4675ab1d0545SMatthew G. Knepley } 4676552f7358SJed Brown if (ierr) { 4677552f7358SJed Brown PetscMPIInt rank; 4678552f7358SJed Brown PetscErrorCode ierr2; 4679552f7358SJed Brown 468082f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4681e4b003c7SBarry Smith ierr2 = (*PetscErrorPrintf)("[%d]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4682b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 46836a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 4684552f7358SJed Brown CHKERRQ(ierr); 4685552f7358SJed Brown } 4686d3d1a6afSToby Isaac if (newNumPoints) { 4687d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4688d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4689d3d1a6afSToby Isaac } 4690d3d1a6afSToby Isaac else { 46911b406b76SMatthew G. Knepley if (!clPoints) { 4692552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 46931b406b76SMatthew G. Knepley } else { 46941b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 46951b406b76SMatthew G. Knepley } 4696d3d1a6afSToby Isaac } 4697552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4698552f7358SJed Brown PetscFunctionReturn(0); 4699552f7358SJed Brown } 4700552f7358SJed Brown 4701552f7358SJed Brown #undef __FUNCT__ 4702de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 4703de41b84cSMatthew 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) 4704de41b84cSMatthew G. Knepley { 4705de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 4706de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 4707de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 4708de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 4709de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 4710de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 47114ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 4712de41b84cSMatthew G. Knepley PetscErrorCode ierr; 4713de41b84cSMatthew G. Knepley 4714de41b84cSMatthew G. Knepley PetscFunctionBegin; 4715de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 4716de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 4717de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 4718de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 4719de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 4720de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 4721de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 4722de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 4723de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 4724de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 4725de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 4726de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 4727de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4728de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4729de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4730de41b84cSMatthew G. Knepley /* Column indices */ 4731de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 47324ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 4733de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4734de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 4735de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 4736de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 4737de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 4738de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 4739de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 4740de41b84cSMatthew G. Knepley ++q; 4741de41b84cSMatthew G. Knepley } 4742de41b84cSMatthew G. Knepley } 4743de41b84cSMatthew G. Knepley numCPoints = q; 4744de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 4745de41b84cSMatthew G. Knepley PetscInt fdof; 4746de41b84cSMatthew G. Knepley 4747de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 47484ca5e9f5SMatthew G. Knepley if (!dof) continue; 4749de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4750de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 4751de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 4752de41b84cSMatthew G. Knepley } 4753de41b84cSMatthew G. Knepley numCIndices += dof; 4754de41b84cSMatthew G. Knepley } 4755de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 4756de41b84cSMatthew G. Knepley /* Row indices */ 4757de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 4758de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 47591ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4760de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 4761de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 4762de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4763de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4764de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 4765de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4766de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 47674ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 47684ca5e9f5SMatthew G. Knepley if (!dof) continue; 47694ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 47704ca5e9f5SMatthew G. Knepley if (s < q) continue; 4771de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 4772de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 4773de41b84cSMatthew G. Knepley ++q; 4774de41b84cSMatthew G. Knepley } 4775de41b84cSMatthew G. Knepley } 4776de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4777de41b84cSMatthew G. Knepley } 4778de41b84cSMatthew G. Knepley numFPoints = q; 4779de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 4780de41b84cSMatthew G. Knepley PetscInt fdof; 4781de41b84cSMatthew G. Knepley 4782de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 47834ca5e9f5SMatthew G. Knepley if (!dof) continue; 4784de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4785de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 4786de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 4787de41b84cSMatthew G. Knepley } 4788de41b84cSMatthew G. Knepley numFIndices += dof; 4789de41b84cSMatthew G. Knepley } 4790de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 4791de41b84cSMatthew G. Knepley 4792de41b84cSMatthew 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); 4793de41b84cSMatthew 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); 4794de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4795de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4796de41b84cSMatthew G. Knepley if (numFields) { 4797de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4798de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4799de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4800de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 4801de41b84cSMatthew G. Knepley } 4802de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 4803de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4804de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4805de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 4806de41b84cSMatthew G. Knepley } 4807de41b84cSMatthew G. Knepley } else { 4808de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 4809de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4810de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4811de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 4812de41b84cSMatthew G. Knepley } 4813de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 4814de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4815de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4816de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 4817de41b84cSMatthew G. Knepley } 4818de41b84cSMatthew G. Knepley } 4819de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 4820de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 4821de41b84cSMatthew G. Knepley if (ierr) { 4822de41b84cSMatthew G. Knepley PetscMPIInt rank; 4823de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 4824de41b84cSMatthew G. Knepley 4825de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4826e4b003c7SBarry Smith ierr2 = (*PetscErrorPrintf)("[%d]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4827de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 4828de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 4829de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 4830de41b84cSMatthew G. Knepley CHKERRQ(ierr); 4831de41b84cSMatthew G. Knepley } 4832549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4833de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 4834de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4835de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4836de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 4837de41b84cSMatthew G. Knepley } 4838de41b84cSMatthew G. Knepley 4839de41b84cSMatthew G. Knepley #undef __FUNCT__ 48407c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 48417c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 48427c927364SMatthew G. Knepley { 48437c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 48447c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 48457c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 48467c927364SMatthew G. Knepley CellRefiner cellRefiner; 48477c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 48487c927364SMatthew G. Knepley PetscErrorCode ierr; 48497c927364SMatthew G. Knepley 48507c927364SMatthew G. Knepley PetscFunctionBegin; 48517c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 48527c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 48537c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 48547c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 48557c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 48567c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 48577c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 48587c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 48597c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 48607c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 48617c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 48627c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 48637c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 48647c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 48657c927364SMatthew G. Knepley /* Column indices */ 48667c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 48677c927364SMatthew G. Knepley maxFPoints = numCPoints; 48687c927364SMatthew G. Knepley /* Compress out points not in the section */ 48697c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 48707c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 48717c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 48727c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 48737c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 48747c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 48757c927364SMatthew G. Knepley ++q; 48767c927364SMatthew G. Knepley } 48777c927364SMatthew G. Knepley } 48787c927364SMatthew G. Knepley numCPoints = q; 48797c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 48807c927364SMatthew G. Knepley PetscInt fdof; 48817c927364SMatthew G. Knepley 48827c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 48837c927364SMatthew G. Knepley if (!dof) continue; 48847c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 48857c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 48867c927364SMatthew G. Knepley coffsets[f+1] += fdof; 48877c927364SMatthew G. Knepley } 48887c927364SMatthew G. Knepley numCIndices += dof; 48897c927364SMatthew G. Knepley } 48907c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 48917c927364SMatthew G. Knepley /* Row indices */ 48927c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 48937c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 48947c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 48957c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 48967c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 48977c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 48987c927364SMatthew G. Knepley /* Compress out points not in the section */ 48997c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 49007c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 49017c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 49027c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 49037c927364SMatthew G. Knepley if (!dof) continue; 49047c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 49057c927364SMatthew G. Knepley if (s < q) continue; 49067c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 49077c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 49087c927364SMatthew G. Knepley ++q; 49097c927364SMatthew G. Knepley } 49107c927364SMatthew G. Knepley } 49117c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 49127c927364SMatthew G. Knepley } 49137c927364SMatthew G. Knepley numFPoints = q; 49147c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 49157c927364SMatthew G. Knepley PetscInt fdof; 49167c927364SMatthew G. Knepley 49177c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 49187c927364SMatthew G. Knepley if (!dof) continue; 49197c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 49207c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 49217c927364SMatthew G. Knepley foffsets[f+1] += fdof; 49227c927364SMatthew G. Knepley } 49237c927364SMatthew G. Knepley numFIndices += dof; 49247c927364SMatthew G. Knepley } 49257c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 49267c927364SMatthew G. Knepley 49277c927364SMatthew 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); 49287c927364SMatthew 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); 49297c927364SMatthew G. Knepley if (numFields) { 49307c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 49317c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 49327c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 49337c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 49347c927364SMatthew G. Knepley } 49357c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 49367c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 49377c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 49387c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 49397c927364SMatthew G. Knepley } 49407c927364SMatthew G. Knepley } else { 49417c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 49427c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 49437c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 49447c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 49457c927364SMatthew G. Knepley } 49467c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 49477c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 49487c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 49497c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 49507c927364SMatthew G. Knepley } 49517c927364SMatthew G. Knepley } 49527c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 49537c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 49547c927364SMatthew G. Knepley PetscFunctionReturn(0); 49557c927364SMatthew G. Knepley } 49567c927364SMatthew G. Knepley 49577c927364SMatthew G. Knepley #undef __FUNCT__ 4958770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 4959f96281f8SMatthew G. Knepley /*@ 4960f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 4961f96281f8SMatthew G. Knepley 4962f96281f8SMatthew G. Knepley Input Parameter: 4963f96281f8SMatthew G. Knepley . dm - The DMPlex object 4964f96281f8SMatthew G. Knepley 4965f96281f8SMatthew G. Knepley Output Parameters: 4966f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 4967dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4968dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4969dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4970f96281f8SMatthew G. Knepley 4971f96281f8SMatthew G. Knepley Level: developer 4972f96281f8SMatthew G. Knepley 4973dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 4974f96281f8SMatthew G. Knepley @*/ 4975770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 4976552f7358SJed Brown { 4977552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4978770b213bSMatthew G Knepley PetscInt dim; 4979770b213bSMatthew G Knepley PetscErrorCode ierr; 4980552f7358SJed Brown 4981552f7358SJed Brown PetscFunctionBegin; 4982552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4983c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4984770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 4985770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 4986770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 4987770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 4988552f7358SJed Brown PetscFunctionReturn(0); 4989552f7358SJed Brown } 4990552f7358SJed Brown 4991552f7358SJed Brown #undef __FUNCT__ 4992770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 4993dc5a3409SMatthew G. Knepley /*@ 4994dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 4995dc5a3409SMatthew G. Knepley 4996dc5a3409SMatthew G. Knepley Input Parameters: 4997dc5a3409SMatthew G. Knepley . dm - The DMPlex object 4998dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 4999dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5000dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5001dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5002dc5a3409SMatthew G. Knepley 5003dc5a3409SMatthew G. Knepley Level: developer 5004dc5a3409SMatthew G. Knepley 5005dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5006dc5a3409SMatthew G. Knepley @*/ 5007770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5008552f7358SJed Brown { 5009552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5010770b213bSMatthew G Knepley PetscInt dim; 5011770b213bSMatthew G Knepley PetscErrorCode ierr; 5012552f7358SJed Brown 5013552f7358SJed Brown PetscFunctionBegin; 5014552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5015c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5016770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5017770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5018770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5019770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5020552f7358SJed Brown PetscFunctionReturn(0); 5021552f7358SJed Brown } 5022552f7358SJed Brown 5023552f7358SJed Brown #undef __FUNCT__ 5024552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5025552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5026552f7358SJed Brown { 5027552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5028552f7358SJed Brown 5029552f7358SJed Brown PetscFunctionBegin; 5030552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5031552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5032552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5033552f7358SJed Brown PetscFunctionReturn(0); 5034552f7358SJed Brown } 5035552f7358SJed Brown 5036552f7358SJed Brown #undef __FUNCT__ 5037552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5038552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5039552f7358SJed Brown { 5040552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5041552f7358SJed Brown 5042552f7358SJed Brown PetscFunctionBegin; 5043552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5044552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5045552f7358SJed Brown PetscFunctionReturn(0); 5046552f7358SJed Brown } 5047552f7358SJed Brown 5048552f7358SJed Brown #undef __FUNCT__ 5049552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5050552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5051ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5052552f7358SJed Brown { 5053552f7358SJed Brown PetscSection section, globalSection; 5054552f7358SJed Brown PetscInt *numbers, p; 5055552f7358SJed Brown PetscErrorCode ierr; 5056552f7358SJed Brown 5057552f7358SJed Brown PetscFunctionBegin; 505882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5059552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5060552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5061552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5062552f7358SJed Brown } 5063552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5064552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5065854ce69bSBarry Smith ierr = PetscMalloc1(pEnd - pStart, &numbers);CHKERRQ(ierr); 5066552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5067552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5068ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5069ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5070552f7358SJed Brown } 507182f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5072ef48cebcSMatthew G. Knepley if (globalSize) { 5073ef48cebcSMatthew G. Knepley PetscLayout layout; 5074ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5075ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5076ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5077ef48cebcSMatthew G. Knepley } 5078552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5079552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5080552f7358SJed Brown PetscFunctionReturn(0); 5081552f7358SJed Brown } 5082552f7358SJed Brown 5083552f7358SJed Brown #undef __FUNCT__ 5084552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5085552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5086552f7358SJed Brown { 5087552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5088552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5089552f7358SJed Brown PetscErrorCode ierr; 5090552f7358SJed Brown 5091552f7358SJed Brown PetscFunctionBegin; 5092552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5093552f7358SJed Brown if (!mesh->globalCellNumbers) { 5094552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5095552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 50960298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 50970d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5098ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5099552f7358SJed Brown } 5100552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5101552f7358SJed Brown PetscFunctionReturn(0); 5102552f7358SJed Brown } 5103552f7358SJed Brown 5104552f7358SJed Brown #undef __FUNCT__ 5105552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5106552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5107552f7358SJed Brown { 5108552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5109552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5110552f7358SJed Brown PetscErrorCode ierr; 5111552f7358SJed Brown 5112552f7358SJed Brown PetscFunctionBegin; 5113552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5114552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5115552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 51160298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 51170d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5118ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5119552f7358SJed Brown } 5120552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5121552f7358SJed Brown PetscFunctionReturn(0); 5122552f7358SJed Brown } 5123552f7358SJed Brown 5124ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5125ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5126ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5127ef48cebcSMatthew G. Knepley { 5128ef48cebcSMatthew G. Knepley IS nums[4]; 5129ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5130ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5131ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5132ef48cebcSMatthew G. Knepley 5133ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5134ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5135ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 51368abc87a0SMichael Lange /* For unstratified meshes use dim instead of depth */ 51378abc87a0SMichael Lange if (depth < 0) {ierr = DMGetDimension(dm, &depth);CHKERRQ(ierr);} 5138ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5139ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5140ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5141ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5142ef48cebcSMatthew G. Knepley 5143ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5144ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5145ef48cebcSMatthew G. Knepley shift += gsize; 5146ef48cebcSMatthew G. Knepley } 5147302440fdSBarry Smith ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers);CHKERRQ(ierr); 5148ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5149ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5150ef48cebcSMatthew G. Knepley } 5151ef48cebcSMatthew G. Knepley 5152552f7358SJed Brown 5153552f7358SJed Brown #undef __FUNCT__ 5154552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5155552f7358SJed Brown /*@C 5156552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5157552f7358SJed Brown the local section and an SF describing the section point overlap. 5158552f7358SJed Brown 5159552f7358SJed Brown Input Parameters: 5160552f7358SJed Brown + s - The PetscSection for the local field layout 5161552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5162552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5163552f7358SJed Brown . label - The label specifying the points 5164552f7358SJed Brown - labelValue - The label stratum specifying the points 5165552f7358SJed Brown 5166552f7358SJed Brown Output Parameter: 5167552f7358SJed Brown . gsection - The PetscSection for the global field layout 5168552f7358SJed Brown 5169552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5170552f7358SJed Brown 5171552f7358SJed Brown Level: developer 5172552f7358SJed Brown 5173552f7358SJed Brown .seealso: PetscSectionCreate() 5174552f7358SJed Brown @*/ 5175552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5176552f7358SJed Brown { 51777ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5178552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5179552f7358SJed Brown PetscErrorCode ierr; 5180552f7358SJed Brown 5181552f7358SJed Brown PetscFunctionBegin; 51824c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5183552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5184552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 51857ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 51867ec39499SMatthew G. Knepley if (nroots >= 0) { 51877ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 51881795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 51897ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 51901795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 51917ec39499SMatthew G. Knepley } else { 51927ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 51937ec39499SMatthew G. Knepley } 51947ec39499SMatthew G. Knepley } 5195552f7358SJed Brown /* Mark ghost points with negative dof */ 5196552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5197552f7358SJed Brown PetscInt value; 5198552f7358SJed Brown 5199552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5200552f7358SJed Brown if (value != labelValue) continue; 5201552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5202552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5203552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5204552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 52057ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5206552f7358SJed Brown } 5207552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5208552f7358SJed Brown if (nroots >= 0) { 52097ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 52107ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5211552f7358SJed Brown if (nroots > pEnd-pStart) { 52127ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5213552f7358SJed Brown } 5214552f7358SJed Brown } 5215552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5216552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5217552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5218552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5219552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5220552f7358SJed Brown } 52214c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5222552f7358SJed Brown globalOff -= off; 5223552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5224552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 52257ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5226552f7358SJed Brown } 5227552f7358SJed Brown /* Put in negative offsets for ghost points */ 5228552f7358SJed Brown if (nroots >= 0) { 52297ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 52307ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5231552f7358SJed Brown if (nroots > pEnd-pStart) { 52327ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5233552f7358SJed Brown } 5234552f7358SJed Brown } 52357ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5236552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5237552f7358SJed Brown PetscFunctionReturn(0); 5238552f7358SJed Brown } 5239ca8062c8SMatthew G. Knepley 5240ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5241ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5242ca8062c8SMatthew G. Knepley /*@ 5243ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5244ca8062c8SMatthew G. Knepley 5245ca8062c8SMatthew G. Knepley Input Parameters: 5246ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5247ca8062c8SMatthew G. Knepley 5248ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5249ca8062c8SMatthew G. Knepley 5250ca8062c8SMatthew G. Knepley Level: developer 5251ca8062c8SMatthew G. Knepley 52529bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5253ca8062c8SMatthew G. Knepley @*/ 5254ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5255ca8062c8SMatthew G. Knepley { 5256ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5257ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5258ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5259ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5260ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5261ca8062c8SMatthew G. Knepley 5262ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5263ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5264ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5265ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5266ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5267ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5268ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5269ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5270ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5271ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 527242e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 527342e66dfaSMatthew G. Knepley PetscInt d; 527442e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 527542e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 527642e66dfaSMatthew G. Knepley } 5277ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5278ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5279ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5280ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5281ca8062c8SMatthew G. Knepley } 528242e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5283302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);CHKERRQ(ierr); 5284ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5285302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);CHKERRQ(ierr); 5286ca8062c8SMatthew G. Knepley } 5287302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5288302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);CHKERRQ(ierr); 5289ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5290302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);CHKERRQ(ierr); 5291ca8062c8SMatthew G. Knepley } 5292302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5293302440fdSBarry 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]); 5294302440fdSBarry Smith else SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5295ca8062c8SMatthew G. Knepley } 529642e66dfaSMatthew G. Knepley } 5297ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5298ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5299ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5300ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5301ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5302ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5303ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5304ca8062c8SMatthew G. Knepley } 5305ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5306302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);CHKERRQ(ierr); 5307ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5308302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);CHKERRQ(ierr); 5309ca8062c8SMatthew G. Knepley } 5310302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5311302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);CHKERRQ(ierr); 5312ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5313302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);CHKERRQ(ierr); 5314ca8062c8SMatthew G. Knepley } 5315302440fdSBarry Smith ierr = PetscPrintf(PETSC_COMM_SELF, "\n");CHKERRQ(ierr); 5316ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5317ca8062c8SMatthew G. Knepley } 5318ca8062c8SMatthew G. Knepley } 5319ca8062c8SMatthew G. Knepley } 5320ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5321ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5322ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5323ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5324ca8062c8SMatthew G. Knepley } 5325ca8062c8SMatthew G. Knepley 5326ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5327ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5328ca8062c8SMatthew G. Knepley /*@ 5329ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5330ca8062c8SMatthew G. Knepley 5331ca8062c8SMatthew G. Knepley Input Parameters: 5332ca8062c8SMatthew G. Knepley + dm - The DMPlex object 533358723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 533458723a97SMatthew G. Knepley - cellHeight - Normally 0 5335ca8062c8SMatthew G. Knepley 5336ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5337ca8062c8SMatthew G. Knepley 5338ca8062c8SMatthew G. Knepley Level: developer 5339ca8062c8SMatthew G. Knepley 53409bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5341ca8062c8SMatthew G. Knepley @*/ 534258723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5343ca8062c8SMatthew G. Knepley { 534442363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5345ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5346ca8062c8SMatthew G. Knepley 5347ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5348ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5349c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5350ca8062c8SMatthew G. Knepley switch (dim) { 535142363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 535242363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 535342363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5354ca8062c8SMatthew G. Knepley default: 5355ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5356ca8062c8SMatthew G. Knepley } 535758723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 535858723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5359ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5360ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5361ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 536258723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 536358723a97SMatthew G. Knepley 536458723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 536558723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 536658723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 536758723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 536858723a97SMatthew G. Knepley } 536958723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5370ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5371ca8062c8SMatthew G. Knepley } 537242363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 537342363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 537442363296SMatthew G. Knepley 537542363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 537642363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 537742363296SMatthew G. Knepley const PetscInt p = closure[cl]; 537842363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 537942363296SMatthew G. Knepley } 538042363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 538142363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 538242363296SMatthew G. Knepley } 5383ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5384ca8062c8SMatthew G. Knepley } 53859bf0dad6SMatthew G. Knepley 53869bf0dad6SMatthew G. Knepley #undef __FUNCT__ 53879bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 53889bf0dad6SMatthew G. Knepley /*@ 53899bf0dad6SMatthew 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 53909bf0dad6SMatthew G. Knepley 53919bf0dad6SMatthew G. Knepley Input Parameters: 53929bf0dad6SMatthew G. Knepley + dm - The DMPlex object 53939bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 53949bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 53959bf0dad6SMatthew G. Knepley 53969bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 53979bf0dad6SMatthew G. Knepley 53989bf0dad6SMatthew G. Knepley Level: developer 53999bf0dad6SMatthew G. Knepley 54009bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 54019bf0dad6SMatthew G. Knepley @*/ 54029bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 54039bf0dad6SMatthew G. Knepley { 54043554e41dSMatthew G. Knepley PetscInt pMax[4]; 54053554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 54069bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 54079bf0dad6SMatthew G. Knepley 54089bf0dad6SMatthew G. Knepley PetscFunctionBegin; 54099bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5410c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 54119bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 541225abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 54133554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 54143554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 54153554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 54169bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 54179bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 54189bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 54199bf0dad6SMatthew G. Knepley 542025abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 54219bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 54229bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 54239bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 54249bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 54259bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 54269bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 54279bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 54289bf0dad6SMatthew G. Knepley } 54293554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 54309bf0dad6SMatthew 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); 54319bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 54329bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 54339bf0dad6SMatthew G. Knepley 54349bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 54359bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 54369bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 54379bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 54389bf0dad6SMatthew G. Knepley } 5439e003ed69SMatthew 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); 54409bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5441e003ed69SMatthew 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]); 54429bf0dad6SMatthew G. Knepley } 54439bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 54449bf0dad6SMatthew G. Knepley } 54459bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 54469bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 54479bf0dad6SMatthew G. Knepley } 54483554e41dSMatthew G. Knepley } 5449552f7358SJed Brown PetscFunctionReturn(0); 5450552f7358SJed Brown } 54513913d7c8SMatthew G. Knepley 54523913d7c8SMatthew G. Knepley #undef __FUNCT__ 5453bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5454bceba477SMatthew G. Knepley /* Pointwise interpolation 5455bceba477SMatthew G. Knepley Just code FEM for now 5456bceba477SMatthew G. Knepley u^f = I u^c 54574ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 54584ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 54594ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5460bceba477SMatthew G. Knepley */ 5461bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5462bceba477SMatthew G. Knepley { 5463bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5464bceba477SMatthew G. Knepley PetscInt m, n; 5465a063dac3SMatthew G. Knepley void *ctx; 5466bceba477SMatthew G. Knepley PetscErrorCode ierr; 5467bceba477SMatthew G. Knepley 5468bceba477SMatthew G. Knepley PetscFunctionBegin; 5469bceba477SMatthew G. Knepley /* 5470bceba477SMatthew G. Knepley Loop over coarse cells 5471bceba477SMatthew G. Knepley Loop over coarse basis functions 5472bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5473bceba477SMatthew G. Knepley Loop over fine dual basis functions 5474bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5475bceba477SMatthew G. Knepley Sum 5476bceba477SMatthew G. Knepley Update local element matrix 5477bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5478bceba477SMatthew G. Knepley 5479bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5480bceba477SMatthew G. Knepley */ 5481bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5482bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5483bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5484bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5485bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5486bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5487bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5488bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5489a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5490a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 54915d1c2e58SMatthew G. Knepley /* Use naive scaling */ 54925d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5493a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5494a063dac3SMatthew G. Knepley } 5495bceba477SMatthew G. Knepley 5496a063dac3SMatthew G. Knepley #undef __FUNCT__ 5497a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 54986dbf9973SLawrence Mitchell PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, Mat *mat) 5499a063dac3SMatthew G. Knepley { 550090748bafSMatthew G. Knepley PetscErrorCode ierr; 55016dbf9973SLawrence Mitchell VecScatter ctx; 550290748bafSMatthew G. Knepley 5503a063dac3SMatthew G. Knepley PetscFunctionBegin; 55046dbf9973SLawrence Mitchell ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, &ctx, NULL);CHKERRQ(ierr); 55056dbf9973SLawrence Mitchell ierr = MatCreateScatter(PetscObjectComm((PetscObject)ctx), ctx, mat);CHKERRQ(ierr); 55066dbf9973SLawrence Mitchell ierr = VecScatterDestroy(&ctx);CHKERRQ(ierr); 5507bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5508bceba477SMatthew G. Knepley } 5509bceba477SMatthew G. Knepley 5510bceba477SMatthew G. Knepley #undef __FUNCT__ 5511fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5512fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5513fd59a867SMatthew G. Knepley { 5514fd59a867SMatthew G. Knepley PetscSection section; 5515ab1d0545SMatthew G. Knepley IS *bcPoints, *bcComps; 5516ebb3236fSMatthew G. Knepley PetscBool *isFE; 5517286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5518ebb3236fSMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc = 0, f; 5519ebb3236fSMatthew G. Knepley PetscInt cStart, cEnd, cEndInterior; 5520fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5521fd59a867SMatthew G. Knepley 5522fd59a867SMatthew G. Knepley PetscFunctionBegin; 5523ebb3236fSMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5524ebb3236fSMatthew G. Knepley /* FE and FV boundary conditions are handled slightly differently */ 5525ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 5526ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5527ebb3236fSMatthew G. Knepley PetscObject obj; 5528ebb3236fSMatthew G. Knepley PetscClassId id; 5529ebb3236fSMatthew G. Knepley 5530ebb3236fSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5531ebb3236fSMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 5532ebb3236fSMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 5533ebb3236fSMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 5534ebb3236fSMatthew G. Knepley else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %d", f); 5535ebb3236fSMatthew G. Knepley } 55362f900235SMatthew G. Knepley /* Allocate boundary point storage for FEM boundaries */ 5537286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5538c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5539ebb3236fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 5540ebb3236fSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 5541fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5542fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 55432f900235SMatthew G. Knepley PetscInt field; 5544fd59a867SMatthew G. Knepley PetscBool isEssential; 55452f900235SMatthew G. Knepley 55460e0f25f2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, &field, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 55472f900235SMatthew G. Knepley if (isFE[field] && isEssential) ++numBC; 5548fd59a867SMatthew G. Knepley } 55492f900235SMatthew G. Knepley /* Add ghost cell boundaries for FVM */ 5550ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC; 5551ab1d0545SMatthew G. Knepley ierr = PetscMalloc3(numBC,&bcFields,numBC,&bcPoints,numBC,&bcComps);CHKERRQ(ierr); 5552ebb3236fSMatthew G. Knepley /* Constrain ghost cells for FV */ 5553ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5554ebb3236fSMatthew G. Knepley PetscInt *newidx, c; 5555ebb3236fSMatthew G. Knepley 5556ebb3236fSMatthew G. Knepley if (isFE[f] || cEndInterior < 0) continue; 5557ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr); 5558ebb3236fSMatthew G. Knepley for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c; 5559ebb3236fSMatthew G. Knepley bcFields[bc] = f; 5560ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5561ebb3236fSMatthew G. Knepley } 5562ebb3236fSMatthew G. Knepley /* Handle FEM Dirichlet boundaries */ 5563ebb3236fSMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5564fd59a867SMatthew G. Knepley const char *bdLabel; 5565fd59a867SMatthew G. Knepley DMLabel label; 55660e0f25f2SMatthew G. Knepley const PetscInt *comps; 5567fd59a867SMatthew G. Knepley const PetscInt *values; 55680e0f25f2SMatthew G. Knepley PetscInt bd2, field, numComps, numValues; 5569c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 5570fd59a867SMatthew G. Knepley 55717fc83844SMatthew G. Knepley bcComps[bc] = NULL; 55720e0f25f2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, &numComps, &comps, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 55732f900235SMatthew G. Knepley if (!isFE[field]) continue; 5574fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5575ebb3236fSMatthew G. Knepley /* Only want to modify label once */ 55767391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 55777391c1cbSMatthew G. Knepley const char *bdname; 55780e0f25f2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 55797391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 55807391c1cbSMatthew G. Knepley if (duplicate) break; 55817391c1cbSMatthew G. Knepley } 5582ebb3236fSMatthew G. Knepley if (!duplicate && (isFE[field])) { 5583fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 558432720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 55857391c1cbSMatthew G. Knepley } 5586ebb3236fSMatthew G. Knepley /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */ 5587fd59a867SMatthew G. Knepley if (isEssential) { 558893a5981aSMatthew G. Knepley PetscInt *newidx; 5589ebb3236fSMatthew G. Knepley PetscInt n, newn = 0, p, v; 559093a5981aSMatthew G. Knepley 5591fd59a867SMatthew G. Knepley bcFields[bc] = field; 55920e0f25f2SMatthew G. Knepley if (numComps) {ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), numComps, comps, PETSC_COPY_VALUES, &bcComps[bc]);CHKERRQ(ierr);} 5593ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5594ebb3236fSMatthew G. Knepley IS tmp; 5595ebb3236fSMatthew G. Knepley const PetscInt *idx; 5596ebb3236fSMatthew G. Knepley 5597ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5598ebb3236fSMatthew G. Knepley if (!tmp) continue; 559993a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 560093a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5601ebb3236fSMatthew G. Knepley if (isFE[field]) { 560293a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 5603ebb3236fSMatthew G. Knepley } else { 5604ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn; 5605ebb3236fSMatthew G. Knepley } 560693a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 560793a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5608fd59a867SMatthew G. Knepley } 5609ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 5610ebb3236fSMatthew G. Knepley newn = 0; 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; 5617ebb3236fSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 5618ebb3236fSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5619ebb3236fSMatthew G. Knepley if (isFE[field]) { 5620ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 5621ebb3236fSMatthew G. Knepley } else { 5622ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p]; 5623ebb3236fSMatthew G. Knepley } 5624ebb3236fSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 5625ebb3236fSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5626ebb3236fSMatthew G. Knepley } 5627ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5628ebb3236fSMatthew G. Knepley } 5629fd59a867SMatthew G. Knepley } 5630fd59a867SMatthew G. Knepley /* Handle discretization */ 5631ebb3236fSMatthew G. Knepley ierr = PetscCalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5632fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 56330bacfa0aSMatthew G. Knepley PetscObject obj; 56340bacfa0aSMatthew G. Knepley 56350bacfa0aSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5636ebb3236fSMatthew G. Knepley if (isFE[f]) { 56370bacfa0aSMatthew G. Knepley PetscFE fe = (PetscFE) obj; 5638286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5639fd59a867SMatthew G. Knepley PetscInt d; 5640fd59a867SMatthew G. Knepley 5641fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5642286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5643286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5644ebb3236fSMatthew G. Knepley } else { 56450bacfa0aSMatthew G. Knepley PetscFV fv = (PetscFV) obj; 56460bacfa0aSMatthew G. Knepley 56470bacfa0aSMatthew G. Knepley ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr); 56480bacfa0aSMatthew G. Knepley numDof[f*(dim+1)+dim] = numComp[f]; 5649ebb3236fSMatthew G. Knepley } 5650fd59a867SMatthew G. Knepley } 5651286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5652286d8613SMatthew G. Knepley PetscInt d; 5653286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5654286d8613SMatthew 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."); 5655286d8613SMatthew G. Knepley } 5656286d8613SMatthew G. Knepley } 5657ab1d0545SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcComps, bcPoints, NULL, §ion);CHKERRQ(ierr); 5658fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5659fd59a867SMatthew G. Knepley PetscFE fe; 5660fd59a867SMatthew G. Knepley const char *name; 566118abd763SMatthew G. Knepley 566218abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5663fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5664fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5665fd59a867SMatthew G. Knepley } 5666fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5667fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 56680e0f25f2SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);ierr = ISDestroy(&bcComps[bc]);CHKERRQ(ierr);} 56690e0f25f2SMatthew G. Knepley ierr = PetscFree3(bcFields,bcPoints,bcComps);CHKERRQ(ierr); 5670286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5671ebb3236fSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 5672bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5673bceba477SMatthew G. Knepley } 5674bceba477SMatthew G. Knepley 5675bceba477SMatthew G. Knepley #undef __FUNCT__ 56763913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 56773913d7c8SMatthew G. Knepley /*@ 56783913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 56793913d7c8SMatthew G. Knepley 56803913d7c8SMatthew G. Knepley Input Parameter: 56813913d7c8SMatthew G. Knepley . dm - The DMPlex object 56823913d7c8SMatthew G. Knepley 56833913d7c8SMatthew G. Knepley Output Parameter: 56843913d7c8SMatthew G. Knepley . cdm - The coarse DM 56853913d7c8SMatthew G. Knepley 56863913d7c8SMatthew G. Knepley Level: intermediate 56873913d7c8SMatthew G. Knepley 56883913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 56893913d7c8SMatthew G. Knepley @*/ 56903913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 56913913d7c8SMatthew G. Knepley { 56923913d7c8SMatthew G. Knepley PetscFunctionBegin; 56933913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 56943913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 56953913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 56963913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 56973913d7c8SMatthew G. Knepley } 56983913d7c8SMatthew G. Knepley 56993913d7c8SMatthew G. Knepley #undef __FUNCT__ 57003913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 57013913d7c8SMatthew G. Knepley /*@ 57023913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 57033913d7c8SMatthew G. Knepley 57043913d7c8SMatthew G. Knepley Input Parameters: 57053913d7c8SMatthew G. Knepley + dm - The DMPlex object 57063913d7c8SMatthew G. Knepley - cdm - The coarse DM 57073913d7c8SMatthew G. Knepley 57083913d7c8SMatthew G. Knepley Level: intermediate 57093913d7c8SMatthew G. Knepley 57103913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 57113913d7c8SMatthew G. Knepley @*/ 57123913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 57133913d7c8SMatthew G. Knepley { 57143913d7c8SMatthew G. Knepley DM_Plex *mesh; 57153913d7c8SMatthew G. Knepley PetscErrorCode ierr; 57163913d7c8SMatthew G. Knepley 57173913d7c8SMatthew G. Knepley PetscFunctionBegin; 57183913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 57193913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 57203913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 57213913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 57223913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 57233913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 57243913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 57253913d7c8SMatthew G. Knepley } 5726a68b90caSToby Isaac 5727f7c74593SToby Isaac /* anchors */ 5728a68b90caSToby Isaac #undef __FUNCT__ 5729a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors" 5730a68b90caSToby Isaac /*@ 5731f7c74593SToby Isaac DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints. Typically, the user will not have to 5732f7c74593SToby Isaac call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints(). 5733a68b90caSToby Isaac 5734e228b242SToby Isaac not collective 5735a68b90caSToby Isaac 5736a68b90caSToby Isaac Input Parameters: 5737a68b90caSToby Isaac . dm - The DMPlex object 5738a68b90caSToby Isaac 5739a68b90caSToby Isaac Output Parameters: 5740a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 5741a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 5742a68b90caSToby Isaac 5743a68b90caSToby Isaac 5744a68b90caSToby Isaac Level: intermediate 5745a68b90caSToby Isaac 5746f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints() 5747a68b90caSToby Isaac @*/ 5748a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS) 5749a68b90caSToby Isaac { 5750a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 575141e6d900SToby Isaac PetscErrorCode ierr; 5752a68b90caSToby Isaac 5753a68b90caSToby Isaac PetscFunctionBegin; 5754a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 575541e6d900SToby Isaac if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);} 5756a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 5757a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 5758a68b90caSToby Isaac PetscFunctionReturn(0); 5759a68b90caSToby Isaac } 5760a68b90caSToby Isaac 5761a68b90caSToby Isaac #undef __FUNCT__ 5762a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors" 5763a68b90caSToby Isaac /*@ 5764f7c74593SToby Isaac DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints. Unlike boundary conditions, 5765f7c74593SToby Isaac when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a 5766a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 5767a68b90caSToby Isaac 5768a17985deSToby Isaac After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling 5769f7c74593SToby Isaac DMGetConstraints() and filling in the entries in the constraint matrix. 5770a68b90caSToby Isaac 5771e228b242SToby Isaac collective on dm 5772a68b90caSToby Isaac 5773a68b90caSToby Isaac Input Parameters: 5774a68b90caSToby Isaac + dm - The DMPlex object 5775e228b242SToby 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). 5776e228b242SToby Isaac - anchorIS - The list of all anchor points. Must have a local communicator (PETSC_COMM_SELF or derivative). 5777a68b90caSToby Isaac 5778a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 5779a68b90caSToby Isaac 5780a68b90caSToby Isaac Level: intermediate 5781a68b90caSToby Isaac 5782f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints() 5783a68b90caSToby Isaac @*/ 5784a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS) 5785a68b90caSToby Isaac { 5786a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 5787e228b242SToby Isaac PetscMPIInt result; 5788a68b90caSToby Isaac PetscErrorCode ierr; 5789a68b90caSToby Isaac 5790a68b90caSToby Isaac PetscFunctionBegin; 5791a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5792e228b242SToby Isaac if (anchorSection) { 5793e228b242SToby Isaac PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2); 5794e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr); 5795e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator"); 5796e228b242SToby Isaac } 5797e228b242SToby Isaac if (anchorIS) { 5798e228b242SToby Isaac PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3); 5799e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr); 5800e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator"); 5801e228b242SToby Isaac } 5802a68b90caSToby Isaac 5803a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 5804a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 5805a68b90caSToby Isaac plex->anchorSection = anchorSection; 5806a68b90caSToby Isaac 5807a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 5808a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 5809a68b90caSToby Isaac plex->anchorIS = anchorIS; 5810a68b90caSToby Isaac 5811a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 5812a68b90caSToby Isaac if (anchorIS && anchorSection) { 5813a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 5814a68b90caSToby Isaac const PetscInt *anchors; 5815a68b90caSToby Isaac 5816a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5817a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 5818a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 5819a68b90caSToby Isaac for (a = 0; a < size; a++) { 5820a68b90caSToby Isaac PetscInt p; 5821a68b90caSToby Isaac 5822a68b90caSToby Isaac p = anchors[a]; 5823a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 5824a68b90caSToby Isaac PetscInt dof; 5825a68b90caSToby Isaac 5826a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5827a68b90caSToby Isaac if (dof) { 5828a68b90caSToby Isaac PetscErrorCode ierr2; 5829a68b90caSToby Isaac 5830a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 5831a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 5832a68b90caSToby Isaac } 5833a68b90caSToby Isaac } 5834a68b90caSToby Isaac } 5835a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 5836a68b90caSToby Isaac } 5837a68b90caSToby Isaac #endif 5838f7c74593SToby Isaac /* reset the generic constraints */ 5839f7c74593SToby Isaac ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr); 5840a68b90caSToby Isaac PetscFunctionReturn(0); 5841a68b90caSToby Isaac } 5842a68b90caSToby Isaac 5843a68b90caSToby Isaac #undef __FUNCT__ 5844f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors" 5845f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec) 5846a68b90caSToby Isaac { 5847f7c74593SToby Isaac PetscSection anchorSection; 5848a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 5849a68b90caSToby Isaac PetscErrorCode ierr; 5850a68b90caSToby Isaac 5851a68b90caSToby Isaac PetscFunctionBegin; 5852a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5853a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 5854e228b242SToby Isaac ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr); 5855a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 5856a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 5857a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5858a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 5859a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 5860a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5861a68b90caSToby Isaac if (dof) { 5862a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 5863a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 5864a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 5865a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 5866a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 5867a68b90caSToby Isaac } 5868a68b90caSToby Isaac } 5869a68b90caSToby Isaac } 5870a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 5871a68b90caSToby Isaac PetscFunctionReturn(0); 5872a68b90caSToby Isaac } 5873a68b90caSToby Isaac 5874a68b90caSToby Isaac #undef __FUNCT__ 5875f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors" 5876f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat) 5877a68b90caSToby Isaac { 5878f7c74593SToby Isaac PetscSection aSec; 58790ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 58800ac89760SToby Isaac const PetscInt *anchors; 58810ac89760SToby Isaac PetscInt numFields, f; 588266ad2231SToby Isaac IS aIS; 58830ac89760SToby Isaac PetscErrorCode ierr; 58840ac89760SToby Isaac 58850ac89760SToby Isaac PetscFunctionBegin; 58860ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 58870ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 58880ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 58890ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 58900ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 5891302440fdSBarry Smith ierr = MatSetType(*cMat,MATSEQAIJ);CHKERRQ(ierr); 5892a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 589366ad2231SToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 58940ac89760SToby Isaac ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr); 58950ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 58960ac89760SToby Isaac i[0] = 0; 58970ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 58980ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 58990ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 59000ac89760SToby Isaac if (!dof) continue; 59010ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 59020ac89760SToby Isaac if (numFields) { 59030ac89760SToby Isaac for (f = 0; f < numFields; f++) { 59040ac89760SToby Isaac annz = 0; 59050ac89760SToby Isaac for (q = 0; q < dof; q++) { 59060ac89760SToby Isaac a = anchors[off + q]; 59070ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 59080ac89760SToby Isaac annz += aDof; 59090ac89760SToby Isaac } 59100ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 59110ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 59120ac89760SToby Isaac for (q = 0; q < dof; q++) { 59130ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 59140ac89760SToby Isaac } 59150ac89760SToby Isaac } 59160ac89760SToby Isaac } 59170ac89760SToby Isaac else { 59180ac89760SToby Isaac annz = 0; 59190ac89760SToby Isaac for (q = 0; q < dof; q++) { 59200ac89760SToby Isaac a = anchors[off + q]; 59210ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 59220ac89760SToby Isaac annz += aDof; 59230ac89760SToby Isaac } 59240ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 59250ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 59260ac89760SToby Isaac for (q = 0; q < dof; q++) { 59270ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 59280ac89760SToby Isaac } 59290ac89760SToby Isaac } 59300ac89760SToby Isaac } 59310ac89760SToby Isaac nnz = i[m]; 59320ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 59330ac89760SToby Isaac offset = 0; 59340ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 59350ac89760SToby Isaac if (numFields) { 59360ac89760SToby Isaac for (f = 0; f < numFields; f++) { 59370ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 59380ac89760SToby Isaac for (q = 0; q < dof; q++) { 59390ac89760SToby Isaac PetscInt rDof, rOff, r; 59400ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 59410ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 59420ac89760SToby Isaac for (r = 0; r < rDof; r++) { 59430ac89760SToby Isaac PetscInt s; 59440ac89760SToby Isaac 59450ac89760SToby Isaac a = anchors[rOff + r]; 59460ac89760SToby Isaac 59470ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 59480ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 59490ac89760SToby Isaac for (s = 0; s < aDof; s++) { 59500ac89760SToby Isaac j[offset++] = aOff + s; 59510ac89760SToby Isaac } 59520ac89760SToby Isaac } 59530ac89760SToby Isaac } 59540ac89760SToby Isaac } 59550ac89760SToby Isaac } 59560ac89760SToby Isaac else { 59570ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 59580ac89760SToby Isaac for (q = 0; q < dof; q++) { 59590ac89760SToby Isaac PetscInt rDof, rOff, r; 59600ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 59610ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 59620ac89760SToby Isaac for (r = 0; r < rDof; r++) { 59630ac89760SToby Isaac PetscInt s; 59640ac89760SToby Isaac 59650ac89760SToby Isaac a = anchors[rOff + r]; 59660ac89760SToby Isaac 59670ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 59680ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 59690ac89760SToby Isaac for (s = 0; s < aDof; s++) { 59700ac89760SToby Isaac j[offset++] = aOff + s; 59710ac89760SToby Isaac } 59720ac89760SToby Isaac } 59730ac89760SToby Isaac } 59740ac89760SToby Isaac } 59750ac89760SToby Isaac } 59760ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 597725570a81SToby Isaac ierr = PetscFree(i);CHKERRQ(ierr); 597825570a81SToby Isaac ierr = PetscFree(j);CHKERRQ(ierr); 597966ad2231SToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 59800ac89760SToby Isaac PetscFunctionReturn(0); 59810ac89760SToby Isaac } 59820ac89760SToby Isaac 59830ac89760SToby Isaac #undef __FUNCT__ 598466ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex" 598566ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm) 598666ad2231SToby Isaac { 5987f7c74593SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 5988f7c74593SToby Isaac PetscSection anchorSection, section, cSec; 598966ad2231SToby Isaac Mat cMat; 599066ad2231SToby Isaac PetscErrorCode ierr; 599166ad2231SToby Isaac 599266ad2231SToby Isaac PetscFunctionBegin; 599366ad2231SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5994a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 599566ad2231SToby Isaac if (anchorSection) { 5996e228b242SToby Isaac PetscDS ds; 5997e228b242SToby Isaac PetscInt nf; 5998e228b242SToby Isaac 5999f7c74593SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6000f7c74593SToby Isaac ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr); 6001f7c74593SToby Isaac ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr); 6002e228b242SToby Isaac ierr = DMGetDS(dm,&ds);CHKERRQ(ierr); 6003302440fdSBarry Smith ierr = PetscDSGetNumFields(ds,&nf);CHKERRQ(ierr); 6004e228b242SToby Isaac if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);} 600566ad2231SToby Isaac ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr); 600666ad2231SToby Isaac ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr); 600766ad2231SToby Isaac ierr = MatDestroy(&cMat);CHKERRQ(ierr); 600866ad2231SToby Isaac } 600966ad2231SToby Isaac PetscFunctionReturn(0); 601066ad2231SToby Isaac } 6011