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 */ 73d822a50SMichael Lange PetscLogEvent DMPLEX_Interpolate, PETSCPARTITIONER_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeOverlap, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM, DMPLEX_InterpolatorFEM, DMPLEX_InjectorFEM; 8552f7358SJed Brown 95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 112c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 12552f7358SJed Brown 137e42fee7SMatthew G. Knepley #undef __FUNCT__ 147afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 157afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 167e42fee7SMatthew G. Knepley { 177e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 187e42fee7SMatthew G. Knepley PetscErrorCode ierr; 197e42fee7SMatthew G. Knepley 207e42fee7SMatthew G. Knepley PetscFunctionBegin; 217e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 22c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 237e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 247e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 257e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley if (field >= 0) { 277e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 287e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 297e42fee7SMatthew G. Knepley } else { 307e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley } 337e42fee7SMatthew G. Knepley if (vdof) { 347e42fee7SMatthew G. Knepley *sStart = vStart; 357e42fee7SMatthew G. Knepley *sEnd = vEnd; 367e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 377e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 387e42fee7SMatthew G. Knepley } else if (cdof) { 397e42fee7SMatthew G. Knepley *sStart = cStart; 407e42fee7SMatthew G. Knepley *sEnd = cEnd; 417e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 427e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 437e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 447e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 457e42fee7SMatthew G. Knepley } 467e42fee7SMatthew G. Knepley 47552f7358SJed Brown #undef __FUNCT__ 48552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 49552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 50552f7358SJed Brown { 51552f7358SJed Brown DM dm; 52b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 53552f7358SJed Brown PetscErrorCode ierr; 54552f7358SJed Brown 55552f7358SJed Brown PetscFunctionBegin; 56552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 5782f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 58552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 59b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 60b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 61ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 62ef31f671SMatthew G. Knepley PetscInt numFields; 63ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 64ef31f671SMatthew G. Knepley 65ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 66ef31f671SMatthew G. Knepley if (numFields) { 67ef31f671SMatthew G. Knepley PetscObject fe; 68ef31f671SMatthew G. Knepley 69ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 70ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 71ef31f671SMatthew G. Knepley } 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__ 191552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 192552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 193552f7358SJed Brown { 194552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 195552f7358SJed Brown DM cdm; 196552f7358SJed Brown DMLabel markers; 197552f7358SJed Brown PetscSection coordSection; 198552f7358SJed Brown Vec coordinates; 199552f7358SJed Brown PetscViewerFormat format; 200552f7358SJed Brown PetscErrorCode ierr; 201552f7358SJed Brown 202552f7358SJed Brown PetscFunctionBegin; 203552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 204552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 205552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 206552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 207552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 208552f7358SJed Brown const char *name; 209552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 210552f7358SJed Brown PetscInt pStart, pEnd, p; 211552f7358SJed Brown PetscMPIInt rank, size; 212552f7358SJed Brown 21382f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21482f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 215552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 216552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 217552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 220552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 221552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 223552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 224552f7358SJed Brown PetscInt dof, off, s; 225552f7358SJed Brown 226552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 228552f7358SJed Brown for (s = off; s < off+dof; ++s) { 229552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 230552f7358SJed Brown } 231552f7358SJed Brown } 232552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 233552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 234552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 235552f7358SJed Brown PetscInt dof, off, c; 236552f7358SJed Brown 237552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 238552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 239552f7358SJed Brown for (c = off; c < off+dof; ++c) { 240552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 241552f7358SJed Brown } 242552f7358SJed Brown } 243552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2440298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 245552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 246552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 247552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 248552f7358SJed Brown if (size > 1) { 249552f7358SJed Brown PetscSF sf; 250552f7358SJed Brown 251552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 253552f7358SJed Brown } 254552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 255552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 2560588280cSMatthew G. Knepley const char *name, *color; 2570588280cSMatthew G. Knepley const char *defcolors[3] = {"gray", "orange", "green"}; 2580588280cSMatthew G. Knepley const char *deflcolors[4] = {"blue", "cyan", "red", "magenta"}; 259552f7358SJed Brown PetscReal scale = 2.0; 2600588280cSMatthew G. Knepley PetscBool useNumbers = PETSC_TRUE, useLabels, useColors; 2610588280cSMatthew G. Knepley double tcoords[3]; 262552f7358SJed Brown PetscScalar *coords; 2630588280cSMatthew G. Knepley PetscInt numLabels, l, numColors, numLColors, dim, depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 264552f7358SJed Brown PetscMPIInt rank, size; 2650588280cSMatthew G. Knepley char **names, **colors, **lcolors; 266552f7358SJed Brown 2670588280cSMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 268552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2690588280cSMatthew G. Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 2700588280cSMatthew G. Knepley numLabels = PetscMax(numLabels, 10); 2710588280cSMatthew G. Knepley numColors = 10; 2720588280cSMatthew G. Knepley numLColors = 10; 2730588280cSMatthew G. Knepley ierr = PetscCalloc3(numLabels, &names, numColors, &colors, numLColors, &lcolors);CHKERRQ(ierr); 2740588280cSMatthew G. Knepley ierr = PetscOptionsGetReal(((PetscObject) viewer)->prefix, "-dm_plex_view_scale", &scale, NULL);CHKERRQ(ierr); 2750588280cSMatthew G. Knepley ierr = PetscOptionsGetBool(((PetscObject) viewer)->prefix, "-dm_plex_view_numbers", &useNumbers, NULL);CHKERRQ(ierr); 2760588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_labels", names, &numLabels, &useLabels);CHKERRQ(ierr); 2770588280cSMatthew G. Knepley if (!useLabels) numLabels = 0; 2780588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_colors", colors, &numColors, &useColors);CHKERRQ(ierr); 2790588280cSMatthew G. Knepley if (!useColors) { 2800588280cSMatthew G. Knepley numColors = 3; 2810588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscStrallocpy(defcolors[c], &colors[c]);CHKERRQ(ierr);} 2820588280cSMatthew G. Knepley } 2830588280cSMatthew G. Knepley ierr = PetscOptionsGetStringArray(((PetscObject) viewer)->prefix, "-dm_plex_view_lcolors", lcolors, &numLColors, &useColors);CHKERRQ(ierr); 2840588280cSMatthew G. Knepley if (!useColors) { 2850588280cSMatthew G. Knepley numLColors = 4; 2860588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscStrallocpy(deflcolors[c], &lcolors[c]);CHKERRQ(ierr);} 2870588280cSMatthew G. Knepley } 28882f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 28982f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 290552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 291552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 292770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 2930588280cSMatthew G. Knepley \\documentclass[tikz]{standalone}\n\n\ 294552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 295552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 296552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 2970588280cSMatthew G. Knepley \\begin{document}\n");CHKERRQ(ierr); 2980588280cSMatthew G. Knepley if (size > 1) { 299f738dd31SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "%s for process ", name);CHKERRQ(ierr); 300770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 301770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 302770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 303770b213bSMatthew G Knepley } else if (p > 0) { 304770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 305770b213bSMatthew G Knepley } 306770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 307770b213bSMatthew G Knepley } 3080588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n");CHKERRQ(ierr); 3090588280cSMatthew G. Knepley } 3100588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n", 1.0);CHKERRQ(ierr); 311552f7358SJed Brown /* Plot vertices */ 312552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 313552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 314552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 315552f7358SJed Brown PetscInt off, dof, d; 3160588280cSMatthew G. Knepley PetscBool isLabeled = PETSC_FALSE; 317552f7358SJed Brown 318552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 319552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3200588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\path (");CHKERRQ(ierr); 3210588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 3220588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[off+d])); 3230588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 3240588280cSMatthew G. Knepley } 3250588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 3260588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 327552f7358SJed Brown for (d = 0; d < dof; ++d) { 328552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3290588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 330552f7358SJed Brown } 3310588280cSMatthew G. Knepley color = colors[rank%numColors]; 3320588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 3330588280cSMatthew G. Knepley PetscInt val; 3340588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 3350588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; isLabeled = PETSC_TRUE; break;} 3360588280cSMatthew G. Knepley } 3370588280cSMatthew G. Knepley if (useNumbers) { 3380588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D};\n", v, rank, color, v);CHKERRQ(ierr); 3390588280cSMatthew G. Knepley } else { 3400588280cSMatthew 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); 3410588280cSMatthew G. Knepley } 342552f7358SJed Brown } 343552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 344552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 345552f7358SJed Brown /* Plot edges */ 3460588280cSMatthew G. Knepley if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 3470588280cSMatthew G. Knepley if (dim < 3 && useNumbers) { 348552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 349552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 350552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 351552f7358SJed Brown const PetscInt *cone; 352552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 353552f7358SJed Brown 354552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 35582f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 356552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 357552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 358552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 359552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 360552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 361552f7358SJed Brown for (d = 0; d < dof; ++d) { 3620588280cSMatthew G. Knepley tcoords[d] = (double) (scale*PetscRealPart(coords[offA+d]+coords[offB+d])); 3630588280cSMatthew G. Knepley tcoords[d] = PetscAbsReal(tcoords[d]) < 1e-10 ? 0.0 : tcoords[d]; 364552f7358SJed Brown } 3650588280cSMatthew G. Knepley /* Rotate coordinates since PGF makes z point out of the page instead of up */ 3660588280cSMatthew G. Knepley if (dim == 3) {PetscReal tmp = tcoords[1]; tcoords[1] = tcoords[2]; tcoords[2] = -tmp;} 3670588280cSMatthew G. Knepley for (d = 0; d < dof; ++d) { 3680588280cSMatthew G. Knepley if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3690588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", tcoords[d]);CHKERRQ(ierr); 3700588280cSMatthew G. Knepley } 3710588280cSMatthew G. Knepley color = colors[rank%numColors]; 3720588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) { 3730588280cSMatthew G. Knepley PetscInt val; 3740588280cSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, names[l], v, &val);CHKERRQ(ierr); 3750750fff4SMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 3760588280cSMatthew G. Knepley } 3770588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, color, e);CHKERRQ(ierr); 378552f7358SJed Brown } 379552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 380552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 381552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 3820588280cSMatthew G. Knepley } 383552f7358SJed Brown /* Plot cells */ 3840588280cSMatthew G. Knepley if (dim == 3 || !useNumbers) { 3850588280cSMatthew G. Knepley for (e = eStart; e < eEnd; ++e) { 3860588280cSMatthew G. Knepley const PetscInt *cone; 3870588280cSMatthew G. Knepley 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], e, &val);CHKERRQ(ierr); 3920588280cSMatthew G. Knepley if (val >= 0) {color = lcolors[l%numLColors]; break;} 3930588280cSMatthew G. Knepley } 3940588280cSMatthew G. Knepley ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 3950588280cSMatthew G. Knepley ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] (%D_%D) -- (%D_%D);\n", color, cone[0], rank, cone[1], rank);CHKERRQ(ierr); 3960588280cSMatthew G. Knepley } 3970588280cSMatthew G. Knepley } else { 398552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 399552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4000298fd71SBarry Smith PetscInt *closure = NULL; 401552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 402552f7358SJed Brown 403552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 404552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 405552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 406552f7358SJed Brown const PetscInt point = closure[p]; 407552f7358SJed Brown 408552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 409552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 410552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 411552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 412552f7358SJed Brown } 413552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 414552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 415552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 416552f7358SJed Brown } 4170588280cSMatthew G. Knepley } 418552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 4190588280cSMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n");CHKERRQ(ierr); 420770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 4210588280cSMatthew G. Knepley for (l = 0; l < numLabels; ++l) {ierr = PetscFree(names[l]);CHKERRQ(ierr);} 4220588280cSMatthew G. Knepley for (c = 0; c < numColors; ++c) {ierr = PetscFree(colors[c]);CHKERRQ(ierr);} 4230588280cSMatthew G. Knepley for (c = 0; c < numLColors; ++c) {ierr = PetscFree(lcolors[c]);CHKERRQ(ierr);} 4240588280cSMatthew G. Knepley ierr = PetscFree3(names, colors, lcolors);CHKERRQ(ierr); 425552f7358SJed Brown } else { 42682f516ccSBarry Smith MPI_Comm comm; 427834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 428834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 429552f7358SJed Brown PetscInt pStart, pEnd, p; 430a57dd577SMatthew G Knepley PetscInt numLabels, l; 4311143a3c0SMatthew G. Knepley const char *name; 432552f7358SJed Brown PetscMPIInt size; 433552f7358SJed Brown 43482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 435552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 436c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4375f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 4381143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 4391143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 440552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 441552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 442bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 443dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 444552f7358SJed Brown if (depth == 1) { 445552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 446552f7358SJed Brown pEnd = pEnd - pStart; 447552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 448552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 449552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 450552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 451552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 452552f7358SJed Brown pEnd = pEnd - pStart; 453552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 454552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 455552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 456552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 457552f7358SJed Brown } else { 458552f7358SJed Brown for (d = 0; d <= dim; d++) { 459552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 460834065abSMatthew G. Knepley pEnd -= pStart; 461834065abSMatthew G. Knepley pMax[d] -= pStart; 462552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 463834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 464552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 465834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 466834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 467834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 468834065abSMatthew G. Knepley } 469552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 470552f7358SJed Brown } 471552f7358SJed Brown } 472834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 473a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 474a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 475a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 476a57dd577SMatthew G Knepley DMLabel label; 477a57dd577SMatthew G Knepley const char *name; 478a57dd577SMatthew G Knepley IS valueIS; 479a57dd577SMatthew G Knepley const PetscInt *values; 480a57dd577SMatthew G Knepley PetscInt numValues, v; 481a57dd577SMatthew G Knepley 482a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 483a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 484a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 485a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 486a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 487a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 488a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 489a57dd577SMatthew G Knepley PetscInt size; 490a57dd577SMatthew G Knepley 491a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 492a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 493a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 494a57dd577SMatthew G Knepley } 495a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 496a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4974d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 498a57dd577SMatthew G Knepley } 499552f7358SJed Brown } 500552f7358SJed Brown PetscFunctionReturn(0); 501552f7358SJed Brown } 502552f7358SJed Brown 503552f7358SJed Brown #undef __FUNCT__ 504552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 505552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 506552f7358SJed Brown { 507fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 508552f7358SJed Brown PetscErrorCode ierr; 509552f7358SJed Brown 510552f7358SJed Brown PetscFunctionBegin; 511552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 512552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 513552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 514fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 515c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 516552f7358SJed Brown if (iascii) { 517552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 518c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 519c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 5207afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 521c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 5227afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 523c6ccd67eSMatthew G. Knepley #else 524c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 525552f7358SJed Brown #endif 52611aeaf0aSBarry Smith } 527fcf6c8fdSToby Isaac else if (isvtk) { 528fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 529fcf6c8fdSToby Isaac } 530552f7358SJed Brown PetscFunctionReturn(0); 531552f7358SJed Brown } 532552f7358SJed Brown 5332c40f234SMatthew G. Knepley #undef __FUNCT__ 5342c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 5352c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 5362c40f234SMatthew G. Knepley { 5372c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 5382c40f234SMatthew G. Knepley PetscErrorCode ierr; 5392c40f234SMatthew G. Knepley 5402c40f234SMatthew G. Knepley PetscFunctionBegin; 5412c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5422c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 5432c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 5442c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 5452c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 5462c40f234SMatthew G. Knepley else if (ishdf5) { 5472c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 54810b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 5492c40f234SMatthew G. Knepley #else 5502c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 551552f7358SJed Brown #endif 552552f7358SJed Brown } 553552f7358SJed Brown PetscFunctionReturn(0); 554552f7358SJed Brown } 555552f7358SJed Brown 556552f7358SJed Brown #undef __FUNCT__ 5576c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 5586c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 5596c73c22cSMatthew G. Knepley { 5606c73c22cSMatthew G. Knepley DMBoundary b, next; 5616c73c22cSMatthew G. Knepley PetscErrorCode ierr; 5626c73c22cSMatthew G. Knepley 5638e136ac0SMatthew G. Knepley PetscFunctionBegin; 5646c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 5656c73c22cSMatthew G. Knepley b = *boundary; 5666c73c22cSMatthew G. Knepley *boundary = NULL; 5676c73c22cSMatthew G. Knepley for (; b; b = next) { 5686c73c22cSMatthew G. Knepley next = b->next; 5696c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5706c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 57163d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 5726c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5736c73c22cSMatthew G. Knepley } 5746c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5756c73c22cSMatthew G. Knepley } 5766c73c22cSMatthew G. Knepley 5776c73c22cSMatthew G. Knepley #undef __FUNCT__ 578552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 579552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 580552f7358SJed Brown { 581552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 582a85475f2SMatthew G. Knepley PlexLabel next = mesh->labels; 583552f7358SJed Brown PetscErrorCode ierr; 584552f7358SJed Brown 585552f7358SJed Brown PetscFunctionBegin; 5860d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 587552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 588552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 589552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 590552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 591552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 592552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 593d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->tetgenOpts);CHKERRQ(ierr); 594d9deefdfSMatthew G. Knepley ierr = PetscFree(mesh->triangleOpts);CHKERRQ(ierr); 59577623264SMatthew G. Knepley ierr = PetscPartitionerDestroy(&mesh->partitioner);CHKERRQ(ierr); 596552f7358SJed Brown while (next) { 597a85475f2SMatthew G. Knepley PlexLabel tmp = next->next; 598552f7358SJed Brown 599a85475f2SMatthew G. Knepley ierr = DMLabelDestroy(&next->label);CHKERRQ(ierr); 600a85475f2SMatthew G. Knepley ierr = PetscFree(next);CHKERRQ(ierr); 601552f7358SJed Brown next = tmp; 602552f7358SJed Brown } 6033913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 604a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 605552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 606552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 6076c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 608a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 609a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 610d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr); 611d961a43aSToby Isaac ierr = PetscFree(mesh->parents);CHKERRQ(ierr); 612d961a43aSToby Isaac ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr); 613d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr); 614d961a43aSToby Isaac ierr = PetscFree(mesh->children);CHKERRQ(ierr); 615d6a7ad0dSToby Isaac ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr); 616552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 617552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 618552f7358SJed Brown PetscFunctionReturn(0); 619552f7358SJed Brown } 620552f7358SJed Brown 621552f7358SJed Brown #undef __FUNCT__ 622552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 623b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 624552f7358SJed Brown { 625552f7358SJed Brown PetscSection section, sectionGlobal; 626552f7358SJed Brown PetscInt bs = -1; 627552f7358SJed Brown PetscInt localSize; 62889545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 629552f7358SJed Brown PetscErrorCode ierr; 630b412c318SBarry Smith MatType mtype; 6311428887cSShri Abhyankar ISLocalToGlobalMapping ltog; 632552f7358SJed Brown 633552f7358SJed Brown PetscFunctionBegin; 634607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 635b412c318SBarry Smith mtype = dm->mattype; 636552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 637552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 638552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 639552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 64082f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 641552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 642552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 643552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 644552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 645552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 646552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 647552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 648552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 649552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 650552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 651552f7358SJed Brown if (!isShell) { 652552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 6532a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 654552f7358SJed Brown 655552f7358SJed Brown if (bs < 0) { 656552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 657fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 658552f7358SJed Brown 659552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 660552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 661552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 662fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 663fad22124SMatthew G Knepley if (dof-cdof) { 6642a28c762SMatthew G Knepley if (bs < 0) { 665fad22124SMatthew G Knepley bs = dof-cdof; 666fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 6672a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 6682a28c762SMatthew G Knepley bs = 1; 669552f7358SJed Brown break; 670552f7358SJed Brown } 671552f7358SJed Brown } 6722a28c762SMatthew G Knepley } 6732a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 6742a28c762SMatthew G Knepley bsLocal = bs; 67582f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6762a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 67782f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6782a28c762SMatthew G Knepley if (bsMin != bsMax) { 6792a28c762SMatthew G Knepley bs = 1; 6802a28c762SMatthew G Knepley } else { 6812a28c762SMatthew G Knepley bs = bsMax; 6822a28c762SMatthew G Knepley } 683552f7358SJed Brown } else { 684552f7358SJed Brown bs = 1; 685552f7358SJed Brown } 686552f7358SJed Brown } 6871795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 688552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 689552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 6901428887cSShri Abhyankar 6911428887cSShri Abhyankar /* Set localtoglobalmapping on the matrix for MatSetValuesLocal() to work */ 6921428887cSShri Abhyankar ierr = DMGetLocalToGlobalMapping(dm,<og);CHKERRQ(ierr); 6931428887cSShri Abhyankar ierr = MatSetLocalToGlobalMapping(*J,ltog,ltog);CHKERRQ(ierr); 694552f7358SJed Brown } 695552f7358SJed Brown PetscFunctionReturn(0); 696552f7358SJed Brown } 697552f7358SJed Brown 698552f7358SJed Brown #undef __FUNCT__ 699552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 700552f7358SJed Brown /*@ 701552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 702552f7358SJed Brown 703552f7358SJed Brown Not collective 704552f7358SJed Brown 705552f7358SJed Brown Input Parameter: 706552f7358SJed Brown . mesh - The DMPlex 707552f7358SJed Brown 708552f7358SJed Brown Output Parameters: 709552f7358SJed Brown + pStart - The first mesh point 710552f7358SJed Brown - pEnd - The upper bound for mesh points 711552f7358SJed Brown 712552f7358SJed Brown Level: beginner 713552f7358SJed Brown 714552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 715552f7358SJed Brown @*/ 716552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 717552f7358SJed Brown { 718552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 719552f7358SJed Brown PetscErrorCode ierr; 720552f7358SJed Brown 721552f7358SJed Brown PetscFunctionBegin; 722552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 723552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 724552f7358SJed Brown PetscFunctionReturn(0); 725552f7358SJed Brown } 726552f7358SJed Brown 727552f7358SJed Brown #undef __FUNCT__ 728552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 729552f7358SJed Brown /*@ 730552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 731552f7358SJed Brown 732552f7358SJed Brown Not collective 733552f7358SJed Brown 734552f7358SJed Brown Input Parameters: 735552f7358SJed Brown + mesh - The DMPlex 736552f7358SJed Brown . pStart - The first mesh point 737552f7358SJed Brown - pEnd - The upper bound for mesh points 738552f7358SJed Brown 739552f7358SJed Brown Output Parameters: 740552f7358SJed Brown 741552f7358SJed Brown Level: beginner 742552f7358SJed Brown 743552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 744552f7358SJed Brown @*/ 745552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 746552f7358SJed Brown { 747552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 748552f7358SJed Brown PetscErrorCode ierr; 749552f7358SJed Brown 750552f7358SJed Brown PetscFunctionBegin; 751552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 752552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 753552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 754552f7358SJed Brown PetscFunctionReturn(0); 755552f7358SJed Brown } 756552f7358SJed Brown 757552f7358SJed Brown #undef __FUNCT__ 758552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 759552f7358SJed Brown /*@ 760552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 761552f7358SJed Brown 762552f7358SJed Brown Not collective 763552f7358SJed Brown 764552f7358SJed Brown Input Parameters: 765552f7358SJed Brown + mesh - The DMPlex 766552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 767552f7358SJed Brown 768552f7358SJed Brown Output Parameter: 769552f7358SJed Brown . size - The cone size for point p 770552f7358SJed Brown 771552f7358SJed Brown Level: beginner 772552f7358SJed Brown 773552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 774552f7358SJed Brown @*/ 775552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 776552f7358SJed Brown { 777552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 778552f7358SJed Brown PetscErrorCode ierr; 779552f7358SJed Brown 780552f7358SJed Brown PetscFunctionBegin; 781552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 782552f7358SJed Brown PetscValidPointer(size, 3); 783552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 784552f7358SJed Brown PetscFunctionReturn(0); 785552f7358SJed Brown } 786552f7358SJed Brown 787552f7358SJed Brown #undef __FUNCT__ 788552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 789552f7358SJed Brown /*@ 790552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 791552f7358SJed Brown 792552f7358SJed Brown Not collective 793552f7358SJed Brown 794552f7358SJed Brown Input Parameters: 795552f7358SJed Brown + mesh - The DMPlex 796552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 797552f7358SJed Brown - size - The cone size for point p 798552f7358SJed Brown 799552f7358SJed Brown Output Parameter: 800552f7358SJed Brown 801552f7358SJed Brown Note: 802552f7358SJed Brown This should be called after DMPlexSetChart(). 803552f7358SJed Brown 804552f7358SJed Brown Level: beginner 805552f7358SJed Brown 806552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 807552f7358SJed Brown @*/ 808552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 809552f7358SJed Brown { 810552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 811552f7358SJed Brown PetscErrorCode ierr; 812552f7358SJed Brown 813552f7358SJed Brown PetscFunctionBegin; 814552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 815552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 8160d644c17SKarl Rupp 817552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 818552f7358SJed Brown PetscFunctionReturn(0); 819552f7358SJed Brown } 820552f7358SJed Brown 821552f7358SJed Brown #undef __FUNCT__ 822f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 823f5a469b9SMatthew G. Knepley /*@ 824f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 825f5a469b9SMatthew G. Knepley 826f5a469b9SMatthew G. Knepley Not collective 827f5a469b9SMatthew G. Knepley 828f5a469b9SMatthew G. Knepley Input Parameters: 829f5a469b9SMatthew G. Knepley + mesh - The DMPlex 830f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 831f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 832f5a469b9SMatthew G. Knepley 833f5a469b9SMatthew G. Knepley Output Parameter: 834f5a469b9SMatthew G. Knepley 835f5a469b9SMatthew G. Knepley Note: 836f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 837f5a469b9SMatthew G. Knepley 838f5a469b9SMatthew G. Knepley Level: beginner 839f5a469b9SMatthew G. Knepley 840f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 841f5a469b9SMatthew G. Knepley @*/ 842f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 843f5a469b9SMatthew G. Knepley { 844f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 845f5a469b9SMatthew G. Knepley PetscInt csize; 846f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 847f5a469b9SMatthew G. Knepley 848f5a469b9SMatthew G. Knepley PetscFunctionBegin; 849f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 850f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 851f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 852f5a469b9SMatthew G. Knepley 853f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 854f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 855f5a469b9SMatthew G. Knepley } 856f5a469b9SMatthew G. Knepley 857f5a469b9SMatthew G. Knepley #undef __FUNCT__ 858552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 859552f7358SJed Brown /*@C 860552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 861552f7358SJed Brown 862552f7358SJed Brown Not collective 863552f7358SJed Brown 864552f7358SJed Brown Input Parameters: 865552f7358SJed Brown + mesh - The DMPlex 866552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 867552f7358SJed Brown 868552f7358SJed Brown Output Parameter: 869552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 870552f7358SJed Brown 871552f7358SJed Brown Level: beginner 872552f7358SJed Brown 8733813dfbdSMatthew G Knepley Fortran Notes: 8743813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8753813dfbdSMatthew G Knepley include petsc.h90 in your code. 8763813dfbdSMatthew G Knepley 8773813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 878552f7358SJed Brown 879552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 880552f7358SJed Brown @*/ 881552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 882552f7358SJed Brown { 883552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 884552f7358SJed Brown PetscInt off; 885552f7358SJed Brown PetscErrorCode ierr; 886552f7358SJed Brown 887552f7358SJed Brown PetscFunctionBegin; 888552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 889552f7358SJed Brown PetscValidPointer(cone, 3); 890552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 891552f7358SJed Brown *cone = &mesh->cones[off]; 892552f7358SJed Brown PetscFunctionReturn(0); 893552f7358SJed Brown } 894552f7358SJed Brown 895552f7358SJed Brown #undef __FUNCT__ 896552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 897552f7358SJed Brown /*@ 898552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 899552f7358SJed Brown 900552f7358SJed Brown Not collective 901552f7358SJed Brown 902552f7358SJed Brown Input Parameters: 903552f7358SJed Brown + mesh - The DMPlex 904552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 905552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 906552f7358SJed Brown 907552f7358SJed Brown Output Parameter: 908552f7358SJed Brown 909552f7358SJed Brown Note: 910552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 911552f7358SJed Brown 912552f7358SJed Brown Level: beginner 913552f7358SJed Brown 914552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 915552f7358SJed Brown @*/ 916552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 917552f7358SJed Brown { 918552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 919552f7358SJed Brown PetscInt pStart, pEnd; 920552f7358SJed Brown PetscInt dof, off, c; 921552f7358SJed Brown PetscErrorCode ierr; 922552f7358SJed Brown 923552f7358SJed Brown PetscFunctionBegin; 924552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 925552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 926552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 927552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 928552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 92982f516ccSBarry 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); 930552f7358SJed Brown for (c = 0; c < dof; ++c) { 93182f516ccSBarry 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); 932552f7358SJed Brown mesh->cones[off+c] = cone[c]; 933552f7358SJed Brown } 934552f7358SJed Brown PetscFunctionReturn(0); 935552f7358SJed Brown } 936552f7358SJed Brown 937552f7358SJed Brown #undef __FUNCT__ 938552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 939552f7358SJed Brown /*@C 940552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 941552f7358SJed Brown 942552f7358SJed Brown Not collective 943552f7358SJed Brown 944552f7358SJed Brown Input Parameters: 945552f7358SJed Brown + mesh - The DMPlex 946552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 947552f7358SJed Brown 948552f7358SJed Brown Output Parameter: 949552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 950552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 951552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 952552f7358SJed Brown the index of the cone point on which to start. 953552f7358SJed Brown 954552f7358SJed Brown Level: beginner 955552f7358SJed Brown 9563813dfbdSMatthew G Knepley Fortran Notes: 9573813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9583813dfbdSMatthew G Knepley include petsc.h90 in your code. 9593813dfbdSMatthew G Knepley 9603813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 961552f7358SJed Brown 962552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 963552f7358SJed Brown @*/ 964552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 965552f7358SJed Brown { 966552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 967552f7358SJed Brown PetscInt off; 968552f7358SJed Brown PetscErrorCode ierr; 969552f7358SJed Brown 970552f7358SJed Brown PetscFunctionBegin; 971552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 972552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 973552f7358SJed Brown { 974552f7358SJed Brown PetscInt dof; 975552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 976552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 977552f7358SJed Brown } 978552f7358SJed Brown #endif 979552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9800d644c17SKarl Rupp 981552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 982552f7358SJed Brown PetscFunctionReturn(0); 983552f7358SJed Brown } 984552f7358SJed Brown 985552f7358SJed Brown #undef __FUNCT__ 986552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 987552f7358SJed Brown /*@ 988552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 989552f7358SJed Brown 990552f7358SJed Brown Not collective 991552f7358SJed Brown 992552f7358SJed Brown Input Parameters: 993552f7358SJed Brown + mesh - The DMPlex 994552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 995552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 996552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 997552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 998552f7358SJed Brown the index of the cone point on which to start. 999552f7358SJed Brown 1000552f7358SJed Brown Output Parameter: 1001552f7358SJed Brown 1002552f7358SJed Brown Note: 1003552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 1004552f7358SJed Brown 1005552f7358SJed Brown Level: beginner 1006552f7358SJed Brown 1007552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 1008552f7358SJed Brown @*/ 1009552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 1010552f7358SJed Brown { 1011552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1012552f7358SJed Brown PetscInt pStart, pEnd; 1013552f7358SJed Brown PetscInt dof, off, c; 1014552f7358SJed Brown PetscErrorCode ierr; 1015552f7358SJed Brown 1016552f7358SJed Brown PetscFunctionBegin; 1017552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1018552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 1019552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1020552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 1021552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 102282f516ccSBarry 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); 1023552f7358SJed Brown for (c = 0; c < dof; ++c) { 1024552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 1025552f7358SJed Brown 1026552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 102782f516ccSBarry 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); 1028552f7358SJed Brown mesh->coneOrientations[off+c] = o; 1029552f7358SJed Brown } 1030552f7358SJed Brown PetscFunctionReturn(0); 1031552f7358SJed Brown } 1032552f7358SJed Brown 1033552f7358SJed Brown #undef __FUNCT__ 1034552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 1035552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 1036552f7358SJed Brown { 1037552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1038552f7358SJed Brown PetscInt pStart, pEnd; 1039552f7358SJed Brown PetscInt dof, off; 1040552f7358SJed Brown PetscErrorCode ierr; 1041552f7358SJed Brown 1042552f7358SJed Brown PetscFunctionBegin; 1043552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1044552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 104582f516ccSBarry 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); 104682f516ccSBarry 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); 104777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 104877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 104977c88f5bSMatthew 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); 1050552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 1051552f7358SJed Brown PetscFunctionReturn(0); 1052552f7358SJed Brown } 1053552f7358SJed Brown 1054552f7358SJed Brown #undef __FUNCT__ 105577c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 105677c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 105777c88f5bSMatthew G Knepley { 105877c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 105977c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 106077c88f5bSMatthew G Knepley PetscInt dof, off; 106177c88f5bSMatthew G Knepley PetscErrorCode ierr; 106277c88f5bSMatthew G Knepley 106377c88f5bSMatthew G Knepley PetscFunctionBegin; 106477c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 106577c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 106677c88f5bSMatthew 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); 106777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 106877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 106977c88f5bSMatthew 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); 107077c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 107177c88f5bSMatthew G Knepley PetscFunctionReturn(0); 107277c88f5bSMatthew G Knepley } 107377c88f5bSMatthew G Knepley 107477c88f5bSMatthew G Knepley #undef __FUNCT__ 1075552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1076552f7358SJed Brown /*@ 1077552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1078552f7358SJed Brown 1079552f7358SJed Brown Not collective 1080552f7358SJed Brown 1081552f7358SJed Brown Input Parameters: 1082552f7358SJed Brown + mesh - The DMPlex 1083552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1084552f7358SJed Brown 1085552f7358SJed Brown Output Parameter: 1086552f7358SJed Brown . size - The support size for point p 1087552f7358SJed Brown 1088552f7358SJed Brown Level: beginner 1089552f7358SJed Brown 1090552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1091552f7358SJed Brown @*/ 1092552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1093552f7358SJed Brown { 1094552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1095552f7358SJed Brown PetscErrorCode ierr; 1096552f7358SJed Brown 1097552f7358SJed Brown PetscFunctionBegin; 1098552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1099552f7358SJed Brown PetscValidPointer(size, 3); 1100552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1101552f7358SJed Brown PetscFunctionReturn(0); 1102552f7358SJed Brown } 1103552f7358SJed Brown 1104552f7358SJed Brown #undef __FUNCT__ 1105552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1106552f7358SJed Brown /*@ 1107552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1108552f7358SJed Brown 1109552f7358SJed Brown Not collective 1110552f7358SJed Brown 1111552f7358SJed Brown Input Parameters: 1112552f7358SJed Brown + mesh - The DMPlex 1113552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1114552f7358SJed Brown - size - The support size for point p 1115552f7358SJed Brown 1116552f7358SJed Brown Output Parameter: 1117552f7358SJed Brown 1118552f7358SJed Brown Note: 1119552f7358SJed Brown This should be called after DMPlexSetChart(). 1120552f7358SJed Brown 1121552f7358SJed Brown Level: beginner 1122552f7358SJed Brown 1123552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1124552f7358SJed Brown @*/ 1125552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1126552f7358SJed Brown { 1127552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1128552f7358SJed Brown PetscErrorCode ierr; 1129552f7358SJed Brown 1130552f7358SJed Brown PetscFunctionBegin; 1131552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1132552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 11330d644c17SKarl Rupp 1134552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1135552f7358SJed Brown PetscFunctionReturn(0); 1136552f7358SJed Brown } 1137552f7358SJed Brown 1138552f7358SJed Brown #undef __FUNCT__ 1139552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1140552f7358SJed Brown /*@C 1141552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1142552f7358SJed Brown 1143552f7358SJed Brown Not collective 1144552f7358SJed Brown 1145552f7358SJed Brown Input Parameters: 1146552f7358SJed Brown + mesh - The DMPlex 1147552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1148552f7358SJed Brown 1149552f7358SJed Brown Output Parameter: 1150552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1151552f7358SJed Brown 1152552f7358SJed Brown Level: beginner 1153552f7358SJed Brown 11543813dfbdSMatthew G Knepley Fortran Notes: 11553813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11563813dfbdSMatthew G Knepley include petsc.h90 in your code. 11573813dfbdSMatthew G Knepley 11583813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 11593813dfbdSMatthew G Knepley 1160552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1161552f7358SJed Brown @*/ 1162552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1163552f7358SJed Brown { 1164552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1165552f7358SJed Brown PetscInt off; 1166552f7358SJed Brown PetscErrorCode ierr; 1167552f7358SJed Brown 1168552f7358SJed Brown PetscFunctionBegin; 1169552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1170552f7358SJed Brown PetscValidPointer(support, 3); 1171552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1172552f7358SJed Brown *support = &mesh->supports[off]; 1173552f7358SJed Brown PetscFunctionReturn(0); 1174552f7358SJed Brown } 1175552f7358SJed Brown 1176552f7358SJed Brown #undef __FUNCT__ 1177552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1178552f7358SJed Brown /*@ 1179552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1180552f7358SJed Brown 1181552f7358SJed Brown Not collective 1182552f7358SJed Brown 1183552f7358SJed Brown Input Parameters: 1184552f7358SJed Brown + mesh - The DMPlex 1185552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1186552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1187552f7358SJed Brown 1188552f7358SJed Brown Output Parameter: 1189552f7358SJed Brown 1190552f7358SJed Brown Note: 1191552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1192552f7358SJed Brown 1193552f7358SJed Brown Level: beginner 1194552f7358SJed Brown 1195552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1196552f7358SJed Brown @*/ 1197552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1198552f7358SJed Brown { 1199552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1200552f7358SJed Brown PetscInt pStart, pEnd; 1201552f7358SJed Brown PetscInt dof, off, c; 1202552f7358SJed Brown PetscErrorCode ierr; 1203552f7358SJed Brown 1204552f7358SJed Brown PetscFunctionBegin; 1205552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1206552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1207552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1208552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1209552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 121082f516ccSBarry 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); 1211552f7358SJed Brown for (c = 0; c < dof; ++c) { 121282f516ccSBarry 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); 1213552f7358SJed Brown mesh->supports[off+c] = support[c]; 1214552f7358SJed Brown } 1215552f7358SJed Brown PetscFunctionReturn(0); 1216552f7358SJed Brown } 1217552f7358SJed Brown 1218552f7358SJed Brown #undef __FUNCT__ 1219552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1220552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1221552f7358SJed Brown { 1222552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1223552f7358SJed Brown PetscInt pStart, pEnd; 1224552f7358SJed Brown PetscInt dof, off; 1225552f7358SJed Brown PetscErrorCode ierr; 1226552f7358SJed Brown 1227552f7358SJed Brown PetscFunctionBegin; 1228552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1229552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1230552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1231552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 123282f516ccSBarry 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); 123382f516ccSBarry 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); 123482f516ccSBarry 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); 1235552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1236552f7358SJed Brown PetscFunctionReturn(0); 1237552f7358SJed Brown } 1238552f7358SJed Brown 1239552f7358SJed Brown #undef __FUNCT__ 1240552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1241552f7358SJed Brown /*@C 1242552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1243552f7358SJed Brown 1244552f7358SJed Brown Not collective 1245552f7358SJed Brown 1246552f7358SJed Brown Input Parameters: 1247552f7358SJed Brown + mesh - The DMPlex 1248552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1249552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12500298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1251552f7358SJed Brown 1252552f7358SJed Brown Output Parameters: 1253552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1254552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1255552f7358SJed Brown 1256552f7358SJed Brown Note: 12570298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1258552f7358SJed Brown 12593813dfbdSMatthew G Knepley Fortran Notes: 12603813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12613813dfbdSMatthew G Knepley include petsc.h90 in your code. 12623813dfbdSMatthew G Knepley 12633813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12643813dfbdSMatthew G Knepley 1265552f7358SJed Brown Level: beginner 1266552f7358SJed Brown 1267552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1268552f7358SJed Brown @*/ 1269552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1270552f7358SJed Brown { 1271552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1272552f7358SJed Brown PetscInt *closure, *fifo; 12730298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1274552f7358SJed Brown PetscInt tmpSize, t; 1275552f7358SJed Brown PetscInt depth = 0, maxSize; 1276552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1277552f7358SJed Brown PetscErrorCode ierr; 1278552f7358SJed Brown 1279552f7358SJed Brown PetscFunctionBegin; 1280552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1281552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1282552f7358SJed Brown /* This is only 1-level */ 1283552f7358SJed Brown if (useCone) { 1284552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1285552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1286552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1287552f7358SJed Brown } else { 1288552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1289552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1290552f7358SJed Brown } 1291bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1292bfbcdd7aSMatthew G. Knepley if (*points) { 1293bfbcdd7aSMatthew G. Knepley closure = *points; 1294bfbcdd7aSMatthew G. Knepley } else { 1295bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1296bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1297bfbcdd7aSMatthew G. Knepley } 1298bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1299bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1300bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1301bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1302bfbcdd7aSMatthew G. Knepley } 1303bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1304bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1305bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1306bfbcdd7aSMatthew G. Knepley } 130724c766afSToby Isaac { 130824c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 130924c766afSToby Isaac 131024c766afSToby Isaac c = mesh->maxConeSize; 131124c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 131224c766afSToby Isaac s = mesh->maxSupportSize; 131324c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 131424c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 131524c766afSToby Isaac } 1316bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1317bfbcdd7aSMatthew G. Knepley if (*points) { 1318bfbcdd7aSMatthew G. Knepley closure = *points; 1319bfbcdd7aSMatthew G. Knepley } else { 1320bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1321bfbcdd7aSMatthew G. Knepley } 1322bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1323552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1324552f7358SJed Brown const PetscInt cp = tmp[t]; 1325552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1326552f7358SJed Brown 1327552f7358SJed Brown closure[closureSize] = cp; 1328552f7358SJed Brown closure[closureSize+1] = co; 1329552f7358SJed Brown fifo[fifoSize] = cp; 1330552f7358SJed Brown fifo[fifoSize+1] = co; 1331552f7358SJed Brown } 1332bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1333552f7358SJed Brown while (fifoSize - fifoStart) { 1334552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1335552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1336552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1337552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1338552f7358SJed Brown 1339552f7358SJed Brown if (useCone) { 1340552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1341552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1342552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1343552f7358SJed Brown } else { 1344552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1345552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13460298fd71SBarry Smith tmpO = NULL; 1347552f7358SJed Brown } 1348552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1349552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1350552f7358SJed Brown const PetscInt cp = tmp[i]; 13512e1b13c2SMatthew 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. */ 13522e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 13532e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 13542e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1355552f7358SJed Brown PetscInt c; 1356552f7358SJed Brown 13572e1b13c2SMatthew G. Knepley if (rev) { 13582e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 13592e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13602e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13612e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13622e1b13c2SMatthew G. Knepley } 1363552f7358SJed Brown /* Check for duplicate */ 1364552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1365552f7358SJed Brown if (closure[c] == cp) break; 1366552f7358SJed Brown } 1367552f7358SJed Brown if (c == closureSize) { 1368552f7358SJed Brown closure[closureSize] = cp; 1369552f7358SJed Brown closure[closureSize+1] = co; 1370552f7358SJed Brown fifo[fifoSize] = cp; 1371552f7358SJed Brown fifo[fifoSize+1] = co; 1372552f7358SJed Brown closureSize += 2; 1373552f7358SJed Brown fifoSize += 2; 1374552f7358SJed Brown } 1375552f7358SJed Brown } 1376552f7358SJed Brown fifoStart += 2; 1377552f7358SJed Brown } 1378552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1379552f7358SJed Brown if (points) *points = closure; 1380552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1381552f7358SJed Brown PetscFunctionReturn(0); 1382552f7358SJed Brown } 1383552f7358SJed Brown 1384552f7358SJed Brown #undef __FUNCT__ 13859bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13869bf0dad6SMatthew G. Knepley /*@C 13879bf0dad6SMatthew 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 13889bf0dad6SMatthew G. Knepley 13899bf0dad6SMatthew G. Knepley Not collective 13909bf0dad6SMatthew G. Knepley 13919bf0dad6SMatthew G. Knepley Input Parameters: 13929bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13939bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13949bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13959bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13969bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13979bf0dad6SMatthew G. Knepley 13989bf0dad6SMatthew G. Knepley Output Parameters: 13999bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 14009bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 14019bf0dad6SMatthew G. Knepley 14029bf0dad6SMatthew G. Knepley Note: 14039bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 14049bf0dad6SMatthew G. Knepley 14059bf0dad6SMatthew G. Knepley Fortran Notes: 14069bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14079bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 14089bf0dad6SMatthew G. Knepley 14099bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14109bf0dad6SMatthew G. Knepley 14119bf0dad6SMatthew G. Knepley Level: beginner 14129bf0dad6SMatthew G. Knepley 14139bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 14149bf0dad6SMatthew G. Knepley @*/ 14159bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 14169bf0dad6SMatthew G. Knepley { 14179bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 14189bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 14199bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 14209bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 14219bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 14229bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 14239bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 14249bf0dad6SMatthew G. Knepley 14259bf0dad6SMatthew G. Knepley PetscFunctionBegin; 14269bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 14279bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 14289bf0dad6SMatthew G. Knepley /* This is only 1-level */ 14299bf0dad6SMatthew G. Knepley if (useCone) { 14309bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 14319bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 14329bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 14339bf0dad6SMatthew G. Knepley } else { 14349bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 14359bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 14369bf0dad6SMatthew G. Knepley } 14379bf0dad6SMatthew G. Knepley if (depth == 1) { 14389bf0dad6SMatthew G. Knepley if (*points) { 14399bf0dad6SMatthew G. Knepley closure = *points; 14409bf0dad6SMatthew G. Knepley } else { 14419bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 14429bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 14439bf0dad6SMatthew G. Knepley } 14449bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 14459bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 14469bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 14479bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 14489bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 14499bf0dad6SMatthew G. Knepley } 14509bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14519bf0dad6SMatthew G. Knepley if (points) *points = closure; 14529bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14539bf0dad6SMatthew G. Knepley } 145424c766afSToby Isaac { 145524c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 145624c766afSToby Isaac 145724c766afSToby Isaac c = mesh->maxConeSize; 145824c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 145924c766afSToby Isaac s = mesh->maxSupportSize; 146024c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 146124c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 146224c766afSToby Isaac } 14639bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14649bf0dad6SMatthew G. Knepley if (*points) { 14659bf0dad6SMatthew G. Knepley closure = *points; 14669bf0dad6SMatthew G. Knepley } else { 14679bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 14689bf0dad6SMatthew G. Knepley } 14699bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 14709bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 14719bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 14729bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14739bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14749bf0dad6SMatthew G. Knepley 14759bf0dad6SMatthew G. Knepley if (ornt < 0) { 14769bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14779bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14789bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14799bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14809bf0dad6SMatthew G. Knepley } 14819bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14829bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14839bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14849bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14859bf0dad6SMatthew G. Knepley } 14869bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14879bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14889bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14899bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14909bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14919bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14929bf0dad6SMatthew G. Knepley 14939bf0dad6SMatthew G. Knepley if (useCone) { 14949bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14959bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14969bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14979bf0dad6SMatthew G. Knepley } else { 14989bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14999bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 15009bf0dad6SMatthew G. Knepley tmpO = NULL; 15019bf0dad6SMatthew G. Knepley } 15029bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 15039bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 15049bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 15059bf0dad6SMatthew 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. */ 15069bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 15079bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 15089bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 15099bf0dad6SMatthew G. Knepley PetscInt c; 15109bf0dad6SMatthew G. Knepley 15119bf0dad6SMatthew G. Knepley if (rev) { 15129bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 15139bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 15149bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 15159bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 15169bf0dad6SMatthew G. Knepley } 15179bf0dad6SMatthew G. Knepley /* Check for duplicate */ 15189bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 15199bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 15209bf0dad6SMatthew G. Knepley } 15219bf0dad6SMatthew G. Knepley if (c == closureSize) { 15229bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 15239bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 15249bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 15259bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 15269bf0dad6SMatthew G. Knepley closureSize += 2; 15279bf0dad6SMatthew G. Knepley fifoSize += 2; 15289bf0dad6SMatthew G. Knepley } 15299bf0dad6SMatthew G. Knepley } 15309bf0dad6SMatthew G. Knepley fifoStart += 2; 15319bf0dad6SMatthew G. Knepley } 15329bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 15339bf0dad6SMatthew G. Knepley if (points) *points = closure; 15349bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 15359bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 15369bf0dad6SMatthew G. Knepley } 15379bf0dad6SMatthew G. Knepley 15389bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1539552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1540552f7358SJed Brown /*@C 1541552f7358SJed 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 1542552f7358SJed Brown 1543552f7358SJed Brown Not collective 1544552f7358SJed Brown 1545552f7358SJed Brown Input Parameters: 1546552f7358SJed Brown + mesh - The DMPlex 1547552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1548552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1549e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1550e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1551552f7358SJed Brown 1552552f7358SJed Brown Note: 15530298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1554552f7358SJed Brown 15553813dfbdSMatthew G Knepley Fortran Notes: 15563813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 15573813dfbdSMatthew G Knepley include petsc.h90 in your code. 15583813dfbdSMatthew G Knepley 15593813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 15603813dfbdSMatthew G Knepley 1561552f7358SJed Brown Level: beginner 1562552f7358SJed Brown 1563552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1564552f7358SJed Brown @*/ 1565552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1566552f7358SJed Brown { 1567552f7358SJed Brown PetscErrorCode ierr; 1568552f7358SJed Brown 1569552f7358SJed Brown PetscFunctionBegin; 1570552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1571e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1572e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1573552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 15744ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1575552f7358SJed Brown PetscFunctionReturn(0); 1576552f7358SJed Brown } 1577552f7358SJed Brown 1578552f7358SJed Brown #undef __FUNCT__ 1579552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1580552f7358SJed Brown /*@ 1581552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1582552f7358SJed Brown 1583552f7358SJed Brown Not collective 1584552f7358SJed Brown 1585552f7358SJed Brown Input Parameter: 1586552f7358SJed Brown . mesh - The DMPlex 1587552f7358SJed Brown 1588552f7358SJed Brown Output Parameters: 1589552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1590552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1591552f7358SJed Brown 1592552f7358SJed Brown Level: beginner 1593552f7358SJed Brown 1594552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1595552f7358SJed Brown @*/ 1596552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1597552f7358SJed Brown { 1598552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1599552f7358SJed Brown 1600552f7358SJed Brown PetscFunctionBegin; 1601552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1602552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1603552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1604552f7358SJed Brown PetscFunctionReturn(0); 1605552f7358SJed Brown } 1606552f7358SJed Brown 1607552f7358SJed Brown #undef __FUNCT__ 1608552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1609552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1610552f7358SJed Brown { 1611552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1612552f7358SJed Brown PetscInt size; 1613552f7358SJed Brown PetscErrorCode ierr; 1614552f7358SJed Brown 1615552f7358SJed Brown PetscFunctionBegin; 1616552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1617552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1618552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 16191795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 16201795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1621552f7358SJed Brown if (mesh->maxSupportSize) { 1622552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1623552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 16241795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1625552f7358SJed Brown } 1626552f7358SJed Brown PetscFunctionReturn(0); 1627552f7358SJed Brown } 1628552f7358SJed Brown 1629552f7358SJed Brown #undef __FUNCT__ 1630552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1631552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1632552f7358SJed Brown { 1633552f7358SJed Brown PetscErrorCode ierr; 1634552f7358SJed Brown 1635552f7358SJed Brown PetscFunctionBegin; 16364d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 16374d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1638552f7358SJed Brown PetscFunctionReturn(0); 1639552f7358SJed Brown } 1640552f7358SJed Brown 1641552f7358SJed Brown #undef __FUNCT__ 1642552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1643552f7358SJed Brown /*@ 1644552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1645552f7358SJed Brown 1646552f7358SJed Brown Not collective 1647552f7358SJed Brown 1648552f7358SJed Brown Input Parameter: 1649552f7358SJed Brown . mesh - The DMPlex 1650552f7358SJed Brown 1651552f7358SJed Brown Output Parameter: 1652552f7358SJed Brown 1653552f7358SJed Brown Note: 1654552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1655552f7358SJed Brown 1656552f7358SJed Brown Level: beginner 1657552f7358SJed Brown 1658552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1659552f7358SJed Brown @*/ 1660552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1661552f7358SJed Brown { 1662552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1663552f7358SJed Brown PetscInt *offsets; 1664552f7358SJed Brown PetscInt supportSize; 1665552f7358SJed Brown PetscInt pStart, pEnd, p; 1666552f7358SJed Brown PetscErrorCode ierr; 1667552f7358SJed Brown 1668552f7358SJed Brown PetscFunctionBegin; 1669552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 167082f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1671552f7358SJed Brown /* Calculate support sizes */ 1672552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1673552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1674552f7358SJed Brown PetscInt dof, off, c; 1675552f7358SJed Brown 1676552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1677552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1678552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1679552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1680552f7358SJed Brown } 1681552f7358SJed Brown } 1682552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1683552f7358SJed Brown PetscInt dof; 1684552f7358SJed Brown 1685552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16860d644c17SKarl Rupp 1687552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1688552f7358SJed Brown } 1689552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1690552f7358SJed Brown /* Calculate supports */ 1691552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16921795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16931795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1694552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1695552f7358SJed Brown PetscInt dof, off, c; 1696552f7358SJed Brown 1697552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1698552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1699552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1700552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1701552f7358SJed Brown PetscInt offS; 1702552f7358SJed Brown 1703552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 17040d644c17SKarl Rupp 1705552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1706552f7358SJed Brown ++offsets[q]; 1707552f7358SJed Brown } 1708552f7358SJed Brown } 1709552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1710552f7358SJed Brown PetscFunctionReturn(0); 1711552f7358SJed Brown } 1712552f7358SJed Brown 1713552f7358SJed Brown #undef __FUNCT__ 1714552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1715552f7358SJed Brown /*@ 1716552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1717552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1718552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1719552f7358SJed Brown the DAG. 1720552f7358SJed Brown 1721552f7358SJed Brown Not collective 1722552f7358SJed Brown 1723552f7358SJed Brown Input Parameter: 1724552f7358SJed Brown . mesh - The DMPlex 1725552f7358SJed Brown 1726552f7358SJed Brown Output Parameter: 1727552f7358SJed Brown 1728552f7358SJed Brown Notes: 1729150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1730150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1731150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1732150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1733552f7358SJed Brown 1734150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1735552f7358SJed Brown 1736552f7358SJed Brown Level: beginner 1737552f7358SJed Brown 1738552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1739552f7358SJed Brown @*/ 1740552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1741552f7358SJed Brown { 1742aa50250dSMatthew G. Knepley DMLabel label; 1743552f7358SJed Brown PetscInt pStart, pEnd, p; 1744552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1745552f7358SJed Brown PetscErrorCode ierr; 1746552f7358SJed Brown 1747552f7358SJed Brown PetscFunctionBegin; 1748552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1749552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1750552f7358SJed Brown /* Calculate depth */ 1751aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1752aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1753aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1754552f7358SJed Brown /* Initialize roots and count leaves */ 1755552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1756552f7358SJed Brown PetscInt coneSize, supportSize; 1757552f7358SJed Brown 1758552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1759552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1760552f7358SJed Brown if (!coneSize && supportSize) { 1761552f7358SJed Brown ++numRoots; 1762aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1763552f7358SJed Brown } else if (!supportSize && coneSize) { 1764552f7358SJed Brown ++numLeaves; 1765552f7358SJed Brown } else if (!supportSize && !coneSize) { 1766552f7358SJed Brown /* Isolated points */ 1767aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1768552f7358SJed Brown } 1769552f7358SJed Brown } 1770552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1771552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1772552f7358SJed Brown PetscInt coneSize, supportSize; 1773552f7358SJed Brown 1774552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1775552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1776552f7358SJed Brown if (!supportSize && coneSize) { 1777aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1778552f7358SJed Brown } 1779552f7358SJed Brown } 1780552f7358SJed Brown } else { 178174ef644bSMatthew G. Knepley IS pointIS; 178274ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1783552f7358SJed Brown 178474ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 178574ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 178674ef644bSMatthew G. Knepley while (numPoints) { 178774ef644bSMatthew G. Knepley const PetscInt *points; 178874ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 178974ef644bSMatthew G. Knepley 179074ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 179174ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 179274ef644bSMatthew G. Knepley const PetscInt point = points[p]; 179374ef644bSMatthew G. Knepley const PetscInt *support; 179474ef644bSMatthew G. Knepley PetscInt supportSize, s; 179574ef644bSMatthew G. Knepley 179674ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 179774ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 179874ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 179974ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1800552f7358SJed Brown } 1801552f7358SJed Brown } 18025edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 180374ef644bSMatthew G. Knepley ++level; 180474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 180574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 180674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 180774ef644bSMatthew G. Knepley else {numPoints = 0;} 180874ef644bSMatthew G. Knepley } 180974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 181074ef644bSMatthew G. Knepley } 1811552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1812552f7358SJed Brown PetscFunctionReturn(0); 1813552f7358SJed Brown } 1814552f7358SJed Brown 1815552f7358SJed Brown #undef __FUNCT__ 1816552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1817552f7358SJed Brown /*@C 1818552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1819552f7358SJed Brown 1820552f7358SJed Brown Not Collective 1821552f7358SJed Brown 1822552f7358SJed Brown Input Parameters: 1823552f7358SJed Brown + dm - The DMPlex object 1824552f7358SJed Brown . numPoints - The number of input points for the join 1825552f7358SJed Brown - points - The input points 1826552f7358SJed Brown 1827552f7358SJed Brown Output Parameters: 1828552f7358SJed Brown + numCoveredPoints - The number of points in the join 1829552f7358SJed Brown - coveredPoints - The points in the join 1830552f7358SJed Brown 1831552f7358SJed Brown Level: intermediate 1832552f7358SJed Brown 1833552f7358SJed Brown Note: Currently, this is restricted to a single level join 1834552f7358SJed Brown 18353813dfbdSMatthew G Knepley Fortran Notes: 18363813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18373813dfbdSMatthew G Knepley include petsc.h90 in your code. 18383813dfbdSMatthew G Knepley 18393813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18403813dfbdSMatthew G Knepley 1841552f7358SJed Brown .keywords: mesh 1842552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1843552f7358SJed Brown @*/ 1844552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1845552f7358SJed Brown { 1846552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1847552f7358SJed Brown PetscInt *join[2]; 1848552f7358SJed Brown PetscInt joinSize, i = 0; 1849552f7358SJed Brown PetscInt dof, off, p, c, m; 1850552f7358SJed Brown PetscErrorCode ierr; 1851552f7358SJed Brown 1852552f7358SJed Brown PetscFunctionBegin; 1853552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1854552f7358SJed Brown PetscValidPointer(points, 2); 1855552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1856552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1857552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1858552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1859552f7358SJed Brown /* Copy in support of first point */ 1860552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1861552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1862552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1863552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1864552f7358SJed Brown } 1865552f7358SJed Brown /* Check each successive support */ 1866552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1867552f7358SJed Brown PetscInt newJoinSize = 0; 1868552f7358SJed Brown 1869552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1870552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1871552f7358SJed Brown for (c = 0; c < dof; ++c) { 1872552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1873552f7358SJed Brown 1874552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1875552f7358SJed Brown if (point == join[i][m]) { 1876552f7358SJed Brown join[1-i][newJoinSize++] = point; 1877552f7358SJed Brown break; 1878552f7358SJed Brown } 1879552f7358SJed Brown } 1880552f7358SJed Brown } 1881552f7358SJed Brown joinSize = newJoinSize; 1882552f7358SJed Brown i = 1-i; 1883552f7358SJed Brown } 1884552f7358SJed Brown *numCoveredPoints = joinSize; 1885552f7358SJed Brown *coveredPoints = join[i]; 1886552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1887552f7358SJed Brown PetscFunctionReturn(0); 1888552f7358SJed Brown } 1889552f7358SJed Brown 1890552f7358SJed Brown #undef __FUNCT__ 1891552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1892552f7358SJed Brown /*@C 1893552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1894552f7358SJed Brown 1895552f7358SJed Brown Not Collective 1896552f7358SJed Brown 1897552f7358SJed Brown Input Parameters: 1898552f7358SJed Brown + dm - The DMPlex object 1899552f7358SJed Brown . numPoints - The number of input points for the join 1900552f7358SJed Brown - points - The input points 1901552f7358SJed Brown 1902552f7358SJed Brown Output Parameters: 1903552f7358SJed Brown + numCoveredPoints - The number of points in the join 1904552f7358SJed Brown - coveredPoints - The points in the join 1905552f7358SJed Brown 19063813dfbdSMatthew G Knepley Fortran Notes: 19073813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19083813dfbdSMatthew G Knepley include petsc.h90 in your code. 19093813dfbdSMatthew G Knepley 19103813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19113813dfbdSMatthew G Knepley 1912552f7358SJed Brown Level: intermediate 1913552f7358SJed Brown 1914552f7358SJed Brown .keywords: mesh 1915552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1916552f7358SJed Brown @*/ 1917552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1918552f7358SJed Brown { 1919552f7358SJed Brown PetscErrorCode ierr; 1920552f7358SJed Brown 1921552f7358SJed Brown PetscFunctionBegin; 1922552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1923d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1924d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1925d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1926552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1927d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1928552f7358SJed Brown PetscFunctionReturn(0); 1929552f7358SJed Brown } 1930552f7358SJed Brown 1931552f7358SJed Brown #undef __FUNCT__ 1932552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1933552f7358SJed Brown /*@C 1934552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1935552f7358SJed Brown 1936552f7358SJed Brown Not Collective 1937552f7358SJed Brown 1938552f7358SJed Brown Input Parameters: 1939552f7358SJed Brown + dm - The DMPlex object 1940552f7358SJed Brown . numPoints - The number of input points for the join 1941552f7358SJed Brown - points - The input points 1942552f7358SJed Brown 1943552f7358SJed Brown Output Parameters: 1944552f7358SJed Brown + numCoveredPoints - The number of points in the join 1945552f7358SJed Brown - coveredPoints - The points in the join 1946552f7358SJed Brown 19473813dfbdSMatthew G Knepley Fortran Notes: 19483813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19493813dfbdSMatthew G Knepley include petsc.h90 in your code. 19503813dfbdSMatthew G Knepley 19513813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19523813dfbdSMatthew G Knepley 1953552f7358SJed Brown Level: intermediate 1954552f7358SJed Brown 1955552f7358SJed Brown .keywords: mesh 1956552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1957552f7358SJed Brown @*/ 1958552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1959552f7358SJed Brown { 1960552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1961552f7358SJed Brown PetscInt *offsets, **closures; 1962552f7358SJed Brown PetscInt *join[2]; 1963552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 196424c766afSToby Isaac PetscInt p, d, c, m, ms; 1965552f7358SJed Brown PetscErrorCode ierr; 1966552f7358SJed Brown 1967552f7358SJed Brown PetscFunctionBegin; 1968552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1969552f7358SJed Brown PetscValidPointer(points, 2); 1970552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1971552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1972552f7358SJed Brown 1973552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 19741795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1975552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 197624c766afSToby Isaac ms = mesh->maxSupportSize; 197724c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 1978552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1979552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1980552f7358SJed Brown 1981552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1982552f7358SJed Brown PetscInt closureSize; 1983552f7358SJed Brown 1984552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19850d644c17SKarl Rupp 1986552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1987552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1988552f7358SJed Brown PetscInt pStart, pEnd, i; 1989552f7358SJed Brown 1990552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1991552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1992552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1993552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1994552f7358SJed Brown break; 1995552f7358SJed Brown } 1996552f7358SJed Brown } 1997552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1998552f7358SJed Brown } 199982f516ccSBarry 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); 2000552f7358SJed Brown } 2001552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 2002552f7358SJed Brown PetscInt dof; 2003552f7358SJed Brown 2004552f7358SJed Brown /* Copy in support of first point */ 2005552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 2006552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 2007552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 2008552f7358SJed Brown } 2009552f7358SJed Brown /* Check each successive cone */ 2010552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 2011552f7358SJed Brown PetscInt newJoinSize = 0; 2012552f7358SJed Brown 2013552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 2014552f7358SJed Brown for (c = 0; c < dof; ++c) { 2015552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 2016552f7358SJed Brown 2017552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 2018552f7358SJed Brown if (point == join[i][m]) { 2019552f7358SJed Brown join[1-i][newJoinSize++] = point; 2020552f7358SJed Brown break; 2021552f7358SJed Brown } 2022552f7358SJed Brown } 2023552f7358SJed Brown } 2024552f7358SJed Brown joinSize = newJoinSize; 2025552f7358SJed Brown i = 1-i; 2026552f7358SJed Brown } 2027552f7358SJed Brown if (joinSize) break; 2028552f7358SJed Brown } 2029552f7358SJed Brown *numCoveredPoints = joinSize; 2030552f7358SJed Brown *coveredPoints = join[i]; 2031552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20320298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 2033552f7358SJed Brown } 2034552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2035552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2036552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 2037552f7358SJed Brown PetscFunctionReturn(0); 2038552f7358SJed Brown } 2039552f7358SJed Brown 2040552f7358SJed Brown #undef __FUNCT__ 2041552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 2042552f7358SJed Brown /*@C 2043552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 2044552f7358SJed Brown 2045552f7358SJed Brown Not Collective 2046552f7358SJed Brown 2047552f7358SJed Brown Input Parameters: 2048552f7358SJed Brown + dm - The DMPlex object 2049552f7358SJed Brown . numPoints - The number of input points for the meet 2050552f7358SJed Brown - points - The input points 2051552f7358SJed Brown 2052552f7358SJed Brown Output Parameters: 2053552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2054552f7358SJed Brown - coveredPoints - The points in the meet 2055552f7358SJed Brown 2056552f7358SJed Brown Level: intermediate 2057552f7358SJed Brown 2058552f7358SJed Brown Note: Currently, this is restricted to a single level meet 2059552f7358SJed Brown 20603813dfbdSMatthew G Knepley Fortran Notes: 20613813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20623813dfbdSMatthew G Knepley include petsc.h90 in your code. 20633813dfbdSMatthew G Knepley 20643813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20653813dfbdSMatthew G Knepley 2066552f7358SJed Brown .keywords: mesh 2067552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 2068552f7358SJed Brown @*/ 2069552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 2070552f7358SJed Brown { 2071552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2072552f7358SJed Brown PetscInt *meet[2]; 2073552f7358SJed Brown PetscInt meetSize, i = 0; 2074552f7358SJed Brown PetscInt dof, off, p, c, m; 2075552f7358SJed Brown PetscErrorCode ierr; 2076552f7358SJed Brown 2077552f7358SJed Brown PetscFunctionBegin; 2078552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2079552f7358SJed Brown PetscValidPointer(points, 2); 2080552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2081552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2082552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2083552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2084552f7358SJed Brown /* Copy in cone of first point */ 2085552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2086552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2087552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2088552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2089552f7358SJed Brown } 2090552f7358SJed Brown /* Check each successive cone */ 2091552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2092552f7358SJed Brown PetscInt newMeetSize = 0; 2093552f7358SJed Brown 2094552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2095552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2096552f7358SJed Brown for (c = 0; c < dof; ++c) { 2097552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2098552f7358SJed Brown 2099552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2100552f7358SJed Brown if (point == meet[i][m]) { 2101552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2102552f7358SJed Brown break; 2103552f7358SJed Brown } 2104552f7358SJed Brown } 2105552f7358SJed Brown } 2106552f7358SJed Brown meetSize = newMeetSize; 2107552f7358SJed Brown i = 1-i; 2108552f7358SJed Brown } 2109552f7358SJed Brown *numCoveringPoints = meetSize; 2110552f7358SJed Brown *coveringPoints = meet[i]; 2111552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2112552f7358SJed Brown PetscFunctionReturn(0); 2113552f7358SJed Brown } 2114552f7358SJed Brown 2115552f7358SJed Brown #undef __FUNCT__ 2116552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2117552f7358SJed Brown /*@C 2118552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2119552f7358SJed Brown 2120552f7358SJed Brown Not Collective 2121552f7358SJed Brown 2122552f7358SJed Brown Input Parameters: 2123552f7358SJed Brown + dm - The DMPlex object 2124552f7358SJed Brown . numPoints - The number of input points for the meet 2125552f7358SJed Brown - points - The input points 2126552f7358SJed Brown 2127552f7358SJed Brown Output Parameters: 2128552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2129552f7358SJed Brown - coveredPoints - The points in the meet 2130552f7358SJed Brown 2131552f7358SJed Brown Level: intermediate 2132552f7358SJed Brown 21333813dfbdSMatthew G Knepley Fortran Notes: 21343813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21353813dfbdSMatthew G Knepley include petsc.h90 in your code. 21363813dfbdSMatthew G Knepley 21373813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21383813dfbdSMatthew G Knepley 2139552f7358SJed Brown .keywords: mesh 2140552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2141552f7358SJed Brown @*/ 2142552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2143552f7358SJed Brown { 2144552f7358SJed Brown PetscErrorCode ierr; 2145552f7358SJed Brown 2146552f7358SJed Brown PetscFunctionBegin; 2147552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2148d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2149d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2150d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2151552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2152d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2153552f7358SJed Brown PetscFunctionReturn(0); 2154552f7358SJed Brown } 2155552f7358SJed Brown 2156552f7358SJed Brown #undef __FUNCT__ 2157552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2158552f7358SJed Brown /*@C 2159552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2160552f7358SJed Brown 2161552f7358SJed Brown Not Collective 2162552f7358SJed Brown 2163552f7358SJed Brown Input Parameters: 2164552f7358SJed Brown + dm - The DMPlex object 2165552f7358SJed Brown . numPoints - The number of input points for the meet 2166552f7358SJed Brown - points - The input points 2167552f7358SJed Brown 2168552f7358SJed Brown Output Parameters: 2169552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2170552f7358SJed Brown - coveredPoints - The points in the meet 2171552f7358SJed Brown 2172552f7358SJed Brown Level: intermediate 2173552f7358SJed Brown 21743813dfbdSMatthew G Knepley Fortran Notes: 21753813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21763813dfbdSMatthew G Knepley include petsc.h90 in your code. 21773813dfbdSMatthew G Knepley 21783813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21793813dfbdSMatthew G Knepley 2180552f7358SJed Brown .keywords: mesh 2181552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2182552f7358SJed Brown @*/ 2183552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2184552f7358SJed Brown { 2185552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2186552f7358SJed Brown PetscInt *offsets, **closures; 2187552f7358SJed Brown PetscInt *meet[2]; 2188552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 218924c766afSToby Isaac PetscInt p, h, c, m, mc; 2190552f7358SJed Brown PetscErrorCode ierr; 2191552f7358SJed Brown 2192552f7358SJed Brown PetscFunctionBegin; 2193552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2194552f7358SJed Brown PetscValidPointer(points, 2); 2195552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2196552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2197552f7358SJed Brown 2198552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2199785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2200552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 220124c766afSToby Isaac mc = mesh->maxConeSize; 220224c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2203552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2204552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2205552f7358SJed Brown 2206552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2207552f7358SJed Brown PetscInt closureSize; 2208552f7358SJed Brown 2209552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 22100d644c17SKarl Rupp 2211552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2212552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2213552f7358SJed Brown PetscInt pStart, pEnd, i; 2214552f7358SJed Brown 2215552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2216552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2217552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2218552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2219552f7358SJed Brown break; 2220552f7358SJed Brown } 2221552f7358SJed Brown } 2222552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2223552f7358SJed Brown } 222482f516ccSBarry 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); 2225552f7358SJed Brown } 2226552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2227552f7358SJed Brown PetscInt dof; 2228552f7358SJed Brown 2229552f7358SJed Brown /* Copy in cone of first point */ 2230552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2231552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2232552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2233552f7358SJed Brown } 2234552f7358SJed Brown /* Check each successive cone */ 2235552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2236552f7358SJed Brown PetscInt newMeetSize = 0; 2237552f7358SJed Brown 2238552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2239552f7358SJed Brown for (c = 0; c < dof; ++c) { 2240552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2241552f7358SJed Brown 2242552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2243552f7358SJed Brown if (point == meet[i][m]) { 2244552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2245552f7358SJed Brown break; 2246552f7358SJed Brown } 2247552f7358SJed Brown } 2248552f7358SJed Brown } 2249552f7358SJed Brown meetSize = newMeetSize; 2250552f7358SJed Brown i = 1-i; 2251552f7358SJed Brown } 2252552f7358SJed Brown if (meetSize) break; 2253552f7358SJed Brown } 2254552f7358SJed Brown *numCoveredPoints = meetSize; 2255552f7358SJed Brown *coveredPoints = meet[i]; 2256552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 22570298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2258552f7358SJed Brown } 2259552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2260552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2261552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2262552f7358SJed Brown PetscFunctionReturn(0); 2263552f7358SJed Brown } 2264552f7358SJed Brown 2265552f7358SJed Brown #undef __FUNCT__ 22664e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 22674e3744c5SMatthew G. Knepley /*@C 22684e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 22694e3744c5SMatthew G. Knepley 22704e3744c5SMatthew G. Knepley Not Collective 22714e3744c5SMatthew G. Knepley 22724e3744c5SMatthew G. Knepley Input Parameters: 22734e3744c5SMatthew G. Knepley + dmA - A DMPlex object 22744e3744c5SMatthew G. Knepley - dmB - A DMPlex object 22754e3744c5SMatthew G. Knepley 22764e3744c5SMatthew G. Knepley Output Parameters: 22774e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 22784e3744c5SMatthew G. Knepley 22794e3744c5SMatthew G. Knepley Level: intermediate 22804e3744c5SMatthew G. Knepley 22814e3744c5SMatthew G. Knepley Notes: 22824e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 22834e3744c5SMatthew G. Knepley 22844e3744c5SMatthew G. Knepley .keywords: mesh 22854e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22864e3744c5SMatthew G. Knepley @*/ 22874e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22884e3744c5SMatthew G. Knepley { 22894e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22904e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22914e3744c5SMatthew G. Knepley 22924e3744c5SMatthew G. Knepley PetscFunctionBegin; 22934e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22944e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22954e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22964e3744c5SMatthew G. Knepley 22974e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22984e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22994e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 23004e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 23014e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 23024e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 23034e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 23044e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 23054e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 23064e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 23074e3744c5SMatthew G. Knepley 23084e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 23094e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 23104e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 23114e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 23124e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 23134e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 23144e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 23154e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 23164e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 23174e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 23184e3744c5SMatthew G. Knepley } 23194e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 23204e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 23214e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 23224e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 23234e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 23244e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 23254e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 23264e3744c5SMatthew G. Knepley } 23274e3744c5SMatthew G. Knepley } 23284e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 23294e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 23304e3744c5SMatthew G. Knepley } 23314e3744c5SMatthew G. Knepley 23324e3744c5SMatthew G. Knepley #undef __FUNCT__ 233318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 233418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2335a6dfd86eSKarl Rupp { 233682f516ccSBarry Smith MPI_Comm comm; 2337552f7358SJed Brown PetscErrorCode ierr; 2338552f7358SJed Brown 2339552f7358SJed Brown PetscFunctionBegin; 234082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2341552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2342552f7358SJed Brown switch (cellDim) { 2343552f7358SJed Brown case 0: 2344552f7358SJed Brown *numFaceVertices = 0; 2345552f7358SJed Brown break; 2346552f7358SJed Brown case 1: 2347552f7358SJed Brown *numFaceVertices = 1; 2348552f7358SJed Brown break; 2349552f7358SJed Brown case 2: 2350552f7358SJed Brown switch (numCorners) { 235119436ca2SJed Brown case 3: /* triangle */ 235219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2353552f7358SJed Brown break; 235419436ca2SJed Brown case 4: /* quadrilateral */ 235519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2356552f7358SJed Brown break; 235719436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 235819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2359552f7358SJed Brown break; 236019436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 236119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2362552f7358SJed Brown break; 2363552f7358SJed Brown default: 2364552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2365552f7358SJed Brown } 2366552f7358SJed Brown break; 2367552f7358SJed Brown case 3: 2368552f7358SJed Brown switch (numCorners) { 236919436ca2SJed Brown case 4: /* tetradehdron */ 237019436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2371552f7358SJed Brown break; 237219436ca2SJed Brown case 6: /* tet cohesive cells */ 237319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2374552f7358SJed Brown break; 237519436ca2SJed Brown case 8: /* hexahedron */ 237619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2377552f7358SJed Brown break; 237819436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 237919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2380552f7358SJed Brown break; 238119436ca2SJed Brown case 10: /* quadratic tetrahedron */ 238219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2383552f7358SJed Brown break; 238419436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 238519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2386552f7358SJed Brown break; 238719436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 238819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2389552f7358SJed Brown break; 239019436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 239119436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2392552f7358SJed Brown break; 2393552f7358SJed Brown default: 2394552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2395552f7358SJed Brown } 2396552f7358SJed Brown break; 2397552f7358SJed Brown default: 2398552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2399552f7358SJed Brown } 2400552f7358SJed Brown PetscFunctionReturn(0); 2401552f7358SJed Brown } 2402552f7358SJed Brown 2403552f7358SJed Brown #undef __FUNCT__ 2404d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 2405d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2406d49fcaecSMatthew G. Knepley { 2407d49fcaecSMatthew G. Knepley PetscInt d; 2408d49fcaecSMatthew G. Knepley 2409d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2410d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2411d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 2412d49fcaecSMatthew G. Knepley } else { 2413d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2414d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2415858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2416d49fcaecSMatthew G. Knepley } else { 2417d49fcaecSMatthew G. Knepley out[d] = in[d]; 2418d49fcaecSMatthew G. Knepley } 2419d49fcaecSMatthew G. Knepley } 2420d49fcaecSMatthew G. Knepley } 2421d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2422d49fcaecSMatthew G. Knepley } 2423d49fcaecSMatthew G. Knepley 2424d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2425d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 2426d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 2427d49fcaecSMatthew G. Knepley { 2428d49fcaecSMatthew G. Knepley PetscInt d; 2429d49fcaecSMatthew G. Knepley 2430d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2431d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 2432d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 2433d49fcaecSMatthew G. Knepley } else { 2434d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 2435d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 2436858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 2437d49fcaecSMatthew G. Knepley } else { 2438d49fcaecSMatthew G. Knepley out[d] += in[d]; 2439d49fcaecSMatthew G. Knepley } 2440d49fcaecSMatthew G. Knepley } 2441d49fcaecSMatthew G. Knepley } 2442d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2443d49fcaecSMatthew G. Knepley } 2444d49fcaecSMatthew G. Knepley 2445d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2446d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 2447d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 2448d49fcaecSMatthew G. Knepley { 2449d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 2450d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 2451d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 24528c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 2453d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 2454d49fcaecSMatthew G. Knepley 2455d49fcaecSMatthew G. Knepley PetscFunctionBegin; 2456d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2457d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 2458d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 2459d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 2460d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 2461d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2462d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 24638c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 24648c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 24658c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 2466d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 2467d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2468d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2469d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 24708c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 2471d49fcaecSMatthew G. Knepley } 2472d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2473d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 2474d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 24758c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 2476d49fcaecSMatthew G. Knepley } 2477d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 2478d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 2479d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 2480d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 2481d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 2482d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 2483d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 2484d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 2485d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 2486d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 2487d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 2488d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2489d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 2490d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 2491d49fcaecSMatthew G. Knepley } 2492d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2493d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2494d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 2495d49fcaecSMatthew G. Knepley PetscInt b; 2496d49fcaecSMatthew G. Knepley 2497d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2498d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 2499d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 2500d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 2501d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 2502d49fcaecSMatthew G. Knepley } 2503d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 2504d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 2505d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 250646e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 2507d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 2508d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 2509d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 2510d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 2511d49fcaecSMatthew G. Knepley } 2512d49fcaecSMatthew G. Knepley 2513d49fcaecSMatthew G. Knepley #undef __FUNCT__ 2514aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 2515552f7358SJed Brown /*@ 2516aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 2517552f7358SJed Brown 2518552f7358SJed Brown Not Collective 2519552f7358SJed Brown 2520aa50250dSMatthew G. Knepley Input Parameter: 2521552f7358SJed Brown . dm - The DMPlex object 2522552f7358SJed Brown 2523aa50250dSMatthew G. Knepley Output Parameter: 2524aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 2525552f7358SJed Brown 2526552f7358SJed Brown Level: developer 2527552f7358SJed Brown 2528aa50250dSMatthew G. Knepley .keywords: mesh, points 2529aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2530aa50250dSMatthew G. Knepley @*/ 2531aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 2532aa50250dSMatthew G. Knepley { 2533aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 2534aa50250dSMatthew G. Knepley PetscErrorCode ierr; 2535aa50250dSMatthew G. Knepley 2536aa50250dSMatthew G. Knepley PetscFunctionBegin; 2537aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2538aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 253963d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 2540aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 2541aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 2542aa50250dSMatthew G. Knepley } 2543aa50250dSMatthew G. Knepley 2544aa50250dSMatthew G. Knepley #undef __FUNCT__ 2545aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 2546aa50250dSMatthew G. Knepley /*@ 2547aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 2548aa50250dSMatthew G. Knepley 2549aa50250dSMatthew G. Knepley Not Collective 2550aa50250dSMatthew G. Knepley 2551aa50250dSMatthew G. Knepley Input Parameter: 2552aa50250dSMatthew G. Knepley . dm - The DMPlex object 2553aa50250dSMatthew G. Knepley 2554aa50250dSMatthew G. Knepley Output Parameter: 2555aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 2556aa50250dSMatthew G. Knepley 2557aa50250dSMatthew G. Knepley Level: developer 2558552f7358SJed Brown 2559552f7358SJed Brown .keywords: mesh, points 2560aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 2561552f7358SJed Brown @*/ 2562552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 2563552f7358SJed Brown { 2564aa50250dSMatthew G. Knepley DMLabel label; 2565aa50250dSMatthew G. Knepley PetscInt d = 0; 2566552f7358SJed Brown PetscErrorCode ierr; 2567552f7358SJed Brown 2568552f7358SJed Brown PetscFunctionBegin; 2569552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2570552f7358SJed Brown PetscValidPointer(depth, 2); 2571aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2572aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 2573552f7358SJed Brown *depth = d-1; 2574552f7358SJed Brown PetscFunctionReturn(0); 2575552f7358SJed Brown } 2576552f7358SJed Brown 2577552f7358SJed Brown #undef __FUNCT__ 2578552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 2579552f7358SJed Brown /*@ 2580552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 2581552f7358SJed Brown 2582552f7358SJed Brown Not Collective 2583552f7358SJed Brown 2584552f7358SJed Brown Input Parameters: 2585552f7358SJed Brown + dm - The DMPlex object 2586552f7358SJed Brown - stratumValue - The requested depth 2587552f7358SJed Brown 2588552f7358SJed Brown Output Parameters: 2589552f7358SJed Brown + start - The first point at this depth 2590552f7358SJed Brown - end - One beyond the last point at this depth 2591552f7358SJed Brown 2592552f7358SJed Brown Level: developer 2593552f7358SJed Brown 2594552f7358SJed Brown .keywords: mesh, points 2595552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 2596552f7358SJed Brown @*/ 25970adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 25980adebc6cSBarry Smith { 2599aa50250dSMatthew G. Knepley DMLabel label; 260063d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 2601552f7358SJed Brown PetscErrorCode ierr; 2602552f7358SJed Brown 2603552f7358SJed Brown PetscFunctionBegin; 2604552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 260563d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 260663d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2607552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 26080d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 260963d1a920SMatthew G. Knepley if (stratumValue < 0) { 261063d1a920SMatthew G. Knepley if (start) *start = pStart; 261163d1a920SMatthew G. Knepley if (end) *end = pEnd; 261263d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2613552f7358SJed Brown } 2614aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 261563d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 261663d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 2617552f7358SJed Brown PetscFunctionReturn(0); 2618552f7358SJed Brown } 2619552f7358SJed Brown 2620552f7358SJed Brown #undef __FUNCT__ 2621552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 2622552f7358SJed Brown /*@ 2623552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 2624552f7358SJed Brown 2625552f7358SJed Brown Not Collective 2626552f7358SJed Brown 2627552f7358SJed Brown Input Parameters: 2628552f7358SJed Brown + dm - The DMPlex object 2629552f7358SJed Brown - stratumValue - The requested height 2630552f7358SJed Brown 2631552f7358SJed Brown Output Parameters: 2632552f7358SJed Brown + start - The first point at this height 2633552f7358SJed Brown - end - One beyond the last point at this height 2634552f7358SJed Brown 2635552f7358SJed Brown Level: developer 2636552f7358SJed Brown 2637552f7358SJed Brown .keywords: mesh, points 2638552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 2639552f7358SJed Brown @*/ 26400adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 26410adebc6cSBarry Smith { 2642aa50250dSMatthew G. Knepley DMLabel label; 264363d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 2644552f7358SJed Brown PetscErrorCode ierr; 2645552f7358SJed Brown 2646552f7358SJed Brown PetscFunctionBegin; 2647552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 264863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 264963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 2650552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 26510d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 265263d1a920SMatthew G. Knepley if (stratumValue < 0) { 265363d1a920SMatthew G. Knepley if (start) *start = pStart; 265463d1a920SMatthew G. Knepley if (end) *end = pEnd; 265563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 2656552f7358SJed Brown } 2657aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 2658aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 265963d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 266063d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 2661552f7358SJed Brown PetscFunctionReturn(0); 2662552f7358SJed Brown } 2663552f7358SJed Brown 2664552f7358SJed Brown #undef __FUNCT__ 2665552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 2666552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 2667a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 2668a6dfd86eSKarl Rupp { 2669*9ac3fadcSMatthew G. Knepley PetscInt *numDofTot, *pMax; 2670916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 2671916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 2672552f7358SJed Brown PetscErrorCode ierr; 2673552f7358SJed Brown 2674552f7358SJed Brown PetscFunctionBegin; 2675854ce69bSBarry Smith ierr = PetscMalloc1(dim+1, &numDofTot);CHKERRQ(ierr); 2676552f7358SJed Brown for (d = 0; d <= dim; ++d) { 2677552f7358SJed Brown numDofTot[d] = 0; 26780d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 2679552f7358SJed Brown } 268082f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2681552f7358SJed Brown if (numFields > 0) { 2682552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 2683552f7358SJed Brown if (numComp) { 2684552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2685552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 2686552f7358SJed Brown } 2687552f7358SJed Brown } 2688552f7358SJed Brown } 2689552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 2690552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 2691916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2692*9ac3fadcSMatthew G. Knepley ierr = PetscMalloc1(depth+1,&pMax);CHKERRQ(ierr); 2693*9ac3fadcSMatthew 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); 2694916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 2695916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 2696916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 2697*9ac3fadcSMatthew G. Knepley pEnd = pMax[dep] < 0 ? pEnd : pMax[dep]; 2698552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2699552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2700552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 2701552f7358SJed Brown } 2702552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 2703552f7358SJed Brown } 2704552f7358SJed Brown } 2705*9ac3fadcSMatthew G. Knepley ierr = PetscFree(pMax);CHKERRQ(ierr); 2706552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 2707552f7358SJed Brown PetscFunctionReturn(0); 2708552f7358SJed Brown } 2709552f7358SJed Brown 2710552f7358SJed Brown #undef __FUNCT__ 2711552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 2712552f7358SJed Brown /* Set the number of dof on each point and separate by fields 2713552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 2714552f7358SJed Brown */ 2715a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 2716a6dfd86eSKarl Rupp { 2717552f7358SJed Brown PetscInt numFields; 2718552f7358SJed Brown PetscInt bc; 2719a68b90caSToby Isaac PetscSection aSec; 2720552f7358SJed Brown PetscErrorCode ierr; 2721552f7358SJed Brown 2722552f7358SJed Brown PetscFunctionBegin; 2723552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2724552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 2725552f7358SJed Brown PetscInt field = 0; 2726552f7358SJed Brown const PetscInt *idx; 2727552f7358SJed Brown PetscInt n, i; 2728552f7358SJed Brown 27290d644c17SKarl Rupp if (numFields) field = bcField[bc]; 2730552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 2731552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2732552f7358SJed Brown for (i = 0; i < n; ++i) { 2733552f7358SJed Brown const PetscInt p = idx[i]; 2734552f7358SJed Brown PetscInt numConst = constDof; 2735552f7358SJed Brown 2736552f7358SJed Brown /* Constrain every dof on the point */ 2737552f7358SJed Brown if (numConst < 0) { 2738552f7358SJed Brown if (numFields) { 2739552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 2740552f7358SJed Brown } else { 2741552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 2742552f7358SJed Brown } 2743552f7358SJed Brown } 2744552f7358SJed Brown if (numFields) { 2745552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 2746552f7358SJed Brown } 2747552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 2748552f7358SJed Brown } 2749552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 2750552f7358SJed Brown } 2751a17985deSToby Isaac ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 2752a68b90caSToby Isaac if (aSec) { 2753a68b90caSToby Isaac PetscInt aStart, aEnd, a; 2754a68b90caSToby Isaac 2755a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 2756a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 2757a68b90caSToby Isaac PetscInt dof; 2758a68b90caSToby Isaac 2759a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 2760a68b90caSToby Isaac if (dof) { 2761a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 2762a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 2763a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 2764a68b90caSToby Isaac if (numFields) { 2765a68b90caSToby Isaac PetscInt f; 2766a68b90caSToby Isaac 2767a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 2768a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 2769a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 2770a68b90caSToby Isaac } 2771a68b90caSToby Isaac } 2772a68b90caSToby Isaac } 2773a68b90caSToby Isaac } 2774a68b90caSToby Isaac } 2775552f7358SJed Brown PetscFunctionReturn(0); 2776552f7358SJed Brown } 2777552f7358SJed Brown 2778552f7358SJed Brown #undef __FUNCT__ 2779552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 2780552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 27810adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 27820adebc6cSBarry Smith { 2783552f7358SJed Brown PetscInt *maxConstraints; 2784552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 2785552f7358SJed Brown PetscErrorCode ierr; 2786552f7358SJed Brown 2787552f7358SJed Brown PetscFunctionBegin; 2788552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2789552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2790854ce69bSBarry Smith ierr = PetscMalloc1(numFields+1, &maxConstraints);CHKERRQ(ierr); 27910d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 2792552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2793552f7358SJed Brown PetscInt cdof; 2794552f7358SJed Brown 2795552f7358SJed Brown if (numFields) { 2796552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2797552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 2798552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 2799552f7358SJed Brown } 2800552f7358SJed Brown } else { 2801552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2802552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 2803552f7358SJed Brown } 2804552f7358SJed Brown } 2805552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2806552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 2807552f7358SJed Brown } 2808552f7358SJed Brown if (maxConstraints[numFields]) { 2809552f7358SJed Brown PetscInt *indices; 2810552f7358SJed Brown 2811785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 2812552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2813552f7358SJed Brown PetscInt cdof, d; 2814552f7358SJed Brown 2815552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2816552f7358SJed Brown if (cdof) { 2817552f7358SJed 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]); 2818552f7358SJed Brown if (numFields) { 2819552f7358SJed Brown PetscInt numConst = 0, foff = 0; 2820552f7358SJed Brown 2821552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2822552f7358SJed Brown PetscInt cfdof, fdof; 2823552f7358SJed Brown 2824552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 2825552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 2826552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 28270d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 2828552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 28290d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 2830552f7358SJed Brown numConst += cfdof; 2831552f7358SJed Brown foff += fdof; 2832552f7358SJed Brown } 2833552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 2834552f7358SJed Brown } else { 28350d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 2836552f7358SJed Brown } 2837552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 2838552f7358SJed Brown } 2839552f7358SJed Brown } 2840552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 2841552f7358SJed Brown } 2842552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 2843552f7358SJed Brown PetscFunctionReturn(0); 2844552f7358SJed Brown } 2845552f7358SJed Brown 2846552f7358SJed Brown #undef __FUNCT__ 2847552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 2848552f7358SJed Brown /* Set the constrained field indices on each point */ 28490adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 28500adebc6cSBarry Smith { 2851552f7358SJed Brown const PetscInt *points, *indices; 2852552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 2853552f7358SJed Brown PetscErrorCode ierr; 2854552f7358SJed Brown 2855552f7358SJed Brown PetscFunctionBegin; 2856552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 2857552f7358SJed 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); 2858552f7358SJed Brown 2859552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 2860552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 2861552f7358SJed Brown if (!constraintIndices) { 2862552f7358SJed Brown PetscInt *idx, i; 2863552f7358SJed Brown 2864552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 2865785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 28660d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 2867552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2868552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 2869552f7358SJed Brown } 2870552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 2871552f7358SJed Brown } else { 2872552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 2873552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 2874552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2875552f7358SJed Brown PetscInt fcdof; 2876552f7358SJed Brown 2877552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 287882f516ccSBarry 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); 2879552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 2880552f7358SJed Brown } 2881552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 2882552f7358SJed Brown } 2883552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 2884552f7358SJed Brown PetscFunctionReturn(0); 2885552f7358SJed Brown } 2886552f7358SJed Brown 2887552f7358SJed Brown #undef __FUNCT__ 2888552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 2889552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 28900adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 28910adebc6cSBarry Smith { 2892552f7358SJed Brown PetscInt *indices; 2893552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 2894552f7358SJed Brown PetscErrorCode ierr; 2895552f7358SJed Brown 2896552f7358SJed Brown PetscFunctionBegin; 2897552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 2898785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 2899552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 290082f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 2901552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 2902552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2903552f7358SJed Brown PetscInt cdof, d; 2904552f7358SJed Brown 2905552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 2906552f7358SJed Brown if (cdof) { 2907552f7358SJed Brown PetscInt numConst = 0, foff = 0; 2908552f7358SJed Brown 2909552f7358SJed Brown for (f = 0; f < numFields; ++f) { 2910552f7358SJed Brown const PetscInt *fcind; 2911552f7358SJed Brown PetscInt fdof, fcdof; 2912552f7358SJed Brown 2913552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 2914552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 2915552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 2916552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 29170d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 2918552f7358SJed Brown foff += fdof; 2919552f7358SJed Brown numConst += fcdof; 2920552f7358SJed Brown } 292182f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 2922552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 2923552f7358SJed Brown } 2924552f7358SJed Brown } 2925552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 2926552f7358SJed Brown PetscFunctionReturn(0); 2927552f7358SJed Brown } 2928552f7358SJed Brown 2929552f7358SJed Brown #undef __FUNCT__ 2930552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 2931552f7358SJed Brown /*@C 2932552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 2933552f7358SJed Brown 2934552f7358SJed Brown Not Collective 2935552f7358SJed Brown 2936552f7358SJed Brown Input Parameters: 2937552f7358SJed Brown + dm - The DMPlex object 2938552f7358SJed Brown . dim - The spatial dimension of the problem 2939552f7358SJed Brown . numFields - The number of fields in the problem 2940552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 2941552f7358SJed 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 2942552f7358SJed Brown . numBC - The number of boundary conditions 2943552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 2944f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 2945f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 2946552f7358SJed Brown 2947552f7358SJed Brown Output Parameter: 2948552f7358SJed Brown . section - The PetscSection object 2949552f7358SJed Brown 2950552f7358SJed 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 2951f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 2952f8f126e8SMatthew G. Knepley 2953f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 2954552f7358SJed Brown 2955552f7358SJed Brown Level: developer 2956552f7358SJed Brown 29573813dfbdSMatthew G Knepley Fortran Notes: 29583813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 29593813dfbdSMatthew G Knepley 2960552f7358SJed Brown .keywords: mesh, elements 2961f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 2962552f7358SJed Brown @*/ 2963f8f126e8SMatthew 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) 2964a6dfd86eSKarl Rupp { 2965a68b90caSToby Isaac PetscSection aSec; 2966552f7358SJed Brown PetscErrorCode ierr; 2967552f7358SJed Brown 2968552f7358SJed Brown PetscFunctionBegin; 2969552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 2970552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 2971f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 2972552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 2973a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr); 2974a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 2975ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 2976552f7358SJed Brown PetscFunctionReturn(0); 2977552f7358SJed Brown } 2978552f7358SJed Brown 2979552f7358SJed Brown #undef __FUNCT__ 2980552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 29810adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 29820adebc6cSBarry Smith { 2983552f7358SJed Brown PetscSection section; 2984552f7358SJed Brown PetscErrorCode ierr; 2985552f7358SJed Brown 2986552f7358SJed Brown PetscFunctionBegin; 298738221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 298882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 2989552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 29901d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 2991552f7358SJed Brown PetscFunctionReturn(0); 2992552f7358SJed Brown } 2993552f7358SJed Brown 2994552f7358SJed Brown #undef __FUNCT__ 2995552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 29960adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 29970adebc6cSBarry Smith { 2998552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2999552f7358SJed Brown 3000552f7358SJed Brown PetscFunctionBegin; 3001552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3002552f7358SJed Brown if (section) *section = mesh->coneSection; 3003552f7358SJed Brown PetscFunctionReturn(0); 3004552f7358SJed Brown } 3005552f7358SJed Brown 3006552f7358SJed Brown #undef __FUNCT__ 30078cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 30088cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 30098cb4d582SMatthew G. Knepley { 30108cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 30118cb4d582SMatthew G. Knepley 30128cb4d582SMatthew G. Knepley PetscFunctionBegin; 30138cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 30148cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 30158cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 30168cb4d582SMatthew G. Knepley } 30178cb4d582SMatthew G. Knepley 30188cb4d582SMatthew G. Knepley #undef __FUNCT__ 3019552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 3020a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 3021a6dfd86eSKarl Rupp { 3022552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3023552f7358SJed Brown 3024552f7358SJed Brown PetscFunctionBegin; 3025552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3026552f7358SJed Brown if (cones) *cones = mesh->cones; 3027552f7358SJed Brown PetscFunctionReturn(0); 3028552f7358SJed Brown } 3029552f7358SJed Brown 3030552f7358SJed Brown #undef __FUNCT__ 3031552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 3032a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 3033a6dfd86eSKarl Rupp { 3034552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 3035552f7358SJed Brown 3036552f7358SJed Brown PetscFunctionBegin; 3037552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3038552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 3039552f7358SJed Brown PetscFunctionReturn(0); 3040552f7358SJed Brown } 3041552f7358SJed Brown 3042552f7358SJed Brown /******************************** FEM Support **********************************/ 3043552f7358SJed Brown 3044552f7358SJed Brown #undef __FUNCT__ 30451a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 30461a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3047a6dfd86eSKarl Rupp { 3048552f7358SJed Brown PetscScalar *array, *vArray; 3049d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 30501a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 3051552f7358SJed Brown PetscErrorCode ierr; 3052552f7358SJed Brown 30531b406b76SMatthew G. Knepley PetscFunctionBeginHot; 30542a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 30555a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 30565a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 30575a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 30583f7cbbe7SMatthew G. Knepley if (!values || !*values) { 30599df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 30609df71ca4SMatthew G. Knepley PetscInt dof; 3061d9917b9dSMatthew G. Knepley 30629df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 30639df71ca4SMatthew G. Knepley size += dof; 30649df71ca4SMatthew G. Knepley } 30659df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 30669df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 30672a3aaacfSMatthew G. Knepley PetscInt dof; 30685a1bb5cfSMatthew G. Knepley 30695a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 30702a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 30715a1bb5cfSMatthew G. Knepley size += dof; 30725a1bb5cfSMatthew G. Knepley } 30733f7cbbe7SMatthew G. Knepley if (!values) { 30743f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 30753f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 30763f7cbbe7SMatthew G. Knepley } 30775a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 3078982e9ed1SMatthew G. Knepley } else { 3079982e9ed1SMatthew G. Knepley array = *values; 3080982e9ed1SMatthew G. Knepley } 30819df71ca4SMatthew G. Knepley size = 0; 30825a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 30839df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 30849df71ca4SMatthew G. Knepley PetscInt dof, off, d; 30859df71ca4SMatthew G. Knepley PetscScalar *varr; 3086d9917b9dSMatthew G. Knepley 30879df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 30889df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 30899df71ca4SMatthew G. Knepley varr = &vArray[off]; 30901a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 30911a271a75SMatthew G. Knepley array[offset] = varr[d]; 30929df71ca4SMatthew G. Knepley } 30939df71ca4SMatthew G. Knepley size += dof; 30949df71ca4SMatthew G. Knepley } 30959df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 30969df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 30979df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 30985a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 30995a1bb5cfSMatthew G. Knepley PetscScalar *varr; 31005a1bb5cfSMatthew G. Knepley 310152ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 31025a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 31035a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 31045a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 31055a1bb5cfSMatthew G. Knepley if (o >= 0) { 31061a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 31071a271a75SMatthew G. Knepley array[offset] = varr[d]; 31085a1bb5cfSMatthew G. Knepley } 31095a1bb5cfSMatthew G. Knepley } else { 31101a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 31111a271a75SMatthew G. Knepley array[offset] = varr[d]; 31125a1bb5cfSMatthew G. Knepley } 31135a1bb5cfSMatthew G. Knepley } 31149df71ca4SMatthew G. Knepley size += dof; 31155a1bb5cfSMatthew G. Knepley } 31165a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 31179df71ca4SMatthew G. Knepley if (!*values) { 31185a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 31195a1bb5cfSMatthew G. Knepley *values = array; 31209df71ca4SMatthew G. Knepley } else { 31219df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 31228c312ff3SMatthew G. Knepley *csize = size; 31239df71ca4SMatthew G. Knepley } 31245a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 31255a1bb5cfSMatthew G. Knepley } 3126d9917b9dSMatthew G. Knepley 3127d9917b9dSMatthew G. Knepley #undef __FUNCT__ 31281a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 31291a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 31301a271a75SMatthew G. Knepley { 31311a271a75SMatthew G. Knepley PetscInt offset = 0, p; 31321a271a75SMatthew G. Knepley PetscErrorCode ierr; 31331a271a75SMatthew G. Knepley 31341a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3135fe02ba77SJed Brown *size = 0; 31361a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 31371a271a75SMatthew G. Knepley const PetscInt point = points[p]; 31381a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 31391a271a75SMatthew G. Knepley PetscInt dof, off, d; 31401a271a75SMatthew G. Knepley const PetscScalar *varr; 31411a271a75SMatthew G. Knepley 31421a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 31431a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 31441a271a75SMatthew G. Knepley varr = &vArray[off]; 31451a271a75SMatthew G. Knepley if (o >= 0) { 31461a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 31471a271a75SMatthew G. Knepley } else { 31481a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 31491a271a75SMatthew G. Knepley } 31501a271a75SMatthew G. Knepley } 31511a271a75SMatthew G. Knepley *size = offset; 31521a271a75SMatthew G. Knepley PetscFunctionReturn(0); 31531a271a75SMatthew G. Knepley } 31541a271a75SMatthew G. Knepley 31551a271a75SMatthew G. Knepley #undef __FUNCT__ 31561a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 31571a271a75SMatthew 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[]) 31581a271a75SMatthew G. Knepley { 31591a271a75SMatthew G. Knepley PetscInt offset = 0, f; 31601a271a75SMatthew G. Knepley PetscErrorCode ierr; 31611a271a75SMatthew G. Knepley 31621a271a75SMatthew G. Knepley PetscFunctionBeginHot; 3163fe02ba77SJed Brown *size = 0; 31641a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 31651a271a75SMatthew G. Knepley PetscInt fcomp, p; 31661a271a75SMatthew G. Knepley 31671a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 31681a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 31691a271a75SMatthew G. Knepley const PetscInt point = points[p]; 31701a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 31711a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 31721a271a75SMatthew G. Knepley const PetscScalar *varr; 31731a271a75SMatthew G. Knepley 31741a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 31751a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 31761a271a75SMatthew G. Knepley varr = &vArray[foff]; 31771a271a75SMatthew G. Knepley if (o >= 0) { 31781a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 31791a271a75SMatthew G. Knepley } else { 31801a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 31811a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 31821a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 31831a271a75SMatthew G. Knepley } 31841a271a75SMatthew G. Knepley } 31851a271a75SMatthew G. Knepley } 31861a271a75SMatthew G. Knepley } 31871a271a75SMatthew G. Knepley } 31881a271a75SMatthew G. Knepley *size = offset; 31891a271a75SMatthew G. Knepley PetscFunctionReturn(0); 31901a271a75SMatthew G. Knepley } 31911a271a75SMatthew G. Knepley 31921a271a75SMatthew G. Knepley #undef __FUNCT__ 3193552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 3194552f7358SJed Brown /*@C 3195552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 3196552f7358SJed Brown 3197552f7358SJed Brown Not collective 3198552f7358SJed Brown 3199552f7358SJed Brown Input Parameters: 3200552f7358SJed Brown + dm - The DM 3201552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 3202552f7358SJed Brown . v - The local vector 3203552f7358SJed Brown - point - The sieve point in the DM 3204552f7358SJed Brown 3205552f7358SJed Brown Output Parameters: 3206552f7358SJed Brown + csize - The number of values in the closure, or NULL 3207552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3208552f7358SJed Brown 3209552f7358SJed Brown Fortran Notes: 3210552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 3211552f7358SJed Brown include petsc.h90 in your code. 3212552f7358SJed Brown 3213552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 3214552f7358SJed Brown 3215552f7358SJed Brown Level: intermediate 3216552f7358SJed Brown 3217552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3218552f7358SJed Brown @*/ 3219552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3220552f7358SJed Brown { 3221552f7358SJed Brown PetscSection clSection; 3222d9917b9dSMatthew G. Knepley IS clPoints; 3223552f7358SJed Brown PetscScalar *array, *vArray; 3224552f7358SJed Brown PetscInt *points = NULL; 3225d9917b9dSMatthew G. Knepley const PetscInt *clp; 32261a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 3227552f7358SJed Brown PetscErrorCode ierr; 3228552f7358SJed Brown 3229d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 3230552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3231552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 32321a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 32331a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3234552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3235552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3236552f7358SJed Brown if (depth == 1 && numFields < 2) { 32371a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 3238552f7358SJed Brown PetscFunctionReturn(0); 3239552f7358SJed Brown } 32401a271a75SMatthew G. Knepley /* Get points */ 3241d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3242d9917b9dSMatthew G. Knepley if (!clPoints) { 32431a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 3244552f7358SJed Brown 32451a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3246552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3247552f7358SJed Brown /* Compress out points not in the section */ 3248552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3249552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3250552f7358SJed Brown points[q*2] = points[p]; 3251552f7358SJed Brown points[q*2+1] = points[p+1]; 3252552f7358SJed Brown ++q; 3253552f7358SJed Brown } 3254552f7358SJed Brown } 3255552f7358SJed Brown numPoints = q; 3256d9917b9dSMatthew G. Knepley } else { 3257d9917b9dSMatthew G. Knepley PetscInt dof, off; 3258552f7358SJed Brown 3259d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3260d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3261d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 32621a271a75SMatthew G. Knepley numPoints = dof/2; 3263d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3264552f7358SJed Brown } 32651a271a75SMatthew G. Knepley /* Get array */ 3266552f7358SJed Brown if (!values || !*values) { 32671a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 3268552f7358SJed Brown 32691a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3270552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 32711a271a75SMatthew G. Knepley asize += dof; 3272552f7358SJed Brown } 3273bd6c0d32SMatthew G. Knepley if (!values) { 3274d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 32751a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 32761a271a75SMatthew G. Knepley if (csize) *csize = asize; 3277bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 3278bd6c0d32SMatthew G. Knepley } 32791a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 3280d0f6b257SMatthew G. Knepley } else { 3281d0f6b257SMatthew G. Knepley array = *values; 3282d0f6b257SMatthew G. Knepley } 3283552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 32841a271a75SMatthew G. Knepley /* Get values */ 3285ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 32861a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 32871a271a75SMatthew G. Knepley /* Cleanup points */ 32881a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 32891a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 32901a271a75SMatthew G. Knepley /* Cleanup array */ 3291552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 3292d0f6b257SMatthew G. Knepley if (!*values) { 3293552f7358SJed Brown if (csize) *csize = size; 3294552f7358SJed Brown *values = array; 3295d0f6b257SMatthew G. Knepley } else { 3296d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 3297d0f6b257SMatthew G. Knepley *csize = size; 3298d0f6b257SMatthew G. Knepley } 3299552f7358SJed Brown PetscFunctionReturn(0); 3300552f7358SJed Brown } 3301552f7358SJed Brown 3302552f7358SJed Brown #undef __FUNCT__ 3303552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 3304552f7358SJed Brown /*@C 3305552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 3306552f7358SJed Brown 3307552f7358SJed Brown Not collective 3308552f7358SJed Brown 3309552f7358SJed Brown Input Parameters: 3310552f7358SJed Brown + dm - The DM 33110298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 3312552f7358SJed Brown . v - The local vector 3313552f7358SJed Brown . point - The sieve point in the DM 33140298fd71SBarry Smith . csize - The number of values in the closure, or NULL 3315552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 3316552f7358SJed Brown 33173813dfbdSMatthew G Knepley Fortran Notes: 33183813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 33193813dfbdSMatthew G Knepley include petsc.h90 in your code. 33203813dfbdSMatthew G Knepley 33213813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 33223813dfbdSMatthew G Knepley 3323552f7358SJed Brown Level: intermediate 3324552f7358SJed Brown 3325552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 3326552f7358SJed Brown @*/ 33277c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 3328a6dfd86eSKarl Rupp { 3329552f7358SJed Brown PetscInt size = 0; 3330552f7358SJed Brown PetscErrorCode ierr; 3331552f7358SJed Brown 3332552f7358SJed Brown PetscFunctionBegin; 3333552f7358SJed Brown /* Should work without recalculating size */ 3334552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 3335552f7358SJed Brown PetscFunctionReturn(0); 3336552f7358SJed Brown } 3337552f7358SJed Brown 3338552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 3339552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 3340552f7358SJed Brown 3341552f7358SJed Brown #undef __FUNCT__ 3342552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 33431a271a75SMatthew 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[]) 3344552f7358SJed Brown { 3345552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3346552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3347552f7358SJed Brown PetscScalar *a; 3348552f7358SJed Brown PetscInt off, cind = 0, k; 3349552f7358SJed Brown PetscErrorCode ierr; 3350552f7358SJed Brown 3351552f7358SJed Brown PetscFunctionBegin; 3352552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3353552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3354552f7358SJed Brown a = &array[off]; 3355552f7358SJed Brown if (!cdof || setBC) { 3356552f7358SJed Brown if (orientation >= 0) { 3357552f7358SJed Brown for (k = 0; k < dof; ++k) { 3358552f7358SJed Brown fuse(&a[k], values[k]); 3359552f7358SJed Brown } 3360552f7358SJed Brown } else { 3361552f7358SJed Brown for (k = 0; k < dof; ++k) { 3362552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3363552f7358SJed Brown } 3364552f7358SJed Brown } 3365552f7358SJed Brown } else { 3366552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3367552f7358SJed Brown if (orientation >= 0) { 3368552f7358SJed Brown for (k = 0; k < dof; ++k) { 3369552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3370552f7358SJed Brown fuse(&a[k], values[k]); 3371552f7358SJed Brown } 3372552f7358SJed Brown } else { 3373552f7358SJed Brown for (k = 0; k < dof; ++k) { 3374552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3375552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 3376552f7358SJed Brown } 3377552f7358SJed Brown } 3378552f7358SJed Brown } 3379552f7358SJed Brown PetscFunctionReturn(0); 3380552f7358SJed Brown } 3381552f7358SJed Brown 3382552f7358SJed Brown #undef __FUNCT__ 3383a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 33841a271a75SMatthew 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[]) 3385a5e93ea8SMatthew G. Knepley { 3386a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 3387a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3388a5e93ea8SMatthew G. Knepley PetscScalar *a; 3389a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 3390a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3391a5e93ea8SMatthew G. Knepley 3392a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3393a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3394a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 3395a5e93ea8SMatthew G. Knepley a = &array[off]; 3396a5e93ea8SMatthew G. Knepley if (cdof) { 3397a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3398a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 3399a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3400a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3401a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 3402a5e93ea8SMatthew G. Knepley ++cind; 3403a5e93ea8SMatthew G. Knepley } 3404a5e93ea8SMatthew G. Knepley } 3405a5e93ea8SMatthew G. Knepley } else { 3406a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3407a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 3408a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 3409a5e93ea8SMatthew G. Knepley ++cind; 3410a5e93ea8SMatthew G. Knepley } 3411a5e93ea8SMatthew G. Knepley } 3412a5e93ea8SMatthew G. Knepley } 3413a5e93ea8SMatthew G. Knepley } 3414a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3415a5e93ea8SMatthew G. Knepley } 3416a5e93ea8SMatthew G. Knepley 3417a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 3418552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 34191a271a75SMatthew 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[]) 3420a6dfd86eSKarl Rupp { 3421552f7358SJed Brown PetscScalar *a; 34221a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 34231a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 34241a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3425552f7358SJed Brown PetscErrorCode ierr; 3426552f7358SJed Brown 3427552f7358SJed Brown PetscFunctionBegin; 3428552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3429552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 34301a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 34311a271a75SMatthew G. Knepley a = &array[foff]; 3432552f7358SJed Brown if (!fcdof || setBC) { 34331a271a75SMatthew G. Knepley if (o >= 0) { 34341a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 3435552f7358SJed Brown } else { 3436552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3437552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 34381a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3439552f7358SJed Brown } 3440552f7358SJed Brown } 3441552f7358SJed Brown } 3442552f7358SJed Brown } else { 3443552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 34441a271a75SMatthew G. Knepley if (o >= 0) { 3445552f7358SJed Brown for (k = 0; k < fdof; ++k) { 3446552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 34471a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3448552f7358SJed Brown } 3449552f7358SJed Brown } else { 3450552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3451552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3452552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 34531a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3454552f7358SJed Brown } 3455552f7358SJed Brown } 3456552f7358SJed Brown } 3457552f7358SJed Brown } 34581a271a75SMatthew G. Knepley *offset += fdof; 3459552f7358SJed Brown PetscFunctionReturn(0); 3460552f7358SJed Brown } 3461552f7358SJed Brown 3462552f7358SJed Brown #undef __FUNCT__ 3463a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 34641a271a75SMatthew 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[]) 3465a5e93ea8SMatthew G. Knepley { 3466a5e93ea8SMatthew G. Knepley PetscScalar *a; 34671a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 34681a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 34691a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 3470a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 3471a5e93ea8SMatthew G. Knepley 3472a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 3473a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3474a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 34751a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 34761a271a75SMatthew G. Knepley a = &array[foff]; 3477a5e93ea8SMatthew G. Knepley if (fcdof) { 3478a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 34791a271a75SMatthew G. Knepley if (o >= 0) { 3480a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 3481a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 34821a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 3483a5e93ea8SMatthew G. Knepley ++cind; 3484a5e93ea8SMatthew G. Knepley } 3485a5e93ea8SMatthew G. Knepley } 3486a5e93ea8SMatthew G. Knepley } else { 3487a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 3488a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 3489a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 34901a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 3491a5e93ea8SMatthew G. Knepley ++cind; 3492a5e93ea8SMatthew G. Knepley } 3493a5e93ea8SMatthew G. Knepley } 3494a5e93ea8SMatthew G. Knepley } 3495a5e93ea8SMatthew G. Knepley } 3496a5e93ea8SMatthew G. Knepley } 34971a271a75SMatthew G. Knepley *offset += fdof; 3498a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 3499a5e93ea8SMatthew G. Knepley } 3500a5e93ea8SMatthew G. Knepley 3501a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 35021b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 35031a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 3504a6dfd86eSKarl Rupp { 3505552f7358SJed Brown PetscScalar *array; 35061b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 35071b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 3508552f7358SJed Brown PetscErrorCode ierr; 3509552f7358SJed Brown 35101b406b76SMatthew G. Knepley PetscFunctionBeginHot; 3511b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3512b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 3513b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 3514b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 3515b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3516b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 3517b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 3518b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 3519b6ebb6e6SMatthew G. Knepley 3520b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 3521b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 3522b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 3523b6ebb6e6SMatthew G. Knepley { 3524b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3525b6ebb6e6SMatthew G. Knepley PetscScalar *a; 3526b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 3527b6ebb6e6SMatthew G. Knepley 3528b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 3529b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 3530b6ebb6e6SMatthew G. Knepley a = &array[coff]; 3531b6ebb6e6SMatthew G. Knepley if (!cdof) { 3532b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3533b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3534b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3535b6ebb6e6SMatthew G. Knepley } 3536b6ebb6e6SMatthew G. Knepley } else { 3537b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3538b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3539b6ebb6e6SMatthew G. Knepley } 3540b6ebb6e6SMatthew G. Knepley } 3541b6ebb6e6SMatthew G. Knepley } else { 3542b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 3543b6ebb6e6SMatthew G. Knepley if (o >= 0) { 3544b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3545b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3546b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 3547b6ebb6e6SMatthew G. Knepley } 3548b6ebb6e6SMatthew G. Knepley } else { 3549b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 3550b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 3551b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 3552b6ebb6e6SMatthew G. Knepley } 3553b6ebb6e6SMatthew G. Knepley } 3554b6ebb6e6SMatthew G. Knepley } 3555b6ebb6e6SMatthew G. Knepley } 3556b6ebb6e6SMatthew G. Knepley } 3557b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3558b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 3559b6ebb6e6SMatthew G. Knepley } 35601b406b76SMatthew G. Knepley 35611b406b76SMatthew G. Knepley #undef __FUNCT__ 35621b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 35631b406b76SMatthew G. Knepley /*@C 35641b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 35651b406b76SMatthew G. Knepley 35661b406b76SMatthew G. Knepley Not collective 35671b406b76SMatthew G. Knepley 35681b406b76SMatthew G. Knepley Input Parameters: 35691b406b76SMatthew G. Knepley + dm - The DM 35701b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 35711b406b76SMatthew G. Knepley . v - The local vector 35721b406b76SMatthew G. Knepley . point - The sieve point in the DM 35731b406b76SMatthew G. Knepley . values - The array of values 35741b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 35751b406b76SMatthew G. Knepley 35761b406b76SMatthew G. Knepley Fortran Notes: 35771b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 35781b406b76SMatthew G. Knepley 35791b406b76SMatthew G. Knepley Level: intermediate 35801b406b76SMatthew G. Knepley 35811b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 35821b406b76SMatthew G. Knepley @*/ 35831b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 35841b406b76SMatthew G. Knepley { 35851b406b76SMatthew G. Knepley PetscSection clSection; 35861b406b76SMatthew G. Knepley IS clPoints; 35871b406b76SMatthew G. Knepley PetscScalar *array; 35881b406b76SMatthew G. Knepley PetscInt *points = NULL; 35891b406b76SMatthew G. Knepley const PetscInt *clp; 35901a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 35911b406b76SMatthew G. Knepley PetscErrorCode ierr; 35921b406b76SMatthew G. Knepley 35931a271a75SMatthew G. Knepley PetscFunctionBeginHot; 35941b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 35951b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 35961a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 35971a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 35981b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 35991b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 36001b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 36011a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 36021b406b76SMatthew G. Knepley PetscFunctionReturn(0); 36031b406b76SMatthew G. Knepley } 36041a271a75SMatthew G. Knepley /* Get points */ 36051b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 36061b406b76SMatthew G. Knepley if (!clPoints) { 36071a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 36081a271a75SMatthew G. Knepley 36091a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3610552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3611552f7358SJed Brown /* Compress out points not in the section */ 3612552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 3613552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 3614552f7358SJed Brown points[q*2] = points[p]; 3615552f7358SJed Brown points[q*2+1] = points[p+1]; 3616552f7358SJed Brown ++q; 3617552f7358SJed Brown } 3618552f7358SJed Brown } 3619552f7358SJed Brown numPoints = q; 36201b406b76SMatthew G. Knepley } else { 36211b406b76SMatthew G. Knepley PetscInt dof, off; 3622552f7358SJed Brown 36231b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 36241b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 36251b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 36261a271a75SMatthew G. Knepley numPoints = dof/2; 36271b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 3628552f7358SJed Brown } 36291a271a75SMatthew G. Knepley /* Get array */ 3630552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 36311a271a75SMatthew G. Knepley /* Get values */ 3632ef90cfe2SMatthew G. Knepley if (numFields > 0) { 36331a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3634552f7358SJed Brown for (f = 0; f < numFields; ++f) { 36351a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3636552f7358SJed Brown switch (mode) { 3637552f7358SJed Brown case INSERT_VALUES: 3638552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 36391a271a75SMatthew G. Knepley const PetscInt point = points[p]; 36401a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 36411a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3642552f7358SJed Brown } break; 3643552f7358SJed Brown case INSERT_ALL_VALUES: 3644552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 36451a271a75SMatthew G. Knepley const PetscInt point = points[p]; 36461a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 36471a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3648552f7358SJed Brown } break; 3649a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3650a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 36511a271a75SMatthew G. Knepley const PetscInt point = points[p]; 36521a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 36531a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3654a5e93ea8SMatthew G. Knepley } break; 3655552f7358SJed Brown case ADD_VALUES: 3656552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 36571a271a75SMatthew G. Knepley const PetscInt point = points[p]; 36581a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 36591a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3660552f7358SJed Brown } break; 3661552f7358SJed Brown case ADD_ALL_VALUES: 3662552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 36631a271a75SMatthew G. Knepley const PetscInt point = points[p]; 36641a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 36651a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3666552f7358SJed Brown } break; 3667552f7358SJed Brown default: 366882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3669552f7358SJed Brown } 36701a271a75SMatthew G. Knepley } 3671552f7358SJed Brown } else { 36721a271a75SMatthew G. Knepley PetscInt dof, off; 36731a271a75SMatthew G. Knepley 3674552f7358SJed Brown switch (mode) { 3675552f7358SJed Brown case INSERT_VALUES: 3676552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3677552f7358SJed Brown PetscInt o = points[p+1]; 3678552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3679552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 3680552f7358SJed Brown } break; 3681552f7358SJed Brown case INSERT_ALL_VALUES: 3682552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3683552f7358SJed Brown PetscInt o = points[p+1]; 3684552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3685552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 3686552f7358SJed Brown } break; 3687a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 3688a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3689a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 3690a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3691a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 3692a5e93ea8SMatthew G. Knepley } break; 3693552f7358SJed Brown case ADD_VALUES: 3694552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3695552f7358SJed Brown PetscInt o = points[p+1]; 3696552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3697552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 3698552f7358SJed Brown } break; 3699552f7358SJed Brown case ADD_ALL_VALUES: 3700552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 3701552f7358SJed Brown PetscInt o = points[p+1]; 3702552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 3703552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 3704552f7358SJed Brown } break; 3705552f7358SJed Brown default: 370682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3707552f7358SJed Brown } 3708552f7358SJed Brown } 37091a271a75SMatthew G. Knepley /* Cleanup points */ 37101a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 37111a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 37121a271a75SMatthew G. Knepley /* Cleanup array */ 3713552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3714552f7358SJed Brown PetscFunctionReturn(0); 3715552f7358SJed Brown } 3716552f7358SJed Brown 3717552f7358SJed Brown #undef __FUNCT__ 3718e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 3719e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 3720e07394fbSMatthew G. Knepley { 3721e07394fbSMatthew G. Knepley PetscSection clSection; 3722e07394fbSMatthew G. Knepley IS clPoints; 3723e07394fbSMatthew G. Knepley PetscScalar *array; 3724e07394fbSMatthew G. Knepley PetscInt *points = NULL; 3725e07394fbSMatthew G. Knepley const PetscInt *clp; 3726e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 3727e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 3728e07394fbSMatthew G. Knepley PetscErrorCode ierr; 3729e07394fbSMatthew G. Knepley 3730e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 3731e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3732e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 3733e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 3734e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 3735e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3736e07394fbSMatthew G. Knepley /* Get points */ 3737e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 3738e07394fbSMatthew G. Knepley if (!clPoints) { 3739e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 3740e07394fbSMatthew G. Knepley 3741e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3742e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3743e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 3744e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 3745e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 3746e07394fbSMatthew G. Knepley points[q*2] = points[p]; 3747e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 3748e07394fbSMatthew G. Knepley ++q; 3749e07394fbSMatthew G. Knepley } 3750e07394fbSMatthew G. Knepley } 3751e07394fbSMatthew G. Knepley numPoints = q; 3752e07394fbSMatthew G. Knepley } else { 3753e07394fbSMatthew G. Knepley PetscInt dof, off; 3754e07394fbSMatthew G. Knepley 3755e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 3756e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 3757e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 3758e07394fbSMatthew G. Knepley numPoints = dof/2; 3759e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 3760e07394fbSMatthew G. Knepley } 3761e07394fbSMatthew G. Knepley /* Get array */ 3762e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 3763e07394fbSMatthew G. Knepley /* Get values */ 3764e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 3765e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3766e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 3767e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3768e07394fbSMatthew G. Knepley PetscInt fdof; 3769e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 3770e07394fbSMatthew G. Knepley offset += fdof; 3771e07394fbSMatthew G. Knepley } 3772e07394fbSMatthew G. Knepley continue; 3773e07394fbSMatthew G. Knepley } 3774e07394fbSMatthew G. Knepley switch (mode) { 3775e07394fbSMatthew G. Knepley case INSERT_VALUES: 3776e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3777e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3778e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3779e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 3780e07394fbSMatthew G. Knepley } break; 3781e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 3782e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3783e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3784e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3785e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 3786e07394fbSMatthew G. Knepley } break; 3787e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 3788e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3789e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3790e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3791e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 3792e07394fbSMatthew G. Knepley } break; 3793e07394fbSMatthew G. Knepley case ADD_VALUES: 3794e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3795e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3796e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3797e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 3798e07394fbSMatthew G. Knepley } break; 3799e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 3800e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 3801e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 3802e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 3803e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 3804e07394fbSMatthew G. Knepley } break; 3805e07394fbSMatthew G. Knepley default: 3806e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 3807e07394fbSMatthew G. Knepley } 3808e07394fbSMatthew G. Knepley } 3809e07394fbSMatthew G. Knepley /* Cleanup points */ 3810e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 3811e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 3812e07394fbSMatthew G. Knepley /* Cleanup array */ 3813e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 3814e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 3815e07394fbSMatthew G. Knepley } 3816e07394fbSMatthew G. Knepley 3817e07394fbSMatthew G. Knepley #undef __FUNCT__ 3818552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 3819b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 3820552f7358SJed Brown { 3821552f7358SJed Brown PetscMPIInt rank; 3822552f7358SJed Brown PetscInt i, j; 3823552f7358SJed Brown PetscErrorCode ierr; 3824552f7358SJed Brown 3825552f7358SJed Brown PetscFunctionBegin; 382682f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 382777a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 3828b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 3829b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 3830b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 3831b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 383277a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 3833b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 3834519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 38357eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 3836552f7358SJed Brown #else 3837b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 3838552f7358SJed Brown #endif 3839552f7358SJed Brown } 384077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 3841552f7358SJed Brown } 3842552f7358SJed Brown PetscFunctionReturn(0); 3843552f7358SJed Brown } 3844552f7358SJed Brown 3845552f7358SJed Brown #undef __FUNCT__ 3846552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 3847552f7358SJed Brown /* . off - The global offset of this point */ 3848e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 3849a6dfd86eSKarl Rupp { 3850e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 3851552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 3852552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 3853552f7358SJed Brown PetscInt cind = 0, k; 3854552f7358SJed Brown PetscErrorCode ierr; 3855552f7358SJed Brown 3856552f7358SJed Brown PetscFunctionBegin; 3857552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 3858552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 3859552f7358SJed Brown if (!cdof || setBC) { 3860552f7358SJed Brown if (orientation >= 0) { 3861e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 3862552f7358SJed Brown } else { 3863e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 3864552f7358SJed Brown } 3865552f7358SJed Brown } else { 3866552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 3867552f7358SJed Brown if (orientation >= 0) { 3868552f7358SJed Brown for (k = 0; k < dof; ++k) { 3869552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 3870552f7358SJed Brown /* Insert check for returning constrained indices */ 3871e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 3872552f7358SJed Brown ++cind; 3873552f7358SJed Brown } else { 3874e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 3875552f7358SJed Brown } 3876552f7358SJed Brown } 3877552f7358SJed Brown } else { 3878552f7358SJed Brown for (k = 0; k < dof; ++k) { 3879552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 3880552f7358SJed Brown /* Insert check for returning constrained indices */ 3881e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 3882552f7358SJed Brown ++cind; 3883552f7358SJed Brown } else { 3884e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 3885552f7358SJed Brown } 3886552f7358SJed Brown } 3887552f7358SJed Brown } 3888552f7358SJed Brown } 3889e6ccafaeSMatthew G Knepley *loff += dof; 3890552f7358SJed Brown PetscFunctionReturn(0); 3891552f7358SJed Brown } 3892552f7358SJed Brown 3893552f7358SJed Brown #undef __FUNCT__ 3894552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 3895552f7358SJed Brown /* . off - The global offset of this point */ 3896a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 3897a6dfd86eSKarl Rupp { 3898552f7358SJed Brown PetscInt numFields, foff, f; 3899552f7358SJed Brown PetscErrorCode ierr; 3900552f7358SJed Brown 3901552f7358SJed Brown PetscFunctionBegin; 3902552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3903552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 3904552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 3905552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 3906552f7358SJed Brown PetscInt cind = 0, k, c; 3907552f7358SJed Brown 3908552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 3909552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 3910552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 3911552f7358SJed Brown if (!cfdof || setBC) { 3912552f7358SJed Brown if (orientation >= 0) { 39130d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 3914552f7358SJed Brown } else { 3915552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3916552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3917552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 3918552f7358SJed Brown } 3919552f7358SJed Brown } 3920552f7358SJed Brown } 3921552f7358SJed Brown } else { 3922552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 3923552f7358SJed Brown if (orientation >= 0) { 3924552f7358SJed Brown for (k = 0; k < fdof; ++k) { 3925552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 3926552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 3927552f7358SJed Brown ++cind; 3928552f7358SJed Brown } else { 3929552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 3930552f7358SJed Brown } 3931552f7358SJed Brown } 3932552f7358SJed Brown } else { 3933552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 3934552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 3935552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 3936552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 3937552f7358SJed Brown ++cind; 3938552f7358SJed Brown } else { 3939552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 3940552f7358SJed Brown } 3941552f7358SJed Brown } 3942552f7358SJed Brown } 3943552f7358SJed Brown } 3944552f7358SJed Brown } 3945552f7358SJed Brown foff += fdof - cfdof; 3946552f7358SJed Brown foffs[f] += fdof; 3947552f7358SJed Brown } 3948552f7358SJed Brown PetscFunctionReturn(0); 3949552f7358SJed Brown } 3950552f7358SJed Brown 3951552f7358SJed Brown #undef __FUNCT__ 3952f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat" 3953f7c74593SToby 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[]) 3954d3d1a6afSToby Isaac { 3955d3d1a6afSToby Isaac Mat cMat; 3956d3d1a6afSToby Isaac PetscSection aSec, cSec; 3957d3d1a6afSToby Isaac IS aIS; 3958d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 3959d3d1a6afSToby Isaac const PetscInt *anchors; 3960e17c06e0SMatthew G. Knepley PetscInt numFields, f, p, q, newP = 0; 3961d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 3962d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 3963d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 3964d3d1a6afSToby Isaac PetscInt newOffsets[32]; 3965d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 3966d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 3967d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 3968d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 3969d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 3970d3d1a6afSToby Isaac PetscErrorCode ierr; 3971d3d1a6afSToby Isaac 3972d3d1a6afSToby Isaac PetscFunctionBegin; 3973d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3974d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 3975d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3976d3d1a6afSToby Isaac 3977a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 3978d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 3979d3d1a6afSToby Isaac if (aSec) { 3980d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 3981d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 3982d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 3983d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 3984d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 3985d3d1a6afSToby Isaac * into the global matrix anyway) */ 3986d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 3987d3d1a6afSToby Isaac PetscInt b = points[p]; 3988d3d1a6afSToby Isaac PetscInt bDof = 0; 3989d3d1a6afSToby Isaac 3990d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 3991d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 3992d3d1a6afSToby Isaac } 3993d3d1a6afSToby Isaac if (bDof) { 3994d3d1a6afSToby Isaac /* this point is constrained */ 3995d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 3996d3d1a6afSToby Isaac PetscInt bOff, q; 3997d3d1a6afSToby Isaac 3998d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 3999d3d1a6afSToby Isaac newNumPoints += bDof; 4000d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 4001d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4002d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4003d3d1a6afSToby Isaac PetscInt aDof; 4004d3d1a6afSToby Isaac 4005d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 4006d3d1a6afSToby Isaac newNumIndices += aDof; 4007d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4008d3d1a6afSToby Isaac PetscInt fDof; 4009d3d1a6afSToby Isaac 4010d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 4011d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4012d3d1a6afSToby Isaac } 4013d3d1a6afSToby Isaac } 4014d3d1a6afSToby Isaac } 4015d3d1a6afSToby Isaac else { 4016d3d1a6afSToby Isaac /* this point is not constrained */ 4017d3d1a6afSToby Isaac newNumPoints++; 4018d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 4019d3d1a6afSToby Isaac newNumIndices += bDof; 4020d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 4021d3d1a6afSToby Isaac PetscInt fDof; 4022d3d1a6afSToby Isaac 4023d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4024d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 4025d3d1a6afSToby Isaac } 4026d3d1a6afSToby Isaac } 4027d3d1a6afSToby Isaac } 4028d3d1a6afSToby Isaac } 4029d3d1a6afSToby Isaac if (!anyConstrained) { 4030d3d1a6afSToby Isaac *outNumPoints = 0; 4031d3d1a6afSToby Isaac *outNumIndices = 0; 4032d3d1a6afSToby Isaac *outPoints = NULL; 4033d3d1a6afSToby Isaac *outValues = NULL; 4034d3d1a6afSToby Isaac if (aSec) { 4035d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4036d3d1a6afSToby Isaac } 4037d3d1a6afSToby Isaac PetscFunctionReturn(0); 4038d3d1a6afSToby Isaac } 4039d3d1a6afSToby Isaac 4040d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 4041d3d1a6afSToby Isaac 4042d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 4043d3d1a6afSToby Isaac 4044f7c74593SToby Isaac ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr); 4045d3d1a6afSToby Isaac 4046d3d1a6afSToby Isaac /* output arrays */ 4047d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4048d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4049d3d1a6afSToby Isaac 4050d3d1a6afSToby Isaac /* workspaces */ 4051d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4052d3d1a6afSToby Isaac if (numFields) { 4053d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4054d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4055d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4056d3d1a6afSToby Isaac } 4057d3d1a6afSToby Isaac } 4058d3d1a6afSToby Isaac else { 4059d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4060d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4061d3d1a6afSToby Isaac } 4062d3d1a6afSToby Isaac 4063d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 4064d3d1a6afSToby Isaac if (numFields) { 4065d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4066d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4067d3d1a6afSToby Isaac PetscInt bDof = 0; 4068d3d1a6afSToby Isaac 4069d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4070d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4071d3d1a6afSToby Isaac } 4072d3d1a6afSToby Isaac if (bDof) { 4073d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4074d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 4075d3d1a6afSToby Isaac 4076d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4077d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4078d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4079d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 4080d3d1a6afSToby Isaac PetscInt aFDof; 4081d3d1a6afSToby Isaac 4082d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 4083d3d1a6afSToby Isaac allFDof += aFDof; 4084d3d1a6afSToby Isaac } 4085d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 4086d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 4087d3d1a6afSToby Isaac } 4088d3d1a6afSToby Isaac } 4089d3d1a6afSToby Isaac else { 4090d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4091d3d1a6afSToby Isaac PetscInt fDof; 4092d3d1a6afSToby Isaac 4093d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 4094d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 4095d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 4096d3d1a6afSToby Isaac } 4097d3d1a6afSToby Isaac } 4098d3d1a6afSToby Isaac } 4099d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4100d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 4101d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 4102d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4103d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 4104d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 4105d3d1a6afSToby Isaac } 4106d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4107d3d1a6afSToby Isaac } 4108d3d1a6afSToby Isaac } 4109d3d1a6afSToby Isaac else { 4110d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4111d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4112d3d1a6afSToby Isaac PetscInt bDof = 0; 4113d3d1a6afSToby Isaac 4114d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4115d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4116d3d1a6afSToby Isaac } 4117d3d1a6afSToby Isaac if (bDof) { 4118d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 4119d3d1a6afSToby Isaac 4120d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4121d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 4122d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4123d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 4124d3d1a6afSToby Isaac 4125d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 4126d3d1a6afSToby Isaac allDof += aDof; 4127d3d1a6afSToby Isaac } 4128d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 4129d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 4130d3d1a6afSToby Isaac } 4131d3d1a6afSToby Isaac else { 4132d3d1a6afSToby Isaac PetscInt dof; 4133d3d1a6afSToby Isaac 4134d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 4135d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 4136d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 4137d3d1a6afSToby Isaac } 4138d3d1a6afSToby Isaac } 4139d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 4140d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 4141d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4142d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 4143d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 4144d3d1a6afSToby Isaac } 4145d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4146d3d1a6afSToby Isaac } 4147d3d1a6afSToby Isaac 4148d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 4149d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 4150d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4151d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4152d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4153d3d1a6afSToby Isaac if (numFields) { 4154d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 4155d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4156d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4157d3d1a6afSToby Isaac PetscInt bDof = 0; 4158d3d1a6afSToby Isaac 4159d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4160d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4161d3d1a6afSToby Isaac } 4162d3d1a6afSToby Isaac if (bDof) { 4163d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 4164d3d1a6afSToby Isaac 4165d3d1a6afSToby Isaac fStart[0] = 0; 4166d3d1a6afSToby Isaac fEnd[0] = 0; 4167d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4168d3d1a6afSToby Isaac PetscInt fDof; 4169d3d1a6afSToby Isaac 4170d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 4171d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 4172d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 4173d3d1a6afSToby Isaac } 4174d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4175d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4176d3d1a6afSToby Isaac 4177d3d1a6afSToby Isaac fAnchorStart[0] = 0; 4178d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 4179d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4180d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 4181d3d1a6afSToby Isaac 4182d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 4183d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 4184d3d1a6afSToby Isaac } 4185d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4186d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4187d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4188d3d1a6afSToby Isaac 4189d3d1a6afSToby 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 */ 4190d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4191d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4192d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 4193d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4194d3d1a6afSToby Isaac } 4195d3d1a6afSToby Isaac newP += bDof; 4196d3d1a6afSToby Isaac 4197d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4198d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4199d3d1a6afSToby 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); 4200d3d1a6afSToby Isaac } 4201d3d1a6afSToby Isaac } 4202d3d1a6afSToby Isaac else { 4203d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4204d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4205d3d1a6afSToby Isaac newP++; 4206d3d1a6afSToby Isaac } 4207d3d1a6afSToby Isaac } 4208d3d1a6afSToby Isaac } else { 4209d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4210d3d1a6afSToby Isaac PetscInt b = points[2*p]; 4211d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 4212d3d1a6afSToby Isaac PetscInt bDof = 0; 4213d3d1a6afSToby Isaac 4214d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 4215d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 4216d3d1a6afSToby Isaac } 4217d3d1a6afSToby Isaac if (bDof) { 4218d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 4219d3d1a6afSToby Isaac 4220d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 4221d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 4222d3d1a6afSToby Isaac 4223d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 4224d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 4225d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 4226d3d1a6afSToby Isaac 4227d3d1a6afSToby 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 */ 4228d3d1a6afSToby Isaac 4229d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 4230d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 4231d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 4232d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 4233d3d1a6afSToby Isaac } 4234d3d1a6afSToby Isaac newP += bDof; 4235d3d1a6afSToby Isaac 4236d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 4237d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 4238d3d1a6afSToby Isaac } 4239d3d1a6afSToby Isaac else { 4240d3d1a6afSToby Isaac newPoints[2 * newP] = b; 4241d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 4242d3d1a6afSToby Isaac newP++; 4243d3d1a6afSToby Isaac } 4244d3d1a6afSToby Isaac } 4245d3d1a6afSToby Isaac } 4246d3d1a6afSToby Isaac 4247d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 4248d3d1a6afSToby Isaac /* multiply constraints on the right */ 4249d3d1a6afSToby Isaac if (numFields) { 4250d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4251d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4252d3d1a6afSToby Isaac 4253d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4254d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 4255d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4256d3d1a6afSToby Isaac PetscInt c, r, k; 4257d3d1a6afSToby Isaac PetscInt dof; 4258d3d1a6afSToby Isaac 4259d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4260d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4261d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 4262d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 4263d3d1a6afSToby Isaac 4264d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4265d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4266d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4267d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4268d3d1a6afSToby Isaac } 4269d3d1a6afSToby Isaac } 4270d3d1a6afSToby Isaac } 4271d3d1a6afSToby Isaac } 4272d3d1a6afSToby Isaac else { 4273d3d1a6afSToby Isaac /* copy this column as is */ 4274d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4275d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4276d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4277d3d1a6afSToby Isaac } 4278d3d1a6afSToby Isaac } 4279d3d1a6afSToby Isaac } 4280d3d1a6afSToby Isaac oldOff += dof; 4281d3d1a6afSToby Isaac } 4282d3d1a6afSToby Isaac } 4283d3d1a6afSToby Isaac } 4284d3d1a6afSToby Isaac else { 4285d3d1a6afSToby Isaac PetscInt oldOff = 0; 4286d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4287d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 4288d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4289d3d1a6afSToby Isaac PetscInt c, r, k; 4290d3d1a6afSToby Isaac PetscInt dof; 4291d3d1a6afSToby Isaac 4292d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4293d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4294d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 4295d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 4296d3d1a6afSToby Isaac 4297d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4298d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 4299d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4300d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 4301d3d1a6afSToby Isaac } 4302d3d1a6afSToby Isaac } 4303d3d1a6afSToby Isaac } 4304d3d1a6afSToby Isaac } 4305d3d1a6afSToby Isaac else { 4306d3d1a6afSToby Isaac /* copy this column as is */ 4307d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 4308d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 4309d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 4310d3d1a6afSToby Isaac } 4311d3d1a6afSToby Isaac } 4312d3d1a6afSToby Isaac } 4313d3d1a6afSToby Isaac oldOff += dof; 4314d3d1a6afSToby Isaac } 4315d3d1a6afSToby Isaac } 4316d3d1a6afSToby Isaac 4317d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 4318d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 4319d3d1a6afSToby Isaac if (numFields) { 4320d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4321d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 4322d3d1a6afSToby Isaac 4323d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4324d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 4325d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4326d3d1a6afSToby Isaac PetscInt c, r, k; 4327d3d1a6afSToby Isaac PetscInt dof; 4328d3d1a6afSToby Isaac 4329d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 4330d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 4331d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 4332d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 4333d3d1a6afSToby Isaac 4334d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4335d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4336d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4337d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4338d3d1a6afSToby Isaac } 4339d3d1a6afSToby Isaac } 4340d3d1a6afSToby Isaac } 4341d3d1a6afSToby Isaac } 4342d3d1a6afSToby Isaac else { 4343d3d1a6afSToby Isaac /* copy this row as is */ 4344d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 4345d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4346d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4347d3d1a6afSToby Isaac } 4348d3d1a6afSToby Isaac } 4349d3d1a6afSToby Isaac } 4350d3d1a6afSToby Isaac oldOff += dof; 4351d3d1a6afSToby Isaac } 4352d3d1a6afSToby Isaac } 4353d3d1a6afSToby Isaac } 4354d3d1a6afSToby Isaac else { 4355d3d1a6afSToby Isaac PetscInt oldOff = 0; 4356d3d1a6afSToby Isaac 4357d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 4358d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 4359d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 4360d3d1a6afSToby Isaac PetscInt c, r, k; 4361d3d1a6afSToby Isaac PetscInt dof; 4362d3d1a6afSToby Isaac 4363d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 4364d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 4365d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 4366d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 4367d3d1a6afSToby Isaac 4368d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 4369d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4370d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 4371d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 4372d3d1a6afSToby Isaac } 4373d3d1a6afSToby Isaac } 4374d3d1a6afSToby Isaac } 4375d3d1a6afSToby Isaac } 4376d3d1a6afSToby Isaac else { 4377d3d1a6afSToby Isaac /* copy this row as is */ 4378d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 4379d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 4380d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 4381d3d1a6afSToby Isaac } 4382d3d1a6afSToby Isaac } 4383d3d1a6afSToby Isaac } 4384d3d1a6afSToby Isaac oldOff += dof; 4385d3d1a6afSToby Isaac } 4386d3d1a6afSToby Isaac } 4387d3d1a6afSToby Isaac 4388d3d1a6afSToby Isaac /* clean up */ 4389d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 4390d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 4391d3d1a6afSToby Isaac if (numFields) { 4392d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4393d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 4394d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 4395d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 4396d3d1a6afSToby Isaac } 4397d3d1a6afSToby Isaac } 4398d3d1a6afSToby Isaac else { 4399d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 4400d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 4401d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 4402d3d1a6afSToby Isaac } 4403d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 4404d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 4405d3d1a6afSToby Isaac 4406d3d1a6afSToby Isaac /* output */ 4407d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 4408d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 4409d3d1a6afSToby Isaac *outPoints = newPoints; 4410d3d1a6afSToby Isaac *outValues = newValues; 4411d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 4412d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 4413d3d1a6afSToby Isaac } 4414d3d1a6afSToby Isaac PetscFunctionReturn(0); 4415d3d1a6afSToby Isaac } 4416d3d1a6afSToby Isaac 4417d3d1a6afSToby Isaac #undef __FUNCT__ 4418552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 44197f5d1fdeSMatthew G. Knepley /*@C 44207f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 44217f5d1fdeSMatthew G. Knepley 44227f5d1fdeSMatthew G. Knepley Not collective 44237f5d1fdeSMatthew G. Knepley 44247f5d1fdeSMatthew G. Knepley Input Parameters: 44257f5d1fdeSMatthew G. Knepley + dm - The DM 4426ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4427ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 44287f5d1fdeSMatthew G. Knepley . A - The matrix 44297f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 44307f5d1fdeSMatthew G. Knepley . values - The array of values 44317f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 44327f5d1fdeSMatthew G. Knepley 44337f5d1fdeSMatthew G. Knepley Fortran Notes: 44347f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 44357f5d1fdeSMatthew G. Knepley 44367f5d1fdeSMatthew G. Knepley Level: intermediate 44377f5d1fdeSMatthew G. Knepley 44387f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 44397f5d1fdeSMatthew G. Knepley @*/ 44407c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 4441552f7358SJed Brown { 4442552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 44431b406b76SMatthew G. Knepley PetscSection clSection; 44441b406b76SMatthew G. Knepley IS clPoints; 4445d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 44461b406b76SMatthew G. Knepley const PetscInt *clp; 4447552f7358SJed Brown PetscInt *indices; 4448552f7358SJed Brown PetscInt offsets[32]; 4449d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 4450d3d1a6afSToby Isaac PetscScalar *newValues; 4451552f7358SJed Brown PetscErrorCode ierr; 4452552f7358SJed Brown 4453552f7358SJed Brown PetscFunctionBegin; 4454552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4455ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 44563dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 4457ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 44583dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 44593dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 4460552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 446182f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4462552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 44631b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 44641b406b76SMatthew G. Knepley if (!clPoints) { 4465552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4466552f7358SJed Brown /* Compress out points not in the section */ 4467552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4468552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4469552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4470552f7358SJed Brown points[q*2] = points[p]; 4471552f7358SJed Brown points[q*2+1] = points[p+1]; 4472552f7358SJed Brown ++q; 4473552f7358SJed Brown } 4474552f7358SJed Brown } 4475552f7358SJed Brown numPoints = q; 44761b406b76SMatthew G. Knepley } else { 44771b406b76SMatthew G. Knepley PetscInt dof, off; 44781b406b76SMatthew G. Knepley 44791b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 44801b406b76SMatthew G. Knepley numPoints = dof/2; 44811b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 44821b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 44831b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 44841b406b76SMatthew G. Knepley } 4485552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 4486552f7358SJed Brown PetscInt fdof; 4487552f7358SJed Brown 4488552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4489552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4490552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 4491552f7358SJed Brown offsets[f+1] += fdof; 4492552f7358SJed Brown } 4493552f7358SJed Brown numIndices += dof; 4494552f7358SJed Brown } 44950d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 44960d644c17SKarl Rupp 449782f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 4498f7c74593SToby Isaac ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 4499d3d1a6afSToby Isaac if (newNumPoints) { 4500d3d1a6afSToby Isaac if (!clPoints) { 4501d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4502d3d1a6afSToby Isaac } else { 4503d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 4504d3d1a6afSToby Isaac } 4505d3d1a6afSToby Isaac numPoints = newNumPoints; 4506d3d1a6afSToby Isaac numIndices = newNumIndices; 4507d3d1a6afSToby Isaac points = newPoints; 4508d3d1a6afSToby Isaac values = newValues; 4509d3d1a6afSToby Isaac } 4510552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4511552f7358SJed Brown if (numFields) { 4512552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4513552f7358SJed Brown PetscInt o = points[p+1]; 4514552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4515552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 4516552f7358SJed Brown } 4517552f7358SJed Brown } else { 4518e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 4519552f7358SJed Brown PetscInt o = points[p+1]; 4520552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 4521e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 4522552f7358SJed Brown } 4523552f7358SJed Brown } 4524b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 4525552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 4526552f7358SJed Brown if (ierr) { 4527552f7358SJed Brown PetscMPIInt rank; 4528552f7358SJed Brown PetscErrorCode ierr2; 4529552f7358SJed Brown 453082f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 453177a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4532b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 45336a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 4534552f7358SJed Brown CHKERRQ(ierr); 4535552f7358SJed Brown } 4536d3d1a6afSToby Isaac if (newNumPoints) { 4537d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 4538d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 4539d3d1a6afSToby Isaac } 4540d3d1a6afSToby Isaac else { 45411b406b76SMatthew G. Knepley if (!clPoints) { 4542552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 45431b406b76SMatthew G. Knepley } else { 45441b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 45451b406b76SMatthew G. Knepley } 4546d3d1a6afSToby Isaac } 4547552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 4548552f7358SJed Brown PetscFunctionReturn(0); 4549552f7358SJed Brown } 4550552f7358SJed Brown 4551552f7358SJed Brown #undef __FUNCT__ 4552de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 4553de41b84cSMatthew 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) 4554de41b84cSMatthew G. Knepley { 4555de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 4556de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 4557de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 4558de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 4559de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 4560de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 45614ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 4562de41b84cSMatthew G. Knepley PetscErrorCode ierr; 4563de41b84cSMatthew G. Knepley 4564de41b84cSMatthew G. Knepley PetscFunctionBegin; 4565de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 4566de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 4567de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 4568de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 4569de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 4570de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 4571de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 4572de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 4573de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 4574de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 4575de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 4576de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 4577de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 4578de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4579de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 4580de41b84cSMatthew G. Knepley /* Column indices */ 4581de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 45824ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 4583de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4584de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 4585de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 4586de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 4587de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 4588de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 4589de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 4590de41b84cSMatthew G. Knepley ++q; 4591de41b84cSMatthew G. Knepley } 4592de41b84cSMatthew G. Knepley } 4593de41b84cSMatthew G. Knepley numCPoints = q; 4594de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 4595de41b84cSMatthew G. Knepley PetscInt fdof; 4596de41b84cSMatthew G. Knepley 4597de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 45984ca5e9f5SMatthew G. Knepley if (!dof) continue; 4599de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4600de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 4601de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 4602de41b84cSMatthew G. Knepley } 4603de41b84cSMatthew G. Knepley numCIndices += dof; 4604de41b84cSMatthew G. Knepley } 4605de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 4606de41b84cSMatthew G. Knepley /* Row indices */ 4607de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 4608de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 46091ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4610de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 4611de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 4612de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4613de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 4614de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 4615de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4616de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 46174ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 46184ca5e9f5SMatthew G. Knepley if (!dof) continue; 46194ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 46204ca5e9f5SMatthew G. Knepley if (s < q) continue; 4621de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 4622de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 4623de41b84cSMatthew G. Knepley ++q; 4624de41b84cSMatthew G. Knepley } 4625de41b84cSMatthew G. Knepley } 4626de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 4627de41b84cSMatthew G. Knepley } 4628de41b84cSMatthew G. Knepley numFPoints = q; 4629de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 4630de41b84cSMatthew G. Knepley PetscInt fdof; 4631de41b84cSMatthew G. Knepley 4632de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 46334ca5e9f5SMatthew G. Knepley if (!dof) continue; 4634de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 4635de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 4636de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 4637de41b84cSMatthew G. Knepley } 4638de41b84cSMatthew G. Knepley numFIndices += dof; 4639de41b84cSMatthew G. Knepley } 4640de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 4641de41b84cSMatthew G. Knepley 4642de41b84cSMatthew 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); 4643de41b84cSMatthew 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); 4644de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4645de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4646de41b84cSMatthew G. Knepley if (numFields) { 4647de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 4648de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4649de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4650de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 4651de41b84cSMatthew G. Knepley } 4652de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 4653de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4654de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4655de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 4656de41b84cSMatthew G. Knepley } 4657de41b84cSMatthew G. Knepley } else { 4658de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 4659de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 4660de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 4661de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 4662de41b84cSMatthew G. Knepley } 4663de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 4664de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 4665de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 4666de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 4667de41b84cSMatthew G. Knepley } 4668de41b84cSMatthew G. Knepley } 4669de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 4670de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 4671de41b84cSMatthew G. Knepley if (ierr) { 4672de41b84cSMatthew G. Knepley PetscMPIInt rank; 4673de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 4674de41b84cSMatthew G. Knepley 4675de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 4676de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 4677de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 4678de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 4679de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 4680de41b84cSMatthew G. Knepley CHKERRQ(ierr); 4681de41b84cSMatthew G. Knepley } 4682549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 4683de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 4684de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 4685de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 4686de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 4687de41b84cSMatthew G. Knepley } 4688de41b84cSMatthew G. Knepley 4689de41b84cSMatthew G. Knepley #undef __FUNCT__ 46907c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 46917c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 46927c927364SMatthew G. Knepley { 46937c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 46947c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 46957c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 46967c927364SMatthew G. Knepley CellRefiner cellRefiner; 46977c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 46987c927364SMatthew G. Knepley PetscErrorCode ierr; 46997c927364SMatthew G. Knepley 47007c927364SMatthew G. Knepley PetscFunctionBegin; 47017c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 47027c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 47037c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 47047c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 47057c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 47067c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 47077c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 47087c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 47097c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 47107c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 47117c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 47127c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 47137c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 47147c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 47157c927364SMatthew G. Knepley /* Column indices */ 47167c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 47177c927364SMatthew G. Knepley maxFPoints = numCPoints; 47187c927364SMatthew G. Knepley /* Compress out points not in the section */ 47197c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 47207c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 47217c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 47227c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 47237c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 47247c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 47257c927364SMatthew G. Knepley ++q; 47267c927364SMatthew G. Knepley } 47277c927364SMatthew G. Knepley } 47287c927364SMatthew G. Knepley numCPoints = q; 47297c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 47307c927364SMatthew G. Knepley PetscInt fdof; 47317c927364SMatthew G. Knepley 47327c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 47337c927364SMatthew G. Knepley if (!dof) continue; 47347c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 47357c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 47367c927364SMatthew G. Knepley coffsets[f+1] += fdof; 47377c927364SMatthew G. Knepley } 47387c927364SMatthew G. Knepley numCIndices += dof; 47397c927364SMatthew G. Knepley } 47407c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 47417c927364SMatthew G. Knepley /* Row indices */ 47427c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 47437c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 47447c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 47457c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 47467c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 47477c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 47487c927364SMatthew G. Knepley /* Compress out points not in the section */ 47497c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 47507c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 47517c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 47527c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 47537c927364SMatthew G. Knepley if (!dof) continue; 47547c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 47557c927364SMatthew G. Knepley if (s < q) continue; 47567c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 47577c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 47587c927364SMatthew G. Knepley ++q; 47597c927364SMatthew G. Knepley } 47607c927364SMatthew G. Knepley } 47617c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 47627c927364SMatthew G. Knepley } 47637c927364SMatthew G. Knepley numFPoints = q; 47647c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 47657c927364SMatthew G. Knepley PetscInt fdof; 47667c927364SMatthew G. Knepley 47677c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 47687c927364SMatthew G. Knepley if (!dof) continue; 47697c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 47707c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 47717c927364SMatthew G. Knepley foffsets[f+1] += fdof; 47727c927364SMatthew G. Knepley } 47737c927364SMatthew G. Knepley numFIndices += dof; 47747c927364SMatthew G. Knepley } 47757c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 47767c927364SMatthew G. Knepley 47777c927364SMatthew 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); 47787c927364SMatthew 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); 47797c927364SMatthew G. Knepley if (numFields) { 47807c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 47817c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 47827c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 47837c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 47847c927364SMatthew G. Knepley } 47857c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 47867c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 47877c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 47887c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 47897c927364SMatthew G. Knepley } 47907c927364SMatthew G. Knepley } else { 47917c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 47927c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 47937c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 47947c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 47957c927364SMatthew G. Knepley } 47967c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 47977c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 47987c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 47997c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 48007c927364SMatthew G. Knepley } 48017c927364SMatthew G. Knepley } 48027c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 48037c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 48047c927364SMatthew G. Knepley PetscFunctionReturn(0); 48057c927364SMatthew G. Knepley } 48067c927364SMatthew G. Knepley 48077c927364SMatthew G. Knepley #undef __FUNCT__ 4808770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 4809f96281f8SMatthew G. Knepley /*@ 4810f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 4811f96281f8SMatthew G. Knepley 4812f96281f8SMatthew G. Knepley Input Parameter: 4813f96281f8SMatthew G. Knepley . dm - The DMPlex object 4814f96281f8SMatthew G. Knepley 4815f96281f8SMatthew G. Knepley Output Parameters: 4816f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 4817dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4818dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4819dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4820f96281f8SMatthew G. Knepley 4821f96281f8SMatthew G. Knepley Level: developer 4822f96281f8SMatthew G. Knepley 4823dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 4824f96281f8SMatthew G. Knepley @*/ 4825770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 4826552f7358SJed Brown { 4827552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4828770b213bSMatthew G Knepley PetscInt dim; 4829770b213bSMatthew G Knepley PetscErrorCode ierr; 4830552f7358SJed Brown 4831552f7358SJed Brown PetscFunctionBegin; 4832552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4833c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4834770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 4835770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 4836770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 4837770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 4838552f7358SJed Brown PetscFunctionReturn(0); 4839552f7358SJed Brown } 4840552f7358SJed Brown 4841552f7358SJed Brown #undef __FUNCT__ 4842770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 4843dc5a3409SMatthew G. Knepley /*@ 4844dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 4845dc5a3409SMatthew G. Knepley 4846dc5a3409SMatthew G. Knepley Input Parameters: 4847dc5a3409SMatthew G. Knepley . dm - The DMPlex object 4848dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 4849dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 4850dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 4851dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 4852dc5a3409SMatthew G. Knepley 4853dc5a3409SMatthew G. Knepley Level: developer 4854dc5a3409SMatthew G. Knepley 4855dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 4856dc5a3409SMatthew G. Knepley @*/ 4857770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 4858552f7358SJed Brown { 4859552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4860770b213bSMatthew G Knepley PetscInt dim; 4861770b213bSMatthew G Knepley PetscErrorCode ierr; 4862552f7358SJed Brown 4863552f7358SJed Brown PetscFunctionBegin; 4864552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4865c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 4866770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 4867770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 4868770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 4869770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 4870552f7358SJed Brown PetscFunctionReturn(0); 4871552f7358SJed Brown } 4872552f7358SJed Brown 4873552f7358SJed Brown #undef __FUNCT__ 4874552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 4875552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 4876552f7358SJed Brown { 4877552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4878552f7358SJed Brown 4879552f7358SJed Brown PetscFunctionBegin; 4880552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4881552f7358SJed Brown PetscValidPointer(cellHeight, 2); 4882552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 4883552f7358SJed Brown PetscFunctionReturn(0); 4884552f7358SJed Brown } 4885552f7358SJed Brown 4886552f7358SJed Brown #undef __FUNCT__ 4887552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 4888552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 4889552f7358SJed Brown { 4890552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4891552f7358SJed Brown 4892552f7358SJed Brown PetscFunctionBegin; 4893552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4894552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 4895552f7358SJed Brown PetscFunctionReturn(0); 4896552f7358SJed Brown } 4897552f7358SJed Brown 4898552f7358SJed Brown #undef __FUNCT__ 4899552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 4900552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 4901ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 4902552f7358SJed Brown { 4903552f7358SJed Brown PetscSection section, globalSection; 4904552f7358SJed Brown PetscInt *numbers, p; 4905552f7358SJed Brown PetscErrorCode ierr; 4906552f7358SJed Brown 4907552f7358SJed Brown PetscFunctionBegin; 490882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4909552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 4910552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4911552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 4912552f7358SJed Brown } 4913552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 4914552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 4915854ce69bSBarry Smith ierr = PetscMalloc1(pEnd - pStart, &numbers);CHKERRQ(ierr); 4916552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4917552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 4918ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 4919ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 4920552f7358SJed Brown } 492182f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 4922ef48cebcSMatthew G. Knepley if (globalSize) { 4923ef48cebcSMatthew G. Knepley PetscLayout layout; 4924ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 4925ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 4926ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 4927ef48cebcSMatthew G. Knepley } 4928552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4929552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 4930552f7358SJed Brown PetscFunctionReturn(0); 4931552f7358SJed Brown } 4932552f7358SJed Brown 4933552f7358SJed Brown #undef __FUNCT__ 4934552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 4935552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 4936552f7358SJed Brown { 4937552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4938552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 4939552f7358SJed Brown PetscErrorCode ierr; 4940552f7358SJed Brown 4941552f7358SJed Brown PetscFunctionBegin; 4942552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4943552f7358SJed Brown if (!mesh->globalCellNumbers) { 4944552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 4945552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 49460298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 49470d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 4948ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 4949552f7358SJed Brown } 4950552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 4951552f7358SJed Brown PetscFunctionReturn(0); 4952552f7358SJed Brown } 4953552f7358SJed Brown 4954552f7358SJed Brown #undef __FUNCT__ 4955552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 4956552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 4957552f7358SJed Brown { 4958552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4959552f7358SJed Brown PetscInt vStart, vEnd, vMax; 4960552f7358SJed Brown PetscErrorCode ierr; 4961552f7358SJed Brown 4962552f7358SJed Brown PetscFunctionBegin; 4963552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4964552f7358SJed Brown if (!mesh->globalVertexNumbers) { 4965552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 49660298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 49670d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 4968ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 4969552f7358SJed Brown } 4970552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 4971552f7358SJed Brown PetscFunctionReturn(0); 4972552f7358SJed Brown } 4973552f7358SJed Brown 4974ef48cebcSMatthew G. Knepley #undef __FUNCT__ 4975ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 4976ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 4977ef48cebcSMatthew G. Knepley { 4978ef48cebcSMatthew G. Knepley IS nums[4]; 4979ef48cebcSMatthew G. Knepley PetscInt depths[4]; 4980ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 4981ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 4982ef48cebcSMatthew G. Knepley 4983ef48cebcSMatthew G. Knepley PetscFunctionBegin; 4984ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4985ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49868abc87a0SMichael Lange /* For unstratified meshes use dim instead of depth */ 49878abc87a0SMichael Lange if (depth < 0) {ierr = DMGetDimension(dm, &depth);CHKERRQ(ierr);} 4988ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 4989ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 4990ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 4991ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 4992ef48cebcSMatthew G. Knepley 4993ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 4994ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 4995ef48cebcSMatthew G. Knepley shift += gsize; 4996ef48cebcSMatthew G. Knepley } 4997ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 4998ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 4999ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 5000ef48cebcSMatthew G. Knepley } 5001ef48cebcSMatthew G. Knepley 5002552f7358SJed Brown 5003552f7358SJed Brown #undef __FUNCT__ 5004552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5005552f7358SJed Brown /*@C 5006552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5007552f7358SJed Brown the local section and an SF describing the section point overlap. 5008552f7358SJed Brown 5009552f7358SJed Brown Input Parameters: 5010552f7358SJed Brown + s - The PetscSection for the local field layout 5011552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5012552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5013552f7358SJed Brown . label - The label specifying the points 5014552f7358SJed Brown - labelValue - The label stratum specifying the points 5015552f7358SJed Brown 5016552f7358SJed Brown Output Parameter: 5017552f7358SJed Brown . gsection - The PetscSection for the global field layout 5018552f7358SJed Brown 5019552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5020552f7358SJed Brown 5021552f7358SJed Brown Level: developer 5022552f7358SJed Brown 5023552f7358SJed Brown .seealso: PetscSectionCreate() 5024552f7358SJed Brown @*/ 5025552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5026552f7358SJed Brown { 50277ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5028552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5029552f7358SJed Brown PetscErrorCode ierr; 5030552f7358SJed Brown 5031552f7358SJed Brown PetscFunctionBegin; 50324c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 5033552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5034552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 50357ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 50367ec39499SMatthew G. Knepley if (nroots >= 0) { 50377ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 50381795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 50397ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 50401795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 50417ec39499SMatthew G. Knepley } else { 50427ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 50437ec39499SMatthew G. Knepley } 50447ec39499SMatthew G. Knepley } 5045552f7358SJed Brown /* Mark ghost points with negative dof */ 5046552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5047552f7358SJed Brown PetscInt value; 5048552f7358SJed Brown 5049552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5050552f7358SJed Brown if (value != labelValue) continue; 5051552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5052552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5053552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5054552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 50557ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5056552f7358SJed Brown } 5057552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5058552f7358SJed Brown if (nroots >= 0) { 50597ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 50607ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5061552f7358SJed Brown if (nroots > pEnd-pStart) { 50627ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5063552f7358SJed Brown } 5064552f7358SJed Brown } 5065552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5066552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5067552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5068552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5069552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5070552f7358SJed Brown } 50714c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 5072552f7358SJed Brown globalOff -= off; 5073552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5074552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 50757ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5076552f7358SJed Brown } 5077552f7358SJed Brown /* Put in negative offsets for ghost points */ 5078552f7358SJed Brown if (nroots >= 0) { 50797ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 50807ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5081552f7358SJed Brown if (nroots > pEnd-pStart) { 50827ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5083552f7358SJed Brown } 5084552f7358SJed Brown } 50857ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5086552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5087552f7358SJed Brown PetscFunctionReturn(0); 5088552f7358SJed Brown } 5089ca8062c8SMatthew G. Knepley 5090ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5091ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5092ca8062c8SMatthew G. Knepley /*@ 5093ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5094ca8062c8SMatthew G. Knepley 5095ca8062c8SMatthew G. Knepley Input Parameters: 5096ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5097ca8062c8SMatthew G. Knepley 5098ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5099ca8062c8SMatthew G. Knepley 5100ca8062c8SMatthew G. Knepley Level: developer 5101ca8062c8SMatthew G. Knepley 51029bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5103ca8062c8SMatthew G. Knepley @*/ 5104ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5105ca8062c8SMatthew G. Knepley { 5106ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5107ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5108ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5109ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5110ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5111ca8062c8SMatthew G. Knepley 5112ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5113ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5114ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5115ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5116ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5117ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5118ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5119ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5120ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5121ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 512242e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 512342e66dfaSMatthew G. Knepley PetscInt d; 512442e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 512542e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 512642e66dfaSMatthew G. Knepley } 5127ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5128ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5129ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5130ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5131ca8062c8SMatthew G. Knepley } 513242e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5133ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5134ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5135ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5136ca8062c8SMatthew G. Knepley } 5137ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5138ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5139ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5140ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5141ca8062c8SMatthew G. Knepley } 5142ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 514342e66dfaSMatthew G. Knepley if (dup) { 514442e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 514542e66dfaSMatthew G. Knepley } else { 5146ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5147ca8062c8SMatthew G. Knepley } 5148ca8062c8SMatthew G. Knepley } 514942e66dfaSMatthew G. Knepley } 5150ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5151ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5152ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5153ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5154ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5155ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5156ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5157ca8062c8SMatthew G. Knepley } 5158ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5159ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5160ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5161ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5162ca8062c8SMatthew G. Knepley } 5163ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5164ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5165ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5166ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5167ca8062c8SMatthew G. Knepley } 5168ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5169ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5170ca8062c8SMatthew G. Knepley } 5171ca8062c8SMatthew G. Knepley } 5172ca8062c8SMatthew G. Knepley } 5173ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5174ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5175ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5176ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5177ca8062c8SMatthew G. Knepley } 5178ca8062c8SMatthew G. Knepley 5179ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5180ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5181ca8062c8SMatthew G. Knepley /*@ 5182ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5183ca8062c8SMatthew G. Knepley 5184ca8062c8SMatthew G. Knepley Input Parameters: 5185ca8062c8SMatthew G. Knepley + dm - The DMPlex object 518658723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 518758723a97SMatthew G. Knepley - cellHeight - Normally 0 5188ca8062c8SMatthew G. Knepley 5189ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5190ca8062c8SMatthew G. Knepley 5191ca8062c8SMatthew G. Knepley Level: developer 5192ca8062c8SMatthew G. Knepley 51939bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5194ca8062c8SMatthew G. Knepley @*/ 519558723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5196ca8062c8SMatthew G. Knepley { 519742363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5198ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5199ca8062c8SMatthew G. Knepley 5200ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5201ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5202c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5203ca8062c8SMatthew G. Knepley switch (dim) { 520442363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 520542363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 520642363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5207ca8062c8SMatthew G. Knepley default: 5208ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5209ca8062c8SMatthew G. Knepley } 521058723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 521158723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5212ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5213ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5214ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 521558723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 521658723a97SMatthew G. Knepley 521758723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 521858723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 521958723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 522058723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 522158723a97SMatthew G. Knepley } 522258723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5223ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5224ca8062c8SMatthew G. Knepley } 522542363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 522642363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 522742363296SMatthew G. Knepley 522842363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 522942363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 523042363296SMatthew G. Knepley const PetscInt p = closure[cl]; 523142363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 523242363296SMatthew G. Knepley } 523342363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 523442363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 523542363296SMatthew G. Knepley } 5236ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5237ca8062c8SMatthew G. Knepley } 52389bf0dad6SMatthew G. Knepley 52399bf0dad6SMatthew G. Knepley #undef __FUNCT__ 52409bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 52419bf0dad6SMatthew G. Knepley /*@ 52429bf0dad6SMatthew 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 52439bf0dad6SMatthew G. Knepley 52449bf0dad6SMatthew G. Knepley Input Parameters: 52459bf0dad6SMatthew G. Knepley + dm - The DMPlex object 52469bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 52479bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 52489bf0dad6SMatthew G. Knepley 52499bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 52509bf0dad6SMatthew G. Knepley 52519bf0dad6SMatthew G. Knepley Level: developer 52529bf0dad6SMatthew G. Knepley 52539bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 52549bf0dad6SMatthew G. Knepley @*/ 52559bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 52569bf0dad6SMatthew G. Knepley { 52573554e41dSMatthew G. Knepley PetscInt pMax[4]; 52583554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 52599bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 52609bf0dad6SMatthew G. Knepley 52619bf0dad6SMatthew G. Knepley PetscFunctionBegin; 52629bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5263c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 52649bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 526525abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 52663554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 52673554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 52683554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 52699bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 52709bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 52719bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 52729bf0dad6SMatthew G. Knepley 527325abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 52749bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 52759bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 52769bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 52779bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 52789bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 52799bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 52809bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 52819bf0dad6SMatthew G. Knepley } 52823554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 52839bf0dad6SMatthew 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); 52849bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 52859bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 52869bf0dad6SMatthew G. Knepley 52879bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 52889bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 52899bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 52909bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 52919bf0dad6SMatthew G. Knepley } 5292e003ed69SMatthew 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); 52939bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5294e003ed69SMatthew 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]); 52959bf0dad6SMatthew G. Knepley } 52969bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 52979bf0dad6SMatthew G. Knepley } 52989bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 52999bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 53009bf0dad6SMatthew G. Knepley } 53013554e41dSMatthew G. Knepley } 5302552f7358SJed Brown PetscFunctionReturn(0); 5303552f7358SJed Brown } 53043913d7c8SMatthew G. Knepley 53053913d7c8SMatthew G. Knepley #undef __FUNCT__ 5306bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5307bceba477SMatthew G. Knepley /* Pointwise interpolation 5308bceba477SMatthew G. Knepley Just code FEM for now 5309bceba477SMatthew G. Knepley u^f = I u^c 53104ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 53114ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 53124ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5313bceba477SMatthew G. Knepley */ 5314bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5315bceba477SMatthew G. Knepley { 5316bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5317bceba477SMatthew G. Knepley PetscInt m, n; 5318a063dac3SMatthew G. Knepley void *ctx; 5319bceba477SMatthew G. Knepley PetscErrorCode ierr; 5320bceba477SMatthew G. Knepley 5321bceba477SMatthew G. Knepley PetscFunctionBegin; 5322bceba477SMatthew G. Knepley /* 5323bceba477SMatthew G. Knepley Loop over coarse cells 5324bceba477SMatthew G. Knepley Loop over coarse basis functions 5325bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5326bceba477SMatthew G. Knepley Loop over fine dual basis functions 5327bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5328bceba477SMatthew G. Knepley Sum 5329bceba477SMatthew G. Knepley Update local element matrix 5330bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5331bceba477SMatthew G. Knepley 5332bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5333bceba477SMatthew G. Knepley */ 5334bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5335bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5336bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5337bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5338bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5339bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5340bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5341bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5342a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5343a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 53445d1c2e58SMatthew G. Knepley /* Use naive scaling */ 53455d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5346a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5347a063dac3SMatthew G. Knepley } 5348bceba477SMatthew G. Knepley 5349a063dac3SMatthew G. Knepley #undef __FUNCT__ 5350a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 5351a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 5352a063dac3SMatthew G. Knepley { 535390748bafSMatthew G. Knepley PetscErrorCode ierr; 535490748bafSMatthew G. Knepley 5355a063dac3SMatthew G. Knepley PetscFunctionBegin; 53567c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 5357bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5358bceba477SMatthew G. Knepley } 5359bceba477SMatthew G. Knepley 5360bceba477SMatthew G. Knepley #undef __FUNCT__ 5361fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5362fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5363fd59a867SMatthew G. Knepley { 5364fd59a867SMatthew G. Knepley PetscSection section; 5365fd59a867SMatthew G. Knepley IS *bcPoints; 5366ebb3236fSMatthew G. Knepley PetscBool *isFE; 5367286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5368ebb3236fSMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc = 0, f; 5369ebb3236fSMatthew G. Knepley PetscInt cStart, cEnd, cEndInterior; 5370fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5371fd59a867SMatthew G. Knepley 5372fd59a867SMatthew G. Knepley PetscFunctionBegin; 5373ebb3236fSMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5374ebb3236fSMatthew G. Knepley /* FE and FV boundary conditions are handled slightly differently */ 5375ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(numFields, &isFE);CHKERRQ(ierr); 5376ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5377ebb3236fSMatthew G. Knepley PetscObject obj; 5378ebb3236fSMatthew G. Knepley PetscClassId id; 5379ebb3236fSMatthew G. Knepley 5380ebb3236fSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5381ebb3236fSMatthew G. Knepley ierr = PetscObjectGetClassId(obj, &id);CHKERRQ(ierr); 5382ebb3236fSMatthew G. Knepley if (id == PETSCFE_CLASSID) {isFE[f] = PETSC_TRUE;} 5383ebb3236fSMatthew G. Knepley else if (id == PETSCFV_CLASSID) {isFE[f] = PETSC_FALSE;} 5384ebb3236fSMatthew G. Knepley else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Unknown discretization type for field %d", f); 5385ebb3236fSMatthew G. Knepley } 53862f900235SMatthew G. Knepley /* Allocate boundary point storage for FEM boundaries */ 5387286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5388c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 5389ebb3236fSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 5390ebb3236fSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr); 5391fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5392fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 53932f900235SMatthew G. Knepley PetscInt field; 5394fd59a867SMatthew G. Knepley PetscBool isEssential; 53952f900235SMatthew G. Knepley 53962f900235SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, &field, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 53972f900235SMatthew G. Knepley if (isFE[field] && isEssential) ++numBC; 5398fd59a867SMatthew G. Knepley } 53992f900235SMatthew G. Knepley /* Add ghost cell boundaries for FVM */ 5400ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) if (!isFE[f] && cEndInterior >= 0) ++numBC; 5401fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 5402ebb3236fSMatthew G. Knepley /* Constrain ghost cells for FV */ 5403ebb3236fSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5404ebb3236fSMatthew G. Knepley PetscInt *newidx, c; 5405ebb3236fSMatthew G. Knepley 5406ebb3236fSMatthew G. Knepley if (isFE[f] || cEndInterior < 0) continue; 5407ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(cEnd-cEndInterior,&newidx);CHKERRQ(ierr); 5408ebb3236fSMatthew G. Knepley for (c = cEndInterior; c < cEnd; ++c) newidx[c-cEndInterior] = c; 5409ebb3236fSMatthew G. Knepley bcFields[bc] = f; 5410ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), cEnd-cEndInterior, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5411ebb3236fSMatthew G. Knepley } 5412ebb3236fSMatthew G. Knepley /* Handle FEM Dirichlet boundaries */ 5413ebb3236fSMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5414fd59a867SMatthew G. Knepley const char *bdLabel; 5415fd59a867SMatthew G. Knepley DMLabel label; 5416fd59a867SMatthew G. Knepley const PetscInt *values; 54177391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 5418c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 5419fd59a867SMatthew G. Knepley 542063d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 54212f900235SMatthew G. Knepley if (!isFE[field]) continue; 5422fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5423ebb3236fSMatthew G. Knepley /* Only want to modify label once */ 54247391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 54257391c1cbSMatthew G. Knepley const char *bdname; 54262f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 54277391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 54287391c1cbSMatthew G. Knepley if (duplicate) break; 54297391c1cbSMatthew G. Knepley } 5430ebb3236fSMatthew G. Knepley if (!duplicate && (isFE[field])) { 5431fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 543232720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 54337391c1cbSMatthew G. Knepley } 5434ebb3236fSMatthew G. Knepley /* Filter out cells, if you actually want to constrain cells you need to do things by hand right now */ 5435fd59a867SMatthew G. Knepley if (isEssential) { 543693a5981aSMatthew G. Knepley PetscInt *newidx; 5437ebb3236fSMatthew G. Knepley PetscInt n, newn = 0, p, v; 543893a5981aSMatthew G. Knepley 5439fd59a867SMatthew G. Knepley bcFields[bc] = field; 5440ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5441ebb3236fSMatthew G. Knepley IS tmp; 5442ebb3236fSMatthew G. Knepley const PetscInt *idx; 5443ebb3236fSMatthew G. Knepley 5444ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5445ebb3236fSMatthew G. Knepley if (!tmp) continue; 544693a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 544793a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5448ebb3236fSMatthew G. Knepley if (isFE[field]) { 544993a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 5450ebb3236fSMatthew G. Knepley } else { 5451ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) ++newn; 5452ebb3236fSMatthew G. Knepley } 545393a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 545493a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5455fd59a867SMatthew G. Knepley } 5456ebb3236fSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 5457ebb3236fSMatthew G. Knepley newn = 0; 5458ebb3236fSMatthew G. Knepley for (v = 0; v < numValues; ++v) { 5459ebb3236fSMatthew G. Knepley IS tmp; 5460ebb3236fSMatthew G. Knepley const PetscInt *idx; 5461ebb3236fSMatthew G. Knepley 5462ebb3236fSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[v], &tmp);CHKERRQ(ierr); 5463ebb3236fSMatthew G. Knepley if (!tmp) continue; 5464ebb3236fSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 5465ebb3236fSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 5466ebb3236fSMatthew G. Knepley if (isFE[field]) { 5467ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 5468ebb3236fSMatthew G. Knepley } else { 5469ebb3236fSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] >= cStart) || (idx[p] < cEnd)) newidx[newn++] = idx[p]; 5470ebb3236fSMatthew G. Knepley } 5471ebb3236fSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 5472ebb3236fSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 5473ebb3236fSMatthew G. Knepley } 5474ebb3236fSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 5475ebb3236fSMatthew G. Knepley } 5476fd59a867SMatthew G. Knepley } 5477fd59a867SMatthew G. Knepley /* Handle discretization */ 5478ebb3236fSMatthew G. Knepley ierr = PetscCalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5479fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 54800bacfa0aSMatthew G. Knepley PetscObject obj; 54810bacfa0aSMatthew G. Knepley 54820bacfa0aSMatthew G. Knepley ierr = DMGetField(dm, f, &obj);CHKERRQ(ierr); 5483ebb3236fSMatthew G. Knepley if (isFE[f]) { 54840bacfa0aSMatthew G. Knepley PetscFE fe = (PetscFE) obj; 5485286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5486fd59a867SMatthew G. Knepley PetscInt d; 5487fd59a867SMatthew G. Knepley 5488fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5489286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5490286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5491ebb3236fSMatthew G. Knepley } else { 54920bacfa0aSMatthew G. Knepley PetscFV fv = (PetscFV) obj; 54930bacfa0aSMatthew G. Knepley 54940bacfa0aSMatthew G. Knepley ierr = PetscFVGetNumComponents(fv, &numComp[f]);CHKERRQ(ierr); 54950bacfa0aSMatthew G. Knepley numDof[f*(dim+1)+dim] = numComp[f]; 5496ebb3236fSMatthew G. Knepley } 5497fd59a867SMatthew G. Knepley } 5498286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5499286d8613SMatthew G. Knepley PetscInt d; 5500286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5501286d8613SMatthew 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."); 5502286d8613SMatthew G. Knepley } 5503286d8613SMatthew G. Knepley } 5504f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 5505fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5506fd59a867SMatthew G. Knepley PetscFE fe; 5507fd59a867SMatthew G. Knepley const char *name; 550818abd763SMatthew G. Knepley 550918abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5510fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5511fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5512fd59a867SMatthew G. Knepley } 5513fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5514fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5515fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 5516fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 5517286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5518ebb3236fSMatthew G. Knepley ierr = PetscFree(isFE);CHKERRQ(ierr); 5519bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5520bceba477SMatthew G. Knepley } 5521bceba477SMatthew G. Knepley 5522bceba477SMatthew G. Knepley #undef __FUNCT__ 55233913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 55243913d7c8SMatthew G. Knepley /*@ 55253913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 55263913d7c8SMatthew G. Knepley 55273913d7c8SMatthew G. Knepley Input Parameter: 55283913d7c8SMatthew G. Knepley . dm - The DMPlex object 55293913d7c8SMatthew G. Knepley 55303913d7c8SMatthew G. Knepley Output Parameter: 55313913d7c8SMatthew G. Knepley . cdm - The coarse DM 55323913d7c8SMatthew G. Knepley 55333913d7c8SMatthew G. Knepley Level: intermediate 55343913d7c8SMatthew G. Knepley 55353913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 55363913d7c8SMatthew G. Knepley @*/ 55373913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 55383913d7c8SMatthew G. Knepley { 55393913d7c8SMatthew G. Knepley PetscFunctionBegin; 55403913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 55413913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 55423913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 55433913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 55443913d7c8SMatthew G. Knepley } 55453913d7c8SMatthew G. Knepley 55463913d7c8SMatthew G. Knepley #undef __FUNCT__ 55473913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 55483913d7c8SMatthew G. Knepley /*@ 55493913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 55503913d7c8SMatthew G. Knepley 55513913d7c8SMatthew G. Knepley Input Parameters: 55523913d7c8SMatthew G. Knepley + dm - The DMPlex object 55533913d7c8SMatthew G. Knepley - cdm - The coarse DM 55543913d7c8SMatthew G. Knepley 55553913d7c8SMatthew G. Knepley Level: intermediate 55563913d7c8SMatthew G. Knepley 55573913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 55583913d7c8SMatthew G. Knepley @*/ 55593913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 55603913d7c8SMatthew G. Knepley { 55613913d7c8SMatthew G. Knepley DM_Plex *mesh; 55623913d7c8SMatthew G. Knepley PetscErrorCode ierr; 55633913d7c8SMatthew G. Knepley 55643913d7c8SMatthew G. Knepley PetscFunctionBegin; 55653913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 55663913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 55673913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 55683913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 55693913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 55703913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 55713913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 55723913d7c8SMatthew G. Knepley } 5573a68b90caSToby Isaac 5574f7c74593SToby Isaac /* anchors */ 5575a68b90caSToby Isaac #undef __FUNCT__ 5576a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors" 5577a68b90caSToby Isaac /*@ 5578f7c74593SToby Isaac DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints. Typically, the user will not have to 5579f7c74593SToby Isaac call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints(). 5580a68b90caSToby Isaac 5581e228b242SToby Isaac not collective 5582a68b90caSToby Isaac 5583a68b90caSToby Isaac Input Parameters: 5584a68b90caSToby Isaac . dm - The DMPlex object 5585a68b90caSToby Isaac 5586a68b90caSToby Isaac Output Parameters: 5587a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 5588a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 5589a68b90caSToby Isaac 5590a68b90caSToby Isaac 5591a68b90caSToby Isaac Level: intermediate 5592a68b90caSToby Isaac 5593f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints() 5594a68b90caSToby Isaac @*/ 5595a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS) 5596a68b90caSToby Isaac { 5597a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 559841e6d900SToby Isaac PetscErrorCode ierr; 5599a68b90caSToby Isaac 5600a68b90caSToby Isaac PetscFunctionBegin; 5601a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 560241e6d900SToby Isaac if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);} 5603a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 5604a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 5605a68b90caSToby Isaac PetscFunctionReturn(0); 5606a68b90caSToby Isaac } 5607a68b90caSToby Isaac 5608a68b90caSToby Isaac #undef __FUNCT__ 5609a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors" 5610a68b90caSToby Isaac /*@ 5611f7c74593SToby Isaac DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints. Unlike boundary conditions, 5612f7c74593SToby Isaac when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a 5613a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 5614a68b90caSToby Isaac 5615a17985deSToby Isaac After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling 5616f7c74593SToby Isaac DMGetConstraints() and filling in the entries in the constraint matrix. 5617a68b90caSToby Isaac 5618e228b242SToby Isaac collective on dm 5619a68b90caSToby Isaac 5620a68b90caSToby Isaac Input Parameters: 5621a68b90caSToby Isaac + dm - The DMPlex object 5622e228b242SToby 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). 5623e228b242SToby Isaac - anchorIS - The list of all anchor points. Must have a local communicator (PETSC_COMM_SELF or derivative). 5624a68b90caSToby Isaac 5625a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 5626a68b90caSToby Isaac 5627a68b90caSToby Isaac Level: intermediate 5628a68b90caSToby Isaac 5629f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints() 5630a68b90caSToby Isaac @*/ 5631a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS) 5632a68b90caSToby Isaac { 5633a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 5634e228b242SToby Isaac PetscMPIInt result; 5635a68b90caSToby Isaac PetscErrorCode ierr; 5636a68b90caSToby Isaac 5637a68b90caSToby Isaac PetscFunctionBegin; 5638a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5639e228b242SToby Isaac if (anchorSection) { 5640e228b242SToby Isaac PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2); 5641e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr); 5642e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator"); 5643e228b242SToby Isaac } 5644e228b242SToby Isaac if (anchorIS) { 5645e228b242SToby Isaac PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3); 5646e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr); 5647e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator"); 5648e228b242SToby Isaac } 5649a68b90caSToby Isaac 5650a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 5651a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 5652a68b90caSToby Isaac plex->anchorSection = anchorSection; 5653a68b90caSToby Isaac 5654a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 5655a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 5656a68b90caSToby Isaac plex->anchorIS = anchorIS; 5657a68b90caSToby Isaac 5658a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 5659a68b90caSToby Isaac if (anchorIS && anchorSection) { 5660a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 5661a68b90caSToby Isaac const PetscInt *anchors; 5662a68b90caSToby Isaac 5663a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5664a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 5665a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 5666a68b90caSToby Isaac for (a = 0; a < size; a++) { 5667a68b90caSToby Isaac PetscInt p; 5668a68b90caSToby Isaac 5669a68b90caSToby Isaac p = anchors[a]; 5670a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 5671a68b90caSToby Isaac PetscInt dof; 5672a68b90caSToby Isaac 5673a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5674a68b90caSToby Isaac if (dof) { 5675a68b90caSToby Isaac PetscErrorCode ierr2; 5676a68b90caSToby Isaac 5677a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 5678a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 5679a68b90caSToby Isaac } 5680a68b90caSToby Isaac } 5681a68b90caSToby Isaac } 5682a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 5683a68b90caSToby Isaac } 5684a68b90caSToby Isaac #endif 5685f7c74593SToby Isaac /* reset the generic constraints */ 5686f7c74593SToby Isaac ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr); 5687a68b90caSToby Isaac PetscFunctionReturn(0); 5688a68b90caSToby Isaac } 5689a68b90caSToby Isaac 5690a68b90caSToby Isaac #undef __FUNCT__ 5691f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors" 5692f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec) 5693a68b90caSToby Isaac { 5694f7c74593SToby Isaac PetscSection anchorSection; 5695a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 5696a68b90caSToby Isaac PetscErrorCode ierr; 5697a68b90caSToby Isaac 5698a68b90caSToby Isaac PetscFunctionBegin; 5699a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5700a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 5701e228b242SToby Isaac ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr); 5702a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 5703a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 5704a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 5705a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 5706a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 5707a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 5708a68b90caSToby Isaac if (dof) { 5709a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 5710a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 5711a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 5712a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 5713a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 5714a68b90caSToby Isaac } 5715a68b90caSToby Isaac } 5716a68b90caSToby Isaac } 5717a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 5718a68b90caSToby Isaac PetscFunctionReturn(0); 5719a68b90caSToby Isaac } 5720a68b90caSToby Isaac 5721a68b90caSToby Isaac #undef __FUNCT__ 5722f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors" 5723f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat) 5724a68b90caSToby Isaac { 5725f7c74593SToby Isaac PetscSection aSec; 57260ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 57270ac89760SToby Isaac const PetscInt *anchors; 57280ac89760SToby Isaac PetscInt numFields, f; 572966ad2231SToby Isaac IS aIS; 57300ac89760SToby Isaac PetscErrorCode ierr; 57310ac89760SToby Isaac 57320ac89760SToby Isaac PetscFunctionBegin; 57330ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 57340ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 57350ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 57360ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 57370ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 57380ac89760SToby Isaac ierr = MatSetType(*cMat,MATSEQAIJ); 5739a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 574066ad2231SToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 57410ac89760SToby Isaac ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr); 57420ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 57430ac89760SToby Isaac i[0] = 0; 57440ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 57450ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 57460ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 57470ac89760SToby Isaac if (!dof) continue; 57480ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 57490ac89760SToby Isaac if (numFields) { 57500ac89760SToby Isaac for (f = 0; f < numFields; f++) { 57510ac89760SToby Isaac annz = 0; 57520ac89760SToby Isaac for (q = 0; q < dof; q++) { 57530ac89760SToby Isaac a = anchors[off + q]; 57540ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 57550ac89760SToby Isaac annz += aDof; 57560ac89760SToby Isaac } 57570ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 57580ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 57590ac89760SToby Isaac for (q = 0; q < dof; q++) { 57600ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 57610ac89760SToby Isaac } 57620ac89760SToby Isaac } 57630ac89760SToby Isaac } 57640ac89760SToby Isaac else { 57650ac89760SToby Isaac annz = 0; 57660ac89760SToby Isaac for (q = 0; q < dof; q++) { 57670ac89760SToby Isaac a = anchors[off + q]; 57680ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 57690ac89760SToby Isaac annz += aDof; 57700ac89760SToby Isaac } 57710ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 57720ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 57730ac89760SToby Isaac for (q = 0; q < dof; q++) { 57740ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 57750ac89760SToby Isaac } 57760ac89760SToby Isaac } 57770ac89760SToby Isaac } 57780ac89760SToby Isaac nnz = i[m]; 57790ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 57800ac89760SToby Isaac offset = 0; 57810ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 57820ac89760SToby Isaac if (numFields) { 57830ac89760SToby Isaac for (f = 0; f < numFields; f++) { 57840ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 57850ac89760SToby Isaac for (q = 0; q < dof; q++) { 57860ac89760SToby Isaac PetscInt rDof, rOff, r; 57870ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 57880ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 57890ac89760SToby Isaac for (r = 0; r < rDof; r++) { 57900ac89760SToby Isaac PetscInt s; 57910ac89760SToby Isaac 57920ac89760SToby Isaac a = anchors[rOff + r]; 57930ac89760SToby Isaac 57940ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 57950ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 57960ac89760SToby Isaac for (s = 0; s < aDof; s++) { 57970ac89760SToby Isaac j[offset++] = aOff + s; 57980ac89760SToby Isaac } 57990ac89760SToby Isaac } 58000ac89760SToby Isaac } 58010ac89760SToby Isaac } 58020ac89760SToby Isaac } 58030ac89760SToby Isaac else { 58040ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 58050ac89760SToby Isaac for (q = 0; q < dof; q++) { 58060ac89760SToby Isaac PetscInt rDof, rOff, r; 58070ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 58080ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 58090ac89760SToby Isaac for (r = 0; r < rDof; r++) { 58100ac89760SToby Isaac PetscInt s; 58110ac89760SToby Isaac 58120ac89760SToby Isaac a = anchors[rOff + r]; 58130ac89760SToby Isaac 58140ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 58150ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 58160ac89760SToby Isaac for (s = 0; s < aDof; s++) { 58170ac89760SToby Isaac j[offset++] = aOff + s; 58180ac89760SToby Isaac } 58190ac89760SToby Isaac } 58200ac89760SToby Isaac } 58210ac89760SToby Isaac } 58220ac89760SToby Isaac } 58230ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 58240ac89760SToby Isaac ierr = PetscFree2(i,j);CHKERRQ(ierr); 582566ad2231SToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 58260ac89760SToby Isaac PetscFunctionReturn(0); 58270ac89760SToby Isaac } 58280ac89760SToby Isaac 58290ac89760SToby Isaac #undef __FUNCT__ 583066ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex" 583166ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm) 583266ad2231SToby Isaac { 5833f7c74593SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 5834f7c74593SToby Isaac PetscSection anchorSection, section, cSec; 583566ad2231SToby Isaac Mat cMat; 583666ad2231SToby Isaac PetscErrorCode ierr; 583766ad2231SToby Isaac 583866ad2231SToby Isaac PetscFunctionBegin; 583966ad2231SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5840a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 584166ad2231SToby Isaac if (anchorSection) { 5842e228b242SToby Isaac PetscDS ds; 5843e228b242SToby Isaac PetscInt nf; 5844e228b242SToby Isaac 5845f7c74593SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 5846f7c74593SToby Isaac ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr); 5847f7c74593SToby Isaac ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr); 5848e228b242SToby Isaac ierr = DMGetDS(dm,&ds);CHKERRQ(ierr); 5849e228b242SToby Isaac ierr = PetscDSGetNumFields(ds,&nf); 5850e228b242SToby Isaac if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);} 585166ad2231SToby Isaac ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr); 585266ad2231SToby Isaac ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr); 585366ad2231SToby Isaac ierr = MatDestroy(&cMat);CHKERRQ(ierr); 585466ad2231SToby Isaac } 585566ad2231SToby Isaac PetscFunctionReturn(0); 585666ad2231SToby Isaac } 5857