134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 30c312b8eSJed Brown #include <petscsf.h> 4e228b242SToby Isaac #include <petscds.h> 5552f7358SJed Brown 6552f7358SJed Brown /* Logging support */ 71b858b30SMichael 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; 8552f7358SJed Brown 95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 112c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 12552f7358SJed Brown 137e42fee7SMatthew G. Knepley #undef __FUNCT__ 147afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 157afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 167e42fee7SMatthew G. Knepley { 177e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 187e42fee7SMatthew G. Knepley PetscErrorCode ierr; 197e42fee7SMatthew G. Knepley 207e42fee7SMatthew G. Knepley PetscFunctionBegin; 217e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 22c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 237e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 257e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley if (field >= 0) { 277e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 287e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 297e42fee7SMatthew G. Knepley } else { 307e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley } 337e42fee7SMatthew G. Knepley if (vdof) { 347e42fee7SMatthew G. Knepley *sStart = vStart; 357e42fee7SMatthew G. Knepley *sEnd = vEnd; 367e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 377e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 387e42fee7SMatthew G. Knepley } else if (cdof) { 397e42fee7SMatthew G. Knepley *sStart = cStart; 407e42fee7SMatthew G. Knepley *sEnd = cEnd; 417e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 427e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 437e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 447e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 457e42fee7SMatthew G. Knepley } 467e42fee7SMatthew G. Knepley 47552f7358SJed Brown #undef __FUNCT__ 48552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 49552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 50552f7358SJed Brown { 51552f7358SJed Brown DM dm; 52b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 53552f7358SJed Brown PetscErrorCode ierr; 54552f7358SJed Brown 55552f7358SJed Brown PetscFunctionBegin; 56552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 58552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 59b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 60b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 61ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 62ef31f671SMatthew G. Knepley PetscInt numFields; 63ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 64ef31f671SMatthew G. Knepley 65ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 66ef31f671SMatthew G. Knepley if (numFields) { 67ef31f671SMatthew G. Knepley PetscObject fe; 68ef31f671SMatthew G. Knepley 69ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 70ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 71ef31f671SMatthew G. Knepley } 72d7ddef95SMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValues(dm, v, 0.0, NULL, NULL, NULL);CHKERRQ(ierr);} 73ef31f671SMatthew G. Knepley } 74552f7358SJed Brown if (isvtk) { 75552f7358SJed Brown PetscSection section; 76b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 77b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 78552f7358SJed Brown 79552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 807afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 81552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 82552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 83552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 84b136c2c9SMatthew G. Knepley } else if (ishdf5) { 85b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 86b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 87b136c2c9SMatthew G. Knepley #else 88b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 89b136c2c9SMatthew G. Knepley #endif 90552f7358SJed Brown } else { 9155f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9255f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 93552f7358SJed Brown } 94552f7358SJed Brown PetscFunctionReturn(0); 95552f7358SJed Brown } 96552f7358SJed Brown 97552f7358SJed Brown #undef __FUNCT__ 98552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 99552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 100552f7358SJed Brown { 101552f7358SJed Brown DM dm; 10255f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 103552f7358SJed Brown PetscErrorCode ierr; 104552f7358SJed Brown 105552f7358SJed Brown PetscFunctionBegin; 106552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 10782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 108552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 10933c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11055f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 111552f7358SJed Brown if (isvtk) { 112552f7358SJed Brown Vec locv; 113552f7358SJed Brown const char *name; 114552f7358SJed Brown 115552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 116552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 117552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 118552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 119552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 120552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 122b136c2c9SMatthew G. Knepley } else if (ishdf5) { 123b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 124b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 125b136c2c9SMatthew G. Knepley #else 126b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 127b136c2c9SMatthew G. Knepley #endif 128552f7358SJed Brown } else { 12955f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13055f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 131552f7358SJed Brown } 132552f7358SJed Brown PetscFunctionReturn(0); 133552f7358SJed Brown } 134552f7358SJed Brown 135552f7358SJed Brown #undef __FUNCT__ 1362c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1372c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1382c40f234SMatthew G. Knepley { 1392c40f234SMatthew G. Knepley DM dm; 1402c40f234SMatthew G. Knepley PetscBool ishdf5; 1412c40f234SMatthew G. Knepley PetscErrorCode ierr; 1422c40f234SMatthew G. Knepley 1432c40f234SMatthew G. Knepley PetscFunctionBegin; 1442c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1452c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1462c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1472c40f234SMatthew G. Knepley if (ishdf5) { 1482c40f234SMatthew G. Knepley DM dmBC; 1492c40f234SMatthew G. Knepley Vec gv; 1502c40f234SMatthew G. Knepley const char *name; 1512c40f234SMatthew G. Knepley 1522c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1532c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1542c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1552c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley } else { 1612c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley } 1632c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1642c40f234SMatthew G. Knepley } 1652c40f234SMatthew G. Knepley 1662c40f234SMatthew G. Knepley #undef __FUNCT__ 1672c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1682c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1692c40f234SMatthew G. Knepley { 1702c40f234SMatthew G. Knepley DM dm; 1712c40f234SMatthew G. Knepley PetscBool ishdf5; 1722c40f234SMatthew G. Knepley PetscErrorCode ierr; 1732c40f234SMatthew G. Knepley 1742c40f234SMatthew G. Knepley PetscFunctionBegin; 1752c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1762c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1782c40f234SMatthew G. Knepley if (ishdf5) { 179878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 180b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 181b136c2c9SMatthew G. Knepley #else 182b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 183878b459fSMatthew G. Knepley #endif 1842c40f234SMatthew G. Knepley } else { 1852c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 186552f7358SJed Brown } 187552f7358SJed Brown PetscFunctionReturn(0); 188552f7358SJed Brown } 189552f7358SJed Brown 190552f7358SJed Brown #undef __FUNCT__ 191731e8ddeSMatthew G. Knepley #define __FUNCT__ "DMPlexView_Ascii_Geometry" 192731e8ddeSMatthew G. Knepley PetscErrorCode DMPlexView_Ascii_Geometry(DM dm, PetscViewer viewer) 193731e8ddeSMatthew G. Knepley { 194731e8ddeSMatthew G. Knepley PetscSection coordSection; 195731e8ddeSMatthew G. Knepley Vec coordinates; 196731e8ddeSMatthew G. Knepley DMLabel depthLabel; 197731e8ddeSMatthew G. Knepley const char *name[4]; 198731e8ddeSMatthew G. Knepley const PetscScalar *a; 199731e8ddeSMatthew G. Knepley PetscInt dim, pStart, pEnd, cStart, cEnd, c; 200731e8ddeSMatthew G. Knepley PetscErrorCode ierr; 201731e8ddeSMatthew G. Knepley 202731e8ddeSMatthew G. Knepley PetscFunctionBegin; 203731e8ddeSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 204731e8ddeSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 205731e8ddeSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 206731e8ddeSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr); 207731e8ddeSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 208731e8ddeSMatthew G. Knepley ierr = PetscSectionGetChart(coordSection, &pStart, &pEnd);CHKERRQ(ierr); 209731e8ddeSMatthew G. Knepley ierr = VecGetArrayRead(coordinates, &a);CHKERRQ(ierr); 210731e8ddeSMatthew G. Knepley name[0] = "vertex"; 211731e8ddeSMatthew G. Knepley name[1] = "edge"; 212731e8ddeSMatthew G. Knepley name[dim-1] = "face"; 213731e8ddeSMatthew G. Knepley name[dim] = "cell"; 214731e8ddeSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 215731e8ddeSMatthew G. Knepley PetscInt *closure = NULL; 216731e8ddeSMatthew G. Knepley PetscInt closureSize, cl; 217731e8ddeSMatthew G. Knepley 218731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "Geometry for cell %d:\n", c);CHKERRQ(ierr); 219731e8ddeSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 220731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPushTab(viewer);CHKERRQ(ierr); 221731e8ddeSMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 222731e8ddeSMatthew G. Knepley PetscInt point = closure[cl], depth, dof, off, d, p; 223731e8ddeSMatthew G. Knepley 224731e8ddeSMatthew G. Knepley if ((point < pStart) || (point >= pEnd)) continue; 225731e8ddeSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, point, &dof);CHKERRQ(ierr); 226731e8ddeSMatthew G. Knepley if (!dof) continue; 227731e8ddeSMatthew G. Knepley ierr = DMLabelGetValue(depthLabel, point, &depth);CHKERRQ(ierr); 228731e8ddeSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, point, &off);CHKERRQ(ierr); 229731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%s %d coords:", name[depth], point);CHKERRQ(ierr); 230731e8ddeSMatthew G. Knepley for (p = 0; p < dof/dim; ++p) { 231731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (");CHKERRQ(ierr); 232731e8ddeSMatthew G. Knepley for (d = 0; d < dim; ++d) { 233731e8ddeSMatthew G. Knepley if (d > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 23441477eefSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%g", PetscRealPart(a[off+p*dim+d]));CHKERRQ(ierr); 235731e8ddeSMatthew G. Knepley } 236731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, ")");CHKERRQ(ierr); 237731e8ddeSMatthew G. Knepley } 238731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 239731e8ddeSMatthew G. Knepley } 240731e8ddeSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 241731e8ddeSMatthew G. Knepley ierr = PetscViewerASCIIPopTab(viewer);CHKERRQ(ierr); 242731e8ddeSMatthew G. Knepley } 243731e8ddeSMatthew G. Knepley ierr = VecRestoreArrayRead(coordinates, &a);CHKERRQ(ierr); 244731e8ddeSMatthew G. Knepley PetscFunctionReturn(0); 245731e8ddeSMatthew G. Knepley } 246731e8ddeSMatthew G. Knepley 247731e8ddeSMatthew G. Knepley #undef __FUNCT__ 248552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 249552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 250552f7358SJed Brown { 251552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 252552f7358SJed Brown DM cdm; 253552f7358SJed Brown DMLabel markers; 254552f7358SJed Brown PetscSection coordSection; 255552f7358SJed Brown Vec coordinates; 256552f7358SJed Brown PetscViewerFormat format; 257552f7358SJed Brown PetscErrorCode ierr; 258552f7358SJed Brown 259552f7358SJed Brown PetscFunctionBegin; 260552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 261552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 262552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 263552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 264552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 265552f7358SJed Brown const char *name; 266552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 267552f7358SJed Brown PetscInt pStart, pEnd, p; 268552f7358SJed Brown PetscMPIInt rank, size; 269552f7358SJed Brown 27082f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 27182f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 272552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 273552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 274552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 275552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 276552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 277552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 278552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 279552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 280552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 281552f7358SJed Brown PetscInt dof, off, s; 282552f7358SJed Brown 283552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 284552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 285552f7358SJed Brown for (s = off; s < off+dof; ++s) { 286552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 287552f7358SJed Brown } 288552f7358SJed Brown } 289552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 290552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 291552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 292552f7358SJed Brown PetscInt dof, off, c; 293552f7358SJed Brown 294552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 295552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 296552f7358SJed Brown for (c = off; c < off+dof; ++c) { 297552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 298552f7358SJed Brown } 299552f7358SJed Brown } 300552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 3010298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 302552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 303552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 304552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 305552f7358SJed Brown if (size > 1) { 306552f7358SJed Brown PetscSF sf; 307552f7358SJed Brown 308552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 309552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 310552f7358SJed Brown } 311552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 312552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 3130588280cSMatthew G. Knepley const char *name, *color; 3140588280cSMatthew G. Knepley const char *defcolors[3] = {"gray", "orange", "green"}; 3150588280cSMatthew G. Knepley const char *deflcolors[4] = {"blue", "cyan", "red", "magenta"}; 316552f7358SJed Brown PetscReal scale = 2.0; 3170588280cSMatthew G. Knepley PetscBool useNumbers = PETSC_TRUE, useLabels, useColors; 3180588280cSMatthew G. Knepley double tcoords[3]; 319552f7358SJed Brown PetscScalar *coords; 3200588280cSMatthew G. Knepley PetscInt numLabels, l, numColors, numLColors, dim, depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 321552f7358SJed Brown PetscMPIInt rank, size; 3220588280cSMatthew G. Knepley char **names, **colors, **lcolors; 323552f7358SJed Brown 3240588280cSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 325552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3260588280cSMatthew G. Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 3270588280cSMatthew G. Knepley numLabels = PetscMax(numLabels, 10); 3280588280cSMatthew G. Knepley numColors = 10; 3290588280cSMatthew G. Knepley numLColors = 10; 3300588280cSMatthew G. Knepley ierr = PetscCalloc3(numLabels, &names, numColors, &colors, numLColors, &lcolors);CHKERRQ(ierr); 3310588280cSMatthew G. Knepley ierr = PetscOptionsGetReal(((PetscObject) viewer)->prefix, "-dm_plex_view_scale", &scale, NULL);CHKERRQ(ierr); 3320588280cSMatthew G. Knepley ierr = PetscOptionsGetBool(((PetscObject) viewer)->prefix, "-dm_plex_view_numbers", &useNumbers, NULL);CHKERRQ(ierr); 3330588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_labels", names, &numLabels, &useLabels);CHKERRQ(ierr); 3340588280cSMatthew G. Knepley if (!useLabels) numLabels = 0; 3350588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_colors", colors, &numColors, &useColors);CHKERRQ(ierr); 3360588280cSMatthew G. Knepley if (!useColors) { 3370588280cSMatthew G. Knepley numColors = 3; 3380588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscStrallocpy(defcolors[c], &colors[c]);CHKERRQ(ierr);} 3390588280cSMatthew G. Knepley } 3400588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_lcolors", lcolors, &numLColors, &useColors);CHKERRQ(ierr); 3410588280cSMatthew G. Knepley if (!useColors) { 3420588280cSMatthew G. Knepley numLColors = 4; 3430588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscStrallocpy(deflcolors[c], &lcolors[c]);CHKERRQ(ierr);} 3440588280cSMatthew G. Knepley } 34582f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 34682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 347552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 348552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 349770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 3500588280cSMatthew G. Knepley \\documentclass[tikz]{standalone}\n\n\ 351552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 352552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 353552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 3540588280cSMatthew G. Knepley \\begin{document}\n");CHKERRQ(ierr); 3550588280cSMatthew G. Knepley if (size > 1) { 356f738dd31SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%s for process ", name);CHKERRQ(ierr); 357770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 358770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 359770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 360770b213bSMatthew G Knepley } else if (p > 0) { 361770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 362770b213bSMatthew G Knepley } 363770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 364770b213bSMatthew G Knepley } 3650588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n");CHKERRQ(ierr); 3660588280cSMatthew G. Knepley } 3670588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n", 1.0);CHKERRQ(ierr); 368552f7358SJed Brown /* Plot vertices */ 369552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 370552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 371552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 372552f7358SJed Brown PetscInt off, dof, d; 3730588280cSMatthew G. Knepley PetscBool isLabeled = PETSC_FALSE; 374552f7358SJed Brown 375552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 376552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3770588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\path (");CHKERRQ(ierr); 3780588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 3790588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[off+d])); 3800588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 3810588280cSMatthew G. Knepley } 3820588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 3830588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 384552f7358SJed Brown for (d = 0; d < dof; ++d) { 385552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3860588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 387552f7358SJed Brown } 3880588280cSMatthew G. Knepley color = colors[rank%numColors]; 3890588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 3900588280cSMatthew G. Knepley PetscInt val; 3910588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 3920588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; isLabeled = PETSC_TRUE; break;} 3930588280cSMatthew G. Knepley } 3940588280cSMatthew G. Knepley if (useNumbers) { 3950588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D};\n", v, rank, color, v);CHKERRQ(ierr); 3960588280cSMatthew G. Knepley } else { 3970588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [fill,inner sep=%dpt,shape=circle,color=%s] {};\n", v, rank, !isLabeled ? 1 : 2, color);CHKERRQ(ierr); 3980588280cSMatthew G. Knepley } 399552f7358SJed Brown } 400552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 401552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 402552f7358SJed Brown /* Plot edges */ 4030588280cSMatthew G. Knepley if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 4040588280cSMatthew G. Knepley if (dim < 3 && useNumbers) { 405552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 406552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 407552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 408552f7358SJed Brown const PetscInt *cone; 409552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 410552f7358SJed Brown 411552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 41282f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 413552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 414552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 415552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 416552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 417552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 418552f7358SJed Brown for (d = 0; d < dof; ++d) { 4190588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[offA+d]+coords[offB+d])); 4200588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 421552f7358SJed Brown } 4220588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 4230588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 4240588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 4250588280cSMatthew G. Knepley if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 4260588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 4270588280cSMatthew G. Knepley } 4280588280cSMatthew G. Knepley color = colors[rank%numColors]; 4290588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 4300588280cSMatthew G. Knepley PetscInt val; 4310588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 4320750fff4SMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 4330588280cSMatthew G. Knepley } 4340588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, color, e);CHKERRQ(ierr); 435552f7358SJed Brown } 436552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 437552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 438552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 4390588280cSMatthew G. Knepley } 440552f7358SJed Brown /* Plot cells */ 4410588280cSMatthew G. Knepley if (dim == 3 || !useNumbers) { 4420588280cSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 4430588280cSMatthew G. Knepley const PetscInt *cone; 4440588280cSMatthew G. Knepley 4450588280cSMatthew G. Knepley color = colors[rank%numColors]; 4460588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 4470588280cSMatthew G. Knepley PetscInt val; 4480588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], e, &val);CHKERRQ(ierr); 4490588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 4500588280cSMatthew G. Knepley } 4510588280cSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 4520588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] (%D_%D) -- (%D_%D);\n", color, cone[0], rank, cone[1], rank);CHKERRQ(ierr); 4530588280cSMatthew G. Knepley } 4540588280cSMatthew G. Knepley } else { 455552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 456552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4570298fd71SBarry Smith PetscInt *closure = NULL; 458552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 459552f7358SJed Brown 460552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 461552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 462552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 463552f7358SJed Brown const PetscInt point = closure[p]; 464552f7358SJed Brown 465552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 466552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 467552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 468552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 469552f7358SJed Brown } 470552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 471552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 472552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 473552f7358SJed Brown } 4740588280cSMatthew G. Knepley } 475552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 4760588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n");CHKERRQ(ierr); 477770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 4780588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) {ierr = PetscFree(names[l]);CHKERRQ(ierr);} 4790588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscFree(colors[c]);CHKERRQ(ierr);} 4800588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscFree(lcolors[c]);CHKERRQ(ierr);} 4810588280cSMatthew G. Knepley ierr = PetscFree3(names, colors, lcolors);CHKERRQ(ierr); 482552f7358SJed Brown } else { 48382f516ccSBarry Smith MPI_Comm comm; 484834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 485834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 486552f7358SJed Brown PetscInt pStart, pEnd, p; 487a57dd577SMatthew G Knepley PetscInt numLabels, l; 4881143a3c0SMatthew G. Knepley const char *name; 489552f7358SJed Brown PetscMPIInt size; 490552f7358SJed Brown 49182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 492552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 493c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4945f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 4951143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 4961143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 497552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 498552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 499bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 500dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 501552f7358SJed Brown if (depth == 1) { 502552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 503552f7358SJed Brown pEnd = pEnd - pStart; 504552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 505552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 506552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 507552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 508552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 509552f7358SJed Brown pEnd = pEnd - pStart; 510552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 511552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 512552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 513552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 514552f7358SJed Brown } else { 515552f7358SJed Brown for (d = 0; d <= dim; d++) { 516552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 517834065abSMatthew G. Knepley pEnd -= pStart; 518834065abSMatthew G. Knepley pMax[d] -= pStart; 519552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 520834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 521552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 522834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 523834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 524834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 525834065abSMatthew G. Knepley } 526552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 527552f7358SJed Brown } 528552f7358SJed Brown } 529834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 530a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 531a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 532a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 533a57dd577SMatthew G Knepley DMLabel label; 534a57dd577SMatthew G Knepley const char *name; 535a57dd577SMatthew G Knepley IS valueIS; 536a57dd577SMatthew G Knepley const PetscInt *values; 537a57dd577SMatthew G Knepley PetscInt numValues, v; 538a57dd577SMatthew G Knepley 539a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 540a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 541a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 542a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 543a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 544a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 545a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 546a57dd577SMatthew G Knepley PetscInt size; 547a57dd577SMatthew G Knepley 548a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 549a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 550a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 551a57dd577SMatthew G Knepley } 552a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 553a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 5544d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 555a57dd577SMatthew G Knepley } 556552f7358SJed Brown } 557552f7358SJed Brown PetscFunctionReturn(0); 558552f7358SJed Brown } 559552f7358SJed Brown 560552f7358SJed Brown #undef __FUNCT__ 561552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 562552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 563552f7358SJed Brown { 564fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 565552f7358SJed Brown PetscErrorCode ierr; 566552f7358SJed Brown 567552f7358SJed Brown PetscFunctionBegin; 568552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 569552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 570552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 571fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 572c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 573552f7358SJed Brown if (iascii) { 574552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 575c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 576c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 5777afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 578c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 5797afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 580c6ccd67eSMatthew G. Knepley #else 581c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 582552f7358SJed Brown #endif 58311aeaf0aSBarry Smith } 584fcf6c8fdSToby Isaac else if (isvtk) { 585fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 586fcf6c8fdSToby Isaac } 587552f7358SJed Brown PetscFunctionReturn(0); 588552f7358SJed Brown } 589552f7358SJed Brown 5902c40f234SMatthew G. Knepley #undef __FUNCT__ 5912c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 5922c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 5932c40f234SMatthew G. Knepley { 5942c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 5952c40f234SMatthew G. Knepley PetscErrorCode ierr; 5962c40f234SMatthew G. Knepley 5972c40f234SMatthew G. Knepley PetscFunctionBegin; 5982c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5992c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 6002c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 6012c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 6022c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 6032c40f234SMatthew G. Knepley else if (ishdf5) { 6042c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 60510b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 6062c40f234SMatthew G. Knepley #else 6072c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 608552f7358SJed Brown #endif 609552f7358SJed Brown } 610552f7358SJed Brown PetscFunctionReturn(0); 611552f7358SJed Brown } 612552f7358SJed Brown 613552f7358SJed Brown #undef __FUNCT__ 6146c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 6156c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 6166c73c22cSMatthew G. Knepley { 6176c73c22cSMatthew G. Knepley DMBoundary b, next; 6186c73c22cSMatthew G. Knepley PetscErrorCode ierr; 6196c73c22cSMatthew G. Knepley 6208e136ac0SMatthew G. Knepley PetscFunctionBegin; 6216c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 6226c73c22cSMatthew G. Knepley b = *boundary; 6236c73c22cSMatthew G. Knepley *boundary = NULL; 6246c73c22cSMatthew G. Knepley for (; b; b = next) { 6256c73c22cSMatthew G. Knepley next = b->next; 6266c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 6276c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 62863d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 6296c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 6306c73c22cSMatthew G. Knepley } 6316c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 6326c73c22cSMatthew G. Knepley } 6336c73c22cSMatthew G. Knepley 6346c73c22cSMatthew G. Knepley #undef __FUNCT__ 635552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 636552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 637552f7358SJed Brown { 638552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 639a85475f2SMatthew G. Knepley PlexLabel next = mesh->labels; 640552f7358SJed Brown PetscErrorCode ierr; 641552f7358SJed Brown 642552f7358SJed Brown PetscFunctionBegin; 6430d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 644552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 645552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 646552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 647552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 648552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 649552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 650d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->tetgenOpts);CHKERRQ(ierr); 651d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->triangleOpts);CHKERRQ(ierr); 65277623264SMatthew G. Knepley ierr = PetscPartitionerDestroy(&mesh->partitioner);CHKERRQ(ierr); 653552f7358SJed Brown while (next) { 654a85475f2SMatthew G. Knepley PlexLabel tmp = next->next; 655552f7358SJed Brown 656a85475f2SMatthew G. Knepley ierr = DMLabelDestroy(&next->label);CHKERRQ(ierr); 657a85475f2SMatthew G. Knepley ierr = PetscFree(next);CHKERRQ(ierr); 658552f7358SJed Brown next = tmp; 659552f7358SJed Brown } 6603913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 661a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 662552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 663552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 6646c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 665a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 666a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 667d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr); 668d961a43aSToby Isaac ierr = PetscFree(mesh->parents);CHKERRQ(ierr); 669d961a43aSToby Isaac ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr); 670d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr); 671d961a43aSToby Isaac ierr = PetscFree(mesh->children);CHKERRQ(ierr); 672d6a7ad0dSToby Isaac ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr); 673552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 674552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 675552f7358SJed Brown PetscFunctionReturn(0); 676552f7358SJed Brown } 677552f7358SJed Brown 678552f7358SJed Brown #undef __FUNCT__ 679552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 680b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 681552f7358SJed Brown { 682552f7358SJed Brown PetscSection section, sectionGlobal; 683552f7358SJed Brown PetscInt bs = -1; 684552f7358SJed Brown PetscInt localSize; 68589545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 686552f7358SJed Brown PetscErrorCode ierr; 687b412c318SBarry Smith MatType mtype; 6881428887cSShri Abhyankar ISLocalToGlobalMapping ltog; 689552f7358SJed Brown 690552f7358SJed Brown PetscFunctionBegin; 691607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 692b412c318SBarry Smith mtype = dm->mattype; 693552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 694552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 695552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 696552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 69782f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 698552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 699552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 700552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 701552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 702552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 703552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 704552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 705552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 706552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 707552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 708552f7358SJed Brown if (!isShell) { 709552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 7102a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 711552f7358SJed Brown 712552f7358SJed Brown if (bs < 0) { 713552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 714fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 715552f7358SJed Brown 716552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 717552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 718552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 719fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 720fad22124SMatthew G Knepley if (dof-cdof) { 7212a28c762SMatthew G Knepley if (bs < 0) { 722fad22124SMatthew G Knepley bs = dof-cdof; 723fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 7242a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 7252a28c762SMatthew G Knepley bs = 1; 726552f7358SJed Brown break; 727552f7358SJed Brown } 728552f7358SJed Brown } 7292a28c762SMatthew G Knepley } 7302a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 7312a28c762SMatthew G Knepley bsLocal = bs; 73282f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 7332a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 73482f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 7352a28c762SMatthew G Knepley if (bsMin != bsMax) { 7362a28c762SMatthew G Knepley bs = 1; 7372a28c762SMatthew G Knepley } else { 7382a28c762SMatthew G Knepley bs = bsMax; 7392a28c762SMatthew G Knepley } 740552f7358SJed Brown } else { 741552f7358SJed Brown bs = 1; 742552f7358SJed Brown } 743552f7358SJed Brown } 7441795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 745552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 746552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 7471428887cSShri Abhyankar 7481428887cSShri Abhyankar /* Set localtoglobalmapping on the matrix for MatSetValuesLocal() to work */ 7491428887cSShri Abhyankar ierr = DMGetLocalToGlobalMapping(dm,<og);CHKERRQ(ierr); 7501428887cSShri Abhyankar ierr = MatSetLocalToGlobalMapping(*J,ltog,ltog);CHKERRQ(ierr); 751552f7358SJed Brown } 752552f7358SJed Brown PetscFunctionReturn(0); 753552f7358SJed Brown } 754552f7358SJed Brown 755552f7358SJed Brown #undef __FUNCT__ 756552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 757552f7358SJed Brown /*@ 758552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 759552f7358SJed Brown 760552f7358SJed Brown Not collective 761552f7358SJed Brown 762552f7358SJed Brown Input Parameter: 763552f7358SJed Brown . mesh - The DMPlex 764552f7358SJed Brown 765552f7358SJed Brown Output Parameters: 766552f7358SJed Brown + pStart - The first mesh point 767552f7358SJed Brown - pEnd - The upper bound for mesh points 768552f7358SJed Brown 769552f7358SJed Brown Level: beginner 770552f7358SJed Brown 771552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 772552f7358SJed Brown @*/ 773552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 774552f7358SJed Brown { 775552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 776552f7358SJed Brown PetscErrorCode ierr; 777552f7358SJed Brown 778552f7358SJed Brown PetscFunctionBegin; 779552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 780552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 781552f7358SJed Brown PetscFunctionReturn(0); 782552f7358SJed Brown } 783552f7358SJed Brown 784552f7358SJed Brown #undef __FUNCT__ 785552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 786552f7358SJed Brown /*@ 787552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 788552f7358SJed Brown 789552f7358SJed Brown Not collective 790552f7358SJed Brown 791552f7358SJed Brown Input Parameters: 792552f7358SJed Brown + mesh - The DMPlex 793552f7358SJed Brown . pStart - The first mesh point 794552f7358SJed Brown - pEnd - The upper bound for mesh points 795552f7358SJed Brown 796552f7358SJed Brown Output Parameters: 797552f7358SJed Brown 798552f7358SJed Brown Level: beginner 799552f7358SJed Brown 800552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 801552f7358SJed Brown @*/ 802552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 803552f7358SJed Brown { 804552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 805552f7358SJed Brown PetscErrorCode ierr; 806552f7358SJed Brown 807552f7358SJed Brown PetscFunctionBegin; 808552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 809552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 810552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 811552f7358SJed Brown PetscFunctionReturn(0); 812552f7358SJed Brown } 813552f7358SJed Brown 814552f7358SJed Brown #undef __FUNCT__ 815552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 816552f7358SJed Brown /*@ 817552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 818552f7358SJed Brown 819552f7358SJed Brown Not collective 820552f7358SJed Brown 821552f7358SJed Brown Input Parameters: 822552f7358SJed Brown + mesh - The DMPlex 823552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 824552f7358SJed Brown 825552f7358SJed Brown Output Parameter: 826552f7358SJed Brown . size - The cone size for point p 827552f7358SJed Brown 828552f7358SJed Brown Level: beginner 829552f7358SJed Brown 830552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 831552f7358SJed Brown @*/ 832552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 833552f7358SJed Brown { 834552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 835552f7358SJed Brown PetscErrorCode ierr; 836552f7358SJed Brown 837552f7358SJed Brown PetscFunctionBegin; 838552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 839552f7358SJed Brown PetscValidPointer(size, 3); 840552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 841552f7358SJed Brown PetscFunctionReturn(0); 842552f7358SJed Brown } 843552f7358SJed Brown 844552f7358SJed Brown #undef __FUNCT__ 845552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 846552f7358SJed Brown /*@ 847552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 848552f7358SJed Brown 849552f7358SJed Brown Not collective 850552f7358SJed Brown 851552f7358SJed Brown Input Parameters: 852552f7358SJed Brown + mesh - The DMPlex 853552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 854552f7358SJed Brown - size - The cone size for point p 855552f7358SJed Brown 856552f7358SJed Brown Output Parameter: 857552f7358SJed Brown 858552f7358SJed Brown Note: 859552f7358SJed Brown This should be called after DMPlexSetChart(). 860552f7358SJed Brown 861552f7358SJed Brown Level: beginner 862552f7358SJed Brown 863552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 864552f7358SJed Brown @*/ 865552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 866552f7358SJed Brown { 867552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 868552f7358SJed Brown PetscErrorCode ierr; 869552f7358SJed Brown 870552f7358SJed Brown PetscFunctionBegin; 871552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 872552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 8730d644c17SKarl Rupp 874552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 875552f7358SJed Brown PetscFunctionReturn(0); 876552f7358SJed Brown } 877552f7358SJed Brown 878552f7358SJed Brown #undef __FUNCT__ 879f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 880f5a469b9SMatthew G. Knepley /*@ 881f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 882f5a469b9SMatthew G. Knepley 883f5a469b9SMatthew G. Knepley Not collective 884f5a469b9SMatthew G. Knepley 885f5a469b9SMatthew G. Knepley Input Parameters: 886f5a469b9SMatthew G. Knepley + mesh - The DMPlex 887f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 888f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 889f5a469b9SMatthew G. Knepley 890f5a469b9SMatthew G. Knepley Output Parameter: 891f5a469b9SMatthew G. Knepley 892f5a469b9SMatthew G. Knepley Note: 893f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 894f5a469b9SMatthew G. Knepley 895f5a469b9SMatthew G. Knepley Level: beginner 896f5a469b9SMatthew G. Knepley 897f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 898f5a469b9SMatthew G. Knepley @*/ 899f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 900f5a469b9SMatthew G. Knepley { 901f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 902f5a469b9SMatthew G. Knepley PetscInt csize; 903f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 904f5a469b9SMatthew G. Knepley 905f5a469b9SMatthew G. Knepley PetscFunctionBegin; 906f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 907f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 908f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 909f5a469b9SMatthew G. Knepley 910f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 911f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 912f5a469b9SMatthew G. Knepley } 913f5a469b9SMatthew G. Knepley 914f5a469b9SMatthew G. Knepley #undef __FUNCT__ 915552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 916552f7358SJed Brown /*@C 917552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 918552f7358SJed Brown 919552f7358SJed Brown Not collective 920552f7358SJed Brown 921552f7358SJed Brown Input Parameters: 922552f7358SJed Brown + mesh - The DMPlex 923552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 924552f7358SJed Brown 925552f7358SJed Brown Output Parameter: 926552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 927552f7358SJed Brown 928552f7358SJed Brown Level: beginner 929552f7358SJed Brown 9303813dfbdSMatthew G Knepley Fortran Notes: 9313813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9323813dfbdSMatthew G Knepley include petsc.h90 in your code. 9333813dfbdSMatthew G Knepley 9343813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 935552f7358SJed Brown 936552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 937552f7358SJed Brown @*/ 938552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 939552f7358SJed Brown { 940552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 941552f7358SJed Brown PetscInt off; 942552f7358SJed Brown PetscErrorCode ierr; 943552f7358SJed Brown 944552f7358SJed Brown PetscFunctionBegin; 945552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 946552f7358SJed Brown PetscValidPointer(cone, 3); 947552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 948552f7358SJed Brown *cone = &mesh->cones[off]; 949552f7358SJed Brown PetscFunctionReturn(0); 950552f7358SJed Brown } 951552f7358SJed Brown 952552f7358SJed Brown #undef __FUNCT__ 953552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 954552f7358SJed Brown /*@ 955552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 956552f7358SJed Brown 957552f7358SJed Brown Not collective 958552f7358SJed Brown 959552f7358SJed Brown Input Parameters: 960552f7358SJed Brown + mesh - The DMPlex 961552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 962552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 963552f7358SJed Brown 964552f7358SJed Brown Output Parameter: 965552f7358SJed Brown 966552f7358SJed Brown Note: 967552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 968552f7358SJed Brown 969552f7358SJed Brown Level: beginner 970552f7358SJed Brown 971552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 972552f7358SJed Brown @*/ 973552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 974552f7358SJed Brown { 975552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 976552f7358SJed Brown PetscInt pStart, pEnd; 977552f7358SJed Brown PetscInt dof, off, c; 978552f7358SJed Brown PetscErrorCode ierr; 979552f7358SJed Brown 980552f7358SJed Brown PetscFunctionBegin; 981552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 982552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 983552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 984552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 985552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98682f516ccSBarry 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); 987552f7358SJed Brown for (c = 0; c < dof; ++c) { 98882f516ccSBarry 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); 989552f7358SJed Brown mesh->cones[off+c] = cone[c]; 990552f7358SJed Brown } 991552f7358SJed Brown PetscFunctionReturn(0); 992552f7358SJed Brown } 993552f7358SJed Brown 994552f7358SJed Brown #undef __FUNCT__ 995552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 996552f7358SJed Brown /*@C 997552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 998552f7358SJed Brown 999552f7358SJed Brown Not collective 1000552f7358SJed Brown 1001552f7358SJed Brown Input Parameters: 1002552f7358SJed Brown + mesh - The DMPlex 1003552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1004552f7358SJed Brown 1005552f7358SJed Brown Output Parameter: 1006552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1007552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1008552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1009552f7358SJed Brown the index of the cone point on which to start. 1010552f7358SJed Brown 1011552f7358SJed Brown Level: beginner 1012552f7358SJed Brown 10133813dfbdSMatthew G Knepley Fortran Notes: 10143813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10153813dfbdSMatthew G Knepley include petsc.h90 in your code. 10163813dfbdSMatthew G Knepley 10173813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 1018552f7358SJed Brown 1019552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 1020552f7358SJed Brown @*/ 1021552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 1022552f7358SJed Brown { 1023552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1024552f7358SJed Brown PetscInt off; 1025552f7358SJed Brown PetscErrorCode ierr; 1026552f7358SJed Brown 1027552f7358SJed Brown PetscFunctionBegin; 1028552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1029552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 1030552f7358SJed Brown { 1031552f7358SJed Brown PetscInt dof; 1032552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1033552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1034552f7358SJed Brown } 1035552f7358SJed Brown #endif 1036552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 10370d644c17SKarl Rupp 1038552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 1039552f7358SJed Brown PetscFunctionReturn(0); 1040552f7358SJed Brown } 1041552f7358SJed Brown 1042552f7358SJed Brown #undef __FUNCT__ 1043552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 1044552f7358SJed Brown /*@ 1045552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 1046552f7358SJed Brown 1047552f7358SJed Brown Not collective 1048552f7358SJed Brown 1049552f7358SJed Brown Input Parameters: 1050552f7358SJed Brown + mesh - The DMPlex 1051552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1052552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 1053552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 1054552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 1055552f7358SJed Brown the index of the cone point on which to start. 1056552f7358SJed Brown 1057552f7358SJed Brown Output Parameter: 1058552f7358SJed Brown 1059552f7358SJed Brown Note: 1060552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 1061552f7358SJed Brown 1062552f7358SJed Brown Level: beginner 1063552f7358SJed Brown 1064552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 1065552f7358SJed Brown @*/ 1066552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 1067552f7358SJed Brown { 1068552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1069552f7358SJed Brown PetscInt pStart, pEnd; 1070552f7358SJed Brown PetscInt dof, off, c; 1071552f7358SJed Brown PetscErrorCode ierr; 1072552f7358SJed Brown 1073552f7358SJed Brown PetscFunctionBegin; 1074552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1075552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 1076552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1077552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1078552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 107982f516ccSBarry 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); 1080552f7358SJed Brown for (c = 0; c < dof; ++c) { 1081552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 1082552f7358SJed Brown 1083552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 108482f516ccSBarry 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); 1085552f7358SJed Brown mesh->coneOrientations[off+c] = o; 1086552f7358SJed Brown } 1087552f7358SJed Brown PetscFunctionReturn(0); 1088552f7358SJed Brown } 1089552f7358SJed Brown 1090552f7358SJed Brown #undef __FUNCT__ 1091552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 1092552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 1093552f7358SJed Brown { 1094552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1095552f7358SJed Brown PetscInt pStart, pEnd; 1096552f7358SJed Brown PetscInt dof, off; 1097552f7358SJed Brown PetscErrorCode ierr; 1098552f7358SJed Brown 1099552f7358SJed Brown PetscFunctionBegin; 1100552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1101552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 110282f516ccSBarry 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); 110382f516ccSBarry 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); 110477c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 110577c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 110677c88f5bSMatthew 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); 1107552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 1108552f7358SJed Brown PetscFunctionReturn(0); 1109552f7358SJed Brown } 1110552f7358SJed Brown 1111552f7358SJed Brown #undef __FUNCT__ 111277c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 111377c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 111477c88f5bSMatthew G Knepley { 111577c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 111677c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 111777c88f5bSMatthew G Knepley PetscInt dof, off; 111877c88f5bSMatthew G Knepley PetscErrorCode ierr; 111977c88f5bSMatthew G Knepley 112077c88f5bSMatthew G Knepley PetscFunctionBegin; 112177c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 112277c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 112377c88f5bSMatthew 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); 112477c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 112577c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 112677c88f5bSMatthew 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); 112777c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 112877c88f5bSMatthew G Knepley PetscFunctionReturn(0); 112977c88f5bSMatthew G Knepley } 113077c88f5bSMatthew G Knepley 113177c88f5bSMatthew G Knepley #undef __FUNCT__ 1132552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1133552f7358SJed Brown /*@ 1134552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1135552f7358SJed Brown 1136552f7358SJed Brown Not collective 1137552f7358SJed Brown 1138552f7358SJed Brown Input Parameters: 1139552f7358SJed Brown + mesh - The DMPlex 1140552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1141552f7358SJed Brown 1142552f7358SJed Brown Output Parameter: 1143552f7358SJed Brown . size - The support size for point p 1144552f7358SJed Brown 1145552f7358SJed Brown Level: beginner 1146552f7358SJed Brown 1147552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1148552f7358SJed Brown @*/ 1149552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1150552f7358SJed Brown { 1151552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1152552f7358SJed Brown PetscErrorCode ierr; 1153552f7358SJed Brown 1154552f7358SJed Brown PetscFunctionBegin; 1155552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1156552f7358SJed Brown PetscValidPointer(size, 3); 1157552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1158552f7358SJed Brown PetscFunctionReturn(0); 1159552f7358SJed Brown } 1160552f7358SJed Brown 1161552f7358SJed Brown #undef __FUNCT__ 1162552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1163552f7358SJed Brown /*@ 1164552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1165552f7358SJed Brown 1166552f7358SJed Brown Not collective 1167552f7358SJed Brown 1168552f7358SJed Brown Input Parameters: 1169552f7358SJed Brown + mesh - The DMPlex 1170552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1171552f7358SJed Brown - size - The support size for point p 1172552f7358SJed Brown 1173552f7358SJed Brown Output Parameter: 1174552f7358SJed Brown 1175552f7358SJed Brown Note: 1176552f7358SJed Brown This should be called after DMPlexSetChart(). 1177552f7358SJed Brown 1178552f7358SJed Brown Level: beginner 1179552f7358SJed Brown 1180552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1181552f7358SJed Brown @*/ 1182552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1183552f7358SJed Brown { 1184552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1185552f7358SJed Brown PetscErrorCode ierr; 1186552f7358SJed Brown 1187552f7358SJed Brown PetscFunctionBegin; 1188552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1189552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 11900d644c17SKarl Rupp 1191552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1192552f7358SJed Brown PetscFunctionReturn(0); 1193552f7358SJed Brown } 1194552f7358SJed Brown 1195552f7358SJed Brown #undef __FUNCT__ 1196552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1197552f7358SJed Brown /*@C 1198552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1199552f7358SJed Brown 1200552f7358SJed Brown Not collective 1201552f7358SJed Brown 1202552f7358SJed Brown Input Parameters: 1203552f7358SJed Brown + mesh - The DMPlex 1204552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1205552f7358SJed Brown 1206552f7358SJed Brown Output Parameter: 1207552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1208552f7358SJed Brown 1209552f7358SJed Brown Level: beginner 1210552f7358SJed Brown 12113813dfbdSMatthew G Knepley Fortran Notes: 12123813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12133813dfbdSMatthew G Knepley include petsc.h90 in your code. 12143813dfbdSMatthew G Knepley 12153813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 12163813dfbdSMatthew G Knepley 1217552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1218552f7358SJed Brown @*/ 1219552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1220552f7358SJed Brown { 1221552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1222552f7358SJed Brown PetscInt off; 1223552f7358SJed Brown PetscErrorCode ierr; 1224552f7358SJed Brown 1225552f7358SJed Brown PetscFunctionBegin; 1226552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1227552f7358SJed Brown PetscValidPointer(support, 3); 1228552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1229552f7358SJed Brown *support = &mesh->supports[off]; 1230552f7358SJed Brown PetscFunctionReturn(0); 1231552f7358SJed Brown } 1232552f7358SJed Brown 1233552f7358SJed Brown #undef __FUNCT__ 1234552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1235552f7358SJed Brown /*@ 1236552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1237552f7358SJed Brown 1238552f7358SJed Brown Not collective 1239552f7358SJed Brown 1240552f7358SJed Brown Input Parameters: 1241552f7358SJed Brown + mesh - The DMPlex 1242552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1243552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1244552f7358SJed Brown 1245552f7358SJed Brown Output Parameter: 1246552f7358SJed Brown 1247552f7358SJed Brown Note: 1248552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1249552f7358SJed Brown 1250552f7358SJed Brown Level: beginner 1251552f7358SJed Brown 1252552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1253552f7358SJed Brown @*/ 1254552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1255552f7358SJed Brown { 1256552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1257552f7358SJed Brown PetscInt pStart, pEnd; 1258552f7358SJed Brown PetscInt dof, off, c; 1259552f7358SJed Brown PetscErrorCode ierr; 1260552f7358SJed Brown 1261552f7358SJed Brown PetscFunctionBegin; 1262552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1263552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1264552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1265552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1266552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 126782f516ccSBarry 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); 1268552f7358SJed Brown for (c = 0; c < dof; ++c) { 126982f516ccSBarry 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); 1270552f7358SJed Brown mesh->supports[off+c] = support[c]; 1271552f7358SJed Brown } 1272552f7358SJed Brown PetscFunctionReturn(0); 1273552f7358SJed Brown } 1274552f7358SJed Brown 1275552f7358SJed Brown #undef __FUNCT__ 1276552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1277552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1278552f7358SJed Brown { 1279552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1280552f7358SJed Brown PetscInt pStart, pEnd; 1281552f7358SJed Brown PetscInt dof, off; 1282552f7358SJed Brown PetscErrorCode ierr; 1283552f7358SJed Brown 1284552f7358SJed Brown PetscFunctionBegin; 1285552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1286552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1287552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1288552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 128982f516ccSBarry 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); 129082f516ccSBarry 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); 129182f516ccSBarry 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); 1292552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1293552f7358SJed Brown PetscFunctionReturn(0); 1294552f7358SJed Brown } 1295552f7358SJed Brown 1296552f7358SJed Brown #undef __FUNCT__ 1297552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1298552f7358SJed Brown /*@C 1299552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1300552f7358SJed Brown 1301552f7358SJed Brown Not collective 1302552f7358SJed Brown 1303552f7358SJed Brown Input Parameters: 1304552f7358SJed Brown + mesh - The DMPlex 1305552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1306552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13070298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1308552f7358SJed Brown 1309552f7358SJed Brown Output Parameters: 1310552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1311552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1312552f7358SJed Brown 1313552f7358SJed Brown Note: 13140298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1315552f7358SJed Brown 13163813dfbdSMatthew G Knepley Fortran Notes: 13173813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13183813dfbdSMatthew G Knepley include petsc.h90 in your code. 13193813dfbdSMatthew G Knepley 13203813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13213813dfbdSMatthew G Knepley 1322552f7358SJed Brown Level: beginner 1323552f7358SJed Brown 1324552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1325552f7358SJed Brown @*/ 1326552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1327552f7358SJed Brown { 1328552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1329552f7358SJed Brown PetscInt *closure, *fifo; 13300298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1331552f7358SJed Brown PetscInt tmpSize, t; 1332552f7358SJed Brown PetscInt depth = 0, maxSize; 1333552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1334552f7358SJed Brown PetscErrorCode ierr; 1335552f7358SJed Brown 1336552f7358SJed Brown PetscFunctionBegin; 1337552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1338552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1339552f7358SJed Brown /* This is only 1-level */ 1340552f7358SJed Brown if (useCone) { 1341552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1342552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1343552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1344552f7358SJed Brown } else { 1345552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1346552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1347552f7358SJed Brown } 1348bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1349bfbcdd7aSMatthew G. Knepley if (*points) { 1350bfbcdd7aSMatthew G. Knepley closure = *points; 1351bfbcdd7aSMatthew G. Knepley } else { 1352bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1353bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1354bfbcdd7aSMatthew G. Knepley } 1355bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1356bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1357bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1358bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1359bfbcdd7aSMatthew G. Knepley } 1360bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1361bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1362bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1363bfbcdd7aSMatthew G. Knepley } 136424c766afSToby Isaac { 136524c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 136624c766afSToby Isaac 136724c766afSToby Isaac c = mesh->maxConeSize; 136824c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 136924c766afSToby Isaac s = mesh->maxSupportSize; 137024c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 137124c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 137224c766afSToby Isaac } 1373bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1374bfbcdd7aSMatthew G. Knepley if (*points) { 1375bfbcdd7aSMatthew G. Knepley closure = *points; 1376bfbcdd7aSMatthew G. Knepley } else { 1377bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1378bfbcdd7aSMatthew G. Knepley } 1379bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1380552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1381552f7358SJed Brown const PetscInt cp = tmp[t]; 1382552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1383552f7358SJed Brown 1384552f7358SJed Brown closure[closureSize] = cp; 1385552f7358SJed Brown closure[closureSize+1] = co; 1386552f7358SJed Brown fifo[fifoSize] = cp; 1387552f7358SJed Brown fifo[fifoSize+1] = co; 1388552f7358SJed Brown } 1389bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1390552f7358SJed Brown while (fifoSize - fifoStart) { 1391552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1392552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1393552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1394552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1395552f7358SJed Brown 1396552f7358SJed Brown if (useCone) { 1397552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1398552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1399552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1400552f7358SJed Brown } else { 1401552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1402552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14030298fd71SBarry Smith tmpO = NULL; 1404552f7358SJed Brown } 1405552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1406552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1407552f7358SJed Brown const PetscInt cp = tmp[i]; 14082e1b13c2SMatthew 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. */ 14092e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14102e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14112e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1412552f7358SJed Brown PetscInt c; 1413552f7358SJed Brown 14142e1b13c2SMatthew G. Knepley if (rev) { 14152e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 14162e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14172e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14182e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14192e1b13c2SMatthew G. Knepley } 1420552f7358SJed Brown /* Check for duplicate */ 1421552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1422552f7358SJed Brown if (closure[c] == cp) break; 1423552f7358SJed Brown } 1424552f7358SJed Brown if (c == closureSize) { 1425552f7358SJed Brown closure[closureSize] = cp; 1426552f7358SJed Brown closure[closureSize+1] = co; 1427552f7358SJed Brown fifo[fifoSize] = cp; 1428552f7358SJed Brown fifo[fifoSize+1] = co; 1429552f7358SJed Brown closureSize += 2; 1430552f7358SJed Brown fifoSize += 2; 1431552f7358SJed Brown } 1432552f7358SJed Brown } 1433552f7358SJed Brown fifoStart += 2; 1434552f7358SJed Brown } 1435552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1436552f7358SJed Brown if (points) *points = closure; 1437552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1438552f7358SJed Brown PetscFunctionReturn(0); 1439552f7358SJed Brown } 1440552f7358SJed Brown 1441552f7358SJed Brown #undef __FUNCT__ 14429bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 14439bf0dad6SMatthew G. Knepley /*@C 14449bf0dad6SMatthew 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 14459bf0dad6SMatthew G. Knepley 14469bf0dad6SMatthew G. Knepley Not collective 14479bf0dad6SMatthew G. Knepley 14489bf0dad6SMatthew G. Knepley Input Parameters: 14499bf0dad6SMatthew G. Knepley + mesh - The DMPlex 14509bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 14519bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 14529bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 14539bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 14549bf0dad6SMatthew G. Knepley 14559bf0dad6SMatthew G. Knepley Output Parameters: 14569bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 14579bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 14589bf0dad6SMatthew G. Knepley 14599bf0dad6SMatthew G. Knepley Note: 14609bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 14619bf0dad6SMatthew G. Knepley 14629bf0dad6SMatthew G. Knepley Fortran Notes: 14639bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14649bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 14659bf0dad6SMatthew G. Knepley 14669bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14679bf0dad6SMatthew G. Knepley 14689bf0dad6SMatthew G. Knepley Level: beginner 14699bf0dad6SMatthew G. Knepley 14709bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 14719bf0dad6SMatthew G. Knepley @*/ 14729bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 14739bf0dad6SMatthew G. Knepley { 14749bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 14759bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 14769bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 14779bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 14789bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 14799bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 14809bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 14819bf0dad6SMatthew G. Knepley 14829bf0dad6SMatthew G. Knepley PetscFunctionBegin; 14839bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14849bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 14859bf0dad6SMatthew G. Knepley /* This is only 1-level */ 14869bf0dad6SMatthew G. Knepley if (useCone) { 14879bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 14889bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 14899bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 14909bf0dad6SMatthew G. Knepley } else { 14919bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 14929bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 14939bf0dad6SMatthew G. Knepley } 14949bf0dad6SMatthew G. Knepley if (depth == 1) { 14959bf0dad6SMatthew G. Knepley if (*points) { 14969bf0dad6SMatthew G. Knepley closure = *points; 14979bf0dad6SMatthew G. Knepley } else { 14989bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 14999bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 15009bf0dad6SMatthew G. Knepley } 15019bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 15029bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 15039bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 15049bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 15059bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 15069bf0dad6SMatthew G. Knepley } 15079bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15089bf0dad6SMatthew G. Knepley if (points) *points = closure; 15099bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15109bf0dad6SMatthew G. Knepley } 151124c766afSToby Isaac { 151224c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 151324c766afSToby Isaac 151424c766afSToby Isaac c = mesh->maxConeSize; 151524c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 151624c766afSToby Isaac s = mesh->maxSupportSize; 151724c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 151824c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 151924c766afSToby Isaac } 15209bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15219bf0dad6SMatthew G. Knepley if (*points) { 15229bf0dad6SMatthew G. Knepley closure = *points; 15239bf0dad6SMatthew G. Knepley } else { 15249bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 15259bf0dad6SMatthew G. Knepley } 15269bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 15279bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 15289bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 15299bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15309bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15319bf0dad6SMatthew G. Knepley 15329bf0dad6SMatthew G. Knepley if (ornt < 0) { 15339bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15349bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15359bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15369bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15379bf0dad6SMatthew G. Knepley } 15389bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15399bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15409bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15419bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15429bf0dad6SMatthew G. Knepley } 15439bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 15449bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 15459bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 15469bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 15479bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 15489bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 15499bf0dad6SMatthew G. Knepley 15509bf0dad6SMatthew G. Knepley if (useCone) { 15519bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 15529bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 15539bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 15549bf0dad6SMatthew G. Knepley } else { 15559bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 15569bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 15579bf0dad6SMatthew G. Knepley tmpO = NULL; 15589bf0dad6SMatthew G. Knepley } 15599bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 15609bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 15619bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15629bf0dad6SMatthew 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. */ 15639bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 15649bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 15659bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15669bf0dad6SMatthew G. Knepley PetscInt c; 15679bf0dad6SMatthew G. Knepley 15689bf0dad6SMatthew G. Knepley if (rev) { 15699bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15709bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15719bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15729bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15739bf0dad6SMatthew G. Knepley } 15749bf0dad6SMatthew G. Knepley /* Check for duplicate */ 15759bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 15769bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 15779bf0dad6SMatthew G. Knepley } 15789bf0dad6SMatthew G. Knepley if (c == closureSize) { 15799bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15809bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15819bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15829bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15839bf0dad6SMatthew G. Knepley closureSize += 2; 15849bf0dad6SMatthew G. Knepley fifoSize += 2; 15859bf0dad6SMatthew G. Knepley } 15869bf0dad6SMatthew G. Knepley } 15879bf0dad6SMatthew G. Knepley fifoStart += 2; 15889bf0dad6SMatthew G. Knepley } 15899bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15909bf0dad6SMatthew G. Knepley if (points) *points = closure; 15919bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15929bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15939bf0dad6SMatthew G. Knepley } 15949bf0dad6SMatthew G. Knepley 15959bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1596552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1597552f7358SJed Brown /*@C 1598552f7358SJed 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 1599552f7358SJed Brown 1600552f7358SJed Brown Not collective 1601552f7358SJed Brown 1602552f7358SJed Brown Input Parameters: 1603552f7358SJed Brown + mesh - The DMPlex 1604552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1605552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1606e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1607e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1608552f7358SJed Brown 1609552f7358SJed Brown Note: 16100298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1611552f7358SJed Brown 16123813dfbdSMatthew G Knepley Fortran Notes: 16133813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16143813dfbdSMatthew G Knepley include petsc.h90 in your code. 16153813dfbdSMatthew G Knepley 16163813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16173813dfbdSMatthew G Knepley 1618552f7358SJed Brown Level: beginner 1619552f7358SJed Brown 1620552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1621552f7358SJed Brown @*/ 1622552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1623552f7358SJed Brown { 1624552f7358SJed Brown PetscErrorCode ierr; 1625552f7358SJed Brown 1626552f7358SJed Brown PetscFunctionBegin; 1627552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1628e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1629e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1630552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 16314ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1632552f7358SJed Brown PetscFunctionReturn(0); 1633552f7358SJed Brown } 1634552f7358SJed Brown 1635552f7358SJed Brown #undef __FUNCT__ 1636552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1637552f7358SJed Brown /*@ 1638552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1639552f7358SJed Brown 1640552f7358SJed Brown Not collective 1641552f7358SJed Brown 1642552f7358SJed Brown Input Parameter: 1643552f7358SJed Brown . mesh - The DMPlex 1644552f7358SJed Brown 1645552f7358SJed Brown Output Parameters: 1646552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1647552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1648552f7358SJed Brown 1649552f7358SJed Brown Level: beginner 1650552f7358SJed Brown 1651552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1652552f7358SJed Brown @*/ 1653552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1654552f7358SJed Brown { 1655552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1656552f7358SJed Brown 1657552f7358SJed Brown PetscFunctionBegin; 1658552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1659552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1660552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1661552f7358SJed Brown PetscFunctionReturn(0); 1662552f7358SJed Brown } 1663552f7358SJed Brown 1664552f7358SJed Brown #undef __FUNCT__ 1665552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1666552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1667552f7358SJed Brown { 1668552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1669552f7358SJed Brown PetscInt size; 1670552f7358SJed Brown PetscErrorCode ierr; 1671552f7358SJed Brown 1672552f7358SJed Brown PetscFunctionBegin; 1673552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1674552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1675552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 16761795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 16771795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1678552f7358SJed Brown if (mesh->maxSupportSize) { 1679552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1680552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 16811795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1682552f7358SJed Brown } 1683552f7358SJed Brown PetscFunctionReturn(0); 1684552f7358SJed Brown } 1685552f7358SJed Brown 1686552f7358SJed Brown #undef __FUNCT__ 1687552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1688552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1689552f7358SJed Brown { 1690552f7358SJed Brown PetscErrorCode ierr; 1691552f7358SJed Brown 1692552f7358SJed Brown PetscFunctionBegin; 16934d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 16944d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1695552f7358SJed Brown PetscFunctionReturn(0); 1696552f7358SJed Brown } 1697552f7358SJed Brown 1698552f7358SJed Brown #undef __FUNCT__ 1699552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1700552f7358SJed Brown /*@ 1701552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1702552f7358SJed Brown 1703552f7358SJed Brown Not collective 1704552f7358SJed Brown 1705552f7358SJed Brown Input Parameter: 1706552f7358SJed Brown . mesh - The DMPlex 1707552f7358SJed Brown 1708552f7358SJed Brown Output Parameter: 1709552f7358SJed Brown 1710552f7358SJed Brown Note: 1711552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1712552f7358SJed Brown 1713552f7358SJed Brown Level: beginner 1714552f7358SJed Brown 1715552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1716552f7358SJed Brown @*/ 1717552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1718552f7358SJed Brown { 1719552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1720552f7358SJed Brown PetscInt *offsets; 1721552f7358SJed Brown PetscInt supportSize; 1722552f7358SJed Brown PetscInt pStart, pEnd, p; 1723552f7358SJed Brown PetscErrorCode ierr; 1724552f7358SJed Brown 1725552f7358SJed Brown PetscFunctionBegin; 1726552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 172782f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1728552f7358SJed Brown /* Calculate support sizes */ 1729552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1730552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1731552f7358SJed Brown PetscInt dof, off, c; 1732552f7358SJed Brown 1733552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1734552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1735552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1736552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1737552f7358SJed Brown } 1738552f7358SJed Brown } 1739552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1740552f7358SJed Brown PetscInt dof; 1741552f7358SJed Brown 1742552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 17430d644c17SKarl Rupp 1744552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1745552f7358SJed Brown } 1746552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1747552f7358SJed Brown /* Calculate supports */ 1748552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 17491795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 17501795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1751552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1752552f7358SJed Brown PetscInt dof, off, c; 1753552f7358SJed Brown 1754552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1755552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1756552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1757552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1758552f7358SJed Brown PetscInt offS; 1759552f7358SJed Brown 1760552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 17610d644c17SKarl Rupp 1762552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1763552f7358SJed Brown ++offsets[q]; 1764552f7358SJed Brown } 1765552f7358SJed Brown } 1766552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1767552f7358SJed Brown PetscFunctionReturn(0); 1768552f7358SJed Brown } 1769552f7358SJed Brown 1770552f7358SJed Brown #undef __FUNCT__ 1771552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1772552f7358SJed Brown /*@ 1773552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1774552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1775552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1776552f7358SJed Brown the DAG. 1777552f7358SJed Brown 1778552f7358SJed Brown Not collective 1779552f7358SJed Brown 1780552f7358SJed Brown Input Parameter: 1781552f7358SJed Brown . mesh - The DMPlex 1782552f7358SJed Brown 1783552f7358SJed Brown Output Parameter: 1784552f7358SJed Brown 1785552f7358SJed Brown Notes: 1786150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1787150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1788150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1789150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1790552f7358SJed Brown 1791150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1792552f7358SJed Brown 1793552f7358SJed Brown Level: beginner 1794552f7358SJed Brown 1795552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1796552f7358SJed Brown @*/ 1797552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1798552f7358SJed Brown { 1799aa50250dSMatthew G. Knepley DMLabel label; 1800552f7358SJed Brown PetscInt pStart, pEnd, p; 1801552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1802552f7358SJed Brown PetscErrorCode ierr; 1803552f7358SJed Brown 1804552f7358SJed Brown PetscFunctionBegin; 1805552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1806552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1807552f7358SJed Brown /* Calculate depth */ 1808aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1809aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1810aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1811552f7358SJed Brown /* Initialize roots and count leaves */ 1812552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1813552f7358SJed Brown PetscInt coneSize, supportSize; 1814552f7358SJed Brown 1815552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1816552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1817552f7358SJed Brown if (!coneSize && supportSize) { 1818552f7358SJed Brown ++numRoots; 1819aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1820552f7358SJed Brown } else if (!supportSize && coneSize) { 1821552f7358SJed Brown ++numLeaves; 1822552f7358SJed Brown } else if (!supportSize && !coneSize) { 1823552f7358SJed Brown /* Isolated points */ 1824aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1825552f7358SJed Brown } 1826552f7358SJed Brown } 1827552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1828552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1829552f7358SJed Brown PetscInt coneSize, supportSize; 1830552f7358SJed Brown 1831552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1832552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1833552f7358SJed Brown if (!supportSize && coneSize) { 1834aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1835552f7358SJed Brown } 1836552f7358SJed Brown } 1837552f7358SJed Brown } else { 183874ef644bSMatthew G. Knepley IS pointIS; 183974ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1840552f7358SJed Brown 184174ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 184274ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 184374ef644bSMatthew G. Knepley while (numPoints) { 184474ef644bSMatthew G. Knepley const PetscInt *points; 184574ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 184674ef644bSMatthew G. Knepley 184774ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 184874ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 184974ef644bSMatthew G. Knepley const PetscInt point = points[p]; 185074ef644bSMatthew G. Knepley const PetscInt *support; 185174ef644bSMatthew G. Knepley PetscInt supportSize, s; 185274ef644bSMatthew G. Knepley 185374ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 185474ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 185574ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 185674ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1857552f7358SJed Brown } 1858552f7358SJed Brown } 18595edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 186074ef644bSMatthew G. Knepley ++level; 186174ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 186274ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 186374ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 186474ef644bSMatthew G. Knepley else {numPoints = 0;} 186574ef644bSMatthew G. Knepley } 186674ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 186774ef644bSMatthew G. Knepley } 1868552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1869552f7358SJed Brown PetscFunctionReturn(0); 1870552f7358SJed Brown } 1871552f7358SJed Brown 1872552f7358SJed Brown #undef __FUNCT__ 1873552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1874552f7358SJed Brown /*@C 1875552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1876552f7358SJed Brown 1877552f7358SJed Brown Not Collective 1878552f7358SJed Brown 1879552f7358SJed Brown Input Parameters: 1880552f7358SJed Brown + dm - The DMPlex object 1881552f7358SJed Brown . numPoints - The number of input points for the join 1882552f7358SJed Brown - points - The input points 1883552f7358SJed Brown 1884552f7358SJed Brown Output Parameters: 1885552f7358SJed Brown + numCoveredPoints - The number of points in the join 1886552f7358SJed Brown - coveredPoints - The points in the join 1887552f7358SJed Brown 1888552f7358SJed Brown Level: intermediate 1889552f7358SJed Brown 1890552f7358SJed Brown Note: Currently, this is restricted to a single level join 1891552f7358SJed Brown 18923813dfbdSMatthew G Knepley Fortran Notes: 18933813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18943813dfbdSMatthew G Knepley include petsc.h90 in your code. 18953813dfbdSMatthew G Knepley 18963813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18973813dfbdSMatthew G Knepley 1898552f7358SJed Brown .keywords: mesh 1899552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1900552f7358SJed Brown @*/ 1901552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1902552f7358SJed Brown { 1903552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1904552f7358SJed Brown PetscInt *join[2]; 1905552f7358SJed Brown PetscInt joinSize, i = 0; 1906552f7358SJed Brown PetscInt dof, off, p, c, m; 1907552f7358SJed Brown PetscErrorCode ierr; 1908552f7358SJed Brown 1909552f7358SJed Brown PetscFunctionBegin; 1910552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1911552f7358SJed Brown PetscValidPointer(points, 2); 1912552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1913552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1914552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1915552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1916552f7358SJed Brown /* Copy in support of first point */ 1917552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1918552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1919552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1920552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1921552f7358SJed Brown } 1922552f7358SJed Brown /* Check each successive support */ 1923552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1924552f7358SJed Brown PetscInt newJoinSize = 0; 1925552f7358SJed Brown 1926552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1927552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1928552f7358SJed Brown for (c = 0; c < dof; ++c) { 1929552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1930552f7358SJed Brown 1931552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1932552f7358SJed Brown if (point == join[i][m]) { 1933552f7358SJed Brown join[1-i][newJoinSize++] = point; 1934552f7358SJed Brown break; 1935552f7358SJed Brown } 1936552f7358SJed Brown } 1937552f7358SJed Brown } 1938552f7358SJed Brown joinSize = newJoinSize; 1939552f7358SJed Brown i = 1-i; 1940552f7358SJed Brown } 1941552f7358SJed Brown *numCoveredPoints = joinSize; 1942552f7358SJed Brown *coveredPoints = join[i]; 1943552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1944552f7358SJed Brown PetscFunctionReturn(0); 1945552f7358SJed Brown } 1946552f7358SJed Brown 1947552f7358SJed Brown #undef __FUNCT__ 1948552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1949552f7358SJed Brown /*@C 1950552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1951552f7358SJed Brown 1952552f7358SJed Brown Not Collective 1953552f7358SJed Brown 1954552f7358SJed Brown Input Parameters: 1955552f7358SJed Brown + dm - The DMPlex object 1956552f7358SJed Brown . numPoints - The number of input points for the join 1957552f7358SJed Brown - points - The input points 1958552f7358SJed Brown 1959552f7358SJed Brown Output Parameters: 1960552f7358SJed Brown + numCoveredPoints - The number of points in the join 1961552f7358SJed Brown - coveredPoints - The points in the join 1962552f7358SJed Brown 19633813dfbdSMatthew G Knepley Fortran Notes: 19643813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19653813dfbdSMatthew G Knepley include petsc.h90 in your code. 19663813dfbdSMatthew G Knepley 19673813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19683813dfbdSMatthew G Knepley 1969552f7358SJed Brown Level: intermediate 1970552f7358SJed Brown 1971552f7358SJed Brown .keywords: mesh 1972552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1973552f7358SJed Brown @*/ 1974552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1975552f7358SJed Brown { 1976552f7358SJed Brown PetscErrorCode ierr; 1977552f7358SJed Brown 1978552f7358SJed Brown PetscFunctionBegin; 1979552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1980d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1981d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1982d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1983552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1984d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1985552f7358SJed Brown PetscFunctionReturn(0); 1986552f7358SJed Brown } 1987552f7358SJed Brown 1988552f7358SJed Brown #undef __FUNCT__ 1989552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1990552f7358SJed Brown /*@C 1991552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1992552f7358SJed Brown 1993552f7358SJed Brown Not Collective 1994552f7358SJed Brown 1995552f7358SJed Brown Input Parameters: 1996552f7358SJed Brown + dm - The DMPlex object 1997552f7358SJed Brown . numPoints - The number of input points for the join 1998552f7358SJed Brown - points - The input points 1999552f7358SJed Brown 2000552f7358SJed Brown Output Parameters: 2001552f7358SJed Brown + numCoveredPoints - The number of points in the join 2002552f7358SJed Brown - coveredPoints - The points in the join 2003552f7358SJed Brown 20043813dfbdSMatthew G Knepley Fortran Notes: 20053813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20063813dfbdSMatthew G Knepley include petsc.h90 in your code. 20073813dfbdSMatthew G Knepley 20083813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20093813dfbdSMatthew G Knepley 2010552f7358SJed Brown Level: intermediate 2011552f7358SJed Brown 2012552f7358SJed Brown .keywords: mesh 2013552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 2014552f7358SJed Brown @*/ 2015552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2016552f7358SJed Brown { 2017552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2018552f7358SJed Brown PetscInt *offsets, **closures; 2019552f7358SJed Brown PetscInt *join[2]; 2020552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 202124c766afSToby Isaac PetscInt p, d, c, m, ms; 2022552f7358SJed Brown PetscErrorCode ierr; 2023552f7358SJed Brown 2024552f7358SJed Brown PetscFunctionBegin; 2025552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2026552f7358SJed Brown PetscValidPointer(points, 2); 2027552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2028552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2029552f7358SJed Brown 2030552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 20311795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 2032552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 203324c766afSToby Isaac ms = mesh->maxSupportSize; 203424c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 2035552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 2036552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 2037552f7358SJed Brown 2038552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2039552f7358SJed Brown PetscInt closureSize; 2040552f7358SJed Brown 2041552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 20420d644c17SKarl Rupp 2043552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 2044552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2045552f7358SJed Brown PetscInt pStart, pEnd, i; 2046552f7358SJed Brown 2047552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 2048552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 2049552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2050552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 2051552f7358SJed Brown break; 2052552f7358SJed Brown } 2053552f7358SJed Brown } 2054552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 2055552f7358SJed Brown } 205682f516ccSBarry 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); 2057552f7358SJed Brown } 2058552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2059552f7358SJed Brown PetscInt dof; 2060552f7358SJed Brown 2061552f7358SJed Brown /* Copy in support of first point */ 2062552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 2063552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 2064552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 2065552f7358SJed Brown } 2066552f7358SJed Brown /* Check each successive cone */ 2067552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 2068552f7358SJed Brown PetscInt newJoinSize = 0; 2069552f7358SJed Brown 2070552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 2071552f7358SJed Brown for (c = 0; c < dof; ++c) { 2072552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 2073552f7358SJed Brown 2074552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 2075552f7358SJed Brown if (point == join[i][m]) { 2076552f7358SJed Brown join[1-i][newJoinSize++] = point; 2077552f7358SJed Brown break; 2078552f7358SJed Brown } 2079552f7358SJed Brown } 2080552f7358SJed Brown } 2081552f7358SJed Brown joinSize = newJoinSize; 2082552f7358SJed Brown i = 1-i; 2083552f7358SJed Brown } 2084552f7358SJed Brown if (joinSize) break; 2085552f7358SJed Brown } 2086552f7358SJed Brown *numCoveredPoints = joinSize; 2087552f7358SJed Brown *coveredPoints = join[i]; 2088552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20890298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 2090552f7358SJed Brown } 2091552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2092552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2093552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 2094552f7358SJed Brown PetscFunctionReturn(0); 2095552f7358SJed Brown } 2096552f7358SJed Brown 2097552f7358SJed Brown #undef __FUNCT__ 2098552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 2099552f7358SJed Brown /*@C 2100552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 2101552f7358SJed Brown 2102552f7358SJed Brown Not Collective 2103552f7358SJed Brown 2104552f7358SJed Brown Input Parameters: 2105552f7358SJed Brown + dm - The DMPlex object 2106552f7358SJed Brown . numPoints - The number of input points for the meet 2107552f7358SJed Brown - points - The input points 2108552f7358SJed Brown 2109552f7358SJed Brown Output Parameters: 2110552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2111552f7358SJed Brown - coveredPoints - The points in the meet 2112552f7358SJed Brown 2113552f7358SJed Brown Level: intermediate 2114552f7358SJed Brown 2115552f7358SJed Brown Note: Currently, this is restricted to a single level meet 2116552f7358SJed Brown 21173813dfbdSMatthew G Knepley Fortran Notes: 21183813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21193813dfbdSMatthew G Knepley include petsc.h90 in your code. 21203813dfbdSMatthew G Knepley 21213813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21223813dfbdSMatthew G Knepley 2123552f7358SJed Brown .keywords: mesh 2124552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 2125552f7358SJed Brown @*/ 2126552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 2127552f7358SJed Brown { 2128552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2129552f7358SJed Brown PetscInt *meet[2]; 2130552f7358SJed Brown PetscInt meetSize, i = 0; 2131552f7358SJed Brown PetscInt dof, off, p, c, m; 2132552f7358SJed Brown PetscErrorCode ierr; 2133552f7358SJed Brown 2134552f7358SJed Brown PetscFunctionBegin; 2135552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2136552f7358SJed Brown PetscValidPointer(points, 2); 2137552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2138552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2139552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2140552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2141552f7358SJed Brown /* Copy in cone of first point */ 2142552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2143552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2144552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2145552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2146552f7358SJed Brown } 2147552f7358SJed Brown /* Check each successive cone */ 2148552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2149552f7358SJed Brown PetscInt newMeetSize = 0; 2150552f7358SJed Brown 2151552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2152552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2153552f7358SJed Brown for (c = 0; c < dof; ++c) { 2154552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2155552f7358SJed Brown 2156552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2157552f7358SJed Brown if (point == meet[i][m]) { 2158552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2159552f7358SJed Brown break; 2160552f7358SJed Brown } 2161552f7358SJed Brown } 2162552f7358SJed Brown } 2163552f7358SJed Brown meetSize = newMeetSize; 2164552f7358SJed Brown i = 1-i; 2165552f7358SJed Brown } 2166552f7358SJed Brown *numCoveringPoints = meetSize; 2167552f7358SJed Brown *coveringPoints = meet[i]; 2168552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2169552f7358SJed Brown PetscFunctionReturn(0); 2170552f7358SJed Brown } 2171552f7358SJed Brown 2172552f7358SJed Brown #undef __FUNCT__ 2173552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2174552f7358SJed Brown /*@C 2175552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2176552f7358SJed Brown 2177552f7358SJed Brown Not Collective 2178552f7358SJed Brown 2179552f7358SJed Brown Input Parameters: 2180552f7358SJed Brown + dm - The DMPlex object 2181552f7358SJed Brown . numPoints - The number of input points for the meet 2182552f7358SJed Brown - points - The input points 2183552f7358SJed Brown 2184552f7358SJed Brown Output Parameters: 2185552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2186552f7358SJed Brown - coveredPoints - The points in the meet 2187552f7358SJed Brown 2188552f7358SJed Brown Level: intermediate 2189552f7358SJed Brown 21903813dfbdSMatthew G Knepley Fortran Notes: 21913813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21923813dfbdSMatthew G Knepley include petsc.h90 in your code. 21933813dfbdSMatthew G Knepley 21943813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21953813dfbdSMatthew G Knepley 2196552f7358SJed Brown .keywords: mesh 2197552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2198552f7358SJed Brown @*/ 2199552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2200552f7358SJed Brown { 2201552f7358SJed Brown PetscErrorCode ierr; 2202552f7358SJed Brown 2203552f7358SJed Brown PetscFunctionBegin; 2204552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2205d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2206d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2207d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2208552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2209d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2210552f7358SJed Brown PetscFunctionReturn(0); 2211552f7358SJed Brown } 2212552f7358SJed Brown 2213552f7358SJed Brown #undef __FUNCT__ 2214552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2215552f7358SJed Brown /*@C 2216552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2217552f7358SJed Brown 2218552f7358SJed Brown Not Collective 2219552f7358SJed Brown 2220552f7358SJed Brown Input Parameters: 2221552f7358SJed Brown + dm - The DMPlex object 2222552f7358SJed Brown . numPoints - The number of input points for the meet 2223552f7358SJed Brown - points - The input points 2224552f7358SJed Brown 2225552f7358SJed Brown Output Parameters: 2226552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2227552f7358SJed Brown - coveredPoints - The points in the meet 2228552f7358SJed Brown 2229552f7358SJed Brown Level: intermediate 2230552f7358SJed Brown 22313813dfbdSMatthew G Knepley Fortran Notes: 22323813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 22333813dfbdSMatthew G Knepley include petsc.h90 in your code. 22343813dfbdSMatthew G Knepley 22353813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 22363813dfbdSMatthew G Knepley 2237552f7358SJed Brown .keywords: mesh 2238552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2239552f7358SJed Brown @*/ 2240552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2241552f7358SJed Brown { 2242552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2243552f7358SJed Brown PetscInt *offsets, **closures; 2244552f7358SJed Brown PetscInt *meet[2]; 2245552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 224624c766afSToby Isaac PetscInt p, h, c, m, mc; 2247552f7358SJed Brown PetscErrorCode ierr; 2248552f7358SJed Brown 2249552f7358SJed Brown PetscFunctionBegin; 2250552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2251552f7358SJed Brown PetscValidPointer(points, 2); 2252552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2253552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2254552f7358SJed Brown 2255552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2256785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2257552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 225824c766afSToby Isaac mc = mesh->maxConeSize; 225924c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2260552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2261552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2262552f7358SJed Brown 2263552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2264552f7358SJed Brown PetscInt closureSize; 2265552f7358SJed Brown 2266552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 22670d644c17SKarl Rupp 2268552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2269552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2270552f7358SJed Brown PetscInt pStart, pEnd, i; 2271552f7358SJed Brown 2272552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2273552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2274552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2275552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2276552f7358SJed Brown break; 2277552f7358SJed Brown } 2278552f7358SJed Brown } 2279552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2280552f7358SJed Brown } 228182f516ccSBarry 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); 2282552f7358SJed Brown } 2283552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2284552f7358SJed Brown PetscInt dof; 2285552f7358SJed Brown 2286552f7358SJed Brown /* Copy in cone of first point */ 2287552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2288552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2289552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2290552f7358SJed Brown } 2291552f7358SJed Brown /* Check each successive cone */ 2292552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2293552f7358SJed Brown PetscInt newMeetSize = 0; 2294552f7358SJed Brown 2295552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2296552f7358SJed Brown for (c = 0; c < dof; ++c) { 2297552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2298552f7358SJed Brown 2299552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2300552f7358SJed Brown if (point == meet[i][m]) { 2301552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2302552f7358SJed Brown break; 2303552f7358SJed Brown } 2304552f7358SJed Brown } 2305552f7358SJed Brown } 2306552f7358SJed Brown meetSize = newMeetSize; 2307552f7358SJed Brown i = 1-i; 2308552f7358SJed Brown } 2309552f7358SJed Brown if (meetSize) break; 2310552f7358SJed Brown } 2311552f7358SJed Brown *numCoveredPoints = meetSize; 2312552f7358SJed Brown *coveredPoints = meet[i]; 2313552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 23140298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2315552f7358SJed Brown } 2316552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2317552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2318552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2319552f7358SJed Brown PetscFunctionReturn(0); 2320552f7358SJed Brown } 2321552f7358SJed Brown 2322552f7358SJed Brown #undef __FUNCT__ 23234e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 23244e3744c5SMatthew G. Knepley /*@C 23254e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 23264e3744c5SMatthew G. Knepley 23274e3744c5SMatthew G. Knepley Not Collective 23284e3744c5SMatthew G. Knepley 23294e3744c5SMatthew G. Knepley Input Parameters: 23304e3744c5SMatthew G. Knepley + dmA - A DMPlex object 23314e3744c5SMatthew G. Knepley - dmB - A DMPlex object 23324e3744c5SMatthew G. Knepley 23334e3744c5SMatthew G. Knepley Output Parameters: 23344e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 23354e3744c5SMatthew G. Knepley 23364e3744c5SMatthew G. Knepley Level: intermediate 23374e3744c5SMatthew G. Knepley 23384e3744c5SMatthew G. Knepley Notes: 23394e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 23404e3744c5SMatthew G. Knepley 23414e3744c5SMatthew G. Knepley .keywords: mesh 23424e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 23434e3744c5SMatthew G. Knepley @*/ 23444e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 23454e3744c5SMatthew G. Knepley { 23464e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 23474e3744c5SMatthew G. Knepley PetscErrorCode ierr; 23484e3744c5SMatthew G. Knepley 23494e3744c5SMatthew G. Knepley PetscFunctionBegin; 23504e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 23514e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 23524e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 23534e3744c5SMatthew G. Knepley 23544e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 23554e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 23564e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 23574e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 23584e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 23594e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 23604e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 23614e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 23624e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 23634e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 23644e3744c5SMatthew G. Knepley 23654e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 23664e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 23674e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 23684e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 23694e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 23704e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 23714e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 23724e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 23734e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 23744e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 23754e3744c5SMatthew G. Knepley } 23764e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 23774e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 23784e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 23794e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 23804e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 23814e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 23824e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 23834e3744c5SMatthew G. Knepley } 23844e3744c5SMatthew G. Knepley } 23854e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 23864e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 23874e3744c5SMatthew G. Knepley } 23884e3744c5SMatthew G. Knepley 23894e3744c5SMatthew G. Knepley #undef __FUNCT__ 239018ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 239118ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2392a6dfd86eSKarl Rupp { 239382f516ccSBarry Smith MPI_Comm comm; 2394552f7358SJed Brown PetscErrorCode ierr; 2395552f7358SJed Brown 2396552f7358SJed Brown PetscFunctionBegin; 239782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2398552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2399552f7358SJed Brown switch (cellDim) { 2400552f7358SJed Brown case 0: 2401552f7358SJed Brown *numFaceVertices = 0; 2402552f7358SJed Brown break; 2403552f7358SJed Brown case 1: 2404552f7358SJed Brown *numFaceVertices = 1; 2405552f7358SJed Brown break; 2406552f7358SJed Brown case 2: 2407552f7358SJed Brown switch (numCorners) { 240819436ca2SJed Brown case 3: /* triangle */ 240919436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2410552f7358SJed Brown break; 241119436ca2SJed Brown case 4: /* quadrilateral */ 241219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2413552f7358SJed Brown break; 241419436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 241519436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2416552f7358SJed Brown break; 241719436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 241819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2419552f7358SJed Brown break; 2420552f7358SJed Brown default: 2421552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2422552f7358SJed Brown } 2423552f7358SJed Brown break; 2424552f7358SJed Brown case 3: 2425552f7358SJed Brown switch (numCorners) { 242619436ca2SJed Brown case 4: /* tetradehdron */ 242719436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2428552f7358SJed Brown break; 242919436ca2SJed Brown case 6: /* tet cohesive cells */ 243019436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2431552f7358SJed Brown break; 243219436ca2SJed Brown case 8: /* hexahedron */ 243319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2434552f7358SJed Brown break; 243519436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 243619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2437552f7358SJed Brown break; 243819436ca2SJed Brown case 10: /* quadratic tetrahedron */ 243919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2440552f7358SJed Brown break; 244119436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 244219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2443552f7358SJed Brown break; 244419436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 244519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2446552f7358SJed Brown break; 244719436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 244819436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2449552f7358SJed Brown break; 2450552f7358SJed Brown default: 2451552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2452552f7358SJed Brown } 2453552f7358SJed Brown break; 2454552f7358SJed Brown default: 2455552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2456552f7358SJed Brown } 2457552f7358SJed Brown PetscFunctionReturn(0); 2458552f7358SJed Brown } 2459552f7358SJed Brown 2460552f7358SJed Brown #undef __FUNCT__ 2461f05c90a3SMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate" 2462f05c90a3SMatthew G. Knepley /*@ 2463f05c90a3SMatthew 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. 2464f05c90a3SMatthew G. Knepley 2465f05c90a3SMatthew G. Knepley Input Parameters: 2466f05c90a3SMatthew G. Knepley + dm - The DM 2467f05c90a3SMatthew G. Knepley - in - The input coordinate point (dim numbers) 2468f05c90a3SMatthew G. Knepley 2469f05c90a3SMatthew G. Knepley Output Parameter: 2470f05c90a3SMatthew G. Knepley . out - The localized coordinate point 2471f05c90a3SMatthew G. Knepley 2472f05c90a3SMatthew G. Knepley Level: developer 2473f05c90a3SMatthew G. Knepley 2474f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeAddCoordinate() 2475f05c90a3SMatthew G. Knepley @*/ 2476f05c90a3SMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate(DM dm, const PetscScalar in[], PetscScalar out[]) 2477f05c90a3SMatthew G. Knepley { 2478f05c90a3SMatthew G. Knepley PetscInt dim, d; 2479f05c90a3SMatthew G. Knepley PetscErrorCode ierr; 2480f05c90a3SMatthew G. Knepley 2481f05c90a3SMatthew G. Knepley PetscFunctionBegin; 2482f05c90a3SMatthew G. Knepley ierr = DMGetCoordinateDim(dm, &dim);CHKERRQ(ierr); 2483f05c90a3SMatthew G. Knepley if (!dm->maxCell) { 2484f05c90a3SMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2485f05c90a3SMatthew G. Knepley } else { 2486f05c90a3SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2487*b61239a6SMatthew G. Knepley out[d] = in[d] - dm->L[d]*floor(PetscRealPart(in[d])/dm->L[d]); 2488f05c90a3SMatthew G. Knepley } 2489f05c90a3SMatthew G. Knepley } 2490f05c90a3SMatthew G. Knepley PetscFunctionReturn(0); 2491f05c90a3SMatthew G. Knepley } 2492f05c90a3SMatthew G. Knepley 2493f05c90a3SMatthew G. Knepley #undef __FUNCT__ 2494d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 2495f05c90a3SMatthew G. Knepley /* 2496f05c90a3SMatthew 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. 2497f05c90a3SMatthew G. Knepley 2498f05c90a3SMatthew G. Knepley Input Parameters: 2499f05c90a3SMatthew G. Knepley + dm - The DM 2500f05c90a3SMatthew G. Knepley . dim - The spatial dimension 2501f05c90a3SMatthew G. Knepley . anchor - The anchor point, the input point can be no more than maxCell away from it 2502f05c90a3SMatthew G. Knepley - in - The input coordinate point (dim numbers) 2503f05c90a3SMatthew G. Knepley 2504f05c90a3SMatthew G. Knepley Output Parameter: 2505f05c90a3SMatthew G. Knepley . out - The localized coordinate point 2506f05c90a3SMatthew G. Knepley 2507f05c90a3SMatthew G. Knepley Level: developer 2508f05c90a3SMatthew G. Knepley 2509f05c90a3SMatthew 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 2510f05c90a3SMatthew G. Knepley 2511f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeAddCoordinate() 2512f05c90a3SMatthew G. Knepley */ 2513d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2514d49fcaecSMatthew G. Knepley { 2515d49fcaecSMatthew G. Knepley PetscInt d; 2516d49fcaecSMatthew G. Knepley 2517d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2518d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2519d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2520d49fcaecSMatthew G. Knepley } else { 2521d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2522d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2523858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2524d49fcaecSMatthew G. Knepley } else { 2525d49fcaecSMatthew G. Knepley out[d] = in[d]; 2526d49fcaecSMatthew G. Knepley } 2527d49fcaecSMatthew G. Knepley } 2528d49fcaecSMatthew G. Knepley } 2529d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2530d49fcaecSMatthew G. Knepley } 2531*b61239a6SMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinateReal_Internal(DM dm, PetscInt dim, const PetscReal anchor[], const PetscReal in[], PetscReal out[]) 2532*b61239a6SMatthew G. Knepley { 2533*b61239a6SMatthew G. Knepley PetscInt d; 2534*b61239a6SMatthew G. Knepley 2535*b61239a6SMatthew G. Knepley PetscFunctionBegin; 2536*b61239a6SMatthew G. Knepley if (!dm->maxCell) { 2537*b61239a6SMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2538*b61239a6SMatthew G. Knepley } else { 2539*b61239a6SMatthew G. Knepley for (d = 0; d < dim; ++d) { 2540*b61239a6SMatthew G. Knepley if (anchor[d] - in[d] > dm->maxCell[d]) { 2541*b61239a6SMatthew G. Knepley out[d] = anchor[d] > in[d] ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2542*b61239a6SMatthew G. Knepley } else { 2543*b61239a6SMatthew G. Knepley out[d] = in[d]; 2544*b61239a6SMatthew G. Knepley } 2545*b61239a6SMatthew G. Knepley } 2546*b61239a6SMatthew G. Knepley } 2547*b61239a6SMatthew G. Knepley PetscFunctionReturn(0); 2548*b61239a6SMatthew G. Knepley } 2549d49fcaecSMatthew G. Knepley 2550d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2551d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 2552f05c90a3SMatthew G. Knepley /* 2553f05c90a3SMatthew 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. 2554f05c90a3SMatthew G. Knepley 2555f05c90a3SMatthew G. Knepley Input Parameters: 2556f05c90a3SMatthew G. Knepley + dm - The DM 2557f05c90a3SMatthew G. Knepley . dim - The spatial dimension 2558f05c90a3SMatthew G. Knepley . anchor - The anchor point, the input point can be no more than maxCell away from it 2559f05c90a3SMatthew G. Knepley . in - The input coordinate delta (dim numbers) 2560f05c90a3SMatthew G. Knepley - out - The input coordinate point (dim numbers) 2561f05c90a3SMatthew G. Knepley 2562f05c90a3SMatthew G. Knepley Output Parameter: 2563f05c90a3SMatthew G. Knepley . out - The localized coordinate in + out 2564f05c90a3SMatthew G. Knepley 2565f05c90a3SMatthew G. Knepley Level: developer 2566f05c90a3SMatthew G. Knepley 2567f05c90a3SMatthew 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 2568f05c90a3SMatthew G. Knepley 2569f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinates(), DMPlexLocalizeCoordinate() 2570f05c90a3SMatthew G. Knepley */ 2571d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2572d49fcaecSMatthew G. Knepley { 2573d49fcaecSMatthew G. Knepley PetscInt d; 2574d49fcaecSMatthew G. Knepley 2575d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2576d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2577d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 2578d49fcaecSMatthew G. Knepley } else { 2579d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2580d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2581858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2582d49fcaecSMatthew G. Knepley } else { 2583d49fcaecSMatthew G. Knepley out[d] += in[d]; 2584d49fcaecSMatthew G. Knepley } 2585d49fcaecSMatthew G. Knepley } 2586d49fcaecSMatthew G. Knepley } 2587d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2588d49fcaecSMatthew G. Knepley } 2589d49fcaecSMatthew G. Knepley 2590d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2591d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 2592f05c90a3SMatthew G. Knepley /*@ 2593f05c90a3SMatthew G. Knepley DMPlexLocalizeCoordinates - If a mesh is periodic, create local coordinates for each cell 2594f05c90a3SMatthew G. Knepley 2595f05c90a3SMatthew G. Knepley Input Parameter: 2596f05c90a3SMatthew G. Knepley . dm - The DM 2597f05c90a3SMatthew G. Knepley 2598f05c90a3SMatthew G. Knepley Level: developer 2599f05c90a3SMatthew G. Knepley 2600f05c90a3SMatthew G. Knepley .seealso: DMPlexLocalizeCoordinate(), DMPlexLocalizeAddCoordinate() 2601f05c90a3SMatthew G. Knepley @*/ 2602d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 2603d49fcaecSMatthew G. Knepley { 2604d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 2605d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 2606d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 26078c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 2608d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 2609d49fcaecSMatthew G. Knepley 2610d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2611d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2612d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 2613d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2614d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2615d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2616d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2617d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 26188c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 26198c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 26208c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 2621d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 2622d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2623d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2624d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 26258c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 2626d49fcaecSMatthew G. Knepley } 2627d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2628d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 2629d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 26308c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 2631d49fcaecSMatthew G. Knepley } 2632d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 2633d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 2634d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 2635d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 2636d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 2637d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2638d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 2639d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2640d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 2641d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2642d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2643d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2644d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 2645d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 2646d49fcaecSMatthew G. Knepley } 2647d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2648d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2649d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 2650d49fcaecSMatthew G. Knepley PetscInt b; 2651d49fcaecSMatthew G. Knepley 2652d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2653d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 2654d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 2655d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 2656d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2657d49fcaecSMatthew G. Knepley } 2658d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2659d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2660d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 266146e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 2662d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 2663d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 2664d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 2665d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2666d49fcaecSMatthew G. Knepley } 2667d49fcaecSMatthew G. Knepley 2668d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2669aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 2670552f7358SJed Brown /*@ 2671aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 2672552f7358SJed Brown 2673552f7358SJed Brown Not Collective 2674552f7358SJed Brown 2675aa50250dSMatthew G. Knepley Input Parameter: 2676552f7358SJed Brown . dm - The DMPlex object 2677552f7358SJed Brown 2678aa50250dSMatthew G. Knepley Output Parameter: 2679aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 2680552f7358SJed Brown 2681552f7358SJed Brown Level: developer 2682552f7358SJed Brown 2683aa50250dSMatthew G. Knepley .keywords: mesh, points 2684aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2685aa50250dSMatthew G. Knepley @*/ 2686aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 2687aa50250dSMatthew G. Knepley { 2688aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2689aa50250dSMatthew G. Knepley PetscErrorCode ierr; 2690aa50250dSMatthew G. Knepley 2691aa50250dSMatthew G. Knepley PetscFunctionBegin; 2692aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2693aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 269463d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 2695aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 2696aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 2697aa50250dSMatthew G. Knepley } 2698aa50250dSMatthew G. Knepley 2699aa50250dSMatthew G. Knepley #undef __FUNCT__ 2700aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 2701aa50250dSMatthew G. Knepley /*@ 2702aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 2703aa50250dSMatthew G. Knepley 2704aa50250dSMatthew G. Knepley Not Collective 2705aa50250dSMatthew G. Knepley 2706aa50250dSMatthew G. Knepley Input Parameter: 2707aa50250dSMatthew G. Knepley . dm - The DMPlex object 2708aa50250dSMatthew G. Knepley 2709aa50250dSMatthew G. Knepley Output Parameter: 2710aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 2711aa50250dSMatthew G. Knepley 2712aa50250dSMatthew G. Knepley Level: developer 2713552f7358SJed Brown 2714552f7358SJed Brown .keywords: mesh, points 2715aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2716552f7358SJed Brown @*/ 2717552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 2718552f7358SJed Brown { 2719aa50250dSMatthew G. Knepley DMLabel label; 2720aa50250dSMatthew G. Knepley PetscInt d = 0; 2721552f7358SJed Brown PetscErrorCode ierr; 2722552f7358SJed Brown 2723552f7358SJed Brown PetscFunctionBegin; 2724552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2725552f7358SJed Brown PetscValidPointer(depth, 2); 2726aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2727aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 2728552f7358SJed Brown *depth = d-1; 2729552f7358SJed Brown PetscFunctionReturn(0); 2730552f7358SJed Brown } 2731552f7358SJed Brown 2732552f7358SJed Brown #undef __FUNCT__ 2733552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 2734552f7358SJed Brown /*@ 2735552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 2736552f7358SJed Brown 2737552f7358SJed Brown Not Collective 2738552f7358SJed Brown 2739552f7358SJed Brown Input Parameters: 2740552f7358SJed Brown + dm - The DMPlex object 2741552f7358SJed Brown - stratumValue - The requested depth 2742552f7358SJed Brown 2743552f7358SJed Brown Output Parameters: 2744552f7358SJed Brown + start - The first point at this depth 2745552f7358SJed Brown - end - One beyond the last point at this depth 2746552f7358SJed Brown 2747552f7358SJed Brown Level: developer 2748552f7358SJed Brown 2749552f7358SJed Brown .keywords: mesh, points 2750552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 2751552f7358SJed Brown @*/ 27520adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 27530adebc6cSBarry Smith { 2754aa50250dSMatthew G. Knepley DMLabel label; 275563d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 2756552f7358SJed Brown PetscErrorCode ierr; 2757552f7358SJed Brown 2758552f7358SJed Brown PetscFunctionBegin; 2759552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 276063d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 276163d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2762552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 27630d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 276463d1a920SMatthew G. Knepley if (stratumValue < 0) { 276563d1a920SMatthew G. Knepley if (start) *start = pStart; 276663d1a920SMatthew G. Knepley if (end) *end = pEnd; 276763d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2768552f7358SJed Brown } 2769aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 277063d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 277163d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 2772552f7358SJed Brown PetscFunctionReturn(0); 2773552f7358SJed Brown } 2774552f7358SJed Brown 2775552f7358SJed Brown #undef __FUNCT__ 2776552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 2777552f7358SJed Brown /*@ 2778552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 2779552f7358SJed Brown 2780552f7358SJed Brown Not Collective 2781552f7358SJed Brown 2782552f7358SJed Brown Input Parameters: 2783552f7358SJed Brown + dm - The DMPlex object 2784552f7358SJed Brown - stratumValue - The requested height 2785552f7358SJed Brown 2786552f7358SJed Brown Output Parameters: 2787552f7358SJed Brown + start - The first point at this height 2788552f7358SJed Brown - end - One beyond the last point at this height 2789552f7358SJed Brown 2790552f7358SJed Brown Level: developer 2791552f7358SJed Brown 2792552f7358SJed Brown .keywords: mesh, points 2793552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 2794552f7358SJed Brown @*/ 27950adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 27960adebc6cSBarry Smith { 2797aa50250dSMatthew G. Knepley DMLabel label; 279863d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 2799552f7358SJed Brown PetscErrorCode ierr; 2800552f7358SJed Brown 2801552f7358SJed Brown PetscFunctionBegin; 2802552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 280363d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 280463d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2805552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 28060d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 280763d1a920SMatthew G. Knepley if (stratumValue < 0) { 280863d1a920SMatthew G. Knepley if (start) *start = pStart; 280963d1a920SMatthew G. Knepley if (end) *end = pEnd; 281063d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2811552f7358SJed Brown } 2812aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2813aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 281463d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 281563d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 2816552f7358SJed Brown PetscFunctionReturn(0); 2817552f7358SJed Brown } 2818552f7358SJed Brown 2819552f7358SJed Brown #undef __FUNCT__ 2820552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 2821552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 2822a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 2823a6dfd86eSKarl Rupp { 2824ee55978aSMatthew G. Knepley PetscInt *pMax; 2825916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 2826ee55978aSMatthew G. Knepley PetscInt Nf, p, d, dep, f; 2827fa716be8SMatthew G. Knepley PetscBool *isFE; 2828552f7358SJed Brown PetscErrorCode ierr; 2829552f7358SJed Brown 2830552f7358SJed Brown PetscFunctionBegin; 2831fa716be8SMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 2832ee55978aSMatthew G. Knepley ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr); 2833fa716be8SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 2834fa716be8SMatthew G. Knepley PetscObject obj; 2835fa716be8SMatthew G. Knepley PetscClassId id; 2836fa716be8SMatthew G. Knepley 2837ee55978aSMatthew G. Knepley isFE[f] = PETSC_FALSE; 2838ee55978aSMatthew G. Knepley if (f >= Nf) continue; 2839fa716be8SMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 2840fa716be8SMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 2841fa716be8SMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 2842fa716be8SMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 2843552f7358SJed Brown } 284482f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2845552f7358SJed Brown if (numFields > 0) { 2846552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 2847552f7358SJed Brown if (numComp) { 2848552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2849552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 2850552f7358SJed Brown } 2851552f7358SJed Brown } 2852552f7358SJed Brown } 2853552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2854552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 2855916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 28569ac3fadcSMatthew G. Knepley ierr = PetscMalloc1(depth+1,&pMax);CHKERRQ(ierr); 28579ac3fadcSMatthew 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); 2858916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 2859916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 2860916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 2861fa716be8SMatthew G. Knepley pMax[dep] = pMax[dep] < 0 ? pEnd : pMax[dep]; 2862552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2863ee55978aSMatthew G. Knepley PetscInt tot = 0; 2864ee55978aSMatthew G. Knepley 2865552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2866fa716be8SMatthew G. Knepley if (isFE[f] && p >= pMax[dep]) continue; 2867552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 2868ee55978aSMatthew G. Knepley tot += numDof[f*(dim+1)+d]; 2869552f7358SJed Brown } 2870ee55978aSMatthew G. Knepley ierr = PetscSectionSetDof(*section, p, tot);CHKERRQ(ierr); 2871552f7358SJed Brown } 2872552f7358SJed Brown } 28739ac3fadcSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 2874fa716be8SMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 2875552f7358SJed Brown PetscFunctionReturn(0); 2876552f7358SJed Brown } 2877552f7358SJed Brown 2878552f7358SJed Brown #undef __FUNCT__ 2879552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 2880552f7358SJed Brown /* Set the number of dof on each point and separate by fields 2881552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 2882552f7358SJed Brown */ 2883a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 2884a6dfd86eSKarl Rupp { 2885552f7358SJed Brown PetscInt numFields; 2886552f7358SJed Brown PetscInt bc; 2887a68b90caSToby Isaac PetscSection aSec; 2888552f7358SJed Brown PetscErrorCode ierr; 2889552f7358SJed Brown 2890552f7358SJed Brown PetscFunctionBegin; 2891552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2892552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 2893552f7358SJed Brown PetscInt field = 0; 2894552f7358SJed Brown const PetscInt *idx; 2895552f7358SJed Brown PetscInt n, i; 2896552f7358SJed Brown 28970d644c17SKarl Rupp if (numFields) field = bcField[bc]; 2898552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2899552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2900552f7358SJed Brown for (i = 0; i < n; ++i) { 2901552f7358SJed Brown const PetscInt p = idx[i]; 2902552f7358SJed Brown PetscInt numConst = constDof; 2903552f7358SJed Brown 2904552f7358SJed Brown /* Constrain every dof on the point */ 2905552f7358SJed Brown if (numConst < 0) { 2906552f7358SJed Brown if (numFields) { 2907552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 2908552f7358SJed Brown } else { 2909552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 2910552f7358SJed Brown } 2911552f7358SJed Brown } 2912552f7358SJed Brown if (numFields) { 2913552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 2914552f7358SJed Brown } 2915552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 2916552f7358SJed Brown } 2917552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2918552f7358SJed Brown } 2919a17985deSToby Isaac ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 2920a68b90caSToby Isaac if (aSec) { 2921a68b90caSToby Isaac PetscInt aStart, aEnd, a; 2922a68b90caSToby Isaac 2923a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 2924a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 2925a68b90caSToby Isaac PetscInt dof; 2926a68b90caSToby Isaac 2927a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 2928a68b90caSToby Isaac if (dof) { 2929a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 2930a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 2931a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 2932a68b90caSToby Isaac if (numFields) { 2933a68b90caSToby Isaac PetscInt f; 2934a68b90caSToby Isaac 2935a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 2936a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 2937a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 2938a68b90caSToby Isaac } 2939a68b90caSToby Isaac } 2940a68b90caSToby Isaac } 2941a68b90caSToby Isaac } 2942a68b90caSToby Isaac } 2943552f7358SJed Brown PetscFunctionReturn(0); 2944552f7358SJed Brown } 2945552f7358SJed Brown 2946552f7358SJed Brown #undef __FUNCT__ 2947552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 2948552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 29490adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 29500adebc6cSBarry Smith { 2951552f7358SJed Brown PetscInt *maxConstraints; 2952552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 2953552f7358SJed Brown PetscErrorCode ierr; 2954552f7358SJed Brown 2955552f7358SJed Brown PetscFunctionBegin; 2956552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2957552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2958854ce69bSBarry Smith ierr = PetscMalloc1(numFields+1, &maxConstraints);CHKERRQ(ierr); 29590d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 2960552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2961552f7358SJed Brown PetscInt cdof; 2962552f7358SJed Brown 2963552f7358SJed Brown if (numFields) { 2964552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2965552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 2966552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 2967552f7358SJed Brown } 2968552f7358SJed Brown } else { 2969552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2970552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 2971552f7358SJed Brown } 2972552f7358SJed Brown } 2973552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2974552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 2975552f7358SJed Brown } 2976552f7358SJed Brown if (maxConstraints[numFields]) { 2977552f7358SJed Brown PetscInt *indices; 2978552f7358SJed Brown 2979785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 2980552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2981552f7358SJed Brown PetscInt cdof, d; 2982552f7358SJed Brown 2983552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2984552f7358SJed Brown if (cdof) { 2985552f7358SJed Brown if (cdof > maxConstraints[numFields]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_LIB, "Likely memory corruption, point %D cDof %D > maxConstraints %D", p, cdof, maxConstraints[numFields]); 2986552f7358SJed Brown if (numFields) { 2987552f7358SJed Brown PetscInt numConst = 0, foff = 0; 2988552f7358SJed Brown 2989552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2990552f7358SJed Brown PetscInt cfdof, fdof; 2991552f7358SJed Brown 2992552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 2993552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 2994552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 29950d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 2996552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 29970d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 2998552f7358SJed Brown numConst += cfdof; 2999552f7358SJed Brown foff += fdof; 3000552f7358SJed Brown } 3001552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3002552f7358SJed Brown } else { 30030d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 3004552f7358SJed Brown } 3005552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3006552f7358SJed Brown } 3007552f7358SJed Brown } 3008552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3009552f7358SJed Brown } 3010552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 3011552f7358SJed Brown PetscFunctionReturn(0); 3012552f7358SJed Brown } 3013552f7358SJed Brown 3014552f7358SJed Brown #undef __FUNCT__ 3015552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 3016552f7358SJed Brown /* Set the constrained field indices on each point */ 30170adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 30180adebc6cSBarry Smith { 3019552f7358SJed Brown const PetscInt *points, *indices; 3020552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 3021552f7358SJed Brown PetscErrorCode ierr; 3022552f7358SJed Brown 3023552f7358SJed Brown PetscFunctionBegin; 3024552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3025552f7358SJed Brown if ((field < 0) || (field >= numFields)) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Section field %d should be in [%d, %d)", field, 0, numFields); 3026552f7358SJed Brown 3027552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 3028552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 3029552f7358SJed Brown if (!constraintIndices) { 3030552f7358SJed Brown PetscInt *idx, i; 3031552f7358SJed Brown 3032552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3033785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 30340d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 3035552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3036552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 3037552f7358SJed Brown } 3038552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 3039552f7358SJed Brown } else { 3040552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 3041552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 3042552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3043552f7358SJed Brown PetscInt fcdof; 3044552f7358SJed Brown 3045552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 304682f516ccSBarry Smith if (fcdof != numConstraints) SETERRQ4(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Section point %d field %d has %d constraints, but yo ugave %d indices", p, field, fcdof, numConstraints); 3047552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 3048552f7358SJed Brown } 3049552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 3050552f7358SJed Brown } 3051552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 3052552f7358SJed Brown PetscFunctionReturn(0); 3053552f7358SJed Brown } 3054552f7358SJed Brown 3055552f7358SJed Brown #undef __FUNCT__ 3056552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 3057552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 30580adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 30590adebc6cSBarry Smith { 3060552f7358SJed Brown PetscInt *indices; 3061552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 3062552f7358SJed Brown PetscErrorCode ierr; 3063552f7358SJed Brown 3064552f7358SJed Brown PetscFunctionBegin; 3065552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 3066785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 3067552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 306882f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 3069552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3070552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3071552f7358SJed Brown PetscInt cdof, d; 3072552f7358SJed Brown 3073552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3074552f7358SJed Brown if (cdof) { 3075552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3076552f7358SJed Brown 3077552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3078552f7358SJed Brown const PetscInt *fcind; 3079552f7358SJed Brown PetscInt fdof, fcdof; 3080552f7358SJed Brown 3081552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3082552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 3083552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 3084552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 30850d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 3086552f7358SJed Brown foff += fdof; 3087552f7358SJed Brown numConst += fcdof; 3088552f7358SJed Brown } 308982f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3090552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 3091552f7358SJed Brown } 3092552f7358SJed Brown } 3093552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 3094552f7358SJed Brown PetscFunctionReturn(0); 3095552f7358SJed Brown } 3096552f7358SJed Brown 3097552f7358SJed Brown #undef __FUNCT__ 3098552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 3099552f7358SJed Brown /*@C 3100552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 3101552f7358SJed Brown 3102552f7358SJed Brown Not Collective 3103552f7358SJed Brown 3104552f7358SJed Brown Input Parameters: 3105552f7358SJed Brown + dm - The DMPlex object 3106552f7358SJed Brown . dim - The spatial dimension of the problem 3107552f7358SJed Brown . numFields - The number of fields in the problem 3108552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 3109552f7358SJed 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 3110552f7358SJed Brown . numBC - The number of boundary conditions 3111552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 3112f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 3113f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 3114552f7358SJed Brown 3115552f7358SJed Brown Output Parameter: 3116552f7358SJed Brown . section - The PetscSection object 3117552f7358SJed Brown 3118552f7358SJed 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 3119f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 3120f8f126e8SMatthew G. Knepley 3121f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 3122552f7358SJed Brown 3123552f7358SJed Brown Level: developer 3124552f7358SJed Brown 31253813dfbdSMatthew G Knepley Fortran Notes: 31263813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 31273813dfbdSMatthew G Knepley 3128552f7358SJed Brown .keywords: mesh, elements 3129f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 3130552f7358SJed Brown @*/ 3131f8f126e8SMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], IS perm, PetscSection *section) 3132a6dfd86eSKarl Rupp { 3133a68b90caSToby Isaac PetscSection aSec; 3134552f7358SJed Brown PetscErrorCode ierr; 3135552f7358SJed Brown 3136552f7358SJed Brown PetscFunctionBegin; 3137552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 3138552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 3139f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 3140552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3141a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr); 3142a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 3143ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 3144552f7358SJed Brown PetscFunctionReturn(0); 3145552f7358SJed Brown } 3146552f7358SJed Brown 3147552f7358SJed Brown #undef __FUNCT__ 3148552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 31490adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 31500adebc6cSBarry Smith { 3151552f7358SJed Brown PetscSection section; 3152552f7358SJed Brown PetscErrorCode ierr; 3153552f7358SJed Brown 3154552f7358SJed Brown PetscFunctionBegin; 315538221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 315682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 3157552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 31581d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 3159552f7358SJed Brown PetscFunctionReturn(0); 3160552f7358SJed Brown } 3161552f7358SJed Brown 3162552f7358SJed Brown #undef __FUNCT__ 3163552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 31640adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 31650adebc6cSBarry Smith { 3166552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3167552f7358SJed Brown 3168552f7358SJed Brown PetscFunctionBegin; 3169552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3170552f7358SJed Brown if (section) *section = mesh->coneSection; 3171552f7358SJed Brown PetscFunctionReturn(0); 3172552f7358SJed Brown } 3173552f7358SJed Brown 3174552f7358SJed Brown #undef __FUNCT__ 31758cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 31768cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 31778cb4d582SMatthew G. Knepley { 31788cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 31798cb4d582SMatthew G. Knepley 31808cb4d582SMatthew G. Knepley PetscFunctionBegin; 31818cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 31828cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 31838cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 31848cb4d582SMatthew G. Knepley } 31858cb4d582SMatthew G. Knepley 31868cb4d582SMatthew G. Knepley #undef __FUNCT__ 3187552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 3188a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 3189a6dfd86eSKarl Rupp { 3190552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3191552f7358SJed Brown 3192552f7358SJed Brown PetscFunctionBegin; 3193552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3194552f7358SJed Brown if (cones) *cones = mesh->cones; 3195552f7358SJed Brown PetscFunctionReturn(0); 3196552f7358SJed Brown } 3197552f7358SJed Brown 3198552f7358SJed Brown #undef __FUNCT__ 3199552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 3200a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 3201a6dfd86eSKarl Rupp { 3202552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3203552f7358SJed Brown 3204552f7358SJed Brown PetscFunctionBegin; 3205552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3206552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 3207552f7358SJed Brown PetscFunctionReturn(0); 3208552f7358SJed Brown } 3209552f7358SJed Brown 3210552f7358SJed Brown /******************************** FEM Support **********************************/ 3211552f7358SJed Brown 3212552f7358SJed Brown #undef __FUNCT__ 32131a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 32141a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3215a6dfd86eSKarl Rupp { 3216552f7358SJed Brown PetscScalar *array, *vArray; 3217d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 32181a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 3219552f7358SJed Brown PetscErrorCode ierr; 3220552f7358SJed Brown 32211b406b76SMatthew G. Knepley PetscFunctionBeginHot; 32222a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 32235a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 32245a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 32255a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 32263f7cbbe7SMatthew G. Knepley if (!values || !*values) { 32279df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32289df71ca4SMatthew G. Knepley PetscInt dof; 3229d9917b9dSMatthew G. Knepley 32309df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32319df71ca4SMatthew G. Knepley size += dof; 32329df71ca4SMatthew G. Knepley } 32339df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32349df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32352a3aaacfSMatthew G. Knepley PetscInt dof; 32365a1bb5cfSMatthew G. Knepley 32375a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32382a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32395a1bb5cfSMatthew G. Knepley size += dof; 32405a1bb5cfSMatthew G. Knepley } 32413f7cbbe7SMatthew G. Knepley if (!values) { 32423f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 32433f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 32443f7cbbe7SMatthew G. Knepley } 32455a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 3246982e9ed1SMatthew G. Knepley } else { 3247982e9ed1SMatthew G. Knepley array = *values; 3248982e9ed1SMatthew G. Knepley } 32499df71ca4SMatthew G. Knepley size = 0; 32505a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 32519df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 32529df71ca4SMatthew G. Knepley PetscInt dof, off, d; 32539df71ca4SMatthew G. Knepley PetscScalar *varr; 3254d9917b9dSMatthew G. Knepley 32559df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 32569df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 32579df71ca4SMatthew G. Knepley varr = &vArray[off]; 32581a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32591a271a75SMatthew G. Knepley array[offset] = varr[d]; 32609df71ca4SMatthew G. Knepley } 32619df71ca4SMatthew G. Knepley size += dof; 32629df71ca4SMatthew G. Knepley } 32639df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 32649df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 32659df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 32665a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 32675a1bb5cfSMatthew G. Knepley PetscScalar *varr; 32685a1bb5cfSMatthew G. Knepley 326952ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 32705a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 32715a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 32725a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 32735a1bb5cfSMatthew G. Knepley if (o >= 0) { 32741a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 32751a271a75SMatthew G. Knepley array[offset] = varr[d]; 32765a1bb5cfSMatthew G. Knepley } 32775a1bb5cfSMatthew G. Knepley } else { 32781a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 32791a271a75SMatthew G. Knepley array[offset] = varr[d]; 32805a1bb5cfSMatthew G. Knepley } 32815a1bb5cfSMatthew G. Knepley } 32829df71ca4SMatthew G. Knepley size += dof; 32835a1bb5cfSMatthew G. Knepley } 32845a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 32859df71ca4SMatthew G. Knepley if (!*values) { 32865a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 32875a1bb5cfSMatthew G. Knepley *values = array; 32889df71ca4SMatthew G. Knepley } else { 32899df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 32908c312ff3SMatthew G. Knepley *csize = size; 32919df71ca4SMatthew G. Knepley } 32925a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 32935a1bb5cfSMatthew G. Knepley } 3294d9917b9dSMatthew G. Knepley 3295d9917b9dSMatthew G. Knepley #undef __FUNCT__ 32961a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 32971a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 32981a271a75SMatthew G. Knepley { 32991a271a75SMatthew G. Knepley PetscInt offset = 0, p; 33001a271a75SMatthew G. Knepley PetscErrorCode ierr; 33011a271a75SMatthew G. Knepley 33021a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3303fe02ba77SJed Brown *size = 0; 33041a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33051a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33061a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33071a271a75SMatthew G. Knepley PetscInt dof, off, d; 33081a271a75SMatthew G. Knepley const PetscScalar *varr; 33091a271a75SMatthew G. Knepley 33101a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 33111a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 33121a271a75SMatthew G. Knepley varr = &vArray[off]; 33131a271a75SMatthew G. Knepley if (o >= 0) { 33141a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 33151a271a75SMatthew G. Knepley } else { 33161a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 33171a271a75SMatthew G. Knepley } 33181a271a75SMatthew G. Knepley } 33191a271a75SMatthew G. Knepley *size = offset; 33201a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33211a271a75SMatthew G. Knepley } 33221a271a75SMatthew G. Knepley 33231a271a75SMatthew G. Knepley #undef __FUNCT__ 33241a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 33251a271a75SMatthew 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[]) 33261a271a75SMatthew G. Knepley { 33271a271a75SMatthew G. Knepley PetscInt offset = 0, f; 33281a271a75SMatthew G. Knepley PetscErrorCode ierr; 33291a271a75SMatthew G. Knepley 33301a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3331fe02ba77SJed Brown *size = 0; 33321a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 33331a271a75SMatthew G. Knepley PetscInt fcomp, p; 33341a271a75SMatthew G. Knepley 33351a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 33361a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 33371a271a75SMatthew G. Knepley const PetscInt point = points[p]; 33381a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 33391a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 33401a271a75SMatthew G. Knepley const PetscScalar *varr; 33411a271a75SMatthew G. Knepley 33421a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 33431a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 33441a271a75SMatthew G. Knepley varr = &vArray[foff]; 33451a271a75SMatthew G. Knepley if (o >= 0) { 33461a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 33471a271a75SMatthew G. Knepley } else { 33481a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 33491a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 33501a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 33511a271a75SMatthew G. Knepley } 33521a271a75SMatthew G. Knepley } 33531a271a75SMatthew G. Knepley } 33541a271a75SMatthew G. Knepley } 33551a271a75SMatthew G. Knepley } 33561a271a75SMatthew G. Knepley *size = offset; 33571a271a75SMatthew G. Knepley PetscFunctionReturn(0); 33581a271a75SMatthew G. Knepley } 33591a271a75SMatthew G. Knepley 33601a271a75SMatthew G. Knepley #undef __FUNCT__ 3361552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 3362552f7358SJed Brown /*@C 3363552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 3364552f7358SJed Brown 3365552f7358SJed Brown Not collective 3366552f7358SJed Brown 3367552f7358SJed Brown Input Parameters: 3368552f7358SJed Brown + dm - The DM 3369552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 3370552f7358SJed Brown . v - The local vector 3371552f7358SJed Brown - point - The sieve point in the DM 3372552f7358SJed Brown 3373552f7358SJed Brown Output Parameters: 3374552f7358SJed Brown + csize - The number of values in the closure, or NULL 3375552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3376552f7358SJed Brown 3377552f7358SJed Brown Fortran Notes: 3378552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 3379552f7358SJed Brown include petsc.h90 in your code. 3380552f7358SJed Brown 3381552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 3382552f7358SJed Brown 3383552f7358SJed Brown Level: intermediate 3384552f7358SJed Brown 3385552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3386552f7358SJed Brown @*/ 3387552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3388552f7358SJed Brown { 3389552f7358SJed Brown PetscSection clSection; 3390d9917b9dSMatthew G. Knepley IS clPoints; 3391552f7358SJed Brown PetscScalar *array, *vArray; 3392552f7358SJed Brown PetscInt *points = NULL; 3393d9917b9dSMatthew G. Knepley const PetscInt *clp; 33941a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 3395552f7358SJed Brown PetscErrorCode ierr; 3396552f7358SJed Brown 3397d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 3398552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3399552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 34001a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 34011a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3402552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3403552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3404552f7358SJed Brown if (depth == 1 && numFields < 2) { 34051a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 3406552f7358SJed Brown PetscFunctionReturn(0); 3407552f7358SJed Brown } 34081a271a75SMatthew G. Knepley /* Get points */ 3409d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3410d9917b9dSMatthew G. Knepley if (!clPoints) { 34111a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 3412552f7358SJed Brown 34131a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3414552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3415552f7358SJed Brown /* Compress out points not in the section */ 3416552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3417552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3418552f7358SJed Brown points[q*2] = points[p]; 3419552f7358SJed Brown points[q*2+1] = points[p+1]; 3420552f7358SJed Brown ++q; 3421552f7358SJed Brown } 3422552f7358SJed Brown } 3423552f7358SJed Brown numPoints = q; 3424d9917b9dSMatthew G. Knepley } else { 3425d9917b9dSMatthew G. Knepley PetscInt dof, off; 3426552f7358SJed Brown 3427d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3428d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3429d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 34301a271a75SMatthew G. Knepley numPoints = dof/2; 3431d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3432552f7358SJed Brown } 34331a271a75SMatthew G. Knepley /* Get array */ 3434552f7358SJed Brown if (!values || !*values) { 34351a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 3436552f7358SJed Brown 34371a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3438552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 34391a271a75SMatthew G. Knepley asize += dof; 3440552f7358SJed Brown } 3441bd6c0d32SMatthew G. Knepley if (!values) { 3442d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34431a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34441a271a75SMatthew G. Knepley if (csize) *csize = asize; 3445bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 3446bd6c0d32SMatthew G. Knepley } 34471a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 3448d0f6b257SMatthew G. Knepley } else { 3449d0f6b257SMatthew G. Knepley array = *values; 3450d0f6b257SMatthew G. Knepley } 3451552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 34521a271a75SMatthew G. Knepley /* Get values */ 3453ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 34541a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 34551a271a75SMatthew G. Knepley /* Cleanup points */ 34561a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 34571a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 34581a271a75SMatthew G. Knepley /* Cleanup array */ 3459552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 3460d0f6b257SMatthew G. Knepley if (!*values) { 3461552f7358SJed Brown if (csize) *csize = size; 3462552f7358SJed Brown *values = array; 3463d0f6b257SMatthew G. Knepley } else { 3464d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 3465d0f6b257SMatthew G. Knepley *csize = size; 3466d0f6b257SMatthew G. Knepley } 3467552f7358SJed Brown PetscFunctionReturn(0); 3468552f7358SJed Brown } 3469552f7358SJed Brown 3470552f7358SJed Brown #undef __FUNCT__ 3471552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 3472552f7358SJed Brown /*@C 3473552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 3474552f7358SJed Brown 3475552f7358SJed Brown Not collective 3476552f7358SJed Brown 3477552f7358SJed Brown Input Parameters: 3478552f7358SJed Brown + dm - The DM 34790298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 3480552f7358SJed Brown . v - The local vector 3481552f7358SJed Brown . point - The sieve point in the DM 34820298fd71SBarry Smith . csize - The number of values in the closure, or NULL 3483552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3484552f7358SJed Brown 34853813dfbdSMatthew G Knepley Fortran Notes: 34863813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 34873813dfbdSMatthew G Knepley include petsc.h90 in your code. 34883813dfbdSMatthew G Knepley 34893813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 34903813dfbdSMatthew G Knepley 3491552f7358SJed Brown Level: intermediate 3492552f7358SJed Brown 3493552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3494552f7358SJed Brown @*/ 34957c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3496a6dfd86eSKarl Rupp { 3497552f7358SJed Brown PetscInt size = 0; 3498552f7358SJed Brown PetscErrorCode ierr; 3499552f7358SJed Brown 3500552f7358SJed Brown PetscFunctionBegin; 3501552f7358SJed Brown /* Should work without recalculating size */ 3502552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 3503552f7358SJed Brown PetscFunctionReturn(0); 3504552f7358SJed Brown } 3505552f7358SJed Brown 3506552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 3507552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 3508552f7358SJed Brown 3509552f7358SJed Brown #undef __FUNCT__ 3510552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 35111a271a75SMatthew 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[]) 3512552f7358SJed Brown { 3513552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3514552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3515552f7358SJed Brown PetscScalar *a; 3516552f7358SJed Brown PetscInt off, cind = 0, k; 3517552f7358SJed Brown PetscErrorCode ierr; 3518552f7358SJed Brown 3519552f7358SJed Brown PetscFunctionBegin; 3520552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3521552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3522552f7358SJed Brown a = &array[off]; 3523552f7358SJed Brown if (!cdof || setBC) { 3524552f7358SJed Brown if (orientation >= 0) { 3525552f7358SJed Brown for (k = 0; k < dof; ++k) { 3526552f7358SJed Brown fuse(&a[k], values[k]); 3527552f7358SJed Brown } 3528552f7358SJed Brown } else { 3529552f7358SJed Brown for (k = 0; k < dof; ++k) { 3530552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3531552f7358SJed Brown } 3532552f7358SJed Brown } 3533552f7358SJed Brown } else { 3534552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3535552f7358SJed Brown if (orientation >= 0) { 3536552f7358SJed Brown for (k = 0; k < dof; ++k) { 3537552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3538552f7358SJed Brown fuse(&a[k], values[k]); 3539552f7358SJed Brown } 3540552f7358SJed Brown } else { 3541552f7358SJed Brown for (k = 0; k < dof; ++k) { 3542552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3543552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3544552f7358SJed Brown } 3545552f7358SJed Brown } 3546552f7358SJed Brown } 3547552f7358SJed Brown PetscFunctionReturn(0); 3548552f7358SJed Brown } 3549552f7358SJed Brown 3550552f7358SJed Brown #undef __FUNCT__ 3551a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 35521a271a75SMatthew 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[]) 3553a5e93ea8SMatthew G. Knepley { 3554a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 3555a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3556a5e93ea8SMatthew G. Knepley PetscScalar *a; 3557a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 3558a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3559a5e93ea8SMatthew G. Knepley 3560a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3561a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3562a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3563a5e93ea8SMatthew G. Knepley a = &array[off]; 3564a5e93ea8SMatthew G. Knepley if (cdof) { 3565a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3566a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 3567a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3568a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3569a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 3570a5e93ea8SMatthew G. Knepley ++cind; 3571a5e93ea8SMatthew G. Knepley } 3572a5e93ea8SMatthew G. Knepley } 3573a5e93ea8SMatthew G. Knepley } else { 3574a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3575a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3576a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 3577a5e93ea8SMatthew G. Knepley ++cind; 3578a5e93ea8SMatthew G. Knepley } 3579a5e93ea8SMatthew G. Knepley } 3580a5e93ea8SMatthew G. Knepley } 3581a5e93ea8SMatthew G. Knepley } 3582a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3583a5e93ea8SMatthew G. Knepley } 3584a5e93ea8SMatthew G. Knepley 3585a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 3586552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 35871a271a75SMatthew 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[]) 3588a6dfd86eSKarl Rupp { 3589552f7358SJed Brown PetscScalar *a; 35901a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 35911a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 35921a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3593552f7358SJed Brown PetscErrorCode ierr; 3594552f7358SJed Brown 3595552f7358SJed Brown PetscFunctionBegin; 3596552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3597552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 35981a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 35991a271a75SMatthew G. Knepley a = &array[foff]; 3600552f7358SJed Brown if (!fcdof || setBC) { 36011a271a75SMatthew G. Knepley if (o >= 0) { 36021a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 3603552f7358SJed Brown } else { 3604552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3605552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 36061a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3607552f7358SJed Brown } 3608552f7358SJed Brown } 3609552f7358SJed Brown } 3610552f7358SJed Brown } else { 3611552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36121a271a75SMatthew G. Knepley if (o >= 0) { 3613552f7358SJed Brown for (k = 0; k < fdof; ++k) { 3614552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 36151a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3616552f7358SJed Brown } 3617552f7358SJed Brown } else { 3618552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3619552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3620552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 36211a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3622552f7358SJed Brown } 3623552f7358SJed Brown } 3624552f7358SJed Brown } 3625552f7358SJed Brown } 36261a271a75SMatthew G. Knepley *offset += fdof; 3627552f7358SJed Brown PetscFunctionReturn(0); 3628552f7358SJed Brown } 3629552f7358SJed Brown 3630552f7358SJed Brown #undef __FUNCT__ 3631a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 36321a271a75SMatthew 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[]) 3633a5e93ea8SMatthew G. Knepley { 3634a5e93ea8SMatthew G. Knepley PetscScalar *a; 36351a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 36361a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 36371a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3638a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3639a5e93ea8SMatthew G. Knepley 3640a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3641a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3642a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 36431a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 36441a271a75SMatthew G. Knepley a = &array[foff]; 3645a5e93ea8SMatthew G. Knepley if (fcdof) { 3646a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 36471a271a75SMatthew G. Knepley if (o >= 0) { 3648a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 3649a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 36501a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3651a5e93ea8SMatthew G. Knepley ++cind; 3652a5e93ea8SMatthew G. Knepley } 3653a5e93ea8SMatthew G. Knepley } 3654a5e93ea8SMatthew G. Knepley } else { 3655a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 3656a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 3657a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 36581a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3659a5e93ea8SMatthew G. Knepley ++cind; 3660a5e93ea8SMatthew G. Knepley } 3661a5e93ea8SMatthew G. Knepley } 3662a5e93ea8SMatthew G. Knepley } 3663a5e93ea8SMatthew G. Knepley } 3664a5e93ea8SMatthew G. Knepley } 36651a271a75SMatthew G. Knepley *offset += fdof; 3666a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3667a5e93ea8SMatthew G. Knepley } 3668a5e93ea8SMatthew G. Knepley 3669a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 36701b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 36711a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 3672a6dfd86eSKarl Rupp { 3673552f7358SJed Brown PetscScalar *array; 36741b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 36751b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 3676552f7358SJed Brown PetscErrorCode ierr; 3677552f7358SJed Brown 36781b406b76SMatthew G. Knepley PetscFunctionBeginHot; 3679b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3680b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 3681b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3682b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 3683b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3684b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 3685b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 3686b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 3687b6ebb6e6SMatthew G. Knepley 3688b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 3689b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 3690b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 3691b6ebb6e6SMatthew G. Knepley { 3692b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3693b6ebb6e6SMatthew G. Knepley PetscScalar *a; 3694b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 3695b6ebb6e6SMatthew G. Knepley 3696b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 3697b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 3698b6ebb6e6SMatthew G. Knepley a = &array[coff]; 3699b6ebb6e6SMatthew G. Knepley if (!cdof) { 3700b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3701b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3702b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3703b6ebb6e6SMatthew G. Knepley } 3704b6ebb6e6SMatthew G. Knepley } else { 3705b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3706b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3707b6ebb6e6SMatthew G. Knepley } 3708b6ebb6e6SMatthew G. Knepley } 3709b6ebb6e6SMatthew G. Knepley } else { 3710b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 3711b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3712b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3713b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3714b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3715b6ebb6e6SMatthew G. Knepley } 3716b6ebb6e6SMatthew G. Knepley } else { 3717b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3718b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3719b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3720b6ebb6e6SMatthew G. Knepley } 3721b6ebb6e6SMatthew G. Knepley } 3722b6ebb6e6SMatthew G. Knepley } 3723b6ebb6e6SMatthew G. Knepley } 3724b6ebb6e6SMatthew G. Knepley } 3725b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3726b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 3727b6ebb6e6SMatthew G. Knepley } 37281b406b76SMatthew G. Knepley 37291b406b76SMatthew G. Knepley #undef __FUNCT__ 37301b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 37311b406b76SMatthew G. Knepley /*@C 37321b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 37331b406b76SMatthew G. Knepley 37341b406b76SMatthew G. Knepley Not collective 37351b406b76SMatthew G. Knepley 37361b406b76SMatthew G. Knepley Input Parameters: 37371b406b76SMatthew G. Knepley + dm - The DM 37381b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 37391b406b76SMatthew G. Knepley . v - The local vector 37401b406b76SMatthew G. Knepley . point - The sieve point in the DM 37411b406b76SMatthew G. Knepley . values - The array of values 37421b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 37431b406b76SMatthew G. Knepley 37441b406b76SMatthew G. Knepley Fortran Notes: 37451b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 37461b406b76SMatthew G. Knepley 37471b406b76SMatthew G. Knepley Level: intermediate 37481b406b76SMatthew G. Knepley 37491b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 37501b406b76SMatthew G. Knepley @*/ 37511b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 37521b406b76SMatthew G. Knepley { 37531b406b76SMatthew G. Knepley PetscSection clSection; 37541b406b76SMatthew G. Knepley IS clPoints; 37551b406b76SMatthew G. Knepley PetscScalar *array; 37561b406b76SMatthew G. Knepley PetscInt *points = NULL; 37571b406b76SMatthew G. Knepley const PetscInt *clp; 37581a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 37591b406b76SMatthew G. Knepley PetscErrorCode ierr; 37601b406b76SMatthew G. Knepley 37611a271a75SMatthew G. Knepley PetscFunctionBeginHot; 37621b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 37631b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 37641a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 37651a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 37661b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 37671b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 37681b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 37691a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 37701b406b76SMatthew G. Knepley PetscFunctionReturn(0); 37711b406b76SMatthew G. Knepley } 37721a271a75SMatthew G. Knepley /* Get points */ 37731b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 37741b406b76SMatthew G. Knepley if (!clPoints) { 37751a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 37761a271a75SMatthew G. Knepley 37771a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3778552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3779552f7358SJed Brown /* Compress out points not in the section */ 3780552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3781552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3782552f7358SJed Brown points[q*2] = points[p]; 3783552f7358SJed Brown points[q*2+1] = points[p+1]; 3784552f7358SJed Brown ++q; 3785552f7358SJed Brown } 3786552f7358SJed Brown } 3787552f7358SJed Brown numPoints = q; 37881b406b76SMatthew G. Knepley } else { 37891b406b76SMatthew G. Knepley PetscInt dof, off; 3790552f7358SJed Brown 37911b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 37921b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 37931b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 37941a271a75SMatthew G. Knepley numPoints = dof/2; 37951b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 3796552f7358SJed Brown } 37971a271a75SMatthew G. Knepley /* Get array */ 3798552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 37991a271a75SMatthew G. Knepley /* Get values */ 3800ef90cfe2SMatthew G. Knepley if (numFields > 0) { 38011a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3802552f7358SJed Brown for (f = 0; f < numFields; ++f) { 38031a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3804552f7358SJed Brown switch (mode) { 3805552f7358SJed Brown case INSERT_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, insert, PETSC_FALSE, values, &offset, array); 3810552f7358SJed Brown } break; 3811552f7358SJed Brown case INSERT_ALL_VALUES: 3812552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38131a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38141a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38151a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3816552f7358SJed Brown } break; 3817a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3818a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 38191a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38201a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38211a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3822a5e93ea8SMatthew G. Knepley } break; 3823552f7358SJed Brown case ADD_VALUES: 3824552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38251a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38261a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38271a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3828552f7358SJed Brown } break; 3829552f7358SJed Brown case ADD_ALL_VALUES: 3830552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 38311a271a75SMatthew G. Knepley const PetscInt point = points[p]; 38321a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 38331a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3834552f7358SJed Brown } break; 3835552f7358SJed Brown default: 383682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3837552f7358SJed Brown } 38381a271a75SMatthew G. Knepley } 3839552f7358SJed Brown } else { 38401a271a75SMatthew G. Knepley PetscInt dof, off; 38411a271a75SMatthew G. Knepley 3842552f7358SJed Brown switch (mode) { 3843552f7358SJed Brown case INSERT_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, insert, PETSC_FALSE, o, &values[off], array); 3848552f7358SJed Brown } break; 3849552f7358SJed Brown case INSERT_ALL_VALUES: 3850552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3851552f7358SJed Brown PetscInt o = points[p+1]; 3852552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3853552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 3854552f7358SJed Brown } break; 3855a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3856a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3857a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 3858a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3859a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 3860a5e93ea8SMatthew G. Knepley } break; 3861552f7358SJed Brown case ADD_VALUES: 3862552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3863552f7358SJed Brown PetscInt o = points[p+1]; 3864552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3865552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 3866552f7358SJed Brown } break; 3867552f7358SJed Brown case ADD_ALL_VALUES: 3868552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3869552f7358SJed Brown PetscInt o = points[p+1]; 3870552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3871552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 3872552f7358SJed Brown } break; 3873552f7358SJed Brown default: 387482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3875552f7358SJed Brown } 3876552f7358SJed Brown } 38771a271a75SMatthew G. Knepley /* Cleanup points */ 38781a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 38791a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 38801a271a75SMatthew G. Knepley /* Cleanup array */ 3881552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3882552f7358SJed Brown PetscFunctionReturn(0); 3883552f7358SJed Brown } 3884552f7358SJed Brown 3885552f7358SJed Brown #undef __FUNCT__ 3886e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 3887e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 3888e07394fbSMatthew G. Knepley { 3889e07394fbSMatthew G. Knepley PetscSection clSection; 3890e07394fbSMatthew G. Knepley IS clPoints; 3891e07394fbSMatthew G. Knepley PetscScalar *array; 3892e07394fbSMatthew G. Knepley PetscInt *points = NULL; 3893e07394fbSMatthew G. Knepley const PetscInt *clp; 3894e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 3895e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3896e07394fbSMatthew G. Knepley PetscErrorCode ierr; 3897e07394fbSMatthew G. Knepley 3898e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 3899e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3900e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 3901e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 3902e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3903e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3904e07394fbSMatthew G. Knepley /* Get points */ 3905e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3906e07394fbSMatthew G. Knepley if (!clPoints) { 3907e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 3908e07394fbSMatthew G. Knepley 3909e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3910e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3911e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 3912e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 3913e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 3914e07394fbSMatthew G. Knepley points[q*2] = points[p]; 3915e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 3916e07394fbSMatthew G. Knepley ++q; 3917e07394fbSMatthew G. Knepley } 3918e07394fbSMatthew G. Knepley } 3919e07394fbSMatthew G. Knepley numPoints = q; 3920e07394fbSMatthew G. Knepley } else { 3921e07394fbSMatthew G. Knepley PetscInt dof, off; 3922e07394fbSMatthew G. Knepley 3923e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3924e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3925e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 3926e07394fbSMatthew G. Knepley numPoints = dof/2; 3927e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3928e07394fbSMatthew G. Knepley } 3929e07394fbSMatthew G. Knepley /* Get array */ 3930e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3931e07394fbSMatthew G. Knepley /* Get values */ 3932e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 3933e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3934e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 3935e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3936e07394fbSMatthew G. Knepley PetscInt fdof; 3937e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 3938e07394fbSMatthew G. Knepley offset += fdof; 3939e07394fbSMatthew G. Knepley } 3940e07394fbSMatthew G. Knepley continue; 3941e07394fbSMatthew G. Knepley } 3942e07394fbSMatthew G. Knepley switch (mode) { 3943e07394fbSMatthew G. Knepley case INSERT_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, insert, PETSC_FALSE, values, &offset, array); 3948e07394fbSMatthew G. Knepley } break; 3949e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 3950e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3951e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3952e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3953e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3954e07394fbSMatthew G. Knepley } break; 3955e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 3956e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3957e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3958e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3959e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3960e07394fbSMatthew G. Knepley } break; 3961e07394fbSMatthew G. Knepley case ADD_VALUES: 3962e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3963e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3964e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3965e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3966e07394fbSMatthew G. Knepley } break; 3967e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 3968e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3969e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3970e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3971e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3972e07394fbSMatthew G. Knepley } break; 3973e07394fbSMatthew G. Knepley default: 3974e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3975e07394fbSMatthew G. Knepley } 3976e07394fbSMatthew G. Knepley } 3977e07394fbSMatthew G. Knepley /* Cleanup points */ 3978e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 3979e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 3980e07394fbSMatthew G. Knepley /* Cleanup array */ 3981e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3982e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 3983e07394fbSMatthew G. Knepley } 3984e07394fbSMatthew G. Knepley 3985e07394fbSMatthew G. Knepley #undef __FUNCT__ 3986552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 3987b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 3988552f7358SJed Brown { 3989552f7358SJed Brown PetscMPIInt rank; 3990552f7358SJed Brown PetscInt i, j; 3991552f7358SJed Brown PetscErrorCode ierr; 3992552f7358SJed Brown 3993552f7358SJed Brown PetscFunctionBegin; 399482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 399577a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 3996b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 3997b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 3998b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 3999b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 400077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 4001b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 4002519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 40037eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 4004552f7358SJed Brown #else 4005b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 4006552f7358SJed Brown #endif 4007552f7358SJed Brown } 400877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 4009552f7358SJed Brown } 4010552f7358SJed Brown PetscFunctionReturn(0); 4011552f7358SJed Brown } 4012552f7358SJed Brown 4013552f7358SJed Brown #undef __FUNCT__ 4014552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 4015552f7358SJed Brown /* . off - The global offset of this point */ 4016e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4017a6dfd86eSKarl Rupp { 4018e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 4019552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4020552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4021552f7358SJed Brown PetscInt cind = 0, k; 4022552f7358SJed Brown PetscErrorCode ierr; 4023552f7358SJed Brown 4024552f7358SJed Brown PetscFunctionBegin; 4025552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 4026552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4027552f7358SJed Brown if (!cdof || setBC) { 4028552f7358SJed Brown if (orientation >= 0) { 4029e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 4030552f7358SJed Brown } else { 4031e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 4032552f7358SJed Brown } 4033552f7358SJed Brown } else { 4034552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4035552f7358SJed Brown if (orientation >= 0) { 4036552f7358SJed Brown for (k = 0; k < dof; ++k) { 4037552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4038552f7358SJed Brown /* Insert check for returning constrained indices */ 4039e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 4040552f7358SJed Brown ++cind; 4041552f7358SJed Brown } else { 4042e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 4043552f7358SJed Brown } 4044552f7358SJed Brown } 4045552f7358SJed Brown } else { 4046552f7358SJed Brown for (k = 0; k < dof; ++k) { 4047552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4048552f7358SJed Brown /* Insert check for returning constrained indices */ 4049e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 4050552f7358SJed Brown ++cind; 4051552f7358SJed Brown } else { 4052e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 4053552f7358SJed Brown } 4054552f7358SJed Brown } 4055552f7358SJed Brown } 4056552f7358SJed Brown } 4057e6ccafaeSMatthew G Knepley *loff += dof; 4058552f7358SJed Brown PetscFunctionReturn(0); 4059552f7358SJed Brown } 4060552f7358SJed Brown 4061552f7358SJed Brown #undef __FUNCT__ 4062552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 4063552f7358SJed Brown /* . off - The global offset of this point */ 4064a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4065a6dfd86eSKarl Rupp { 4066552f7358SJed Brown PetscInt numFields, foff, f; 4067552f7358SJed Brown PetscErrorCode ierr; 4068552f7358SJed Brown 4069552f7358SJed Brown PetscFunctionBegin; 4070552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4071552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 4072552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 4073552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 4074552f7358SJed Brown PetscInt cind = 0, k, c; 4075552f7358SJed Brown 4076552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4077552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4078552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 4079552f7358SJed Brown if (!cfdof || setBC) { 4080552f7358SJed Brown if (orientation >= 0) { 40810d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 4082552f7358SJed Brown } else { 4083552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4084552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4085552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 4086552f7358SJed Brown } 4087552f7358SJed Brown } 4088552f7358SJed Brown } 4089552f7358SJed Brown } else { 4090552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 4091552f7358SJed Brown if (orientation >= 0) { 4092552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4093552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 4094552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 4095552f7358SJed Brown ++cind; 4096552f7358SJed Brown } else { 4097552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 4098552f7358SJed Brown } 4099552f7358SJed Brown } 4100552f7358SJed Brown } else { 4101552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4102552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4103552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 4104552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 4105552f7358SJed Brown ++cind; 4106552f7358SJed Brown } else { 4107552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 4108552f7358SJed Brown } 4109552f7358SJed Brown } 4110552f7358SJed Brown } 4111552f7358SJed Brown } 4112552f7358SJed Brown } 4113552f7358SJed Brown foff += fdof - cfdof; 4114552f7358SJed Brown foffs[f] += fdof; 4115552f7358SJed Brown } 4116552f7358SJed Brown PetscFunctionReturn(0); 4117552f7358SJed Brown } 4118552f7358SJed Brown 4119552f7358SJed Brown #undef __FUNCT__ 4120f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat" 4121f7c74593SToby 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[]) 4122d3d1a6afSToby Isaac { 4123d3d1a6afSToby Isaac Mat cMat; 4124d3d1a6afSToby Isaac PetscSection aSec, cSec; 4125d3d1a6afSToby Isaac IS aIS; 4126d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 4127d3d1a6afSToby Isaac const PetscInt *anchors; 4128e17c06e0SMatthew G. Knepley PetscInt numFields, f, p, q, newP = 0; 4129d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 4130d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 4131d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 4132d3d1a6afSToby Isaac PetscInt newOffsets[32]; 4133d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 4134d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 4135d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 4136d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 4137d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 4138d3d1a6afSToby Isaac PetscErrorCode ierr; 4139d3d1a6afSToby Isaac 4140d3d1a6afSToby Isaac PetscFunctionBegin; 4141d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4142d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4143d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4144d3d1a6afSToby Isaac 4145a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 4146d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 4147d3d1a6afSToby Isaac if (aSec) { 4148d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4149d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 4150d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 4151d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 4152d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 4153d3d1a6afSToby Isaac * into the global matrix anyway) */ 4154d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 4155d3d1a6afSToby Isaac PetscInt b = points[p]; 4156d3d1a6afSToby Isaac PetscInt bDof = 0; 4157d3d1a6afSToby Isaac 4158d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4159d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 4160d3d1a6afSToby Isaac } 4161d3d1a6afSToby Isaac if (bDof) { 4162d3d1a6afSToby Isaac /* this point is constrained */ 4163d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 4164d3d1a6afSToby Isaac PetscInt bOff, q; 4165d3d1a6afSToby Isaac 4166d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 4167d3d1a6afSToby Isaac newNumPoints += bDof; 4168d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 4169d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4170d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4171d3d1a6afSToby Isaac PetscInt aDof; 4172d3d1a6afSToby Isaac 4173d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 4174d3d1a6afSToby Isaac newNumIndices += aDof; 4175d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4176d3d1a6afSToby Isaac PetscInt fDof; 4177d3d1a6afSToby Isaac 4178d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 4179d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4180d3d1a6afSToby Isaac } 4181d3d1a6afSToby Isaac } 4182d3d1a6afSToby Isaac } 4183d3d1a6afSToby Isaac else { 4184d3d1a6afSToby Isaac /* this point is not constrained */ 4185d3d1a6afSToby Isaac newNumPoints++; 4186d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 4187d3d1a6afSToby Isaac newNumIndices += bDof; 4188d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4189d3d1a6afSToby Isaac PetscInt fDof; 4190d3d1a6afSToby Isaac 4191d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4192d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4193d3d1a6afSToby Isaac } 4194d3d1a6afSToby Isaac } 4195d3d1a6afSToby Isaac } 4196d3d1a6afSToby Isaac } 4197d3d1a6afSToby Isaac if (!anyConstrained) { 4198d3d1a6afSToby Isaac *outNumPoints = 0; 4199d3d1a6afSToby Isaac *outNumIndices = 0; 4200d3d1a6afSToby Isaac *outPoints = NULL; 4201d3d1a6afSToby Isaac *outValues = NULL; 4202d3d1a6afSToby Isaac if (aSec) { 4203d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4204d3d1a6afSToby Isaac } 4205d3d1a6afSToby Isaac PetscFunctionReturn(0); 4206d3d1a6afSToby Isaac } 4207d3d1a6afSToby Isaac 4208d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 4209d3d1a6afSToby Isaac 4210d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 4211d3d1a6afSToby Isaac 4212f7c74593SToby Isaac ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr); 4213d3d1a6afSToby Isaac 4214d3d1a6afSToby Isaac /* output arrays */ 4215d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4216d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4217d3d1a6afSToby Isaac 4218d3d1a6afSToby Isaac /* workspaces */ 4219d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4220d3d1a6afSToby Isaac if (numFields) { 4221d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4222d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4223d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4224d3d1a6afSToby Isaac } 4225d3d1a6afSToby Isaac } 4226d3d1a6afSToby Isaac else { 4227d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4228d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4229d3d1a6afSToby Isaac } 4230d3d1a6afSToby Isaac 4231d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 4232d3d1a6afSToby Isaac if (numFields) { 4233d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4234d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4235d3d1a6afSToby Isaac PetscInt bDof = 0; 4236d3d1a6afSToby Isaac 4237d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4238d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4239d3d1a6afSToby Isaac } 4240d3d1a6afSToby Isaac if (bDof) { 4241d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4242d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 4243d3d1a6afSToby Isaac 4244d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4245d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4246d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4247d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4248d3d1a6afSToby Isaac PetscInt aFDof; 4249d3d1a6afSToby Isaac 4250d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 4251d3d1a6afSToby Isaac allFDof += aFDof; 4252d3d1a6afSToby Isaac } 4253d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 4254d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 4255d3d1a6afSToby Isaac } 4256d3d1a6afSToby Isaac } 4257d3d1a6afSToby Isaac else { 4258d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4259d3d1a6afSToby Isaac PetscInt fDof; 4260d3d1a6afSToby Isaac 4261d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4262d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 4263d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 4264d3d1a6afSToby Isaac } 4265d3d1a6afSToby Isaac } 4266d3d1a6afSToby Isaac } 4267d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4268d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 4269d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 4270d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4271d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 4272d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 4273d3d1a6afSToby Isaac } 4274d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4275d3d1a6afSToby Isaac } 4276d3d1a6afSToby Isaac } 4277d3d1a6afSToby Isaac else { 4278d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4279d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4280d3d1a6afSToby Isaac PetscInt bDof = 0; 4281d3d1a6afSToby Isaac 4282d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4283d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4284d3d1a6afSToby Isaac } 4285d3d1a6afSToby Isaac if (bDof) { 4286d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 4287d3d1a6afSToby Isaac 4288d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4289d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4290d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4291d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 4292d3d1a6afSToby Isaac 4293d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 4294d3d1a6afSToby Isaac allDof += aDof; 4295d3d1a6afSToby Isaac } 4296d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 4297d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 4298d3d1a6afSToby Isaac } 4299d3d1a6afSToby Isaac else { 4300d3d1a6afSToby Isaac PetscInt dof; 4301d3d1a6afSToby Isaac 4302d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4303d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 4304d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 4305d3d1a6afSToby Isaac } 4306d3d1a6afSToby Isaac } 4307d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 4308d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 4309d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4310d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 4311d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 4312d3d1a6afSToby Isaac } 4313d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4314d3d1a6afSToby Isaac } 4315d3d1a6afSToby Isaac 4316d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 4317d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 4318d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4319d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4320d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4321d3d1a6afSToby Isaac if (numFields) { 4322d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 4323d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4324d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4325d3d1a6afSToby Isaac PetscInt bDof = 0; 4326d3d1a6afSToby Isaac 4327d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4328d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4329d3d1a6afSToby Isaac } 4330d3d1a6afSToby Isaac if (bDof) { 4331d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 4332d3d1a6afSToby Isaac 4333d3d1a6afSToby Isaac fStart[0] = 0; 4334d3d1a6afSToby Isaac fEnd[0] = 0; 4335d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4336d3d1a6afSToby Isaac PetscInt fDof; 4337d3d1a6afSToby Isaac 4338d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 4339d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 4340d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 4341d3d1a6afSToby Isaac } 4342d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4343d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4344d3d1a6afSToby Isaac 4345d3d1a6afSToby Isaac fAnchorStart[0] = 0; 4346d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 4347d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4348d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 4349d3d1a6afSToby Isaac 4350d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 4351d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 4352d3d1a6afSToby Isaac } 4353d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4354d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4355d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4356d3d1a6afSToby Isaac 4357d3d1a6afSToby 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 */ 4358d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4359d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4360d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 4361d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4362d3d1a6afSToby Isaac } 4363d3d1a6afSToby Isaac newP += bDof; 4364d3d1a6afSToby Isaac 4365d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4366d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4367d3d1a6afSToby 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); 4368d3d1a6afSToby Isaac } 4369d3d1a6afSToby Isaac } 4370d3d1a6afSToby Isaac else { 4371d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4372d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4373d3d1a6afSToby Isaac newP++; 4374d3d1a6afSToby Isaac } 4375d3d1a6afSToby Isaac } 4376d3d1a6afSToby Isaac } else { 4377d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4378d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4379d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4380d3d1a6afSToby Isaac PetscInt bDof = 0; 4381d3d1a6afSToby Isaac 4382d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4383d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4384d3d1a6afSToby Isaac } 4385d3d1a6afSToby Isaac if (bDof) { 4386d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 4387d3d1a6afSToby Isaac 4388d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4389d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4390d3d1a6afSToby Isaac 4391d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4392d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4393d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4394d3d1a6afSToby Isaac 4395d3d1a6afSToby 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 */ 4396d3d1a6afSToby Isaac 4397d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4398d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4399d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 4400d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4401d3d1a6afSToby Isaac } 4402d3d1a6afSToby Isaac newP += bDof; 4403d3d1a6afSToby Isaac 4404d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4405d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 4406d3d1a6afSToby Isaac } 4407d3d1a6afSToby Isaac else { 4408d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4409d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4410d3d1a6afSToby Isaac newP++; 4411d3d1a6afSToby Isaac } 4412d3d1a6afSToby Isaac } 4413d3d1a6afSToby Isaac } 4414d3d1a6afSToby Isaac 4415d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 4416d3d1a6afSToby Isaac /* multiply constraints on the right */ 4417d3d1a6afSToby Isaac if (numFields) { 4418d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4419d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4420d3d1a6afSToby Isaac 4421d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4422d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 4423d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4424d3d1a6afSToby Isaac PetscInt c, r, k; 4425d3d1a6afSToby Isaac PetscInt dof; 4426d3d1a6afSToby Isaac 4427d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4428d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4429d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 4430d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 4431d3d1a6afSToby Isaac 4432d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4433d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4434d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4435d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4436d3d1a6afSToby Isaac } 4437d3d1a6afSToby Isaac } 4438d3d1a6afSToby Isaac } 4439d3d1a6afSToby Isaac } 4440d3d1a6afSToby Isaac else { 4441d3d1a6afSToby Isaac /* copy this column as is */ 4442d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4443d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4444d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4445d3d1a6afSToby Isaac } 4446d3d1a6afSToby Isaac } 4447d3d1a6afSToby Isaac } 4448d3d1a6afSToby Isaac oldOff += dof; 4449d3d1a6afSToby Isaac } 4450d3d1a6afSToby Isaac } 4451d3d1a6afSToby Isaac } 4452d3d1a6afSToby Isaac else { 4453d3d1a6afSToby Isaac PetscInt oldOff = 0; 4454d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4455d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 4456d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4457d3d1a6afSToby Isaac PetscInt c, r, k; 4458d3d1a6afSToby Isaac PetscInt dof; 4459d3d1a6afSToby Isaac 4460d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4461d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4462d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 4463d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 4464d3d1a6afSToby Isaac 4465d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4466d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4467d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4468d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4469d3d1a6afSToby Isaac } 4470d3d1a6afSToby Isaac } 4471d3d1a6afSToby Isaac } 4472d3d1a6afSToby Isaac } 4473d3d1a6afSToby Isaac else { 4474d3d1a6afSToby Isaac /* copy this column as is */ 4475d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4476d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4477d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4478d3d1a6afSToby Isaac } 4479d3d1a6afSToby Isaac } 4480d3d1a6afSToby Isaac } 4481d3d1a6afSToby Isaac oldOff += dof; 4482d3d1a6afSToby Isaac } 4483d3d1a6afSToby Isaac } 4484d3d1a6afSToby Isaac 4485d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 4486d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 4487d3d1a6afSToby Isaac if (numFields) { 4488d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4489d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4490d3d1a6afSToby Isaac 4491d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4492d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 4493d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4494d3d1a6afSToby Isaac PetscInt c, r, k; 4495d3d1a6afSToby Isaac PetscInt dof; 4496d3d1a6afSToby Isaac 4497d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4498d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4499d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 4500d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 4501d3d1a6afSToby Isaac 4502d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4503d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4504d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4505d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4506d3d1a6afSToby Isaac } 4507d3d1a6afSToby Isaac } 4508d3d1a6afSToby Isaac } 4509d3d1a6afSToby Isaac } 4510d3d1a6afSToby Isaac else { 4511d3d1a6afSToby Isaac /* copy this row as is */ 4512d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 4513d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4514d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4515d3d1a6afSToby Isaac } 4516d3d1a6afSToby Isaac } 4517d3d1a6afSToby Isaac } 4518d3d1a6afSToby Isaac oldOff += dof; 4519d3d1a6afSToby Isaac } 4520d3d1a6afSToby Isaac } 4521d3d1a6afSToby Isaac } 4522d3d1a6afSToby Isaac else { 4523d3d1a6afSToby Isaac PetscInt oldOff = 0; 4524d3d1a6afSToby Isaac 4525d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4526d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 4527d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4528d3d1a6afSToby Isaac PetscInt c, r, k; 4529d3d1a6afSToby Isaac PetscInt dof; 4530d3d1a6afSToby Isaac 4531d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4532d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4533d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 4534d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 4535d3d1a6afSToby Isaac 4536d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4537d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4538d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4539d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4540d3d1a6afSToby Isaac } 4541d3d1a6afSToby Isaac } 4542d3d1a6afSToby Isaac } 4543d3d1a6afSToby Isaac } 4544d3d1a6afSToby Isaac else { 4545d3d1a6afSToby Isaac /* copy this row as is */ 4546d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 4547d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4548d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4549d3d1a6afSToby Isaac } 4550d3d1a6afSToby Isaac } 4551d3d1a6afSToby Isaac } 4552d3d1a6afSToby Isaac oldOff += dof; 4553d3d1a6afSToby Isaac } 4554d3d1a6afSToby Isaac } 4555d3d1a6afSToby Isaac 4556d3d1a6afSToby Isaac /* clean up */ 4557d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4558d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4559d3d1a6afSToby Isaac if (numFields) { 4560d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4561d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4562d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4563d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4564d3d1a6afSToby Isaac } 4565d3d1a6afSToby Isaac } 4566d3d1a6afSToby Isaac else { 4567d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4568d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4569d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4570d3d1a6afSToby Isaac } 4571d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4572d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4573d3d1a6afSToby Isaac 4574d3d1a6afSToby Isaac /* output */ 4575d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 4576d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 4577d3d1a6afSToby Isaac *outPoints = newPoints; 4578d3d1a6afSToby Isaac *outValues = newValues; 4579d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4580d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 4581d3d1a6afSToby Isaac } 4582d3d1a6afSToby Isaac PetscFunctionReturn(0); 4583d3d1a6afSToby Isaac } 4584d3d1a6afSToby Isaac 4585d3d1a6afSToby Isaac #undef __FUNCT__ 4586552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 45877f5d1fdeSMatthew G. Knepley /*@C 45887f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 45897f5d1fdeSMatthew G. Knepley 45907f5d1fdeSMatthew G. Knepley Not collective 45917f5d1fdeSMatthew G. Knepley 45927f5d1fdeSMatthew G. Knepley Input Parameters: 45937f5d1fdeSMatthew G. Knepley + dm - The DM 4594ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4595ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 45967f5d1fdeSMatthew G. Knepley . A - The matrix 45977f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 45987f5d1fdeSMatthew G. Knepley . values - The array of values 45997f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 46007f5d1fdeSMatthew G. Knepley 46017f5d1fdeSMatthew G. Knepley Fortran Notes: 46027f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 46037f5d1fdeSMatthew G. Knepley 46047f5d1fdeSMatthew G. Knepley Level: intermediate 46057f5d1fdeSMatthew G. Knepley 46067f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 46077f5d1fdeSMatthew G. Knepley @*/ 46087c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 4609552f7358SJed Brown { 4610552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 46111b406b76SMatthew G. Knepley PetscSection clSection; 46121b406b76SMatthew G. Knepley IS clPoints; 4613d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 46141b406b76SMatthew G. Knepley const PetscInt *clp; 4615552f7358SJed Brown PetscInt *indices; 4616552f7358SJed Brown PetscInt offsets[32]; 4617d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 4618d3d1a6afSToby Isaac PetscScalar *newValues; 4619552f7358SJed Brown PetscErrorCode ierr; 4620552f7358SJed Brown 4621552f7358SJed Brown PetscFunctionBegin; 4622552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4623ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 46243dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4625ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 46263dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 46273dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 4628552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 462982f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4630552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 46311b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 46321b406b76SMatthew G. Knepley if (!clPoints) { 4633552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4634552f7358SJed Brown /* Compress out points not in the section */ 4635552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4636552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4637552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4638552f7358SJed Brown points[q*2] = points[p]; 4639552f7358SJed Brown points[q*2+1] = points[p+1]; 4640552f7358SJed Brown ++q; 4641552f7358SJed Brown } 4642552f7358SJed Brown } 4643552f7358SJed Brown numPoints = q; 46441b406b76SMatthew G. Knepley } else { 46451b406b76SMatthew G. Knepley PetscInt dof, off; 46461b406b76SMatthew G. Knepley 46471b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 46481b406b76SMatthew G. Knepley numPoints = dof/2; 46491b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 46501b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46511b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 46521b406b76SMatthew G. Knepley } 4653552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 4654552f7358SJed Brown PetscInt fdof; 4655552f7358SJed Brown 4656552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4657552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4658552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 4659552f7358SJed Brown offsets[f+1] += fdof; 4660552f7358SJed Brown } 4661552f7358SJed Brown numIndices += dof; 4662552f7358SJed Brown } 46630d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 46640d644c17SKarl Rupp 466582f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 4666f7c74593SToby Isaac ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 4667d3d1a6afSToby Isaac if (newNumPoints) { 4668d3d1a6afSToby Isaac if (!clPoints) { 4669d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4670d3d1a6afSToby Isaac } else { 4671d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 4672d3d1a6afSToby Isaac } 4673d3d1a6afSToby Isaac numPoints = newNumPoints; 4674d3d1a6afSToby Isaac numIndices = newNumIndices; 4675d3d1a6afSToby Isaac points = newPoints; 4676d3d1a6afSToby Isaac values = newValues; 4677d3d1a6afSToby Isaac } 4678552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4679552f7358SJed Brown if (numFields) { 4680552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4681552f7358SJed Brown PetscInt o = points[p+1]; 4682552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4683552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 4684552f7358SJed Brown } 4685552f7358SJed Brown } else { 4686e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 4687552f7358SJed Brown PetscInt o = points[p+1]; 4688552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4689e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 4690552f7358SJed Brown } 4691552f7358SJed Brown } 4692b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 4693552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 4694552f7358SJed Brown if (ierr) { 4695552f7358SJed Brown PetscMPIInt rank; 4696552f7358SJed Brown PetscErrorCode ierr2; 4697552f7358SJed Brown 469882f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 469977a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4700b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 47016a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 4702552f7358SJed Brown CHKERRQ(ierr); 4703552f7358SJed Brown } 4704d3d1a6afSToby Isaac if (newNumPoints) { 4705d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4706d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4707d3d1a6afSToby Isaac } 4708d3d1a6afSToby Isaac else { 47091b406b76SMatthew G. Knepley if (!clPoints) { 4710552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 47111b406b76SMatthew G. Knepley } else { 47121b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 47131b406b76SMatthew G. Knepley } 4714d3d1a6afSToby Isaac } 4715552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4716552f7358SJed Brown PetscFunctionReturn(0); 4717552f7358SJed Brown } 4718552f7358SJed Brown 4719552f7358SJed Brown #undef __FUNCT__ 4720de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 4721de41b84cSMatthew 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) 4722de41b84cSMatthew G. Knepley { 4723de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 4724de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 4725de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 4726de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 4727de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 4728de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 47294ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 4730de41b84cSMatthew G. Knepley PetscErrorCode ierr; 4731de41b84cSMatthew G. Knepley 4732de41b84cSMatthew G. Knepley PetscFunctionBegin; 4733de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 4734de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 4735de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 4736de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 4737de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 4738de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 4739de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 4740de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 4741de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 4742de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 4743de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 4744de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 4745de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4746de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4747de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4748de41b84cSMatthew G. Knepley /* Column indices */ 4749de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 47504ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 4751de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4752de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 4753de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 4754de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 4755de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 4756de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 4757de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 4758de41b84cSMatthew G. Knepley ++q; 4759de41b84cSMatthew G. Knepley } 4760de41b84cSMatthew G. Knepley } 4761de41b84cSMatthew G. Knepley numCPoints = q; 4762de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 4763de41b84cSMatthew G. Knepley PetscInt fdof; 4764de41b84cSMatthew G. Knepley 4765de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 47664ca5e9f5SMatthew G. Knepley if (!dof) continue; 4767de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4768de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 4769de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 4770de41b84cSMatthew G. Knepley } 4771de41b84cSMatthew G. Knepley numCIndices += dof; 4772de41b84cSMatthew G. Knepley } 4773de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 4774de41b84cSMatthew G. Knepley /* Row indices */ 4775de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 4776de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 47771ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4778de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 4779de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 4780de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4781de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4782de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 4783de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4784de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 47854ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 47864ca5e9f5SMatthew G. Knepley if (!dof) continue; 47874ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 47884ca5e9f5SMatthew G. Knepley if (s < q) continue; 4789de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 4790de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 4791de41b84cSMatthew G. Knepley ++q; 4792de41b84cSMatthew G. Knepley } 4793de41b84cSMatthew G. Knepley } 4794de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4795de41b84cSMatthew G. Knepley } 4796de41b84cSMatthew G. Knepley numFPoints = q; 4797de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 4798de41b84cSMatthew G. Knepley PetscInt fdof; 4799de41b84cSMatthew G. Knepley 4800de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 48014ca5e9f5SMatthew G. Knepley if (!dof) continue; 4802de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4803de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 4804de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 4805de41b84cSMatthew G. Knepley } 4806de41b84cSMatthew G. Knepley numFIndices += dof; 4807de41b84cSMatthew G. Knepley } 4808de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 4809de41b84cSMatthew G. Knepley 4810de41b84cSMatthew 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); 4811de41b84cSMatthew 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); 4812de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4813de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4814de41b84cSMatthew G. Knepley if (numFields) { 4815de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4816de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4817de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4818de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 4819de41b84cSMatthew G. Knepley } 4820de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 4821de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4822de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4823de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 4824de41b84cSMatthew G. Knepley } 4825de41b84cSMatthew G. Knepley } else { 4826de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 4827de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4828de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4829de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 4830de41b84cSMatthew G. Knepley } 4831de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 4832de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4833de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4834de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 4835de41b84cSMatthew G. Knepley } 4836de41b84cSMatthew G. Knepley } 4837de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 4838de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 4839de41b84cSMatthew G. Knepley if (ierr) { 4840de41b84cSMatthew G. Knepley PetscMPIInt rank; 4841de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 4842de41b84cSMatthew G. Knepley 4843de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4844de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4845de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 4846de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 4847de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 4848de41b84cSMatthew G. Knepley CHKERRQ(ierr); 4849de41b84cSMatthew G. Knepley } 4850549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4851de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 4852de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4853de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4854de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 4855de41b84cSMatthew G. Knepley } 4856de41b84cSMatthew G. Knepley 4857de41b84cSMatthew G. Knepley #undef __FUNCT__ 48587c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 48597c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 48607c927364SMatthew G. Knepley { 48617c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 48627c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 48637c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 48647c927364SMatthew G. Knepley CellRefiner cellRefiner; 48657c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 48667c927364SMatthew G. Knepley PetscErrorCode ierr; 48677c927364SMatthew G. Knepley 48687c927364SMatthew G. Knepley PetscFunctionBegin; 48697c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 48707c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 48717c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 48727c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 48737c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 48747c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 48757c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 48767c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 48777c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 48787c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 48797c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 48807c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 48817c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 48827c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 48837c927364SMatthew G. Knepley /* Column indices */ 48847c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 48857c927364SMatthew G. Knepley maxFPoints = numCPoints; 48867c927364SMatthew G. Knepley /* Compress out points not in the section */ 48877c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 48887c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 48897c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 48907c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 48917c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 48927c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 48937c927364SMatthew G. Knepley ++q; 48947c927364SMatthew G. Knepley } 48957c927364SMatthew G. Knepley } 48967c927364SMatthew G. Knepley numCPoints = q; 48977c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 48987c927364SMatthew G. Knepley PetscInt fdof; 48997c927364SMatthew G. Knepley 49007c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 49017c927364SMatthew G. Knepley if (!dof) continue; 49027c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 49037c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 49047c927364SMatthew G. Knepley coffsets[f+1] += fdof; 49057c927364SMatthew G. Knepley } 49067c927364SMatthew G. Knepley numCIndices += dof; 49077c927364SMatthew G. Knepley } 49087c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 49097c927364SMatthew G. Knepley /* Row indices */ 49107c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 49117c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 49127c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 49137c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 49147c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 49157c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 49167c927364SMatthew G. Knepley /* Compress out points not in the section */ 49177c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 49187c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 49197c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 49207c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 49217c927364SMatthew G. Knepley if (!dof) continue; 49227c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 49237c927364SMatthew G. Knepley if (s < q) continue; 49247c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 49257c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 49267c927364SMatthew G. Knepley ++q; 49277c927364SMatthew G. Knepley } 49287c927364SMatthew G. Knepley } 49297c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 49307c927364SMatthew G. Knepley } 49317c927364SMatthew G. Knepley numFPoints = q; 49327c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 49337c927364SMatthew G. Knepley PetscInt fdof; 49347c927364SMatthew G. Knepley 49357c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 49367c927364SMatthew G. Knepley if (!dof) continue; 49377c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 49387c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 49397c927364SMatthew G. Knepley foffsets[f+1] += fdof; 49407c927364SMatthew G. Knepley } 49417c927364SMatthew G. Knepley numFIndices += dof; 49427c927364SMatthew G. Knepley } 49437c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 49447c927364SMatthew G. Knepley 49457c927364SMatthew 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); 49467c927364SMatthew 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); 49477c927364SMatthew G. Knepley if (numFields) { 49487c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 49497c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 49507c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 49517c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 49527c927364SMatthew G. Knepley } 49537c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 49547c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 49557c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 49567c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 49577c927364SMatthew G. Knepley } 49587c927364SMatthew G. Knepley } else { 49597c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 49607c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 49617c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 49627c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 49637c927364SMatthew G. Knepley } 49647c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 49657c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 49667c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 49677c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 49687c927364SMatthew G. Knepley } 49697c927364SMatthew G. Knepley } 49707c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 49717c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 49727c927364SMatthew G. Knepley PetscFunctionReturn(0); 49737c927364SMatthew G. Knepley } 49747c927364SMatthew G. Knepley 49757c927364SMatthew G. Knepley #undef __FUNCT__ 4976770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 4977f96281f8SMatthew G. Knepley /*@ 4978f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 4979f96281f8SMatthew G. Knepley 4980f96281f8SMatthew G. Knepley Input Parameter: 4981f96281f8SMatthew G. Knepley . dm - The DMPlex object 4982f96281f8SMatthew G. Knepley 4983f96281f8SMatthew G. Knepley Output Parameters: 4984f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 4985dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4986dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4987dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4988f96281f8SMatthew G. Knepley 4989f96281f8SMatthew G. Knepley Level: developer 4990f96281f8SMatthew G. Knepley 4991dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 4992f96281f8SMatthew G. Knepley @*/ 4993770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 4994552f7358SJed Brown { 4995552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4996770b213bSMatthew G Knepley PetscInt dim; 4997770b213bSMatthew G Knepley PetscErrorCode ierr; 4998552f7358SJed Brown 4999552f7358SJed Brown PetscFunctionBegin; 5000552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5001c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5002770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5003770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5004770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5005770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5006552f7358SJed Brown PetscFunctionReturn(0); 5007552f7358SJed Brown } 5008552f7358SJed Brown 5009552f7358SJed Brown #undef __FUNCT__ 5010770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5011dc5a3409SMatthew G. Knepley /*@ 5012dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 5013dc5a3409SMatthew G. Knepley 5014dc5a3409SMatthew G. Knepley Input Parameters: 5015dc5a3409SMatthew G. Knepley . dm - The DMPlex object 5016dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 5017dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 5018dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 5019dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 5020dc5a3409SMatthew G. Knepley 5021dc5a3409SMatthew G. Knepley Level: developer 5022dc5a3409SMatthew G. Knepley 5023dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 5024dc5a3409SMatthew G. Knepley @*/ 5025770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5026552f7358SJed Brown { 5027552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5028770b213bSMatthew G Knepley PetscInt dim; 5029770b213bSMatthew G Knepley PetscErrorCode ierr; 5030552f7358SJed Brown 5031552f7358SJed Brown PetscFunctionBegin; 5032552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5033c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5034770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5035770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5036770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5037770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5038552f7358SJed Brown PetscFunctionReturn(0); 5039552f7358SJed Brown } 5040552f7358SJed Brown 5041552f7358SJed Brown #undef __FUNCT__ 5042552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5043552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5044552f7358SJed Brown { 5045552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5046552f7358SJed Brown 5047552f7358SJed Brown PetscFunctionBegin; 5048552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5049552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5050552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5051552f7358SJed Brown PetscFunctionReturn(0); 5052552f7358SJed Brown } 5053552f7358SJed Brown 5054552f7358SJed Brown #undef __FUNCT__ 5055552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5056552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5057552f7358SJed Brown { 5058552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5059552f7358SJed Brown 5060552f7358SJed Brown PetscFunctionBegin; 5061552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5062552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5063552f7358SJed Brown PetscFunctionReturn(0); 5064552f7358SJed Brown } 5065552f7358SJed Brown 5066552f7358SJed Brown #undef __FUNCT__ 5067552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5068552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5069ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 5070552f7358SJed Brown { 5071552f7358SJed Brown PetscSection section, globalSection; 5072552f7358SJed Brown PetscInt *numbers, p; 5073552f7358SJed Brown PetscErrorCode ierr; 5074552f7358SJed Brown 5075552f7358SJed Brown PetscFunctionBegin; 507682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5077552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5078552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5079552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5080552f7358SJed Brown } 5081552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5082552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5083854ce69bSBarry Smith ierr = PetscMalloc1(pEnd - pStart, &numbers);CHKERRQ(ierr); 5084552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5085552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5086ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 5087ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 5088552f7358SJed Brown } 508982f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5090ef48cebcSMatthew G. Knepley if (globalSize) { 5091ef48cebcSMatthew G. Knepley PetscLayout layout; 5092ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 5093ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 5094ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 5095ef48cebcSMatthew G. Knepley } 5096552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5097552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5098552f7358SJed Brown PetscFunctionReturn(0); 5099552f7358SJed Brown } 5100552f7358SJed Brown 5101552f7358SJed Brown #undef __FUNCT__ 5102552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5103552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5104552f7358SJed Brown { 5105552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5106552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5107552f7358SJed Brown PetscErrorCode ierr; 5108552f7358SJed Brown 5109552f7358SJed Brown PetscFunctionBegin; 5110552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5111552f7358SJed Brown if (!mesh->globalCellNumbers) { 5112552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5113552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 51140298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 51150d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5116ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5117552f7358SJed Brown } 5118552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5119552f7358SJed Brown PetscFunctionReturn(0); 5120552f7358SJed Brown } 5121552f7358SJed Brown 5122552f7358SJed Brown #undef __FUNCT__ 5123552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5124552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5125552f7358SJed Brown { 5126552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5127552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5128552f7358SJed Brown PetscErrorCode ierr; 5129552f7358SJed Brown 5130552f7358SJed Brown PetscFunctionBegin; 5131552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5132552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5133552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 51340298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 51350d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5136ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5137552f7358SJed Brown } 5138552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5139552f7358SJed Brown PetscFunctionReturn(0); 5140552f7358SJed Brown } 5141552f7358SJed Brown 5142ef48cebcSMatthew G. Knepley #undef __FUNCT__ 5143ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 5144ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 5145ef48cebcSMatthew G. Knepley { 5146ef48cebcSMatthew G. Knepley IS nums[4]; 5147ef48cebcSMatthew G. Knepley PetscInt depths[4]; 5148ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 5149ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 5150ef48cebcSMatthew G. Knepley 5151ef48cebcSMatthew G. Knepley PetscFunctionBegin; 5152ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5153ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 51548abc87a0SMichael Lange /* For unstratified meshes use dim instead of depth */ 51558abc87a0SMichael Lange if (depth < 0) {ierr = DMGetDimension(dm, &depth);CHKERRQ(ierr);} 5156ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 5157ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 5158ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 5159ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 5160ef48cebcSMatthew G. Knepley 5161ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 5162ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 5163ef48cebcSMatthew G. Knepley shift += gsize; 5164ef48cebcSMatthew G. Knepley } 5165ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 5166ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 5167ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5168ef48cebcSMatthew G. Knepley } 5169ef48cebcSMatthew G. Knepley 5170552f7358SJed Brown 5171552f7358SJed Brown #undef __FUNCT__ 5172552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5173552f7358SJed Brown /*@C 5174552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5175552f7358SJed Brown the local section and an SF describing the section point overlap. 5176552f7358SJed Brown 5177552f7358SJed Brown Input Parameters: 5178552f7358SJed Brown + s - The PetscSection for the local field layout 5179552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5180552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5181552f7358SJed Brown . label - The label specifying the points 5182552f7358SJed Brown - labelValue - The label stratum specifying the points 5183552f7358SJed Brown 5184552f7358SJed Brown Output Parameter: 5185552f7358SJed Brown . gsection - The PetscSection for the global field layout 5186552f7358SJed Brown 5187552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5188552f7358SJed Brown 5189552f7358SJed Brown Level: developer 5190552f7358SJed Brown 5191552f7358SJed Brown .seealso: PetscSectionCreate() 5192552f7358SJed Brown @*/ 5193552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5194552f7358SJed Brown { 51957ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5196552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5197552f7358SJed Brown PetscErrorCode ierr; 5198552f7358SJed Brown 5199552f7358SJed Brown PetscFunctionBegin; 52004c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5201552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5202552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 52037ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 52047ec39499SMatthew G. Knepley if (nroots >= 0) { 52057ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 52061795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 52077ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 52081795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 52097ec39499SMatthew G. Knepley } else { 52107ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 52117ec39499SMatthew G. Knepley } 52127ec39499SMatthew G. Knepley } 5213552f7358SJed Brown /* Mark ghost points with negative dof */ 5214552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5215552f7358SJed Brown PetscInt value; 5216552f7358SJed Brown 5217552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5218552f7358SJed Brown if (value != labelValue) continue; 5219552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5220552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5221552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5222552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 52237ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5224552f7358SJed Brown } 5225552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5226552f7358SJed Brown if (nroots >= 0) { 52277ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 52287ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5229552f7358SJed Brown if (nroots > pEnd-pStart) { 52307ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5231552f7358SJed Brown } 5232552f7358SJed Brown } 5233552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5234552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5235552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5236552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5237552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5238552f7358SJed Brown } 52394c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5240552f7358SJed Brown globalOff -= off; 5241552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5242552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 52437ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5244552f7358SJed Brown } 5245552f7358SJed Brown /* Put in negative offsets for ghost points */ 5246552f7358SJed Brown if (nroots >= 0) { 52477ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 52487ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5249552f7358SJed Brown if (nroots > pEnd-pStart) { 52507ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5251552f7358SJed Brown } 5252552f7358SJed Brown } 52537ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5254552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5255552f7358SJed Brown PetscFunctionReturn(0); 5256552f7358SJed Brown } 5257ca8062c8SMatthew G. Knepley 5258ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5259ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5260ca8062c8SMatthew G. Knepley /*@ 5261ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5262ca8062c8SMatthew G. Knepley 5263ca8062c8SMatthew G. Knepley Input Parameters: 5264ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5265ca8062c8SMatthew G. Knepley 5266ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5267ca8062c8SMatthew G. Knepley 5268ca8062c8SMatthew G. Knepley Level: developer 5269ca8062c8SMatthew G. Knepley 52709bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5271ca8062c8SMatthew G. Knepley @*/ 5272ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5273ca8062c8SMatthew G. Knepley { 5274ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5275ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5276ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5277ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5278ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5279ca8062c8SMatthew G. Knepley 5280ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5281ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5282ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5283ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5284ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5285ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5286ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5287ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5288ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5289ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 529042e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 529142e66dfaSMatthew G. Knepley PetscInt d; 529242e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 529342e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 529442e66dfaSMatthew G. Knepley } 5295ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5296ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5297ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5298ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5299ca8062c8SMatthew G. Knepley } 530042e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5301ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5302ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5303ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5304ca8062c8SMatthew G. Knepley } 5305ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5306ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5307ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5308ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5309ca8062c8SMatthew G. Knepley } 5310ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 531142e66dfaSMatthew G. Knepley if (dup) { 531242e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 531342e66dfaSMatthew G. Knepley } else { 5314ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5315ca8062c8SMatthew G. Knepley } 5316ca8062c8SMatthew G. Knepley } 531742e66dfaSMatthew G. Knepley } 5318ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5319ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5320ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5321ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5322ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5323ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5324ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5325ca8062c8SMatthew G. Knepley } 5326ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5327ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5328ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5329ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5330ca8062c8SMatthew G. Knepley } 5331ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5332ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5333ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5334ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5335ca8062c8SMatthew G. Knepley } 5336ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5337ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5338ca8062c8SMatthew G. Knepley } 5339ca8062c8SMatthew G. Knepley } 5340ca8062c8SMatthew G. Knepley } 5341ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5342ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5343ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5344ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5345ca8062c8SMatthew G. Knepley } 5346ca8062c8SMatthew G. Knepley 5347ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5348ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5349ca8062c8SMatthew G. Knepley /*@ 5350ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5351ca8062c8SMatthew G. Knepley 5352ca8062c8SMatthew G. Knepley Input Parameters: 5353ca8062c8SMatthew G. Knepley + dm - The DMPlex object 535458723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 535558723a97SMatthew G. Knepley - cellHeight - Normally 0 5356ca8062c8SMatthew G. Knepley 5357ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5358ca8062c8SMatthew G. Knepley 5359ca8062c8SMatthew G. Knepley Level: developer 5360ca8062c8SMatthew G. Knepley 53619bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5362ca8062c8SMatthew G. Knepley @*/ 536358723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5364ca8062c8SMatthew G. Knepley { 536542363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5366ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5367ca8062c8SMatthew G. Knepley 5368ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5369ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5370c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5371ca8062c8SMatthew G. Knepley switch (dim) { 537242363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 537342363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 537442363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5375ca8062c8SMatthew G. Knepley default: 5376ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5377ca8062c8SMatthew G. Knepley } 537858723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 537958723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5380ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5381ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5382ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 538358723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 538458723a97SMatthew G. Knepley 538558723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 538658723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 538758723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 538858723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 538958723a97SMatthew G. Knepley } 539058723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5391ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5392ca8062c8SMatthew G. Knepley } 539342363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 539442363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 539542363296SMatthew G. Knepley 539642363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 539742363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 539842363296SMatthew G. Knepley const PetscInt p = closure[cl]; 539942363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 540042363296SMatthew G. Knepley } 540142363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 540242363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 540342363296SMatthew G. Knepley } 5404ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5405ca8062c8SMatthew G. Knepley } 54069bf0dad6SMatthew G. Knepley 54079bf0dad6SMatthew G. Knepley #undef __FUNCT__ 54089bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 54099bf0dad6SMatthew G. Knepley /*@ 54109bf0dad6SMatthew G. Knepley DMPlexCheckFaces - Check that the faces of each cell give a vertex order this is consistent with what we expect from the cell type 54119bf0dad6SMatthew G. Knepley 54129bf0dad6SMatthew G. Knepley Input Parameters: 54139bf0dad6SMatthew G. Knepley + dm - The DMPlex object 54149bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 54159bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 54169bf0dad6SMatthew G. Knepley 54179bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 54189bf0dad6SMatthew G. Knepley 54199bf0dad6SMatthew G. Knepley Level: developer 54209bf0dad6SMatthew G. Knepley 54219bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 54229bf0dad6SMatthew G. Knepley @*/ 54239bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 54249bf0dad6SMatthew G. Knepley { 54253554e41dSMatthew G. Knepley PetscInt pMax[4]; 54263554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 54279bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 54289bf0dad6SMatthew G. Knepley 54299bf0dad6SMatthew G. Knepley PetscFunctionBegin; 54309bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5431c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 54329bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 543325abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 54343554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 54353554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 54363554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 54379bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 54389bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 54399bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 54409bf0dad6SMatthew G. Knepley 544125abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 54429bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 54439bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 54449bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 54459bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 54469bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 54479bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 54489bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 54499bf0dad6SMatthew G. Knepley } 54503554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 54519bf0dad6SMatthew G. Knepley if (coneSize != numFaces) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d faces but should have %d", c, coneSize, numFaces); 54529bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 54539bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 54549bf0dad6SMatthew G. Knepley 54559bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 54569bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 54579bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 54589bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 54599bf0dad6SMatthew G. Knepley } 5460e003ed69SMatthew G. Knepley if (fnumCorners != faceSize) SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d has %d vertices but should have %d", cone[f], f, c, fnumCorners, faceSize); 54619bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5462e003ed69SMatthew G. Knepley if (fclosure[v] != faces[f*faceSize+v]) SETERRQ6(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d vertex %d, %d != %d", cone[f], f, c, v, fclosure[v], faces[f*faceSize+v]); 54639bf0dad6SMatthew G. Knepley } 54649bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 54659bf0dad6SMatthew G. Knepley } 54669bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 54679bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 54689bf0dad6SMatthew G. Knepley } 54693554e41dSMatthew G. Knepley } 5470552f7358SJed Brown PetscFunctionReturn(0); 5471552f7358SJed Brown } 54723913d7c8SMatthew G. Knepley 54733913d7c8SMatthew G. Knepley #undef __FUNCT__ 5474bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5475bceba477SMatthew G. Knepley /* Pointwise interpolation 5476bceba477SMatthew G. Knepley Just code FEM for now 5477bceba477SMatthew G. Knepley u^f = I u^c 54784ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 54794ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 54804ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5481bceba477SMatthew G. Knepley */ 5482bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5483bceba477SMatthew G. Knepley { 5484bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5485bceba477SMatthew G. Knepley PetscInt m, n; 5486a063dac3SMatthew G. Knepley void *ctx; 5487bceba477SMatthew G. Knepley PetscErrorCode ierr; 5488bceba477SMatthew G. Knepley 5489bceba477SMatthew G. Knepley PetscFunctionBegin; 5490bceba477SMatthew G. Knepley /* 5491bceba477SMatthew G. Knepley Loop over coarse cells 5492bceba477SMatthew G. Knepley Loop over coarse basis functions 5493bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5494bceba477SMatthew G. Knepley Loop over fine dual basis functions 5495bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5496bceba477SMatthew G. Knepley Sum 5497bceba477SMatthew G. Knepley Update local element matrix 5498bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5499bceba477SMatthew G. Knepley 5500bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5501bceba477SMatthew G. Knepley */ 5502bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5503bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5504bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5505bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5506bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5507bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5508bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5509bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5510a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5511a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 55125d1c2e58SMatthew G. Knepley /* Use naive scaling */ 55135d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5514a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5515a063dac3SMatthew G. Knepley } 5516bceba477SMatthew G. Knepley 5517a063dac3SMatthew G. Knepley #undef __FUNCT__ 5518a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 55196dbf9973SLawrence Mitchell PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, Mat *mat) 5520a063dac3SMatthew G. Knepley { 552190748bafSMatthew G. Knepley PetscErrorCode ierr; 55226dbf9973SLawrence Mitchell VecScatter ctx; 552390748bafSMatthew G. Knepley 5524a063dac3SMatthew G. Knepley PetscFunctionBegin; 55256dbf9973SLawrence Mitchell ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, &ctx, NULL);CHKERRQ(ierr); 55266dbf9973SLawrence Mitchell ierr = MatCreateScatter(PetscObjectComm((PetscObject)ctx), ctx, mat);CHKERRQ(ierr); 55276dbf9973SLawrence Mitchell ierr = VecScatterDestroy(&ctx);CHKERRQ(ierr); 5528bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5529bceba477SMatthew G. Knepley } 5530bceba477SMatthew G. Knepley 5531bceba477SMatthew G. Knepley #undef __FUNCT__ 5532fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5533fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5534fd59a867SMatthew G. Knepley { 5535fd59a867SMatthew G. Knepley PetscSection section; 5536fd59a867SMatthew G. Knepley IS *bcPoints; 5537ebb3236fSMatthew G. Knepley PetscBool *isFE; 5538286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5539ebb3236fSMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc = 0, f; 5540ebb3236fSMatthew G. Knepley PetscInt cStart, cEnd, cEndInterior; 5541fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5542fd59a867SMatthew G. Knepley 5543fd59a867SMatthew G. Knepley PetscFunctionBegin; 5544ebb3236fSMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5545ebb3236fSMatthew G. Knepley /* FE and FV boundary conditions are handled slightly differently */ 5546ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 5547ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5548ebb3236fSMatthew G. Knepley PetscObject obj; 5549ebb3236fSMatthew G. Knepley PetscClassId id; 5550ebb3236fSMatthew G. Knepley 5551ebb3236fSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5552ebb3236fSMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 5553ebb3236fSMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 5554ebb3236fSMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 5555ebb3236fSMatthew G. Knepley else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %d", f); 5556ebb3236fSMatthew G. Knepley } 55572f900235SMatthew G. Knepley /* Allocate boundary point storage for FEM boundaries */ 5558286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5559c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5560ebb3236fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 5561ebb3236fSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 5562fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5563fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 55642f900235SMatthew G. Knepley PetscInt field; 5565fd59a867SMatthew G. Knepley PetscBool isEssential; 55662f900235SMatthew G. Knepley 55672f900235SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, &field, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 55682f900235SMatthew G. Knepley if (isFE[field] && isEssential) ++numBC; 5569fd59a867SMatthew G. Knepley } 55702f900235SMatthew G. Knepley /* Add ghost cell boundaries for FVM */ 5571ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC; 5572fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 5573ebb3236fSMatthew G. Knepley /* Constrain ghost cells for FV */ 5574ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5575ebb3236fSMatthew G. Knepley PetscInt *newidx, c; 5576ebb3236fSMatthew G. Knepley 5577ebb3236fSMatthew G. Knepley if (isFE[f] || cEndInterior < 0) continue; 5578ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr); 5579ebb3236fSMatthew G. Knepley for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c; 5580ebb3236fSMatthew G. Knepley bcFields[bc] = f; 5581ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5582ebb3236fSMatthew G. Knepley } 5583ebb3236fSMatthew G. Knepley /* Handle FEM Dirichlet boundaries */ 5584ebb3236fSMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5585fd59a867SMatthew G. Knepley const char *bdLabel; 5586fd59a867SMatthew G. Knepley DMLabel label; 5587fd59a867SMatthew G. Knepley const PetscInt *values; 55887391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 5589c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 5590fd59a867SMatthew G. Knepley 559163d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 55922f900235SMatthew G. Knepley if (!isFE[field]) continue; 5593fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5594ebb3236fSMatthew G. Knepley /* Only want to modify label once */ 55957391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 55967391c1cbSMatthew G. Knepley const char *bdname; 55972f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 55987391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 55997391c1cbSMatthew G. Knepley if (duplicate) break; 56007391c1cbSMatthew G. Knepley } 5601ebb3236fSMatthew G. Knepley if (!duplicate && (isFE[field])) { 5602fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 560332720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 56047391c1cbSMatthew G. Knepley } 5605ebb3236fSMatthew G. Knepley /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */ 5606fd59a867SMatthew G. Knepley if (isEssential) { 560793a5981aSMatthew G. Knepley PetscInt *newidx; 5608ebb3236fSMatthew G. Knepley PetscInt n, newn = 0, p, v; 560993a5981aSMatthew G. Knepley 5610fd59a867SMatthew G. Knepley bcFields[bc] = field; 5611ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5612ebb3236fSMatthew G. Knepley IS tmp; 5613ebb3236fSMatthew G. Knepley const PetscInt *idx; 5614ebb3236fSMatthew G. Knepley 5615ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5616ebb3236fSMatthew G. Knepley if (!tmp) continue; 561793a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 561893a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5619ebb3236fSMatthew G. Knepley if (isFE[field]) { 562093a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 5621ebb3236fSMatthew G. Knepley } else { 5622ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn; 5623ebb3236fSMatthew G. Knepley } 562493a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 562593a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5626fd59a867SMatthew G. Knepley } 5627ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 5628ebb3236fSMatthew G. Knepley newn = 0; 5629ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5630ebb3236fSMatthew G. Knepley IS tmp; 5631ebb3236fSMatthew G. Knepley const PetscInt *idx; 5632ebb3236fSMatthew G. Knepley 5633ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5634ebb3236fSMatthew G. Knepley if (!tmp) continue; 5635ebb3236fSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 5636ebb3236fSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5637ebb3236fSMatthew G. Knepley if (isFE[field]) { 5638ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 5639ebb3236fSMatthew G. Knepley } else { 5640ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p]; 5641ebb3236fSMatthew G. Knepley } 5642ebb3236fSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 5643ebb3236fSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5644ebb3236fSMatthew G. Knepley } 5645ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5646ebb3236fSMatthew G. Knepley } 5647fd59a867SMatthew G. Knepley } 5648fd59a867SMatthew G. Knepley /* Handle discretization */ 5649ebb3236fSMatthew G. Knepley ierr = PetscCalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5650fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 56510bacfa0aSMatthew G. Knepley PetscObject obj; 56520bacfa0aSMatthew G. Knepley 56530bacfa0aSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5654ebb3236fSMatthew G. Knepley if (isFE[f]) { 56550bacfa0aSMatthew G. Knepley PetscFE fe = (PetscFE) obj; 5656286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5657fd59a867SMatthew G. Knepley PetscInt d; 5658fd59a867SMatthew G. Knepley 5659fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5660286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5661286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5662ebb3236fSMatthew G. Knepley } else { 56630bacfa0aSMatthew G. Knepley PetscFV fv = (PetscFV) obj; 56640bacfa0aSMatthew G. Knepley 56650bacfa0aSMatthew G. Knepley ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr); 56660bacfa0aSMatthew G. Knepley numDof[f*(dim+1)+dim] = numComp[f]; 5667ebb3236fSMatthew G. Knepley } 5668fd59a867SMatthew G. Knepley } 5669286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5670286d8613SMatthew G. Knepley PetscInt d; 5671286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5672286d8613SMatthew G. Knepley if ((numDof[f*(dim+1)+d] > 0) && (depth < dim)) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Mesh must be interpolated when unknowns are specified on edges or faces."); 5673286d8613SMatthew G. Knepley } 5674286d8613SMatthew G. Knepley } 5675f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 5676fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5677fd59a867SMatthew G. Knepley PetscFE fe; 5678fd59a867SMatthew G. Knepley const char *name; 567918abd763SMatthew G. Knepley 568018abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5681fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5682fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5683fd59a867SMatthew G. Knepley } 5684fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5685fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5686fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 5687fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 5688286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5689ebb3236fSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 5690bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5691bceba477SMatthew G. Knepley } 5692bceba477SMatthew G. Knepley 5693bceba477SMatthew G. Knepley #undef __FUNCT__ 56943913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 56953913d7c8SMatthew G. Knepley /*@ 56963913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 56973913d7c8SMatthew G. Knepley 56983913d7c8SMatthew G. Knepley Input Parameter: 56993913d7c8SMatthew G. Knepley . dm - The DMPlex object 57003913d7c8SMatthew G. Knepley 57013913d7c8SMatthew G. Knepley Output Parameter: 57023913d7c8SMatthew G. Knepley . cdm - The coarse DM 57033913d7c8SMatthew G. Knepley 57043913d7c8SMatthew G. Knepley Level: intermediate 57053913d7c8SMatthew G. Knepley 57063913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 57073913d7c8SMatthew G. Knepley @*/ 57083913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 57093913d7c8SMatthew G. Knepley { 57103913d7c8SMatthew G. Knepley PetscFunctionBegin; 57113913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 57123913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 57133913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 57143913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 57153913d7c8SMatthew G. Knepley } 57163913d7c8SMatthew G. Knepley 57173913d7c8SMatthew G. Knepley #undef __FUNCT__ 57183913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 57193913d7c8SMatthew G. Knepley /*@ 57203913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 57213913d7c8SMatthew G. Knepley 57223913d7c8SMatthew G. Knepley Input Parameters: 57233913d7c8SMatthew G. Knepley + dm - The DMPlex object 57243913d7c8SMatthew G. Knepley - cdm - The coarse DM 57253913d7c8SMatthew G. Knepley 57263913d7c8SMatthew G. Knepley Level: intermediate 57273913d7c8SMatthew G. Knepley 57283913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 57293913d7c8SMatthew G. Knepley @*/ 57303913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 57313913d7c8SMatthew G. Knepley { 57323913d7c8SMatthew G. Knepley DM_Plex *mesh; 57333913d7c8SMatthew G. Knepley PetscErrorCode ierr; 57343913d7c8SMatthew G. Knepley 57353913d7c8SMatthew G. Knepley PetscFunctionBegin; 57363913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 57373913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 57383913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 57393913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 57403913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 57413913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 57423913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 57433913d7c8SMatthew G. Knepley } 5744a68b90caSToby Isaac 5745f7c74593SToby Isaac /* anchors */ 5746a68b90caSToby Isaac #undef __FUNCT__ 5747a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors" 5748a68b90caSToby Isaac /*@ 5749f7c74593SToby Isaac DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints. Typically, the user will not have to 5750f7c74593SToby Isaac call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints(). 5751a68b90caSToby Isaac 5752e228b242SToby Isaac not collective 5753a68b90caSToby Isaac 5754a68b90caSToby Isaac Input Parameters: 5755a68b90caSToby Isaac . dm - The DMPlex object 5756a68b90caSToby Isaac 5757a68b90caSToby Isaac Output Parameters: 5758a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 5759a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 5760a68b90caSToby Isaac 5761a68b90caSToby Isaac 5762a68b90caSToby Isaac Level: intermediate 5763a68b90caSToby Isaac 5764f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints() 5765a68b90caSToby Isaac @*/ 5766a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS) 5767a68b90caSToby Isaac { 5768a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 576941e6d900SToby Isaac PetscErrorCode ierr; 5770a68b90caSToby Isaac 5771a68b90caSToby Isaac PetscFunctionBegin; 5772a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 577341e6d900SToby Isaac if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);} 5774a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 5775a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 5776a68b90caSToby Isaac PetscFunctionReturn(0); 5777a68b90caSToby Isaac } 5778a68b90caSToby Isaac 5779a68b90caSToby Isaac #undef __FUNCT__ 5780a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors" 5781a68b90caSToby Isaac /*@ 5782f7c74593SToby Isaac DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints. Unlike boundary conditions, 5783f7c74593SToby Isaac when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a 5784a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 5785a68b90caSToby Isaac 5786a17985deSToby Isaac After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling 5787f7c74593SToby Isaac DMGetConstraints() and filling in the entries in the constraint matrix. 5788a68b90caSToby Isaac 5789e228b242SToby Isaac collective on dm 5790a68b90caSToby Isaac 5791a68b90caSToby Isaac Input Parameters: 5792a68b90caSToby Isaac + dm - The DMPlex object 5793e228b242SToby Isaac . anchorSection - The section that describes the mapping from constrained points to the anchor points listed in anchorIS. Must have a local communicator (PETSC_COMM_SELF or derivative). 5794e228b242SToby Isaac - anchorIS - The list of all anchor points. Must have a local communicator (PETSC_COMM_SELF or derivative). 5795a68b90caSToby Isaac 5796a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 5797a68b90caSToby Isaac 5798a68b90caSToby Isaac Level: intermediate 5799a68b90caSToby Isaac 5800f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints() 5801a68b90caSToby Isaac @*/ 5802a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS) 5803a68b90caSToby Isaac { 5804a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 5805e228b242SToby Isaac PetscMPIInt result; 5806a68b90caSToby Isaac PetscErrorCode ierr; 5807a68b90caSToby Isaac 5808a68b90caSToby Isaac PetscFunctionBegin; 5809a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5810e228b242SToby Isaac if (anchorSection) { 5811e228b242SToby Isaac PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2); 5812e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr); 5813e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator"); 5814e228b242SToby Isaac } 5815e228b242SToby Isaac if (anchorIS) { 5816e228b242SToby Isaac PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3); 5817e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr); 5818e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator"); 5819e228b242SToby Isaac } 5820a68b90caSToby Isaac 5821a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 5822a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 5823a68b90caSToby Isaac plex->anchorSection = anchorSection; 5824a68b90caSToby Isaac 5825a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 5826a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 5827a68b90caSToby Isaac plex->anchorIS = anchorIS; 5828a68b90caSToby Isaac 5829a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 5830a68b90caSToby Isaac if (anchorIS && anchorSection) { 5831a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 5832a68b90caSToby Isaac const PetscInt *anchors; 5833a68b90caSToby Isaac 5834a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5835a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 5836a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 5837a68b90caSToby Isaac for (a = 0; a < size; a++) { 5838a68b90caSToby Isaac PetscInt p; 5839a68b90caSToby Isaac 5840a68b90caSToby Isaac p = anchors[a]; 5841a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 5842a68b90caSToby Isaac PetscInt dof; 5843a68b90caSToby Isaac 5844a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5845a68b90caSToby Isaac if (dof) { 5846a68b90caSToby Isaac PetscErrorCode ierr2; 5847a68b90caSToby Isaac 5848a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 5849a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 5850a68b90caSToby Isaac } 5851a68b90caSToby Isaac } 5852a68b90caSToby Isaac } 5853a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 5854a68b90caSToby Isaac } 5855a68b90caSToby Isaac #endif 5856f7c74593SToby Isaac /* reset the generic constraints */ 5857f7c74593SToby Isaac ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr); 5858a68b90caSToby Isaac PetscFunctionReturn(0); 5859a68b90caSToby Isaac } 5860a68b90caSToby Isaac 5861a68b90caSToby Isaac #undef __FUNCT__ 5862f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors" 5863f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec) 5864a68b90caSToby Isaac { 5865f7c74593SToby Isaac PetscSection anchorSection; 5866a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 5867a68b90caSToby Isaac PetscErrorCode ierr; 5868a68b90caSToby Isaac 5869a68b90caSToby Isaac PetscFunctionBegin; 5870a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5871a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 5872e228b242SToby Isaac ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr); 5873a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 5874a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 5875a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5876a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 5877a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 5878a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5879a68b90caSToby Isaac if (dof) { 5880a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 5881a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 5882a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 5883a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 5884a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 5885a68b90caSToby Isaac } 5886a68b90caSToby Isaac } 5887a68b90caSToby Isaac } 5888a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 5889a68b90caSToby Isaac PetscFunctionReturn(0); 5890a68b90caSToby Isaac } 5891a68b90caSToby Isaac 5892a68b90caSToby Isaac #undef __FUNCT__ 5893f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors" 5894f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat) 5895a68b90caSToby Isaac { 5896f7c74593SToby Isaac PetscSection aSec; 58970ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 58980ac89760SToby Isaac const PetscInt *anchors; 58990ac89760SToby Isaac PetscInt numFields, f; 590066ad2231SToby Isaac IS aIS; 59010ac89760SToby Isaac PetscErrorCode ierr; 59020ac89760SToby Isaac 59030ac89760SToby Isaac PetscFunctionBegin; 59040ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59050ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 59060ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 59070ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 59080ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 59090ac89760SToby Isaac ierr = MatSetType(*cMat,MATSEQAIJ); 5910a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 591166ad2231SToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 59120ac89760SToby Isaac ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr); 59130ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 59140ac89760SToby Isaac i[0] = 0; 59150ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 59160ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 59170ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 59180ac89760SToby Isaac if (!dof) continue; 59190ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 59200ac89760SToby Isaac if (numFields) { 59210ac89760SToby Isaac for (f = 0; f < numFields; f++) { 59220ac89760SToby Isaac annz = 0; 59230ac89760SToby Isaac for (q = 0; q < dof; q++) { 59240ac89760SToby Isaac a = anchors[off + q]; 59250ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 59260ac89760SToby Isaac annz += aDof; 59270ac89760SToby Isaac } 59280ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 59290ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 59300ac89760SToby Isaac for (q = 0; q < dof; q++) { 59310ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 59320ac89760SToby Isaac } 59330ac89760SToby Isaac } 59340ac89760SToby Isaac } 59350ac89760SToby Isaac else { 59360ac89760SToby Isaac annz = 0; 59370ac89760SToby Isaac for (q = 0; q < dof; q++) { 59380ac89760SToby Isaac a = anchors[off + q]; 59390ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 59400ac89760SToby Isaac annz += aDof; 59410ac89760SToby Isaac } 59420ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 59430ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 59440ac89760SToby Isaac for (q = 0; q < dof; q++) { 59450ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 59460ac89760SToby Isaac } 59470ac89760SToby Isaac } 59480ac89760SToby Isaac } 59490ac89760SToby Isaac nnz = i[m]; 59500ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 59510ac89760SToby Isaac offset = 0; 59520ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 59530ac89760SToby Isaac if (numFields) { 59540ac89760SToby Isaac for (f = 0; f < numFields; f++) { 59550ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 59560ac89760SToby Isaac for (q = 0; q < dof; q++) { 59570ac89760SToby Isaac PetscInt rDof, rOff, r; 59580ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 59590ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 59600ac89760SToby Isaac for (r = 0; r < rDof; r++) { 59610ac89760SToby Isaac PetscInt s; 59620ac89760SToby Isaac 59630ac89760SToby Isaac a = anchors[rOff + r]; 59640ac89760SToby Isaac 59650ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 59660ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 59670ac89760SToby Isaac for (s = 0; s < aDof; s++) { 59680ac89760SToby Isaac j[offset++] = aOff + s; 59690ac89760SToby Isaac } 59700ac89760SToby Isaac } 59710ac89760SToby Isaac } 59720ac89760SToby Isaac } 59730ac89760SToby Isaac } 59740ac89760SToby Isaac else { 59750ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 59760ac89760SToby Isaac for (q = 0; q < dof; q++) { 59770ac89760SToby Isaac PetscInt rDof, rOff, r; 59780ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 59790ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 59800ac89760SToby Isaac for (r = 0; r < rDof; r++) { 59810ac89760SToby Isaac PetscInt s; 59820ac89760SToby Isaac 59830ac89760SToby Isaac a = anchors[rOff + r]; 59840ac89760SToby Isaac 59850ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 59860ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 59870ac89760SToby Isaac for (s = 0; s < aDof; s++) { 59880ac89760SToby Isaac j[offset++] = aOff + s; 59890ac89760SToby Isaac } 59900ac89760SToby Isaac } 59910ac89760SToby Isaac } 59920ac89760SToby Isaac } 59930ac89760SToby Isaac } 59940ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 59950ac89760SToby Isaac ierr = PetscFree2(i,j);CHKERRQ(ierr); 599666ad2231SToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 59970ac89760SToby Isaac PetscFunctionReturn(0); 59980ac89760SToby Isaac } 59990ac89760SToby Isaac 60000ac89760SToby Isaac #undef __FUNCT__ 600166ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex" 600266ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm) 600366ad2231SToby Isaac { 6004f7c74593SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6005f7c74593SToby Isaac PetscSection anchorSection, section, cSec; 600666ad2231SToby Isaac Mat cMat; 600766ad2231SToby Isaac PetscErrorCode ierr; 600866ad2231SToby Isaac 600966ad2231SToby Isaac PetscFunctionBegin; 601066ad2231SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6011a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 601266ad2231SToby Isaac if (anchorSection) { 6013e228b242SToby Isaac PetscDS ds; 6014e228b242SToby Isaac PetscInt nf; 6015e228b242SToby Isaac 6016f7c74593SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6017f7c74593SToby Isaac ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr); 6018f7c74593SToby Isaac ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr); 6019e228b242SToby Isaac ierr = DMGetDS(dm,&ds);CHKERRQ(ierr); 6020e228b242SToby Isaac ierr = PetscDSGetNumFields(ds,&nf); 6021e228b242SToby Isaac if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);} 602266ad2231SToby Isaac ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr); 602366ad2231SToby Isaac ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr); 602466ad2231SToby Isaac ierr = MatDestroy(&cMat);CHKERRQ(ierr); 602566ad2231SToby Isaac } 602666ad2231SToby Isaac PetscFunctionReturn(0); 602766ad2231SToby Isaac } 6028