134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2a68b90caSToby Isaac #include <petsc-private/dmimpl.h> 3552f7358SJed Brown #include <../src/sys/utils/hash.h> 4d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 50c312b8eSJed Brown #include <petscsf.h> 60f7c717fSToby Isaac #include <petscksp.h> 70f7c717fSToby Isaac #include <petscpc.h> 8*e228b242SToby Isaac #include <petscds.h> 9552f7358SJed Brown 10552f7358SJed Brown /* Logging support */ 1175a69067SMatthew G. Knepley PetscLogEvent DMPLEX_Interpolate, DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM, DMPLEX_InterpolatorFEM, DMPLEX_InjectorFEM; 12552f7358SJed Brown 135a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 145a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 152c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 16552f7358SJed Brown 177e42fee7SMatthew G. Knepley #undef __FUNCT__ 187afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 197afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 207e42fee7SMatthew G. Knepley { 217e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 227e42fee7SMatthew G. Knepley PetscErrorCode ierr; 237e42fee7SMatthew G. Knepley 247e42fee7SMatthew G. Knepley PetscFunctionBegin; 257e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 26c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 277e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 287e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 297e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 307e42fee7SMatthew G. Knepley if (field >= 0) { 317e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 337e42fee7SMatthew G. Knepley } else { 347e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 357e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 367e42fee7SMatthew G. Knepley } 377e42fee7SMatthew G. Knepley if (vdof) { 387e42fee7SMatthew G. Knepley *sStart = vStart; 397e42fee7SMatthew G. Knepley *sEnd = vEnd; 407e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 417e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 427e42fee7SMatthew G. Knepley } else if (cdof) { 437e42fee7SMatthew G. Knepley *sStart = cStart; 447e42fee7SMatthew G. Knepley *sEnd = cEnd; 457e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 467e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 477e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 487e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 497e42fee7SMatthew G. Knepley } 507e42fee7SMatthew G. Knepley 51552f7358SJed Brown #undef __FUNCT__ 52552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 53552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 54552f7358SJed Brown { 55552f7358SJed Brown DM dm; 56b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 57552f7358SJed Brown PetscErrorCode ierr; 58552f7358SJed Brown 59552f7358SJed Brown PetscFunctionBegin; 60552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 6182f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 62552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 63b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 64b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 65ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 66ef31f671SMatthew G. Knepley PetscInt numFields; 67ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 68ef31f671SMatthew G. Knepley 69ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 70ef31f671SMatthew G. Knepley if (numFields) { 71ef31f671SMatthew G. Knepley PetscObject fe; 72ef31f671SMatthew G. Knepley 73ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 74ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 75ef31f671SMatthew G. Knepley } 764959657aSMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr);} 77ef31f671SMatthew G. Knepley } 78552f7358SJed Brown if (isvtk) { 79552f7358SJed Brown PetscSection section; 80b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 81b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 82552f7358SJed Brown 83552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 847afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 85552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 86552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 87552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 88b136c2c9SMatthew G. Knepley } else if (ishdf5) { 89b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 90b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 91b136c2c9SMatthew G. Knepley #else 92b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 93b136c2c9SMatthew G. Knepley #endif 94552f7358SJed Brown } else { 9555f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9655f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 97552f7358SJed Brown } 98552f7358SJed Brown PetscFunctionReturn(0); 99552f7358SJed Brown } 100552f7358SJed Brown 101552f7358SJed Brown #undef __FUNCT__ 102552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 103552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 104552f7358SJed Brown { 105552f7358SJed Brown DM dm; 10655f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 107552f7358SJed Brown PetscErrorCode ierr; 108552f7358SJed Brown 109552f7358SJed Brown PetscFunctionBegin; 110552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 11182f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 112552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 11333c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11455f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 115552f7358SJed Brown if (isvtk) { 116552f7358SJed Brown Vec locv; 117552f7358SJed Brown const char *name; 118552f7358SJed Brown 119552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 120552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 121552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 122552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 123552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 124552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 125552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 126b136c2c9SMatthew G. Knepley } else if (ishdf5) { 127b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 128b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 129b136c2c9SMatthew G. Knepley #else 130b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 131b136c2c9SMatthew G. Knepley #endif 132552f7358SJed Brown } else { 13355f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13455f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 135552f7358SJed Brown } 136552f7358SJed Brown PetscFunctionReturn(0); 137552f7358SJed Brown } 138552f7358SJed Brown 139552f7358SJed Brown #undef __FUNCT__ 1402c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1412c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1422c40f234SMatthew G. Knepley { 1432c40f234SMatthew G. Knepley DM dm; 1442c40f234SMatthew G. Knepley PetscBool ishdf5; 1452c40f234SMatthew G. Knepley PetscErrorCode ierr; 1462c40f234SMatthew G. Knepley 1472c40f234SMatthew G. Knepley PetscFunctionBegin; 1482c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1492c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1502c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1512c40f234SMatthew G. Knepley if (ishdf5) { 1522c40f234SMatthew G. Knepley DM dmBC; 1532c40f234SMatthew G. Knepley Vec gv; 1542c40f234SMatthew G. Knepley const char *name; 1552c40f234SMatthew G. Knepley 1562c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1612c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1632c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1642c40f234SMatthew G. Knepley } else { 1652c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1662c40f234SMatthew G. Knepley } 1672c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1682c40f234SMatthew G. Knepley } 1692c40f234SMatthew G. Knepley 1702c40f234SMatthew G. Knepley #undef __FUNCT__ 1712c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1722c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1732c40f234SMatthew G. Knepley { 1742c40f234SMatthew G. Knepley DM dm; 1752c40f234SMatthew G. Knepley PetscBool ishdf5; 1762c40f234SMatthew G. Knepley PetscErrorCode ierr; 1772c40f234SMatthew G. Knepley 1782c40f234SMatthew G. Knepley PetscFunctionBegin; 1792c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1802c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1812c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1822c40f234SMatthew G. Knepley if (ishdf5) { 183878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 184b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 185b136c2c9SMatthew G. Knepley #else 186b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 187878b459fSMatthew G. Knepley #endif 1882c40f234SMatthew G. Knepley } else { 1892c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 190552f7358SJed Brown } 191552f7358SJed Brown PetscFunctionReturn(0); 192552f7358SJed Brown } 193552f7358SJed Brown 194552f7358SJed Brown #undef __FUNCT__ 195552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 196552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 197552f7358SJed Brown { 198552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 199552f7358SJed Brown DM cdm; 200552f7358SJed Brown DMLabel markers; 201552f7358SJed Brown PetscSection coordSection; 202552f7358SJed Brown Vec coordinates; 203552f7358SJed Brown PetscViewerFormat format; 204552f7358SJed Brown PetscErrorCode ierr; 205552f7358SJed Brown 206552f7358SJed Brown PetscFunctionBegin; 207552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 208552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 209552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 210552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 211552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 212552f7358SJed Brown const char *name; 213552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 214552f7358SJed Brown PetscInt pStart, pEnd, p; 215552f7358SJed Brown PetscMPIInt rank, size; 216552f7358SJed Brown 21782f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21882f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 220552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 221552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 223552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 224552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 225552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 226552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 227552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 228552f7358SJed Brown PetscInt dof, off, s; 229552f7358SJed Brown 230552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 231552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 232552f7358SJed Brown for (s = off; s < off+dof; ++s) { 233552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 234552f7358SJed Brown } 235552f7358SJed Brown } 236552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 237552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 238552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 239552f7358SJed Brown PetscInt dof, off, c; 240552f7358SJed Brown 241552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 242552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 243552f7358SJed Brown for (c = off; c < off+dof; ++c) { 244552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 245552f7358SJed Brown } 246552f7358SJed Brown } 247552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2480298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 249552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 250552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 251552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 252552f7358SJed Brown if (size > 1) { 253552f7358SJed Brown PetscSF sf; 254552f7358SJed Brown 255552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 256552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 257552f7358SJed Brown } 258552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 259552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 260552f7358SJed Brown const char *name; 261552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 262552f7358SJed Brown const int numColors = 3; 263552f7358SJed Brown PetscReal scale = 2.0; 264552f7358SJed Brown PetscScalar *coords; 265552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 266552f7358SJed Brown PetscMPIInt rank, size; 267552f7358SJed Brown 268552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 26982f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 27082f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 271552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 272552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 273770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 274770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 275552f7358SJed Brown \\usepackage{tikz}\n\ 276552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 277552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 278552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 279552f7358SJed Brown \\begin{document}\n\ 280552f7358SJed Brown \\section{%s}\n\ 281770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 282770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 283770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 284770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 285770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 286770b213bSMatthew G Knepley } else if (p > 0) { 287770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 288770b213bSMatthew G Knepley } 289770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 290770b213bSMatthew G Knepley } 291770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 292770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 293552f7358SJed Brown /* Plot vertices */ 294552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 295552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 296552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 297552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 298552f7358SJed Brown PetscInt off, dof, d; 299552f7358SJed Brown 300552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 301552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 302552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 303552f7358SJed Brown for (d = 0; d < dof; ++d) { 304552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3056712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 306552f7358SJed Brown } 307552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 308552f7358SJed Brown } 309552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 310552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 311552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 312552f7358SJed Brown /* Plot edges */ 313552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 314552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 315552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 316552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 317552f7358SJed Brown const PetscInt *cone; 318552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 319552f7358SJed Brown 320552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 32182f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 322552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 323552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 324552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 325552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 326552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 327552f7358SJed Brown for (d = 0; d < dof; ++d) { 328552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3296712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 330552f7358SJed Brown } 331552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 332552f7358SJed Brown } 333552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 334552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 335552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 336552f7358SJed Brown /* Plot cells */ 337552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 338552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3390298fd71SBarry Smith PetscInt *closure = NULL; 340552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 341552f7358SJed Brown 342552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 343552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 344552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 345552f7358SJed Brown const PetscInt point = closure[p]; 346552f7358SJed Brown 347552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 348552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 349552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 350552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 351552f7358SJed Brown } 352552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 353552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 354552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 355552f7358SJed Brown } 356552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 357552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 358770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 359552f7358SJed Brown } else { 36082f516ccSBarry Smith MPI_Comm comm; 361834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 362834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 363552f7358SJed Brown PetscInt pStart, pEnd, p; 364a57dd577SMatthew G Knepley PetscInt numLabels, l; 3651143a3c0SMatthew G. Knepley const char *name; 366552f7358SJed Brown PetscMPIInt size; 367552f7358SJed Brown 36882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 369552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 370c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3715f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3721143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3731143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 374552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 375552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 376bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 377dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 378552f7358SJed Brown if (depth == 1) { 379552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 380552f7358SJed Brown pEnd = pEnd - pStart; 381552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 382552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 383552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 384552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 385552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 386552f7358SJed Brown pEnd = pEnd - pStart; 387552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 388552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 389552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 390552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 391552f7358SJed Brown } else { 392552f7358SJed Brown for (d = 0; d <= dim; d++) { 393552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 394834065abSMatthew G. Knepley pEnd -= pStart; 395834065abSMatthew G. Knepley pMax[d] -= pStart; 396552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 397834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 398552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 399834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 400834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 401834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 402834065abSMatthew G. Knepley } 403552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 404552f7358SJed Brown } 405552f7358SJed Brown } 406834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 407a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 408a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 409a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 410a57dd577SMatthew G Knepley DMLabel label; 411a57dd577SMatthew G Knepley const char *name; 412a57dd577SMatthew G Knepley IS valueIS; 413a57dd577SMatthew G Knepley const PetscInt *values; 414a57dd577SMatthew G Knepley PetscInt numValues, v; 415a57dd577SMatthew G Knepley 416a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 418a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 419a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 420a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 421a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 422a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 423a57dd577SMatthew G Knepley PetscInt size; 424a57dd577SMatthew G Knepley 425a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 426a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 427a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 428a57dd577SMatthew G Knepley } 429a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 430a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4314d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 432a57dd577SMatthew G Knepley } 433552f7358SJed Brown } 434552f7358SJed Brown PetscFunctionReturn(0); 435552f7358SJed Brown } 436552f7358SJed Brown 437552f7358SJed Brown #undef __FUNCT__ 438552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 439552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 440552f7358SJed Brown { 441fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 442552f7358SJed Brown PetscErrorCode ierr; 443552f7358SJed Brown 444552f7358SJed Brown PetscFunctionBegin; 445552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 446552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 447552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 448fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 449c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 450552f7358SJed Brown if (iascii) { 451552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 453c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4547afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 455c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4567afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 457c6ccd67eSMatthew G. Knepley #else 458c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 459552f7358SJed Brown #endif 46011aeaf0aSBarry Smith } 461fcf6c8fdSToby Isaac else if (isvtk) { 462fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 463fcf6c8fdSToby Isaac } 464552f7358SJed Brown PetscFunctionReturn(0); 465552f7358SJed Brown } 466552f7358SJed Brown 4672c40f234SMatthew G. Knepley #undef __FUNCT__ 4682c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4692c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4702c40f234SMatthew G. Knepley { 4712c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4722c40f234SMatthew G. Knepley PetscErrorCode ierr; 4732c40f234SMatthew G. Knepley 4742c40f234SMatthew G. Knepley PetscFunctionBegin; 4752c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4762c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4782c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4792c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4802c40f234SMatthew G. Knepley else if (ishdf5) { 4812c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 48210b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4832c40f234SMatthew G. Knepley #else 4842c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 485552f7358SJed Brown #endif 486552f7358SJed Brown } 487552f7358SJed Brown PetscFunctionReturn(0); 488552f7358SJed Brown } 489552f7358SJed Brown 490552f7358SJed Brown #undef __FUNCT__ 4916c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4926c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4936c73c22cSMatthew G. Knepley { 4946c73c22cSMatthew G. Knepley DMBoundary b, next; 4956c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4966c73c22cSMatthew G. Knepley 4978e136ac0SMatthew G. Knepley PetscFunctionBegin; 4986c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4996c73c22cSMatthew G. Knepley b = *boundary; 5006c73c22cSMatthew G. Knepley *boundary = NULL; 5016c73c22cSMatthew G. Knepley for (; b; b = next) { 5026c73c22cSMatthew G. Knepley next = b->next; 5036c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5046c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 50563d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 5066c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5076c73c22cSMatthew G. Knepley } 5086c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5096c73c22cSMatthew G. Knepley } 5106c73c22cSMatthew G. Knepley 5116c73c22cSMatthew G. Knepley #undef __FUNCT__ 512552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 513552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 514552f7358SJed Brown { 515552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 516552f7358SJed Brown DMLabel next = mesh->labels; 517552f7358SJed Brown PetscErrorCode ierr; 518552f7358SJed Brown 519552f7358SJed Brown PetscFunctionBegin; 5200d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 521552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 522552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 523552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 524552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 525552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 526552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 527552f7358SJed Brown while (next) { 528552f7358SJed Brown DMLabel tmp = next->next; 529552f7358SJed Brown 530552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 531552f7358SJed Brown next = tmp; 532552f7358SJed Brown } 5333913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 534a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 535552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 536552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5376c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 538a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 539a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 540a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->constraintSection);CHKERRQ(ierr); 541a68b90caSToby Isaac ierr = MatDestroy(&mesh->constraintMat);CHKERRQ(ierr); 542d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->parentSection);CHKERRQ(ierr); 543d961a43aSToby Isaac ierr = PetscFree(mesh->parents);CHKERRQ(ierr); 544d961a43aSToby Isaac ierr = PetscFree(mesh->childIDs);CHKERRQ(ierr); 545d961a43aSToby Isaac ierr = PetscSectionDestroy(&mesh->childSection);CHKERRQ(ierr); 546d961a43aSToby Isaac ierr = PetscFree(mesh->children);CHKERRQ(ierr); 547d6a7ad0dSToby Isaac ierr = DMDestroy(&mesh->referenceTree);CHKERRQ(ierr); 548552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 549552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 550552f7358SJed Brown PetscFunctionReturn(0); 551552f7358SJed Brown } 552552f7358SJed Brown 553552f7358SJed Brown #undef __FUNCT__ 554552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 555b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 556552f7358SJed Brown { 557552f7358SJed Brown PetscSection section, sectionGlobal; 558552f7358SJed Brown PetscInt bs = -1; 559552f7358SJed Brown PetscInt localSize; 56089545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 561552f7358SJed Brown PetscErrorCode ierr; 562b412c318SBarry Smith MatType mtype; 563552f7358SJed Brown 564552f7358SJed Brown PetscFunctionBegin; 565607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 566b412c318SBarry Smith mtype = dm->mattype; 567552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 568552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 569552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 570552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 57182f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 572552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 573552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 574552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 575552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 576552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 577552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 578552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 579552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 580552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 581552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 582552f7358SJed Brown if (!isShell) { 583552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5842a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 585552f7358SJed Brown 586552f7358SJed Brown if (bs < 0) { 587552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 588fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 589552f7358SJed Brown 590552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 591552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 592552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 593fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 594fad22124SMatthew G Knepley if (dof-cdof) { 5952a28c762SMatthew G Knepley if (bs < 0) { 596fad22124SMatthew G Knepley bs = dof-cdof; 597fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5982a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5992a28c762SMatthew G Knepley bs = 1; 600552f7358SJed Brown break; 601552f7358SJed Brown } 602552f7358SJed Brown } 6032a28c762SMatthew G Knepley } 6042a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 6052a28c762SMatthew G Knepley bsLocal = bs; 60682f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6072a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 60882f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6092a28c762SMatthew G Knepley if (bsMin != bsMax) { 6102a28c762SMatthew G Knepley bs = 1; 6112a28c762SMatthew G Knepley } else { 6122a28c762SMatthew G Knepley bs = bsMax; 6132a28c762SMatthew G Knepley } 614552f7358SJed Brown } else { 615552f7358SJed Brown bs = 1; 616552f7358SJed Brown } 617552f7358SJed Brown } 6181795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 619552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 620552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 621552f7358SJed Brown } 622552f7358SJed Brown PetscFunctionReturn(0); 623552f7358SJed Brown } 624552f7358SJed Brown 625552f7358SJed Brown #undef __FUNCT__ 626552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 627552f7358SJed Brown /*@ 628552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 629552f7358SJed Brown 630552f7358SJed Brown Not collective 631552f7358SJed Brown 632552f7358SJed Brown Input Parameter: 633552f7358SJed Brown . mesh - The DMPlex 634552f7358SJed Brown 635552f7358SJed Brown Output Parameters: 636552f7358SJed Brown + pStart - The first mesh point 637552f7358SJed Brown - pEnd - The upper bound for mesh points 638552f7358SJed Brown 639552f7358SJed Brown Level: beginner 640552f7358SJed Brown 641552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 642552f7358SJed Brown @*/ 643552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 644552f7358SJed Brown { 645552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 646552f7358SJed Brown PetscErrorCode ierr; 647552f7358SJed Brown 648552f7358SJed Brown PetscFunctionBegin; 649552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 650552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 651552f7358SJed Brown PetscFunctionReturn(0); 652552f7358SJed Brown } 653552f7358SJed Brown 654552f7358SJed Brown #undef __FUNCT__ 655552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 656552f7358SJed Brown /*@ 657552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 658552f7358SJed Brown 659552f7358SJed Brown Not collective 660552f7358SJed Brown 661552f7358SJed Brown Input Parameters: 662552f7358SJed Brown + mesh - The DMPlex 663552f7358SJed Brown . pStart - The first mesh point 664552f7358SJed Brown - pEnd - The upper bound for mesh points 665552f7358SJed Brown 666552f7358SJed Brown Output Parameters: 667552f7358SJed Brown 668552f7358SJed Brown Level: beginner 669552f7358SJed Brown 670552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 671552f7358SJed Brown @*/ 672552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 673552f7358SJed Brown { 674552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 675552f7358SJed Brown PetscErrorCode ierr; 676552f7358SJed Brown 677552f7358SJed Brown PetscFunctionBegin; 678552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 679552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 680552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 681552f7358SJed Brown PetscFunctionReturn(0); 682552f7358SJed Brown } 683552f7358SJed Brown 684552f7358SJed Brown #undef __FUNCT__ 685552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 686552f7358SJed Brown /*@ 687552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 688552f7358SJed Brown 689552f7358SJed Brown Not collective 690552f7358SJed Brown 691552f7358SJed Brown Input Parameters: 692552f7358SJed Brown + mesh - The DMPlex 693552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 694552f7358SJed Brown 695552f7358SJed Brown Output Parameter: 696552f7358SJed Brown . size - The cone size for point p 697552f7358SJed Brown 698552f7358SJed Brown Level: beginner 699552f7358SJed Brown 700552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 701552f7358SJed Brown @*/ 702552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 703552f7358SJed Brown { 704552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 705552f7358SJed Brown PetscErrorCode ierr; 706552f7358SJed Brown 707552f7358SJed Brown PetscFunctionBegin; 708552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 709552f7358SJed Brown PetscValidPointer(size, 3); 710552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 711552f7358SJed Brown PetscFunctionReturn(0); 712552f7358SJed Brown } 713552f7358SJed Brown 714552f7358SJed Brown #undef __FUNCT__ 715552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 716552f7358SJed Brown /*@ 717552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 718552f7358SJed Brown 719552f7358SJed Brown Not collective 720552f7358SJed Brown 721552f7358SJed Brown Input Parameters: 722552f7358SJed Brown + mesh - The DMPlex 723552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 724552f7358SJed Brown - size - The cone size for point p 725552f7358SJed Brown 726552f7358SJed Brown Output Parameter: 727552f7358SJed Brown 728552f7358SJed Brown Note: 729552f7358SJed Brown This should be called after DMPlexSetChart(). 730552f7358SJed Brown 731552f7358SJed Brown Level: beginner 732552f7358SJed Brown 733552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 734552f7358SJed Brown @*/ 735552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 736552f7358SJed Brown { 737552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 738552f7358SJed Brown PetscErrorCode ierr; 739552f7358SJed Brown 740552f7358SJed Brown PetscFunctionBegin; 741552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 742552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7430d644c17SKarl Rupp 744552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 745552f7358SJed Brown PetscFunctionReturn(0); 746552f7358SJed Brown } 747552f7358SJed Brown 748552f7358SJed Brown #undef __FUNCT__ 749f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 750f5a469b9SMatthew G. Knepley /*@ 751f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 752f5a469b9SMatthew G. Knepley 753f5a469b9SMatthew G. Knepley Not collective 754f5a469b9SMatthew G. Knepley 755f5a469b9SMatthew G. Knepley Input Parameters: 756f5a469b9SMatthew G. Knepley + mesh - The DMPlex 757f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 758f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 759f5a469b9SMatthew G. Knepley 760f5a469b9SMatthew G. Knepley Output Parameter: 761f5a469b9SMatthew G. Knepley 762f5a469b9SMatthew G. Knepley Note: 763f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 764f5a469b9SMatthew G. Knepley 765f5a469b9SMatthew G. Knepley Level: beginner 766f5a469b9SMatthew G. Knepley 767f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 768f5a469b9SMatthew G. Knepley @*/ 769f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 770f5a469b9SMatthew G. Knepley { 771f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 772f5a469b9SMatthew G. Knepley PetscInt csize; 773f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 774f5a469b9SMatthew G. Knepley 775f5a469b9SMatthew G. Knepley PetscFunctionBegin; 776f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 777f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 778f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 779f5a469b9SMatthew G. Knepley 780f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 781f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 782f5a469b9SMatthew G. Knepley } 783f5a469b9SMatthew G. Knepley 784f5a469b9SMatthew G. Knepley #undef __FUNCT__ 785552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 786552f7358SJed Brown /*@C 787552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 788552f7358SJed Brown 789552f7358SJed Brown Not collective 790552f7358SJed Brown 791552f7358SJed Brown Input Parameters: 792552f7358SJed Brown + mesh - The DMPlex 793552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 794552f7358SJed Brown 795552f7358SJed Brown Output Parameter: 796552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 797552f7358SJed Brown 798552f7358SJed Brown Level: beginner 799552f7358SJed Brown 8003813dfbdSMatthew G Knepley Fortran Notes: 8013813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8023813dfbdSMatthew G Knepley include petsc.h90 in your code. 8033813dfbdSMatthew G Knepley 8043813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 805552f7358SJed Brown 806552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 807552f7358SJed Brown @*/ 808552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 809552f7358SJed Brown { 810552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 811552f7358SJed Brown PetscInt off; 812552f7358SJed Brown PetscErrorCode ierr; 813552f7358SJed Brown 814552f7358SJed Brown PetscFunctionBegin; 815552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 816552f7358SJed Brown PetscValidPointer(cone, 3); 817552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 818552f7358SJed Brown *cone = &mesh->cones[off]; 819552f7358SJed Brown PetscFunctionReturn(0); 820552f7358SJed Brown } 821552f7358SJed Brown 822552f7358SJed Brown #undef __FUNCT__ 823552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 824552f7358SJed Brown /*@ 825552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 826552f7358SJed Brown 827552f7358SJed Brown Not collective 828552f7358SJed Brown 829552f7358SJed Brown Input Parameters: 830552f7358SJed Brown + mesh - The DMPlex 831552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 832552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 833552f7358SJed Brown 834552f7358SJed Brown Output Parameter: 835552f7358SJed Brown 836552f7358SJed Brown Note: 837552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 838552f7358SJed Brown 839552f7358SJed Brown Level: beginner 840552f7358SJed Brown 841552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 842552f7358SJed Brown @*/ 843552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 844552f7358SJed Brown { 845552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 846552f7358SJed Brown PetscInt pStart, pEnd; 847552f7358SJed Brown PetscInt dof, off, c; 848552f7358SJed Brown PetscErrorCode ierr; 849552f7358SJed Brown 850552f7358SJed Brown PetscFunctionBegin; 851552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 852552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 853552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 854552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 855552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 85682f516ccSBarry 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); 857552f7358SJed Brown for (c = 0; c < dof; ++c) { 85882f516ccSBarry 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); 859552f7358SJed Brown mesh->cones[off+c] = cone[c]; 860552f7358SJed Brown } 861552f7358SJed Brown PetscFunctionReturn(0); 862552f7358SJed Brown } 863552f7358SJed Brown 864552f7358SJed Brown #undef __FUNCT__ 865552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 866552f7358SJed Brown /*@C 867552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 868552f7358SJed Brown 869552f7358SJed Brown Not collective 870552f7358SJed Brown 871552f7358SJed Brown Input Parameters: 872552f7358SJed Brown + mesh - The DMPlex 873552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 874552f7358SJed Brown 875552f7358SJed Brown Output Parameter: 876552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 877552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 878552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 879552f7358SJed Brown the index of the cone point on which to start. 880552f7358SJed Brown 881552f7358SJed Brown Level: beginner 882552f7358SJed Brown 8833813dfbdSMatthew G Knepley Fortran Notes: 8843813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8853813dfbdSMatthew G Knepley include petsc.h90 in your code. 8863813dfbdSMatthew G Knepley 8873813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 888552f7358SJed Brown 889552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 890552f7358SJed Brown @*/ 891552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 892552f7358SJed Brown { 893552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 894552f7358SJed Brown PetscInt off; 895552f7358SJed Brown PetscErrorCode ierr; 896552f7358SJed Brown 897552f7358SJed Brown PetscFunctionBegin; 898552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 899552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 900552f7358SJed Brown { 901552f7358SJed Brown PetscInt dof; 902552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 903552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 904552f7358SJed Brown } 905552f7358SJed Brown #endif 906552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9070d644c17SKarl Rupp 908552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 909552f7358SJed Brown PetscFunctionReturn(0); 910552f7358SJed Brown } 911552f7358SJed Brown 912552f7358SJed Brown #undef __FUNCT__ 913552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 914552f7358SJed Brown /*@ 915552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 916552f7358SJed Brown 917552f7358SJed Brown Not collective 918552f7358SJed Brown 919552f7358SJed Brown Input Parameters: 920552f7358SJed Brown + mesh - The DMPlex 921552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 922552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 923552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 924552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 925552f7358SJed Brown the index of the cone point on which to start. 926552f7358SJed Brown 927552f7358SJed Brown Output Parameter: 928552f7358SJed Brown 929552f7358SJed Brown Note: 930552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 931552f7358SJed Brown 932552f7358SJed Brown Level: beginner 933552f7358SJed Brown 934552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 935552f7358SJed Brown @*/ 936552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 937552f7358SJed Brown { 938552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 939552f7358SJed Brown PetscInt pStart, pEnd; 940552f7358SJed Brown PetscInt dof, off, c; 941552f7358SJed Brown PetscErrorCode ierr; 942552f7358SJed Brown 943552f7358SJed Brown PetscFunctionBegin; 944552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 945552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 946552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 947552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 948552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 94982f516ccSBarry 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); 950552f7358SJed Brown for (c = 0; c < dof; ++c) { 951552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 952552f7358SJed Brown 953552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 95482f516ccSBarry 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); 955552f7358SJed Brown mesh->coneOrientations[off+c] = o; 956552f7358SJed Brown } 957552f7358SJed Brown PetscFunctionReturn(0); 958552f7358SJed Brown } 959552f7358SJed Brown 960552f7358SJed Brown #undef __FUNCT__ 961552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 962552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 963552f7358SJed Brown { 964552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 965552f7358SJed Brown PetscInt pStart, pEnd; 966552f7358SJed Brown PetscInt dof, off; 967552f7358SJed Brown PetscErrorCode ierr; 968552f7358SJed Brown 969552f7358SJed Brown PetscFunctionBegin; 970552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 971552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97282f516ccSBarry 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); 97382f516ccSBarry 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); 97477c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 97577c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 97677c88f5bSMatthew 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); 977552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 978552f7358SJed Brown PetscFunctionReturn(0); 979552f7358SJed Brown } 980552f7358SJed Brown 981552f7358SJed Brown #undef __FUNCT__ 98277c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 98377c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 98477c88f5bSMatthew G Knepley { 98577c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 98677c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 98777c88f5bSMatthew G Knepley PetscInt dof, off; 98877c88f5bSMatthew G Knepley PetscErrorCode ierr; 98977c88f5bSMatthew G Knepley 99077c88f5bSMatthew G Knepley PetscFunctionBegin; 99177c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 99277c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 99377c88f5bSMatthew 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); 99477c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 99577c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 99677c88f5bSMatthew 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); 99777c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 99877c88f5bSMatthew G Knepley PetscFunctionReturn(0); 99977c88f5bSMatthew G Knepley } 100077c88f5bSMatthew G Knepley 100177c88f5bSMatthew G Knepley #undef __FUNCT__ 1002552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1003552f7358SJed Brown /*@ 1004552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1005552f7358SJed Brown 1006552f7358SJed Brown Not collective 1007552f7358SJed Brown 1008552f7358SJed Brown Input Parameters: 1009552f7358SJed Brown + mesh - The DMPlex 1010552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1011552f7358SJed Brown 1012552f7358SJed Brown Output Parameter: 1013552f7358SJed Brown . size - The support size for point p 1014552f7358SJed Brown 1015552f7358SJed Brown Level: beginner 1016552f7358SJed Brown 1017552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1018552f7358SJed Brown @*/ 1019552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1020552f7358SJed Brown { 1021552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1022552f7358SJed Brown PetscErrorCode ierr; 1023552f7358SJed Brown 1024552f7358SJed Brown PetscFunctionBegin; 1025552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1026552f7358SJed Brown PetscValidPointer(size, 3); 1027552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1028552f7358SJed Brown PetscFunctionReturn(0); 1029552f7358SJed Brown } 1030552f7358SJed Brown 1031552f7358SJed Brown #undef __FUNCT__ 1032552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1033552f7358SJed Brown /*@ 1034552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1035552f7358SJed Brown 1036552f7358SJed Brown Not collective 1037552f7358SJed Brown 1038552f7358SJed Brown Input Parameters: 1039552f7358SJed Brown + mesh - The DMPlex 1040552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1041552f7358SJed Brown - size - The support size for point p 1042552f7358SJed Brown 1043552f7358SJed Brown Output Parameter: 1044552f7358SJed Brown 1045552f7358SJed Brown Note: 1046552f7358SJed Brown This should be called after DMPlexSetChart(). 1047552f7358SJed Brown 1048552f7358SJed Brown Level: beginner 1049552f7358SJed Brown 1050552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1051552f7358SJed Brown @*/ 1052552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1053552f7358SJed Brown { 1054552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1055552f7358SJed Brown PetscErrorCode ierr; 1056552f7358SJed Brown 1057552f7358SJed Brown PetscFunctionBegin; 1058552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1059552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10600d644c17SKarl Rupp 1061552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1062552f7358SJed Brown PetscFunctionReturn(0); 1063552f7358SJed Brown } 1064552f7358SJed Brown 1065552f7358SJed Brown #undef __FUNCT__ 1066552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1067552f7358SJed Brown /*@C 1068552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1069552f7358SJed Brown 1070552f7358SJed Brown Not collective 1071552f7358SJed Brown 1072552f7358SJed Brown Input Parameters: 1073552f7358SJed Brown + mesh - The DMPlex 1074552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1075552f7358SJed Brown 1076552f7358SJed Brown Output Parameter: 1077552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1078552f7358SJed Brown 1079552f7358SJed Brown Level: beginner 1080552f7358SJed Brown 10813813dfbdSMatthew G Knepley Fortran Notes: 10823813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10833813dfbdSMatthew G Knepley include petsc.h90 in your code. 10843813dfbdSMatthew G Knepley 10853813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10863813dfbdSMatthew G Knepley 1087552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1088552f7358SJed Brown @*/ 1089552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1090552f7358SJed Brown { 1091552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1092552f7358SJed Brown PetscInt off; 1093552f7358SJed Brown PetscErrorCode ierr; 1094552f7358SJed Brown 1095552f7358SJed Brown PetscFunctionBegin; 1096552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1097552f7358SJed Brown PetscValidPointer(support, 3); 1098552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1099552f7358SJed Brown *support = &mesh->supports[off]; 1100552f7358SJed Brown PetscFunctionReturn(0); 1101552f7358SJed Brown } 1102552f7358SJed Brown 1103552f7358SJed Brown #undef __FUNCT__ 1104552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1105552f7358SJed Brown /*@ 1106552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1107552f7358SJed Brown 1108552f7358SJed Brown Not collective 1109552f7358SJed Brown 1110552f7358SJed Brown Input Parameters: 1111552f7358SJed Brown + mesh - The DMPlex 1112552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1113552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1114552f7358SJed Brown 1115552f7358SJed Brown Output Parameter: 1116552f7358SJed Brown 1117552f7358SJed Brown Note: 1118552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1119552f7358SJed Brown 1120552f7358SJed Brown Level: beginner 1121552f7358SJed Brown 1122552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1123552f7358SJed Brown @*/ 1124552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1125552f7358SJed Brown { 1126552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1127552f7358SJed Brown PetscInt pStart, pEnd; 1128552f7358SJed Brown PetscInt dof, off, c; 1129552f7358SJed Brown PetscErrorCode ierr; 1130552f7358SJed Brown 1131552f7358SJed Brown PetscFunctionBegin; 1132552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1133552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1134552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1135552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1136552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 113782f516ccSBarry 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); 1138552f7358SJed Brown for (c = 0; c < dof; ++c) { 113982f516ccSBarry 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); 1140552f7358SJed Brown mesh->supports[off+c] = support[c]; 1141552f7358SJed Brown } 1142552f7358SJed Brown PetscFunctionReturn(0); 1143552f7358SJed Brown } 1144552f7358SJed Brown 1145552f7358SJed Brown #undef __FUNCT__ 1146552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1147552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1148552f7358SJed Brown { 1149552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1150552f7358SJed Brown PetscInt pStart, pEnd; 1151552f7358SJed Brown PetscInt dof, off; 1152552f7358SJed Brown PetscErrorCode ierr; 1153552f7358SJed Brown 1154552f7358SJed Brown PetscFunctionBegin; 1155552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1156552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1157552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1158552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 115982f516ccSBarry 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); 116082f516ccSBarry 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); 116182f516ccSBarry 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); 1162552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1163552f7358SJed Brown PetscFunctionReturn(0); 1164552f7358SJed Brown } 1165552f7358SJed Brown 1166552f7358SJed Brown #undef __FUNCT__ 1167552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1168552f7358SJed Brown /*@C 1169552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1170552f7358SJed Brown 1171552f7358SJed Brown Not collective 1172552f7358SJed Brown 1173552f7358SJed Brown Input Parameters: 1174552f7358SJed Brown + mesh - The DMPlex 1175552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1176552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11770298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1178552f7358SJed Brown 1179552f7358SJed Brown Output Parameters: 1180552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1181552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1182552f7358SJed Brown 1183552f7358SJed Brown Note: 11840298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1185552f7358SJed Brown 11863813dfbdSMatthew G Knepley Fortran Notes: 11873813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11883813dfbdSMatthew G Knepley include petsc.h90 in your code. 11893813dfbdSMatthew G Knepley 11903813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11913813dfbdSMatthew G Knepley 1192552f7358SJed Brown Level: beginner 1193552f7358SJed Brown 1194552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1195552f7358SJed Brown @*/ 1196552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1197552f7358SJed Brown { 1198552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1199552f7358SJed Brown PetscInt *closure, *fifo; 12000298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1201552f7358SJed Brown PetscInt tmpSize, t; 1202552f7358SJed Brown PetscInt depth = 0, maxSize; 1203552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1204552f7358SJed Brown PetscErrorCode ierr; 1205552f7358SJed Brown 1206552f7358SJed Brown PetscFunctionBegin; 1207552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1208552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1209552f7358SJed Brown /* This is only 1-level */ 1210552f7358SJed Brown if (useCone) { 1211552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1212552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1213552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1214552f7358SJed Brown } else { 1215552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1216552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1217552f7358SJed Brown } 1218bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1219bfbcdd7aSMatthew G. Knepley if (*points) { 1220bfbcdd7aSMatthew G. Knepley closure = *points; 1221bfbcdd7aSMatthew G. Knepley } else { 1222bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1223bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1224bfbcdd7aSMatthew G. Knepley } 1225bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1226bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1227bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1228bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1229bfbcdd7aSMatthew G. Knepley } 1230bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1231bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1232bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1233bfbcdd7aSMatthew G. Knepley } 123424c766afSToby Isaac { 123524c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 123624c766afSToby Isaac 123724c766afSToby Isaac c = mesh->maxConeSize; 123824c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 123924c766afSToby Isaac s = mesh->maxSupportSize; 124024c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 124124c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 124224c766afSToby Isaac } 1243bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1244bfbcdd7aSMatthew G. Knepley if (*points) { 1245bfbcdd7aSMatthew G. Knepley closure = *points; 1246bfbcdd7aSMatthew G. Knepley } else { 1247bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1248bfbcdd7aSMatthew G. Knepley } 1249bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1250552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1251552f7358SJed Brown const PetscInt cp = tmp[t]; 1252552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1253552f7358SJed Brown 1254552f7358SJed Brown closure[closureSize] = cp; 1255552f7358SJed Brown closure[closureSize+1] = co; 1256552f7358SJed Brown fifo[fifoSize] = cp; 1257552f7358SJed Brown fifo[fifoSize+1] = co; 1258552f7358SJed Brown } 1259bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1260552f7358SJed Brown while (fifoSize - fifoStart) { 1261552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1262552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1263552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1264552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1265552f7358SJed Brown 1266552f7358SJed Brown if (useCone) { 1267552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1268552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1269552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1270552f7358SJed Brown } else { 1271552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1272552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12730298fd71SBarry Smith tmpO = NULL; 1274552f7358SJed Brown } 1275552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1276552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1277552f7358SJed Brown const PetscInt cp = tmp[i]; 12782e1b13c2SMatthew 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. */ 12792e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12802e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12812e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1282552f7358SJed Brown PetscInt c; 1283552f7358SJed Brown 12842e1b13c2SMatthew G. Knepley if (rev) { 12852e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12862e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12872e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12882e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12892e1b13c2SMatthew G. Knepley } 1290552f7358SJed Brown /* Check for duplicate */ 1291552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1292552f7358SJed Brown if (closure[c] == cp) break; 1293552f7358SJed Brown } 1294552f7358SJed Brown if (c == closureSize) { 1295552f7358SJed Brown closure[closureSize] = cp; 1296552f7358SJed Brown closure[closureSize+1] = co; 1297552f7358SJed Brown fifo[fifoSize] = cp; 1298552f7358SJed Brown fifo[fifoSize+1] = co; 1299552f7358SJed Brown closureSize += 2; 1300552f7358SJed Brown fifoSize += 2; 1301552f7358SJed Brown } 1302552f7358SJed Brown } 1303552f7358SJed Brown fifoStart += 2; 1304552f7358SJed Brown } 1305552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1306552f7358SJed Brown if (points) *points = closure; 1307552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1308552f7358SJed Brown PetscFunctionReturn(0); 1309552f7358SJed Brown } 1310552f7358SJed Brown 1311552f7358SJed Brown #undef __FUNCT__ 13129bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13139bf0dad6SMatthew G. Knepley /*@C 13149bf0dad6SMatthew 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 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley Not collective 13179bf0dad6SMatthew G. Knepley 13189bf0dad6SMatthew G. Knepley Input Parameters: 13199bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13209bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13219bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13229bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13239bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13249bf0dad6SMatthew G. Knepley 13259bf0dad6SMatthew G. Knepley Output Parameters: 13269bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13279bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13289bf0dad6SMatthew G. Knepley 13299bf0dad6SMatthew G. Knepley Note: 13309bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13319bf0dad6SMatthew G. Knepley 13329bf0dad6SMatthew G. Knepley Fortran Notes: 13339bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13349bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13359bf0dad6SMatthew G. Knepley 13369bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13379bf0dad6SMatthew G. Knepley 13389bf0dad6SMatthew G. Knepley Level: beginner 13399bf0dad6SMatthew G. Knepley 13409bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13419bf0dad6SMatthew G. Knepley @*/ 13429bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13439bf0dad6SMatthew G. Knepley { 13449bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13459bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13469bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13479bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13489bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13499bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13509bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13519bf0dad6SMatthew G. Knepley 13529bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13539bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13549bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13559bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13569bf0dad6SMatthew G. Knepley if (useCone) { 13579bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13589bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13599bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13609bf0dad6SMatthew G. Knepley } else { 13619bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13629bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13639bf0dad6SMatthew G. Knepley } 13649bf0dad6SMatthew G. Knepley if (depth == 1) { 13659bf0dad6SMatthew G. Knepley if (*points) { 13669bf0dad6SMatthew G. Knepley closure = *points; 13679bf0dad6SMatthew G. Knepley } else { 13689bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13699bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13709bf0dad6SMatthew G. Knepley } 13719bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13729bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13739bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13749bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13759bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13769bf0dad6SMatthew G. Knepley } 13779bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13789bf0dad6SMatthew G. Knepley if (points) *points = closure; 13799bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13809bf0dad6SMatthew G. Knepley } 138124c766afSToby Isaac { 138224c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 138324c766afSToby Isaac 138424c766afSToby Isaac c = mesh->maxConeSize; 138524c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 138624c766afSToby Isaac s = mesh->maxSupportSize; 138724c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 138824c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 138924c766afSToby Isaac } 13909bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13919bf0dad6SMatthew G. Knepley if (*points) { 13929bf0dad6SMatthew G. Knepley closure = *points; 13939bf0dad6SMatthew G. Knepley } else { 13949bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13959bf0dad6SMatthew G. Knepley } 13969bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13979bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13989bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13999bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14009bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14019bf0dad6SMatthew G. Knepley 14029bf0dad6SMatthew G. Knepley if (ornt < 0) { 14039bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14049bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14059bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14069bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14079bf0dad6SMatthew G. Knepley } 14089bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14099bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14109bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14119bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14129bf0dad6SMatthew G. Knepley } 14139bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14149bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14159bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14169bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14179bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14189bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14199bf0dad6SMatthew G. Knepley 14209bf0dad6SMatthew G. Knepley if (useCone) { 14219bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14229bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14239bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14249bf0dad6SMatthew G. Knepley } else { 14259bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14269bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14279bf0dad6SMatthew G. Knepley tmpO = NULL; 14289bf0dad6SMatthew G. Knepley } 14299bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14309bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14319bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14329bf0dad6SMatthew 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. */ 14339bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14349bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14359bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14369bf0dad6SMatthew G. Knepley PetscInt c; 14379bf0dad6SMatthew G. Knepley 14389bf0dad6SMatthew G. Knepley if (rev) { 14399bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14409bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14419bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14429bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14439bf0dad6SMatthew G. Knepley } 14449bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14459bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14469bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14479bf0dad6SMatthew G. Knepley } 14489bf0dad6SMatthew G. Knepley if (c == closureSize) { 14499bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14509bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14519bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14529bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14539bf0dad6SMatthew G. Knepley closureSize += 2; 14549bf0dad6SMatthew G. Knepley fifoSize += 2; 14559bf0dad6SMatthew G. Knepley } 14569bf0dad6SMatthew G. Knepley } 14579bf0dad6SMatthew G. Knepley fifoStart += 2; 14589bf0dad6SMatthew G. Knepley } 14599bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14609bf0dad6SMatthew G. Knepley if (points) *points = closure; 14619bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14629bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14639bf0dad6SMatthew G. Knepley } 14649bf0dad6SMatthew G. Knepley 14659bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1466552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1467552f7358SJed Brown /*@C 1468552f7358SJed 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 1469552f7358SJed Brown 1470552f7358SJed Brown Not collective 1471552f7358SJed Brown 1472552f7358SJed Brown Input Parameters: 1473552f7358SJed Brown + mesh - The DMPlex 1474552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1475552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1476e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1477e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1478552f7358SJed Brown 1479552f7358SJed Brown Note: 14800298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1481552f7358SJed Brown 14823813dfbdSMatthew G Knepley Fortran Notes: 14833813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14843813dfbdSMatthew G Knepley include petsc.h90 in your code. 14853813dfbdSMatthew G Knepley 14863813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14873813dfbdSMatthew G Knepley 1488552f7358SJed Brown Level: beginner 1489552f7358SJed Brown 1490552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1491552f7358SJed Brown @*/ 1492552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1493552f7358SJed Brown { 1494552f7358SJed Brown PetscErrorCode ierr; 1495552f7358SJed Brown 1496552f7358SJed Brown PetscFunctionBegin; 1497552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1498e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1499e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1500552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 15014ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1502552f7358SJed Brown PetscFunctionReturn(0); 1503552f7358SJed Brown } 1504552f7358SJed Brown 1505552f7358SJed Brown #undef __FUNCT__ 1506552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1507552f7358SJed Brown /*@ 1508552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1509552f7358SJed Brown 1510552f7358SJed Brown Not collective 1511552f7358SJed Brown 1512552f7358SJed Brown Input Parameter: 1513552f7358SJed Brown . mesh - The DMPlex 1514552f7358SJed Brown 1515552f7358SJed Brown Output Parameters: 1516552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1517552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1518552f7358SJed Brown 1519552f7358SJed Brown Level: beginner 1520552f7358SJed Brown 1521552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1522552f7358SJed Brown @*/ 1523552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1524552f7358SJed Brown { 1525552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1526552f7358SJed Brown 1527552f7358SJed Brown PetscFunctionBegin; 1528552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1529552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1530552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1531552f7358SJed Brown PetscFunctionReturn(0); 1532552f7358SJed Brown } 1533552f7358SJed Brown 1534552f7358SJed Brown #undef __FUNCT__ 1535552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1536552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1537552f7358SJed Brown { 1538552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1539552f7358SJed Brown PetscInt size; 1540552f7358SJed Brown PetscErrorCode ierr; 1541552f7358SJed Brown 1542552f7358SJed Brown PetscFunctionBegin; 1543552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1544552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1545552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15461795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15471795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1548552f7358SJed Brown if (mesh->maxSupportSize) { 1549552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1550552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15511795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1552552f7358SJed Brown } 1553552f7358SJed Brown PetscFunctionReturn(0); 1554552f7358SJed Brown } 1555552f7358SJed Brown 1556552f7358SJed Brown #undef __FUNCT__ 1557552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1558552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1559552f7358SJed Brown { 1560552f7358SJed Brown PetscErrorCode ierr; 1561552f7358SJed Brown 1562552f7358SJed Brown PetscFunctionBegin; 15634d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15644d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1565552f7358SJed Brown PetscFunctionReturn(0); 1566552f7358SJed Brown } 1567552f7358SJed Brown 1568552f7358SJed Brown #undef __FUNCT__ 1569552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1570552f7358SJed Brown /*@ 1571552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1572552f7358SJed Brown 1573552f7358SJed Brown Not collective 1574552f7358SJed Brown 1575552f7358SJed Brown Input Parameter: 1576552f7358SJed Brown . mesh - The DMPlex 1577552f7358SJed Brown 1578552f7358SJed Brown Output Parameter: 1579552f7358SJed Brown 1580552f7358SJed Brown Note: 1581552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1582552f7358SJed Brown 1583552f7358SJed Brown Level: beginner 1584552f7358SJed Brown 1585552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1586552f7358SJed Brown @*/ 1587552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1588552f7358SJed Brown { 1589552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1590552f7358SJed Brown PetscInt *offsets; 1591552f7358SJed Brown PetscInt supportSize; 1592552f7358SJed Brown PetscInt pStart, pEnd, p; 1593552f7358SJed Brown PetscErrorCode ierr; 1594552f7358SJed Brown 1595552f7358SJed Brown PetscFunctionBegin; 1596552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 159782f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1598552f7358SJed Brown /* Calculate support sizes */ 1599552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1600552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1601552f7358SJed Brown PetscInt dof, off, c; 1602552f7358SJed Brown 1603552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1604552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1605552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1606552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1607552f7358SJed Brown } 1608552f7358SJed Brown } 1609552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1610552f7358SJed Brown PetscInt dof; 1611552f7358SJed Brown 1612552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16130d644c17SKarl Rupp 1614552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1615552f7358SJed Brown } 1616552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1617552f7358SJed Brown /* Calculate supports */ 1618552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16191795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16201795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1621552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1622552f7358SJed Brown PetscInt dof, off, c; 1623552f7358SJed Brown 1624552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1625552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1626552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1627552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1628552f7358SJed Brown PetscInt offS; 1629552f7358SJed Brown 1630552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16310d644c17SKarl Rupp 1632552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1633552f7358SJed Brown ++offsets[q]; 1634552f7358SJed Brown } 1635552f7358SJed Brown } 1636552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1637552f7358SJed Brown PetscFunctionReturn(0); 1638552f7358SJed Brown } 1639552f7358SJed Brown 1640552f7358SJed Brown #undef __FUNCT__ 1641552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1642552f7358SJed Brown /*@ 1643552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1644552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1645552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1646552f7358SJed Brown the DAG. 1647552f7358SJed Brown 1648552f7358SJed Brown Not collective 1649552f7358SJed Brown 1650552f7358SJed Brown Input Parameter: 1651552f7358SJed Brown . mesh - The DMPlex 1652552f7358SJed Brown 1653552f7358SJed Brown Output Parameter: 1654552f7358SJed Brown 1655552f7358SJed Brown Notes: 1656150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1657150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1658150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1659150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1660552f7358SJed Brown 1661150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1662552f7358SJed Brown 1663552f7358SJed Brown Level: beginner 1664552f7358SJed Brown 1665552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1666552f7358SJed Brown @*/ 1667552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1668552f7358SJed Brown { 1669aa50250dSMatthew G. Knepley DMLabel label; 1670552f7358SJed Brown PetscInt pStart, pEnd, p; 1671552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1672552f7358SJed Brown PetscErrorCode ierr; 1673552f7358SJed Brown 1674552f7358SJed Brown PetscFunctionBegin; 1675552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1676552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1677552f7358SJed Brown /* Calculate depth */ 1678aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1679aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1680aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1681552f7358SJed Brown /* Initialize roots and count leaves */ 1682552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1683552f7358SJed Brown PetscInt coneSize, supportSize; 1684552f7358SJed Brown 1685552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1686552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1687552f7358SJed Brown if (!coneSize && supportSize) { 1688552f7358SJed Brown ++numRoots; 1689aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1690552f7358SJed Brown } else if (!supportSize && coneSize) { 1691552f7358SJed Brown ++numLeaves; 1692552f7358SJed Brown } else if (!supportSize && !coneSize) { 1693552f7358SJed Brown /* Isolated points */ 1694aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1695552f7358SJed Brown } 1696552f7358SJed Brown } 1697552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1698552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1699552f7358SJed Brown PetscInt coneSize, supportSize; 1700552f7358SJed Brown 1701552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1702552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1703552f7358SJed Brown if (!supportSize && coneSize) { 1704aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1705552f7358SJed Brown } 1706552f7358SJed Brown } 1707552f7358SJed Brown } else { 170874ef644bSMatthew G. Knepley IS pointIS; 170974ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1710552f7358SJed Brown 171174ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 171274ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 171374ef644bSMatthew G. Knepley while (numPoints) { 171474ef644bSMatthew G. Knepley const PetscInt *points; 171574ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 171674ef644bSMatthew G. Knepley 171774ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 171874ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 171974ef644bSMatthew G. Knepley const PetscInt point = points[p]; 172074ef644bSMatthew G. Knepley const PetscInt *support; 172174ef644bSMatthew G. Knepley PetscInt supportSize, s; 172274ef644bSMatthew G. Knepley 172374ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 172474ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 172574ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 172674ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1727552f7358SJed Brown } 1728552f7358SJed Brown } 17295edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 173074ef644bSMatthew G. Knepley ++level; 173174ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 173274ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 173374ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 173474ef644bSMatthew G. Knepley else {numPoints = 0;} 173574ef644bSMatthew G. Knepley } 173674ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 173774ef644bSMatthew G. Knepley } 1738552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1739552f7358SJed Brown PetscFunctionReturn(0); 1740552f7358SJed Brown } 1741552f7358SJed Brown 1742552f7358SJed Brown #undef __FUNCT__ 1743552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1744552f7358SJed Brown /*@C 1745552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1746552f7358SJed Brown 1747552f7358SJed Brown Not Collective 1748552f7358SJed Brown 1749552f7358SJed Brown Input Parameters: 1750552f7358SJed Brown + dm - The DMPlex object 1751552f7358SJed Brown . numPoints - The number of input points for the join 1752552f7358SJed Brown - points - The input points 1753552f7358SJed Brown 1754552f7358SJed Brown Output Parameters: 1755552f7358SJed Brown + numCoveredPoints - The number of points in the join 1756552f7358SJed Brown - coveredPoints - The points in the join 1757552f7358SJed Brown 1758552f7358SJed Brown Level: intermediate 1759552f7358SJed Brown 1760552f7358SJed Brown Note: Currently, this is restricted to a single level join 1761552f7358SJed Brown 17623813dfbdSMatthew G Knepley Fortran Notes: 17633813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17643813dfbdSMatthew G Knepley include petsc.h90 in your code. 17653813dfbdSMatthew G Knepley 17663813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17673813dfbdSMatthew G Knepley 1768552f7358SJed Brown .keywords: mesh 1769552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1770552f7358SJed Brown @*/ 1771552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1772552f7358SJed Brown { 1773552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1774552f7358SJed Brown PetscInt *join[2]; 1775552f7358SJed Brown PetscInt joinSize, i = 0; 1776552f7358SJed Brown PetscInt dof, off, p, c, m; 1777552f7358SJed Brown PetscErrorCode ierr; 1778552f7358SJed Brown 1779552f7358SJed Brown PetscFunctionBegin; 1780552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1781552f7358SJed Brown PetscValidPointer(points, 2); 1782552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1783552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1784552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1785552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1786552f7358SJed Brown /* Copy in support of first point */ 1787552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1788552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1789552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1790552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1791552f7358SJed Brown } 1792552f7358SJed Brown /* Check each successive support */ 1793552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1794552f7358SJed Brown PetscInt newJoinSize = 0; 1795552f7358SJed Brown 1796552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1797552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1798552f7358SJed Brown for (c = 0; c < dof; ++c) { 1799552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1800552f7358SJed Brown 1801552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1802552f7358SJed Brown if (point == join[i][m]) { 1803552f7358SJed Brown join[1-i][newJoinSize++] = point; 1804552f7358SJed Brown break; 1805552f7358SJed Brown } 1806552f7358SJed Brown } 1807552f7358SJed Brown } 1808552f7358SJed Brown joinSize = newJoinSize; 1809552f7358SJed Brown i = 1-i; 1810552f7358SJed Brown } 1811552f7358SJed Brown *numCoveredPoints = joinSize; 1812552f7358SJed Brown *coveredPoints = join[i]; 1813552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1814552f7358SJed Brown PetscFunctionReturn(0); 1815552f7358SJed Brown } 1816552f7358SJed Brown 1817552f7358SJed Brown #undef __FUNCT__ 1818552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1819552f7358SJed Brown /*@C 1820552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1821552f7358SJed Brown 1822552f7358SJed Brown Not Collective 1823552f7358SJed Brown 1824552f7358SJed Brown Input Parameters: 1825552f7358SJed Brown + dm - The DMPlex object 1826552f7358SJed Brown . numPoints - The number of input points for the join 1827552f7358SJed Brown - points - The input points 1828552f7358SJed Brown 1829552f7358SJed Brown Output Parameters: 1830552f7358SJed Brown + numCoveredPoints - The number of points in the join 1831552f7358SJed Brown - coveredPoints - The points in the join 1832552f7358SJed Brown 18333813dfbdSMatthew G Knepley Fortran Notes: 18343813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18353813dfbdSMatthew G Knepley include petsc.h90 in your code. 18363813dfbdSMatthew G Knepley 18373813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18383813dfbdSMatthew G Knepley 1839552f7358SJed Brown Level: intermediate 1840552f7358SJed Brown 1841552f7358SJed Brown .keywords: mesh 1842552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1843552f7358SJed Brown @*/ 1844552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1845552f7358SJed Brown { 1846552f7358SJed Brown PetscErrorCode ierr; 1847552f7358SJed Brown 1848552f7358SJed Brown PetscFunctionBegin; 1849552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1850d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1851d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1852d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1853552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1854d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1855552f7358SJed Brown PetscFunctionReturn(0); 1856552f7358SJed Brown } 1857552f7358SJed Brown 1858552f7358SJed Brown #undef __FUNCT__ 1859552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1860552f7358SJed Brown /*@C 1861552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1862552f7358SJed Brown 1863552f7358SJed Brown Not Collective 1864552f7358SJed Brown 1865552f7358SJed Brown Input Parameters: 1866552f7358SJed Brown + dm - The DMPlex object 1867552f7358SJed Brown . numPoints - The number of input points for the join 1868552f7358SJed Brown - points - The input points 1869552f7358SJed Brown 1870552f7358SJed Brown Output Parameters: 1871552f7358SJed Brown + numCoveredPoints - The number of points in the join 1872552f7358SJed Brown - coveredPoints - The points in the join 1873552f7358SJed Brown 18743813dfbdSMatthew G Knepley Fortran Notes: 18753813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18763813dfbdSMatthew G Knepley include petsc.h90 in your code. 18773813dfbdSMatthew G Knepley 18783813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18793813dfbdSMatthew G Knepley 1880552f7358SJed Brown Level: intermediate 1881552f7358SJed Brown 1882552f7358SJed Brown .keywords: mesh 1883552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1884552f7358SJed Brown @*/ 1885552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1886552f7358SJed Brown { 1887552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1888552f7358SJed Brown PetscInt *offsets, **closures; 1889552f7358SJed Brown PetscInt *join[2]; 1890552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 189124c766afSToby Isaac PetscInt p, d, c, m, ms; 1892552f7358SJed Brown PetscErrorCode ierr; 1893552f7358SJed Brown 1894552f7358SJed Brown PetscFunctionBegin; 1895552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1896552f7358SJed Brown PetscValidPointer(points, 2); 1897552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1898552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1899552f7358SJed Brown 1900552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 19011795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1902552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 190324c766afSToby Isaac ms = mesh->maxSupportSize; 190424c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 1905552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1906552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1907552f7358SJed Brown 1908552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1909552f7358SJed Brown PetscInt closureSize; 1910552f7358SJed Brown 1911552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19120d644c17SKarl Rupp 1913552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1914552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1915552f7358SJed Brown PetscInt pStart, pEnd, i; 1916552f7358SJed Brown 1917552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1918552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1919552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1920552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1921552f7358SJed Brown break; 1922552f7358SJed Brown } 1923552f7358SJed Brown } 1924552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1925552f7358SJed Brown } 192682f516ccSBarry 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); 1927552f7358SJed Brown } 1928552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1929552f7358SJed Brown PetscInt dof; 1930552f7358SJed Brown 1931552f7358SJed Brown /* Copy in support of first point */ 1932552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1933552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1934552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1935552f7358SJed Brown } 1936552f7358SJed Brown /* Check each successive cone */ 1937552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1938552f7358SJed Brown PetscInt newJoinSize = 0; 1939552f7358SJed Brown 1940552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1941552f7358SJed Brown for (c = 0; c < dof; ++c) { 1942552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1943552f7358SJed Brown 1944552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1945552f7358SJed Brown if (point == join[i][m]) { 1946552f7358SJed Brown join[1-i][newJoinSize++] = point; 1947552f7358SJed Brown break; 1948552f7358SJed Brown } 1949552f7358SJed Brown } 1950552f7358SJed Brown } 1951552f7358SJed Brown joinSize = newJoinSize; 1952552f7358SJed Brown i = 1-i; 1953552f7358SJed Brown } 1954552f7358SJed Brown if (joinSize) break; 1955552f7358SJed Brown } 1956552f7358SJed Brown *numCoveredPoints = joinSize; 1957552f7358SJed Brown *coveredPoints = join[i]; 1958552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19590298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1960552f7358SJed Brown } 1961552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1962552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1963552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1964552f7358SJed Brown PetscFunctionReturn(0); 1965552f7358SJed Brown } 1966552f7358SJed Brown 1967552f7358SJed Brown #undef __FUNCT__ 1968552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1969552f7358SJed Brown /*@C 1970552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1971552f7358SJed Brown 1972552f7358SJed Brown Not Collective 1973552f7358SJed Brown 1974552f7358SJed Brown Input Parameters: 1975552f7358SJed Brown + dm - The DMPlex object 1976552f7358SJed Brown . numPoints - The number of input points for the meet 1977552f7358SJed Brown - points - The input points 1978552f7358SJed Brown 1979552f7358SJed Brown Output Parameters: 1980552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1981552f7358SJed Brown - coveredPoints - The points in the meet 1982552f7358SJed Brown 1983552f7358SJed Brown Level: intermediate 1984552f7358SJed Brown 1985552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1986552f7358SJed Brown 19873813dfbdSMatthew G Knepley Fortran Notes: 19883813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19893813dfbdSMatthew G Knepley include petsc.h90 in your code. 19903813dfbdSMatthew G Knepley 19913813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19923813dfbdSMatthew G Knepley 1993552f7358SJed Brown .keywords: mesh 1994552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1995552f7358SJed Brown @*/ 1996552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1997552f7358SJed Brown { 1998552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1999552f7358SJed Brown PetscInt *meet[2]; 2000552f7358SJed Brown PetscInt meetSize, i = 0; 2001552f7358SJed Brown PetscInt dof, off, p, c, m; 2002552f7358SJed Brown PetscErrorCode ierr; 2003552f7358SJed Brown 2004552f7358SJed Brown PetscFunctionBegin; 2005552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2006552f7358SJed Brown PetscValidPointer(points, 2); 2007552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2008552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2009552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2010552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2011552f7358SJed Brown /* Copy in cone of first point */ 2012552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2013552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2014552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2015552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2016552f7358SJed Brown } 2017552f7358SJed Brown /* Check each successive cone */ 2018552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2019552f7358SJed Brown PetscInt newMeetSize = 0; 2020552f7358SJed Brown 2021552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2022552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2023552f7358SJed Brown for (c = 0; c < dof; ++c) { 2024552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2025552f7358SJed Brown 2026552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2027552f7358SJed Brown if (point == meet[i][m]) { 2028552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2029552f7358SJed Brown break; 2030552f7358SJed Brown } 2031552f7358SJed Brown } 2032552f7358SJed Brown } 2033552f7358SJed Brown meetSize = newMeetSize; 2034552f7358SJed Brown i = 1-i; 2035552f7358SJed Brown } 2036552f7358SJed Brown *numCoveringPoints = meetSize; 2037552f7358SJed Brown *coveringPoints = meet[i]; 2038552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2039552f7358SJed Brown PetscFunctionReturn(0); 2040552f7358SJed Brown } 2041552f7358SJed Brown 2042552f7358SJed Brown #undef __FUNCT__ 2043552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2044552f7358SJed Brown /*@C 2045552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2046552f7358SJed Brown 2047552f7358SJed Brown Not Collective 2048552f7358SJed Brown 2049552f7358SJed Brown Input Parameters: 2050552f7358SJed Brown + dm - The DMPlex object 2051552f7358SJed Brown . numPoints - The number of input points for the meet 2052552f7358SJed Brown - points - The input points 2053552f7358SJed Brown 2054552f7358SJed Brown Output Parameters: 2055552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2056552f7358SJed Brown - coveredPoints - The points in the meet 2057552f7358SJed Brown 2058552f7358SJed Brown Level: intermediate 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: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2068552f7358SJed Brown @*/ 2069552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2070552f7358SJed Brown { 2071552f7358SJed Brown PetscErrorCode ierr; 2072552f7358SJed Brown 2073552f7358SJed Brown PetscFunctionBegin; 2074552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2075d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2076d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2077d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2078552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2079d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2080552f7358SJed Brown PetscFunctionReturn(0); 2081552f7358SJed Brown } 2082552f7358SJed Brown 2083552f7358SJed Brown #undef __FUNCT__ 2084552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2085552f7358SJed Brown /*@C 2086552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2087552f7358SJed Brown 2088552f7358SJed Brown Not Collective 2089552f7358SJed Brown 2090552f7358SJed Brown Input Parameters: 2091552f7358SJed Brown + dm - The DMPlex object 2092552f7358SJed Brown . numPoints - The number of input points for the meet 2093552f7358SJed Brown - points - The input points 2094552f7358SJed Brown 2095552f7358SJed Brown Output Parameters: 2096552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2097552f7358SJed Brown - coveredPoints - The points in the meet 2098552f7358SJed Brown 2099552f7358SJed Brown Level: intermediate 2100552f7358SJed Brown 21013813dfbdSMatthew G Knepley Fortran Notes: 21023813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 21033813dfbdSMatthew G Knepley include petsc.h90 in your code. 21043813dfbdSMatthew G Knepley 21053813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 21063813dfbdSMatthew G Knepley 2107552f7358SJed Brown .keywords: mesh 2108552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2109552f7358SJed Brown @*/ 2110552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2111552f7358SJed Brown { 2112552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2113552f7358SJed Brown PetscInt *offsets, **closures; 2114552f7358SJed Brown PetscInt *meet[2]; 2115552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 211624c766afSToby Isaac PetscInt p, h, c, m, mc; 2117552f7358SJed Brown PetscErrorCode ierr; 2118552f7358SJed Brown 2119552f7358SJed Brown PetscFunctionBegin; 2120552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2121552f7358SJed Brown PetscValidPointer(points, 2); 2122552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2123552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2124552f7358SJed Brown 2125552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2126785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2127552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 212824c766afSToby Isaac mc = mesh->maxConeSize; 212924c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2130552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2131552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2132552f7358SJed Brown 2133552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2134552f7358SJed Brown PetscInt closureSize; 2135552f7358SJed Brown 2136552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21370d644c17SKarl Rupp 2138552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2139552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2140552f7358SJed Brown PetscInt pStart, pEnd, i; 2141552f7358SJed Brown 2142552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2143552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2144552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2145552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2146552f7358SJed Brown break; 2147552f7358SJed Brown } 2148552f7358SJed Brown } 2149552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2150552f7358SJed Brown } 215182f516ccSBarry 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); 2152552f7358SJed Brown } 2153552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2154552f7358SJed Brown PetscInt dof; 2155552f7358SJed Brown 2156552f7358SJed Brown /* Copy in cone of first point */ 2157552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2158552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2159552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2160552f7358SJed Brown } 2161552f7358SJed Brown /* Check each successive cone */ 2162552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2163552f7358SJed Brown PetscInt newMeetSize = 0; 2164552f7358SJed Brown 2165552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2166552f7358SJed Brown for (c = 0; c < dof; ++c) { 2167552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2168552f7358SJed Brown 2169552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2170552f7358SJed Brown if (point == meet[i][m]) { 2171552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2172552f7358SJed Brown break; 2173552f7358SJed Brown } 2174552f7358SJed Brown } 2175552f7358SJed Brown } 2176552f7358SJed Brown meetSize = newMeetSize; 2177552f7358SJed Brown i = 1-i; 2178552f7358SJed Brown } 2179552f7358SJed Brown if (meetSize) break; 2180552f7358SJed Brown } 2181552f7358SJed Brown *numCoveredPoints = meetSize; 2182552f7358SJed Brown *coveredPoints = meet[i]; 2183552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21840298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2185552f7358SJed Brown } 2186552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2187552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2188552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2189552f7358SJed Brown PetscFunctionReturn(0); 2190552f7358SJed Brown } 2191552f7358SJed Brown 2192552f7358SJed Brown #undef __FUNCT__ 21934e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21944e3744c5SMatthew G. Knepley /*@C 21954e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21964e3744c5SMatthew G. Knepley 21974e3744c5SMatthew G. Knepley Not Collective 21984e3744c5SMatthew G. Knepley 21994e3744c5SMatthew G. Knepley Input Parameters: 22004e3744c5SMatthew G. Knepley + dmA - A DMPlex object 22014e3744c5SMatthew G. Knepley - dmB - A DMPlex object 22024e3744c5SMatthew G. Knepley 22034e3744c5SMatthew G. Knepley Output Parameters: 22044e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 22054e3744c5SMatthew G. Knepley 22064e3744c5SMatthew G. Knepley Level: intermediate 22074e3744c5SMatthew G. Knepley 22084e3744c5SMatthew G. Knepley Notes: 22094e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 22104e3744c5SMatthew G. Knepley 22114e3744c5SMatthew G. Knepley .keywords: mesh 22124e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22134e3744c5SMatthew G. Knepley @*/ 22144e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22154e3744c5SMatthew G. Knepley { 22164e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22174e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22184e3744c5SMatthew G. Knepley 22194e3744c5SMatthew G. Knepley PetscFunctionBegin; 22204e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22214e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22224e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22234e3744c5SMatthew G. Knepley 22244e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22254e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22264e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22274e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22284e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22294e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22304e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22314e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22324e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22334e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22344e3744c5SMatthew G. Knepley 22354e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22364e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22374e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22384e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22394e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22404e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22414e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22424e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22434e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22444e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22454e3744c5SMatthew G. Knepley } 22464e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22474e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22484e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22494e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22504e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22514e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22524e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22534e3744c5SMatthew G. Knepley } 22544e3744c5SMatthew G. Knepley } 22554e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22564e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22574e3744c5SMatthew G. Knepley } 22584e3744c5SMatthew G. Knepley 22594e3744c5SMatthew G. Knepley #undef __FUNCT__ 226018ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 226118ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2262a6dfd86eSKarl Rupp { 226382f516ccSBarry Smith MPI_Comm comm; 2264552f7358SJed Brown PetscErrorCode ierr; 2265552f7358SJed Brown 2266552f7358SJed Brown PetscFunctionBegin; 226782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2268552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2269552f7358SJed Brown switch (cellDim) { 2270552f7358SJed Brown case 0: 2271552f7358SJed Brown *numFaceVertices = 0; 2272552f7358SJed Brown break; 2273552f7358SJed Brown case 1: 2274552f7358SJed Brown *numFaceVertices = 1; 2275552f7358SJed Brown break; 2276552f7358SJed Brown case 2: 2277552f7358SJed Brown switch (numCorners) { 227819436ca2SJed Brown case 3: /* triangle */ 227919436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2280552f7358SJed Brown break; 228119436ca2SJed Brown case 4: /* quadrilateral */ 228219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2283552f7358SJed Brown break; 228419436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 228519436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2286552f7358SJed Brown break; 228719436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 228819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2289552f7358SJed Brown break; 2290552f7358SJed Brown default: 2291552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2292552f7358SJed Brown } 2293552f7358SJed Brown break; 2294552f7358SJed Brown case 3: 2295552f7358SJed Brown switch (numCorners) { 229619436ca2SJed Brown case 4: /* tetradehdron */ 229719436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2298552f7358SJed Brown break; 229919436ca2SJed Brown case 6: /* tet cohesive cells */ 230019436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2301552f7358SJed Brown break; 230219436ca2SJed Brown case 8: /* hexahedron */ 230319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2304552f7358SJed Brown break; 230519436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 230619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2307552f7358SJed Brown break; 230819436ca2SJed Brown case 10: /* quadratic tetrahedron */ 230919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2310552f7358SJed Brown break; 231119436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 231219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2313552f7358SJed Brown break; 231419436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 231519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2316552f7358SJed Brown break; 231719436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 231819436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2319552f7358SJed Brown break; 2320552f7358SJed Brown default: 2321552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2322552f7358SJed Brown } 2323552f7358SJed Brown break; 2324552f7358SJed Brown default: 2325552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2326552f7358SJed Brown } 2327552f7358SJed Brown PetscFunctionReturn(0); 2328552f7358SJed Brown } 2329552f7358SJed Brown 2330552f7358SJed Brown #undef __FUNCT__ 2331d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2332d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2333d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2334d27a0f52SMatthew G. Knepley { 2335a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2336a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2337a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2338d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2339d27a0f52SMatthew G. Knepley 2340d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2341d27a0f52SMatthew G. Knepley /* Truth Table 2342d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2343d27a0f52SMatthew G. Knepley F 0 flips no F F F 2344d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2345d27a0f52SMatthew G. Knepley F 2 flips no T F T 2346d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2347d27a0f52SMatthew G. Knepley T 1 flip no 2348d27a0f52SMatthew G. Knepley T 2 flips yes 2349d27a0f52SMatthew G. Knepley */ 2350c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2351d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2352a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2353d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2354a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2355a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2356a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2357a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2358a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2359a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2360785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2361a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2362a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2363defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2364a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2365a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2366a1b4d4a2SMatthew G. Knepley 2367a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2368a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2369a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2370a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2371a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2372a1b4d4a2SMatthew G. Knepley } 2373a1b4d4a2SMatthew G. Knepley } 2374a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2375a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2376d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2377a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2378d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2379d27a0f52SMatthew G. Knepley 2380a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2381a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2382a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2383d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2384d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2385a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 238686cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2387a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 238886cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2389d27a0f52SMatthew G. Knepley 2390d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2391d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2392d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2393d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2394d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2395d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2396a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2397a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2398a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2399a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2400a1b4d4a2SMatthew G. Knepley } 2401a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2402a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2403a1b4d4a2SMatthew G. Knepley } 2404a1b4d4a2SMatthew G. Knepley if (posA < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[0]); 2405a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2406a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2407a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2408a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2409a1b4d4a2SMatthew G. Knepley } 2410a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2411a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2412a1b4d4a2SMatthew G. Knepley } 2413a1b4d4a2SMatthew G. Knepley if (posB < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[1]); 2414d27a0f52SMatthew G. Knepley 2415d27a0f52SMatthew G. Knepley if (dim == 1) { 2416d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2417d27a0f52SMatthew G. Knepley } else { 2418d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2419d27a0f52SMatthew G. Knepley } 2420d27a0f52SMatthew G. Knepley 2421d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2422d27a0f52SMatthew G. Knepley if (seenA && seenB) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen cells %d and %d do not match: Fault mesh is non-orientable", support[0], support[1]); 2423d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2424a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2425d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2426a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2427d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 242886cff514SMatthew G. Knepley } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 2429a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2430a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2431d27a0f52SMatthew G. Knepley } 2432fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2433fedde076SMatthew G. Knepley { 2434fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2435fedde076SMatthew G. Knepley PetscSF sf; 2436fedde076SMatthew G. Knepley const PetscInt *lpoints; 2437fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 243813048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2439fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2440a1b4d4a2SMatthew G. Knepley 2441fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2442fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2443fedde076SMatthew G. Knepley if (numLeaves >= 0) { 244462ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 244562ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 244662ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 244713048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 244862ad4a6aSMatthew G. Knepley 2449fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2450fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2451fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2452fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2453fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2454fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2455fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2456fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2457fedde076SMatthew G. Knepley PetscInt supportSize; 2458fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2459fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2460fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2461fedde076SMatthew G. Knepley } 2462fedde076SMatthew G. Knepley } 2463fedde076SMatthew G. Knepley } 246413048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2465fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2466fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2467fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2468fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2469fedde076SMatthew G. Knepley 2470fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 247162ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2472fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2473fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24745b7033fcSMatthew G. Knepley if (dim == 1) { 24755b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24765b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24775b7033fcSMatthew G. Knepley } else { 2478fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2479fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2480fedde076SMatthew G. Knepley } 24815b7033fcSMatthew G. Knepley } 2482fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2483fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2484fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2485fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2486fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2487fedde076SMatthew G. Knepley 248813048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 248913048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 249013048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2491fedde076SMatthew G. Knepley } 249213048561SMatthew G. Knepley /* Collect the graph on 0 */ 249313048561SMatthew G. Knepley { 249413048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2495e8f90184SMatthew G. Knepley Mat G; 249613048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 249713048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 249813048561SMatthew G. Knepley PetscInt *adj = NULL; 249913048561SMatthew G. Knepley PetscBool *val = NULL; 250013048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 250113048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 250213048561SMatthew G. Knepley PetscInt debug = 0; 250313048561SMatthew G. Knepley 250413048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 250513048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 250613048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 250713048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 250813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250913048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 251013048561SMatthew G. Knepley } 251113048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 251213048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 251313048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 251413048561SMatthew G. Knepley if (debug) { 251513048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251613048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 251713048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 251813048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 251913048561SMatthew G. Knepley } 252013048561SMatthew G. Knepley } 252113048561SMatthew G. Knepley } 2522e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2523e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2524e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2525e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2526e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2527e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 25289a4fe19dSMatthew G. Knepley const PetscInt r = p; 2529e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 25307406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2531e8f90184SMatthew G. Knepley 25327406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 25337406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2534e8f90184SMatthew G. Knepley } 2535e8f90184SMatthew G. Knepley } 2536e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2537e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2538e8f90184SMatthew G. Knepley 253913048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 254013048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 254113048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 254213048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 254313048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 254413048561SMatthew G. Knepley pTop = pBottom = 0; 254513048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 254613048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 254713048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 254813048561SMatthew G. Knepley procFIFO[pBottom++] = p; 254913048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 255013048561SMatthew G. Knepley /* Consider each proc in FIFO */ 255113048561SMatthew G. Knepley while (pTop < pBottom) { 2552e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2553e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2554e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 255513048561SMatthew G. Knepley 255613048561SMatthew G. Knepley proc = procFIFO[pTop++]; 255713048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2558e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 255913048561SMatthew G. Knepley /* Loop over neighboring procs */ 2560e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2561e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25627406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 256313048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 256413048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 256513048561SMatthew G. Knepley 256613048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 256713048561SMatthew G. Knepley if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc); 256813048561SMatthew G. Knepley if (!flippedB) { 256913048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 257013048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 257113048561SMatthew G. Knepley } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 257213048561SMatthew G. Knepley if (!seen) { 257313048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 257413048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 257513048561SMatthew G. Knepley } 257613048561SMatthew G. Knepley } 257713048561SMatthew G. Knepley } 257813048561SMatthew G. Knepley } 257913048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2580e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 258113048561SMatthew G. Knepley 258213048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 258313048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 258413048561SMatthew G. Knepley { 258513048561SMatthew G. Knepley PetscBool *flips; 258613048561SMatthew G. Knepley 258713048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 258813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 258913048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 259013048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 259113048561SMatthew G. Knepley } 259213048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 259313048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 259413048561SMatthew G. Knepley } 259513048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 259613048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 259713048561SMatthew G. Knepley } 259813048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2599fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 260013048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2601fedde076SMatthew G. Knepley } 2602fedde076SMatthew G. Knepley } 2603fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2604d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2605d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2606d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2607a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2608f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2609f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2610d27a0f52SMatthew G. Knepley 2611a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2612a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2613a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2614a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2615a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2616a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2617a1b4d4a2SMatthew G. Knepley 2618a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2619a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2620a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2621d27a0f52SMatthew G. Knepley } 2622a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2623a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2624f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2625f4e909fcSMatthew G. Knepley faceSize = coneSize; 2626f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2627f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2628f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2629f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2630f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2631f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2632f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2633f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2634f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2635f4e909fcSMatthew G. Knepley } 2636f4e909fcSMatthew G. Knepley } 2637d27a0f52SMatthew G. Knepley } 2638d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2639d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2640d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2641a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2642a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2643a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2644d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2645d27a0f52SMatthew G. Knepley } 2646d27a0f52SMatthew G. Knepley 2647d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2648895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2649895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2650895b8c46SMatthew G. Knepley { 2651895b8c46SMatthew G. Knepley int tmpc; 2652895b8c46SMatthew G. Knepley 2653895b8c46SMatthew G. Knepley PetscFunctionBegin; 2654895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2655895b8c46SMatthew G. Knepley switch (numCorners) { 2656895b8c46SMatthew G. Knepley case 4: 2657895b8c46SMatthew G. Knepley tmpc = cone[0]; 2658895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2659895b8c46SMatthew G. Knepley cone[1] = tmpc; 2660895b8c46SMatthew G. Knepley break; 2661895b8c46SMatthew G. Knepley case 8: 2662895b8c46SMatthew G. Knepley tmpc = cone[1]; 2663895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2664895b8c46SMatthew G. Knepley cone[3] = tmpc; 2665895b8c46SMatthew G. Knepley break; 2666895b8c46SMatthew G. Knepley default: break; 2667895b8c46SMatthew G. Knepley } 2668895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2669895b8c46SMatthew G. Knepley } 2670895b8c46SMatthew G. Knepley 2671895b8c46SMatthew G. Knepley #undef __FUNCT__ 26729db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26739db3b87dSMatthew G. Knepley /*@C 26749db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26759db3b87dSMatthew G. Knepley 26769db3b87dSMatthew G. Knepley Input Parameters: 26779db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26789db3b87dSMatthew G. Knepley - cone - The incoming cone 26799db3b87dSMatthew G. Knepley 26809db3b87dSMatthew G. Knepley Output Parameter: 26819db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26829db3b87dSMatthew G. Knepley 26839db3b87dSMatthew G. Knepley Level: developer 26849db3b87dSMatthew G. Knepley 26859db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26869db3b87dSMatthew G. Knepley @*/ 26879db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26882e1b13c2SMatthew G. Knepley { 26899db3b87dSMatthew G. Knepley int tmpc; 26902e1b13c2SMatthew G. Knepley 26912e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26929db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26939db3b87dSMatthew G. Knepley switch (numCorners) { 26949db3b87dSMatthew G. Knepley case 4: 26951885f254SMatthew G. Knepley tmpc = cone[0]; 26961885f254SMatthew G. Knepley cone[0] = cone[1]; 26971885f254SMatthew G. Knepley cone[1] = tmpc; 26989db3b87dSMatthew G. Knepley break; 26999db3b87dSMatthew G. Knepley case 8: 27009db3b87dSMatthew G. Knepley tmpc = cone[1]; 27019db3b87dSMatthew G. Knepley cone[1] = cone[3]; 27029db3b87dSMatthew G. Knepley cone[3] = tmpc; 27039db3b87dSMatthew G. Knepley break; 27049db3b87dSMatthew G. Knepley default: break; 27059db3b87dSMatthew G. Knepley } 27069db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 27079db3b87dSMatthew G. Knepley } 27089db3b87dSMatthew G. Knepley 27099db3b87dSMatthew G. Knepley #undef __FUNCT__ 27109db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 27119db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 27129db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 27139db3b87dSMatthew G. Knepley { 27149db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 27159db3b87dSMatthew G. Knepley PetscErrorCode ierr; 27169db3b87dSMatthew G. Knepley 27179db3b87dSMatthew G. Knepley PetscFunctionBegin; 27189db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 27199db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 27202e1b13c2SMatthew G. Knepley } 27212e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 27222e1b13c2SMatthew G. Knepley } 27232e1b13c2SMatthew G. Knepley 2724519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2725552f7358SJed Brown #include <triangle.h> 2726552f7358SJed Brown 2727552f7358SJed Brown #undef __FUNCT__ 2728552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 27290adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 27300adebc6cSBarry Smith { 2731552f7358SJed Brown PetscFunctionBegin; 2732552f7358SJed Brown inputCtx->numberofpoints = 0; 2733552f7358SJed Brown inputCtx->numberofpointattributes = 0; 27340298fd71SBarry Smith inputCtx->pointlist = NULL; 27350298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27360298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2737552f7358SJed Brown inputCtx->numberofsegments = 0; 27380298fd71SBarry Smith inputCtx->segmentlist = NULL; 27390298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2740552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27410298fd71SBarry Smith inputCtx->trianglelist = NULL; 2742552f7358SJed Brown inputCtx->numberofholes = 0; 27430298fd71SBarry Smith inputCtx->holelist = NULL; 2744552f7358SJed Brown inputCtx->numberofregions = 0; 27450298fd71SBarry Smith inputCtx->regionlist = NULL; 2746552f7358SJed Brown PetscFunctionReturn(0); 2747552f7358SJed Brown } 2748552f7358SJed Brown 2749552f7358SJed Brown #undef __FUNCT__ 2750552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27510adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27520adebc6cSBarry Smith { 2753552f7358SJed Brown PetscFunctionBegin; 2754552f7358SJed Brown outputCtx->numberofpoints = 0; 27550298fd71SBarry Smith outputCtx->pointlist = NULL; 27560298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27570298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2758552f7358SJed Brown outputCtx->numberoftriangles = 0; 27590298fd71SBarry Smith outputCtx->trianglelist = NULL; 27600298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27610298fd71SBarry Smith outputCtx->neighborlist = NULL; 27620298fd71SBarry Smith outputCtx->segmentlist = NULL; 27630298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2764552f7358SJed Brown outputCtx->numberofedges = 0; 27650298fd71SBarry Smith outputCtx->edgelist = NULL; 27660298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2767552f7358SJed Brown PetscFunctionReturn(0); 2768552f7358SJed Brown } 2769552f7358SJed Brown 2770552f7358SJed Brown #undef __FUNCT__ 2771552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27720adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27730adebc6cSBarry Smith { 2774552f7358SJed Brown PetscFunctionBegin; 277523b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2776552f7358SJed Brown free(outputCtx->pointmarkerlist); 277723b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 277823b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2779552f7358SJed Brown free(outputCtx->edgelist); 2780552f7358SJed Brown free(outputCtx->edgemarkerlist); 2781552f7358SJed Brown free(outputCtx->trianglelist); 2782552f7358SJed Brown free(outputCtx->neighborlist); 2783552f7358SJed Brown PetscFunctionReturn(0); 2784552f7358SJed Brown } 2785552f7358SJed Brown 2786552f7358SJed Brown #undef __FUNCT__ 2787552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2788552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2789552f7358SJed Brown { 279082f516ccSBarry Smith MPI_Comm comm; 2791552f7358SJed Brown PetscInt dim = 2; 2792552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2793552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2794552f7358SJed Brown struct triangulateio in; 2795552f7358SJed Brown struct triangulateio out; 2796552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2797552f7358SJed Brown PetscMPIInt rank; 2798552f7358SJed Brown PetscErrorCode ierr; 2799552f7358SJed Brown 2800552f7358SJed Brown PetscFunctionBegin; 280182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2802552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2803552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2804552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2805552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 28060d644c17SKarl Rupp 2807552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2808552f7358SJed Brown if (in.numberofpoints > 0) { 2809552f7358SJed Brown PetscSection coordSection; 2810552f7358SJed Brown Vec coordinates; 2811552f7358SJed Brown PetscScalar *array; 2812552f7358SJed Brown 2813785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2814785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2815552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 281669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2817552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2818552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2819552f7358SJed Brown const PetscInt idx = v - vStart; 2820552f7358SJed Brown PetscInt off, d; 2821552f7358SJed Brown 2822552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2823552f7358SJed Brown for (d = 0; d < dim; ++d) { 2824552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2825552f7358SJed Brown } 2826552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2827552f7358SJed Brown } 2828552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2829552f7358SJed Brown } 2830552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2831552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2832552f7358SJed Brown if (in.numberofsegments > 0) { 2833785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2834785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2835552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2836552f7358SJed Brown const PetscInt idx = e - eStart; 2837552f7358SJed Brown const PetscInt *cone; 2838552f7358SJed Brown 2839552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28400d644c17SKarl Rupp 2841552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2842552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28430d644c17SKarl Rupp 2844552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2845552f7358SJed Brown } 2846552f7358SJed Brown } 2847552f7358SJed Brown #if 0 /* Do not currently support holes */ 2848552f7358SJed Brown PetscReal *holeCoords; 2849552f7358SJed Brown PetscInt h, d; 2850552f7358SJed Brown 2851552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2852552f7358SJed Brown if (in.numberofholes > 0) { 2853785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2854552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2855552f7358SJed Brown for (d = 0; d < dim; ++d) { 2856552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2857552f7358SJed Brown } 2858552f7358SJed Brown } 2859552f7358SJed Brown } 2860552f7358SJed Brown #endif 2861552f7358SJed Brown if (!rank) { 2862552f7358SJed Brown char args[32]; 2863552f7358SJed Brown 2864552f7358SJed Brown /* Take away 'Q' for verbose output */ 2865552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2866552f7358SJed Brown if (createConvexHull) { 2867552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2868552f7358SJed Brown } 2869552f7358SJed Brown if (constrained) { 2870552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2871552f7358SJed Brown } 28720298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2873552f7358SJed Brown } 2874552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2875552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2876552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2877552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2878552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2879552f7358SJed Brown 2880552f7358SJed Brown { 2881552f7358SJed Brown const PetscInt numCorners = 3; 2882552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2883552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2884552f7358SJed Brown const int *cells = out.trianglelist; 2885552f7358SJed Brown const double *meshCoords = out.pointlist; 2886552f7358SJed Brown 28870fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2888552f7358SJed Brown /* Set labels */ 2889552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2890552f7358SJed Brown if (out.pointmarkerlist[v]) { 2891552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2892552f7358SJed Brown } 2893552f7358SJed Brown } 2894552f7358SJed Brown if (interpolate) { 2895552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2896552f7358SJed Brown if (out.edgemarkerlist[e]) { 2897552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2898552f7358SJed Brown const PetscInt *edges; 2899552f7358SJed Brown PetscInt numEdges; 2900552f7358SJed Brown 2901552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2902552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2903552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2904552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2905552f7358SJed Brown } 2906552f7358SJed Brown } 2907552f7358SJed Brown } 2908552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2909552f7358SJed Brown } 2910552f7358SJed Brown #if 0 /* Do not currently support holes */ 2911552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2912552f7358SJed Brown #endif 2913552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2914552f7358SJed Brown PetscFunctionReturn(0); 2915552f7358SJed Brown } 2916552f7358SJed Brown 2917552f7358SJed Brown #undef __FUNCT__ 2918552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2919552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2920552f7358SJed Brown { 292182f516ccSBarry Smith MPI_Comm comm; 2922552f7358SJed Brown PetscInt dim = 2; 2923552f7358SJed Brown struct triangulateio in; 2924552f7358SJed Brown struct triangulateio out; 2925552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2926552f7358SJed Brown PetscMPIInt rank; 2927552f7358SJed Brown PetscErrorCode ierr; 2928552f7358SJed Brown 2929552f7358SJed Brown PetscFunctionBegin; 293082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2931552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2932552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2933552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2934552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2935552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2936552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29370d644c17SKarl Rupp 2938552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2939552f7358SJed Brown if (in.numberofpoints > 0) { 2940552f7358SJed Brown PetscSection coordSection; 2941552f7358SJed Brown Vec coordinates; 2942552f7358SJed Brown PetscScalar *array; 2943552f7358SJed Brown 2944785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2945785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2946552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 294769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2948552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2949552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2950552f7358SJed Brown const PetscInt idx = v - vStart; 2951552f7358SJed Brown PetscInt off, d; 2952552f7358SJed Brown 2953552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2954552f7358SJed Brown for (d = 0; d < dim; ++d) { 2955552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2956552f7358SJed Brown } 2957552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2958552f7358SJed Brown } 2959552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2960552f7358SJed Brown } 2961552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29620d644c17SKarl Rupp 2963552f7358SJed Brown in.numberofcorners = 3; 2964552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29650d644c17SKarl Rupp 2966552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2967552f7358SJed Brown if (in.numberoftriangles > 0) { 2968785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2969552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2970552f7358SJed Brown const PetscInt idx = c - cStart; 29710298fd71SBarry Smith PetscInt *closure = NULL; 2972552f7358SJed Brown PetscInt closureSize; 2973552f7358SJed Brown 2974552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2975552f7358SJed Brown if ((closureSize != 4) && (closureSize != 7)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a triangle, %D vertices in closure", closureSize); 2976552f7358SJed Brown for (v = 0; v < 3; ++v) { 2977552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2978552f7358SJed Brown } 2979552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2980552f7358SJed Brown } 2981552f7358SJed Brown } 2982552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2983552f7358SJed Brown #if 0 /* Do not currently support holes */ 2984552f7358SJed Brown PetscReal *holeCoords; 2985552f7358SJed Brown PetscInt h, d; 2986552f7358SJed Brown 2987552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2988552f7358SJed Brown if (in.numberofholes > 0) { 2989785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2990552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2991552f7358SJed Brown for (d = 0; d < dim; ++d) { 2992552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2993552f7358SJed Brown } 2994552f7358SJed Brown } 2995552f7358SJed Brown } 2996552f7358SJed Brown #endif 2997552f7358SJed Brown if (!rank) { 2998552f7358SJed Brown char args[32]; 2999552f7358SJed Brown 3000552f7358SJed Brown /* Take away 'Q' for verbose output */ 3001552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 30020298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3003552f7358SJed Brown } 3004552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3005552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3006552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3007552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3008552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3009552f7358SJed Brown 3010552f7358SJed Brown { 3011552f7358SJed Brown const PetscInt numCorners = 3; 3012552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3013552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3014552f7358SJed Brown const int *cells = out.trianglelist; 3015552f7358SJed Brown const double *meshCoords = out.pointlist; 3016552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3017552f7358SJed Brown 30180fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3019552f7358SJed Brown /* Set labels */ 3020552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3021552f7358SJed Brown if (out.pointmarkerlist[v]) { 3022552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3023552f7358SJed Brown } 3024552f7358SJed Brown } 3025552f7358SJed Brown if (interpolate) { 3026552f7358SJed Brown PetscInt e; 3027552f7358SJed Brown 3028552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3029552f7358SJed Brown if (out.edgemarkerlist[e]) { 3030552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3031552f7358SJed Brown const PetscInt *edges; 3032552f7358SJed Brown PetscInt numEdges; 3033552f7358SJed Brown 3034552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3035552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3036552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3037552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3038552f7358SJed Brown } 3039552f7358SJed Brown } 3040552f7358SJed Brown } 3041552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3042552f7358SJed Brown } 3043552f7358SJed Brown #if 0 /* Do not currently support holes */ 3044552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3045552f7358SJed Brown #endif 3046552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3047552f7358SJed Brown PetscFunctionReturn(0); 3048552f7358SJed Brown } 3049552f7358SJed Brown #endif 3050552f7358SJed Brown 3051519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3052552f7358SJed Brown #include <tetgen.h> 3053552f7358SJed Brown #undef __FUNCT__ 3054552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3055552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3056552f7358SJed Brown { 305782f516ccSBarry Smith MPI_Comm comm; 3058552f7358SJed Brown const PetscInt dim = 3; 3059552f7358SJed Brown ::tetgenio in; 3060552f7358SJed Brown ::tetgenio out; 3061552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3062552f7358SJed Brown PetscMPIInt rank; 3063552f7358SJed Brown PetscErrorCode ierr; 3064552f7358SJed Brown 3065552f7358SJed Brown PetscFunctionBegin; 306682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3067552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3068552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3069552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3070552f7358SJed Brown if (in.numberofpoints > 0) { 3071552f7358SJed Brown PetscSection coordSection; 3072552f7358SJed Brown Vec coordinates; 3073552f7358SJed Brown PetscScalar *array; 3074552f7358SJed Brown 3075552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3076552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30770d644c17SKarl Rupp 3078552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 307969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3080552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3081552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3082552f7358SJed Brown const PetscInt idx = v - vStart; 3083552f7358SJed Brown PetscInt off, d; 3084552f7358SJed Brown 3085552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3086a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3087552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3088552f7358SJed Brown } 3089552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3090552f7358SJed Brown } 3091552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30920d644c17SKarl Rupp 3093552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3094552f7358SJed Brown if (in.numberoffacets > 0) { 3095552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3096552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3097552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3098552f7358SJed Brown const PetscInt idx = f - fStart; 30990298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3100552f7358SJed Brown 3101552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3102552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3103552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3104552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3105552f7358SJed Brown 3106552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3107552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3108552f7358SJed Brown const PetscInt point = points[p]; 31090d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3110552f7358SJed Brown } 3111552f7358SJed Brown 3112552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3113552f7358SJed Brown poly->numberofvertices = numVertices; 3114552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3115552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3116552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3117552f7358SJed Brown poly->vertexlist[v] = vIdx; 3118552f7358SJed Brown } 3119552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3120552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3121552f7358SJed Brown } 3122552f7358SJed Brown } 3123552f7358SJed Brown if (!rank) { 3124552f7358SJed Brown char args[32]; 3125552f7358SJed Brown 3126552f7358SJed Brown /* Take away 'Q' for verbose output */ 3127552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3128552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3129552f7358SJed Brown } 3130552f7358SJed Brown { 3131552f7358SJed Brown const PetscInt numCorners = 4; 3132552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3133552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3134552f7358SJed Brown const double *meshCoords = out.pointlist; 31351d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3136552f7358SJed Brown 31379db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31380fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3139552f7358SJed Brown /* Set labels */ 3140552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3141552f7358SJed Brown if (out.pointmarkerlist[v]) { 3142552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3143552f7358SJed Brown } 3144552f7358SJed Brown } 3145552f7358SJed Brown if (interpolate) { 3146552f7358SJed Brown PetscInt e; 3147552f7358SJed Brown 3148552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3149552f7358SJed Brown if (out.edgemarkerlist[e]) { 3150552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3151552f7358SJed Brown const PetscInt *edges; 3152552f7358SJed Brown PetscInt numEdges; 3153552f7358SJed Brown 3154552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3155552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3156552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3157552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3158552f7358SJed Brown } 3159552f7358SJed Brown } 3160552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3161552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3162552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3163552f7358SJed Brown const PetscInt *faces; 3164552f7358SJed Brown PetscInt numFaces; 3165552f7358SJed Brown 3166552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3167552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3168552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3169552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3170552f7358SJed Brown } 3171552f7358SJed Brown } 3172552f7358SJed Brown } 3173552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3174552f7358SJed Brown } 3175552f7358SJed Brown PetscFunctionReturn(0); 3176552f7358SJed Brown } 3177552f7358SJed Brown 3178552f7358SJed Brown #undef __FUNCT__ 3179552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3180552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3181552f7358SJed Brown { 318282f516ccSBarry Smith MPI_Comm comm; 3183552f7358SJed Brown const PetscInt dim = 3; 3184552f7358SJed Brown ::tetgenio in; 3185552f7358SJed Brown ::tetgenio out; 3186552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3187552f7358SJed Brown PetscMPIInt rank; 3188552f7358SJed Brown PetscErrorCode ierr; 3189552f7358SJed Brown 3190552f7358SJed Brown PetscFunctionBegin; 319182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3192552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3193552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3194552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3195552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31960d644c17SKarl Rupp 3197552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3198552f7358SJed Brown if (in.numberofpoints > 0) { 3199552f7358SJed Brown PetscSection coordSection; 3200552f7358SJed Brown Vec coordinates; 3201552f7358SJed Brown PetscScalar *array; 3202552f7358SJed Brown 3203552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3204552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 32050d644c17SKarl Rupp 3206552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 320769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3208552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3209552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3210552f7358SJed Brown const PetscInt idx = v - vStart; 3211552f7358SJed Brown PetscInt off, d; 3212552f7358SJed Brown 3213552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3214a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3215552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3216552f7358SJed Brown } 3217552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3218552f7358SJed Brown } 3219552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 32200d644c17SKarl Rupp 3221552f7358SJed Brown in.numberofcorners = 4; 3222552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3223552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3224552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3225552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3226552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3227552f7358SJed Brown const PetscInt idx = c - cStart; 32280298fd71SBarry Smith PetscInt *closure = NULL; 3229552f7358SJed Brown PetscInt closureSize; 3230552f7358SJed Brown 3231552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3232552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3233552f7358SJed Brown for (v = 0; v < 4; ++v) { 3234552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3235552f7358SJed Brown } 3236552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3237552f7358SJed Brown } 3238552f7358SJed Brown } 323919436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3240552f7358SJed Brown if (!rank) { 3241552f7358SJed Brown char args[32]; 3242552f7358SJed Brown 3243552f7358SJed Brown /* Take away 'Q' for verbose output */ 324419436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3245552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3246552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3247552f7358SJed Brown } 3248552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3249552f7358SJed Brown 3250552f7358SJed Brown { 3251552f7358SJed Brown const PetscInt numCorners = 4; 3252552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3253552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3254552f7358SJed Brown const double *meshCoords = out.pointlist; 32551d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32561d4b4d7bSJed Brown 3257552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3258552f7358SJed Brown 32599db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32600fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3261552f7358SJed Brown /* Set labels */ 3262552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3263552f7358SJed Brown if (out.pointmarkerlist[v]) { 3264552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3265552f7358SJed Brown } 3266552f7358SJed Brown } 3267552f7358SJed Brown if (interpolate) { 3268552f7358SJed Brown PetscInt e, f; 3269552f7358SJed Brown 3270552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3271552f7358SJed Brown if (out.edgemarkerlist[e]) { 3272552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3273552f7358SJed Brown const PetscInt *edges; 3274552f7358SJed Brown PetscInt numEdges; 3275552f7358SJed Brown 3276552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3277552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3278552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3279552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3280552f7358SJed Brown } 3281552f7358SJed Brown } 3282552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3283552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3284552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3285552f7358SJed Brown const PetscInt *faces; 3286552f7358SJed Brown PetscInt numFaces; 3287552f7358SJed Brown 3288552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3289552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3290552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3291552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3292552f7358SJed Brown } 3293552f7358SJed Brown } 3294552f7358SJed Brown } 3295552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3296552f7358SJed Brown } 3297552f7358SJed Brown PetscFunctionReturn(0); 3298552f7358SJed Brown } 3299552f7358SJed Brown #endif 3300552f7358SJed Brown 3301519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3302aaa7dc30SBarry Smith #include <ctetgen.h> 3303552f7358SJed Brown 3304552f7358SJed Brown #undef __FUNCT__ 3305552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3306552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3307552f7358SJed Brown { 330882f516ccSBarry Smith MPI_Comm comm; 3309552f7358SJed Brown const PetscInt dim = 3; 3310552f7358SJed Brown PLC *in, *out; 3311552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3312552f7358SJed Brown PetscMPIInt rank; 3313552f7358SJed Brown PetscErrorCode ierr; 3314552f7358SJed Brown 3315552f7358SJed Brown PetscFunctionBegin; 331682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 33170298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3318552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3319552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3320552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3321552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 33220d644c17SKarl Rupp 3323552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3324552f7358SJed Brown if (in->numberofpoints > 0) { 3325552f7358SJed Brown PetscSection coordSection; 3326552f7358SJed Brown Vec coordinates; 3327552f7358SJed Brown PetscScalar *array; 3328552f7358SJed Brown 3329785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3330785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3331552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 333269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3333552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3334552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3335552f7358SJed Brown const PetscInt idx = v - vStart; 3336552f7358SJed Brown PetscInt off, d, m; 3337552f7358SJed Brown 3338552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3339552f7358SJed Brown for (d = 0; d < dim; ++d) { 3340552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3341552f7358SJed Brown } 3342552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33430d644c17SKarl Rupp 3344552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3345552f7358SJed Brown } 3346552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3347552f7358SJed Brown } 3348552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33490d644c17SKarl Rupp 3350552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3351552f7358SJed Brown if (in->numberoffacets > 0) { 3352785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3353785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3354552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3355552f7358SJed Brown const PetscInt idx = f - fStart; 33560298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3357552f7358SJed Brown polygon *poly; 3358552f7358SJed Brown 3359552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33600d644c17SKarl Rupp 3361785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33620d644c17SKarl Rupp 3363552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33640298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3365552f7358SJed Brown 3366552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3367552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3368552f7358SJed Brown const PetscInt point = points[p]; 33690d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3370552f7358SJed Brown } 3371552f7358SJed Brown 3372552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3373552f7358SJed Brown poly->numberofvertices = numVertices; 3374785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3375552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3376552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3377552f7358SJed Brown poly->vertexlist[v] = vIdx; 3378552f7358SJed Brown } 3379552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3380552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3381552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3382552f7358SJed Brown } 3383552f7358SJed Brown } 3384552f7358SJed Brown if (!rank) { 3385552f7358SJed Brown TetGenOpts t; 3386552f7358SJed Brown 3387552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3388552f7358SJed Brown t.in = boundary; /* Should go away */ 3389552f7358SJed Brown t.plc = 1; 3390552f7358SJed Brown t.quality = 1; 3391552f7358SJed Brown t.edgesout = 1; 3392552f7358SJed Brown t.zeroindex = 1; 3393552f7358SJed Brown t.quiet = 1; 3394552f7358SJed Brown t.verbose = verbose; 3395552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3396552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3397552f7358SJed Brown } 3398552f7358SJed Brown { 3399552f7358SJed Brown const PetscInt numCorners = 4; 3400552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3401552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3402552f7358SJed Brown const double *meshCoords = out->pointlist; 34031d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3404552f7358SJed Brown 34059db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 34060fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3407552f7358SJed Brown /* Set labels */ 3408552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3409552f7358SJed Brown if (out->pointmarkerlist[v]) { 3410552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3411552f7358SJed Brown } 3412552f7358SJed Brown } 3413552f7358SJed Brown if (interpolate) { 3414552f7358SJed Brown PetscInt e; 3415552f7358SJed Brown 3416552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3417552f7358SJed Brown if (out->edgemarkerlist[e]) { 3418552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3419552f7358SJed Brown const PetscInt *edges; 3420552f7358SJed Brown PetscInt numEdges; 3421552f7358SJed Brown 3422552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3423552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3424552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3425552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3426552f7358SJed Brown } 3427552f7358SJed Brown } 3428552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3429552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3430552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3431552f7358SJed Brown const PetscInt *faces; 3432552f7358SJed Brown PetscInt numFaces; 3433552f7358SJed Brown 3434552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3435552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3436552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3437552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3438552f7358SJed Brown } 3439552f7358SJed Brown } 3440552f7358SJed Brown } 3441552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3442552f7358SJed Brown } 3443552f7358SJed Brown 3444552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3445552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3446552f7358SJed Brown PetscFunctionReturn(0); 3447552f7358SJed Brown } 3448552f7358SJed Brown 3449552f7358SJed Brown #undef __FUNCT__ 3450552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3451552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3452552f7358SJed Brown { 345382f516ccSBarry Smith MPI_Comm comm; 3454552f7358SJed Brown const PetscInt dim = 3; 3455552f7358SJed Brown PLC *in, *out; 3456552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3457552f7358SJed Brown PetscMPIInt rank; 3458552f7358SJed Brown PetscErrorCode ierr; 3459552f7358SJed Brown 3460552f7358SJed Brown PetscFunctionBegin; 346182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34620298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3463552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3464552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3465552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3466552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3467552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3468552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34690d644c17SKarl Rupp 3470552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3471552f7358SJed Brown if (in->numberofpoints > 0) { 3472552f7358SJed Brown PetscSection coordSection; 3473552f7358SJed Brown Vec coordinates; 3474552f7358SJed Brown PetscScalar *array; 3475552f7358SJed Brown 3476785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3477785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3478552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 347969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3480552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3481552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3482552f7358SJed Brown const PetscInt idx = v - vStart; 3483552f7358SJed Brown PetscInt off, d, m; 3484552f7358SJed Brown 3485552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3486552f7358SJed Brown for (d = 0; d < dim; ++d) { 3487552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3488552f7358SJed Brown } 3489552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34900d644c17SKarl Rupp 3491552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3492552f7358SJed Brown } 3493552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3494552f7358SJed Brown } 3495552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34960d644c17SKarl Rupp 3497552f7358SJed Brown in->numberofcorners = 4; 3498552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3499552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3500552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3501785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3502552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3503552f7358SJed Brown const PetscInt idx = c - cStart; 35040298fd71SBarry Smith PetscInt *closure = NULL; 3505552f7358SJed Brown PetscInt closureSize; 3506552f7358SJed Brown 3507552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3508552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3509552f7358SJed Brown for (v = 0; v < 4; ++v) { 3510552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3511552f7358SJed Brown } 3512552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3513552f7358SJed Brown } 3514552f7358SJed Brown } 3515552f7358SJed Brown if (!rank) { 3516552f7358SJed Brown TetGenOpts t; 3517552f7358SJed Brown 3518552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 35190d644c17SKarl Rupp 3520552f7358SJed Brown t.in = dm; /* Should go away */ 3521552f7358SJed Brown t.refine = 1; 3522552f7358SJed Brown t.varvolume = 1; 3523552f7358SJed Brown t.quality = 1; 3524552f7358SJed Brown t.edgesout = 1; 3525552f7358SJed Brown t.zeroindex = 1; 3526552f7358SJed Brown t.quiet = 1; 3527552f7358SJed Brown t.verbose = verbose; /* Change this */ 35280d644c17SKarl Rupp 3529552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3530552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3531552f7358SJed Brown } 3532552f7358SJed Brown { 3533552f7358SJed Brown const PetscInt numCorners = 4; 3534552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3535552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3536552f7358SJed Brown const double *meshCoords = out->pointlist; 35371d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3538552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3539552f7358SJed Brown 35409db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35410fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3542552f7358SJed Brown /* Set labels */ 3543552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3544552f7358SJed Brown if (out->pointmarkerlist[v]) { 3545552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3546552f7358SJed Brown } 3547552f7358SJed Brown } 3548552f7358SJed Brown if (interpolate) { 3549552f7358SJed Brown PetscInt e, f; 3550552f7358SJed Brown 3551552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3552552f7358SJed Brown if (out->edgemarkerlist[e]) { 3553552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3554552f7358SJed Brown const PetscInt *edges; 3555552f7358SJed Brown PetscInt numEdges; 3556552f7358SJed Brown 3557552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3558552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3559552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3560552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3561552f7358SJed Brown } 3562552f7358SJed Brown } 3563552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3564552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3565552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3566552f7358SJed Brown const PetscInt *faces; 3567552f7358SJed Brown PetscInt numFaces; 3568552f7358SJed Brown 3569552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3570552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3571552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3572552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3573552f7358SJed Brown } 3574552f7358SJed Brown } 3575552f7358SJed Brown } 3576552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3577552f7358SJed Brown } 3578552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3579552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3580552f7358SJed Brown PetscFunctionReturn(0); 3581552f7358SJed Brown } 3582552f7358SJed Brown #endif 3583552f7358SJed Brown 3584552f7358SJed Brown #undef __FUNCT__ 3585552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3586552f7358SJed Brown /*@C 3587552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3588552f7358SJed Brown 3589552f7358SJed Brown Not Collective 3590552f7358SJed Brown 3591552f7358SJed Brown Input Parameters: 3592552f7358SJed Brown + boundary - The DMPlex boundary object 3593552f7358SJed Brown . name - The mesh generation package name 3594552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3595552f7358SJed Brown 3596552f7358SJed Brown Output Parameter: 3597552f7358SJed Brown . mesh - The DMPlex object 3598552f7358SJed Brown 3599552f7358SJed Brown Level: intermediate 3600552f7358SJed Brown 3601552f7358SJed Brown .keywords: mesh, elements 3602552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3603552f7358SJed Brown @*/ 3604552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3605552f7358SJed Brown { 3606552f7358SJed Brown PetscInt dim; 3607552f7358SJed Brown char genname[1024]; 3608552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3609552f7358SJed Brown PetscErrorCode ierr; 3610552f7358SJed Brown 3611552f7358SJed Brown PetscFunctionBegin; 3612552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3613552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3614c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3615552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36160d644c17SKarl Rupp if (flg) name = genname; 3617552f7358SJed Brown if (name) { 3618552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3619552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3620552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3621552f7358SJed Brown } 3622552f7358SJed Brown switch (dim) { 3623552f7358SJed Brown case 1: 3624552f7358SJed Brown if (!name || isTriangle) { 3625519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3626552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3627552f7358SJed Brown #else 362882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3629552f7358SJed Brown #endif 363082f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3631552f7358SJed Brown break; 3632552f7358SJed Brown case 2: 3633552f7358SJed Brown if (!name || isCTetgen) { 3634519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3635552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3636552f7358SJed Brown #else 363782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3638552f7358SJed Brown #endif 3639552f7358SJed Brown } else if (isTetgen) { 3640519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3641552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3642552f7358SJed Brown #else 364382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3644552f7358SJed Brown #endif 364582f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3646552f7358SJed Brown break; 3647552f7358SJed Brown default: 364882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3649552f7358SJed Brown } 3650552f7358SJed Brown PetscFunctionReturn(0); 3651552f7358SJed Brown } 3652552f7358SJed Brown 3653552f7358SJed Brown #undef __FUNCT__ 3654552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3655552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3656552f7358SJed Brown { 3657552f7358SJed Brown PetscReal refinementLimit; 3658552f7358SJed Brown PetscInt dim, cStart, cEnd; 36590298fd71SBarry Smith char genname[1024], *name = NULL; 3660552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3661552f7358SJed Brown PetscErrorCode ierr; 3662552f7358SJed Brown 3663552f7358SJed Brown PetscFunctionBegin; 3664552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3665552f7358SJed Brown if (isUniform) { 3666552f7358SJed Brown CellRefiner cellRefiner; 3667552f7358SJed Brown 3668509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3669509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36708e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3671552f7358SJed Brown PetscFunctionReturn(0); 3672552f7358SJed Brown } 3673552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3674552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3675c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3676552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3677552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36780d644c17SKarl Rupp if (flg) name = genname; 3679552f7358SJed Brown if (name) { 3680552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3681552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3682552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3683552f7358SJed Brown } 3684552f7358SJed Brown switch (dim) { 3685552f7358SJed Brown case 2: 3686552f7358SJed Brown if (!name || isTriangle) { 3687519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3688552f7358SJed Brown double *maxVolumes; 3689552f7358SJed Brown PetscInt c; 3690552f7358SJed Brown 3691785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36920d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3693552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36946b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3695552f7358SJed Brown #else 369682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3697552f7358SJed Brown #endif 369882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3699552f7358SJed Brown break; 3700552f7358SJed Brown case 3: 3701552f7358SJed Brown if (!name || isCTetgen) { 3702519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3703552f7358SJed Brown PetscReal *maxVolumes; 3704552f7358SJed Brown PetscInt c; 3705552f7358SJed Brown 3706785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37070d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3708552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3709552f7358SJed Brown #else 371082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3711552f7358SJed Brown #endif 3712552f7358SJed Brown } else if (isTetgen) { 3713519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3714552f7358SJed Brown double *maxVolumes; 3715552f7358SJed Brown PetscInt c; 3716552f7358SJed Brown 3717785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37180d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3719552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3720552f7358SJed Brown #else 372182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3722552f7358SJed Brown #endif 372382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3724552f7358SJed Brown break; 3725552f7358SJed Brown default: 372682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3727552f7358SJed Brown } 37288e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3729552f7358SJed Brown PetscFunctionReturn(0); 3730552f7358SJed Brown } 3731552f7358SJed Brown 3732552f7358SJed Brown #undef __FUNCT__ 37330a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 37340a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 37350a6ba040SMatthew G. Knepley { 37360a6ba040SMatthew G. Knepley DM cdm = dm; 37370a6ba040SMatthew G. Knepley PetscInt r; 37380a6ba040SMatthew G. Knepley PetscBool isUniform; 37390a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37400a6ba040SMatthew G. Knepley 37410a6ba040SMatthew G. Knepley PetscFunctionBegin; 37420a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37430a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37440a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37450a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37460a6ba040SMatthew G. Knepley 37470a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37480a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37490a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37500a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37510a6ba040SMatthew G. Knepley } 37520a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37530a6ba040SMatthew G. Knepley } 37540a6ba040SMatthew G. Knepley 37550a6ba040SMatthew G. Knepley #undef __FUNCT__ 37560a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37570a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37580a6ba040SMatthew G. Knepley { 37590a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3760549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37610a6ba040SMatthew G. Knepley 37620a6ba040SMatthew G. Knepley PetscFunctionBegin; 3763549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37640a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37650a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37660a6ba040SMatthew G. Knepley } 37670a6ba040SMatthew G. Knepley 37680a6ba040SMatthew G. Knepley #undef __FUNCT__ 3769d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3770d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3771d49fcaecSMatthew G. Knepley { 3772d49fcaecSMatthew G. Knepley PetscInt d; 3773d49fcaecSMatthew G. Knepley 3774d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3775d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3776d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3777d49fcaecSMatthew G. Knepley } else { 3778d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3779d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3780858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3781d49fcaecSMatthew G. Knepley } else { 3782d49fcaecSMatthew G. Knepley out[d] = in[d]; 3783d49fcaecSMatthew G. Knepley } 3784d49fcaecSMatthew G. Knepley } 3785d49fcaecSMatthew G. Knepley } 3786d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3787d49fcaecSMatthew G. Knepley } 3788d49fcaecSMatthew G. Knepley 3789d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3790d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3791d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3792d49fcaecSMatthew G. Knepley { 3793d49fcaecSMatthew G. Knepley PetscInt d; 3794d49fcaecSMatthew G. Knepley 3795d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3796d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3797d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3798d49fcaecSMatthew G. Knepley } else { 3799d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3800d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3801858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3802d49fcaecSMatthew G. Knepley } else { 3803d49fcaecSMatthew G. Knepley out[d] += in[d]; 3804d49fcaecSMatthew G. Knepley } 3805d49fcaecSMatthew G. Knepley } 3806d49fcaecSMatthew G. Knepley } 3807d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3808d49fcaecSMatthew G. Knepley } 3809d49fcaecSMatthew G. Knepley 3810d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3811d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3812d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3813d49fcaecSMatthew G. Knepley { 3814d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3815d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3816d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 38178c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3818d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3819d49fcaecSMatthew G. Knepley 3820d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3821d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3822d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3823d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3824d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3825d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3826d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 38288c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 38298c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 38308c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3831d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3832d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3833d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3834d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 38358c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3836d49fcaecSMatthew G. Knepley } 3837d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3838d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3839d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38408c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3841d49fcaecSMatthew G. Knepley } 3842d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3843d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3844d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3845d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3846d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3847d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3848d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3849d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3850d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3851d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3852d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3853d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3854d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3855d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3856d49fcaecSMatthew G. Knepley } 3857d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3858d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3859d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3860d49fcaecSMatthew G. Knepley PetscInt b; 3861d49fcaecSMatthew G. Knepley 3862d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3863d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3864d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3865d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3866d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3867d49fcaecSMatthew G. Knepley } 3868d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3869d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3870d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 387146e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 3872d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3873d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3874d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3875d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3876d49fcaecSMatthew G. Knepley } 3877d49fcaecSMatthew G. Knepley 3878d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3879aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3880552f7358SJed Brown /*@ 3881aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3882552f7358SJed Brown 3883552f7358SJed Brown Not Collective 3884552f7358SJed Brown 3885aa50250dSMatthew G. Knepley Input Parameter: 3886552f7358SJed Brown . dm - The DMPlex object 3887552f7358SJed Brown 3888aa50250dSMatthew G. Knepley Output Parameter: 3889aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3890552f7358SJed Brown 3891552f7358SJed Brown Level: developer 3892552f7358SJed Brown 3893aa50250dSMatthew G. Knepley .keywords: mesh, points 3894aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3895aa50250dSMatthew G. Knepley @*/ 3896aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3897aa50250dSMatthew G. Knepley { 3898aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3899aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3900aa50250dSMatthew G. Knepley 3901aa50250dSMatthew G. Knepley PetscFunctionBegin; 3902aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3903aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 390463d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3905aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3906aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3907aa50250dSMatthew G. Knepley } 3908aa50250dSMatthew G. Knepley 3909aa50250dSMatthew G. Knepley #undef __FUNCT__ 3910aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3911aa50250dSMatthew G. Knepley /*@ 3912aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3913aa50250dSMatthew G. Knepley 3914aa50250dSMatthew G. Knepley Not Collective 3915aa50250dSMatthew G. Knepley 3916aa50250dSMatthew G. Knepley Input Parameter: 3917aa50250dSMatthew G. Knepley . dm - The DMPlex object 3918aa50250dSMatthew G. Knepley 3919aa50250dSMatthew G. Knepley Output Parameter: 3920aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3921aa50250dSMatthew G. Knepley 3922aa50250dSMatthew G. Knepley Level: developer 3923552f7358SJed Brown 3924552f7358SJed Brown .keywords: mesh, points 3925aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3926552f7358SJed Brown @*/ 3927552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3928552f7358SJed Brown { 3929aa50250dSMatthew G. Knepley DMLabel label; 3930aa50250dSMatthew G. Knepley PetscInt d = 0; 3931552f7358SJed Brown PetscErrorCode ierr; 3932552f7358SJed Brown 3933552f7358SJed Brown PetscFunctionBegin; 3934552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3935552f7358SJed Brown PetscValidPointer(depth, 2); 3936aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3937aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3938552f7358SJed Brown *depth = d-1; 3939552f7358SJed Brown PetscFunctionReturn(0); 3940552f7358SJed Brown } 3941552f7358SJed Brown 3942552f7358SJed Brown #undef __FUNCT__ 3943552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3944552f7358SJed Brown /*@ 3945552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3946552f7358SJed Brown 3947552f7358SJed Brown Not Collective 3948552f7358SJed Brown 3949552f7358SJed Brown Input Parameters: 3950552f7358SJed Brown + dm - The DMPlex object 3951552f7358SJed Brown - stratumValue - The requested depth 3952552f7358SJed Brown 3953552f7358SJed Brown Output Parameters: 3954552f7358SJed Brown + start - The first point at this depth 3955552f7358SJed Brown - end - One beyond the last point at this depth 3956552f7358SJed Brown 3957552f7358SJed Brown Level: developer 3958552f7358SJed Brown 3959552f7358SJed Brown .keywords: mesh, points 3960552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3961552f7358SJed Brown @*/ 39620adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39630adebc6cSBarry Smith { 3964aa50250dSMatthew G. Knepley DMLabel label; 396563d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3966552f7358SJed Brown PetscErrorCode ierr; 3967552f7358SJed Brown 3968552f7358SJed Brown PetscFunctionBegin; 3969552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 397063d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 397163d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3972552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39730d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 397463d1a920SMatthew G. Knepley if (stratumValue < 0) { 397563d1a920SMatthew G. Knepley if (start) *start = pStart; 397663d1a920SMatthew G. Knepley if (end) *end = pEnd; 397763d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3978552f7358SJed Brown } 3979aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 398063d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 398163d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3982552f7358SJed Brown PetscFunctionReturn(0); 3983552f7358SJed Brown } 3984552f7358SJed Brown 3985552f7358SJed Brown #undef __FUNCT__ 3986552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3987552f7358SJed Brown /*@ 3988552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3989552f7358SJed Brown 3990552f7358SJed Brown Not Collective 3991552f7358SJed Brown 3992552f7358SJed Brown Input Parameters: 3993552f7358SJed Brown + dm - The DMPlex object 3994552f7358SJed Brown - stratumValue - The requested height 3995552f7358SJed Brown 3996552f7358SJed Brown Output Parameters: 3997552f7358SJed Brown + start - The first point at this height 3998552f7358SJed Brown - end - One beyond the last point at this height 3999552f7358SJed Brown 4000552f7358SJed Brown Level: developer 4001552f7358SJed Brown 4002552f7358SJed Brown .keywords: mesh, points 4003552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4004552f7358SJed Brown @*/ 40050adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 40060adebc6cSBarry Smith { 4007aa50250dSMatthew G. Knepley DMLabel label; 400863d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4009552f7358SJed Brown PetscErrorCode ierr; 4010552f7358SJed Brown 4011552f7358SJed Brown PetscFunctionBegin; 4012552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 401363d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 401463d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4015552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 40160d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 401763d1a920SMatthew G. Knepley if (stratumValue < 0) { 401863d1a920SMatthew G. Knepley if (start) *start = pStart; 401963d1a920SMatthew G. Knepley if (end) *end = pEnd; 402063d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4021552f7358SJed Brown } 4022aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4023aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 402463d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 402563d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4026552f7358SJed Brown PetscFunctionReturn(0); 4027552f7358SJed Brown } 4028552f7358SJed Brown 4029552f7358SJed Brown #undef __FUNCT__ 4030552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4031552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4032a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4033a6dfd86eSKarl Rupp { 4034552f7358SJed Brown PetscInt *numDofTot; 4035916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4036916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4037552f7358SJed Brown PetscErrorCode ierr; 4038552f7358SJed Brown 4039552f7358SJed Brown PetscFunctionBegin; 4040785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4041552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4042552f7358SJed Brown numDofTot[d] = 0; 40430d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4044552f7358SJed Brown } 404582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4046552f7358SJed Brown if (numFields > 0) { 4047552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4048552f7358SJed Brown if (numComp) { 4049552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4050552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4051552f7358SJed Brown } 4052552f7358SJed Brown } 4053552f7358SJed Brown } 4054552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4055552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4056916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4057916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4058916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4059916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4060552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4061552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4062552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4063552f7358SJed Brown } 4064552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4065552f7358SJed Brown } 4066552f7358SJed Brown } 4067552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4068552f7358SJed Brown PetscFunctionReturn(0); 4069552f7358SJed Brown } 4070552f7358SJed Brown 4071552f7358SJed Brown #undef __FUNCT__ 4072552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4073552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4074552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4075552f7358SJed Brown */ 4076a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4077a6dfd86eSKarl Rupp { 4078552f7358SJed Brown PetscInt numFields; 4079552f7358SJed Brown PetscInt bc; 4080a68b90caSToby Isaac PetscSection aSec; 4081552f7358SJed Brown PetscErrorCode ierr; 4082552f7358SJed Brown 4083552f7358SJed Brown PetscFunctionBegin; 4084552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4085552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4086552f7358SJed Brown PetscInt field = 0; 4087552f7358SJed Brown const PetscInt *idx; 4088552f7358SJed Brown PetscInt n, i; 4089552f7358SJed Brown 40900d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4091552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4092552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4093552f7358SJed Brown for (i = 0; i < n; ++i) { 4094552f7358SJed Brown const PetscInt p = idx[i]; 4095552f7358SJed Brown PetscInt numConst = constDof; 4096552f7358SJed Brown 4097552f7358SJed Brown /* Constrain every dof on the point */ 4098552f7358SJed Brown if (numConst < 0) { 4099552f7358SJed Brown if (numFields) { 4100552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4101552f7358SJed Brown } else { 4102552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4103552f7358SJed Brown } 4104552f7358SJed Brown } 4105552f7358SJed Brown if (numFields) { 4106552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4107552f7358SJed Brown } 4108552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4109552f7358SJed Brown } 4110552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4111552f7358SJed Brown } 4112a17985deSToby Isaac ierr = DMPlexGetAnchors(dm, &aSec, NULL);CHKERRQ(ierr); 4113a68b90caSToby Isaac if (aSec) { 4114a68b90caSToby Isaac PetscInt aStart, aEnd, a; 4115a68b90caSToby Isaac 4116a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 4117a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 4118a68b90caSToby Isaac PetscInt dof; 4119a68b90caSToby Isaac 4120a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 4121a68b90caSToby Isaac if (dof) { 4122a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 4123a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 4124a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 4125a68b90caSToby Isaac if (numFields) { 4126a68b90caSToby Isaac PetscInt f; 4127a68b90caSToby Isaac 4128a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 4129a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 4130a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 4131a68b90caSToby Isaac } 4132a68b90caSToby Isaac } 4133a68b90caSToby Isaac } 4134a68b90caSToby Isaac } 4135a68b90caSToby Isaac } 4136552f7358SJed Brown PetscFunctionReturn(0); 4137552f7358SJed Brown } 4138552f7358SJed Brown 4139552f7358SJed Brown #undef __FUNCT__ 4140552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4141552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41420adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 41430adebc6cSBarry Smith { 4144552f7358SJed Brown PetscInt *maxConstraints; 4145552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4146552f7358SJed Brown PetscErrorCode ierr; 4147552f7358SJed Brown 4148552f7358SJed Brown PetscFunctionBegin; 4149552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4150552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4151785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 41520d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4153552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4154552f7358SJed Brown PetscInt cdof; 4155552f7358SJed Brown 4156552f7358SJed Brown if (numFields) { 4157552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4158552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4159552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4160552f7358SJed Brown } 4161552f7358SJed Brown } else { 4162552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4163552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4164552f7358SJed Brown } 4165552f7358SJed Brown } 4166552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4167552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4168552f7358SJed Brown } 4169552f7358SJed Brown if (maxConstraints[numFields]) { 4170552f7358SJed Brown PetscInt *indices; 4171552f7358SJed Brown 4172785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4173552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4174552f7358SJed Brown PetscInt cdof, d; 4175552f7358SJed Brown 4176552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4177552f7358SJed Brown if (cdof) { 4178552f7358SJed 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]); 4179552f7358SJed Brown if (numFields) { 4180552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4181552f7358SJed Brown 4182552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4183552f7358SJed Brown PetscInt cfdof, fdof; 4184552f7358SJed Brown 4185552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4186552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4187552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41880d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4189552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41900d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4191552f7358SJed Brown numConst += cfdof; 4192552f7358SJed Brown foff += fdof; 4193552f7358SJed Brown } 4194552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4195552f7358SJed Brown } else { 41960d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4197552f7358SJed Brown } 4198552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4199552f7358SJed Brown } 4200552f7358SJed Brown } 4201552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4202552f7358SJed Brown } 4203552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4204552f7358SJed Brown PetscFunctionReturn(0); 4205552f7358SJed Brown } 4206552f7358SJed Brown 4207552f7358SJed Brown #undef __FUNCT__ 4208552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4209552f7358SJed Brown /* Set the constrained field indices on each point */ 42100adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 42110adebc6cSBarry Smith { 4212552f7358SJed Brown const PetscInt *points, *indices; 4213552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4214552f7358SJed Brown PetscErrorCode ierr; 4215552f7358SJed Brown 4216552f7358SJed Brown PetscFunctionBegin; 4217552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4218552f7358SJed 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); 4219552f7358SJed Brown 4220552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4221552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4222552f7358SJed Brown if (!constraintIndices) { 4223552f7358SJed Brown PetscInt *idx, i; 4224552f7358SJed Brown 4225552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4226785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 42270d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4228552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4229552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4230552f7358SJed Brown } 4231552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4232552f7358SJed Brown } else { 4233552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4234552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4235552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4236552f7358SJed Brown PetscInt fcdof; 4237552f7358SJed Brown 4238552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 423982f516ccSBarry 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); 4240552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4241552f7358SJed Brown } 4242552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4243552f7358SJed Brown } 4244552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4245552f7358SJed Brown PetscFunctionReturn(0); 4246552f7358SJed Brown } 4247552f7358SJed Brown 4248552f7358SJed Brown #undef __FUNCT__ 4249552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4250552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 42510adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 42520adebc6cSBarry Smith { 4253552f7358SJed Brown PetscInt *indices; 4254552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4255552f7358SJed Brown PetscErrorCode ierr; 4256552f7358SJed Brown 4257552f7358SJed Brown PetscFunctionBegin; 4258552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4259785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4260552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 426182f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4262552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4263552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4264552f7358SJed Brown PetscInt cdof, d; 4265552f7358SJed Brown 4266552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4267552f7358SJed Brown if (cdof) { 4268552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4269552f7358SJed Brown 4270552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4271552f7358SJed Brown const PetscInt *fcind; 4272552f7358SJed Brown PetscInt fdof, fcdof; 4273552f7358SJed Brown 4274552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4275552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4276552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4277552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42780d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4279552f7358SJed Brown foff += fdof; 4280552f7358SJed Brown numConst += fcdof; 4281552f7358SJed Brown } 428282f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4283552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4284552f7358SJed Brown } 4285552f7358SJed Brown } 4286552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4287552f7358SJed Brown PetscFunctionReturn(0); 4288552f7358SJed Brown } 4289552f7358SJed Brown 4290552f7358SJed Brown #undef __FUNCT__ 4291552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4292552f7358SJed Brown /*@C 4293552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4294552f7358SJed Brown 4295552f7358SJed Brown Not Collective 4296552f7358SJed Brown 4297552f7358SJed Brown Input Parameters: 4298552f7358SJed Brown + dm - The DMPlex object 4299552f7358SJed Brown . dim - The spatial dimension of the problem 4300552f7358SJed Brown . numFields - The number of fields in the problem 4301552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4302552f7358SJed 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 4303552f7358SJed Brown . numBC - The number of boundary conditions 4304552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4305f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4306f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4307552f7358SJed Brown 4308552f7358SJed Brown Output Parameter: 4309552f7358SJed Brown . section - The PetscSection object 4310552f7358SJed Brown 4311552f7358SJed 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 4312f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4313f8f126e8SMatthew G. Knepley 4314f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4315552f7358SJed Brown 4316552f7358SJed Brown Level: developer 4317552f7358SJed Brown 43183813dfbdSMatthew G Knepley Fortran Notes: 43193813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 43203813dfbdSMatthew G Knepley 4321552f7358SJed Brown .keywords: mesh, elements 4322f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4323552f7358SJed Brown @*/ 4324f8f126e8SMatthew 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) 4325a6dfd86eSKarl Rupp { 4326a68b90caSToby Isaac PetscSection aSec; 4327552f7358SJed Brown PetscErrorCode ierr; 4328552f7358SJed Brown 4329552f7358SJed Brown PetscFunctionBegin; 4330552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4331552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4332f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4333552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4334a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,NULL);CHKERRQ(ierr); 4335a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4336ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4337552f7358SJed Brown PetscFunctionReturn(0); 4338552f7358SJed Brown } 4339552f7358SJed Brown 4340552f7358SJed Brown #undef __FUNCT__ 4341552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 43420adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 43430adebc6cSBarry Smith { 4344552f7358SJed Brown PetscSection section; 4345552f7358SJed Brown PetscErrorCode ierr; 4346552f7358SJed Brown 4347552f7358SJed Brown PetscFunctionBegin; 434838221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 434982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4350552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 43511d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4352552f7358SJed Brown PetscFunctionReturn(0); 4353552f7358SJed Brown } 4354552f7358SJed Brown 4355552f7358SJed Brown #undef __FUNCT__ 4356552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 43570adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 43580adebc6cSBarry Smith { 4359552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4360552f7358SJed Brown 4361552f7358SJed Brown PetscFunctionBegin; 4362552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4363552f7358SJed Brown if (section) *section = mesh->coneSection; 4364552f7358SJed Brown PetscFunctionReturn(0); 4365552f7358SJed Brown } 4366552f7358SJed Brown 4367552f7358SJed Brown #undef __FUNCT__ 43688cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43698cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43708cb4d582SMatthew G. Knepley { 43718cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43728cb4d582SMatthew G. Knepley 43738cb4d582SMatthew G. Knepley PetscFunctionBegin; 43748cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43758cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43768cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43778cb4d582SMatthew G. Knepley } 43788cb4d582SMatthew G. Knepley 43798cb4d582SMatthew G. Knepley #undef __FUNCT__ 4380552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4381a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4382a6dfd86eSKarl Rupp { 4383552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4384552f7358SJed Brown 4385552f7358SJed Brown PetscFunctionBegin; 4386552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4387552f7358SJed Brown if (cones) *cones = mesh->cones; 4388552f7358SJed Brown PetscFunctionReturn(0); 4389552f7358SJed Brown } 4390552f7358SJed Brown 4391552f7358SJed Brown #undef __FUNCT__ 4392552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4393a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4394a6dfd86eSKarl Rupp { 4395552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4396552f7358SJed Brown 4397552f7358SJed Brown PetscFunctionBegin; 4398552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4399552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4400552f7358SJed Brown PetscFunctionReturn(0); 4401552f7358SJed Brown } 4402552f7358SJed Brown 4403552f7358SJed Brown /******************************** FEM Support **********************************/ 4404552f7358SJed Brown 4405552f7358SJed Brown #undef __FUNCT__ 44061a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 44071a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4408a6dfd86eSKarl Rupp { 4409552f7358SJed Brown PetscScalar *array, *vArray; 4410d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 44111a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4412552f7358SJed Brown PetscErrorCode ierr; 4413552f7358SJed Brown 44141b406b76SMatthew G. Knepley PetscFunctionBeginHot; 44152a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 44165a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 44175a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 44185a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 44193f7cbbe7SMatthew G. Knepley if (!values || !*values) { 44209df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44219df71ca4SMatthew G. Knepley PetscInt dof; 4422d9917b9dSMatthew G. Knepley 44239df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44249df71ca4SMatthew G. Knepley size += dof; 44259df71ca4SMatthew G. Knepley } 44269df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44279df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44282a3aaacfSMatthew G. Knepley PetscInt dof; 44295a1bb5cfSMatthew G. Knepley 44305a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44312a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44325a1bb5cfSMatthew G. Knepley size += dof; 44335a1bb5cfSMatthew G. Knepley } 44343f7cbbe7SMatthew G. Knepley if (!values) { 44353f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 44363f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 44373f7cbbe7SMatthew G. Knepley } 44385a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4439982e9ed1SMatthew G. Knepley } else { 4440982e9ed1SMatthew G. Knepley array = *values; 4441982e9ed1SMatthew G. Knepley } 44429df71ca4SMatthew G. Knepley size = 0; 44435a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44449df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44459df71ca4SMatthew G. Knepley PetscInt dof, off, d; 44469df71ca4SMatthew G. Knepley PetscScalar *varr; 4447d9917b9dSMatthew G. Knepley 44489df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44499df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44509df71ca4SMatthew G. Knepley varr = &vArray[off]; 44511a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44521a271a75SMatthew G. Knepley array[offset] = varr[d]; 44539df71ca4SMatthew G. Knepley } 44549df71ca4SMatthew G. Knepley size += dof; 44559df71ca4SMatthew G. Knepley } 44569df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44579df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44589df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 44595a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 44605a1bb5cfSMatthew G. Knepley PetscScalar *varr; 44615a1bb5cfSMatthew G. Knepley 446252ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44635a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44645a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44655a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44665a1bb5cfSMatthew G. Knepley if (o >= 0) { 44671a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44681a271a75SMatthew G. Knepley array[offset] = varr[d]; 44695a1bb5cfSMatthew G. Knepley } 44705a1bb5cfSMatthew G. Knepley } else { 44711a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44721a271a75SMatthew G. Knepley array[offset] = varr[d]; 44735a1bb5cfSMatthew G. Knepley } 44745a1bb5cfSMatthew G. Knepley } 44759df71ca4SMatthew G. Knepley size += dof; 44765a1bb5cfSMatthew G. Knepley } 44775a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44789df71ca4SMatthew G. Knepley if (!*values) { 44795a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44805a1bb5cfSMatthew G. Knepley *values = array; 44819df71ca4SMatthew G. Knepley } else { 44829df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44838c312ff3SMatthew G. Knepley *csize = size; 44849df71ca4SMatthew G. Knepley } 44855a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44865a1bb5cfSMatthew G. Knepley } 4487d9917b9dSMatthew G. Knepley 4488d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44891a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44901a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44911a271a75SMatthew G. Knepley { 44921a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44931a271a75SMatthew G. Knepley PetscErrorCode ierr; 44941a271a75SMatthew G. Knepley 44951a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4496fe02ba77SJed Brown *size = 0; 44971a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44981a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44991a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45001a271a75SMatthew G. Knepley PetscInt dof, off, d; 45011a271a75SMatthew G. Knepley const PetscScalar *varr; 45021a271a75SMatthew G. Knepley 45031a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 45041a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 45051a271a75SMatthew G. Knepley varr = &vArray[off]; 45061a271a75SMatthew G. Knepley if (o >= 0) { 45071a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 45081a271a75SMatthew G. Knepley } else { 45091a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 45101a271a75SMatthew G. Knepley } 45111a271a75SMatthew G. Knepley } 45121a271a75SMatthew G. Knepley *size = offset; 45131a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45141a271a75SMatthew G. Knepley } 45151a271a75SMatthew G. Knepley 45161a271a75SMatthew G. Knepley #undef __FUNCT__ 45171a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 45181a271a75SMatthew 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[]) 45191a271a75SMatthew G. Knepley { 45201a271a75SMatthew G. Knepley PetscInt offset = 0, f; 45211a271a75SMatthew G. Knepley PetscErrorCode ierr; 45221a271a75SMatthew G. Knepley 45231a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4524fe02ba77SJed Brown *size = 0; 45251a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 45261a271a75SMatthew G. Knepley PetscInt fcomp, p; 45271a271a75SMatthew G. Knepley 45281a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 45291a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 45301a271a75SMatthew G. Knepley const PetscInt point = points[p]; 45311a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45321a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 45331a271a75SMatthew G. Knepley const PetscScalar *varr; 45341a271a75SMatthew G. Knepley 45351a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 45361a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45371a271a75SMatthew G. Knepley varr = &vArray[foff]; 45381a271a75SMatthew G. Knepley if (o >= 0) { 45391a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 45401a271a75SMatthew G. Knepley } else { 45411a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 45421a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 45431a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 45441a271a75SMatthew G. Knepley } 45451a271a75SMatthew G. Knepley } 45461a271a75SMatthew G. Knepley } 45471a271a75SMatthew G. Knepley } 45481a271a75SMatthew G. Knepley } 45491a271a75SMatthew G. Knepley *size = offset; 45501a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45511a271a75SMatthew G. Knepley } 45521a271a75SMatthew G. Knepley 45531a271a75SMatthew G. Knepley #undef __FUNCT__ 4554552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4555552f7358SJed Brown /*@C 4556552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4557552f7358SJed Brown 4558552f7358SJed Brown Not collective 4559552f7358SJed Brown 4560552f7358SJed Brown Input Parameters: 4561552f7358SJed Brown + dm - The DM 4562552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4563552f7358SJed Brown . v - The local vector 4564552f7358SJed Brown - point - The sieve point in the DM 4565552f7358SJed Brown 4566552f7358SJed Brown Output Parameters: 4567552f7358SJed Brown + csize - The number of values in the closure, or NULL 4568552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4569552f7358SJed Brown 4570552f7358SJed Brown Fortran Notes: 4571552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4572552f7358SJed Brown include petsc.h90 in your code. 4573552f7358SJed Brown 4574552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4575552f7358SJed Brown 4576552f7358SJed Brown Level: intermediate 4577552f7358SJed Brown 4578552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4579552f7358SJed Brown @*/ 4580552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4581552f7358SJed Brown { 4582552f7358SJed Brown PetscSection clSection; 4583d9917b9dSMatthew G. Knepley IS clPoints; 4584552f7358SJed Brown PetscScalar *array, *vArray; 4585552f7358SJed Brown PetscInt *points = NULL; 4586d9917b9dSMatthew G. Knepley const PetscInt *clp; 45871a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4588552f7358SJed Brown PetscErrorCode ierr; 4589552f7358SJed Brown 4590d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4591552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4592552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45931a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45941a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4595552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4596552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4597552f7358SJed Brown if (depth == 1 && numFields < 2) { 45981a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4599552f7358SJed Brown PetscFunctionReturn(0); 4600552f7358SJed Brown } 46011a271a75SMatthew G. Knepley /* Get points */ 4602d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4603d9917b9dSMatthew G. Knepley if (!clPoints) { 46041a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4605552f7358SJed Brown 46061a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4607552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4608552f7358SJed Brown /* Compress out points not in the section */ 4609552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4610552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4611552f7358SJed Brown points[q*2] = points[p]; 4612552f7358SJed Brown points[q*2+1] = points[p+1]; 4613552f7358SJed Brown ++q; 4614552f7358SJed Brown } 4615552f7358SJed Brown } 4616552f7358SJed Brown numPoints = q; 4617d9917b9dSMatthew G. Knepley } else { 4618d9917b9dSMatthew G. Knepley PetscInt dof, off; 4619552f7358SJed Brown 4620d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4621d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4622d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46231a271a75SMatthew G. Knepley numPoints = dof/2; 4624d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4625552f7358SJed Brown } 46261a271a75SMatthew G. Knepley /* Get array */ 4627552f7358SJed Brown if (!values || !*values) { 46281a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4629552f7358SJed Brown 46301a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4631552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 46321a271a75SMatthew G. Knepley asize += dof; 4633552f7358SJed Brown } 4634bd6c0d32SMatthew G. Knepley if (!values) { 4635d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46361a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46371a271a75SMatthew G. Knepley if (csize) *csize = asize; 4638bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4639bd6c0d32SMatthew G. Knepley } 46401a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4641d0f6b257SMatthew G. Knepley } else { 4642d0f6b257SMatthew G. Knepley array = *values; 4643d0f6b257SMatthew G. Knepley } 4644552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 46451a271a75SMatthew G. Knepley /* Get values */ 4646ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 46471a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 46481a271a75SMatthew G. Knepley /* Cleanup points */ 46491a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46501a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46511a271a75SMatthew G. Knepley /* Cleanup array */ 4652552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4653d0f6b257SMatthew G. Knepley if (!*values) { 4654552f7358SJed Brown if (csize) *csize = size; 4655552f7358SJed Brown *values = array; 4656d0f6b257SMatthew G. Knepley } else { 4657d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4658d0f6b257SMatthew G. Knepley *csize = size; 4659d0f6b257SMatthew G. Knepley } 4660552f7358SJed Brown PetscFunctionReturn(0); 4661552f7358SJed Brown } 4662552f7358SJed Brown 4663552f7358SJed Brown #undef __FUNCT__ 4664552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4665552f7358SJed Brown /*@C 4666552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4667552f7358SJed Brown 4668552f7358SJed Brown Not collective 4669552f7358SJed Brown 4670552f7358SJed Brown Input Parameters: 4671552f7358SJed Brown + dm - The DM 46720298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4673552f7358SJed Brown . v - The local vector 4674552f7358SJed Brown . point - The sieve point in the DM 46750298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4676552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4677552f7358SJed Brown 46783813dfbdSMatthew G Knepley Fortran Notes: 46793813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46803813dfbdSMatthew G Knepley include petsc.h90 in your code. 46813813dfbdSMatthew G Knepley 46823813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46833813dfbdSMatthew G Knepley 4684552f7358SJed Brown Level: intermediate 4685552f7358SJed Brown 4686552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4687552f7358SJed Brown @*/ 46887c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4689a6dfd86eSKarl Rupp { 4690552f7358SJed Brown PetscInt size = 0; 4691552f7358SJed Brown PetscErrorCode ierr; 4692552f7358SJed Brown 4693552f7358SJed Brown PetscFunctionBegin; 4694552f7358SJed Brown /* Should work without recalculating size */ 4695552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4696552f7358SJed Brown PetscFunctionReturn(0); 4697552f7358SJed Brown } 4698552f7358SJed Brown 4699552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4700552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4701552f7358SJed Brown 4702552f7358SJed Brown #undef __FUNCT__ 4703552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 47041a271a75SMatthew 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[]) 4705552f7358SJed Brown { 4706552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4707552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4708552f7358SJed Brown PetscScalar *a; 4709552f7358SJed Brown PetscInt off, cind = 0, k; 4710552f7358SJed Brown PetscErrorCode ierr; 4711552f7358SJed Brown 4712552f7358SJed Brown PetscFunctionBegin; 4713552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4714552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4715552f7358SJed Brown a = &array[off]; 4716552f7358SJed Brown if (!cdof || setBC) { 4717552f7358SJed Brown if (orientation >= 0) { 4718552f7358SJed Brown for (k = 0; k < dof; ++k) { 4719552f7358SJed Brown fuse(&a[k], values[k]); 4720552f7358SJed Brown } 4721552f7358SJed Brown } else { 4722552f7358SJed Brown for (k = 0; k < dof; ++k) { 4723552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4724552f7358SJed Brown } 4725552f7358SJed Brown } 4726552f7358SJed Brown } else { 4727552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4728552f7358SJed Brown if (orientation >= 0) { 4729552f7358SJed Brown for (k = 0; k < dof; ++k) { 4730552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4731552f7358SJed Brown fuse(&a[k], values[k]); 4732552f7358SJed Brown } 4733552f7358SJed Brown } else { 4734552f7358SJed Brown for (k = 0; k < dof; ++k) { 4735552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4736552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4737552f7358SJed Brown } 4738552f7358SJed Brown } 4739552f7358SJed Brown } 4740552f7358SJed Brown PetscFunctionReturn(0); 4741552f7358SJed Brown } 4742552f7358SJed Brown 4743552f7358SJed Brown #undef __FUNCT__ 4744a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 47451a271a75SMatthew 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[]) 4746a5e93ea8SMatthew G. Knepley { 4747a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4748a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4749a5e93ea8SMatthew G. Knepley PetscScalar *a; 4750a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4751a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4752a5e93ea8SMatthew G. Knepley 4753a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4754a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4755a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4756a5e93ea8SMatthew G. Knepley a = &array[off]; 4757a5e93ea8SMatthew G. Knepley if (cdof) { 4758a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4759a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4760a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4761a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4762a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4763a5e93ea8SMatthew G. Knepley ++cind; 4764a5e93ea8SMatthew G. Knepley } 4765a5e93ea8SMatthew G. Knepley } 4766a5e93ea8SMatthew G. Knepley } else { 4767a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4768a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4769a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4770a5e93ea8SMatthew G. Knepley ++cind; 4771a5e93ea8SMatthew G. Knepley } 4772a5e93ea8SMatthew G. Knepley } 4773a5e93ea8SMatthew G. Knepley } 4774a5e93ea8SMatthew G. Knepley } 4775a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4776a5e93ea8SMatthew G. Knepley } 4777a5e93ea8SMatthew G. Knepley 4778a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4779552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47801a271a75SMatthew 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[]) 4781a6dfd86eSKarl Rupp { 4782552f7358SJed Brown PetscScalar *a; 47831a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47841a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47851a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4786552f7358SJed Brown PetscErrorCode ierr; 4787552f7358SJed Brown 4788552f7358SJed Brown PetscFunctionBegin; 4789552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4790552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47911a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47921a271a75SMatthew G. Knepley a = &array[foff]; 4793552f7358SJed Brown if (!fcdof || setBC) { 47941a271a75SMatthew G. Knepley if (o >= 0) { 47951a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4796552f7358SJed Brown } else { 4797552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4798552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47991a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4800552f7358SJed Brown } 4801552f7358SJed Brown } 4802552f7358SJed Brown } 4803552f7358SJed Brown } else { 4804552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 48051a271a75SMatthew G. Knepley if (o >= 0) { 4806552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4807552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 48081a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4809552f7358SJed Brown } 4810552f7358SJed Brown } else { 4811552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4812552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4813552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 48141a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4815552f7358SJed Brown } 4816552f7358SJed Brown } 4817552f7358SJed Brown } 4818552f7358SJed Brown } 48191a271a75SMatthew G. Knepley *offset += fdof; 4820552f7358SJed Brown PetscFunctionReturn(0); 4821552f7358SJed Brown } 4822552f7358SJed Brown 4823552f7358SJed Brown #undef __FUNCT__ 4824a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 48251a271a75SMatthew 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[]) 4826a5e93ea8SMatthew G. Knepley { 4827a5e93ea8SMatthew G. Knepley PetscScalar *a; 48281a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 48291a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 48301a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4831a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4832a5e93ea8SMatthew G. Knepley 4833a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4834a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4835a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 48361a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 48371a271a75SMatthew G. Knepley a = &array[foff]; 4838a5e93ea8SMatthew G. Knepley if (fcdof) { 4839a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 48401a271a75SMatthew G. Knepley if (o >= 0) { 4841a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4842a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 48431a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4844a5e93ea8SMatthew G. Knepley ++cind; 4845a5e93ea8SMatthew G. Knepley } 4846a5e93ea8SMatthew G. Knepley } 4847a5e93ea8SMatthew G. Knepley } else { 4848a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4849a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4850a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 48511a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4852a5e93ea8SMatthew G. Knepley ++cind; 4853a5e93ea8SMatthew G. Knepley } 4854a5e93ea8SMatthew G. Knepley } 4855a5e93ea8SMatthew G. Knepley } 4856a5e93ea8SMatthew G. Knepley } 4857a5e93ea8SMatthew G. Knepley } 48581a271a75SMatthew G. Knepley *offset += fdof; 4859a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4860a5e93ea8SMatthew G. Knepley } 4861a5e93ea8SMatthew G. Knepley 4862a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48631b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48641a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4865a6dfd86eSKarl Rupp { 4866552f7358SJed Brown PetscScalar *array; 48671b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48681b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4869552f7358SJed Brown PetscErrorCode ierr; 4870552f7358SJed Brown 48711b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4872b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4873b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4874b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4875b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4876b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4877b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4878b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4879b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4880b6ebb6e6SMatthew G. Knepley 4881b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4882b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4883b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4884b6ebb6e6SMatthew G. Knepley { 4885b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4886b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4887b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4888b6ebb6e6SMatthew G. Knepley 4889b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4890b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4891b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4892b6ebb6e6SMatthew G. Knepley if (!cdof) { 4893b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4894b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4895b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4896b6ebb6e6SMatthew G. Knepley } 4897b6ebb6e6SMatthew G. Knepley } else { 4898b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4899b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4900b6ebb6e6SMatthew G. Knepley } 4901b6ebb6e6SMatthew G. Knepley } 4902b6ebb6e6SMatthew G. Knepley } else { 4903b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4904b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4905b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4906b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4907b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4908b6ebb6e6SMatthew G. Knepley } 4909b6ebb6e6SMatthew G. Knepley } else { 4910b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4911b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4912b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4913b6ebb6e6SMatthew G. Knepley } 4914b6ebb6e6SMatthew G. Knepley } 4915b6ebb6e6SMatthew G. Knepley } 4916b6ebb6e6SMatthew G. Knepley } 4917b6ebb6e6SMatthew G. Knepley } 4918b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4919b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4920b6ebb6e6SMatthew G. Knepley } 49211b406b76SMatthew G. Knepley 49221b406b76SMatthew G. Knepley #undef __FUNCT__ 49231b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 49241b406b76SMatthew G. Knepley /*@C 49251b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 49261b406b76SMatthew G. Knepley 49271b406b76SMatthew G. Knepley Not collective 49281b406b76SMatthew G. Knepley 49291b406b76SMatthew G. Knepley Input Parameters: 49301b406b76SMatthew G. Knepley + dm - The DM 49311b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 49321b406b76SMatthew G. Knepley . v - The local vector 49331b406b76SMatthew G. Knepley . point - The sieve point in the DM 49341b406b76SMatthew G. Knepley . values - The array of values 49351b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 49361b406b76SMatthew G. Knepley 49371b406b76SMatthew G. Knepley Fortran Notes: 49381b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 49391b406b76SMatthew G. Knepley 49401b406b76SMatthew G. Knepley Level: intermediate 49411b406b76SMatthew G. Knepley 49421b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 49431b406b76SMatthew G. Knepley @*/ 49441b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 49451b406b76SMatthew G. Knepley { 49461b406b76SMatthew G. Knepley PetscSection clSection; 49471b406b76SMatthew G. Knepley IS clPoints; 49481b406b76SMatthew G. Knepley PetscScalar *array; 49491b406b76SMatthew G. Knepley PetscInt *points = NULL; 49501b406b76SMatthew G. Knepley const PetscInt *clp; 49511a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 49521b406b76SMatthew G. Knepley PetscErrorCode ierr; 49531b406b76SMatthew G. Knepley 49541a271a75SMatthew G. Knepley PetscFunctionBeginHot; 49551b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49561b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 49571a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 49581a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 49591b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49601b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49611b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 49621a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49631b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49641b406b76SMatthew G. Knepley } 49651a271a75SMatthew G. Knepley /* Get points */ 49661b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49671b406b76SMatthew G. Knepley if (!clPoints) { 49681a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49691a271a75SMatthew G. Knepley 49701a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4971552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4972552f7358SJed Brown /* Compress out points not in the section */ 4973552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4974552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4975552f7358SJed Brown points[q*2] = points[p]; 4976552f7358SJed Brown points[q*2+1] = points[p+1]; 4977552f7358SJed Brown ++q; 4978552f7358SJed Brown } 4979552f7358SJed Brown } 4980552f7358SJed Brown numPoints = q; 49811b406b76SMatthew G. Knepley } else { 49821b406b76SMatthew G. Knepley PetscInt dof, off; 4983552f7358SJed Brown 49841b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49851b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49861b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49871a271a75SMatthew G. Knepley numPoints = dof/2; 49881b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4989552f7358SJed Brown } 49901a271a75SMatthew G. Knepley /* Get array */ 4991552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49921a271a75SMatthew G. Knepley /* Get values */ 4993ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49941a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4995552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49961a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4997552f7358SJed Brown switch (mode) { 4998552f7358SJed Brown case INSERT_VALUES: 4999552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50001a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50011a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50021a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5003552f7358SJed Brown } break; 5004552f7358SJed Brown case INSERT_ALL_VALUES: 5005552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50061a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50071a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50081a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5009552f7358SJed Brown } break; 5010a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5011a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50121a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50131a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50141a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5015a5e93ea8SMatthew G. Knepley } break; 5016552f7358SJed Brown case ADD_VALUES: 5017552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50181a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50191a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50201a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5021552f7358SJed Brown } break; 5022552f7358SJed Brown case ADD_ALL_VALUES: 5023552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50241a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50251a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50261a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5027552f7358SJed Brown } break; 5028552f7358SJed Brown default: 502982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5030552f7358SJed Brown } 50311a271a75SMatthew G. Knepley } 5032552f7358SJed Brown } else { 50331a271a75SMatthew G. Knepley PetscInt dof, off; 50341a271a75SMatthew G. Knepley 5035552f7358SJed Brown switch (mode) { 5036552f7358SJed Brown case INSERT_VALUES: 5037552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5038552f7358SJed Brown PetscInt o = points[p+1]; 5039552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5040552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5041552f7358SJed Brown } break; 5042552f7358SJed Brown case INSERT_ALL_VALUES: 5043552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5044552f7358SJed Brown PetscInt o = points[p+1]; 5045552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5046552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5047552f7358SJed Brown } break; 5048a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5049a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5050a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5051a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5052a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5053a5e93ea8SMatthew G. Knepley } break; 5054552f7358SJed Brown case ADD_VALUES: 5055552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5056552f7358SJed Brown PetscInt o = points[p+1]; 5057552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5058552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5059552f7358SJed Brown } break; 5060552f7358SJed Brown case ADD_ALL_VALUES: 5061552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5062552f7358SJed Brown PetscInt o = points[p+1]; 5063552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5064552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5065552f7358SJed Brown } break; 5066552f7358SJed Brown default: 506782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5068552f7358SJed Brown } 5069552f7358SJed Brown } 50701a271a75SMatthew G. Knepley /* Cleanup points */ 50711a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50721a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50731a271a75SMatthew G. Knepley /* Cleanup array */ 5074552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5075552f7358SJed Brown PetscFunctionReturn(0); 5076552f7358SJed Brown } 5077552f7358SJed Brown 5078552f7358SJed Brown #undef __FUNCT__ 5079e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5080e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5081e07394fbSMatthew G. Knepley { 5082e07394fbSMatthew G. Knepley PetscSection clSection; 5083e07394fbSMatthew G. Knepley IS clPoints; 5084e07394fbSMatthew G. Knepley PetscScalar *array; 5085e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5086e07394fbSMatthew G. Knepley const PetscInt *clp; 5087e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5088e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5089e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5090e07394fbSMatthew G. Knepley 5091e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5092e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5093e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5094e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5095e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5096e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5097e07394fbSMatthew G. Knepley /* Get points */ 5098e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5099e07394fbSMatthew G. Knepley if (!clPoints) { 5100e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5101e07394fbSMatthew G. Knepley 5102e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5103e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5104e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5105e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5106e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5107e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5108e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5109e07394fbSMatthew G. Knepley ++q; 5110e07394fbSMatthew G. Knepley } 5111e07394fbSMatthew G. Knepley } 5112e07394fbSMatthew G. Knepley numPoints = q; 5113e07394fbSMatthew G. Knepley } else { 5114e07394fbSMatthew G. Knepley PetscInt dof, off; 5115e07394fbSMatthew G. Knepley 5116e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5117e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5118e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5119e07394fbSMatthew G. Knepley numPoints = dof/2; 5120e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5121e07394fbSMatthew G. Knepley } 5122e07394fbSMatthew G. Knepley /* Get array */ 5123e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5124e07394fbSMatthew G. Knepley /* Get values */ 5125e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5126e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5127e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5128e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5129e07394fbSMatthew G. Knepley PetscInt fdof; 5130e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5131e07394fbSMatthew G. Knepley offset += fdof; 5132e07394fbSMatthew G. Knepley } 5133e07394fbSMatthew G. Knepley continue; 5134e07394fbSMatthew G. Knepley } 5135e07394fbSMatthew G. Knepley switch (mode) { 5136e07394fbSMatthew G. Knepley case INSERT_VALUES: 5137e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5138e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5139e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5140e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5141e07394fbSMatthew G. Knepley } break; 5142e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5143e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5144e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5145e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5146e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5147e07394fbSMatthew G. Knepley } break; 5148e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5149e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5150e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5151e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5152e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5153e07394fbSMatthew G. Knepley } break; 5154e07394fbSMatthew G. Knepley case ADD_VALUES: 5155e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5156e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5157e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5158e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5159e07394fbSMatthew G. Knepley } break; 5160e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5161e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5162e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5163e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5164e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5165e07394fbSMatthew G. Knepley } break; 5166e07394fbSMatthew G. Knepley default: 5167e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5168e07394fbSMatthew G. Knepley } 5169e07394fbSMatthew G. Knepley } 5170e07394fbSMatthew G. Knepley /* Cleanup points */ 5171e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5172e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5173e07394fbSMatthew G. Knepley /* Cleanup array */ 5174e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5175e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5176e07394fbSMatthew G. Knepley } 5177e07394fbSMatthew G. Knepley 5178e07394fbSMatthew G. Knepley #undef __FUNCT__ 5179552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5180b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5181552f7358SJed Brown { 5182552f7358SJed Brown PetscMPIInt rank; 5183552f7358SJed Brown PetscInt i, j; 5184552f7358SJed Brown PetscErrorCode ierr; 5185552f7358SJed Brown 5186552f7358SJed Brown PetscFunctionBegin; 518782f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 518877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5189b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5190b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5191b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5192b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 519377a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5194b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5195519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51967eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5197552f7358SJed Brown #else 5198b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5199552f7358SJed Brown #endif 5200552f7358SJed Brown } 520177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5202552f7358SJed Brown } 5203552f7358SJed Brown PetscFunctionReturn(0); 5204552f7358SJed Brown } 5205552f7358SJed Brown 5206552f7358SJed Brown #undef __FUNCT__ 5207552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5208552f7358SJed Brown /* . off - The global offset of this point */ 5209e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5210a6dfd86eSKarl Rupp { 5211e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5212552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5213552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5214552f7358SJed Brown PetscInt cind = 0, k; 5215552f7358SJed Brown PetscErrorCode ierr; 5216552f7358SJed Brown 5217552f7358SJed Brown PetscFunctionBegin; 5218552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5219552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5220552f7358SJed Brown if (!cdof || setBC) { 5221552f7358SJed Brown if (orientation >= 0) { 5222e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5223552f7358SJed Brown } else { 5224e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5225552f7358SJed Brown } 5226552f7358SJed Brown } else { 5227552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5228552f7358SJed Brown if (orientation >= 0) { 5229552f7358SJed Brown for (k = 0; k < dof; ++k) { 5230552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5231552f7358SJed Brown /* Insert check for returning constrained indices */ 5232e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5233552f7358SJed Brown ++cind; 5234552f7358SJed Brown } else { 5235e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5236552f7358SJed Brown } 5237552f7358SJed Brown } 5238552f7358SJed Brown } else { 5239552f7358SJed Brown for (k = 0; k < dof; ++k) { 5240552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5241552f7358SJed Brown /* Insert check for returning constrained indices */ 5242e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5243552f7358SJed Brown ++cind; 5244552f7358SJed Brown } else { 5245e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5246552f7358SJed Brown } 5247552f7358SJed Brown } 5248552f7358SJed Brown } 5249552f7358SJed Brown } 5250e6ccafaeSMatthew G Knepley *loff += dof; 5251552f7358SJed Brown PetscFunctionReturn(0); 5252552f7358SJed Brown } 5253552f7358SJed Brown 5254552f7358SJed Brown #undef __FUNCT__ 5255552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5256552f7358SJed Brown /* . off - The global offset of this point */ 5257a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5258a6dfd86eSKarl Rupp { 5259552f7358SJed Brown PetscInt numFields, foff, f; 5260552f7358SJed Brown PetscErrorCode ierr; 5261552f7358SJed Brown 5262552f7358SJed Brown PetscFunctionBegin; 5263552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5264552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5265552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5266552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5267552f7358SJed Brown PetscInt cind = 0, k, c; 5268552f7358SJed Brown 5269552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5270552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5271552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5272552f7358SJed Brown if (!cfdof || setBC) { 5273552f7358SJed Brown if (orientation >= 0) { 52740d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5275552f7358SJed Brown } else { 5276552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5277552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5278552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5279552f7358SJed Brown } 5280552f7358SJed Brown } 5281552f7358SJed Brown } 5282552f7358SJed Brown } else { 5283552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5284552f7358SJed Brown if (orientation >= 0) { 5285552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5286552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5287552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5288552f7358SJed Brown ++cind; 5289552f7358SJed Brown } else { 5290552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5291552f7358SJed Brown } 5292552f7358SJed Brown } 5293552f7358SJed Brown } else { 5294552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5295552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5296552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5297552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5298552f7358SJed Brown ++cind; 5299552f7358SJed Brown } else { 5300552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5301552f7358SJed Brown } 5302552f7358SJed Brown } 5303552f7358SJed Brown } 5304552f7358SJed Brown } 5305552f7358SJed Brown } 5306552f7358SJed Brown foff += fdof - cfdof; 5307552f7358SJed Brown foffs[f] += fdof; 5308552f7358SJed Brown } 5309552f7358SJed Brown PetscFunctionReturn(0); 5310552f7358SJed Brown } 5311552f7358SJed Brown 5312552f7358SJed Brown #undef __FUNCT__ 5313f7c74593SToby Isaac #define __FUNCT__ "DMPlexAnchorsModifyMat" 5314f7c74593SToby 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[]) 5315d3d1a6afSToby Isaac { 5316d3d1a6afSToby Isaac Mat cMat; 5317d3d1a6afSToby Isaac PetscSection aSec, cSec; 5318d3d1a6afSToby Isaac IS aIS; 5319d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 5320d3d1a6afSToby Isaac const PetscInt *anchors; 5321e17c06e0SMatthew G. Knepley PetscInt numFields, f, p, q, newP = 0; 5322d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 5323d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 5324d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 5325d3d1a6afSToby Isaac PetscInt newOffsets[32]; 5326d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 5327d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 5328d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 5329d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 5330d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 5331d3d1a6afSToby Isaac PetscErrorCode ierr; 5332d3d1a6afSToby Isaac 5333d3d1a6afSToby Isaac PetscFunctionBegin; 5334d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5335d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5336d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5337d3d1a6afSToby Isaac 5338a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 5339d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 5340d3d1a6afSToby Isaac if (aSec) { 5341d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5342d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 5343d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 5344d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 5345d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 5346d3d1a6afSToby Isaac * into the global matrix anyway) */ 5347d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 5348d3d1a6afSToby Isaac PetscInt b = points[p]; 5349d3d1a6afSToby Isaac PetscInt bDof = 0; 5350d3d1a6afSToby Isaac 5351d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5352d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 5353d3d1a6afSToby Isaac } 5354d3d1a6afSToby Isaac if (bDof) { 5355d3d1a6afSToby Isaac /* this point is constrained */ 5356d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 5357d3d1a6afSToby Isaac PetscInt bOff, q; 5358d3d1a6afSToby Isaac 5359d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 5360d3d1a6afSToby Isaac newNumPoints += bDof; 5361d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 5362d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5363d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 5364d3d1a6afSToby Isaac PetscInt aDof; 5365d3d1a6afSToby Isaac 5366d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 5367d3d1a6afSToby Isaac newNumIndices += aDof; 5368d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 5369d3d1a6afSToby Isaac PetscInt fDof; 5370d3d1a6afSToby Isaac 5371d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 5372d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 5373d3d1a6afSToby Isaac } 5374d3d1a6afSToby Isaac } 5375d3d1a6afSToby Isaac } 5376d3d1a6afSToby Isaac else { 5377d3d1a6afSToby Isaac /* this point is not constrained */ 5378d3d1a6afSToby Isaac newNumPoints++; 5379d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 5380d3d1a6afSToby Isaac newNumIndices += bDof; 5381d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 5382d3d1a6afSToby Isaac PetscInt fDof; 5383d3d1a6afSToby Isaac 5384d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5385d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 5386d3d1a6afSToby Isaac } 5387d3d1a6afSToby Isaac } 5388d3d1a6afSToby Isaac } 5389d3d1a6afSToby Isaac } 5390d3d1a6afSToby Isaac if (!anyConstrained) { 5391d3d1a6afSToby Isaac *outNumPoints = 0; 5392d3d1a6afSToby Isaac *outNumIndices = 0; 5393d3d1a6afSToby Isaac *outPoints = NULL; 5394d3d1a6afSToby Isaac *outValues = NULL; 5395d3d1a6afSToby Isaac if (aSec) { 5396d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 5397d3d1a6afSToby Isaac } 5398d3d1a6afSToby Isaac PetscFunctionReturn(0); 5399d3d1a6afSToby Isaac } 5400d3d1a6afSToby Isaac 5401d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 5402d3d1a6afSToby Isaac 5403d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 5404d3d1a6afSToby Isaac 5405f7c74593SToby Isaac ierr = DMGetDefaultConstraints(dm, &cSec, &cMat);CHKERRQ(ierr); 5406d3d1a6afSToby Isaac 5407d3d1a6afSToby Isaac /* output arrays */ 5408d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 5409d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 5410d3d1a6afSToby Isaac 5411d3d1a6afSToby Isaac /* workspaces */ 5412d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 5413d3d1a6afSToby Isaac if (numFields) { 5414d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5415d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 5416d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 5417d3d1a6afSToby Isaac } 5418d3d1a6afSToby Isaac } 5419d3d1a6afSToby Isaac else { 5420d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 5421d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 5422d3d1a6afSToby Isaac } 5423d3d1a6afSToby Isaac 5424d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 5425d3d1a6afSToby Isaac if (numFields) { 5426d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5427d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5428d3d1a6afSToby Isaac PetscInt bDof = 0; 5429d3d1a6afSToby Isaac 5430d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5431d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5432d3d1a6afSToby Isaac } 5433d3d1a6afSToby Isaac if (bDof) { 5434d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5435d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 5436d3d1a6afSToby Isaac 5437d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5438d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 5439d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5440d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 5441d3d1a6afSToby Isaac PetscInt aFDof; 5442d3d1a6afSToby Isaac 5443d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 5444d3d1a6afSToby Isaac allFDof += aFDof; 5445d3d1a6afSToby Isaac } 5446d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 5447d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 5448d3d1a6afSToby Isaac } 5449d3d1a6afSToby Isaac } 5450d3d1a6afSToby Isaac else { 5451d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5452d3d1a6afSToby Isaac PetscInt fDof; 5453d3d1a6afSToby Isaac 5454d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5455d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 5456d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 5457d3d1a6afSToby Isaac } 5458d3d1a6afSToby Isaac } 5459d3d1a6afSToby Isaac } 5460d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5461d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 5462d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 5463d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5464d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 5465d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 5466d3d1a6afSToby Isaac } 5467d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 5468d3d1a6afSToby Isaac } 5469d3d1a6afSToby Isaac } 5470d3d1a6afSToby Isaac else { 5471d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5472d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5473d3d1a6afSToby Isaac PetscInt bDof = 0; 5474d3d1a6afSToby Isaac 5475d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5476d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5477d3d1a6afSToby Isaac } 5478d3d1a6afSToby Isaac if (bDof) { 5479d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 5480d3d1a6afSToby Isaac 5481d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 5482d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 5483d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5484d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 5485d3d1a6afSToby Isaac 5486d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 5487d3d1a6afSToby Isaac allDof += aDof; 5488d3d1a6afSToby Isaac } 5489d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 5490d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 5491d3d1a6afSToby Isaac } 5492d3d1a6afSToby Isaac else { 5493d3d1a6afSToby Isaac PetscInt dof; 5494d3d1a6afSToby Isaac 5495d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 5496d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 5497d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 5498d3d1a6afSToby Isaac } 5499d3d1a6afSToby Isaac } 5500d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 5501d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 5502d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5503d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 5504d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 5505d3d1a6afSToby Isaac } 5506d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 5507d3d1a6afSToby Isaac } 5508d3d1a6afSToby Isaac 5509d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 5510d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 5511d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 5512d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 5513d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 5514d3d1a6afSToby Isaac if (numFields) { 5515d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 5516d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5517d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 5518d3d1a6afSToby Isaac PetscInt bDof = 0; 5519d3d1a6afSToby Isaac 5520d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5521d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5522d3d1a6afSToby Isaac } 5523d3d1a6afSToby Isaac if (bDof) { 5524d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 5525d3d1a6afSToby Isaac 5526d3d1a6afSToby Isaac fStart[0] = 0; 5527d3d1a6afSToby Isaac fEnd[0] = 0; 5528d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5529d3d1a6afSToby Isaac PetscInt fDof; 5530d3d1a6afSToby Isaac 5531d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 5532d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 5533d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 5534d3d1a6afSToby Isaac } 5535d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 5536d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 5537d3d1a6afSToby Isaac 5538d3d1a6afSToby Isaac fAnchorStart[0] = 0; 5539d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 5540d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5541d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 5542d3d1a6afSToby Isaac 5543d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 5544d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 5545d3d1a6afSToby Isaac } 5546d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 5547d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5548d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 5549d3d1a6afSToby Isaac 5550d3d1a6afSToby 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 */ 5551d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 5552d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 5553d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 5554d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 5555d3d1a6afSToby Isaac } 5556d3d1a6afSToby Isaac newP += bDof; 5557d3d1a6afSToby Isaac 5558d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 5559d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5560d3d1a6afSToby 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); 5561d3d1a6afSToby Isaac } 5562d3d1a6afSToby Isaac } 5563d3d1a6afSToby Isaac else { 5564d3d1a6afSToby Isaac newPoints[2 * newP] = b; 5565d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 5566d3d1a6afSToby Isaac newP++; 5567d3d1a6afSToby Isaac } 5568d3d1a6afSToby Isaac } 5569d3d1a6afSToby Isaac } else { 5570d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5571d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5572d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 5573d3d1a6afSToby Isaac PetscInt bDof = 0; 5574d3d1a6afSToby Isaac 5575d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5576d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5577d3d1a6afSToby Isaac } 5578d3d1a6afSToby Isaac if (bDof) { 5579d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 5580d3d1a6afSToby Isaac 5581d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 5582d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 5583d3d1a6afSToby Isaac 5584d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 5585d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5586d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 5587d3d1a6afSToby Isaac 5588d3d1a6afSToby 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 */ 5589d3d1a6afSToby Isaac 5590d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 5591d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 5592d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 5593d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 5594d3d1a6afSToby Isaac } 5595d3d1a6afSToby Isaac newP += bDof; 5596d3d1a6afSToby Isaac 5597d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 5598d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 5599d3d1a6afSToby Isaac } 5600d3d1a6afSToby Isaac else { 5601d3d1a6afSToby Isaac newPoints[2 * newP] = b; 5602d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 5603d3d1a6afSToby Isaac newP++; 5604d3d1a6afSToby Isaac } 5605d3d1a6afSToby Isaac } 5606d3d1a6afSToby Isaac } 5607d3d1a6afSToby Isaac 5608d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 5609d3d1a6afSToby Isaac /* multiply constraints on the right */ 5610d3d1a6afSToby Isaac if (numFields) { 5611d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5612d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 5613d3d1a6afSToby Isaac 5614d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5615d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 5616d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5617d3d1a6afSToby Isaac PetscInt c, r, k; 5618d3d1a6afSToby Isaac PetscInt dof; 5619d3d1a6afSToby Isaac 5620d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 5621d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 5622d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 5623d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 5624d3d1a6afSToby Isaac 5625d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5626d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 5627d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5628d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 5629d3d1a6afSToby Isaac } 5630d3d1a6afSToby Isaac } 5631d3d1a6afSToby Isaac } 5632d3d1a6afSToby Isaac } 5633d3d1a6afSToby Isaac else { 5634d3d1a6afSToby Isaac /* copy this column as is */ 5635d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5636d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 5637d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 5638d3d1a6afSToby Isaac } 5639d3d1a6afSToby Isaac } 5640d3d1a6afSToby Isaac } 5641d3d1a6afSToby Isaac oldOff += dof; 5642d3d1a6afSToby Isaac } 5643d3d1a6afSToby Isaac } 5644d3d1a6afSToby Isaac } 5645d3d1a6afSToby Isaac else { 5646d3d1a6afSToby Isaac PetscInt oldOff = 0; 5647d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5648d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 5649d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5650d3d1a6afSToby Isaac PetscInt c, r, k; 5651d3d1a6afSToby Isaac PetscInt dof; 5652d3d1a6afSToby Isaac 5653d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 5654d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 5655d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 5656d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 5657d3d1a6afSToby Isaac 5658d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5659d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 5660d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5661d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 5662d3d1a6afSToby Isaac } 5663d3d1a6afSToby Isaac } 5664d3d1a6afSToby Isaac } 5665d3d1a6afSToby Isaac } 5666d3d1a6afSToby Isaac else { 5667d3d1a6afSToby Isaac /* copy this column as is */ 5668d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5669d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 5670d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 5671d3d1a6afSToby Isaac } 5672d3d1a6afSToby Isaac } 5673d3d1a6afSToby Isaac } 5674d3d1a6afSToby Isaac oldOff += dof; 5675d3d1a6afSToby Isaac } 5676d3d1a6afSToby Isaac } 5677d3d1a6afSToby Isaac 5678d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 5679d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 5680d3d1a6afSToby Isaac if (numFields) { 5681d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5682d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 5683d3d1a6afSToby Isaac 5684d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5685d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 5686d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5687d3d1a6afSToby Isaac PetscInt c, r, k; 5688d3d1a6afSToby Isaac PetscInt dof; 5689d3d1a6afSToby Isaac 5690d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 5691d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 5692d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 5693d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 5694d3d1a6afSToby Isaac 5695d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 5696d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5697d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5698d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 5699d3d1a6afSToby Isaac } 5700d3d1a6afSToby Isaac } 5701d3d1a6afSToby Isaac } 5702d3d1a6afSToby Isaac } 5703d3d1a6afSToby Isaac else { 5704d3d1a6afSToby Isaac /* copy this row as is */ 5705d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 5706d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5707d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 5708d3d1a6afSToby Isaac } 5709d3d1a6afSToby Isaac } 5710d3d1a6afSToby Isaac } 5711d3d1a6afSToby Isaac oldOff += dof; 5712d3d1a6afSToby Isaac } 5713d3d1a6afSToby Isaac } 5714d3d1a6afSToby Isaac } 5715d3d1a6afSToby Isaac else { 5716d3d1a6afSToby Isaac PetscInt oldOff = 0; 5717d3d1a6afSToby Isaac 5718d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5719d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 5720d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5721d3d1a6afSToby Isaac PetscInt c, r, k; 5722d3d1a6afSToby Isaac PetscInt dof; 5723d3d1a6afSToby Isaac 5724d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 5725d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 5726d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 5727d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 5728d3d1a6afSToby Isaac 5729d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 5730d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5731d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5732d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 5733d3d1a6afSToby Isaac } 5734d3d1a6afSToby Isaac } 5735d3d1a6afSToby Isaac } 5736d3d1a6afSToby Isaac } 5737d3d1a6afSToby Isaac else { 5738d3d1a6afSToby Isaac /* copy this row as is */ 5739d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 5740d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5741d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 5742d3d1a6afSToby Isaac } 5743d3d1a6afSToby Isaac } 5744d3d1a6afSToby Isaac } 5745d3d1a6afSToby Isaac oldOff += dof; 5746d3d1a6afSToby Isaac } 5747d3d1a6afSToby Isaac } 5748d3d1a6afSToby Isaac 5749d3d1a6afSToby Isaac /* clean up */ 5750d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 5751d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 5752d3d1a6afSToby Isaac if (numFields) { 5753d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5754d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 5755d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 5756d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 5757d3d1a6afSToby Isaac } 5758d3d1a6afSToby Isaac } 5759d3d1a6afSToby Isaac else { 5760d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 5761d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 5762d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 5763d3d1a6afSToby Isaac } 5764d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 5765d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 5766d3d1a6afSToby Isaac 5767d3d1a6afSToby Isaac /* output */ 5768d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 5769d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 5770d3d1a6afSToby Isaac *outPoints = newPoints; 5771d3d1a6afSToby Isaac *outValues = newValues; 5772d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5773d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 5774d3d1a6afSToby Isaac } 5775d3d1a6afSToby Isaac PetscFunctionReturn(0); 5776d3d1a6afSToby Isaac } 5777d3d1a6afSToby Isaac 5778d3d1a6afSToby Isaac #undef __FUNCT__ 5779552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 57807f5d1fdeSMatthew G. Knepley /*@C 57817f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 57827f5d1fdeSMatthew G. Knepley 57837f5d1fdeSMatthew G. Knepley Not collective 57847f5d1fdeSMatthew G. Knepley 57857f5d1fdeSMatthew G. Knepley Input Parameters: 57867f5d1fdeSMatthew G. Knepley + dm - The DM 5787ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5788ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 57897f5d1fdeSMatthew G. Knepley . A - The matrix 57907f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 57917f5d1fdeSMatthew G. Knepley . values - The array of values 57927f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 57937f5d1fdeSMatthew G. Knepley 57947f5d1fdeSMatthew G. Knepley Fortran Notes: 57957f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 57967f5d1fdeSMatthew G. Knepley 57977f5d1fdeSMatthew G. Knepley Level: intermediate 57987f5d1fdeSMatthew G. Knepley 57997f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 58007f5d1fdeSMatthew G. Knepley @*/ 58017c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5802552f7358SJed Brown { 5803552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 58041b406b76SMatthew G. Knepley PetscSection clSection; 58051b406b76SMatthew G. Knepley IS clPoints; 5806d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 58071b406b76SMatthew G. Knepley const PetscInt *clp; 5808552f7358SJed Brown PetscInt *indices; 5809552f7358SJed Brown PetscInt offsets[32]; 5810d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5811d3d1a6afSToby Isaac PetscScalar *newValues; 5812552f7358SJed Brown PetscErrorCode ierr; 5813552f7358SJed Brown 5814552f7358SJed Brown PetscFunctionBegin; 5815552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5816ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 58173dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5818ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 58193dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58203dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5821552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 582282f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5823552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 58241b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 58251b406b76SMatthew G. Knepley if (!clPoints) { 5826552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5827552f7358SJed Brown /* Compress out points not in the section */ 5828552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5829552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5830552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5831552f7358SJed Brown points[q*2] = points[p]; 5832552f7358SJed Brown points[q*2+1] = points[p+1]; 5833552f7358SJed Brown ++q; 5834552f7358SJed Brown } 5835552f7358SJed Brown } 5836552f7358SJed Brown numPoints = q; 58371b406b76SMatthew G. Knepley } else { 58381b406b76SMatthew G. Knepley PetscInt dof, off; 58391b406b76SMatthew G. Knepley 58401b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 58411b406b76SMatthew G. Knepley numPoints = dof/2; 58421b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 58431b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 58441b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 58451b406b76SMatthew G. Knepley } 5846552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5847552f7358SJed Brown PetscInt fdof; 5848552f7358SJed Brown 5849552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5850552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5851552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5852552f7358SJed Brown offsets[f+1] += fdof; 5853552f7358SJed Brown } 5854552f7358SJed Brown numIndices += dof; 5855552f7358SJed Brown } 58560d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58570d644c17SKarl Rupp 585882f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5859f7c74593SToby Isaac ierr = DMPlexAnchorsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 5860d3d1a6afSToby Isaac if (newNumPoints) { 5861d3d1a6afSToby Isaac if (!clPoints) { 5862d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5863d3d1a6afSToby Isaac } else { 5864d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 5865d3d1a6afSToby Isaac } 5866d3d1a6afSToby Isaac numPoints = newNumPoints; 5867d3d1a6afSToby Isaac numIndices = newNumIndices; 5868d3d1a6afSToby Isaac points = newPoints; 5869d3d1a6afSToby Isaac values = newValues; 5870d3d1a6afSToby Isaac } 5871552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5872552f7358SJed Brown if (numFields) { 5873552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5874552f7358SJed Brown PetscInt o = points[p+1]; 5875552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5876552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5877552f7358SJed Brown } 5878552f7358SJed Brown } else { 5879e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5880552f7358SJed Brown PetscInt o = points[p+1]; 5881552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5882e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5883552f7358SJed Brown } 5884552f7358SJed Brown } 5885b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5886552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5887552f7358SJed Brown if (ierr) { 5888552f7358SJed Brown PetscMPIInt rank; 5889552f7358SJed Brown PetscErrorCode ierr2; 5890552f7358SJed Brown 589182f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 589277a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5893b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 58946a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5895552f7358SJed Brown CHKERRQ(ierr); 5896552f7358SJed Brown } 5897d3d1a6afSToby Isaac if (newNumPoints) { 5898d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 5899d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 5900d3d1a6afSToby Isaac } 5901d3d1a6afSToby Isaac else { 59021b406b76SMatthew G. Knepley if (!clPoints) { 5903552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 59041b406b76SMatthew G. Knepley } else { 59051b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 59061b406b76SMatthew G. Knepley } 5907d3d1a6afSToby Isaac } 5908552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5909552f7358SJed Brown PetscFunctionReturn(0); 5910552f7358SJed Brown } 5911552f7358SJed Brown 5912552f7358SJed Brown #undef __FUNCT__ 5913de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5914de41b84cSMatthew 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) 5915de41b84cSMatthew G. Knepley { 5916de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5917de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5918de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5919de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5920de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5921de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 59224ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5923de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5924de41b84cSMatthew G. Knepley 5925de41b84cSMatthew G. Knepley PetscFunctionBegin; 5926de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5927de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5928de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5929de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5930de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5931de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5932de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5933de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5934de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5935de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5936de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5937de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5938de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5939de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5940de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5941de41b84cSMatthew G. Knepley /* Column indices */ 5942de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 59434ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5944de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5945de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5946de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5947de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5948de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5949de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5950de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5951de41b84cSMatthew G. Knepley ++q; 5952de41b84cSMatthew G. Knepley } 5953de41b84cSMatthew G. Knepley } 5954de41b84cSMatthew G. Knepley numCPoints = q; 5955de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5956de41b84cSMatthew G. Knepley PetscInt fdof; 5957de41b84cSMatthew G. Knepley 5958de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 59594ca5e9f5SMatthew G. Knepley if (!dof) continue; 5960de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5961de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5962de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5963de41b84cSMatthew G. Knepley } 5964de41b84cSMatthew G. Knepley numCIndices += dof; 5965de41b84cSMatthew G. Knepley } 5966de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5967de41b84cSMatthew G. Knepley /* Row indices */ 5968de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5969de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 59701ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5971de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5972de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5973de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5974de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5975de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5976de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5977de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 59784ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 59794ca5e9f5SMatthew G. Knepley if (!dof) continue; 59804ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 59814ca5e9f5SMatthew G. Knepley if (s < q) continue; 5982de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5983de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5984de41b84cSMatthew G. Knepley ++q; 5985de41b84cSMatthew G. Knepley } 5986de41b84cSMatthew G. Knepley } 5987de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5988de41b84cSMatthew G. Knepley } 5989de41b84cSMatthew G. Knepley numFPoints = q; 5990de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5991de41b84cSMatthew G. Knepley PetscInt fdof; 5992de41b84cSMatthew G. Knepley 5993de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 59944ca5e9f5SMatthew G. Knepley if (!dof) continue; 5995de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5996de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5997de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5998de41b84cSMatthew G. Knepley } 5999de41b84cSMatthew G. Knepley numFIndices += dof; 6000de41b84cSMatthew G. Knepley } 6001de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 6002de41b84cSMatthew G. Knepley 6003de41b84cSMatthew 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); 6004de41b84cSMatthew 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); 6005de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6006de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6007de41b84cSMatthew G. Knepley if (numFields) { 6008de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 6009de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6010de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6011de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 6012de41b84cSMatthew G. Knepley } 6013de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 6014de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6015de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6016de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 6017de41b84cSMatthew G. Knepley } 6018de41b84cSMatthew G. Knepley } else { 6019de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 6020de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6021de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6022de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 6023de41b84cSMatthew G. Knepley } 6024de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 6025de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6026de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6027de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 6028de41b84cSMatthew G. Knepley } 6029de41b84cSMatthew G. Knepley } 6030de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 6031de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 6032de41b84cSMatthew G. Knepley if (ierr) { 6033de41b84cSMatthew G. Knepley PetscMPIInt rank; 6034de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 6035de41b84cSMatthew G. Knepley 6036de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 6037de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 6038de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 6039de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 6040de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 6041de41b84cSMatthew G. Knepley CHKERRQ(ierr); 6042de41b84cSMatthew G. Knepley } 6043549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 6044de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 6045de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6046de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6047de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 6048de41b84cSMatthew G. Knepley } 6049de41b84cSMatthew G. Knepley 6050de41b84cSMatthew G. Knepley #undef __FUNCT__ 60517c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 60527c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 60537c927364SMatthew G. Knepley { 60547c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 60557c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 60567c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 60577c927364SMatthew G. Knepley CellRefiner cellRefiner; 60587c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 60597c927364SMatthew G. Knepley PetscErrorCode ierr; 60607c927364SMatthew G. Knepley 60617c927364SMatthew G. Knepley PetscFunctionBegin; 60627c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 60637c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 60647c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 60657c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 60667c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 60677c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 60687c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 60697c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 60707c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 60717c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 60727c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 60737c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 60747c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 60757c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 60767c927364SMatthew G. Knepley /* Column indices */ 60777c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 60787c927364SMatthew G. Knepley maxFPoints = numCPoints; 60797c927364SMatthew G. Knepley /* Compress out points not in the section */ 60807c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 60817c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 60827c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 60837c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 60847c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 60857c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 60867c927364SMatthew G. Knepley ++q; 60877c927364SMatthew G. Knepley } 60887c927364SMatthew G. Knepley } 60897c927364SMatthew G. Knepley numCPoints = q; 60907c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 60917c927364SMatthew G. Knepley PetscInt fdof; 60927c927364SMatthew G. Knepley 60937c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 60947c927364SMatthew G. Knepley if (!dof) continue; 60957c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 60967c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 60977c927364SMatthew G. Knepley coffsets[f+1] += fdof; 60987c927364SMatthew G. Knepley } 60997c927364SMatthew G. Knepley numCIndices += dof; 61007c927364SMatthew G. Knepley } 61017c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 61027c927364SMatthew G. Knepley /* Row indices */ 61037c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 61047c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 61057c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 61067c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 61077c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 61087c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 61097c927364SMatthew G. Knepley /* Compress out points not in the section */ 61107c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 61117c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 61127c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 61137c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 61147c927364SMatthew G. Knepley if (!dof) continue; 61157c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 61167c927364SMatthew G. Knepley if (s < q) continue; 61177c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 61187c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 61197c927364SMatthew G. Knepley ++q; 61207c927364SMatthew G. Knepley } 61217c927364SMatthew G. Knepley } 61227c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 61237c927364SMatthew G. Knepley } 61247c927364SMatthew G. Knepley numFPoints = q; 61257c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 61267c927364SMatthew G. Knepley PetscInt fdof; 61277c927364SMatthew G. Knepley 61287c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 61297c927364SMatthew G. Knepley if (!dof) continue; 61307c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 61317c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 61327c927364SMatthew G. Knepley foffsets[f+1] += fdof; 61337c927364SMatthew G. Knepley } 61347c927364SMatthew G. Knepley numFIndices += dof; 61357c927364SMatthew G. Knepley } 61367c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 61377c927364SMatthew G. Knepley 61387c927364SMatthew 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); 61397c927364SMatthew 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); 61407c927364SMatthew G. Knepley if (numFields) { 61417c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 61427c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 61437c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 61447c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 61457c927364SMatthew G. Knepley } 61467c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 61477c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 61487c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 61497c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 61507c927364SMatthew G. Knepley } 61517c927364SMatthew G. Knepley } else { 61527c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 61537c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 61547c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 61557c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 61567c927364SMatthew G. Knepley } 61577c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 61587c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 61597c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 61607c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 61617c927364SMatthew G. Knepley } 61627c927364SMatthew G. Knepley } 61637c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 61647c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 61657c927364SMatthew G. Knepley PetscFunctionReturn(0); 61667c927364SMatthew G. Knepley } 61677c927364SMatthew G. Knepley 61687c927364SMatthew G. Knepley #undef __FUNCT__ 6169770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 6170f96281f8SMatthew G. Knepley /*@ 6171f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 6172f96281f8SMatthew G. Knepley 6173f96281f8SMatthew G. Knepley Input Parameter: 6174f96281f8SMatthew G. Knepley . dm - The DMPlex object 6175f96281f8SMatthew G. Knepley 6176f96281f8SMatthew G. Knepley Output Parameters: 6177f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 6178dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 6179dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 6180dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 6181f96281f8SMatthew G. Knepley 6182f96281f8SMatthew G. Knepley Level: developer 6183f96281f8SMatthew G. Knepley 6184dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 6185f96281f8SMatthew G. Knepley @*/ 6186770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 6187552f7358SJed Brown { 6188552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6189770b213bSMatthew G Knepley PetscInt dim; 6190770b213bSMatthew G Knepley PetscErrorCode ierr; 6191552f7358SJed Brown 6192552f7358SJed Brown PetscFunctionBegin; 6193552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6194c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6195770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 6196770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 6197770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 6198770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 6199552f7358SJed Brown PetscFunctionReturn(0); 6200552f7358SJed Brown } 6201552f7358SJed Brown 6202552f7358SJed Brown #undef __FUNCT__ 6203770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 6204dc5a3409SMatthew G. Knepley /*@ 6205dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 6206dc5a3409SMatthew G. Knepley 6207dc5a3409SMatthew G. Knepley Input Parameters: 6208dc5a3409SMatthew G. Knepley . dm - The DMPlex object 6209dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 6210dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 6211dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 6212dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 6213dc5a3409SMatthew G. Knepley 6214dc5a3409SMatthew G. Knepley Level: developer 6215dc5a3409SMatthew G. Knepley 6216dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 6217dc5a3409SMatthew G. Knepley @*/ 6218770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 6219552f7358SJed Brown { 6220552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6221770b213bSMatthew G Knepley PetscInt dim; 6222770b213bSMatthew G Knepley PetscErrorCode ierr; 6223552f7358SJed Brown 6224552f7358SJed Brown PetscFunctionBegin; 6225552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6226c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6227770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 6228770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 6229770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 6230770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 6231552f7358SJed Brown PetscFunctionReturn(0); 6232552f7358SJed Brown } 6233552f7358SJed Brown 6234552f7358SJed Brown #undef __FUNCT__ 6235552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 6236552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 6237552f7358SJed Brown { 6238552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6239552f7358SJed Brown 6240552f7358SJed Brown PetscFunctionBegin; 6241552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6242552f7358SJed Brown PetscValidPointer(cellHeight, 2); 6243552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 6244552f7358SJed Brown PetscFunctionReturn(0); 6245552f7358SJed Brown } 6246552f7358SJed Brown 6247552f7358SJed Brown #undef __FUNCT__ 6248552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 6249552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 6250552f7358SJed Brown { 6251552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6252552f7358SJed Brown 6253552f7358SJed Brown PetscFunctionBegin; 6254552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6255552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 6256552f7358SJed Brown PetscFunctionReturn(0); 6257552f7358SJed Brown } 6258552f7358SJed Brown 6259552f7358SJed Brown #undef __FUNCT__ 6260552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 6261552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 6262ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 6263552f7358SJed Brown { 6264552f7358SJed Brown PetscSection section, globalSection; 6265552f7358SJed Brown PetscInt *numbers, p; 6266552f7358SJed Brown PetscErrorCode ierr; 6267552f7358SJed Brown 6268552f7358SJed Brown PetscFunctionBegin; 626982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 6270552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 6271552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6272552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 6273552f7358SJed Brown } 6274552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 6275552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 6276785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 6277552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6278552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 6279ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 6280ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 6281552f7358SJed Brown } 628282f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 6283ef48cebcSMatthew G. Knepley if (globalSize) { 6284ef48cebcSMatthew G. Knepley PetscLayout layout; 6285ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 6286ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 6287ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 6288ef48cebcSMatthew G. Knepley } 6289552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6290552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 6291552f7358SJed Brown PetscFunctionReturn(0); 6292552f7358SJed Brown } 6293552f7358SJed Brown 6294552f7358SJed Brown #undef __FUNCT__ 6295552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 6296552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 6297552f7358SJed Brown { 6298552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6299552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 6300552f7358SJed Brown PetscErrorCode ierr; 6301552f7358SJed Brown 6302552f7358SJed Brown PetscFunctionBegin; 6303552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6304552f7358SJed Brown if (!mesh->globalCellNumbers) { 6305552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6306552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 63070298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 63080d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6309ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6310552f7358SJed Brown } 6311552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6312552f7358SJed Brown PetscFunctionReturn(0); 6313552f7358SJed Brown } 6314552f7358SJed Brown 6315552f7358SJed Brown #undef __FUNCT__ 6316552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6317552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6318552f7358SJed Brown { 6319552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6320552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6321552f7358SJed Brown PetscErrorCode ierr; 6322552f7358SJed Brown 6323552f7358SJed Brown PetscFunctionBegin; 6324552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6325552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6326552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 63270298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 63280d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6329ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6330552f7358SJed Brown } 6331552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6332552f7358SJed Brown PetscFunctionReturn(0); 6333552f7358SJed Brown } 6334552f7358SJed Brown 6335ef48cebcSMatthew G. Knepley #undef __FUNCT__ 6336ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 6337ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 6338ef48cebcSMatthew G. Knepley { 6339ef48cebcSMatthew G. Knepley IS nums[4]; 6340ef48cebcSMatthew G. Knepley PetscInt depths[4]; 6341ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 6342ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 6343ef48cebcSMatthew G. Knepley 6344ef48cebcSMatthew G. Knepley PetscFunctionBegin; 6345ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6346ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6347ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 6348ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 6349ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 6350ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 6351ef48cebcSMatthew G. Knepley 6352ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 6353ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 6354ef48cebcSMatthew G. Knepley shift += gsize; 6355ef48cebcSMatthew G. Knepley } 6356ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 6357ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 6358ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 6359ef48cebcSMatthew G. Knepley } 6360ef48cebcSMatthew G. Knepley 6361552f7358SJed Brown 6362552f7358SJed Brown #undef __FUNCT__ 6363552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6364552f7358SJed Brown /*@C 6365552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6366552f7358SJed Brown the local section and an SF describing the section point overlap. 6367552f7358SJed Brown 6368552f7358SJed Brown Input Parameters: 6369552f7358SJed Brown + s - The PetscSection for the local field layout 6370552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6371552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6372552f7358SJed Brown . label - The label specifying the points 6373552f7358SJed Brown - labelValue - The label stratum specifying the points 6374552f7358SJed Brown 6375552f7358SJed Brown Output Parameter: 6376552f7358SJed Brown . gsection - The PetscSection for the global field layout 6377552f7358SJed Brown 6378552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6379552f7358SJed Brown 6380552f7358SJed Brown Level: developer 6381552f7358SJed Brown 6382552f7358SJed Brown .seealso: PetscSectionCreate() 6383552f7358SJed Brown @*/ 6384552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6385552f7358SJed Brown { 63867ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6387552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6388552f7358SJed Brown PetscErrorCode ierr; 6389552f7358SJed Brown 6390552f7358SJed Brown PetscFunctionBegin; 63914c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 6392552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6393552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 63947ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 63957ec39499SMatthew G. Knepley if (nroots >= 0) { 63967ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 63971795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 63987ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 63991795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 64007ec39499SMatthew G. Knepley } else { 64017ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 64027ec39499SMatthew G. Knepley } 64037ec39499SMatthew G. Knepley } 6404552f7358SJed Brown /* Mark ghost points with negative dof */ 6405552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6406552f7358SJed Brown PetscInt value; 6407552f7358SJed Brown 6408552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6409552f7358SJed Brown if (value != labelValue) continue; 6410552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6411552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6412552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6413552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 64147ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6415552f7358SJed Brown } 6416552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6417552f7358SJed Brown if (nroots >= 0) { 64187ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64197ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6420552f7358SJed Brown if (nroots > pEnd-pStart) { 64217ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6422552f7358SJed Brown } 6423552f7358SJed Brown } 6424552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6425552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6426552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6427552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6428552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6429552f7358SJed Brown } 64304c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 6431552f7358SJed Brown globalOff -= off; 6432552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6433552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 64347ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6435552f7358SJed Brown } 6436552f7358SJed Brown /* Put in negative offsets for ghost points */ 6437552f7358SJed Brown if (nroots >= 0) { 64387ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64397ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6440552f7358SJed Brown if (nroots > pEnd-pStart) { 64417ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6442552f7358SJed Brown } 6443552f7358SJed Brown } 64447ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6445552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6446552f7358SJed Brown PetscFunctionReturn(0); 6447552f7358SJed Brown } 6448ca8062c8SMatthew G. Knepley 6449ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6450ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6451ca8062c8SMatthew G. Knepley /*@ 6452ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6453ca8062c8SMatthew G. Knepley 6454ca8062c8SMatthew G. Knepley Input Parameters: 6455ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6456ca8062c8SMatthew G. Knepley 6457ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6458ca8062c8SMatthew G. Knepley 6459ca8062c8SMatthew G. Knepley Level: developer 6460ca8062c8SMatthew G. Knepley 64619bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6462ca8062c8SMatthew G. Knepley @*/ 6463ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6464ca8062c8SMatthew G. Knepley { 6465ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6466ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6467ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6468ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6469ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6470ca8062c8SMatthew G. Knepley 6471ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6472ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6473ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6474ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6475ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6476ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6477ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6478ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6479ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6480ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 648142e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 648242e66dfaSMatthew G. Knepley PetscInt d; 648342e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 648442e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 648542e66dfaSMatthew G. Knepley } 6486ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6487ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6488ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6489ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6490ca8062c8SMatthew G. Knepley } 649142e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 6492ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6493ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6494ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6495ca8062c8SMatthew G. Knepley } 6496ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6497ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6498ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6499ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6500ca8062c8SMatthew G. Knepley } 6501ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 650242e66dfaSMatthew G. Knepley if (dup) { 650342e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 650442e66dfaSMatthew G. Knepley } else { 6505ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6506ca8062c8SMatthew G. Knepley } 6507ca8062c8SMatthew G. Knepley } 650842e66dfaSMatthew G. Knepley } 6509ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6510ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6511ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6512ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6513ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6514ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6515ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6516ca8062c8SMatthew G. Knepley } 6517ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6518ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6519ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6520ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6521ca8062c8SMatthew G. Knepley } 6522ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6523ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6524ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6525ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6526ca8062c8SMatthew G. Knepley } 6527ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6528ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6529ca8062c8SMatthew G. Knepley } 6530ca8062c8SMatthew G. Knepley } 6531ca8062c8SMatthew G. Knepley } 6532ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6533ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6534ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6535ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6536ca8062c8SMatthew G. Knepley } 6537ca8062c8SMatthew G. Knepley 6538ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6539ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6540ca8062c8SMatthew G. Knepley /*@ 6541ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6542ca8062c8SMatthew G. Knepley 6543ca8062c8SMatthew G. Knepley Input Parameters: 6544ca8062c8SMatthew G. Knepley + dm - The DMPlex object 654558723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 654658723a97SMatthew G. Knepley - cellHeight - Normally 0 6547ca8062c8SMatthew G. Knepley 6548ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6549ca8062c8SMatthew G. Knepley 6550ca8062c8SMatthew G. Knepley Level: developer 6551ca8062c8SMatthew G. Knepley 65529bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6553ca8062c8SMatthew G. Knepley @*/ 655458723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6555ca8062c8SMatthew G. Knepley { 655642363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6557ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6558ca8062c8SMatthew G. Knepley 6559ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6560ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6561c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6562ca8062c8SMatthew G. Knepley switch (dim) { 656342363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 656442363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 656542363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6566ca8062c8SMatthew G. Knepley default: 6567ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6568ca8062c8SMatthew G. Knepley } 656958723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 657058723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6571ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6572ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6573ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 657458723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 657558723a97SMatthew G. Knepley 657658723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 657758723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 657858723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 657958723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 658058723a97SMatthew G. Knepley } 658158723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6582ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6583ca8062c8SMatthew G. Knepley } 658442363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 658542363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 658642363296SMatthew G. Knepley 658742363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 658842363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 658942363296SMatthew G. Knepley const PetscInt p = closure[cl]; 659042363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 659142363296SMatthew G. Knepley } 659242363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 659342363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 659442363296SMatthew G. Knepley } 6595ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6596ca8062c8SMatthew G. Knepley } 65979bf0dad6SMatthew G. Knepley 65989bf0dad6SMatthew G. Knepley #undef __FUNCT__ 65999bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 66009bf0dad6SMatthew G. Knepley /*@ 66019bf0dad6SMatthew 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 66029bf0dad6SMatthew G. Knepley 66039bf0dad6SMatthew G. Knepley Input Parameters: 66049bf0dad6SMatthew G. Knepley + dm - The DMPlex object 66059bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 66069bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 66079bf0dad6SMatthew G. Knepley 66089bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 66099bf0dad6SMatthew G. Knepley 66109bf0dad6SMatthew G. Knepley Level: developer 66119bf0dad6SMatthew G. Knepley 66129bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 66139bf0dad6SMatthew G. Knepley @*/ 66149bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 66159bf0dad6SMatthew G. Knepley { 66163554e41dSMatthew G. Knepley PetscInt pMax[4]; 66173554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 66189bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 66199bf0dad6SMatthew G. Knepley 66209bf0dad6SMatthew G. Knepley PetscFunctionBegin; 66219bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6622c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 66239bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 662425abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 66253554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 66263554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 66273554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 66289bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 66299bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 66309bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 66319bf0dad6SMatthew G. Knepley 663225abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 66339bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 66349bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 66359bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 66369bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66379bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 66389bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 66399bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 66409bf0dad6SMatthew G. Knepley } 66413554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66429bf0dad6SMatthew 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); 66439bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 66449bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 66459bf0dad6SMatthew G. Knepley 66469bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66479bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 66489bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 66499bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 66509bf0dad6SMatthew G. Knepley } 6651e003ed69SMatthew 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); 66529bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6653e003ed69SMatthew 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]); 66549bf0dad6SMatthew G. Knepley } 66559bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66569bf0dad6SMatthew G. Knepley } 66579bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66589bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66599bf0dad6SMatthew G. Knepley } 66603554e41dSMatthew G. Knepley } 6661552f7358SJed Brown PetscFunctionReturn(0); 6662552f7358SJed Brown } 66633913d7c8SMatthew G. Knepley 66643913d7c8SMatthew G. Knepley #undef __FUNCT__ 6665bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6666bceba477SMatthew G. Knepley /* Pointwise interpolation 6667bceba477SMatthew G. Knepley Just code FEM for now 6668bceba477SMatthew G. Knepley u^f = I u^c 66694ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 66704ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 66714ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6672bceba477SMatthew G. Knepley */ 6673bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6674bceba477SMatthew G. Knepley { 6675bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6676bceba477SMatthew G. Knepley PetscInt m, n; 6677a063dac3SMatthew G. Knepley void *ctx; 6678bceba477SMatthew G. Knepley PetscErrorCode ierr; 6679bceba477SMatthew G. Knepley 6680bceba477SMatthew G. Knepley PetscFunctionBegin; 6681bceba477SMatthew G. Knepley /* 6682bceba477SMatthew G. Knepley Loop over coarse cells 6683bceba477SMatthew G. Knepley Loop over coarse basis functions 6684bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6685bceba477SMatthew G. Knepley Loop over fine dual basis functions 6686bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6687bceba477SMatthew G. Knepley Sum 6688bceba477SMatthew G. Knepley Update local element matrix 6689bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6690bceba477SMatthew G. Knepley 6691bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6692bceba477SMatthew G. Knepley */ 6693bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6694bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6695bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6696bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6697bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6698bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6699bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6700bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6701a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6702a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 67035d1c2e58SMatthew G. Knepley /* Use naive scaling */ 67045d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6705a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6706a063dac3SMatthew G. Knepley } 6707bceba477SMatthew G. Knepley 6708a063dac3SMatthew G. Knepley #undef __FUNCT__ 6709a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6710a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6711a063dac3SMatthew G. Knepley { 671290748bafSMatthew G. Knepley PetscErrorCode ierr; 671390748bafSMatthew G. Knepley 6714a063dac3SMatthew G. Knepley PetscFunctionBegin; 67157c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6716bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6717bceba477SMatthew G. Knepley } 6718bceba477SMatthew G. Knepley 6719bceba477SMatthew G. Knepley #undef __FUNCT__ 6720fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6721fd59a867SMatthew G. Knepley /* Pointwise interpolation 6722fd59a867SMatthew G. Knepley Just code FEM for now 6723fd59a867SMatthew G. Knepley u^f = I u^c 6724fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6725fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6726fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6727fd59a867SMatthew G. Knepley */ 6728fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6729fd59a867SMatthew G. Knepley { 6730fd59a867SMatthew G. Knepley PetscSection section; 6731fd59a867SMatthew G. Knepley IS *bcPoints; 6732286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6733286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6734fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6735fd59a867SMatthew G. Knepley 6736fd59a867SMatthew G. Knepley PetscFunctionBegin; 6737fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6738286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6739c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6740fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6741fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6742fd59a867SMatthew G. Knepley PetscBool isEssential; 674363d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6744fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6745fd59a867SMatthew G. Knepley } 6746fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6747fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6748fd59a867SMatthew G. Knepley const char *bdLabel; 6749fd59a867SMatthew G. Knepley DMLabel label; 6750fd59a867SMatthew G. Knepley const PetscInt *values; 67517391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6752c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6753fd59a867SMatthew G. Knepley 675463d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6755fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6756fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 67577391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 67587391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 67597391c1cbSMatthew G. Knepley const char *bdname; 67602f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 67617391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 67627391c1cbSMatthew G. Knepley if (duplicate) break; 67637391c1cbSMatthew G. Knepley } 67647391c1cbSMatthew G. Knepley if (!duplicate) { 6765fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 676632720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 67677391c1cbSMatthew G. Knepley } 676893a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6769fd59a867SMatthew G. Knepley if (isEssential) { 677093a5981aSMatthew G. Knepley IS tmp; 677193a5981aSMatthew G. Knepley PetscInt *newidx; 677293a5981aSMatthew G. Knepley const PetscInt *idx; 677393a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 677493a5981aSMatthew G. Knepley 6775fd59a867SMatthew G. Knepley bcFields[bc] = field; 677693a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 677793a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 677893a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 677993a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 678093a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 678193a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 678293a5981aSMatthew G. Knepley newn = 0; 678393a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 678493a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 678593a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 678693a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6787fd59a867SMatthew G. Knepley } 6788fd59a867SMatthew G. Knepley } 6789fd59a867SMatthew G. Knepley /* Handle discretization */ 6790fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6791286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6792fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6793fd59a867SMatthew G. Knepley PetscFE fe; 6794286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6795fd59a867SMatthew G. Knepley PetscInt d; 6796fd59a867SMatthew G. Knepley 679718abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6798fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6799286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6800286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6801fd59a867SMatthew G. Knepley } 6802286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6803286d8613SMatthew G. Knepley PetscInt d; 6804286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6805286d8613SMatthew 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."); 6806286d8613SMatthew G. Knepley } 6807286d8613SMatthew G. Knepley } 6808f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6809fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6810fd59a867SMatthew G. Knepley PetscFE fe; 6811fd59a867SMatthew G. Knepley const char *name; 681218abd763SMatthew G. Knepley 681318abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6814fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6815fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6816fd59a867SMatthew G. Knepley } 6817fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6818fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6819fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6820fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6821286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6822bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6823bceba477SMatthew G. Knepley } 6824bceba477SMatthew G. Knepley 6825bceba477SMatthew G. Knepley #undef __FUNCT__ 68263913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 68273913d7c8SMatthew G. Knepley /*@ 68283913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 68293913d7c8SMatthew G. Knepley 68303913d7c8SMatthew G. Knepley Input Parameter: 68313913d7c8SMatthew G. Knepley . dm - The DMPlex object 68323913d7c8SMatthew G. Knepley 68333913d7c8SMatthew G. Knepley Output Parameter: 68343913d7c8SMatthew G. Knepley . cdm - The coarse DM 68353913d7c8SMatthew G. Knepley 68363913d7c8SMatthew G. Knepley Level: intermediate 68373913d7c8SMatthew G. Knepley 68383913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 68393913d7c8SMatthew G. Knepley @*/ 68403913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 68413913d7c8SMatthew G. Knepley { 68423913d7c8SMatthew G. Knepley PetscFunctionBegin; 68433913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68443913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 68453913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 68463913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68473913d7c8SMatthew G. Knepley } 68483913d7c8SMatthew G. Knepley 68493913d7c8SMatthew G. Knepley #undef __FUNCT__ 68503913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 68513913d7c8SMatthew G. Knepley /*@ 68523913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 68533913d7c8SMatthew G. Knepley 68543913d7c8SMatthew G. Knepley Input Parameters: 68553913d7c8SMatthew G. Knepley + dm - The DMPlex object 68563913d7c8SMatthew G. Knepley - cdm - The coarse DM 68573913d7c8SMatthew G. Knepley 68583913d7c8SMatthew G. Knepley Level: intermediate 68593913d7c8SMatthew G. Knepley 68603913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 68613913d7c8SMatthew G. Knepley @*/ 68623913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 68633913d7c8SMatthew G. Knepley { 68643913d7c8SMatthew G. Knepley DM_Plex *mesh; 68653913d7c8SMatthew G. Knepley PetscErrorCode ierr; 68663913d7c8SMatthew G. Knepley 68673913d7c8SMatthew G. Knepley PetscFunctionBegin; 68683913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68693913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 68703913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 68713913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 68723913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 68733913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 68743913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68753913d7c8SMatthew G. Knepley } 6876a68b90caSToby Isaac 6877f7c74593SToby Isaac /* anchors */ 6878a68b90caSToby Isaac #undef __FUNCT__ 6879a17985deSToby Isaac #define __FUNCT__ "DMPlexGetAnchors" 6880a68b90caSToby Isaac /*@ 6881f7c74593SToby Isaac DMPlexGetAnchors - Get the layout of the anchor (point-to-point) constraints. Typically, the user will not have to 6882f7c74593SToby Isaac call DMPlexGetAnchors() directly: if there are anchors, then DMPlexGetAnchors() is called during DMGetConstraints(). 6883a68b90caSToby Isaac 6884*e228b242SToby Isaac not collective 6885a68b90caSToby Isaac 6886a68b90caSToby Isaac Input Parameters: 6887a68b90caSToby Isaac . dm - The DMPlex object 6888a68b90caSToby Isaac 6889a68b90caSToby Isaac Output Parameters: 6890a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 6891a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 6892a68b90caSToby Isaac 6893a68b90caSToby Isaac 6894a68b90caSToby Isaac Level: intermediate 6895a68b90caSToby Isaac 6896f7c74593SToby Isaac .seealso: DMPlexSetAnchors(), DMGetConstraints(), DMSetConstraints() 6897a68b90caSToby Isaac @*/ 6898a17985deSToby Isaac PetscErrorCode DMPlexGetAnchors(DM dm, PetscSection *anchorSection, IS *anchorIS) 6899a68b90caSToby Isaac { 6900a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 690141e6d900SToby Isaac PetscErrorCode ierr; 6902a68b90caSToby Isaac 6903a68b90caSToby Isaac PetscFunctionBegin; 6904a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 690541e6d900SToby Isaac if (!plex->anchorSection && !plex->anchorIS && plex->createanchors) {ierr = (*plex->createanchors)(dm);CHKERRQ(ierr);} 6906a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 6907a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 6908a68b90caSToby Isaac PetscFunctionReturn(0); 6909a68b90caSToby Isaac } 6910a68b90caSToby Isaac 6911a68b90caSToby Isaac #undef __FUNCT__ 6912a17985deSToby Isaac #define __FUNCT__ "DMPlexSetAnchors" 6913a68b90caSToby Isaac /*@ 6914f7c74593SToby Isaac DMPlexSetAnchors - Set the layout of the local anchor (point-to-point) constraints. Unlike boundary conditions, 6915f7c74593SToby Isaac when a point's degrees of freedom in a section are constrained to an outside value, the anchor constraints set a 6916a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 6917a68b90caSToby Isaac 6918a17985deSToby Isaac After specifying the layout of constraints with DMPlexSetAnchors(), one specifies the constraints by calling 6919f7c74593SToby Isaac DMGetConstraints() and filling in the entries in the constraint matrix. 6920a68b90caSToby Isaac 6921*e228b242SToby Isaac collective on dm 6922a68b90caSToby Isaac 6923a68b90caSToby Isaac Input Parameters: 6924a68b90caSToby Isaac + dm - The DMPlex object 6925*e228b242SToby 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). 6926*e228b242SToby Isaac - anchorIS - The list of all anchor points. Must have a local communicator (PETSC_COMM_SELF or derivative). 6927a68b90caSToby Isaac 6928a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 6929a68b90caSToby Isaac 6930a68b90caSToby Isaac Level: intermediate 6931a68b90caSToby Isaac 6932f7c74593SToby Isaac .seealso: DMPlexGetAnchors(), DMGetConstraints(), DMSetConstraints() 6933a68b90caSToby Isaac @*/ 6934a17985deSToby Isaac PetscErrorCode DMPlexSetAnchors(DM dm, PetscSection anchorSection, IS anchorIS) 6935a68b90caSToby Isaac { 6936a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6937*e228b242SToby Isaac PetscMPIInt result; 6938a68b90caSToby Isaac PetscErrorCode ierr; 6939a68b90caSToby Isaac 6940a68b90caSToby Isaac PetscFunctionBegin; 6941a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6942*e228b242SToby Isaac if (anchorSection) { 6943*e228b242SToby Isaac PetscValidHeaderSpecific(anchorSection,PETSC_SECTION_CLASSID,2); 6944*e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorSection),&result);CHKERRQ(ierr); 6945*e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor section must have local communicator"); 6946*e228b242SToby Isaac } 6947*e228b242SToby Isaac if (anchorIS) { 6948*e228b242SToby Isaac PetscValidHeaderSpecific(anchorIS,IS_CLASSID,3); 6949*e228b242SToby Isaac ierr = MPI_Comm_compare(PETSC_COMM_SELF,PetscObjectComm((PetscObject)anchorIS),&result);CHKERRQ(ierr); 6950*e228b242SToby Isaac if (result != MPI_CONGRUENT) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_NOTSAMECOMM,"anchor IS must have local communicator"); 6951*e228b242SToby Isaac } 6952a68b90caSToby Isaac 6953a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 6954a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 6955a68b90caSToby Isaac plex->anchorSection = anchorSection; 6956a68b90caSToby Isaac 6957a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 6958a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 6959a68b90caSToby Isaac plex->anchorIS = anchorIS; 6960a68b90caSToby Isaac 6961a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 6962a68b90caSToby Isaac if (anchorIS && anchorSection) { 6963a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 6964a68b90caSToby Isaac const PetscInt *anchors; 6965a68b90caSToby Isaac 6966a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 6967a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 6968a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 6969a68b90caSToby Isaac for (a = 0; a < size; a++) { 6970a68b90caSToby Isaac PetscInt p; 6971a68b90caSToby Isaac 6972a68b90caSToby Isaac p = anchors[a]; 6973a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 6974a68b90caSToby Isaac PetscInt dof; 6975a68b90caSToby Isaac 6976a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 6977a68b90caSToby Isaac if (dof) { 6978a68b90caSToby Isaac PetscErrorCode ierr2; 6979a68b90caSToby Isaac 6980a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 6981a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 6982a68b90caSToby Isaac } 6983a68b90caSToby Isaac } 6984a68b90caSToby Isaac } 6985a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 6986a68b90caSToby Isaac } 6987a68b90caSToby Isaac #endif 6988f7c74593SToby Isaac /* reset the generic constraints */ 6989f7c74593SToby Isaac ierr = DMSetDefaultConstraints(dm,NULL,NULL);CHKERRQ(ierr); 6990a68b90caSToby Isaac PetscFunctionReturn(0); 6991a68b90caSToby Isaac } 6992a68b90caSToby Isaac 6993a68b90caSToby Isaac #undef __FUNCT__ 6994f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection_Anchors" 6995f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintSection_Anchors(DM dm, PetscSection section, PetscSection *cSec) 6996a68b90caSToby Isaac { 6997f7c74593SToby Isaac PetscSection anchorSection; 6998a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 6999a68b90caSToby Isaac PetscErrorCode ierr; 7000a68b90caSToby Isaac 7001a68b90caSToby Isaac PetscFunctionBegin; 7002a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7003a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 7004*e228b242SToby Isaac ierr = PetscSectionCreate(PETSC_COMM_SELF,cSec);CHKERRQ(ierr); 7005a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 7006a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 7007a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 7008a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 7009a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 7010a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 7011a68b90caSToby Isaac if (dof) { 7012a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 7013a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 7014a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 7015a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 7016a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 7017a68b90caSToby Isaac } 7018a68b90caSToby Isaac } 7019a68b90caSToby Isaac } 7020a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 7021a68b90caSToby Isaac PetscFunctionReturn(0); 7022a68b90caSToby Isaac } 7023a68b90caSToby Isaac 7024a68b90caSToby Isaac #undef __FUNCT__ 7025f7c74593SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix_Anchors" 7026f7c74593SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix_Anchors(DM dm, PetscSection section, PetscSection cSec, Mat *cMat) 7027a68b90caSToby Isaac { 7028f7c74593SToby Isaac PetscSection aSec; 70290ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 70300ac89760SToby Isaac const PetscInt *anchors; 70310ac89760SToby Isaac PetscInt numFields, f; 703266ad2231SToby Isaac IS aIS; 70330ac89760SToby Isaac PetscErrorCode ierr; 70340ac89760SToby Isaac 70350ac89760SToby Isaac PetscFunctionBegin; 70360ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 70370ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 70380ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 70390ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 70400ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 70410ac89760SToby Isaac ierr = MatSetType(*cMat,MATSEQAIJ); 7042a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&aSec,&aIS);CHKERRQ(ierr); 704366ad2231SToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 70440ac89760SToby Isaac ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr); 70450ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 70460ac89760SToby Isaac i[0] = 0; 70470ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 70480ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 70490ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 70500ac89760SToby Isaac if (!dof) continue; 70510ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 70520ac89760SToby Isaac if (numFields) { 70530ac89760SToby Isaac for (f = 0; f < numFields; f++) { 70540ac89760SToby Isaac annz = 0; 70550ac89760SToby Isaac for (q = 0; q < dof; q++) { 70560ac89760SToby Isaac a = anchors[off + q]; 70570ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 70580ac89760SToby Isaac annz += aDof; 70590ac89760SToby Isaac } 70600ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 70610ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 70620ac89760SToby Isaac for (q = 0; q < dof; q++) { 70630ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 70640ac89760SToby Isaac } 70650ac89760SToby Isaac } 70660ac89760SToby Isaac } 70670ac89760SToby Isaac else { 70680ac89760SToby Isaac annz = 0; 70690ac89760SToby Isaac for (q = 0; q < dof; q++) { 70700ac89760SToby Isaac a = anchors[off + q]; 70710ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 70720ac89760SToby Isaac annz += aDof; 70730ac89760SToby Isaac } 70740ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 70750ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 70760ac89760SToby Isaac for (q = 0; q < dof; q++) { 70770ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 70780ac89760SToby Isaac } 70790ac89760SToby Isaac } 70800ac89760SToby Isaac } 70810ac89760SToby Isaac nnz = i[m]; 70820ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 70830ac89760SToby Isaac offset = 0; 70840ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 70850ac89760SToby Isaac if (numFields) { 70860ac89760SToby Isaac for (f = 0; f < numFields; f++) { 70870ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 70880ac89760SToby Isaac for (q = 0; q < dof; q++) { 70890ac89760SToby Isaac PetscInt rDof, rOff, r; 70900ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 70910ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 70920ac89760SToby Isaac for (r = 0; r < rDof; r++) { 70930ac89760SToby Isaac PetscInt s; 70940ac89760SToby Isaac 70950ac89760SToby Isaac a = anchors[rOff + r]; 70960ac89760SToby Isaac 70970ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 70980ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 70990ac89760SToby Isaac for (s = 0; s < aDof; s++) { 71000ac89760SToby Isaac j[offset++] = aOff + s; 71010ac89760SToby Isaac } 71020ac89760SToby Isaac } 71030ac89760SToby Isaac } 71040ac89760SToby Isaac } 71050ac89760SToby Isaac } 71060ac89760SToby Isaac else { 71070ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 71080ac89760SToby Isaac for (q = 0; q < dof; q++) { 71090ac89760SToby Isaac PetscInt rDof, rOff, r; 71100ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 71110ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 71120ac89760SToby Isaac for (r = 0; r < rDof; r++) { 71130ac89760SToby Isaac PetscInt s; 71140ac89760SToby Isaac 71150ac89760SToby Isaac a = anchors[rOff + r]; 71160ac89760SToby Isaac 71170ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 71180ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 71190ac89760SToby Isaac for (s = 0; s < aDof; s++) { 71200ac89760SToby Isaac j[offset++] = aOff + s; 71210ac89760SToby Isaac } 71220ac89760SToby Isaac } 71230ac89760SToby Isaac } 71240ac89760SToby Isaac } 71250ac89760SToby Isaac } 71260ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 71270ac89760SToby Isaac ierr = PetscFree2(i,j);CHKERRQ(ierr); 712866ad2231SToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 71290ac89760SToby Isaac PetscFunctionReturn(0); 71300ac89760SToby Isaac } 71310ac89760SToby Isaac 71320ac89760SToby Isaac #undef __FUNCT__ 713366ad2231SToby Isaac #define __FUNCT__ "DMCreateDefaultConstraints_Plex" 713466ad2231SToby Isaac PetscErrorCode DMCreateDefaultConstraints_Plex(DM dm) 713566ad2231SToby Isaac { 7136f7c74593SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7137f7c74593SToby Isaac PetscSection anchorSection, section, cSec; 713866ad2231SToby Isaac Mat cMat; 713966ad2231SToby Isaac PetscErrorCode ierr; 714066ad2231SToby Isaac 714166ad2231SToby Isaac PetscFunctionBegin; 714266ad2231SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7143a17985deSToby Isaac ierr = DMPlexGetAnchors(dm,&anchorSection,NULL);CHKERRQ(ierr); 714466ad2231SToby Isaac if (anchorSection) { 7145*e228b242SToby Isaac PetscDS ds; 7146*e228b242SToby Isaac PetscInt nf; 7147*e228b242SToby Isaac 7148f7c74593SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 7149f7c74593SToby Isaac ierr = DMPlexCreateConstraintSection_Anchors(dm,section,&cSec);CHKERRQ(ierr); 7150f7c74593SToby Isaac ierr = DMPlexCreateConstraintMatrix_Anchors(dm,section,cSec,&cMat);CHKERRQ(ierr); 7151*e228b242SToby Isaac ierr = DMGetDS(dm,&ds);CHKERRQ(ierr); 7152*e228b242SToby Isaac ierr = PetscDSGetNumFields(ds,&nf); 7153*e228b242SToby Isaac if (nf && plex->computeanchormatrix) {ierr = (*plex->computeanchormatrix)(dm,section,cSec,cMat);CHKERRQ(ierr);} 715466ad2231SToby Isaac ierr = DMSetDefaultConstraints(dm,cSec,cMat);CHKERRQ(ierr); 715566ad2231SToby Isaac ierr = PetscSectionDestroy(&cSec);CHKERRQ(ierr); 715666ad2231SToby Isaac ierr = MatDestroy(&cMat);CHKERRQ(ierr); 715766ad2231SToby Isaac } 715866ad2231SToby Isaac PetscFunctionReturn(0); 715966ad2231SToby Isaac } 7160