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> 6*0f7c717fSToby Isaac #include <petscksp.h> 7*0f7c717fSToby Isaac #include <petscpc.h> 8552f7358SJed Brown 9552f7358SJed Brown /* Logging support */ 1075a69067SMatthew 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; 11552f7358SJed Brown 125a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 135a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 142c40f234SMatthew G. Knepley PETSC_EXTERN PetscErrorCode VecLoad_Default(Vec, PetscViewer); 15552f7358SJed Brown 167e42fee7SMatthew G. Knepley #undef __FUNCT__ 177afe7537SMatthew G. Knepley #define __FUNCT__ "DMPlexGetFieldType_Internal" 187afe7537SMatthew G. Knepley PetscErrorCode DMPlexGetFieldType_Internal(DM dm, PetscSection section, PetscInt field, PetscInt *sStart, PetscInt *sEnd, PetscViewerVTKFieldType *ft) 197e42fee7SMatthew G. Knepley { 207e42fee7SMatthew G. Knepley PetscInt dim, pStart, pEnd, vStart, vEnd, cStart, cEnd, vdof = 0, cdof = 0; 217e42fee7SMatthew G. Knepley PetscErrorCode ierr; 227e42fee7SMatthew G. Knepley 237e42fee7SMatthew G. Knepley PetscFunctionBegin; 247e42fee7SMatthew G. Knepley *ft = PETSC_VTK_POINT_FIELD; 25c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 267e42fee7SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 277e42fee7SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 287e42fee7SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 297e42fee7SMatthew G. Knepley if (field >= 0) { 307e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, vStart, field, &vdof);CHKERRQ(ierr);} 317e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetFieldDof(section, cStart, field, &cdof);CHKERRQ(ierr);} 327e42fee7SMatthew G. Knepley } else { 337e42fee7SMatthew G. Knepley if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 347e42fee7SMatthew G. Knepley if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 357e42fee7SMatthew G. Knepley } 367e42fee7SMatthew G. Knepley if (vdof) { 377e42fee7SMatthew G. Knepley *sStart = vStart; 387e42fee7SMatthew G. Knepley *sEnd = vEnd; 397e42fee7SMatthew G. Knepley if (vdof == dim) *ft = PETSC_VTK_POINT_VECTOR_FIELD; 407e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_POINT_FIELD; 417e42fee7SMatthew G. Knepley } else if (cdof) { 427e42fee7SMatthew G. Knepley *sStart = cStart; 437e42fee7SMatthew G. Knepley *sEnd = cEnd; 447e42fee7SMatthew G. Knepley if (cdof == dim) *ft = PETSC_VTK_CELL_VECTOR_FIELD; 457e42fee7SMatthew G. Knepley else *ft = PETSC_VTK_CELL_FIELD; 467e42fee7SMatthew G. Knepley } else SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 477e42fee7SMatthew G. Knepley PetscFunctionReturn(0); 487e42fee7SMatthew G. Knepley } 497e42fee7SMatthew G. Knepley 50552f7358SJed Brown #undef __FUNCT__ 51552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 52552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 53552f7358SJed Brown { 54552f7358SJed Brown DM dm; 55b136c2c9SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 56552f7358SJed Brown PetscErrorCode ierr; 57552f7358SJed Brown 58552f7358SJed Brown PetscFunctionBegin; 59552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 6082f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 61552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 62b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 63b136c2c9SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 64ef31f671SMatthew G. Knepley if (isvtk || ishdf5) { 65ef31f671SMatthew G. Knepley PetscInt numFields; 66ef31f671SMatthew G. Knepley PetscBool fem = PETSC_FALSE; 67ef31f671SMatthew G. Knepley 68ef31f671SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 69ef31f671SMatthew G. Knepley if (numFields) { 70ef31f671SMatthew G. Knepley PetscObject fe; 71ef31f671SMatthew G. Knepley 72ef31f671SMatthew G. Knepley ierr = DMGetField(dm, 0, &fe);CHKERRQ(ierr); 73ef31f671SMatthew G. Knepley if (fe->classid == PETSCFE_CLASSID) fem = PETSC_TRUE; 74ef31f671SMatthew G. Knepley } 754959657aSMatthew G. Knepley if (fem) {ierr = DMPlexInsertBoundaryValuesFEM(dm, v);CHKERRQ(ierr);} 76ef31f671SMatthew G. Knepley } 77552f7358SJed Brown if (isvtk) { 78552f7358SJed Brown PetscSection section; 79b136c2c9SMatthew G. Knepley PetscViewerVTKFieldType ft; 80b136c2c9SMatthew G. Knepley PetscInt pStart, pEnd; 81552f7358SJed Brown 82552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 837afe7537SMatthew G. Knepley ierr = DMPlexGetFieldType_Internal(dm, section, PETSC_DETERMINE, &pStart, &pEnd, &ft);CHKERRQ(ierr); 84552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 85552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 86552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 87b136c2c9SMatthew G. Knepley } else if (ishdf5) { 88b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 89b136c2c9SMatthew G. Knepley ierr = VecView_Plex_Local_HDF5(v, viewer);CHKERRQ(ierr); 90b136c2c9SMatthew G. Knepley #else 91b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 92b136c2c9SMatthew G. Knepley #endif 93552f7358SJed Brown } else { 9455f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 9555f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 96552f7358SJed Brown } 97552f7358SJed Brown PetscFunctionReturn(0); 98552f7358SJed Brown } 99552f7358SJed Brown 100552f7358SJed Brown #undef __FUNCT__ 101552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 102552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 103552f7358SJed Brown { 104552f7358SJed Brown DM dm; 10555f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 106552f7358SJed Brown PetscErrorCode ierr; 107552f7358SJed Brown 108552f7358SJed Brown PetscFunctionBegin; 109552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 11082f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 111552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 11233c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 11355f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 114552f7358SJed Brown if (isvtk) { 115552f7358SJed Brown Vec locv; 116552f7358SJed Brown const char *name; 117552f7358SJed Brown 118552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 119552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 120552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 122552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 123552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 124552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 125b136c2c9SMatthew G. Knepley } else if (ishdf5) { 126b136c2c9SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 127b136c2c9SMatthew G. Knepley ierr = VecView_Plex_HDF5(v, viewer);CHKERRQ(ierr); 128b136c2c9SMatthew G. Knepley #else 129b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 130b136c2c9SMatthew G. Knepley #endif 131552f7358SJed Brown } else { 13255f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 13355f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 134552f7358SJed Brown } 135552f7358SJed Brown PetscFunctionReturn(0); 136552f7358SJed Brown } 137552f7358SJed Brown 138552f7358SJed Brown #undef __FUNCT__ 1392c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex_Local" 1402c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex_Local(Vec v, PetscViewer viewer) 1412c40f234SMatthew G. Knepley { 1422c40f234SMatthew G. Knepley DM dm; 1432c40f234SMatthew G. Knepley PetscBool ishdf5; 1442c40f234SMatthew G. Knepley PetscErrorCode ierr; 1452c40f234SMatthew G. Knepley 1462c40f234SMatthew G. Knepley PetscFunctionBegin; 1472c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1482c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1492c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1502c40f234SMatthew G. Knepley if (ishdf5) { 1512c40f234SMatthew G. Knepley DM dmBC; 1522c40f234SMatthew G. Knepley Vec gv; 1532c40f234SMatthew G. Knepley const char *name; 1542c40f234SMatthew G. Knepley 1552c40f234SMatthew G. Knepley ierr = DMGetOutputDM(dm, &dmBC);CHKERRQ(ierr); 1562c40f234SMatthew G. Knepley ierr = DMGetGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1572c40f234SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 1582c40f234SMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) gv, name);CHKERRQ(ierr); 1592c40f234SMatthew G. Knepley ierr = VecLoad_Default(gv, viewer);CHKERRQ(ierr); 1602c40f234SMatthew G. Knepley ierr = DMGlobalToLocalBegin(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1612c40f234SMatthew G. Knepley ierr = DMGlobalToLocalEnd(dmBC, gv, INSERT_VALUES, v);CHKERRQ(ierr); 1622c40f234SMatthew G. Knepley ierr = DMRestoreGlobalVector(dmBC, &gv);CHKERRQ(ierr); 1632c40f234SMatthew G. Knepley } else { 1642c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 1652c40f234SMatthew G. Knepley } 1662c40f234SMatthew G. Knepley PetscFunctionReturn(0); 1672c40f234SMatthew G. Knepley } 1682c40f234SMatthew G. Knepley 1692c40f234SMatthew G. Knepley #undef __FUNCT__ 1702c40f234SMatthew G. Knepley #define __FUNCT__ "VecLoad_Plex" 1712c40f234SMatthew G. Knepley PetscErrorCode VecLoad_Plex(Vec v, PetscViewer viewer) 1722c40f234SMatthew G. Knepley { 1732c40f234SMatthew G. Knepley DM dm; 1742c40f234SMatthew G. Knepley PetscBool ishdf5; 1752c40f234SMatthew G. Knepley PetscErrorCode ierr; 1762c40f234SMatthew G. Knepley 1772c40f234SMatthew G. Knepley PetscFunctionBegin; 1782c40f234SMatthew G. Knepley ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 1792c40f234SMatthew G. Knepley if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 1802c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 1812c40f234SMatthew G. Knepley if (ishdf5) { 182878b459fSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 183b136c2c9SMatthew G. Knepley ierr = VecLoad_Plex_HDF5(v, viewer);CHKERRQ(ierr); 184b136c2c9SMatthew G. Knepley #else 185b136c2c9SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 186878b459fSMatthew G. Knepley #endif 1872c40f234SMatthew G. Knepley } else { 1882c40f234SMatthew G. Knepley ierr = VecLoad_Default(v, viewer);CHKERRQ(ierr); 189552f7358SJed Brown } 190552f7358SJed Brown PetscFunctionReturn(0); 191552f7358SJed Brown } 192552f7358SJed Brown 193552f7358SJed Brown #undef __FUNCT__ 194552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 195552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 196552f7358SJed Brown { 197552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 198552f7358SJed Brown DM cdm; 199552f7358SJed Brown DMLabel markers; 200552f7358SJed Brown PetscSection coordSection; 201552f7358SJed Brown Vec coordinates; 202552f7358SJed Brown PetscViewerFormat format; 203552f7358SJed Brown PetscErrorCode ierr; 204552f7358SJed Brown 205552f7358SJed Brown PetscFunctionBegin; 206552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 207552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 208552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 209552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 210552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 211552f7358SJed Brown const char *name; 212552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 213552f7358SJed Brown PetscInt pStart, pEnd, p; 214552f7358SJed Brown PetscMPIInt rank, size; 215552f7358SJed Brown 21682f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 21782f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 219552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 220552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 221552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 223552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 224552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 225552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 226552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 227552f7358SJed Brown PetscInt dof, off, s; 228552f7358SJed Brown 229552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 230552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 231552f7358SJed Brown for (s = off; s < off+dof; ++s) { 232552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 233552f7358SJed Brown } 234552f7358SJed Brown } 235552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 236552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 237552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 238552f7358SJed Brown PetscInt dof, off, c; 239552f7358SJed Brown 240552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 241552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 242552f7358SJed Brown for (c = off; c < off+dof; ++c) { 243552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 244552f7358SJed Brown } 245552f7358SJed Brown } 246552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 2470298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 248552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 249552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 250552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 251552f7358SJed Brown if (size > 1) { 252552f7358SJed Brown PetscSF sf; 253552f7358SJed Brown 254552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 255552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 256552f7358SJed Brown } 257552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 258552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 259552f7358SJed Brown const char *name; 260552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 261552f7358SJed Brown const int numColors = 3; 262552f7358SJed Brown PetscReal scale = 2.0; 263552f7358SJed Brown PetscScalar *coords; 264552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 265552f7358SJed Brown PetscMPIInt rank, size; 266552f7358SJed Brown 267552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 26882f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 26982f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 270552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 271552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 272770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 273770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 274552f7358SJed Brown \\usepackage{tikz}\n\ 275552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 276552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 277552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 278552f7358SJed Brown \\begin{document}\n\ 279552f7358SJed Brown \\section{%s}\n\ 280770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 281770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 282770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 283770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 284770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 285770b213bSMatthew G Knepley } else if (p > 0) { 286770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 287770b213bSMatthew G Knepley } 288770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 289770b213bSMatthew G Knepley } 290770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 291770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 292552f7358SJed Brown /* Plot vertices */ 293552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 294552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 295552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 296552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 297552f7358SJed Brown PetscInt off, dof, d; 298552f7358SJed Brown 299552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 300552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 301552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 302552f7358SJed Brown for (d = 0; d < dof; ++d) { 303552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3046712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 305552f7358SJed Brown } 306552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 307552f7358SJed Brown } 308552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 309552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 310552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 311552f7358SJed Brown /* Plot edges */ 312552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 313552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 314552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 315552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 316552f7358SJed Brown const PetscInt *cone; 317552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 318552f7358SJed Brown 319552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 32082f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 321552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 322552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 323552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 324552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 325552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 326552f7358SJed Brown for (d = 0; d < dof; ++d) { 327552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 3286712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 329552f7358SJed Brown } 330552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 331552f7358SJed Brown } 332552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 333552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 334552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 335552f7358SJed Brown /* Plot cells */ 336552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 337552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3380298fd71SBarry Smith PetscInt *closure = NULL; 339552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 340552f7358SJed Brown 341552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 342552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 343552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 344552f7358SJed Brown const PetscInt point = closure[p]; 345552f7358SJed Brown 346552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 347552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 348552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 349552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 350552f7358SJed Brown } 351552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 352552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 353552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 354552f7358SJed Brown } 355552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 356552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 357770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 358552f7358SJed Brown } else { 35982f516ccSBarry Smith MPI_Comm comm; 360834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 361834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 362552f7358SJed Brown PetscInt pStart, pEnd, p; 363a57dd577SMatthew G Knepley PetscInt numLabels, l; 3641143a3c0SMatthew G. Knepley const char *name; 365552f7358SJed Brown PetscMPIInt size; 366552f7358SJed Brown 36782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 368552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 369c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3705f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 3711143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 3721143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 373552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 374552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 375bb81ee50SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth > 0 ? &pMax[depth-1] : NULL, &pMax[1], &pMax[0]);CHKERRQ(ierr); 376dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 377552f7358SJed Brown if (depth == 1) { 378552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 379552f7358SJed Brown pEnd = pEnd - pStart; 380552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 381552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 382552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 383552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 384552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 385552f7358SJed Brown pEnd = pEnd - pStart; 386552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 387552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 388552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 389552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 390552f7358SJed Brown } else { 391552f7358SJed Brown for (d = 0; d <= dim; d++) { 392552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 393834065abSMatthew G. Knepley pEnd -= pStart; 394834065abSMatthew G. Knepley pMax[d] -= pStart; 395552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 396834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 397552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 398834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 399834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 400834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 401834065abSMatthew G. Knepley } 402552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 403552f7358SJed Brown } 404552f7358SJed Brown } 405834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 406a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 407a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 408a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 409a57dd577SMatthew G Knepley DMLabel label; 410a57dd577SMatthew G Knepley const char *name; 411a57dd577SMatthew G Knepley IS valueIS; 412a57dd577SMatthew G Knepley const PetscInt *values; 413a57dd577SMatthew G Knepley PetscInt numValues, v; 414a57dd577SMatthew G Knepley 415a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 416a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 417a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 418a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 419a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 420a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 421a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 422a57dd577SMatthew G Knepley PetscInt size; 423a57dd577SMatthew G Knepley 424a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 425a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 426a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 427a57dd577SMatthew G Knepley } 428a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 429a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 4304d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 431a57dd577SMatthew G Knepley } 432552f7358SJed Brown } 433552f7358SJed Brown PetscFunctionReturn(0); 434552f7358SJed Brown } 435552f7358SJed Brown 436552f7358SJed Brown #undef __FUNCT__ 437552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 438552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 439552f7358SJed Brown { 440fcf6c8fdSToby Isaac PetscBool iascii, ishdf5, isvtk; 441552f7358SJed Brown PetscErrorCode ierr; 442552f7358SJed Brown 443552f7358SJed Brown PetscFunctionBegin; 444552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 445552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 446552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 447fcf6c8fdSToby Isaac ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 448c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 449552f7358SJed Brown if (iascii) { 450552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 451c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 452c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 4537afe7537SMatthew G. Knepley ierr = PetscViewerPushFormat(viewer, PETSC_VIEWER_HDF5_VIZ);CHKERRQ(ierr); 454c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 4557afe7537SMatthew G. Knepley ierr = PetscViewerPopFormat(viewer);CHKERRQ(ierr); 456c6ccd67eSMatthew G. Knepley #else 457c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 458552f7358SJed Brown #endif 45911aeaf0aSBarry Smith } 460fcf6c8fdSToby Isaac else if (isvtk) { 461fcf6c8fdSToby Isaac ierr = DMPlexVTKWriteAll((PetscObject) dm,viewer);CHKERRQ(ierr); 462fcf6c8fdSToby Isaac } 463552f7358SJed Brown PetscFunctionReturn(0); 464552f7358SJed Brown } 465552f7358SJed Brown 4662c40f234SMatthew G. Knepley #undef __FUNCT__ 4672c40f234SMatthew G. Knepley #define __FUNCT__ "DMLoad_Plex" 4682c40f234SMatthew G. Knepley PetscErrorCode DMLoad_Plex(DM dm, PetscViewer viewer) 4692c40f234SMatthew G. Knepley { 4702c40f234SMatthew G. Knepley PetscBool isbinary, ishdf5; 4712c40f234SMatthew G. Knepley PetscErrorCode ierr; 4722c40f234SMatthew G. Knepley 4732c40f234SMatthew G. Knepley PetscFunctionBegin; 4742c40f234SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4752c40f234SMatthew G. Knepley PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 4762c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 4772c40f234SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 4782c40f234SMatthew G. Knepley if (isbinary) {SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Do not yet support binary viewers");} 4792c40f234SMatthew G. Knepley else if (ishdf5) { 4802c40f234SMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 48110b7db4eSMatthew G. Knepley ierr = DMPlexLoad_HDF5(dm, viewer);CHKERRQ(ierr); 4822c40f234SMatthew G. Knepley #else 4832c40f234SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 484552f7358SJed Brown #endif 485552f7358SJed Brown } 486552f7358SJed Brown PetscFunctionReturn(0); 487552f7358SJed Brown } 488552f7358SJed Brown 489552f7358SJed Brown #undef __FUNCT__ 4906c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4916c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4926c73c22cSMatthew G. Knepley { 4936c73c22cSMatthew G. Knepley DMBoundary b, next; 4946c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4956c73c22cSMatthew G. Knepley 4968e136ac0SMatthew G. Knepley PetscFunctionBegin; 4976c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4986c73c22cSMatthew G. Knepley b = *boundary; 4996c73c22cSMatthew G. Knepley *boundary = NULL; 5006c73c22cSMatthew G. Knepley for (; b; b = next) { 5016c73c22cSMatthew G. Knepley next = b->next; 5026c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5036c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 50463d5297fSMatthew G. Knepley ierr = PetscFree(b->labelname);CHKERRQ(ierr); 5056c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5066c73c22cSMatthew G. Knepley } 5076c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5086c73c22cSMatthew G. Knepley } 5096c73c22cSMatthew G. Knepley 5106c73c22cSMatthew G. Knepley #undef __FUNCT__ 511552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 512552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 513552f7358SJed Brown { 514552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 515552f7358SJed Brown DMLabel next = mesh->labels; 516552f7358SJed Brown PetscErrorCode ierr; 517552f7358SJed Brown 518552f7358SJed Brown PetscFunctionBegin; 5190d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 520552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 521552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 522552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 523552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 524552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 525552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 526552f7358SJed Brown while (next) { 527552f7358SJed Brown DMLabel tmp = next->next; 528552f7358SJed Brown 529552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 530552f7358SJed Brown next = tmp; 531552f7358SJed Brown } 5323913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 533a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 534552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 535552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5366c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 537a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->anchorSection);CHKERRQ(ierr); 538a68b90caSToby Isaac ierr = ISDestroy(&mesh->anchorIS);CHKERRQ(ierr); 539a68b90caSToby Isaac ierr = PetscSectionDestroy(&mesh->constraintSection);CHKERRQ(ierr); 540a68b90caSToby Isaac ierr = MatDestroy(&mesh->constraintMat);CHKERRQ(ierr); 541552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 542552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 543552f7358SJed Brown PetscFunctionReturn(0); 544552f7358SJed Brown } 545552f7358SJed Brown 546552f7358SJed Brown #undef __FUNCT__ 547552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 548b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 549552f7358SJed Brown { 550552f7358SJed Brown PetscSection section, sectionGlobal; 551552f7358SJed Brown PetscInt bs = -1; 552552f7358SJed Brown PetscInt localSize; 55389545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 554552f7358SJed Brown PetscErrorCode ierr; 555b412c318SBarry Smith MatType mtype; 556552f7358SJed Brown 557552f7358SJed Brown PetscFunctionBegin; 558607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 559b412c318SBarry Smith mtype = dm->mattype; 560552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 561552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 562552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 563552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 56482f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 565552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 566552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 567552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 568552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 569552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 570552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 571552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 572552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 573552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 574552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 575552f7358SJed Brown if (!isShell) { 576552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5772a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 578552f7358SJed Brown 579552f7358SJed Brown if (bs < 0) { 580552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 581fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 582552f7358SJed Brown 583552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 584552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 585552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 586fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 587fad22124SMatthew G Knepley if (dof-cdof) { 5882a28c762SMatthew G Knepley if (bs < 0) { 589fad22124SMatthew G Knepley bs = dof-cdof; 590fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5912a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5922a28c762SMatthew G Knepley bs = 1; 593552f7358SJed Brown break; 594552f7358SJed Brown } 595552f7358SJed Brown } 5962a28c762SMatthew G Knepley } 5972a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5982a28c762SMatthew G Knepley bsLocal = bs; 59982f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6002a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 60182f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6022a28c762SMatthew G Knepley if (bsMin != bsMax) { 6032a28c762SMatthew G Knepley bs = 1; 6042a28c762SMatthew G Knepley } else { 6052a28c762SMatthew G Knepley bs = bsMax; 6062a28c762SMatthew G Knepley } 607552f7358SJed Brown } else { 608552f7358SJed Brown bs = 1; 609552f7358SJed Brown } 610552f7358SJed Brown } 6111795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 612552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 613552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 614552f7358SJed Brown } 615552f7358SJed Brown PetscFunctionReturn(0); 616552f7358SJed Brown } 617552f7358SJed Brown 618552f7358SJed Brown #undef __FUNCT__ 619552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 620552f7358SJed Brown /*@ 621552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 622552f7358SJed Brown 623552f7358SJed Brown Not collective 624552f7358SJed Brown 625552f7358SJed Brown Input Parameter: 626552f7358SJed Brown . mesh - The DMPlex 627552f7358SJed Brown 628552f7358SJed Brown Output Parameters: 629552f7358SJed Brown + pStart - The first mesh point 630552f7358SJed Brown - pEnd - The upper bound for mesh points 631552f7358SJed Brown 632552f7358SJed Brown Level: beginner 633552f7358SJed Brown 634552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 635552f7358SJed Brown @*/ 636552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 637552f7358SJed Brown { 638552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 639552f7358SJed Brown PetscErrorCode ierr; 640552f7358SJed Brown 641552f7358SJed Brown PetscFunctionBegin; 642552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 643552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 644552f7358SJed Brown PetscFunctionReturn(0); 645552f7358SJed Brown } 646552f7358SJed Brown 647552f7358SJed Brown #undef __FUNCT__ 648552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 649552f7358SJed Brown /*@ 650552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 651552f7358SJed Brown 652552f7358SJed Brown Not collective 653552f7358SJed Brown 654552f7358SJed Brown Input Parameters: 655552f7358SJed Brown + mesh - The DMPlex 656552f7358SJed Brown . pStart - The first mesh point 657552f7358SJed Brown - pEnd - The upper bound for mesh points 658552f7358SJed Brown 659552f7358SJed Brown Output Parameters: 660552f7358SJed Brown 661552f7358SJed Brown Level: beginner 662552f7358SJed Brown 663552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 664552f7358SJed Brown @*/ 665552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 666552f7358SJed Brown { 667552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 668552f7358SJed Brown PetscErrorCode ierr; 669552f7358SJed Brown 670552f7358SJed Brown PetscFunctionBegin; 671552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 672552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 673552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 674552f7358SJed Brown PetscFunctionReturn(0); 675552f7358SJed Brown } 676552f7358SJed Brown 677552f7358SJed Brown #undef __FUNCT__ 678552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 679552f7358SJed Brown /*@ 680552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 681552f7358SJed Brown 682552f7358SJed Brown Not collective 683552f7358SJed Brown 684552f7358SJed Brown Input Parameters: 685552f7358SJed Brown + mesh - The DMPlex 686552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 687552f7358SJed Brown 688552f7358SJed Brown Output Parameter: 689552f7358SJed Brown . size - The cone size for point p 690552f7358SJed Brown 691552f7358SJed Brown Level: beginner 692552f7358SJed Brown 693552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 694552f7358SJed Brown @*/ 695552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 696552f7358SJed Brown { 697552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 698552f7358SJed Brown PetscErrorCode ierr; 699552f7358SJed Brown 700552f7358SJed Brown PetscFunctionBegin; 701552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 702552f7358SJed Brown PetscValidPointer(size, 3); 703552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 704552f7358SJed Brown PetscFunctionReturn(0); 705552f7358SJed Brown } 706552f7358SJed Brown 707552f7358SJed Brown #undef __FUNCT__ 708552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 709552f7358SJed Brown /*@ 710552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 711552f7358SJed Brown 712552f7358SJed Brown Not collective 713552f7358SJed Brown 714552f7358SJed Brown Input Parameters: 715552f7358SJed Brown + mesh - The DMPlex 716552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 717552f7358SJed Brown - size - The cone size for point p 718552f7358SJed Brown 719552f7358SJed Brown Output Parameter: 720552f7358SJed Brown 721552f7358SJed Brown Note: 722552f7358SJed Brown This should be called after DMPlexSetChart(). 723552f7358SJed Brown 724552f7358SJed Brown Level: beginner 725552f7358SJed Brown 726552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 727552f7358SJed Brown @*/ 728552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 729552f7358SJed Brown { 730552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 731552f7358SJed Brown PetscErrorCode ierr; 732552f7358SJed Brown 733552f7358SJed Brown PetscFunctionBegin; 734552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 735552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7360d644c17SKarl Rupp 737552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 738552f7358SJed Brown PetscFunctionReturn(0); 739552f7358SJed Brown } 740552f7358SJed Brown 741552f7358SJed Brown #undef __FUNCT__ 742f5a469b9SMatthew G. Knepley #define __FUNCT__ "DMPlexAddConeSize" 743f5a469b9SMatthew G. Knepley /*@ 744f5a469b9SMatthew G. Knepley DMPlexAddConeSize - Add the given number of in-edges to this point in the Sieve DAG 745f5a469b9SMatthew G. Knepley 746f5a469b9SMatthew G. Knepley Not collective 747f5a469b9SMatthew G. Knepley 748f5a469b9SMatthew G. Knepley Input Parameters: 749f5a469b9SMatthew G. Knepley + mesh - The DMPlex 750f5a469b9SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 751f5a469b9SMatthew G. Knepley - size - The additional cone size for point p 752f5a469b9SMatthew G. Knepley 753f5a469b9SMatthew G. Knepley Output Parameter: 754f5a469b9SMatthew G. Knepley 755f5a469b9SMatthew G. Knepley Note: 756f5a469b9SMatthew G. Knepley This should be called after DMPlexSetChart(). 757f5a469b9SMatthew G. Knepley 758f5a469b9SMatthew G. Knepley Level: beginner 759f5a469b9SMatthew G. Knepley 760f5a469b9SMatthew G. Knepley .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexGetConeSize(), DMPlexSetChart() 761f5a469b9SMatthew G. Knepley @*/ 762f5a469b9SMatthew G. Knepley PetscErrorCode DMPlexAddConeSize(DM dm, PetscInt p, PetscInt size) 763f5a469b9SMatthew G. Knepley { 764f5a469b9SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 765f5a469b9SMatthew G. Knepley PetscInt csize; 766f5a469b9SMatthew G. Knepley PetscErrorCode ierr; 767f5a469b9SMatthew G. Knepley 768f5a469b9SMatthew G. Knepley PetscFunctionBegin; 769f5a469b9SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 770f5a469b9SMatthew G. Knepley ierr = PetscSectionAddDof(mesh->coneSection, p, size);CHKERRQ(ierr); 771f5a469b9SMatthew G. Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &csize);CHKERRQ(ierr); 772f5a469b9SMatthew G. Knepley 773f5a469b9SMatthew G. Knepley mesh->maxConeSize = PetscMax(mesh->maxConeSize, csize); 774f5a469b9SMatthew G. Knepley PetscFunctionReturn(0); 775f5a469b9SMatthew G. Knepley } 776f5a469b9SMatthew G. Knepley 777f5a469b9SMatthew G. Knepley #undef __FUNCT__ 778552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 779552f7358SJed Brown /*@C 780552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 781552f7358SJed Brown 782552f7358SJed Brown Not collective 783552f7358SJed Brown 784552f7358SJed Brown Input Parameters: 785552f7358SJed Brown + mesh - The DMPlex 786552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 787552f7358SJed Brown 788552f7358SJed Brown Output Parameter: 789552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 790552f7358SJed Brown 791552f7358SJed Brown Level: beginner 792552f7358SJed Brown 7933813dfbdSMatthew G Knepley Fortran Notes: 7943813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7953813dfbdSMatthew G Knepley include petsc.h90 in your code. 7963813dfbdSMatthew G Knepley 7973813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 798552f7358SJed Brown 799552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 800552f7358SJed Brown @*/ 801552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 802552f7358SJed Brown { 803552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 804552f7358SJed Brown PetscInt off; 805552f7358SJed Brown PetscErrorCode ierr; 806552f7358SJed Brown 807552f7358SJed Brown PetscFunctionBegin; 808552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 809552f7358SJed Brown PetscValidPointer(cone, 3); 810552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 811552f7358SJed Brown *cone = &mesh->cones[off]; 812552f7358SJed Brown PetscFunctionReturn(0); 813552f7358SJed Brown } 814552f7358SJed Brown 815552f7358SJed Brown #undef __FUNCT__ 816552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 817552f7358SJed Brown /*@ 818552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 819552f7358SJed Brown 820552f7358SJed Brown Not collective 821552f7358SJed Brown 822552f7358SJed Brown Input Parameters: 823552f7358SJed Brown + mesh - The DMPlex 824552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 825552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 826552f7358SJed Brown 827552f7358SJed Brown Output Parameter: 828552f7358SJed Brown 829552f7358SJed Brown Note: 830552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 831552f7358SJed Brown 832552f7358SJed Brown Level: beginner 833552f7358SJed Brown 834552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 835552f7358SJed Brown @*/ 836552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 837552f7358SJed Brown { 838552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 839552f7358SJed Brown PetscInt pStart, pEnd; 840552f7358SJed Brown PetscInt dof, off, c; 841552f7358SJed Brown PetscErrorCode ierr; 842552f7358SJed Brown 843552f7358SJed Brown PetscFunctionBegin; 844552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 845552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 846552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 847552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 848552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84982f516ccSBarry 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); 850552f7358SJed Brown for (c = 0; c < dof; ++c) { 85182f516ccSBarry 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); 852552f7358SJed Brown mesh->cones[off+c] = cone[c]; 853552f7358SJed Brown } 854552f7358SJed Brown PetscFunctionReturn(0); 855552f7358SJed Brown } 856552f7358SJed Brown 857552f7358SJed Brown #undef __FUNCT__ 858552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 859552f7358SJed Brown /*@C 860552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 861552f7358SJed Brown 862552f7358SJed Brown Not collective 863552f7358SJed Brown 864552f7358SJed Brown Input Parameters: 865552f7358SJed Brown + mesh - The DMPlex 866552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 867552f7358SJed Brown 868552f7358SJed Brown Output Parameter: 869552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 870552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 871552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 872552f7358SJed Brown the index of the cone point on which to start. 873552f7358SJed Brown 874552f7358SJed Brown Level: beginner 875552f7358SJed Brown 8763813dfbdSMatthew G Knepley Fortran Notes: 8773813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8783813dfbdSMatthew G Knepley include petsc.h90 in your code. 8793813dfbdSMatthew G Knepley 8803813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 881552f7358SJed Brown 882552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 883552f7358SJed Brown @*/ 884552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 885552f7358SJed Brown { 886552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 887552f7358SJed Brown PetscInt off; 888552f7358SJed Brown PetscErrorCode ierr; 889552f7358SJed Brown 890552f7358SJed Brown PetscFunctionBegin; 891552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 892552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 893552f7358SJed Brown { 894552f7358SJed Brown PetscInt dof; 895552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 896552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 897552f7358SJed Brown } 898552f7358SJed Brown #endif 899552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9000d644c17SKarl Rupp 901552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 902552f7358SJed Brown PetscFunctionReturn(0); 903552f7358SJed Brown } 904552f7358SJed Brown 905552f7358SJed Brown #undef __FUNCT__ 906552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 907552f7358SJed Brown /*@ 908552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 909552f7358SJed Brown 910552f7358SJed Brown Not collective 911552f7358SJed Brown 912552f7358SJed Brown Input Parameters: 913552f7358SJed Brown + mesh - The DMPlex 914552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 915552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 916552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 917552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 918552f7358SJed Brown the index of the cone point on which to start. 919552f7358SJed Brown 920552f7358SJed Brown Output Parameter: 921552f7358SJed Brown 922552f7358SJed Brown Note: 923552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 924552f7358SJed Brown 925552f7358SJed Brown Level: beginner 926552f7358SJed Brown 927552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 928552f7358SJed Brown @*/ 929552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 930552f7358SJed Brown { 931552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 932552f7358SJed Brown PetscInt pStart, pEnd; 933552f7358SJed Brown PetscInt dof, off, c; 934552f7358SJed Brown PetscErrorCode ierr; 935552f7358SJed Brown 936552f7358SJed Brown PetscFunctionBegin; 937552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 938552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 939552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 940552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 941552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 94282f516ccSBarry 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); 943552f7358SJed Brown for (c = 0; c < dof; ++c) { 944552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 945552f7358SJed Brown 946552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 94782f516ccSBarry 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); 948552f7358SJed Brown mesh->coneOrientations[off+c] = o; 949552f7358SJed Brown } 950552f7358SJed Brown PetscFunctionReturn(0); 951552f7358SJed Brown } 952552f7358SJed Brown 953552f7358SJed Brown #undef __FUNCT__ 954552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 955552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 956552f7358SJed Brown { 957552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 958552f7358SJed Brown PetscInt pStart, pEnd; 959552f7358SJed Brown PetscInt dof, off; 960552f7358SJed Brown PetscErrorCode ierr; 961552f7358SJed Brown 962552f7358SJed Brown PetscFunctionBegin; 963552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 964552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 96582f516ccSBarry 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); 96682f516ccSBarry 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); 96777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 96877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 96977c88f5bSMatthew 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); 970552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 971552f7358SJed Brown PetscFunctionReturn(0); 972552f7358SJed Brown } 973552f7358SJed Brown 974552f7358SJed Brown #undef __FUNCT__ 97577c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 97677c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 97777c88f5bSMatthew G Knepley { 97877c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 97977c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 98077c88f5bSMatthew G Knepley PetscInt dof, off; 98177c88f5bSMatthew G Knepley PetscErrorCode ierr; 98277c88f5bSMatthew G Knepley 98377c88f5bSMatthew G Knepley PetscFunctionBegin; 98477c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 98577c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 98677c88f5bSMatthew 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); 98777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 98877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98977c88f5bSMatthew 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); 99077c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 99177c88f5bSMatthew G Knepley PetscFunctionReturn(0); 99277c88f5bSMatthew G Knepley } 99377c88f5bSMatthew G Knepley 99477c88f5bSMatthew G Knepley #undef __FUNCT__ 995552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 996552f7358SJed Brown /*@ 997552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 998552f7358SJed Brown 999552f7358SJed Brown Not collective 1000552f7358SJed Brown 1001552f7358SJed Brown Input Parameters: 1002552f7358SJed Brown + mesh - The DMPlex 1003552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1004552f7358SJed Brown 1005552f7358SJed Brown Output Parameter: 1006552f7358SJed Brown . size - The support size for point p 1007552f7358SJed Brown 1008552f7358SJed Brown Level: beginner 1009552f7358SJed Brown 1010552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1011552f7358SJed Brown @*/ 1012552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1013552f7358SJed Brown { 1014552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1015552f7358SJed Brown PetscErrorCode ierr; 1016552f7358SJed Brown 1017552f7358SJed Brown PetscFunctionBegin; 1018552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1019552f7358SJed Brown PetscValidPointer(size, 3); 1020552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1021552f7358SJed Brown PetscFunctionReturn(0); 1022552f7358SJed Brown } 1023552f7358SJed Brown 1024552f7358SJed Brown #undef __FUNCT__ 1025552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1026552f7358SJed Brown /*@ 1027552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1028552f7358SJed Brown 1029552f7358SJed Brown Not collective 1030552f7358SJed Brown 1031552f7358SJed Brown Input Parameters: 1032552f7358SJed Brown + mesh - The DMPlex 1033552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1034552f7358SJed Brown - size - The support size for point p 1035552f7358SJed Brown 1036552f7358SJed Brown Output Parameter: 1037552f7358SJed Brown 1038552f7358SJed Brown Note: 1039552f7358SJed Brown This should be called after DMPlexSetChart(). 1040552f7358SJed Brown 1041552f7358SJed Brown Level: beginner 1042552f7358SJed Brown 1043552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1044552f7358SJed Brown @*/ 1045552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1046552f7358SJed Brown { 1047552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1048552f7358SJed Brown PetscErrorCode ierr; 1049552f7358SJed Brown 1050552f7358SJed Brown PetscFunctionBegin; 1051552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1052552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10530d644c17SKarl Rupp 1054552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1055552f7358SJed Brown PetscFunctionReturn(0); 1056552f7358SJed Brown } 1057552f7358SJed Brown 1058552f7358SJed Brown #undef __FUNCT__ 1059552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1060552f7358SJed Brown /*@C 1061552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1062552f7358SJed Brown 1063552f7358SJed Brown Not collective 1064552f7358SJed Brown 1065552f7358SJed Brown Input Parameters: 1066552f7358SJed Brown + mesh - The DMPlex 1067552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1068552f7358SJed Brown 1069552f7358SJed Brown Output Parameter: 1070552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1071552f7358SJed Brown 1072552f7358SJed Brown Level: beginner 1073552f7358SJed Brown 10743813dfbdSMatthew G Knepley Fortran Notes: 10753813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10763813dfbdSMatthew G Knepley include petsc.h90 in your code. 10773813dfbdSMatthew G Knepley 10783813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10793813dfbdSMatthew G Knepley 1080552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1081552f7358SJed Brown @*/ 1082552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1083552f7358SJed Brown { 1084552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1085552f7358SJed Brown PetscInt off; 1086552f7358SJed Brown PetscErrorCode ierr; 1087552f7358SJed Brown 1088552f7358SJed Brown PetscFunctionBegin; 1089552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1090552f7358SJed Brown PetscValidPointer(support, 3); 1091552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1092552f7358SJed Brown *support = &mesh->supports[off]; 1093552f7358SJed Brown PetscFunctionReturn(0); 1094552f7358SJed Brown } 1095552f7358SJed Brown 1096552f7358SJed Brown #undef __FUNCT__ 1097552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1098552f7358SJed Brown /*@ 1099552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1100552f7358SJed Brown 1101552f7358SJed Brown Not collective 1102552f7358SJed Brown 1103552f7358SJed Brown Input Parameters: 1104552f7358SJed Brown + mesh - The DMPlex 1105552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1106552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1107552f7358SJed Brown 1108552f7358SJed Brown Output Parameter: 1109552f7358SJed Brown 1110552f7358SJed Brown Note: 1111552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1112552f7358SJed Brown 1113552f7358SJed Brown Level: beginner 1114552f7358SJed Brown 1115552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1116552f7358SJed Brown @*/ 1117552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1118552f7358SJed Brown { 1119552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1120552f7358SJed Brown PetscInt pStart, pEnd; 1121552f7358SJed Brown PetscInt dof, off, c; 1122552f7358SJed Brown PetscErrorCode ierr; 1123552f7358SJed Brown 1124552f7358SJed Brown PetscFunctionBegin; 1125552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1126552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1127552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1128552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1129552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 113082f516ccSBarry 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); 1131552f7358SJed Brown for (c = 0; c < dof; ++c) { 113282f516ccSBarry 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); 1133552f7358SJed Brown mesh->supports[off+c] = support[c]; 1134552f7358SJed Brown } 1135552f7358SJed Brown PetscFunctionReturn(0); 1136552f7358SJed Brown } 1137552f7358SJed Brown 1138552f7358SJed Brown #undef __FUNCT__ 1139552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1140552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1141552f7358SJed Brown { 1142552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1143552f7358SJed Brown PetscInt pStart, pEnd; 1144552f7358SJed Brown PetscInt dof, off; 1145552f7358SJed Brown PetscErrorCode ierr; 1146552f7358SJed Brown 1147552f7358SJed Brown PetscFunctionBegin; 1148552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1149552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1150552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1151552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 115282f516ccSBarry 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); 115382f516ccSBarry 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); 115482f516ccSBarry 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); 1155552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1156552f7358SJed Brown PetscFunctionReturn(0); 1157552f7358SJed Brown } 1158552f7358SJed Brown 1159552f7358SJed Brown #undef __FUNCT__ 1160552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1161552f7358SJed Brown /*@C 1162552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1163552f7358SJed Brown 1164552f7358SJed Brown Not collective 1165552f7358SJed Brown 1166552f7358SJed Brown Input Parameters: 1167552f7358SJed Brown + mesh - The DMPlex 1168552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1169552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11700298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1171552f7358SJed Brown 1172552f7358SJed Brown Output Parameters: 1173552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1174552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1175552f7358SJed Brown 1176552f7358SJed Brown Note: 11770298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1178552f7358SJed Brown 11793813dfbdSMatthew G Knepley Fortran Notes: 11803813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11813813dfbdSMatthew G Knepley include petsc.h90 in your code. 11823813dfbdSMatthew G Knepley 11833813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11843813dfbdSMatthew G Knepley 1185552f7358SJed Brown Level: beginner 1186552f7358SJed Brown 1187552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1188552f7358SJed Brown @*/ 1189552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1190552f7358SJed Brown { 1191552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1192552f7358SJed Brown PetscInt *closure, *fifo; 11930298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1194552f7358SJed Brown PetscInt tmpSize, t; 1195552f7358SJed Brown PetscInt depth = 0, maxSize; 1196552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1197552f7358SJed Brown PetscErrorCode ierr; 1198552f7358SJed Brown 1199552f7358SJed Brown PetscFunctionBegin; 1200552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1201552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1202552f7358SJed Brown /* This is only 1-level */ 1203552f7358SJed Brown if (useCone) { 1204552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1205552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1206552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1207552f7358SJed Brown } else { 1208552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1209552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1210552f7358SJed Brown } 1211bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1212bfbcdd7aSMatthew G. Knepley if (*points) { 1213bfbcdd7aSMatthew G. Knepley closure = *points; 1214bfbcdd7aSMatthew G. Knepley } else { 1215bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1216bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1217bfbcdd7aSMatthew G. Knepley } 1218bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1219bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1220bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1221bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1222bfbcdd7aSMatthew G. Knepley } 1223bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1224bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1225bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1226bfbcdd7aSMatthew G. Knepley } 122724c766afSToby Isaac { 122824c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 122924c766afSToby Isaac 123024c766afSToby Isaac c = mesh->maxConeSize; 123124c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 123224c766afSToby Isaac s = mesh->maxSupportSize; 123324c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 123424c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 123524c766afSToby Isaac } 1236bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1237bfbcdd7aSMatthew G. Knepley if (*points) { 1238bfbcdd7aSMatthew G. Knepley closure = *points; 1239bfbcdd7aSMatthew G. Knepley } else { 1240bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1241bfbcdd7aSMatthew G. Knepley } 1242bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1243552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1244552f7358SJed Brown const PetscInt cp = tmp[t]; 1245552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1246552f7358SJed Brown 1247552f7358SJed Brown closure[closureSize] = cp; 1248552f7358SJed Brown closure[closureSize+1] = co; 1249552f7358SJed Brown fifo[fifoSize] = cp; 1250552f7358SJed Brown fifo[fifoSize+1] = co; 1251552f7358SJed Brown } 1252bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1253552f7358SJed Brown while (fifoSize - fifoStart) { 1254552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1255552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1256552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1257552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1258552f7358SJed Brown 1259552f7358SJed Brown if (useCone) { 1260552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1261552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1262552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1263552f7358SJed Brown } else { 1264552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1265552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12660298fd71SBarry Smith tmpO = NULL; 1267552f7358SJed Brown } 1268552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1269552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1270552f7358SJed Brown const PetscInt cp = tmp[i]; 12712e1b13c2SMatthew 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. */ 12722e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12732e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12742e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1275552f7358SJed Brown PetscInt c; 1276552f7358SJed Brown 12772e1b13c2SMatthew G. Knepley if (rev) { 12782e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12792e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12802e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12812e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12822e1b13c2SMatthew G. Knepley } 1283552f7358SJed Brown /* Check for duplicate */ 1284552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1285552f7358SJed Brown if (closure[c] == cp) break; 1286552f7358SJed Brown } 1287552f7358SJed Brown if (c == closureSize) { 1288552f7358SJed Brown closure[closureSize] = cp; 1289552f7358SJed Brown closure[closureSize+1] = co; 1290552f7358SJed Brown fifo[fifoSize] = cp; 1291552f7358SJed Brown fifo[fifoSize+1] = co; 1292552f7358SJed Brown closureSize += 2; 1293552f7358SJed Brown fifoSize += 2; 1294552f7358SJed Brown } 1295552f7358SJed Brown } 1296552f7358SJed Brown fifoStart += 2; 1297552f7358SJed Brown } 1298552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1299552f7358SJed Brown if (points) *points = closure; 1300552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1301552f7358SJed Brown PetscFunctionReturn(0); 1302552f7358SJed Brown } 1303552f7358SJed Brown 1304552f7358SJed Brown #undef __FUNCT__ 13059bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13069bf0dad6SMatthew G. Knepley /*@C 13079bf0dad6SMatthew 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 13089bf0dad6SMatthew G. Knepley 13099bf0dad6SMatthew G. Knepley Not collective 13109bf0dad6SMatthew G. Knepley 13119bf0dad6SMatthew G. Knepley Input Parameters: 13129bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13139bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13149bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13159bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13169bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13179bf0dad6SMatthew G. Knepley 13189bf0dad6SMatthew G. Knepley Output Parameters: 13199bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13209bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13219bf0dad6SMatthew G. Knepley 13229bf0dad6SMatthew G. Knepley Note: 13239bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13249bf0dad6SMatthew G. Knepley 13259bf0dad6SMatthew G. Knepley Fortran Notes: 13269bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13279bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13289bf0dad6SMatthew G. Knepley 13299bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13309bf0dad6SMatthew G. Knepley 13319bf0dad6SMatthew G. Knepley Level: beginner 13329bf0dad6SMatthew G. Knepley 13339bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13349bf0dad6SMatthew G. Knepley @*/ 13359bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13369bf0dad6SMatthew G. Knepley { 13379bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13389bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13399bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13409bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13419bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13429bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13439bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13449bf0dad6SMatthew G. Knepley 13459bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13469bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13479bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13489bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13499bf0dad6SMatthew G. Knepley if (useCone) { 13509bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13519bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13529bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13539bf0dad6SMatthew G. Knepley } else { 13549bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13559bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13569bf0dad6SMatthew G. Knepley } 13579bf0dad6SMatthew G. Knepley if (depth == 1) { 13589bf0dad6SMatthew G. Knepley if (*points) { 13599bf0dad6SMatthew G. Knepley closure = *points; 13609bf0dad6SMatthew G. Knepley } else { 13619bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13629bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13639bf0dad6SMatthew G. Knepley } 13649bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13659bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13669bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13679bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13689bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13699bf0dad6SMatthew G. Knepley } 13709bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13719bf0dad6SMatthew G. Knepley if (points) *points = closure; 13729bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13739bf0dad6SMatthew G. Knepley } 137424c766afSToby Isaac { 137524c766afSToby Isaac PetscInt c, coneSeries, s,supportSeries; 137624c766afSToby Isaac 137724c766afSToby Isaac c = mesh->maxConeSize; 137824c766afSToby Isaac coneSeries = (c > 1) ? ((PetscPowInt(c,depth+1)-1)/(c-1)) : depth+1; 137924c766afSToby Isaac s = mesh->maxSupportSize; 138024c766afSToby Isaac supportSeries = (s > 1) ? ((PetscPowInt(s,depth+1)-1)/(s-1)) : depth+1; 138124c766afSToby Isaac maxSize = 2*PetscMax(coneSeries,supportSeries); 138224c766afSToby Isaac } 13839bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13849bf0dad6SMatthew G. Knepley if (*points) { 13859bf0dad6SMatthew G. Knepley closure = *points; 13869bf0dad6SMatthew G. Knepley } else { 13879bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13889bf0dad6SMatthew G. Knepley } 13899bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13909bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13919bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13929bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13939bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13949bf0dad6SMatthew G. Knepley 13959bf0dad6SMatthew G. Knepley if (ornt < 0) { 13969bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13979bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13989bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13999bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14009bf0dad6SMatthew G. Knepley } 14019bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14029bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14039bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14049bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14059bf0dad6SMatthew G. Knepley } 14069bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14079bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14089bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14099bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14109bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14119bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14129bf0dad6SMatthew G. Knepley 14139bf0dad6SMatthew G. Knepley if (useCone) { 14149bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14159bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14169bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14179bf0dad6SMatthew G. Knepley } else { 14189bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14199bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14209bf0dad6SMatthew G. Knepley tmpO = NULL; 14219bf0dad6SMatthew G. Knepley } 14229bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14239bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14249bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14259bf0dad6SMatthew 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. */ 14269bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14279bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14289bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14299bf0dad6SMatthew G. Knepley PetscInt c; 14309bf0dad6SMatthew G. Knepley 14319bf0dad6SMatthew G. Knepley if (rev) { 14329bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14339bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14349bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14359bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14369bf0dad6SMatthew G. Knepley } 14379bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14389bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14399bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14409bf0dad6SMatthew G. Knepley } 14419bf0dad6SMatthew G. Knepley if (c == closureSize) { 14429bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14439bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14449bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14459bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14469bf0dad6SMatthew G. Knepley closureSize += 2; 14479bf0dad6SMatthew G. Knepley fifoSize += 2; 14489bf0dad6SMatthew G. Knepley } 14499bf0dad6SMatthew G. Knepley } 14509bf0dad6SMatthew G. Knepley fifoStart += 2; 14519bf0dad6SMatthew G. Knepley } 14529bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14539bf0dad6SMatthew G. Knepley if (points) *points = closure; 14549bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14559bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14569bf0dad6SMatthew G. Knepley } 14579bf0dad6SMatthew G. Knepley 14589bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1459552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1460552f7358SJed Brown /*@C 1461552f7358SJed 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 1462552f7358SJed Brown 1463552f7358SJed Brown Not collective 1464552f7358SJed Brown 1465552f7358SJed Brown Input Parameters: 1466552f7358SJed Brown + mesh - The DMPlex 1467552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1468552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1469e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1470e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1471552f7358SJed Brown 1472552f7358SJed Brown Note: 14730298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1474552f7358SJed Brown 14753813dfbdSMatthew G Knepley Fortran Notes: 14763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14773813dfbdSMatthew G Knepley include petsc.h90 in your code. 14783813dfbdSMatthew G Knepley 14793813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14803813dfbdSMatthew G Knepley 1481552f7358SJed Brown Level: beginner 1482552f7358SJed Brown 1483552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1484552f7358SJed Brown @*/ 1485552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1486552f7358SJed Brown { 1487552f7358SJed Brown PetscErrorCode ierr; 1488552f7358SJed Brown 1489552f7358SJed Brown PetscFunctionBegin; 1490552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1491e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1492e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1493552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14944ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1495552f7358SJed Brown PetscFunctionReturn(0); 1496552f7358SJed Brown } 1497552f7358SJed Brown 1498552f7358SJed Brown #undef __FUNCT__ 1499552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1500552f7358SJed Brown /*@ 1501552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1502552f7358SJed Brown 1503552f7358SJed Brown Not collective 1504552f7358SJed Brown 1505552f7358SJed Brown Input Parameter: 1506552f7358SJed Brown . mesh - The DMPlex 1507552f7358SJed Brown 1508552f7358SJed Brown Output Parameters: 1509552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1510552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1511552f7358SJed Brown 1512552f7358SJed Brown Level: beginner 1513552f7358SJed Brown 1514552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1515552f7358SJed Brown @*/ 1516552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1517552f7358SJed Brown { 1518552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1519552f7358SJed Brown 1520552f7358SJed Brown PetscFunctionBegin; 1521552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1522552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1523552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1524552f7358SJed Brown PetscFunctionReturn(0); 1525552f7358SJed Brown } 1526552f7358SJed Brown 1527552f7358SJed Brown #undef __FUNCT__ 1528552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1529552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1530552f7358SJed Brown { 1531552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1532552f7358SJed Brown PetscInt size; 1533552f7358SJed Brown PetscErrorCode ierr; 1534552f7358SJed Brown 1535552f7358SJed Brown PetscFunctionBegin; 1536552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1537552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1538552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15391795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15401795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1541552f7358SJed Brown if (mesh->maxSupportSize) { 1542552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1543552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15441795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1545552f7358SJed Brown } 1546552f7358SJed Brown PetscFunctionReturn(0); 1547552f7358SJed Brown } 1548552f7358SJed Brown 1549552f7358SJed Brown #undef __FUNCT__ 1550552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1551552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1552552f7358SJed Brown { 1553552f7358SJed Brown PetscErrorCode ierr; 1554552f7358SJed Brown 1555552f7358SJed Brown PetscFunctionBegin; 15564d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15574d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1558552f7358SJed Brown PetscFunctionReturn(0); 1559552f7358SJed Brown } 1560552f7358SJed Brown 1561552f7358SJed Brown #undef __FUNCT__ 1562552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1563552f7358SJed Brown /*@ 1564552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1565552f7358SJed Brown 1566552f7358SJed Brown Not collective 1567552f7358SJed Brown 1568552f7358SJed Brown Input Parameter: 1569552f7358SJed Brown . mesh - The DMPlex 1570552f7358SJed Brown 1571552f7358SJed Brown Output Parameter: 1572552f7358SJed Brown 1573552f7358SJed Brown Note: 1574552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1575552f7358SJed Brown 1576552f7358SJed Brown Level: beginner 1577552f7358SJed Brown 1578552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1579552f7358SJed Brown @*/ 1580552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1581552f7358SJed Brown { 1582552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1583552f7358SJed Brown PetscInt *offsets; 1584552f7358SJed Brown PetscInt supportSize; 1585552f7358SJed Brown PetscInt pStart, pEnd, p; 1586552f7358SJed Brown PetscErrorCode ierr; 1587552f7358SJed Brown 1588552f7358SJed Brown PetscFunctionBegin; 1589552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 159082f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1591552f7358SJed Brown /* Calculate support sizes */ 1592552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1593552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1594552f7358SJed Brown PetscInt dof, off, c; 1595552f7358SJed Brown 1596552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1597552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1598552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1599552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1600552f7358SJed Brown } 1601552f7358SJed Brown } 1602552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1603552f7358SJed Brown PetscInt dof; 1604552f7358SJed Brown 1605552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16060d644c17SKarl Rupp 1607552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1608552f7358SJed Brown } 1609552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1610552f7358SJed Brown /* Calculate supports */ 1611552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16121795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16131795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1614552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1615552f7358SJed Brown PetscInt dof, off, c; 1616552f7358SJed Brown 1617552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1618552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1619552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1620552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1621552f7358SJed Brown PetscInt offS; 1622552f7358SJed Brown 1623552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16240d644c17SKarl Rupp 1625552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1626552f7358SJed Brown ++offsets[q]; 1627552f7358SJed Brown } 1628552f7358SJed Brown } 1629552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1630552f7358SJed Brown PetscFunctionReturn(0); 1631552f7358SJed Brown } 1632552f7358SJed Brown 1633552f7358SJed Brown #undef __FUNCT__ 1634552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1635552f7358SJed Brown /*@ 1636552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1637552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1638552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1639552f7358SJed Brown the DAG. 1640552f7358SJed Brown 1641552f7358SJed Brown Not collective 1642552f7358SJed Brown 1643552f7358SJed Brown Input Parameter: 1644552f7358SJed Brown . mesh - The DMPlex 1645552f7358SJed Brown 1646552f7358SJed Brown Output Parameter: 1647552f7358SJed Brown 1648552f7358SJed Brown Notes: 1649150b719bSJed Brown Concretely, DMPlexStratify() creates a new label named "depth" containing the dimension of each element: 0 for vertices, 1650150b719bSJed Brown 1 for edges, and so on. The depth label can be accessed through DMPlexGetDepthLabel() or DMPlexGetDepthStratum(), or 1651150b719bSJed Brown manually via DMPlexGetLabel(). The height is defined implicitly by height = maxDimension - depth, and can be accessed 1652150b719bSJed Brown via DMPlexGetHeightStratum(). For example, cells have height 0 and faces have height 1. 1653552f7358SJed Brown 1654150b719bSJed Brown DMPlexStratify() should be called after all calls to DMPlexSymmetrize() 1655552f7358SJed Brown 1656552f7358SJed Brown Level: beginner 1657552f7358SJed Brown 1658552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1659552f7358SJed Brown @*/ 1660552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1661552f7358SJed Brown { 1662aa50250dSMatthew G. Knepley DMLabel label; 1663552f7358SJed Brown PetscInt pStart, pEnd, p; 1664552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1665552f7358SJed Brown PetscErrorCode ierr; 1666552f7358SJed Brown 1667552f7358SJed Brown PetscFunctionBegin; 1668552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1669552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1670552f7358SJed Brown /* Calculate depth */ 1671aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1672aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1673aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1674552f7358SJed Brown /* Initialize roots and count leaves */ 1675552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1676552f7358SJed Brown PetscInt coneSize, supportSize; 1677552f7358SJed Brown 1678552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1679552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1680552f7358SJed Brown if (!coneSize && supportSize) { 1681552f7358SJed Brown ++numRoots; 1682aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1683552f7358SJed Brown } else if (!supportSize && coneSize) { 1684552f7358SJed Brown ++numLeaves; 1685552f7358SJed Brown } else if (!supportSize && !coneSize) { 1686552f7358SJed Brown /* Isolated points */ 1687aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1688552f7358SJed Brown } 1689552f7358SJed Brown } 1690552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1691552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1692552f7358SJed Brown PetscInt coneSize, supportSize; 1693552f7358SJed Brown 1694552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1695552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1696552f7358SJed Brown if (!supportSize && coneSize) { 1697aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1698552f7358SJed Brown } 1699552f7358SJed Brown } 1700552f7358SJed Brown } else { 170174ef644bSMatthew G. Knepley IS pointIS; 170274ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1703552f7358SJed Brown 170474ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170574ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170674ef644bSMatthew G. Knepley while (numPoints) { 170774ef644bSMatthew G. Knepley const PetscInt *points; 170874ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 170974ef644bSMatthew G. Knepley 171074ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 171174ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 171274ef644bSMatthew G. Knepley const PetscInt point = points[p]; 171374ef644bSMatthew G. Knepley const PetscInt *support; 171474ef644bSMatthew G. Knepley PetscInt supportSize, s; 171574ef644bSMatthew G. Knepley 171674ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 171774ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 171874ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 171974ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1720552f7358SJed Brown } 1721552f7358SJed Brown } 17225edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 172374ef644bSMatthew G. Knepley ++level; 172474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 172674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 172774ef644bSMatthew G. Knepley else {numPoints = 0;} 172874ef644bSMatthew G. Knepley } 172974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 173074ef644bSMatthew G. Knepley } 1731552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1732552f7358SJed Brown PetscFunctionReturn(0); 1733552f7358SJed Brown } 1734552f7358SJed Brown 1735552f7358SJed Brown #undef __FUNCT__ 1736552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1737552f7358SJed Brown /*@C 1738552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1739552f7358SJed Brown 1740552f7358SJed Brown Not Collective 1741552f7358SJed Brown 1742552f7358SJed Brown Input Parameters: 1743552f7358SJed Brown + dm - The DMPlex object 1744552f7358SJed Brown . numPoints - The number of input points for the join 1745552f7358SJed Brown - points - The input points 1746552f7358SJed Brown 1747552f7358SJed Brown Output Parameters: 1748552f7358SJed Brown + numCoveredPoints - The number of points in the join 1749552f7358SJed Brown - coveredPoints - The points in the join 1750552f7358SJed Brown 1751552f7358SJed Brown Level: intermediate 1752552f7358SJed Brown 1753552f7358SJed Brown Note: Currently, this is restricted to a single level join 1754552f7358SJed Brown 17553813dfbdSMatthew G Knepley Fortran Notes: 17563813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17573813dfbdSMatthew G Knepley include petsc.h90 in your code. 17583813dfbdSMatthew G Knepley 17593813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17603813dfbdSMatthew G Knepley 1761552f7358SJed Brown .keywords: mesh 1762552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1763552f7358SJed Brown @*/ 1764552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1765552f7358SJed Brown { 1766552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1767552f7358SJed Brown PetscInt *join[2]; 1768552f7358SJed Brown PetscInt joinSize, i = 0; 1769552f7358SJed Brown PetscInt dof, off, p, c, m; 1770552f7358SJed Brown PetscErrorCode ierr; 1771552f7358SJed Brown 1772552f7358SJed Brown PetscFunctionBegin; 1773552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1774552f7358SJed Brown PetscValidPointer(points, 2); 1775552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1776552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1777552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1778552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1779552f7358SJed Brown /* Copy in support of first point */ 1780552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1781552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1782552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1783552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1784552f7358SJed Brown } 1785552f7358SJed Brown /* Check each successive support */ 1786552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1787552f7358SJed Brown PetscInt newJoinSize = 0; 1788552f7358SJed Brown 1789552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1790552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1791552f7358SJed Brown for (c = 0; c < dof; ++c) { 1792552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1793552f7358SJed Brown 1794552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1795552f7358SJed Brown if (point == join[i][m]) { 1796552f7358SJed Brown join[1-i][newJoinSize++] = point; 1797552f7358SJed Brown break; 1798552f7358SJed Brown } 1799552f7358SJed Brown } 1800552f7358SJed Brown } 1801552f7358SJed Brown joinSize = newJoinSize; 1802552f7358SJed Brown i = 1-i; 1803552f7358SJed Brown } 1804552f7358SJed Brown *numCoveredPoints = joinSize; 1805552f7358SJed Brown *coveredPoints = join[i]; 1806552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1807552f7358SJed Brown PetscFunctionReturn(0); 1808552f7358SJed Brown } 1809552f7358SJed Brown 1810552f7358SJed Brown #undef __FUNCT__ 1811552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1812552f7358SJed Brown /*@C 1813552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1814552f7358SJed Brown 1815552f7358SJed Brown Not Collective 1816552f7358SJed Brown 1817552f7358SJed Brown Input Parameters: 1818552f7358SJed Brown + dm - The DMPlex object 1819552f7358SJed Brown . numPoints - The number of input points for the join 1820552f7358SJed Brown - points - The input points 1821552f7358SJed Brown 1822552f7358SJed Brown Output Parameters: 1823552f7358SJed Brown + numCoveredPoints - The number of points in the join 1824552f7358SJed Brown - coveredPoints - The points in the join 1825552f7358SJed Brown 18263813dfbdSMatthew G Knepley Fortran Notes: 18273813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18283813dfbdSMatthew G Knepley include petsc.h90 in your code. 18293813dfbdSMatthew G Knepley 18303813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18313813dfbdSMatthew G Knepley 1832552f7358SJed Brown Level: intermediate 1833552f7358SJed Brown 1834552f7358SJed Brown .keywords: mesh 1835552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1836552f7358SJed Brown @*/ 1837552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1838552f7358SJed Brown { 1839552f7358SJed Brown PetscErrorCode ierr; 1840552f7358SJed Brown 1841552f7358SJed Brown PetscFunctionBegin; 1842552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1843d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1844d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1845d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1846552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1847d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1848552f7358SJed Brown PetscFunctionReturn(0); 1849552f7358SJed Brown } 1850552f7358SJed Brown 1851552f7358SJed Brown #undef __FUNCT__ 1852552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1853552f7358SJed Brown /*@C 1854552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1855552f7358SJed Brown 1856552f7358SJed Brown Not Collective 1857552f7358SJed Brown 1858552f7358SJed Brown Input Parameters: 1859552f7358SJed Brown + dm - The DMPlex object 1860552f7358SJed Brown . numPoints - The number of input points for the join 1861552f7358SJed Brown - points - The input points 1862552f7358SJed Brown 1863552f7358SJed Brown Output Parameters: 1864552f7358SJed Brown + numCoveredPoints - The number of points in the join 1865552f7358SJed Brown - coveredPoints - The points in the join 1866552f7358SJed Brown 18673813dfbdSMatthew G Knepley Fortran Notes: 18683813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18693813dfbdSMatthew G Knepley include petsc.h90 in your code. 18703813dfbdSMatthew G Knepley 18713813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18723813dfbdSMatthew G Knepley 1873552f7358SJed Brown Level: intermediate 1874552f7358SJed Brown 1875552f7358SJed Brown .keywords: mesh 1876552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1877552f7358SJed Brown @*/ 1878552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1879552f7358SJed Brown { 1880552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1881552f7358SJed Brown PetscInt *offsets, **closures; 1882552f7358SJed Brown PetscInt *join[2]; 1883552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 188424c766afSToby Isaac PetscInt p, d, c, m, ms; 1885552f7358SJed Brown PetscErrorCode ierr; 1886552f7358SJed Brown 1887552f7358SJed Brown PetscFunctionBegin; 1888552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1889552f7358SJed Brown PetscValidPointer(points, 2); 1890552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1891552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1892552f7358SJed Brown 1893552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18941795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1895552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 189624c766afSToby Isaac ms = mesh->maxSupportSize; 189724c766afSToby Isaac maxSize = (ms > 1) ? ((PetscPowInt(ms,depth+1)-1)/(ms-1)) : depth + 1; 1898552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1899552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1900552f7358SJed Brown 1901552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1902552f7358SJed Brown PetscInt closureSize; 1903552f7358SJed Brown 1904552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19050d644c17SKarl Rupp 1906552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1907552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1908552f7358SJed Brown PetscInt pStart, pEnd, i; 1909552f7358SJed Brown 1910552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1911552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1912552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1913552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1914552f7358SJed Brown break; 1915552f7358SJed Brown } 1916552f7358SJed Brown } 1917552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1918552f7358SJed Brown } 191982f516ccSBarry 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); 1920552f7358SJed Brown } 1921552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1922552f7358SJed Brown PetscInt dof; 1923552f7358SJed Brown 1924552f7358SJed Brown /* Copy in support of first point */ 1925552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1926552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1927552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1928552f7358SJed Brown } 1929552f7358SJed Brown /* Check each successive cone */ 1930552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1931552f7358SJed Brown PetscInt newJoinSize = 0; 1932552f7358SJed Brown 1933552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1934552f7358SJed Brown for (c = 0; c < dof; ++c) { 1935552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1936552f7358SJed Brown 1937552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1938552f7358SJed Brown if (point == join[i][m]) { 1939552f7358SJed Brown join[1-i][newJoinSize++] = point; 1940552f7358SJed Brown break; 1941552f7358SJed Brown } 1942552f7358SJed Brown } 1943552f7358SJed Brown } 1944552f7358SJed Brown joinSize = newJoinSize; 1945552f7358SJed Brown i = 1-i; 1946552f7358SJed Brown } 1947552f7358SJed Brown if (joinSize) break; 1948552f7358SJed Brown } 1949552f7358SJed Brown *numCoveredPoints = joinSize; 1950552f7358SJed Brown *coveredPoints = join[i]; 1951552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19520298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1953552f7358SJed Brown } 1954552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1955552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1956552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1957552f7358SJed Brown PetscFunctionReturn(0); 1958552f7358SJed Brown } 1959552f7358SJed Brown 1960552f7358SJed Brown #undef __FUNCT__ 1961552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1962552f7358SJed Brown /*@C 1963552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1964552f7358SJed Brown 1965552f7358SJed Brown Not Collective 1966552f7358SJed Brown 1967552f7358SJed Brown Input Parameters: 1968552f7358SJed Brown + dm - The DMPlex object 1969552f7358SJed Brown . numPoints - The number of input points for the meet 1970552f7358SJed Brown - points - The input points 1971552f7358SJed Brown 1972552f7358SJed Brown Output Parameters: 1973552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1974552f7358SJed Brown - coveredPoints - The points in the meet 1975552f7358SJed Brown 1976552f7358SJed Brown Level: intermediate 1977552f7358SJed Brown 1978552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1979552f7358SJed Brown 19803813dfbdSMatthew G Knepley Fortran Notes: 19813813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19823813dfbdSMatthew G Knepley include petsc.h90 in your code. 19833813dfbdSMatthew G Knepley 19843813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19853813dfbdSMatthew G Knepley 1986552f7358SJed Brown .keywords: mesh 1987552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1988552f7358SJed Brown @*/ 1989552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1990552f7358SJed Brown { 1991552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1992552f7358SJed Brown PetscInt *meet[2]; 1993552f7358SJed Brown PetscInt meetSize, i = 0; 1994552f7358SJed Brown PetscInt dof, off, p, c, m; 1995552f7358SJed Brown PetscErrorCode ierr; 1996552f7358SJed Brown 1997552f7358SJed Brown PetscFunctionBegin; 1998552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1999552f7358SJed Brown PetscValidPointer(points, 2); 2000552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2001552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2002552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2003552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2004552f7358SJed Brown /* Copy in cone of first point */ 2005552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2006552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2007552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2008552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2009552f7358SJed Brown } 2010552f7358SJed Brown /* Check each successive cone */ 2011552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2012552f7358SJed Brown PetscInt newMeetSize = 0; 2013552f7358SJed Brown 2014552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2015552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2016552f7358SJed Brown for (c = 0; c < dof; ++c) { 2017552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2018552f7358SJed Brown 2019552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2020552f7358SJed Brown if (point == meet[i][m]) { 2021552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2022552f7358SJed Brown break; 2023552f7358SJed Brown } 2024552f7358SJed Brown } 2025552f7358SJed Brown } 2026552f7358SJed Brown meetSize = newMeetSize; 2027552f7358SJed Brown i = 1-i; 2028552f7358SJed Brown } 2029552f7358SJed Brown *numCoveringPoints = meetSize; 2030552f7358SJed Brown *coveringPoints = meet[i]; 2031552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2032552f7358SJed Brown PetscFunctionReturn(0); 2033552f7358SJed Brown } 2034552f7358SJed Brown 2035552f7358SJed Brown #undef __FUNCT__ 2036552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2037552f7358SJed Brown /*@C 2038552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2039552f7358SJed Brown 2040552f7358SJed Brown Not Collective 2041552f7358SJed Brown 2042552f7358SJed Brown Input Parameters: 2043552f7358SJed Brown + dm - The DMPlex object 2044552f7358SJed Brown . numPoints - The number of input points for the meet 2045552f7358SJed Brown - points - The input points 2046552f7358SJed Brown 2047552f7358SJed Brown Output Parameters: 2048552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2049552f7358SJed Brown - coveredPoints - The points in the meet 2050552f7358SJed Brown 2051552f7358SJed Brown Level: intermediate 2052552f7358SJed Brown 20533813dfbdSMatthew G Knepley Fortran Notes: 20543813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20553813dfbdSMatthew G Knepley include petsc.h90 in your code. 20563813dfbdSMatthew G Knepley 20573813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20583813dfbdSMatthew G Knepley 2059552f7358SJed Brown .keywords: mesh 2060552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2061552f7358SJed Brown @*/ 2062552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2063552f7358SJed Brown { 2064552f7358SJed Brown PetscErrorCode ierr; 2065552f7358SJed Brown 2066552f7358SJed Brown PetscFunctionBegin; 2067552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2068d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2069d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2070d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2071552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2072d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2073552f7358SJed Brown PetscFunctionReturn(0); 2074552f7358SJed Brown } 2075552f7358SJed Brown 2076552f7358SJed Brown #undef __FUNCT__ 2077552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2078552f7358SJed Brown /*@C 2079552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2080552f7358SJed Brown 2081552f7358SJed Brown Not Collective 2082552f7358SJed Brown 2083552f7358SJed Brown Input Parameters: 2084552f7358SJed Brown + dm - The DMPlex object 2085552f7358SJed Brown . numPoints - The number of input points for the meet 2086552f7358SJed Brown - points - The input points 2087552f7358SJed Brown 2088552f7358SJed Brown Output Parameters: 2089552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2090552f7358SJed Brown - coveredPoints - The points in the meet 2091552f7358SJed Brown 2092552f7358SJed Brown Level: intermediate 2093552f7358SJed Brown 20943813dfbdSMatthew G Knepley Fortran Notes: 20953813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20963813dfbdSMatthew G Knepley include petsc.h90 in your code. 20973813dfbdSMatthew G Knepley 20983813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20993813dfbdSMatthew G Knepley 2100552f7358SJed Brown .keywords: mesh 2101552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2102552f7358SJed Brown @*/ 2103552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2104552f7358SJed Brown { 2105552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2106552f7358SJed Brown PetscInt *offsets, **closures; 2107552f7358SJed Brown PetscInt *meet[2]; 2108552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 210924c766afSToby Isaac PetscInt p, h, c, m, mc; 2110552f7358SJed Brown PetscErrorCode ierr; 2111552f7358SJed Brown 2112552f7358SJed Brown PetscFunctionBegin; 2113552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2114552f7358SJed Brown PetscValidPointer(points, 2); 2115552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2116552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2117552f7358SJed Brown 2118552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2119785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2120552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 212124c766afSToby Isaac mc = mesh->maxConeSize; 212224c766afSToby Isaac maxSize = (mc > 1) ? ((PetscPowInt(mc,height+1)-1)/(mc-1)) : height + 1; 2123552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2124552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2125552f7358SJed Brown 2126552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2127552f7358SJed Brown PetscInt closureSize; 2128552f7358SJed Brown 2129552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21300d644c17SKarl Rupp 2131552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2132552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2133552f7358SJed Brown PetscInt pStart, pEnd, i; 2134552f7358SJed Brown 2135552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2136552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2137552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2138552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2139552f7358SJed Brown break; 2140552f7358SJed Brown } 2141552f7358SJed Brown } 2142552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2143552f7358SJed Brown } 214482f516ccSBarry 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); 2145552f7358SJed Brown } 2146552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2147552f7358SJed Brown PetscInt dof; 2148552f7358SJed Brown 2149552f7358SJed Brown /* Copy in cone of first point */ 2150552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2151552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2152552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2153552f7358SJed Brown } 2154552f7358SJed Brown /* Check each successive cone */ 2155552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2156552f7358SJed Brown PetscInt newMeetSize = 0; 2157552f7358SJed Brown 2158552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2159552f7358SJed Brown for (c = 0; c < dof; ++c) { 2160552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2161552f7358SJed Brown 2162552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2163552f7358SJed Brown if (point == meet[i][m]) { 2164552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2165552f7358SJed Brown break; 2166552f7358SJed Brown } 2167552f7358SJed Brown } 2168552f7358SJed Brown } 2169552f7358SJed Brown meetSize = newMeetSize; 2170552f7358SJed Brown i = 1-i; 2171552f7358SJed Brown } 2172552f7358SJed Brown if (meetSize) break; 2173552f7358SJed Brown } 2174552f7358SJed Brown *numCoveredPoints = meetSize; 2175552f7358SJed Brown *coveredPoints = meet[i]; 2176552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21770298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2178552f7358SJed Brown } 2179552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2180552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2181552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2182552f7358SJed Brown PetscFunctionReturn(0); 2183552f7358SJed Brown } 2184552f7358SJed Brown 2185552f7358SJed Brown #undef __FUNCT__ 21864e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21874e3744c5SMatthew G. Knepley /*@C 21884e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21894e3744c5SMatthew G. Knepley 21904e3744c5SMatthew G. Knepley Not Collective 21914e3744c5SMatthew G. Knepley 21924e3744c5SMatthew G. Knepley Input Parameters: 21934e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21944e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21954e3744c5SMatthew G. Knepley 21964e3744c5SMatthew G. Knepley Output Parameters: 21974e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21984e3744c5SMatthew G. Knepley 21994e3744c5SMatthew G. Knepley Level: intermediate 22004e3744c5SMatthew G. Knepley 22014e3744c5SMatthew G. Knepley Notes: 22024e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 22034e3744c5SMatthew G. Knepley 22044e3744c5SMatthew G. Knepley .keywords: mesh 22054e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22064e3744c5SMatthew G. Knepley @*/ 22074e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22084e3744c5SMatthew G. Knepley { 22094e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22104e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22114e3744c5SMatthew G. Knepley 22124e3744c5SMatthew G. Knepley PetscFunctionBegin; 22134e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22144e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22154e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22164e3744c5SMatthew G. Knepley 22174e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22184e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22194e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22204e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22214e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22224e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22234e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22244e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22254e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22264e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22274e3744c5SMatthew G. Knepley 22284e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22294e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22304e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22314e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22324e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22334e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22344e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22354e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22364e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22374e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22384e3744c5SMatthew G. Knepley } 22394e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22404e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22414e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22424e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22434e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22444e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22454e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22464e3744c5SMatthew G. Knepley } 22474e3744c5SMatthew G. Knepley } 22484e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22494e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22504e3744c5SMatthew G. Knepley } 22514e3744c5SMatthew G. Knepley 22524e3744c5SMatthew G. Knepley #undef __FUNCT__ 225318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 225418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2255a6dfd86eSKarl Rupp { 225682f516ccSBarry Smith MPI_Comm comm; 2257552f7358SJed Brown PetscErrorCode ierr; 2258552f7358SJed Brown 2259552f7358SJed Brown PetscFunctionBegin; 226082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2261552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2262552f7358SJed Brown switch (cellDim) { 2263552f7358SJed Brown case 0: 2264552f7358SJed Brown *numFaceVertices = 0; 2265552f7358SJed Brown break; 2266552f7358SJed Brown case 1: 2267552f7358SJed Brown *numFaceVertices = 1; 2268552f7358SJed Brown break; 2269552f7358SJed Brown case 2: 2270552f7358SJed Brown switch (numCorners) { 227119436ca2SJed Brown case 3: /* triangle */ 227219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2273552f7358SJed Brown break; 227419436ca2SJed Brown case 4: /* quadrilateral */ 227519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2276552f7358SJed Brown break; 227719436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 227819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2279552f7358SJed Brown break; 228019436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 228119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2282552f7358SJed Brown break; 2283552f7358SJed Brown default: 2284552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2285552f7358SJed Brown } 2286552f7358SJed Brown break; 2287552f7358SJed Brown case 3: 2288552f7358SJed Brown switch (numCorners) { 228919436ca2SJed Brown case 4: /* tetradehdron */ 229019436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2291552f7358SJed Brown break; 229219436ca2SJed Brown case 6: /* tet cohesive cells */ 229319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2294552f7358SJed Brown break; 229519436ca2SJed Brown case 8: /* hexahedron */ 229619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2297552f7358SJed Brown break; 229819436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 229919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2300552f7358SJed Brown break; 230119436ca2SJed Brown case 10: /* quadratic tetrahedron */ 230219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2303552f7358SJed Brown break; 230419436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 230519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2306552f7358SJed Brown break; 230719436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 230819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2309552f7358SJed Brown break; 231019436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 231119436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2312552f7358SJed Brown break; 2313552f7358SJed Brown default: 2314552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2315552f7358SJed Brown } 2316552f7358SJed Brown break; 2317552f7358SJed Brown default: 2318552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2319552f7358SJed Brown } 2320552f7358SJed Brown PetscFunctionReturn(0); 2321552f7358SJed Brown } 2322552f7358SJed Brown 2323552f7358SJed Brown #undef __FUNCT__ 2324d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2325d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2326d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2327d27a0f52SMatthew G. Knepley { 2328a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2329a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2330a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2331d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2332d27a0f52SMatthew G. Knepley 2333d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2334d27a0f52SMatthew G. Knepley /* Truth Table 2335d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2336d27a0f52SMatthew G. Knepley F 0 flips no F F F 2337d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2338d27a0f52SMatthew G. Knepley F 2 flips no T F T 2339d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2340d27a0f52SMatthew G. Knepley T 1 flip no 2341d27a0f52SMatthew G. Knepley T 2 flips yes 2342d27a0f52SMatthew G. Knepley */ 2343c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 2344d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2346d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2347a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2348a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2349a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2350a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2351a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2352a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2353785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2354a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2355a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2356defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2357a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2358a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2359a1b4d4a2SMatthew G. Knepley 2360a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2361a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2362a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2363a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2364a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2365a1b4d4a2SMatthew G. Knepley } 2366a1b4d4a2SMatthew G. Knepley } 2367a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2368a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2369d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2370a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2371d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2372d27a0f52SMatthew G. Knepley 2373a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2374a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2375a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2376d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2377d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2378a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 237986cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2380a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 238186cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2382d27a0f52SMatthew G. Knepley 2383d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2384d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2385d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2386d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2387d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2388d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2389a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2390a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2391a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2392a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2393a1b4d4a2SMatthew G. Knepley } 2394a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2395a1b4d4a2SMatthew 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); 2396a1b4d4a2SMatthew G. Knepley } 2397a1b4d4a2SMatthew 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]); 2398a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2399a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2400a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2401a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2402a1b4d4a2SMatthew G. Knepley } 2403a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2404a1b4d4a2SMatthew 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); 2405a1b4d4a2SMatthew G. Knepley } 2406a1b4d4a2SMatthew 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]); 2407d27a0f52SMatthew G. Knepley 2408d27a0f52SMatthew G. Knepley if (dim == 1) { 2409d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2410d27a0f52SMatthew G. Knepley } else { 2411d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2412d27a0f52SMatthew G. Knepley } 2413d27a0f52SMatthew G. Knepley 2414d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2415d27a0f52SMatthew 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]); 2416d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2417a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2418d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2419a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2420d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 242186cff514SMatthew 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"); 2422a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2423a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2424d27a0f52SMatthew G. Knepley } 2425fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2426fedde076SMatthew G. Knepley { 2427fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2428fedde076SMatthew G. Knepley PetscSF sf; 2429fedde076SMatthew G. Knepley const PetscInt *lpoints; 2430fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 243113048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2432fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2433a1b4d4a2SMatthew G. Knepley 2434fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2435fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2436fedde076SMatthew G. Knepley if (numLeaves >= 0) { 243762ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 243862ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 243962ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 244013048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 244162ad4a6aSMatthew G. Knepley 2442fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2443fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2444fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2445fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2446fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2447fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2448fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2449fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2450fedde076SMatthew G. Knepley PetscInt supportSize; 2451fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2452fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2453fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2454fedde076SMatthew G. Knepley } 2455fedde076SMatthew G. Knepley } 2456fedde076SMatthew G. Knepley } 245713048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2458fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2459fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2460fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2461fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2462fedde076SMatthew G. Knepley 2463fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 246462ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2465fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2466fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24675b7033fcSMatthew G. Knepley if (dim == 1) { 24685b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24695b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24705b7033fcSMatthew G. Knepley } else { 2471fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2472fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2473fedde076SMatthew G. Knepley } 24745b7033fcSMatthew G. Knepley } 2475fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2476fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2477fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2478fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2479fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2480fedde076SMatthew G. Knepley 248113048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 248213048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 248313048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2484fedde076SMatthew G. Knepley } 248513048561SMatthew G. Knepley /* Collect the graph on 0 */ 248613048561SMatthew G. Knepley { 248713048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 2488e8f90184SMatthew G. Knepley Mat G; 248913048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 249013048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 249113048561SMatthew G. Knepley PetscInt *adj = NULL; 249213048561SMatthew G. Knepley PetscBool *val = NULL; 249313048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 249413048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 249513048561SMatthew G. Knepley PetscInt debug = 0; 249613048561SMatthew G. Knepley 249713048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 249813048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 249913048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 250013048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 250113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250213048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 250313048561SMatthew G. Knepley } 250413048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 250513048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 250613048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 250713048561SMatthew G. Knepley if (debug) { 250813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250913048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 251013048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 251113048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 251213048561SMatthew G. Knepley } 251313048561SMatthew G. Knepley } 251413048561SMatthew G. Knepley } 2515e8f90184SMatthew G. Knepley /* Symmetrize the graph */ 2516e8f90184SMatthew G. Knepley ierr = MatCreate(PETSC_COMM_SELF, &G);CHKERRQ(ierr); 2517e8f90184SMatthew G. Knepley ierr = MatSetSizes(G, numProcs, numProcs, numProcs, numProcs);CHKERRQ(ierr); 2518e8f90184SMatthew G. Knepley ierr = MatSetUp(G);CHKERRQ(ierr); 2519e8f90184SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 2520e8f90184SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 25219a4fe19dSMatthew G. Knepley const PetscInt r = p; 2522e8f90184SMatthew G. Knepley const PetscInt q = adj[displs[p]+n]; 25237406edfbSMatthew G. Knepley const PetscScalar o = val[displs[p]+n] ? 1.0 : 0.0; 2524e8f90184SMatthew G. Knepley 25257406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &r, 1, &q, &o, INSERT_VALUES);CHKERRQ(ierr); 25267406edfbSMatthew G. Knepley ierr = MatSetValues(G, 1, &q, 1, &r, &o, INSERT_VALUES);CHKERRQ(ierr); 2527e8f90184SMatthew G. Knepley } 2528e8f90184SMatthew G. Knepley } 2529e8f90184SMatthew G. Knepley ierr = MatAssemblyBegin(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2530e8f90184SMatthew G. Knepley ierr = MatAssemblyEnd(G, MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2531e8f90184SMatthew G. Knepley 253213048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 253313048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 253413048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 253513048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 253613048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 253713048561SMatthew G. Knepley pTop = pBottom = 0; 253813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 253913048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 254013048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 254113048561SMatthew G. Knepley procFIFO[pBottom++] = p; 254213048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 254313048561SMatthew G. Knepley /* Consider each proc in FIFO */ 254413048561SMatthew G. Knepley while (pTop < pBottom) { 2545e8f90184SMatthew G. Knepley const PetscScalar *ornt; 2546e8f90184SMatthew G. Knepley const PetscInt *neighbors; 2547e8f90184SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch, numNeighbors; 254813048561SMatthew G. Knepley 254913048561SMatthew G. Knepley proc = procFIFO[pTop++]; 255013048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 2551e8f90184SMatthew G. Knepley ierr = MatGetRow(G, proc, &numNeighbors, &neighbors, &ornt);CHKERRQ(ierr); 255213048561SMatthew G. Knepley /* Loop over neighboring procs */ 2553e8f90184SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2554e8f90184SMatthew G. Knepley nproc = neighbors[n]; 25557406edfbSMatthew G. Knepley mismatch = PetscRealPart(ornt[n]) > 0.5 ? 0 : 1; 255613048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 255713048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 255813048561SMatthew G. Knepley 255913048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 256013048561SMatthew 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); 256113048561SMatthew G. Knepley if (!flippedB) { 256213048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 256313048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 256413048561SMatthew 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"); 256513048561SMatthew G. Knepley if (!seen) { 256613048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 256713048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 256813048561SMatthew G. Knepley } 256913048561SMatthew G. Knepley } 257013048561SMatthew G. Knepley } 257113048561SMatthew G. Knepley } 257213048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 2573e8f90184SMatthew G. Knepley ierr = MatDestroy(&G);CHKERRQ(ierr); 257413048561SMatthew G. Knepley 257513048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 257613048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 257713048561SMatthew G. Knepley { 257813048561SMatthew G. Knepley PetscBool *flips; 257913048561SMatthew G. Knepley 258013048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 258113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 258213048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 258313048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 258413048561SMatthew G. Knepley } 258513048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 258613048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 258713048561SMatthew G. Knepley } 258813048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 258913048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 259013048561SMatthew G. Knepley } 259113048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2592fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 259313048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2594fedde076SMatthew G. Knepley } 2595fedde076SMatthew G. Knepley } 2596fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2597d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2598d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2599d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2600a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2601f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2602f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2603d27a0f52SMatthew G. Knepley 2604a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2605a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2606a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2607a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2608a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2609a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2610a1b4d4a2SMatthew G. Knepley 2611a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2612a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2613a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2614d27a0f52SMatthew G. Knepley } 2615a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2616a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2617f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2618f4e909fcSMatthew G. Knepley faceSize = coneSize; 2619f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2620f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2621f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2622f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2623f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2624f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2625f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2626f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2627f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2628f4e909fcSMatthew G. Knepley } 2629f4e909fcSMatthew G. Knepley } 2630d27a0f52SMatthew G. Knepley } 2631d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2632d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2633d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2634a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2635a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2636a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2637d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2638d27a0f52SMatthew G. Knepley } 2639d27a0f52SMatthew G. Knepley 2640d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2641895b8c46SMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell_Internal" 2642895b8c46SMatthew G. Knepley PetscErrorCode DMPlexInvertCell_Internal(PetscInt dim, PetscInt numCorners, PetscInt cone[]) 2643895b8c46SMatthew G. Knepley { 2644895b8c46SMatthew G. Knepley int tmpc; 2645895b8c46SMatthew G. Knepley 2646895b8c46SMatthew G. Knepley PetscFunctionBegin; 2647895b8c46SMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 2648895b8c46SMatthew G. Knepley switch (numCorners) { 2649895b8c46SMatthew G. Knepley case 4: 2650895b8c46SMatthew G. Knepley tmpc = cone[0]; 2651895b8c46SMatthew G. Knepley cone[0] = cone[1]; 2652895b8c46SMatthew G. Knepley cone[1] = tmpc; 2653895b8c46SMatthew G. Knepley break; 2654895b8c46SMatthew G. Knepley case 8: 2655895b8c46SMatthew G. Knepley tmpc = cone[1]; 2656895b8c46SMatthew G. Knepley cone[1] = cone[3]; 2657895b8c46SMatthew G. Knepley cone[3] = tmpc; 2658895b8c46SMatthew G. Knepley break; 2659895b8c46SMatthew G. Knepley default: break; 2660895b8c46SMatthew G. Knepley } 2661895b8c46SMatthew G. Knepley PetscFunctionReturn(0); 2662895b8c46SMatthew G. Knepley } 2663895b8c46SMatthew G. Knepley 2664895b8c46SMatthew G. Knepley #undef __FUNCT__ 26659db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26669db3b87dSMatthew G. Knepley /*@C 26679db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26689db3b87dSMatthew G. Knepley 26699db3b87dSMatthew G. Knepley Input Parameters: 26709db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26719db3b87dSMatthew G. Knepley - cone - The incoming cone 26729db3b87dSMatthew G. Knepley 26739db3b87dSMatthew G. Knepley Output Parameter: 26749db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26759db3b87dSMatthew G. Knepley 26769db3b87dSMatthew G. Knepley Level: developer 26779db3b87dSMatthew G. Knepley 26789db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26799db3b87dSMatthew G. Knepley @*/ 26809db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26812e1b13c2SMatthew G. Knepley { 26829db3b87dSMatthew G. Knepley int tmpc; 26832e1b13c2SMatthew G. Knepley 26842e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26859db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26869db3b87dSMatthew G. Knepley switch (numCorners) { 26879db3b87dSMatthew G. Knepley case 4: 26881885f254SMatthew G. Knepley tmpc = cone[0]; 26891885f254SMatthew G. Knepley cone[0] = cone[1]; 26901885f254SMatthew G. Knepley cone[1] = tmpc; 26919db3b87dSMatthew G. Knepley break; 26929db3b87dSMatthew G. Knepley case 8: 26939db3b87dSMatthew G. Knepley tmpc = cone[1]; 26949db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26959db3b87dSMatthew G. Knepley cone[3] = tmpc; 26969db3b87dSMatthew G. Knepley break; 26979db3b87dSMatthew G. Knepley default: break; 26989db3b87dSMatthew G. Knepley } 26999db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 27009db3b87dSMatthew G. Knepley } 27019db3b87dSMatthew G. Knepley 27029db3b87dSMatthew G. Knepley #undef __FUNCT__ 27039db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 27049db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 27059db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 27069db3b87dSMatthew G. Knepley { 27079db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 27089db3b87dSMatthew G. Knepley PetscErrorCode ierr; 27099db3b87dSMatthew G. Knepley 27109db3b87dSMatthew G. Knepley PetscFunctionBegin; 27119db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 27129db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 27132e1b13c2SMatthew G. Knepley } 27142e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 27152e1b13c2SMatthew G. Knepley } 27162e1b13c2SMatthew G. Knepley 2717519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2718552f7358SJed Brown #include <triangle.h> 2719552f7358SJed Brown 2720552f7358SJed Brown #undef __FUNCT__ 2721552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 27220adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 27230adebc6cSBarry Smith { 2724552f7358SJed Brown PetscFunctionBegin; 2725552f7358SJed Brown inputCtx->numberofpoints = 0; 2726552f7358SJed Brown inputCtx->numberofpointattributes = 0; 27270298fd71SBarry Smith inputCtx->pointlist = NULL; 27280298fd71SBarry Smith inputCtx->pointattributelist = NULL; 27290298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2730552f7358SJed Brown inputCtx->numberofsegments = 0; 27310298fd71SBarry Smith inputCtx->segmentlist = NULL; 27320298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2733552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 27340298fd71SBarry Smith inputCtx->trianglelist = NULL; 2735552f7358SJed Brown inputCtx->numberofholes = 0; 27360298fd71SBarry Smith inputCtx->holelist = NULL; 2737552f7358SJed Brown inputCtx->numberofregions = 0; 27380298fd71SBarry Smith inputCtx->regionlist = NULL; 2739552f7358SJed Brown PetscFunctionReturn(0); 2740552f7358SJed Brown } 2741552f7358SJed Brown 2742552f7358SJed Brown #undef __FUNCT__ 2743552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 27440adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 27450adebc6cSBarry Smith { 2746552f7358SJed Brown PetscFunctionBegin; 2747552f7358SJed Brown outputCtx->numberofpoints = 0; 27480298fd71SBarry Smith outputCtx->pointlist = NULL; 27490298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27500298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2751552f7358SJed Brown outputCtx->numberoftriangles = 0; 27520298fd71SBarry Smith outputCtx->trianglelist = NULL; 27530298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27540298fd71SBarry Smith outputCtx->neighborlist = NULL; 27550298fd71SBarry Smith outputCtx->segmentlist = NULL; 27560298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2757552f7358SJed Brown outputCtx->numberofedges = 0; 27580298fd71SBarry Smith outputCtx->edgelist = NULL; 27590298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2760552f7358SJed Brown PetscFunctionReturn(0); 2761552f7358SJed Brown } 2762552f7358SJed Brown 2763552f7358SJed Brown #undef __FUNCT__ 2764552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27650adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27660adebc6cSBarry Smith { 2767552f7358SJed Brown PetscFunctionBegin; 276823b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2769552f7358SJed Brown free(outputCtx->pointmarkerlist); 277023b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 277123b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2772552f7358SJed Brown free(outputCtx->edgelist); 2773552f7358SJed Brown free(outputCtx->edgemarkerlist); 2774552f7358SJed Brown free(outputCtx->trianglelist); 2775552f7358SJed Brown free(outputCtx->neighborlist); 2776552f7358SJed Brown PetscFunctionReturn(0); 2777552f7358SJed Brown } 2778552f7358SJed Brown 2779552f7358SJed Brown #undef __FUNCT__ 2780552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2781552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2782552f7358SJed Brown { 278382f516ccSBarry Smith MPI_Comm comm; 2784552f7358SJed Brown PetscInt dim = 2; 2785552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2786552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2787552f7358SJed Brown struct triangulateio in; 2788552f7358SJed Brown struct triangulateio out; 2789552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2790552f7358SJed Brown PetscMPIInt rank; 2791552f7358SJed Brown PetscErrorCode ierr; 2792552f7358SJed Brown 2793552f7358SJed Brown PetscFunctionBegin; 279482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2795552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2796552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2797552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2798552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27990d644c17SKarl Rupp 2800552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2801552f7358SJed Brown if (in.numberofpoints > 0) { 2802552f7358SJed Brown PetscSection coordSection; 2803552f7358SJed Brown Vec coordinates; 2804552f7358SJed Brown PetscScalar *array; 2805552f7358SJed Brown 2806785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2807785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2808552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 280969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2810552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2811552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2812552f7358SJed Brown const PetscInt idx = v - vStart; 2813552f7358SJed Brown PetscInt off, d; 2814552f7358SJed Brown 2815552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2816552f7358SJed Brown for (d = 0; d < dim; ++d) { 2817552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2818552f7358SJed Brown } 2819552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2820552f7358SJed Brown } 2821552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2822552f7358SJed Brown } 2823552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2824552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2825552f7358SJed Brown if (in.numberofsegments > 0) { 2826785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2827785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2828552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2829552f7358SJed Brown const PetscInt idx = e - eStart; 2830552f7358SJed Brown const PetscInt *cone; 2831552f7358SJed Brown 2832552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 28330d644c17SKarl Rupp 2834552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2835552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 28360d644c17SKarl Rupp 2837552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2838552f7358SJed Brown } 2839552f7358SJed Brown } 2840552f7358SJed Brown #if 0 /* Do not currently support holes */ 2841552f7358SJed Brown PetscReal *holeCoords; 2842552f7358SJed Brown PetscInt h, d; 2843552f7358SJed Brown 2844552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2845552f7358SJed Brown if (in.numberofholes > 0) { 2846785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2847552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2848552f7358SJed Brown for (d = 0; d < dim; ++d) { 2849552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2850552f7358SJed Brown } 2851552f7358SJed Brown } 2852552f7358SJed Brown } 2853552f7358SJed Brown #endif 2854552f7358SJed Brown if (!rank) { 2855552f7358SJed Brown char args[32]; 2856552f7358SJed Brown 2857552f7358SJed Brown /* Take away 'Q' for verbose output */ 2858552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2859552f7358SJed Brown if (createConvexHull) { 2860552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2861552f7358SJed Brown } 2862552f7358SJed Brown if (constrained) { 2863552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2864552f7358SJed Brown } 28650298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2866552f7358SJed Brown } 2867552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2868552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2869552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2870552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2871552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2872552f7358SJed Brown 2873552f7358SJed Brown { 2874552f7358SJed Brown const PetscInt numCorners = 3; 2875552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2876552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2877552f7358SJed Brown const int *cells = out.trianglelist; 2878552f7358SJed Brown const double *meshCoords = out.pointlist; 2879552f7358SJed Brown 28800fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2881552f7358SJed Brown /* Set labels */ 2882552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2883552f7358SJed Brown if (out.pointmarkerlist[v]) { 2884552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2885552f7358SJed Brown } 2886552f7358SJed Brown } 2887552f7358SJed Brown if (interpolate) { 2888552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2889552f7358SJed Brown if (out.edgemarkerlist[e]) { 2890552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2891552f7358SJed Brown const PetscInt *edges; 2892552f7358SJed Brown PetscInt numEdges; 2893552f7358SJed Brown 2894552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2895552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2896552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2897552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2898552f7358SJed Brown } 2899552f7358SJed Brown } 2900552f7358SJed Brown } 2901552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2902552f7358SJed Brown } 2903552f7358SJed Brown #if 0 /* Do not currently support holes */ 2904552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2905552f7358SJed Brown #endif 2906552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2907552f7358SJed Brown PetscFunctionReturn(0); 2908552f7358SJed Brown } 2909552f7358SJed Brown 2910552f7358SJed Brown #undef __FUNCT__ 2911552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2912552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2913552f7358SJed Brown { 291482f516ccSBarry Smith MPI_Comm comm; 2915552f7358SJed Brown PetscInt dim = 2; 2916552f7358SJed Brown struct triangulateio in; 2917552f7358SJed Brown struct triangulateio out; 2918552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2919552f7358SJed Brown PetscMPIInt rank; 2920552f7358SJed Brown PetscErrorCode ierr; 2921552f7358SJed Brown 2922552f7358SJed Brown PetscFunctionBegin; 292382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2924552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2925552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2926552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2927552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2928552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2929552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 29300d644c17SKarl Rupp 2931552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2932552f7358SJed Brown if (in.numberofpoints > 0) { 2933552f7358SJed Brown PetscSection coordSection; 2934552f7358SJed Brown Vec coordinates; 2935552f7358SJed Brown PetscScalar *array; 2936552f7358SJed Brown 2937785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2938785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2939552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 294069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2941552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2942552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2943552f7358SJed Brown const PetscInt idx = v - vStart; 2944552f7358SJed Brown PetscInt off, d; 2945552f7358SJed Brown 2946552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2947552f7358SJed Brown for (d = 0; d < dim; ++d) { 2948552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2949552f7358SJed Brown } 2950552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2951552f7358SJed Brown } 2952552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2953552f7358SJed Brown } 2954552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29550d644c17SKarl Rupp 2956552f7358SJed Brown in.numberofcorners = 3; 2957552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29580d644c17SKarl Rupp 2959552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2960552f7358SJed Brown if (in.numberoftriangles > 0) { 2961785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2962552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2963552f7358SJed Brown const PetscInt idx = c - cStart; 29640298fd71SBarry Smith PetscInt *closure = NULL; 2965552f7358SJed Brown PetscInt closureSize; 2966552f7358SJed Brown 2967552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2968552f7358SJed 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); 2969552f7358SJed Brown for (v = 0; v < 3; ++v) { 2970552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2971552f7358SJed Brown } 2972552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2973552f7358SJed Brown } 2974552f7358SJed Brown } 2975552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2976552f7358SJed Brown #if 0 /* Do not currently support holes */ 2977552f7358SJed Brown PetscReal *holeCoords; 2978552f7358SJed Brown PetscInt h, d; 2979552f7358SJed Brown 2980552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2981552f7358SJed Brown if (in.numberofholes > 0) { 2982785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2983552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2984552f7358SJed Brown for (d = 0; d < dim; ++d) { 2985552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2986552f7358SJed Brown } 2987552f7358SJed Brown } 2988552f7358SJed Brown } 2989552f7358SJed Brown #endif 2990552f7358SJed Brown if (!rank) { 2991552f7358SJed Brown char args[32]; 2992552f7358SJed Brown 2993552f7358SJed Brown /* Take away 'Q' for verbose output */ 2994552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29950298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2996552f7358SJed Brown } 2997552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2998552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2999552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3000552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3001552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3002552f7358SJed Brown 3003552f7358SJed Brown { 3004552f7358SJed Brown const PetscInt numCorners = 3; 3005552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3006552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3007552f7358SJed Brown const int *cells = out.trianglelist; 3008552f7358SJed Brown const double *meshCoords = out.pointlist; 3009552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3010552f7358SJed Brown 30110fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3012552f7358SJed Brown /* Set labels */ 3013552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3014552f7358SJed Brown if (out.pointmarkerlist[v]) { 3015552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3016552f7358SJed Brown } 3017552f7358SJed Brown } 3018552f7358SJed Brown if (interpolate) { 3019552f7358SJed Brown PetscInt e; 3020552f7358SJed Brown 3021552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3022552f7358SJed Brown if (out.edgemarkerlist[e]) { 3023552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3024552f7358SJed Brown const PetscInt *edges; 3025552f7358SJed Brown PetscInt numEdges; 3026552f7358SJed Brown 3027552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3028552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3029552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3030552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3031552f7358SJed Brown } 3032552f7358SJed Brown } 3033552f7358SJed Brown } 3034552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3035552f7358SJed Brown } 3036552f7358SJed Brown #if 0 /* Do not currently support holes */ 3037552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3038552f7358SJed Brown #endif 3039552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3040552f7358SJed Brown PetscFunctionReturn(0); 3041552f7358SJed Brown } 3042552f7358SJed Brown #endif 3043552f7358SJed Brown 3044519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3045552f7358SJed Brown #include <tetgen.h> 3046552f7358SJed Brown #undef __FUNCT__ 3047552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3048552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3049552f7358SJed Brown { 305082f516ccSBarry Smith MPI_Comm comm; 3051552f7358SJed Brown const PetscInt dim = 3; 3052552f7358SJed Brown ::tetgenio in; 3053552f7358SJed Brown ::tetgenio out; 3054552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3055552f7358SJed Brown PetscMPIInt rank; 3056552f7358SJed Brown PetscErrorCode ierr; 3057552f7358SJed Brown 3058552f7358SJed Brown PetscFunctionBegin; 305982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3060552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3061552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3062552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3063552f7358SJed Brown if (in.numberofpoints > 0) { 3064552f7358SJed Brown PetscSection coordSection; 3065552f7358SJed Brown Vec coordinates; 3066552f7358SJed Brown PetscScalar *array; 3067552f7358SJed Brown 3068552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3069552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30700d644c17SKarl Rupp 3071552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 307269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3073552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3074552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3075552f7358SJed Brown const PetscInt idx = v - vStart; 3076552f7358SJed Brown PetscInt off, d; 3077552f7358SJed Brown 3078552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3079a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3080552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3081552f7358SJed Brown } 3082552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3083552f7358SJed Brown } 3084552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30850d644c17SKarl Rupp 3086552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3087552f7358SJed Brown if (in.numberoffacets > 0) { 3088552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3089552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3090552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3091552f7358SJed Brown const PetscInt idx = f - fStart; 30920298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3093552f7358SJed Brown 3094552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3095552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3096552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3097552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3098552f7358SJed Brown 3099552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3100552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3101552f7358SJed Brown const PetscInt point = points[p]; 31020d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3103552f7358SJed Brown } 3104552f7358SJed Brown 3105552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3106552f7358SJed Brown poly->numberofvertices = numVertices; 3107552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3108552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3109552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3110552f7358SJed Brown poly->vertexlist[v] = vIdx; 3111552f7358SJed Brown } 3112552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3113552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3114552f7358SJed Brown } 3115552f7358SJed Brown } 3116552f7358SJed Brown if (!rank) { 3117552f7358SJed Brown char args[32]; 3118552f7358SJed Brown 3119552f7358SJed Brown /* Take away 'Q' for verbose output */ 3120552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3121552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3122552f7358SJed Brown } 3123552f7358SJed Brown { 3124552f7358SJed Brown const PetscInt numCorners = 4; 3125552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3126552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3127552f7358SJed Brown const double *meshCoords = out.pointlist; 31281d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3129552f7358SJed Brown 31309db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 31310fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3132552f7358SJed Brown /* Set labels */ 3133552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3134552f7358SJed Brown if (out.pointmarkerlist[v]) { 3135552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3136552f7358SJed Brown } 3137552f7358SJed Brown } 3138552f7358SJed Brown if (interpolate) { 3139552f7358SJed Brown PetscInt e; 3140552f7358SJed Brown 3141552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3142552f7358SJed Brown if (out.edgemarkerlist[e]) { 3143552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3144552f7358SJed Brown const PetscInt *edges; 3145552f7358SJed Brown PetscInt numEdges; 3146552f7358SJed Brown 3147552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3148552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3149552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3150552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3151552f7358SJed Brown } 3152552f7358SJed Brown } 3153552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3154552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3155552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3156552f7358SJed Brown const PetscInt *faces; 3157552f7358SJed Brown PetscInt numFaces; 3158552f7358SJed Brown 3159552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3160552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3161552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3162552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3163552f7358SJed Brown } 3164552f7358SJed Brown } 3165552f7358SJed Brown } 3166552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3167552f7358SJed Brown } 3168552f7358SJed Brown PetscFunctionReturn(0); 3169552f7358SJed Brown } 3170552f7358SJed Brown 3171552f7358SJed Brown #undef __FUNCT__ 3172552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3173552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3174552f7358SJed Brown { 317582f516ccSBarry Smith MPI_Comm comm; 3176552f7358SJed Brown const PetscInt dim = 3; 3177552f7358SJed Brown ::tetgenio in; 3178552f7358SJed Brown ::tetgenio out; 3179552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3180552f7358SJed Brown PetscMPIInt rank; 3181552f7358SJed Brown PetscErrorCode ierr; 3182552f7358SJed Brown 3183552f7358SJed Brown PetscFunctionBegin; 318482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3185552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3186552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3187552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3188552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31890d644c17SKarl Rupp 3190552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3191552f7358SJed Brown if (in.numberofpoints > 0) { 3192552f7358SJed Brown PetscSection coordSection; 3193552f7358SJed Brown Vec coordinates; 3194552f7358SJed Brown PetscScalar *array; 3195552f7358SJed Brown 3196552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3197552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31980d644c17SKarl Rupp 3199552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 320069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3201552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3202552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3203552f7358SJed Brown const PetscInt idx = v - vStart; 3204552f7358SJed Brown PetscInt off, d; 3205552f7358SJed Brown 3206552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3207a1188b33SMatthew G. Knepley for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3208552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3209552f7358SJed Brown } 3210552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3211552f7358SJed Brown } 3212552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 32130d644c17SKarl Rupp 3214552f7358SJed Brown in.numberofcorners = 4; 3215552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3216552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3217552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3218552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3219552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3220552f7358SJed Brown const PetscInt idx = c - cStart; 32210298fd71SBarry Smith PetscInt *closure = NULL; 3222552f7358SJed Brown PetscInt closureSize; 3223552f7358SJed Brown 3224552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3225552f7358SJed 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); 3226552f7358SJed Brown for (v = 0; v < 4; ++v) { 3227552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3228552f7358SJed Brown } 3229552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3230552f7358SJed Brown } 3231552f7358SJed Brown } 323219436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3233552f7358SJed Brown if (!rank) { 3234552f7358SJed Brown char args[32]; 3235552f7358SJed Brown 3236552f7358SJed Brown /* Take away 'Q' for verbose output */ 323719436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3238552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3239552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3240552f7358SJed Brown } 3241552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3242552f7358SJed Brown 3243552f7358SJed Brown { 3244552f7358SJed Brown const PetscInt numCorners = 4; 3245552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3246552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3247552f7358SJed Brown const double *meshCoords = out.pointlist; 32481d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32491d4b4d7bSJed Brown 3250552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3251552f7358SJed Brown 32529db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32530fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3254552f7358SJed Brown /* Set labels */ 3255552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3256552f7358SJed Brown if (out.pointmarkerlist[v]) { 3257552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3258552f7358SJed Brown } 3259552f7358SJed Brown } 3260552f7358SJed Brown if (interpolate) { 3261552f7358SJed Brown PetscInt e, f; 3262552f7358SJed Brown 3263552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3264552f7358SJed Brown if (out.edgemarkerlist[e]) { 3265552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3266552f7358SJed Brown const PetscInt *edges; 3267552f7358SJed Brown PetscInt numEdges; 3268552f7358SJed Brown 3269552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3270552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3271552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3272552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3273552f7358SJed Brown } 3274552f7358SJed Brown } 3275552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3276552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3277552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3278552f7358SJed Brown const PetscInt *faces; 3279552f7358SJed Brown PetscInt numFaces; 3280552f7358SJed Brown 3281552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3282552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3283552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3284552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3285552f7358SJed Brown } 3286552f7358SJed Brown } 3287552f7358SJed Brown } 3288552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3289552f7358SJed Brown } 3290552f7358SJed Brown PetscFunctionReturn(0); 3291552f7358SJed Brown } 3292552f7358SJed Brown #endif 3293552f7358SJed Brown 3294519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3295aaa7dc30SBarry Smith #include <ctetgen.h> 3296552f7358SJed Brown 3297552f7358SJed Brown #undef __FUNCT__ 3298552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3299552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3300552f7358SJed Brown { 330182f516ccSBarry Smith MPI_Comm comm; 3302552f7358SJed Brown const PetscInt dim = 3; 3303552f7358SJed Brown PLC *in, *out; 3304552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3305552f7358SJed Brown PetscMPIInt rank; 3306552f7358SJed Brown PetscErrorCode ierr; 3307552f7358SJed Brown 3308552f7358SJed Brown PetscFunctionBegin; 330982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 33100298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3311552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3312552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3313552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3314552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 33150d644c17SKarl Rupp 3316552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3317552f7358SJed Brown if (in->numberofpoints > 0) { 3318552f7358SJed Brown PetscSection coordSection; 3319552f7358SJed Brown Vec coordinates; 3320552f7358SJed Brown PetscScalar *array; 3321552f7358SJed Brown 3322785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3323785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3324552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 332569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3326552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3327552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3328552f7358SJed Brown const PetscInt idx = v - vStart; 3329552f7358SJed Brown PetscInt off, d, m; 3330552f7358SJed Brown 3331552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3332552f7358SJed Brown for (d = 0; d < dim; ++d) { 3333552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3334552f7358SJed Brown } 3335552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 33360d644c17SKarl Rupp 3337552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3338552f7358SJed Brown } 3339552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3340552f7358SJed Brown } 3341552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 33420d644c17SKarl Rupp 3343552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3344552f7358SJed Brown if (in->numberoffacets > 0) { 3345785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3346785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3347552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3348552f7358SJed Brown const PetscInt idx = f - fStart; 33490298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3350552f7358SJed Brown polygon *poly; 3351552f7358SJed Brown 3352552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33530d644c17SKarl Rupp 3354785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33550d644c17SKarl Rupp 3356552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33570298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3358552f7358SJed Brown 3359552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3360552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3361552f7358SJed Brown const PetscInt point = points[p]; 33620d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3363552f7358SJed Brown } 3364552f7358SJed Brown 3365552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3366552f7358SJed Brown poly->numberofvertices = numVertices; 3367785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3368552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3369552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3370552f7358SJed Brown poly->vertexlist[v] = vIdx; 3371552f7358SJed Brown } 3372552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3373552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3374552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3375552f7358SJed Brown } 3376552f7358SJed Brown } 3377552f7358SJed Brown if (!rank) { 3378552f7358SJed Brown TetGenOpts t; 3379552f7358SJed Brown 3380552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3381552f7358SJed Brown t.in = boundary; /* Should go away */ 3382552f7358SJed Brown t.plc = 1; 3383552f7358SJed Brown t.quality = 1; 3384552f7358SJed Brown t.edgesout = 1; 3385552f7358SJed Brown t.zeroindex = 1; 3386552f7358SJed Brown t.quiet = 1; 3387552f7358SJed Brown t.verbose = verbose; 3388552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3389552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3390552f7358SJed Brown } 3391552f7358SJed Brown { 3392552f7358SJed Brown const PetscInt numCorners = 4; 3393552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3394552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3395552f7358SJed Brown const double *meshCoords = out->pointlist; 33961d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3397552f7358SJed Brown 33989db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33990fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3400552f7358SJed Brown /* Set labels */ 3401552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3402552f7358SJed Brown if (out->pointmarkerlist[v]) { 3403552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3404552f7358SJed Brown } 3405552f7358SJed Brown } 3406552f7358SJed Brown if (interpolate) { 3407552f7358SJed Brown PetscInt e; 3408552f7358SJed Brown 3409552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3410552f7358SJed Brown if (out->edgemarkerlist[e]) { 3411552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3412552f7358SJed Brown const PetscInt *edges; 3413552f7358SJed Brown PetscInt numEdges; 3414552f7358SJed Brown 3415552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3416552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3417552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3418552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3419552f7358SJed Brown } 3420552f7358SJed Brown } 3421552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3422552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3423552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3424552f7358SJed Brown const PetscInt *faces; 3425552f7358SJed Brown PetscInt numFaces; 3426552f7358SJed Brown 3427552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3428552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3429552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3430552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3431552f7358SJed Brown } 3432552f7358SJed Brown } 3433552f7358SJed Brown } 3434552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3435552f7358SJed Brown } 3436552f7358SJed Brown 3437552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3438552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3439552f7358SJed Brown PetscFunctionReturn(0); 3440552f7358SJed Brown } 3441552f7358SJed Brown 3442552f7358SJed Brown #undef __FUNCT__ 3443552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3444552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3445552f7358SJed Brown { 344682f516ccSBarry Smith MPI_Comm comm; 3447552f7358SJed Brown const PetscInt dim = 3; 3448552f7358SJed Brown PLC *in, *out; 3449552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3450552f7358SJed Brown PetscMPIInt rank; 3451552f7358SJed Brown PetscErrorCode ierr; 3452552f7358SJed Brown 3453552f7358SJed Brown PetscFunctionBegin; 345482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34550298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3456552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3457552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3458552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3459552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3460552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3461552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34620d644c17SKarl Rupp 3463552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3464552f7358SJed Brown if (in->numberofpoints > 0) { 3465552f7358SJed Brown PetscSection coordSection; 3466552f7358SJed Brown Vec coordinates; 3467552f7358SJed Brown PetscScalar *array; 3468552f7358SJed Brown 3469785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3470785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3471552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 347269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3473552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3474552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3475552f7358SJed Brown const PetscInt idx = v - vStart; 3476552f7358SJed Brown PetscInt off, d, m; 3477552f7358SJed Brown 3478552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3479552f7358SJed Brown for (d = 0; d < dim; ++d) { 3480552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3481552f7358SJed Brown } 3482552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34830d644c17SKarl Rupp 3484552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3485552f7358SJed Brown } 3486552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3487552f7358SJed Brown } 3488552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34890d644c17SKarl Rupp 3490552f7358SJed Brown in->numberofcorners = 4; 3491552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3492552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3493552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3494785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3495552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3496552f7358SJed Brown const PetscInt idx = c - cStart; 34970298fd71SBarry Smith PetscInt *closure = NULL; 3498552f7358SJed Brown PetscInt closureSize; 3499552f7358SJed Brown 3500552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3501552f7358SJed 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); 3502552f7358SJed Brown for (v = 0; v < 4; ++v) { 3503552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3504552f7358SJed Brown } 3505552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3506552f7358SJed Brown } 3507552f7358SJed Brown } 3508552f7358SJed Brown if (!rank) { 3509552f7358SJed Brown TetGenOpts t; 3510552f7358SJed Brown 3511552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 35120d644c17SKarl Rupp 3513552f7358SJed Brown t.in = dm; /* Should go away */ 3514552f7358SJed Brown t.refine = 1; 3515552f7358SJed Brown t.varvolume = 1; 3516552f7358SJed Brown t.quality = 1; 3517552f7358SJed Brown t.edgesout = 1; 3518552f7358SJed Brown t.zeroindex = 1; 3519552f7358SJed Brown t.quiet = 1; 3520552f7358SJed Brown t.verbose = verbose; /* Change this */ 35210d644c17SKarl Rupp 3522552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3523552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3524552f7358SJed Brown } 3525552f7358SJed Brown { 3526552f7358SJed Brown const PetscInt numCorners = 4; 3527552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3528552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3529552f7358SJed Brown const double *meshCoords = out->pointlist; 35301d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3531552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3532552f7358SJed Brown 35339db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 35340fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3535552f7358SJed Brown /* Set labels */ 3536552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3537552f7358SJed Brown if (out->pointmarkerlist[v]) { 3538552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3539552f7358SJed Brown } 3540552f7358SJed Brown } 3541552f7358SJed Brown if (interpolate) { 3542552f7358SJed Brown PetscInt e, f; 3543552f7358SJed Brown 3544552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3545552f7358SJed Brown if (out->edgemarkerlist[e]) { 3546552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3547552f7358SJed Brown const PetscInt *edges; 3548552f7358SJed Brown PetscInt numEdges; 3549552f7358SJed Brown 3550552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3551552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3552552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3553552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3554552f7358SJed Brown } 3555552f7358SJed Brown } 3556552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3557552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3558552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3559552f7358SJed Brown const PetscInt *faces; 3560552f7358SJed Brown PetscInt numFaces; 3561552f7358SJed Brown 3562552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3563552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3564552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3565552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3566552f7358SJed Brown } 3567552f7358SJed Brown } 3568552f7358SJed Brown } 3569552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3570552f7358SJed Brown } 3571552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3572552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3573552f7358SJed Brown PetscFunctionReturn(0); 3574552f7358SJed Brown } 3575552f7358SJed Brown #endif 3576552f7358SJed Brown 3577552f7358SJed Brown #undef __FUNCT__ 3578552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3579552f7358SJed Brown /*@C 3580552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3581552f7358SJed Brown 3582552f7358SJed Brown Not Collective 3583552f7358SJed Brown 3584552f7358SJed Brown Input Parameters: 3585552f7358SJed Brown + boundary - The DMPlex boundary object 3586552f7358SJed Brown . name - The mesh generation package name 3587552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3588552f7358SJed Brown 3589552f7358SJed Brown Output Parameter: 3590552f7358SJed Brown . mesh - The DMPlex object 3591552f7358SJed Brown 3592552f7358SJed Brown Level: intermediate 3593552f7358SJed Brown 3594552f7358SJed Brown .keywords: mesh, elements 3595552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3596552f7358SJed Brown @*/ 3597552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3598552f7358SJed Brown { 3599552f7358SJed Brown PetscInt dim; 3600552f7358SJed Brown char genname[1024]; 3601552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3602552f7358SJed Brown PetscErrorCode ierr; 3603552f7358SJed Brown 3604552f7358SJed Brown PetscFunctionBegin; 3605552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3606552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3607c73cfb54SMatthew G. Knepley ierr = DMGetDimension(boundary, &dim);CHKERRQ(ierr); 3608552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36090d644c17SKarl Rupp if (flg) name = genname; 3610552f7358SJed Brown if (name) { 3611552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3612552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3613552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3614552f7358SJed Brown } 3615552f7358SJed Brown switch (dim) { 3616552f7358SJed Brown case 1: 3617552f7358SJed Brown if (!name || isTriangle) { 3618519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3619552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3620552f7358SJed Brown #else 362182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3622552f7358SJed Brown #endif 362382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3624552f7358SJed Brown break; 3625552f7358SJed Brown case 2: 3626552f7358SJed Brown if (!name || isCTetgen) { 3627519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3628552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3629552f7358SJed Brown #else 363082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3631552f7358SJed Brown #endif 3632552f7358SJed Brown } else if (isTetgen) { 3633519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3634552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3635552f7358SJed Brown #else 363682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3637552f7358SJed Brown #endif 363882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3639552f7358SJed Brown break; 3640552f7358SJed Brown default: 364182f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3642552f7358SJed Brown } 3643552f7358SJed Brown PetscFunctionReturn(0); 3644552f7358SJed Brown } 3645552f7358SJed Brown 3646552f7358SJed Brown #undef __FUNCT__ 3647552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3648552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3649552f7358SJed Brown { 3650552f7358SJed Brown PetscReal refinementLimit; 3651552f7358SJed Brown PetscInt dim, cStart, cEnd; 36520298fd71SBarry Smith char genname[1024], *name = NULL; 3653552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3654552f7358SJed Brown PetscErrorCode ierr; 3655552f7358SJed Brown 3656552f7358SJed Brown PetscFunctionBegin; 3657552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3658552f7358SJed Brown if (isUniform) { 3659552f7358SJed Brown CellRefiner cellRefiner; 3660552f7358SJed Brown 3661509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3662509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 36638e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3664552f7358SJed Brown PetscFunctionReturn(0); 3665552f7358SJed Brown } 3666552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3667552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3668c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 3669552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3670552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36710d644c17SKarl Rupp if (flg) name = genname; 3672552f7358SJed Brown if (name) { 3673552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3674552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3675552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3676552f7358SJed Brown } 3677552f7358SJed Brown switch (dim) { 3678552f7358SJed Brown case 2: 3679552f7358SJed Brown if (!name || isTriangle) { 3680519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3681552f7358SJed Brown double *maxVolumes; 3682552f7358SJed Brown PetscInt c; 3683552f7358SJed Brown 3684785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36850d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3686552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36876b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3688552f7358SJed Brown #else 368982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3690552f7358SJed Brown #endif 369182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3692552f7358SJed Brown break; 3693552f7358SJed Brown case 3: 3694552f7358SJed Brown if (!name || isCTetgen) { 3695519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3696552f7358SJed Brown PetscReal *maxVolumes; 3697552f7358SJed Brown PetscInt c; 3698552f7358SJed Brown 3699785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37000d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3701552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3702552f7358SJed Brown #else 370382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3704552f7358SJed Brown #endif 3705552f7358SJed Brown } else if (isTetgen) { 3706519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3707552f7358SJed Brown double *maxVolumes; 3708552f7358SJed Brown PetscInt c; 3709552f7358SJed Brown 3710785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 37110d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3712552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3713552f7358SJed Brown #else 371482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3715552f7358SJed Brown #endif 371682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3717552f7358SJed Brown break; 3718552f7358SJed Brown default: 371982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3720552f7358SJed Brown } 37218e136ac0SMatthew G. Knepley ierr = DMPlexCopyBoundary(dm, *dmRefined);CHKERRQ(ierr); 3722552f7358SJed Brown PetscFunctionReturn(0); 3723552f7358SJed Brown } 3724552f7358SJed Brown 3725552f7358SJed Brown #undef __FUNCT__ 37260a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 37270a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 37280a6ba040SMatthew G. Knepley { 37290a6ba040SMatthew G. Knepley DM cdm = dm; 37300a6ba040SMatthew G. Knepley PetscInt r; 37310a6ba040SMatthew G. Knepley PetscBool isUniform; 37320a6ba040SMatthew G. Knepley PetscErrorCode ierr; 37330a6ba040SMatthew G. Knepley 37340a6ba040SMatthew G. Knepley PetscFunctionBegin; 37350a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 37360a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 37370a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 37380a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 37390a6ba040SMatthew G. Knepley 37400a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 37410a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 37420a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 37430a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 37440a6ba040SMatthew G. Knepley } 37450a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37460a6ba040SMatthew G. Knepley } 37470a6ba040SMatthew G. Knepley 37480a6ba040SMatthew G. Knepley #undef __FUNCT__ 37490a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37500a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37510a6ba040SMatthew G. Knepley { 37520a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3753549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37540a6ba040SMatthew G. Knepley 37550a6ba040SMatthew G. Knepley PetscFunctionBegin; 3756549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37570a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37580a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37590a6ba040SMatthew G. Knepley } 37600a6ba040SMatthew G. Knepley 37610a6ba040SMatthew G. Knepley #undef __FUNCT__ 3762d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinate_Internal" 3763d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3764d49fcaecSMatthew G. Knepley { 3765d49fcaecSMatthew G. Knepley PetscInt d; 3766d49fcaecSMatthew G. Knepley 3767d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3768d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3769d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] = in[d]; 3770d49fcaecSMatthew G. Knepley } else { 3771d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3772d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3773858aadebSMatthew G. Knepley out[d] = PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3774d49fcaecSMatthew G. Knepley } else { 3775d49fcaecSMatthew G. Knepley out[d] = in[d]; 3776d49fcaecSMatthew G. Knepley } 3777d49fcaecSMatthew G. Knepley } 3778d49fcaecSMatthew G. Knepley } 3779d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3780d49fcaecSMatthew G. Knepley } 3781d49fcaecSMatthew G. Knepley 3782d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3783d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeAddCoordinate_Internal" 3784d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeAddCoordinate_Internal(DM dm, PetscInt dim, const PetscScalar anchor[], const PetscScalar in[], PetscScalar out[]) 3785d49fcaecSMatthew G. Knepley { 3786d49fcaecSMatthew G. Knepley PetscInt d; 3787d49fcaecSMatthew G. Knepley 3788d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3789d49fcaecSMatthew G. Knepley if (!dm->maxCell) { 3790d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) out[d] += in[d]; 3791d49fcaecSMatthew G. Knepley } else { 3792d49fcaecSMatthew G. Knepley for (d = 0; d < dim; ++d) { 3793d49fcaecSMatthew G. Knepley if (PetscAbsScalar(anchor[d] - in[d]) > dm->maxCell[d]) { 3794858aadebSMatthew G. Knepley out[d] += PetscRealPart(anchor[d]) > PetscRealPart(in[d]) ? dm->L[d] + in[d] : in[d] - dm->L[d]; 3795d49fcaecSMatthew G. Knepley } else { 3796d49fcaecSMatthew G. Knepley out[d] += in[d]; 3797d49fcaecSMatthew G. Knepley } 3798d49fcaecSMatthew G. Knepley } 3799d49fcaecSMatthew G. Knepley } 3800d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3801d49fcaecSMatthew G. Knepley } 3802d49fcaecSMatthew G. Knepley 3803d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3804d49fcaecSMatthew G. Knepley #define __FUNCT__ "DMPlexLocalizeCoordinates" 3805d49fcaecSMatthew G. Knepley PetscErrorCode DMPlexLocalizeCoordinates(DM dm) 3806d49fcaecSMatthew G. Knepley { 3807d49fcaecSMatthew G. Knepley PetscSection coordSection, cSection; 3808d49fcaecSMatthew G. Knepley Vec coordinates, cVec; 3809d49fcaecSMatthew G. Knepley PetscScalar *coords, *coords2, *anchor; 38108c7f9fc6SMatthew G. Knepley PetscInt Nc, cStart, cEnd, c, vStart, vEnd, v, dof, d, off, off2, bs, coordSize; 3811d49fcaecSMatthew G. Knepley PetscErrorCode ierr; 3812d49fcaecSMatthew G. Knepley 3813d49fcaecSMatthew G. Knepley PetscFunctionBegin; 3814d49fcaecSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3815d49fcaecSMatthew G. Knepley if (!dm->maxCell) PetscFunctionReturn(0); 3816d49fcaecSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3817d49fcaecSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3818d49fcaecSMatthew G. Knepley ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3819d49fcaecSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3820d49fcaecSMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) dm), &cSection);CHKERRQ(ierr); 38218c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetNumFields(cSection, 1);CHKERRQ(ierr); 38228c7f9fc6SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(coordSection, 0, &Nc);CHKERRQ(ierr); 38238c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldComponents(cSection, 0, Nc);CHKERRQ(ierr); 3824d49fcaecSMatthew G. Knepley ierr = PetscSectionSetChart(cSection, cStart, vEnd);CHKERRQ(ierr); 3825d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3826d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3827d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, v, dof);CHKERRQ(ierr); 38288c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, v, 0, dof);CHKERRQ(ierr); 3829d49fcaecSMatthew G. Knepley } 3830d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3831d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, NULL);CHKERRQ(ierr); 3832d49fcaecSMatthew G. Knepley ierr = PetscSectionSetDof(cSection, c, dof);CHKERRQ(ierr); 38338c7f9fc6SMatthew G. Knepley ierr = PetscSectionSetFieldDof(cSection, c, 0, dof);CHKERRQ(ierr); 3834d49fcaecSMatthew G. Knepley } 3835d49fcaecSMatthew G. Knepley ierr = PetscSectionSetUp(cSection);CHKERRQ(ierr); 3836d49fcaecSMatthew G. Knepley ierr = PetscSectionGetStorageSize(cSection, &coordSize);CHKERRQ(ierr); 3837d49fcaecSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cVec);CHKERRQ(ierr); 3838d49fcaecSMatthew G. Knepley ierr = VecGetBlockSize(coordinates, &bs);CHKERRQ(ierr); 3839d49fcaecSMatthew G. Knepley ierr = VecSetBlockSize(cVec, bs);CHKERRQ(ierr); 3840d49fcaecSMatthew G. Knepley ierr = VecSetSizes(cVec, coordSize, PETSC_DETERMINE);CHKERRQ(ierr); 3841d49fcaecSMatthew G. Knepley ierr = VecSetType(cVec,VECSTANDARD);CHKERRQ(ierr); 3842d49fcaecSMatthew G. Knepley ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 3843d49fcaecSMatthew G. Knepley ierr = VecGetArray(cVec, &coords2);CHKERRQ(ierr); 3844d49fcaecSMatthew G. Knepley for (v = vStart; v < vEnd; ++v) { 3845d49fcaecSMatthew G. Knepley ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 3846d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3847d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, v, &off2);CHKERRQ(ierr); 3848d49fcaecSMatthew G. Knepley for (d = 0; d < dof; ++d) coords2[off2+d] = coords[off+d]; 3849d49fcaecSMatthew G. Knepley } 3850d49fcaecSMatthew G. Knepley ierr = DMGetWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3851d49fcaecSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 3852d49fcaecSMatthew G. Knepley PetscScalar *cellCoords = NULL; 3853d49fcaecSMatthew G. Knepley PetscInt b; 3854d49fcaecSMatthew G. Knepley 3855d49fcaecSMatthew G. Knepley ierr = DMPlexVecGetClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3856d49fcaecSMatthew G. Knepley ierr = PetscSectionGetOffset(cSection, c, &off2);CHKERRQ(ierr); 3857d49fcaecSMatthew G. Knepley for (b = 0; b < bs; ++b) anchor[b] = cellCoords[b]; 3858d49fcaecSMatthew G. Knepley for (d = 0; d < dof/bs; ++d) {ierr = DMPlexLocalizeCoordinate_Internal(dm, bs, anchor, &cellCoords[d*bs], &coords2[off2+d*bs]);CHKERRQ(ierr);} 3859d49fcaecSMatthew G. Knepley ierr = DMPlexVecRestoreClosure(dm, coordSection, coordinates, c, &dof, &cellCoords);CHKERRQ(ierr); 3860d49fcaecSMatthew G. Knepley } 3861d49fcaecSMatthew G. Knepley ierr = DMRestoreWorkArray(dm, 3, PETSC_SCALAR, &anchor);CHKERRQ(ierr); 3862d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 3863d49fcaecSMatthew G. Knepley ierr = VecRestoreArray(cVec, &coords2);CHKERRQ(ierr); 386446e270d4SMatthew G. Knepley ierr = DMSetCoordinateSection(dm, PETSC_DETERMINE, cSection);CHKERRQ(ierr); 3865d49fcaecSMatthew G. Knepley ierr = DMSetCoordinatesLocal(dm, cVec);CHKERRQ(ierr); 3866d49fcaecSMatthew G. Knepley ierr = VecDestroy(&cVec);CHKERRQ(ierr); 3867d49fcaecSMatthew G. Knepley ierr = PetscSectionDestroy(&cSection);CHKERRQ(ierr); 3868d49fcaecSMatthew G. Knepley PetscFunctionReturn(0); 3869d49fcaecSMatthew G. Knepley } 3870d49fcaecSMatthew G. Knepley 3871d49fcaecSMatthew G. Knepley #undef __FUNCT__ 3872aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3873552f7358SJed Brown /*@ 3874aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3875552f7358SJed Brown 3876552f7358SJed Brown Not Collective 3877552f7358SJed Brown 3878aa50250dSMatthew G. Knepley Input Parameter: 3879552f7358SJed Brown . dm - The DMPlex object 3880552f7358SJed Brown 3881aa50250dSMatthew G. Knepley Output Parameter: 3882aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3883552f7358SJed Brown 3884552f7358SJed Brown Level: developer 3885552f7358SJed Brown 3886aa50250dSMatthew G. Knepley .keywords: mesh, points 3887aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3888aa50250dSMatthew G. Knepley @*/ 3889aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3890aa50250dSMatthew G. Knepley { 3891aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3892aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3893aa50250dSMatthew G. Knepley 3894aa50250dSMatthew G. Knepley PetscFunctionBegin; 3895aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3896aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 389763d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3898aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3899aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3900aa50250dSMatthew G. Knepley } 3901aa50250dSMatthew G. Knepley 3902aa50250dSMatthew G. Knepley #undef __FUNCT__ 3903aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3904aa50250dSMatthew G. Knepley /*@ 3905aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3906aa50250dSMatthew G. Knepley 3907aa50250dSMatthew G. Knepley Not Collective 3908aa50250dSMatthew G. Knepley 3909aa50250dSMatthew G. Knepley Input Parameter: 3910aa50250dSMatthew G. Knepley . dm - The DMPlex object 3911aa50250dSMatthew G. Knepley 3912aa50250dSMatthew G. Knepley Output Parameter: 3913aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3914aa50250dSMatthew G. Knepley 3915aa50250dSMatthew G. Knepley Level: developer 3916552f7358SJed Brown 3917552f7358SJed Brown .keywords: mesh, points 3918aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3919552f7358SJed Brown @*/ 3920552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3921552f7358SJed Brown { 3922aa50250dSMatthew G. Knepley DMLabel label; 3923aa50250dSMatthew G. Knepley PetscInt d = 0; 3924552f7358SJed Brown PetscErrorCode ierr; 3925552f7358SJed Brown 3926552f7358SJed Brown PetscFunctionBegin; 3927552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3928552f7358SJed Brown PetscValidPointer(depth, 2); 3929aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3930aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3931552f7358SJed Brown *depth = d-1; 3932552f7358SJed Brown PetscFunctionReturn(0); 3933552f7358SJed Brown } 3934552f7358SJed Brown 3935552f7358SJed Brown #undef __FUNCT__ 3936552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3937552f7358SJed Brown /*@ 3938552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3939552f7358SJed Brown 3940552f7358SJed Brown Not Collective 3941552f7358SJed Brown 3942552f7358SJed Brown Input Parameters: 3943552f7358SJed Brown + dm - The DMPlex object 3944552f7358SJed Brown - stratumValue - The requested depth 3945552f7358SJed Brown 3946552f7358SJed Brown Output Parameters: 3947552f7358SJed Brown + start - The first point at this depth 3948552f7358SJed Brown - end - One beyond the last point at this depth 3949552f7358SJed Brown 3950552f7358SJed Brown Level: developer 3951552f7358SJed Brown 3952552f7358SJed Brown .keywords: mesh, points 3953552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3954552f7358SJed Brown @*/ 39550adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39560adebc6cSBarry Smith { 3957aa50250dSMatthew G. Knepley DMLabel label; 395863d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3959552f7358SJed Brown PetscErrorCode ierr; 3960552f7358SJed Brown 3961552f7358SJed Brown PetscFunctionBegin; 3962552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 396363d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 396463d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3965552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 39660d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 396763d1a920SMatthew G. Knepley if (stratumValue < 0) { 396863d1a920SMatthew G. Knepley if (start) *start = pStart; 396963d1a920SMatthew G. Knepley if (end) *end = pEnd; 397063d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3971552f7358SJed Brown } 3972aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 397363d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 397463d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3975552f7358SJed Brown PetscFunctionReturn(0); 3976552f7358SJed Brown } 3977552f7358SJed Brown 3978552f7358SJed Brown #undef __FUNCT__ 3979552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3980552f7358SJed Brown /*@ 3981552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3982552f7358SJed Brown 3983552f7358SJed Brown Not Collective 3984552f7358SJed Brown 3985552f7358SJed Brown Input Parameters: 3986552f7358SJed Brown + dm - The DMPlex object 3987552f7358SJed Brown - stratumValue - The requested height 3988552f7358SJed Brown 3989552f7358SJed Brown Output Parameters: 3990552f7358SJed Brown + start - The first point at this height 3991552f7358SJed Brown - end - One beyond the last point at this height 3992552f7358SJed Brown 3993552f7358SJed Brown Level: developer 3994552f7358SJed Brown 3995552f7358SJed Brown .keywords: mesh, points 3996552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3997552f7358SJed Brown @*/ 39980adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 39990adebc6cSBarry Smith { 4000aa50250dSMatthew G. Knepley DMLabel label; 400163d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4002552f7358SJed Brown PetscErrorCode ierr; 4003552f7358SJed Brown 4004552f7358SJed Brown PetscFunctionBegin; 4005552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 400663d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 400763d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4008552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 40090d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 401063d1a920SMatthew G. Knepley if (stratumValue < 0) { 401163d1a920SMatthew G. Knepley if (start) *start = pStart; 401263d1a920SMatthew G. Knepley if (end) *end = pEnd; 401363d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4014552f7358SJed Brown } 4015aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4016aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 401763d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 401863d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4019552f7358SJed Brown PetscFunctionReturn(0); 4020552f7358SJed Brown } 4021552f7358SJed Brown 4022552f7358SJed Brown #undef __FUNCT__ 4023552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4024552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4025a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4026a6dfd86eSKarl Rupp { 4027552f7358SJed Brown PetscInt *numDofTot; 4028916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4029916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4030552f7358SJed Brown PetscErrorCode ierr; 4031552f7358SJed Brown 4032552f7358SJed Brown PetscFunctionBegin; 4033785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4034552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4035552f7358SJed Brown numDofTot[d] = 0; 40360d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4037552f7358SJed Brown } 403882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4039552f7358SJed Brown if (numFields > 0) { 4040552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4041552f7358SJed Brown if (numComp) { 4042552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4043552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4044552f7358SJed Brown } 4045552f7358SJed Brown } 4046552f7358SJed Brown } 4047552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4048552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4049916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4050916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4051916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4052916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4053552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4054552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4055552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4056552f7358SJed Brown } 4057552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4058552f7358SJed Brown } 4059552f7358SJed Brown } 4060552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4061552f7358SJed Brown PetscFunctionReturn(0); 4062552f7358SJed Brown } 4063552f7358SJed Brown 4064552f7358SJed Brown #undef __FUNCT__ 4065552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4066552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4067552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4068552f7358SJed Brown */ 4069a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4070a6dfd86eSKarl Rupp { 4071552f7358SJed Brown PetscInt numFields; 4072552f7358SJed Brown PetscInt bc; 4073a68b90caSToby Isaac PetscSection aSec; 4074552f7358SJed Brown PetscErrorCode ierr; 4075552f7358SJed Brown 4076552f7358SJed Brown PetscFunctionBegin; 4077552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4078552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4079552f7358SJed Brown PetscInt field = 0; 4080552f7358SJed Brown const PetscInt *idx; 4081552f7358SJed Brown PetscInt n, i; 4082552f7358SJed Brown 40830d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4084552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4085552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4086552f7358SJed Brown for (i = 0; i < n; ++i) { 4087552f7358SJed Brown const PetscInt p = idx[i]; 4088552f7358SJed Brown PetscInt numConst = constDof; 4089552f7358SJed Brown 4090552f7358SJed Brown /* Constrain every dof on the point */ 4091552f7358SJed Brown if (numConst < 0) { 4092552f7358SJed Brown if (numFields) { 4093552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4094552f7358SJed Brown } else { 4095552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4096552f7358SJed Brown } 4097552f7358SJed Brown } 4098552f7358SJed Brown if (numFields) { 4099552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4100552f7358SJed Brown } 4101552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4102552f7358SJed Brown } 4103552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4104552f7358SJed Brown } 4105a68b90caSToby Isaac ierr = DMPlexGetConstraints(dm, &aSec, NULL);CHKERRQ(ierr); 4106a68b90caSToby Isaac if (aSec) { 4107a68b90caSToby Isaac PetscInt aStart, aEnd, a; 4108a68b90caSToby Isaac 4109a68b90caSToby Isaac ierr = PetscSectionGetChart(aSec, &aStart, &aEnd);CHKERRQ(ierr); 4110a68b90caSToby Isaac for (a = aStart; a < aEnd; a++) { 4111a68b90caSToby Isaac PetscInt dof; 4112a68b90caSToby Isaac 4113a68b90caSToby Isaac ierr = PetscSectionGetDof(aSec, a, &dof);CHKERRQ(ierr); 4114a68b90caSToby Isaac if (dof) { 4115a68b90caSToby Isaac /* if there are point-to-point constraints, then all dofs are constrained */ 4116a68b90caSToby Isaac ierr = PetscSectionGetDof(section, a, &dof);CHKERRQ(ierr); 4117a68b90caSToby Isaac ierr = PetscSectionSetConstraintDof(section, a, dof);CHKERRQ(ierr); 4118a68b90caSToby Isaac if (numFields) { 4119a68b90caSToby Isaac PetscInt f; 4120a68b90caSToby Isaac 4121a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 4122a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &dof);CHKERRQ(ierr); 4123a68b90caSToby Isaac ierr = PetscSectionSetFieldConstraintDof(section, a, f, dof);CHKERRQ(ierr); 4124a68b90caSToby Isaac } 4125a68b90caSToby Isaac } 4126a68b90caSToby Isaac } 4127a68b90caSToby Isaac } 4128a68b90caSToby Isaac } 4129552f7358SJed Brown PetscFunctionReturn(0); 4130552f7358SJed Brown } 4131552f7358SJed Brown 4132552f7358SJed Brown #undef __FUNCT__ 4133552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4134552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 41350adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 41360adebc6cSBarry Smith { 4137552f7358SJed Brown PetscInt *maxConstraints; 4138552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4139552f7358SJed Brown PetscErrorCode ierr; 4140552f7358SJed Brown 4141552f7358SJed Brown PetscFunctionBegin; 4142552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4143552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4144785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 41450d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4146552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4147552f7358SJed Brown PetscInt cdof; 4148552f7358SJed Brown 4149552f7358SJed Brown if (numFields) { 4150552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4151552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4152552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4153552f7358SJed Brown } 4154552f7358SJed Brown } else { 4155552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4156552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4157552f7358SJed Brown } 4158552f7358SJed Brown } 4159552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4160552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4161552f7358SJed Brown } 4162552f7358SJed Brown if (maxConstraints[numFields]) { 4163552f7358SJed Brown PetscInt *indices; 4164552f7358SJed Brown 4165785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4166552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4167552f7358SJed Brown PetscInt cdof, d; 4168552f7358SJed Brown 4169552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4170552f7358SJed Brown if (cdof) { 4171552f7358SJed 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]); 4172552f7358SJed Brown if (numFields) { 4173552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4174552f7358SJed Brown 4175552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4176552f7358SJed Brown PetscInt cfdof, fdof; 4177552f7358SJed Brown 4178552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4179552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4180552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 41810d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4182552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 41830d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4184552f7358SJed Brown numConst += cfdof; 4185552f7358SJed Brown foff += fdof; 4186552f7358SJed Brown } 4187552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4188552f7358SJed Brown } else { 41890d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4190552f7358SJed Brown } 4191552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4192552f7358SJed Brown } 4193552f7358SJed Brown } 4194552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4195552f7358SJed Brown } 4196552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4197552f7358SJed Brown PetscFunctionReturn(0); 4198552f7358SJed Brown } 4199552f7358SJed Brown 4200552f7358SJed Brown #undef __FUNCT__ 4201552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4202552f7358SJed Brown /* Set the constrained field indices on each point */ 42030adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 42040adebc6cSBarry Smith { 4205552f7358SJed Brown const PetscInt *points, *indices; 4206552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4207552f7358SJed Brown PetscErrorCode ierr; 4208552f7358SJed Brown 4209552f7358SJed Brown PetscFunctionBegin; 4210552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4211552f7358SJed 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); 4212552f7358SJed Brown 4213552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4214552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4215552f7358SJed Brown if (!constraintIndices) { 4216552f7358SJed Brown PetscInt *idx, i; 4217552f7358SJed Brown 4218552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4219785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 42200d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4221552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4222552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4223552f7358SJed Brown } 4224552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4225552f7358SJed Brown } else { 4226552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4227552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4228552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4229552f7358SJed Brown PetscInt fcdof; 4230552f7358SJed Brown 4231552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 423282f516ccSBarry 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); 4233552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4234552f7358SJed Brown } 4235552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4236552f7358SJed Brown } 4237552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4238552f7358SJed Brown PetscFunctionReturn(0); 4239552f7358SJed Brown } 4240552f7358SJed Brown 4241552f7358SJed Brown #undef __FUNCT__ 4242552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4243552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 42440adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 42450adebc6cSBarry Smith { 4246552f7358SJed Brown PetscInt *indices; 4247552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4248552f7358SJed Brown PetscErrorCode ierr; 4249552f7358SJed Brown 4250552f7358SJed Brown PetscFunctionBegin; 4251552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4252785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4253552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 425482f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4255552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4256552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4257552f7358SJed Brown PetscInt cdof, d; 4258552f7358SJed Brown 4259552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4260552f7358SJed Brown if (cdof) { 4261552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4262552f7358SJed Brown 4263552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4264552f7358SJed Brown const PetscInt *fcind; 4265552f7358SJed Brown PetscInt fdof, fcdof; 4266552f7358SJed Brown 4267552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4268552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4269552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4270552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 42710d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4272552f7358SJed Brown foff += fdof; 4273552f7358SJed Brown numConst += fcdof; 4274552f7358SJed Brown } 427582f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4276552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4277552f7358SJed Brown } 4278552f7358SJed Brown } 4279552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4280552f7358SJed Brown PetscFunctionReturn(0); 4281552f7358SJed Brown } 4282552f7358SJed Brown 4283552f7358SJed Brown #undef __FUNCT__ 4284552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4285552f7358SJed Brown /*@C 4286552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4287552f7358SJed Brown 4288552f7358SJed Brown Not Collective 4289552f7358SJed Brown 4290552f7358SJed Brown Input Parameters: 4291552f7358SJed Brown + dm - The DMPlex object 4292552f7358SJed Brown . dim - The spatial dimension of the problem 4293552f7358SJed Brown . numFields - The number of fields in the problem 4294552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4295552f7358SJed 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 4296552f7358SJed Brown . numBC - The number of boundary conditions 4297552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4298f8f126e8SMatthew G. Knepley . bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4299f8f126e8SMatthew G. Knepley - perm - Optional permutation of the chart, or NULL 4300552f7358SJed Brown 4301552f7358SJed Brown Output Parameter: 4302552f7358SJed Brown . section - The PetscSection object 4303552f7358SJed Brown 4304552f7358SJed 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 4305f8f126e8SMatthew G. Knepley number of dof for field 0 on each edge. 4306f8f126e8SMatthew G. Knepley 4307f8f126e8SMatthew G. Knepley The chart permutation is the same one set using PetscSectionSetPermutation() 4308552f7358SJed Brown 4309552f7358SJed Brown Level: developer 4310552f7358SJed Brown 43113813dfbdSMatthew G Knepley Fortran Notes: 43123813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 43133813dfbdSMatthew G Knepley 4314552f7358SJed Brown .keywords: mesh, elements 4315f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation() 4316552f7358SJed Brown @*/ 4317f8f126e8SMatthew 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) 4318a6dfd86eSKarl Rupp { 4319a68b90caSToby Isaac PetscSection aSec; 4320552f7358SJed Brown PetscErrorCode ierr; 4321552f7358SJed Brown 4322552f7358SJed Brown PetscFunctionBegin; 4323552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4324552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4325f8f126e8SMatthew G. Knepley if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);} 4326552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4327a68b90caSToby Isaac ierr = DMPlexGetConstraints(dm,&aSec,NULL);CHKERRQ(ierr); 4328a68b90caSToby Isaac if (numBC || aSec) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4329ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4330552f7358SJed Brown PetscFunctionReturn(0); 4331552f7358SJed Brown } 4332552f7358SJed Brown 4333552f7358SJed Brown #undef __FUNCT__ 4334552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 43350adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 43360adebc6cSBarry Smith { 4337552f7358SJed Brown PetscSection section; 4338552f7358SJed Brown PetscErrorCode ierr; 4339552f7358SJed Brown 4340552f7358SJed Brown PetscFunctionBegin; 434138221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 434282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4343552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 43441d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4345552f7358SJed Brown PetscFunctionReturn(0); 4346552f7358SJed Brown } 4347552f7358SJed Brown 4348552f7358SJed Brown #undef __FUNCT__ 4349552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 43500adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 43510adebc6cSBarry Smith { 4352552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4353552f7358SJed Brown 4354552f7358SJed Brown PetscFunctionBegin; 4355552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4356552f7358SJed Brown if (section) *section = mesh->coneSection; 4357552f7358SJed Brown PetscFunctionReturn(0); 4358552f7358SJed Brown } 4359552f7358SJed Brown 4360552f7358SJed Brown #undef __FUNCT__ 43618cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 43628cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 43638cb4d582SMatthew G. Knepley { 43648cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 43658cb4d582SMatthew G. Knepley 43668cb4d582SMatthew G. Knepley PetscFunctionBegin; 43678cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 43688cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 43698cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 43708cb4d582SMatthew G. Knepley } 43718cb4d582SMatthew G. Knepley 43728cb4d582SMatthew G. Knepley #undef __FUNCT__ 4373552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4374a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4375a6dfd86eSKarl Rupp { 4376552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4377552f7358SJed Brown 4378552f7358SJed Brown PetscFunctionBegin; 4379552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4380552f7358SJed Brown if (cones) *cones = mesh->cones; 4381552f7358SJed Brown PetscFunctionReturn(0); 4382552f7358SJed Brown } 4383552f7358SJed Brown 4384552f7358SJed Brown #undef __FUNCT__ 4385552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4386a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4387a6dfd86eSKarl Rupp { 4388552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4389552f7358SJed Brown 4390552f7358SJed Brown PetscFunctionBegin; 4391552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4392552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4393552f7358SJed Brown PetscFunctionReturn(0); 4394552f7358SJed Brown } 4395552f7358SJed Brown 4396552f7358SJed Brown /******************************** FEM Support **********************************/ 4397552f7358SJed Brown 4398552f7358SJed Brown #undef __FUNCT__ 43991a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 44001a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4401a6dfd86eSKarl Rupp { 4402552f7358SJed Brown PetscScalar *array, *vArray; 4403d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 44041a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4405552f7358SJed Brown PetscErrorCode ierr; 4406552f7358SJed Brown 44071b406b76SMatthew G. Knepley PetscFunctionBeginHot; 44082a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 44095a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 44105a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 44115a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 44123f7cbbe7SMatthew G. Knepley if (!values || !*values) { 44139df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44149df71ca4SMatthew G. Knepley PetscInt dof; 4415d9917b9dSMatthew G. Knepley 44169df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44179df71ca4SMatthew G. Knepley size += dof; 44189df71ca4SMatthew G. Knepley } 44199df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44209df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44212a3aaacfSMatthew G. Knepley PetscInt dof; 44225a1bb5cfSMatthew G. Knepley 44235a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44242a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44255a1bb5cfSMatthew G. Knepley size += dof; 44265a1bb5cfSMatthew G. Knepley } 44273f7cbbe7SMatthew G. Knepley if (!values) { 44283f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 44293f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 44303f7cbbe7SMatthew G. Knepley } 44315a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4432982e9ed1SMatthew G. Knepley } else { 4433982e9ed1SMatthew G. Knepley array = *values; 4434982e9ed1SMatthew G. Knepley } 44359df71ca4SMatthew G. Knepley size = 0; 44365a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44379df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 44389df71ca4SMatthew G. Knepley PetscInt dof, off, d; 44399df71ca4SMatthew G. Knepley PetscScalar *varr; 4440d9917b9dSMatthew G. Knepley 44419df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44429df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44439df71ca4SMatthew G. Knepley varr = &vArray[off]; 44441a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44451a271a75SMatthew G. Knepley array[offset] = varr[d]; 44469df71ca4SMatthew G. Knepley } 44479df71ca4SMatthew G. Knepley size += dof; 44489df71ca4SMatthew G. Knepley } 44499df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 44509df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 44519df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 44525a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 44535a1bb5cfSMatthew G. Knepley PetscScalar *varr; 44545a1bb5cfSMatthew G. Knepley 445552ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 44565a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 44575a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 44585a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 44595a1bb5cfSMatthew G. Knepley if (o >= 0) { 44601a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 44611a271a75SMatthew G. Knepley array[offset] = varr[d]; 44625a1bb5cfSMatthew G. Knepley } 44635a1bb5cfSMatthew G. Knepley } else { 44641a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 44651a271a75SMatthew G. Knepley array[offset] = varr[d]; 44665a1bb5cfSMatthew G. Knepley } 44675a1bb5cfSMatthew G. Knepley } 44689df71ca4SMatthew G. Knepley size += dof; 44695a1bb5cfSMatthew G. Knepley } 44705a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 44719df71ca4SMatthew G. Knepley if (!*values) { 44725a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 44735a1bb5cfSMatthew G. Knepley *values = array; 44749df71ca4SMatthew G. Knepley } else { 44759df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 44768c312ff3SMatthew G. Knepley *csize = size; 44779df71ca4SMatthew G. Knepley } 44785a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 44795a1bb5cfSMatthew G. Knepley } 4480d9917b9dSMatthew G. Knepley 4481d9917b9dSMatthew G. Knepley #undef __FUNCT__ 44821a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 44831a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 44841a271a75SMatthew G. Knepley { 44851a271a75SMatthew G. Knepley PetscInt offset = 0, p; 44861a271a75SMatthew G. Knepley PetscErrorCode ierr; 44871a271a75SMatthew G. Knepley 44881a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4489fe02ba77SJed Brown *size = 0; 44901a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 44911a271a75SMatthew G. Knepley const PetscInt point = points[p]; 44921a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 44931a271a75SMatthew G. Knepley PetscInt dof, off, d; 44941a271a75SMatthew G. Knepley const PetscScalar *varr; 44951a271a75SMatthew G. Knepley 44961a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 44971a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 44981a271a75SMatthew G. Knepley varr = &vArray[off]; 44991a271a75SMatthew G. Knepley if (o >= 0) { 45001a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 45011a271a75SMatthew G. Knepley } else { 45021a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 45031a271a75SMatthew G. Knepley } 45041a271a75SMatthew G. Knepley } 45051a271a75SMatthew G. Knepley *size = offset; 45061a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45071a271a75SMatthew G. Knepley } 45081a271a75SMatthew G. Knepley 45091a271a75SMatthew G. Knepley #undef __FUNCT__ 45101a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 45111a271a75SMatthew 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[]) 45121a271a75SMatthew G. Knepley { 45131a271a75SMatthew G. Knepley PetscInt offset = 0, f; 45141a271a75SMatthew G. Knepley PetscErrorCode ierr; 45151a271a75SMatthew G. Knepley 45161a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4517fe02ba77SJed Brown *size = 0; 45181a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 45191a271a75SMatthew G. Knepley PetscInt fcomp, p; 45201a271a75SMatthew G. Knepley 45211a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 45221a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 45231a271a75SMatthew G. Knepley const PetscInt point = points[p]; 45241a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 45251a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 45261a271a75SMatthew G. Knepley const PetscScalar *varr; 45271a271a75SMatthew G. Knepley 45281a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 45291a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45301a271a75SMatthew G. Knepley varr = &vArray[foff]; 45311a271a75SMatthew G. Knepley if (o >= 0) { 45321a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 45331a271a75SMatthew G. Knepley } else { 45341a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 45351a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 45361a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 45371a271a75SMatthew G. Knepley } 45381a271a75SMatthew G. Knepley } 45391a271a75SMatthew G. Knepley } 45401a271a75SMatthew G. Knepley } 45411a271a75SMatthew G. Knepley } 45421a271a75SMatthew G. Knepley *size = offset; 45431a271a75SMatthew G. Knepley PetscFunctionReturn(0); 45441a271a75SMatthew G. Knepley } 45451a271a75SMatthew G. Knepley 45461a271a75SMatthew G. Knepley #undef __FUNCT__ 4547552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4548552f7358SJed Brown /*@C 4549552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4550552f7358SJed Brown 4551552f7358SJed Brown Not collective 4552552f7358SJed Brown 4553552f7358SJed Brown Input Parameters: 4554552f7358SJed Brown + dm - The DM 4555552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4556552f7358SJed Brown . v - The local vector 4557552f7358SJed Brown - point - The sieve point in the DM 4558552f7358SJed Brown 4559552f7358SJed Brown Output Parameters: 4560552f7358SJed Brown + csize - The number of values in the closure, or NULL 4561552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4562552f7358SJed Brown 4563552f7358SJed Brown Fortran Notes: 4564552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4565552f7358SJed Brown include petsc.h90 in your code. 4566552f7358SJed Brown 4567552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4568552f7358SJed Brown 4569552f7358SJed Brown Level: intermediate 4570552f7358SJed Brown 4571552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4572552f7358SJed Brown @*/ 4573552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4574552f7358SJed Brown { 4575552f7358SJed Brown PetscSection clSection; 4576d9917b9dSMatthew G. Knepley IS clPoints; 4577552f7358SJed Brown PetscScalar *array, *vArray; 4578552f7358SJed Brown PetscInt *points = NULL; 4579d9917b9dSMatthew G. Knepley const PetscInt *clp; 45801a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4581552f7358SJed Brown PetscErrorCode ierr; 4582552f7358SJed Brown 4583d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4584552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4585552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 45861a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 45871a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4588552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4589552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4590552f7358SJed Brown if (depth == 1 && numFields < 2) { 45911a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4592552f7358SJed Brown PetscFunctionReturn(0); 4593552f7358SJed Brown } 45941a271a75SMatthew G. Knepley /* Get points */ 4595d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4596d9917b9dSMatthew G. Knepley if (!clPoints) { 45971a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4598552f7358SJed Brown 45991a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4600552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4601552f7358SJed Brown /* Compress out points not in the section */ 4602552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4603552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4604552f7358SJed Brown points[q*2] = points[p]; 4605552f7358SJed Brown points[q*2+1] = points[p+1]; 4606552f7358SJed Brown ++q; 4607552f7358SJed Brown } 4608552f7358SJed Brown } 4609552f7358SJed Brown numPoints = q; 4610d9917b9dSMatthew G. Knepley } else { 4611d9917b9dSMatthew G. Knepley PetscInt dof, off; 4612552f7358SJed Brown 4613d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4614d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4615d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 46161a271a75SMatthew G. Knepley numPoints = dof/2; 4617d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4618552f7358SJed Brown } 46191a271a75SMatthew G. Knepley /* Get array */ 4620552f7358SJed Brown if (!values || !*values) { 46211a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4622552f7358SJed Brown 46231a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4624552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 46251a271a75SMatthew G. Knepley asize += dof; 4626552f7358SJed Brown } 4627bd6c0d32SMatthew G. Knepley if (!values) { 4628d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46291a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46301a271a75SMatthew G. Knepley if (csize) *csize = asize; 4631bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4632bd6c0d32SMatthew G. Knepley } 46331a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4634d0f6b257SMatthew G. Knepley } else { 4635d0f6b257SMatthew G. Knepley array = *values; 4636d0f6b257SMatthew G. Knepley } 4637552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 46381a271a75SMatthew G. Knepley /* Get values */ 4639ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 46401a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 46411a271a75SMatthew G. Knepley /* Cleanup points */ 46421a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 46431a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 46441a271a75SMatthew G. Knepley /* Cleanup array */ 4645552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4646d0f6b257SMatthew G. Knepley if (!*values) { 4647552f7358SJed Brown if (csize) *csize = size; 4648552f7358SJed Brown *values = array; 4649d0f6b257SMatthew G. Knepley } else { 4650d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4651d0f6b257SMatthew G. Knepley *csize = size; 4652d0f6b257SMatthew G. Knepley } 4653552f7358SJed Brown PetscFunctionReturn(0); 4654552f7358SJed Brown } 4655552f7358SJed Brown 4656552f7358SJed Brown #undef __FUNCT__ 4657552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4658552f7358SJed Brown /*@C 4659552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4660552f7358SJed Brown 4661552f7358SJed Brown Not collective 4662552f7358SJed Brown 4663552f7358SJed Brown Input Parameters: 4664552f7358SJed Brown + dm - The DM 46650298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4666552f7358SJed Brown . v - The local vector 4667552f7358SJed Brown . point - The sieve point in the DM 46680298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4669552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4670552f7358SJed Brown 46713813dfbdSMatthew G Knepley Fortran Notes: 46723813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 46733813dfbdSMatthew G Knepley include petsc.h90 in your code. 46743813dfbdSMatthew G Knepley 46753813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 46763813dfbdSMatthew G Knepley 4677552f7358SJed Brown Level: intermediate 4678552f7358SJed Brown 4679552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4680552f7358SJed Brown @*/ 46817c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4682a6dfd86eSKarl Rupp { 4683552f7358SJed Brown PetscInt size = 0; 4684552f7358SJed Brown PetscErrorCode ierr; 4685552f7358SJed Brown 4686552f7358SJed Brown PetscFunctionBegin; 4687552f7358SJed Brown /* Should work without recalculating size */ 4688552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4689552f7358SJed Brown PetscFunctionReturn(0); 4690552f7358SJed Brown } 4691552f7358SJed Brown 4692552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4693552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4694552f7358SJed Brown 4695552f7358SJed Brown #undef __FUNCT__ 4696552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 46971a271a75SMatthew 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[]) 4698552f7358SJed Brown { 4699552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4700552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4701552f7358SJed Brown PetscScalar *a; 4702552f7358SJed Brown PetscInt off, cind = 0, k; 4703552f7358SJed Brown PetscErrorCode ierr; 4704552f7358SJed Brown 4705552f7358SJed Brown PetscFunctionBegin; 4706552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4707552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4708552f7358SJed Brown a = &array[off]; 4709552f7358SJed Brown if (!cdof || setBC) { 4710552f7358SJed Brown if (orientation >= 0) { 4711552f7358SJed Brown for (k = 0; k < dof; ++k) { 4712552f7358SJed Brown fuse(&a[k], values[k]); 4713552f7358SJed Brown } 4714552f7358SJed Brown } else { 4715552f7358SJed Brown for (k = 0; k < dof; ++k) { 4716552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4717552f7358SJed Brown } 4718552f7358SJed Brown } 4719552f7358SJed Brown } else { 4720552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4721552f7358SJed Brown if (orientation >= 0) { 4722552f7358SJed Brown for (k = 0; k < dof; ++k) { 4723552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4724552f7358SJed Brown fuse(&a[k], values[k]); 4725552f7358SJed Brown } 4726552f7358SJed Brown } else { 4727552f7358SJed Brown for (k = 0; k < dof; ++k) { 4728552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4729552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4730552f7358SJed Brown } 4731552f7358SJed Brown } 4732552f7358SJed Brown } 4733552f7358SJed Brown PetscFunctionReturn(0); 4734552f7358SJed Brown } 4735552f7358SJed Brown 4736552f7358SJed Brown #undef __FUNCT__ 4737a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 47381a271a75SMatthew 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[]) 4739a5e93ea8SMatthew G. Knepley { 4740a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4741a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4742a5e93ea8SMatthew G. Knepley PetscScalar *a; 4743a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4744a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4745a5e93ea8SMatthew G. Knepley 4746a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4747a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4748a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4749a5e93ea8SMatthew G. Knepley a = &array[off]; 4750a5e93ea8SMatthew G. Knepley if (cdof) { 4751a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4752a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4753a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4754a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4755a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4756a5e93ea8SMatthew G. Knepley ++cind; 4757a5e93ea8SMatthew G. Knepley } 4758a5e93ea8SMatthew G. Knepley } 4759a5e93ea8SMatthew G. Knepley } else { 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[dof-k-1]); 4763a5e93ea8SMatthew G. Knepley ++cind; 4764a5e93ea8SMatthew G. Knepley } 4765a5e93ea8SMatthew G. Knepley } 4766a5e93ea8SMatthew G. Knepley } 4767a5e93ea8SMatthew G. Knepley } 4768a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4769a5e93ea8SMatthew G. Knepley } 4770a5e93ea8SMatthew G. Knepley 4771a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4772552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 47731a271a75SMatthew 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[]) 4774a6dfd86eSKarl Rupp { 4775552f7358SJed Brown PetscScalar *a; 47761a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 47771a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 47781a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4779552f7358SJed Brown PetscErrorCode ierr; 4780552f7358SJed Brown 4781552f7358SJed Brown PetscFunctionBegin; 4782552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4783552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 47841a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 47851a271a75SMatthew G. Knepley a = &array[foff]; 4786552f7358SJed Brown if (!fcdof || setBC) { 47871a271a75SMatthew G. Knepley if (o >= 0) { 47881a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4789552f7358SJed Brown } else { 4790552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4791552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 47921a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4793552f7358SJed Brown } 4794552f7358SJed Brown } 4795552f7358SJed Brown } 4796552f7358SJed Brown } else { 4797552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 47981a271a75SMatthew G. Knepley if (o >= 0) { 4799552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4800552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 48011a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4802552f7358SJed Brown } 4803552f7358SJed Brown } else { 4804552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4805552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4806552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 48071a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4808552f7358SJed Brown } 4809552f7358SJed Brown } 4810552f7358SJed Brown } 4811552f7358SJed Brown } 48121a271a75SMatthew G. Knepley *offset += fdof; 4813552f7358SJed Brown PetscFunctionReturn(0); 4814552f7358SJed Brown } 4815552f7358SJed Brown 4816552f7358SJed Brown #undef __FUNCT__ 4817a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 48181a271a75SMatthew 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[]) 4819a5e93ea8SMatthew G. Knepley { 4820a5e93ea8SMatthew G. Knepley PetscScalar *a; 48211a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 48221a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 48231a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4824a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4825a5e93ea8SMatthew G. Knepley 4826a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4827a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4828a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 48291a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 48301a271a75SMatthew G. Knepley a = &array[foff]; 4831a5e93ea8SMatthew G. Knepley if (fcdof) { 4832a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 48331a271a75SMatthew G. Knepley if (o >= 0) { 4834a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4835a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 48361a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4837a5e93ea8SMatthew G. Knepley ++cind; 4838a5e93ea8SMatthew G. Knepley } 4839a5e93ea8SMatthew G. Knepley } 4840a5e93ea8SMatthew G. Knepley } else { 4841a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4842a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4843a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 48441a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4845a5e93ea8SMatthew G. Knepley ++cind; 4846a5e93ea8SMatthew G. Knepley } 4847a5e93ea8SMatthew G. Knepley } 4848a5e93ea8SMatthew G. Knepley } 4849a5e93ea8SMatthew G. Knepley } 4850a5e93ea8SMatthew G. Knepley } 48511a271a75SMatthew G. Knepley *offset += fdof; 4852a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4853a5e93ea8SMatthew G. Knepley } 4854a5e93ea8SMatthew G. Knepley 4855a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 48561b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 48571a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4858a6dfd86eSKarl Rupp { 4859552f7358SJed Brown PetscScalar *array; 48601b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 48611b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4862552f7358SJed Brown PetscErrorCode ierr; 4863552f7358SJed Brown 48641b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4865b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4866b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4867b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4868b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4869b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4870b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4871b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4872b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4873b6ebb6e6SMatthew G. Knepley 4874b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4875b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4876b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4877b6ebb6e6SMatthew G. Knepley { 4878b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4879b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4880b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4881b6ebb6e6SMatthew G. Knepley 4882b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4883b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4884b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4885b6ebb6e6SMatthew G. Knepley if (!cdof) { 4886b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4887b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4888b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4889b6ebb6e6SMatthew G. Knepley } 4890b6ebb6e6SMatthew G. Knepley } else { 4891b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4892b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4893b6ebb6e6SMatthew G. Knepley } 4894b6ebb6e6SMatthew G. Knepley } 4895b6ebb6e6SMatthew G. Knepley } else { 4896b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4897b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4898b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4899b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4900b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4901b6ebb6e6SMatthew G. Knepley } 4902b6ebb6e6SMatthew G. Knepley } else { 4903b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4904b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4905b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4906b6ebb6e6SMatthew G. Knepley } 4907b6ebb6e6SMatthew G. Knepley } 4908b6ebb6e6SMatthew G. Knepley } 4909b6ebb6e6SMatthew G. Knepley } 4910b6ebb6e6SMatthew G. Knepley } 4911b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4912b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4913b6ebb6e6SMatthew G. Knepley } 49141b406b76SMatthew G. Knepley 49151b406b76SMatthew G. Knepley #undef __FUNCT__ 49161b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 49171b406b76SMatthew G. Knepley /*@C 49181b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 49191b406b76SMatthew G. Knepley 49201b406b76SMatthew G. Knepley Not collective 49211b406b76SMatthew G. Knepley 49221b406b76SMatthew G. Knepley Input Parameters: 49231b406b76SMatthew G. Knepley + dm - The DM 49241b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 49251b406b76SMatthew G. Knepley . v - The local vector 49261b406b76SMatthew G. Knepley . point - The sieve point in the DM 49271b406b76SMatthew G. Knepley . values - The array of values 49281b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 49291b406b76SMatthew G. Knepley 49301b406b76SMatthew G. Knepley Fortran Notes: 49311b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 49321b406b76SMatthew G. Knepley 49331b406b76SMatthew G. Knepley Level: intermediate 49341b406b76SMatthew G. Knepley 49351b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 49361b406b76SMatthew G. Knepley @*/ 49371b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 49381b406b76SMatthew G. Knepley { 49391b406b76SMatthew G. Knepley PetscSection clSection; 49401b406b76SMatthew G. Knepley IS clPoints; 49411b406b76SMatthew G. Knepley PetscScalar *array; 49421b406b76SMatthew G. Knepley PetscInt *points = NULL; 49431b406b76SMatthew G. Knepley const PetscInt *clp; 49441a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 49451b406b76SMatthew G. Knepley PetscErrorCode ierr; 49461b406b76SMatthew G. Knepley 49471a271a75SMatthew G. Knepley PetscFunctionBeginHot; 49481b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49491b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 49501a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 49511a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 49521b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 49531b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49541b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 49551a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 49561b406b76SMatthew G. Knepley PetscFunctionReturn(0); 49571b406b76SMatthew G. Knepley } 49581a271a75SMatthew G. Knepley /* Get points */ 49591b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 49601b406b76SMatthew G. Knepley if (!clPoints) { 49611a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 49621a271a75SMatthew G. Knepley 49631a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4964552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4965552f7358SJed Brown /* Compress out points not in the section */ 4966552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4967552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4968552f7358SJed Brown points[q*2] = points[p]; 4969552f7358SJed Brown points[q*2+1] = points[p+1]; 4970552f7358SJed Brown ++q; 4971552f7358SJed Brown } 4972552f7358SJed Brown } 4973552f7358SJed Brown numPoints = q; 49741b406b76SMatthew G. Knepley } else { 49751b406b76SMatthew G. Knepley PetscInt dof, off; 4976552f7358SJed Brown 49771b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 49781b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 49791b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 49801a271a75SMatthew G. Knepley numPoints = dof/2; 49811b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4982552f7358SJed Brown } 49831a271a75SMatthew G. Knepley /* Get array */ 4984552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 49851a271a75SMatthew G. Knepley /* Get values */ 4986ef90cfe2SMatthew G. Knepley if (numFields > 0) { 49871a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4988552f7358SJed Brown for (f = 0; f < numFields; ++f) { 49891a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4990552f7358SJed Brown switch (mode) { 4991552f7358SJed Brown case INSERT_VALUES: 4992552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49931a271a75SMatthew G. Knepley const PetscInt point = points[p]; 49941a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 49951a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4996552f7358SJed Brown } break; 4997552f7358SJed Brown case INSERT_ALL_VALUES: 4998552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 49991a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50001a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50011a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5002552f7358SJed Brown } break; 5003a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5004a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50051a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50061a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50071a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5008a5e93ea8SMatthew G. Knepley } break; 5009552f7358SJed Brown case ADD_VALUES: 5010552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50111a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50121a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50131a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5014552f7358SJed Brown } break; 5015552f7358SJed Brown case ADD_ALL_VALUES: 5016552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 50171a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50181a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50191a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5020552f7358SJed Brown } break; 5021552f7358SJed Brown default: 502282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5023552f7358SJed Brown } 50241a271a75SMatthew G. Knepley } 5025552f7358SJed Brown } else { 50261a271a75SMatthew G. Knepley PetscInt dof, off; 50271a271a75SMatthew G. Knepley 5028552f7358SJed Brown switch (mode) { 5029552f7358SJed Brown case INSERT_VALUES: 5030552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5031552f7358SJed Brown PetscInt o = points[p+1]; 5032552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5033552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5034552f7358SJed Brown } break; 5035552f7358SJed Brown case INSERT_ALL_VALUES: 5036552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5037552f7358SJed Brown PetscInt o = points[p+1]; 5038552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5039552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5040552f7358SJed Brown } break; 5041a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5042a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5043a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5044a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5045a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5046a5e93ea8SMatthew G. Knepley } break; 5047552f7358SJed Brown case ADD_VALUES: 5048552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5049552f7358SJed Brown PetscInt o = points[p+1]; 5050552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5051552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5052552f7358SJed Brown } break; 5053552f7358SJed Brown case ADD_ALL_VALUES: 5054552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5055552f7358SJed Brown PetscInt o = points[p+1]; 5056552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5057552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5058552f7358SJed Brown } break; 5059552f7358SJed Brown default: 506082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5061552f7358SJed Brown } 5062552f7358SJed Brown } 50631a271a75SMatthew G. Knepley /* Cleanup points */ 50641a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 50651a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 50661a271a75SMatthew G. Knepley /* Cleanup array */ 5067552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5068552f7358SJed Brown PetscFunctionReturn(0); 5069552f7358SJed Brown } 5070552f7358SJed Brown 5071552f7358SJed Brown #undef __FUNCT__ 5072e07394fbSMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetFieldClosure_Internal" 5073e07394fbSMatthew G. Knepley PetscErrorCode DMPlexVecSetFieldClosure_Internal(DM dm, PetscSection section, Vec v, PetscBool fieldActive[], PetscInt point, const PetscScalar values[], InsertMode mode) 5074e07394fbSMatthew G. Knepley { 5075e07394fbSMatthew G. Knepley PetscSection clSection; 5076e07394fbSMatthew G. Knepley IS clPoints; 5077e07394fbSMatthew G. Knepley PetscScalar *array; 5078e07394fbSMatthew G. Knepley PetscInt *points = NULL; 5079e07394fbSMatthew G. Knepley const PetscInt *clp; 5080e07394fbSMatthew G. Knepley PetscInt numFields, numPoints, p; 5081e07394fbSMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5082e07394fbSMatthew G. Knepley PetscErrorCode ierr; 5083e07394fbSMatthew G. Knepley 5084e07394fbSMatthew G. Knepley PetscFunctionBeginHot; 5085e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5086e07394fbSMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5087e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5088e07394fbSMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5089e07394fbSMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5090e07394fbSMatthew G. Knepley /* Get points */ 5091e07394fbSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5092e07394fbSMatthew G. Knepley if (!clPoints) { 5093e07394fbSMatthew G. Knepley PetscInt pStart, pEnd, q; 5094e07394fbSMatthew G. Knepley 5095e07394fbSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5096e07394fbSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5097e07394fbSMatthew G. Knepley /* Compress out points not in the section */ 5098e07394fbSMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5099e07394fbSMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5100e07394fbSMatthew G. Knepley points[q*2] = points[p]; 5101e07394fbSMatthew G. Knepley points[q*2+1] = points[p+1]; 5102e07394fbSMatthew G. Knepley ++q; 5103e07394fbSMatthew G. Knepley } 5104e07394fbSMatthew G. Knepley } 5105e07394fbSMatthew G. Knepley numPoints = q; 5106e07394fbSMatthew G. Knepley } else { 5107e07394fbSMatthew G. Knepley PetscInt dof, off; 5108e07394fbSMatthew G. Knepley 5109e07394fbSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5110e07394fbSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5111e07394fbSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 5112e07394fbSMatthew G. Knepley numPoints = dof/2; 5113e07394fbSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5114e07394fbSMatthew G. Knepley } 5115e07394fbSMatthew G. Knepley /* Get array */ 5116e07394fbSMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5117e07394fbSMatthew G. Knepley /* Get values */ 5118e07394fbSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5119e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5120e07394fbSMatthew G. Knepley if (!fieldActive[f]) { 5121e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5122e07394fbSMatthew G. Knepley PetscInt fdof; 5123e07394fbSMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5124e07394fbSMatthew G. Knepley offset += fdof; 5125e07394fbSMatthew G. Knepley } 5126e07394fbSMatthew G. Knepley continue; 5127e07394fbSMatthew G. Knepley } 5128e07394fbSMatthew G. Knepley switch (mode) { 5129e07394fbSMatthew G. Knepley case INSERT_VALUES: 5130e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5131e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5132e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5133e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5134e07394fbSMatthew G. Knepley } break; 5135e07394fbSMatthew G. Knepley case INSERT_ALL_VALUES: 5136e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5137e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5138e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5139e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5140e07394fbSMatthew G. Knepley } break; 5141e07394fbSMatthew G. Knepley case INSERT_BC_VALUES: 5142e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5143e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5144e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5145e07394fbSMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5146e07394fbSMatthew G. Knepley } break; 5147e07394fbSMatthew G. Knepley case ADD_VALUES: 5148e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5149e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5150e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5151e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5152e07394fbSMatthew G. Knepley } break; 5153e07394fbSMatthew G. Knepley case ADD_ALL_VALUES: 5154e07394fbSMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5155e07394fbSMatthew G. Knepley const PetscInt point = points[p]; 5156e07394fbSMatthew G. Knepley const PetscInt o = points[p+1]; 5157e07394fbSMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5158e07394fbSMatthew G. Knepley } break; 5159e07394fbSMatthew G. Knepley default: 5160e07394fbSMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5161e07394fbSMatthew G. Knepley } 5162e07394fbSMatthew G. Knepley } 5163e07394fbSMatthew G. Knepley /* Cleanup points */ 5164e07394fbSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 5165e07394fbSMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 5166e07394fbSMatthew G. Knepley /* Cleanup array */ 5167e07394fbSMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5168e07394fbSMatthew G. Knepley PetscFunctionReturn(0); 5169e07394fbSMatthew G. Knepley } 5170e07394fbSMatthew G. Knepley 5171e07394fbSMatthew G. Knepley #undef __FUNCT__ 5172552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5173b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5174552f7358SJed Brown { 5175552f7358SJed Brown PetscMPIInt rank; 5176552f7358SJed Brown PetscInt i, j; 5177552f7358SJed Brown PetscErrorCode ierr; 5178552f7358SJed Brown 5179552f7358SJed Brown PetscFunctionBegin; 518082f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 518177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5182b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5183b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5184b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5185b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 518677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5187b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5188519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 51897eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5190552f7358SJed Brown #else 5191b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5192552f7358SJed Brown #endif 5193552f7358SJed Brown } 519477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5195552f7358SJed Brown } 5196552f7358SJed Brown PetscFunctionReturn(0); 5197552f7358SJed Brown } 5198552f7358SJed Brown 5199552f7358SJed Brown #undef __FUNCT__ 5200552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5201552f7358SJed Brown /* . off - The global offset of this point */ 5202e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5203a6dfd86eSKarl Rupp { 5204e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5205552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5206552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5207552f7358SJed Brown PetscInt cind = 0, k; 5208552f7358SJed Brown PetscErrorCode ierr; 5209552f7358SJed Brown 5210552f7358SJed Brown PetscFunctionBegin; 5211552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5212552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5213552f7358SJed Brown if (!cdof || setBC) { 5214552f7358SJed Brown if (orientation >= 0) { 5215e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5216552f7358SJed Brown } else { 5217e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5218552f7358SJed Brown } 5219552f7358SJed Brown } else { 5220552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5221552f7358SJed Brown if (orientation >= 0) { 5222552f7358SJed Brown for (k = 0; k < dof; ++k) { 5223552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5224552f7358SJed Brown /* Insert check for returning constrained indices */ 5225e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5226552f7358SJed Brown ++cind; 5227552f7358SJed Brown } else { 5228e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5229552f7358SJed Brown } 5230552f7358SJed Brown } 5231552f7358SJed Brown } else { 5232552f7358SJed Brown for (k = 0; k < dof; ++k) { 5233552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5234552f7358SJed Brown /* Insert check for returning constrained indices */ 5235e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5236552f7358SJed Brown ++cind; 5237552f7358SJed Brown } else { 5238e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5239552f7358SJed Brown } 5240552f7358SJed Brown } 5241552f7358SJed Brown } 5242552f7358SJed Brown } 5243e6ccafaeSMatthew G Knepley *loff += dof; 5244552f7358SJed Brown PetscFunctionReturn(0); 5245552f7358SJed Brown } 5246552f7358SJed Brown 5247552f7358SJed Brown #undef __FUNCT__ 5248552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5249552f7358SJed Brown /* . off - The global offset of this point */ 5250a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5251a6dfd86eSKarl Rupp { 5252552f7358SJed Brown PetscInt numFields, foff, f; 5253552f7358SJed Brown PetscErrorCode ierr; 5254552f7358SJed Brown 5255552f7358SJed Brown PetscFunctionBegin; 5256552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5257552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5258552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5259552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5260552f7358SJed Brown PetscInt cind = 0, k, c; 5261552f7358SJed Brown 5262552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5263552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5264552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5265552f7358SJed Brown if (!cfdof || setBC) { 5266552f7358SJed Brown if (orientation >= 0) { 52670d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5268552f7358SJed Brown } else { 5269552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5270552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5271552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5272552f7358SJed Brown } 5273552f7358SJed Brown } 5274552f7358SJed Brown } 5275552f7358SJed Brown } else { 5276552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5277552f7358SJed Brown if (orientation >= 0) { 5278552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5279552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5280552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5281552f7358SJed Brown ++cind; 5282552f7358SJed Brown } else { 5283552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5284552f7358SJed Brown } 5285552f7358SJed Brown } 5286552f7358SJed Brown } else { 5287552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5288552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5289552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5290552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5291552f7358SJed Brown ++cind; 5292552f7358SJed Brown } else { 5293552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5294552f7358SJed Brown } 5295552f7358SJed Brown } 5296552f7358SJed Brown } 5297552f7358SJed Brown } 5298552f7358SJed Brown } 5299552f7358SJed Brown foff += fdof - cfdof; 5300552f7358SJed Brown foffs[f] += fdof; 5301552f7358SJed Brown } 5302552f7358SJed Brown PetscFunctionReturn(0); 5303552f7358SJed Brown } 5304552f7358SJed Brown 5305552f7358SJed Brown #undef __FUNCT__ 5306d3d1a6afSToby Isaac #define __FUNCT__ "DMPlexConstraintsModifyMat" 5307d3d1a6afSToby Isaac static PetscErrorCode DMPlexConstraintsModifyMat(DM dm, PetscSection section, PetscInt numPoints, PetscInt numIndices, const PetscInt points[], const PetscScalar values[], PetscInt *outNumPoints, PetscInt *outNumIndices, PetscInt *outPoints[], PetscScalar *outValues[], PetscInt offsets[]) 5308d3d1a6afSToby Isaac { 5309d3d1a6afSToby Isaac Mat cMat; 5310d3d1a6afSToby Isaac PetscSection aSec, cSec; 5311d3d1a6afSToby Isaac IS aIS; 5312d3d1a6afSToby Isaac PetscInt aStart = -1, aEnd = -1; 5313d3d1a6afSToby Isaac const PetscInt *anchors; 5314d3d1a6afSToby Isaac PetscInt numFields, f, p, q, newP; 5315d3d1a6afSToby Isaac PetscInt newNumPoints = 0, newNumIndices = 0; 5316d3d1a6afSToby Isaac PetscInt *newPoints, *indices, *newIndices; 5317d3d1a6afSToby Isaac PetscInt maxAnchor, maxDof; 5318d3d1a6afSToby Isaac PetscInt newOffsets[32]; 5319d3d1a6afSToby Isaac PetscInt *pointMatOffsets[32]; 5320d3d1a6afSToby Isaac PetscInt *newPointOffsets[32]; 5321d3d1a6afSToby Isaac PetscScalar *pointMat[32]; 5322d3d1a6afSToby Isaac PetscScalar *newValues,*tmpValues; 5323d3d1a6afSToby Isaac PetscBool anyConstrained = PETSC_FALSE; 5324d3d1a6afSToby Isaac PetscErrorCode ierr; 5325d3d1a6afSToby Isaac 5326d3d1a6afSToby Isaac PetscFunctionBegin; 5327d3d1a6afSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5328d3d1a6afSToby Isaac PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5329d3d1a6afSToby Isaac ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5330d3d1a6afSToby Isaac 5331d3d1a6afSToby Isaac ierr = DMPlexGetConstraints(dm,&aSec,&aIS);CHKERRQ(ierr); 5332d3d1a6afSToby Isaac /* if there are point-to-point constraints */ 5333d3d1a6afSToby Isaac if (aSec) { 5334d3d1a6afSToby Isaac ierr = PetscMemzero(newOffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5335d3d1a6afSToby Isaac ierr = ISGetIndices(aIS,&anchors);CHKERRQ(ierr); 5336d3d1a6afSToby Isaac ierr = PetscSectionGetChart(aSec,&aStart,&aEnd);CHKERRQ(ierr); 5337d3d1a6afSToby Isaac /* figure out how many points are going to be in the new element matrix 5338d3d1a6afSToby Isaac * (we allow double counting, because it's all just going to be summed 5339d3d1a6afSToby Isaac * into the global matrix anyway) */ 5340d3d1a6afSToby Isaac for (p = 0; p < 2*numPoints; p+=2) { 5341d3d1a6afSToby Isaac PetscInt b = points[p]; 5342d3d1a6afSToby Isaac PetscInt bDof = 0; 5343d3d1a6afSToby Isaac 5344d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5345d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec,b,&bDof);CHKERRQ(ierr); 5346d3d1a6afSToby Isaac } 5347d3d1a6afSToby Isaac if (bDof) { 5348d3d1a6afSToby Isaac /* this point is constrained */ 5349d3d1a6afSToby Isaac /* it is going to be replaced by its anchors */ 5350d3d1a6afSToby Isaac PetscInt bOff, q; 5351d3d1a6afSToby Isaac 5352d3d1a6afSToby Isaac anyConstrained = PETSC_TRUE; 5353d3d1a6afSToby Isaac newNumPoints += bDof; 5354d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec,b,&bOff);CHKERRQ(ierr); 5355d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5356d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 5357d3d1a6afSToby Isaac PetscInt aDof; 5358d3d1a6afSToby Isaac 5359d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 5360d3d1a6afSToby Isaac newNumIndices += aDof; 5361d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 5362d3d1a6afSToby Isaac PetscInt fDof; 5363d3d1a6afSToby Isaac 5364d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &fDof);CHKERRQ(ierr); 5365d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 5366d3d1a6afSToby Isaac } 5367d3d1a6afSToby Isaac } 5368d3d1a6afSToby Isaac } 5369d3d1a6afSToby Isaac else { 5370d3d1a6afSToby Isaac /* this point is not constrained */ 5371d3d1a6afSToby Isaac newNumPoints++; 5372d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&bDof);CHKERRQ(ierr); 5373d3d1a6afSToby Isaac newNumIndices += bDof; 5374d3d1a6afSToby Isaac for (f = 0; f < numFields; ++f) { 5375d3d1a6afSToby Isaac PetscInt fDof; 5376d3d1a6afSToby Isaac 5377d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5378d3d1a6afSToby Isaac newOffsets[f+1] += fDof; 5379d3d1a6afSToby Isaac } 5380d3d1a6afSToby Isaac } 5381d3d1a6afSToby Isaac } 5382d3d1a6afSToby Isaac } 5383d3d1a6afSToby Isaac if (!anyConstrained) { 5384d3d1a6afSToby Isaac *outNumPoints = 0; 5385d3d1a6afSToby Isaac *outNumIndices = 0; 5386d3d1a6afSToby Isaac *outPoints = NULL; 5387d3d1a6afSToby Isaac *outValues = NULL; 5388d3d1a6afSToby Isaac if (aSec) { 5389d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 5390d3d1a6afSToby Isaac } 5391d3d1a6afSToby Isaac PetscFunctionReturn(0); 5392d3d1a6afSToby Isaac } 5393d3d1a6afSToby Isaac 5394d3d1a6afSToby Isaac for (f = 1; f < numFields; ++f) newOffsets[f+1] += newOffsets[f]; 5395d3d1a6afSToby Isaac 5396d3d1a6afSToby Isaac if (numFields && newOffsets[numFields] != newNumIndices) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", newOffsets[numFields], newNumIndices); 5397d3d1a6afSToby Isaac 5398d3d1a6afSToby Isaac ierr = DMPlexGetConstraintSection(dm, &cSec);CHKERRQ(ierr); 5399d3d1a6afSToby Isaac ierr = DMPlexGetConstraintMatrix(dm, &cMat);CHKERRQ(ierr); 5400d3d1a6afSToby Isaac 5401d3d1a6afSToby Isaac /* output arrays */ 5402d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 5403d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 5404d3d1a6afSToby Isaac 5405d3d1a6afSToby Isaac /* workspaces */ 5406d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 5407d3d1a6afSToby Isaac if (numFields) { 5408d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5409d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 5410d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 5411d3d1a6afSToby Isaac } 5412d3d1a6afSToby Isaac } 5413d3d1a6afSToby Isaac else { 5414d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 5415d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,numPoints,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 5416d3d1a6afSToby Isaac } 5417d3d1a6afSToby Isaac 5418d3d1a6afSToby Isaac /* get workspaces for the point-to-point matrices */ 5419d3d1a6afSToby Isaac if (numFields) { 5420d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5421d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5422d3d1a6afSToby Isaac PetscInt bDof = 0; 5423d3d1a6afSToby Isaac 5424d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5425d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5426d3d1a6afSToby Isaac } 5427d3d1a6afSToby Isaac if (bDof) { 5428d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5429d3d1a6afSToby Isaac PetscInt fDof, q, bOff, allFDof = 0; 5430d3d1a6afSToby Isaac 5431d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5432d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 5433d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5434d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q]; 5435d3d1a6afSToby Isaac PetscInt aFDof; 5436d3d1a6afSToby Isaac 5437d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, a, f, &aFDof);CHKERRQ(ierr); 5438d3d1a6afSToby Isaac allFDof += aFDof; 5439d3d1a6afSToby Isaac } 5440d3d1a6afSToby Isaac newPointOffsets[f][p+1] = allFDof; 5441d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = fDof * allFDof; 5442d3d1a6afSToby Isaac } 5443d3d1a6afSToby Isaac } 5444d3d1a6afSToby Isaac else { 5445d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5446d3d1a6afSToby Isaac PetscInt fDof; 5447d3d1a6afSToby Isaac 5448d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section, b, f, &fDof);CHKERRQ(ierr); 5449d3d1a6afSToby Isaac newPointOffsets[f][p+1] = fDof; 5450d3d1a6afSToby Isaac pointMatOffsets[f][p+1] = 0; 5451d3d1a6afSToby Isaac } 5452d3d1a6afSToby Isaac } 5453d3d1a6afSToby Isaac } 5454d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5455d3d1a6afSToby Isaac newPointOffsets[f][0] = 0; 5456d3d1a6afSToby Isaac pointMatOffsets[f][0] = 0; 5457d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5458d3d1a6afSToby Isaac newPointOffsets[f][p+1] += newPointOffsets[f][p]; 5459d3d1a6afSToby Isaac pointMatOffsets[f][p+1] += pointMatOffsets[f][p]; 5460d3d1a6afSToby Isaac } 5461d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 5462d3d1a6afSToby Isaac } 5463d3d1a6afSToby Isaac } 5464d3d1a6afSToby Isaac else { 5465d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5466d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5467d3d1a6afSToby Isaac PetscInt bDof = 0; 5468d3d1a6afSToby Isaac 5469d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5470d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5471d3d1a6afSToby Isaac } 5472d3d1a6afSToby Isaac if (bDof) { 5473d3d1a6afSToby Isaac PetscInt dof, bOff, q, allDof = 0; 5474d3d1a6afSToby Isaac 5475d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 5476d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(aSec, b, &bOff);CHKERRQ(ierr); 5477d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5478d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aDof; 5479d3d1a6afSToby Isaac 5480d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, a, &aDof);CHKERRQ(ierr); 5481d3d1a6afSToby Isaac allDof += aDof; 5482d3d1a6afSToby Isaac } 5483d3d1a6afSToby Isaac newPointOffsets[0][p+1] = allDof; 5484d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = dof * allDof; 5485d3d1a6afSToby Isaac } 5486d3d1a6afSToby Isaac else { 5487d3d1a6afSToby Isaac PetscInt dof; 5488d3d1a6afSToby Isaac 5489d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section, b, &dof);CHKERRQ(ierr); 5490d3d1a6afSToby Isaac newPointOffsets[0][p+1] = dof; 5491d3d1a6afSToby Isaac pointMatOffsets[0][p+1] = 0; 5492d3d1a6afSToby Isaac } 5493d3d1a6afSToby Isaac } 5494d3d1a6afSToby Isaac newPointOffsets[0][0] = 0; 5495d3d1a6afSToby Isaac pointMatOffsets[0][0] = 0; 5496d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5497d3d1a6afSToby Isaac newPointOffsets[0][p+1] += newPointOffsets[0][p]; 5498d3d1a6afSToby Isaac pointMatOffsets[0][p+1] += pointMatOffsets[0][p]; 5499d3d1a6afSToby Isaac } 5500d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 5501d3d1a6afSToby Isaac } 5502d3d1a6afSToby Isaac 5503d3d1a6afSToby Isaac /* get the point-to-point matrices; construct newPoints */ 5504d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(aSec, &maxAnchor);CHKERRQ(ierr); 5505d3d1a6afSToby Isaac ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 5506d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 5507d3d1a6afSToby Isaac ierr = DMGetWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 5508d3d1a6afSToby Isaac if (numFields) { 5509d3d1a6afSToby Isaac for (p = 0, newP = 0; p < numPoints; p++) { 5510d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5511d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 5512d3d1a6afSToby Isaac PetscInt bDof = 0; 5513d3d1a6afSToby Isaac 5514d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5515d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5516d3d1a6afSToby Isaac } 5517d3d1a6afSToby Isaac if (bDof) { 5518d3d1a6afSToby Isaac PetscInt fStart[32], fEnd[32], fAnchorStart[32], fAnchorEnd[32], bOff, q; 5519d3d1a6afSToby Isaac 5520d3d1a6afSToby Isaac fStart[0] = 0; 5521d3d1a6afSToby Isaac fEnd[0] = 0; 5522d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5523d3d1a6afSToby Isaac PetscInt fDof; 5524d3d1a6afSToby Isaac 5525d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(cSec, b, f, &fDof);CHKERRQ(ierr); 5526d3d1a6afSToby Isaac fStart[f+1] = fStart[f] + fDof; 5527d3d1a6afSToby Isaac fEnd[f+1] = fStart[f+1]; 5528d3d1a6afSToby Isaac } 5529d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 5530d3d1a6afSToby Isaac ierr = indicesPointFields_private(cSec, b, bOff, fEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 5531d3d1a6afSToby Isaac 5532d3d1a6afSToby Isaac fAnchorStart[0] = 0; 5533d3d1a6afSToby Isaac fAnchorEnd[0] = 0; 5534d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5535d3d1a6afSToby Isaac PetscInt fDof = newPointOffsets[f][p + 1] - newPointOffsets[f][p]; 5536d3d1a6afSToby Isaac 5537d3d1a6afSToby Isaac fAnchorStart[f+1] = fAnchorStart[f] + fDof; 5538d3d1a6afSToby Isaac fAnchorEnd[f+1] = fAnchorStart[f + 1]; 5539d3d1a6afSToby Isaac } 5540d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 5541d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5542d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 5543d3d1a6afSToby Isaac 5544d3d1a6afSToby 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 */ 5545d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 5546d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 5547d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 5548d3d1a6afSToby Isaac ierr = indicesPointFields_private(section, a, aOff, fAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 5549d3d1a6afSToby Isaac } 5550d3d1a6afSToby Isaac newP += bDof; 5551d3d1a6afSToby Isaac 5552d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 5553d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5554d3d1a6afSToby 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); 5555d3d1a6afSToby Isaac } 5556d3d1a6afSToby Isaac } 5557d3d1a6afSToby Isaac else { 5558d3d1a6afSToby Isaac newPoints[2 * newP] = b; 5559d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 5560d3d1a6afSToby Isaac newP++; 5561d3d1a6afSToby Isaac } 5562d3d1a6afSToby Isaac } 5563d3d1a6afSToby Isaac } else { 5564d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5565d3d1a6afSToby Isaac PetscInt b = points[2*p]; 5566d3d1a6afSToby Isaac PetscInt o = points[2*p+1]; 5567d3d1a6afSToby Isaac PetscInt bDof = 0; 5568d3d1a6afSToby Isaac 5569d3d1a6afSToby Isaac if (b >= aStart && b < aEnd) { 5570d3d1a6afSToby Isaac ierr = PetscSectionGetDof(aSec, b, &bDof);CHKERRQ(ierr); 5571d3d1a6afSToby Isaac } 5572d3d1a6afSToby Isaac if (bDof) { 5573d3d1a6afSToby Isaac PetscInt bEnd = 0, bAnchorEnd = 0, bOff; 5574d3d1a6afSToby Isaac 5575d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(cSec, b, &bOff);CHKERRQ(ierr); 5576d3d1a6afSToby Isaac ierr = indicesPoint_private(cSec, b, bOff, &bEnd, PETSC_TRUE, o, indices);CHKERRQ(ierr); 5577d3d1a6afSToby Isaac 5578d3d1a6afSToby Isaac ierr = PetscSectionGetOffset (aSec, b, &bOff);CHKERRQ(ierr); 5579d3d1a6afSToby Isaac for (q = 0; q < bDof; q++) { 5580d3d1a6afSToby Isaac PetscInt a = anchors[bOff + q], aOff; 5581d3d1a6afSToby Isaac 5582d3d1a6afSToby 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 */ 5583d3d1a6afSToby Isaac 5584d3d1a6afSToby Isaac newPoints[2*(newP + q)] = a; 5585d3d1a6afSToby Isaac newPoints[2*(newP + q) + 1] = 0; 5586d3d1a6afSToby Isaac ierr = PetscSectionGetOffset(section, a, &aOff); 5587d3d1a6afSToby Isaac ierr = indicesPoint_private(section, a, aOff, &bAnchorEnd, PETSC_TRUE, 0, newIndices);CHKERRQ(ierr); 5588d3d1a6afSToby Isaac } 5589d3d1a6afSToby Isaac newP += bDof; 5590d3d1a6afSToby Isaac 5591d3d1a6afSToby Isaac /* get the point-to-point submatrix */ 5592d3d1a6afSToby Isaac ierr = MatGetValues(cMat,bEnd,indices,bAnchorEnd,newIndices,pointMat[0] + pointMatOffsets[0][p]);CHKERRQ(ierr); 5593d3d1a6afSToby Isaac } 5594d3d1a6afSToby Isaac else { 5595d3d1a6afSToby Isaac newPoints[2 * newP] = b; 5596d3d1a6afSToby Isaac newPoints[2 * newP + 1] = o; 5597d3d1a6afSToby Isaac newP++; 5598d3d1a6afSToby Isaac } 5599d3d1a6afSToby Isaac } 5600d3d1a6afSToby Isaac } 5601d3d1a6afSToby Isaac 5602d3d1a6afSToby Isaac ierr = PetscMemzero(tmpValues,newNumIndices*numIndices*sizeof(*tmpValues));CHKERRQ(ierr); 5603d3d1a6afSToby Isaac /* multiply constraints on the right */ 5604d3d1a6afSToby Isaac if (numFields) { 5605d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5606d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 5607d3d1a6afSToby Isaac 5608d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5609d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[f][p]; 5610d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5611d3d1a6afSToby Isaac PetscInt c, r, k; 5612d3d1a6afSToby Isaac PetscInt dof; 5613d3d1a6afSToby Isaac 5614d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 5615d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 5616d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[f][p+1]-cStart; 5617d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[f] + pointMatOffsets[f][p]; 5618d3d1a6afSToby Isaac 5619d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5620d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 5621d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5622d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 5623d3d1a6afSToby Isaac } 5624d3d1a6afSToby Isaac } 5625d3d1a6afSToby Isaac } 5626d3d1a6afSToby Isaac } 5627d3d1a6afSToby Isaac else { 5628d3d1a6afSToby Isaac /* copy this column as is */ 5629d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5630d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 5631d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 5632d3d1a6afSToby Isaac } 5633d3d1a6afSToby Isaac } 5634d3d1a6afSToby Isaac } 5635d3d1a6afSToby Isaac oldOff += dof; 5636d3d1a6afSToby Isaac } 5637d3d1a6afSToby Isaac } 5638d3d1a6afSToby Isaac } 5639d3d1a6afSToby Isaac else { 5640d3d1a6afSToby Isaac PetscInt oldOff = 0; 5641d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5642d3d1a6afSToby Isaac PetscInt cStart = newPointOffsets[0][p]; 5643d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5644d3d1a6afSToby Isaac PetscInt c, r, k; 5645d3d1a6afSToby Isaac PetscInt dof; 5646d3d1a6afSToby Isaac 5647d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 5648d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 5649d3d1a6afSToby Isaac PetscInt nCols = newPointOffsets[0][p+1]-cStart; 5650d3d1a6afSToby Isaac const PetscScalar *mat = pointMat[0] + pointMatOffsets[0][p]; 5651d3d1a6afSToby Isaac 5652d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5653d3d1a6afSToby Isaac for (c = 0; c < nCols; c++) { 5654d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5655d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] += mat[k * nCols + c] * values[r * numIndices + oldOff + k]; 5656d3d1a6afSToby Isaac } 5657d3d1a6afSToby Isaac } 5658d3d1a6afSToby Isaac } 5659d3d1a6afSToby Isaac } 5660d3d1a6afSToby Isaac else { 5661d3d1a6afSToby Isaac /* copy this column as is */ 5662d3d1a6afSToby Isaac for (r = 0; r < numIndices; r++) { 5663d3d1a6afSToby Isaac for (c = 0; c < dof; c++) { 5664d3d1a6afSToby Isaac tmpValues[r * newNumIndices + cStart + c] = values[r * numIndices + oldOff + c]; 5665d3d1a6afSToby Isaac } 5666d3d1a6afSToby Isaac } 5667d3d1a6afSToby Isaac } 5668d3d1a6afSToby Isaac oldOff += dof; 5669d3d1a6afSToby Isaac } 5670d3d1a6afSToby Isaac } 5671d3d1a6afSToby Isaac 5672d3d1a6afSToby Isaac ierr = PetscMemzero(newValues,newNumIndices*newNumIndices*sizeof(*newValues));CHKERRQ(ierr); 5673d3d1a6afSToby Isaac /* multiply constraints transpose on the left */ 5674d3d1a6afSToby Isaac if (numFields) { 5675d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5676d3d1a6afSToby Isaac PetscInt oldOff = offsets[f]; 5677d3d1a6afSToby Isaac 5678d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5679d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[f][p]; 5680d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5681d3d1a6afSToby Isaac PetscInt c, r, k; 5682d3d1a6afSToby Isaac PetscInt dof; 5683d3d1a6afSToby Isaac 5684d3d1a6afSToby Isaac ierr = PetscSectionGetFieldDof(section,b,f,&dof);CHKERRQ(ierr); 5685d3d1a6afSToby Isaac if (pointMatOffsets[f][p] < pointMatOffsets[f][p + 1]) { 5686d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[f][p+1]-rStart; 5687d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[f] + pointMatOffsets[f][p]; 5688d3d1a6afSToby Isaac 5689d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 5690d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5691d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5692d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 5693d3d1a6afSToby Isaac } 5694d3d1a6afSToby Isaac } 5695d3d1a6afSToby Isaac } 5696d3d1a6afSToby Isaac } 5697d3d1a6afSToby Isaac else { 5698d3d1a6afSToby Isaac /* copy this row as is */ 5699d3d1a6afSToby Isaac for (r = 0; r < dof; r++) { 5700d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5701d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 5702d3d1a6afSToby Isaac } 5703d3d1a6afSToby Isaac } 5704d3d1a6afSToby Isaac } 5705d3d1a6afSToby Isaac oldOff += dof; 5706d3d1a6afSToby Isaac } 5707d3d1a6afSToby Isaac } 5708d3d1a6afSToby Isaac } 5709d3d1a6afSToby Isaac else { 5710d3d1a6afSToby Isaac PetscInt oldOff = 0; 5711d3d1a6afSToby Isaac 5712d3d1a6afSToby Isaac for (p = 0; p < numPoints; p++) { 5713d3d1a6afSToby Isaac PetscInt rStart = newPointOffsets[0][p]; 5714d3d1a6afSToby Isaac PetscInt b = points[2 * p]; 5715d3d1a6afSToby Isaac PetscInt c, r, k; 5716d3d1a6afSToby Isaac PetscInt dof; 5717d3d1a6afSToby Isaac 5718d3d1a6afSToby Isaac ierr = PetscSectionGetDof(section,b,&dof);CHKERRQ(ierr); 5719d3d1a6afSToby Isaac if (pointMatOffsets[0][p] < pointMatOffsets[0][p + 1]) { 5720d3d1a6afSToby Isaac PetscInt nRows = newPointOffsets[0][p+1]-rStart; 5721d3d1a6afSToby Isaac const PetscScalar *PETSC_RESTRICT mat = pointMat[0] + pointMatOffsets[0][p]; 5722d3d1a6afSToby Isaac 5723d3d1a6afSToby Isaac for (r = 0; r < nRows; r++) { 5724d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5725d3d1a6afSToby Isaac for (k = 0; k < dof; k++) { 5726d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] += mat[k * nRows + r] * tmpValues[(oldOff + k) * newNumIndices + c]; 5727d3d1a6afSToby Isaac } 5728d3d1a6afSToby Isaac } 5729d3d1a6afSToby Isaac } 5730d3d1a6afSToby Isaac } 5731d3d1a6afSToby Isaac else { 5732d3d1a6afSToby Isaac /* copy this row as is */ 5733d3d1a6afSToby Isaac for (r = 0; r < dof; c++) { 5734d3d1a6afSToby Isaac for (c = 0; c < newNumIndices; c++) { 5735d3d1a6afSToby Isaac newValues[(rStart + r) * newNumIndices + c] = tmpValues[(oldOff + r) * newNumIndices + c]; 5736d3d1a6afSToby Isaac } 5737d3d1a6afSToby Isaac } 5738d3d1a6afSToby Isaac } 5739d3d1a6afSToby Isaac oldOff += dof; 5740d3d1a6afSToby Isaac } 5741d3d1a6afSToby Isaac } 5742d3d1a6afSToby Isaac 5743d3d1a6afSToby Isaac /* clean up */ 5744d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxDof,PETSC_INT,&indices);CHKERRQ(ierr); 5745d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,maxAnchor*maxDof,PETSC_INT,&newIndices);CHKERRQ(ierr); 5746d3d1a6afSToby Isaac if (numFields) { 5747d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5748d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[f][numPoints],PETSC_SCALAR,&pointMat[f]);CHKERRQ(ierr); 5749d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[f]);CHKERRQ(ierr); 5750d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[f]);CHKERRQ(ierr); 5751d3d1a6afSToby Isaac } 5752d3d1a6afSToby Isaac } 5753d3d1a6afSToby Isaac else { 5754d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,pointMatOffsets[0][numPoints],PETSC_SCALAR,&pointMat[0]);CHKERRQ(ierr); 5755d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&pointMatOffsets[0]);CHKERRQ(ierr); 5756d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,numPoints+1,PETSC_INT,&newPointOffsets[0]);CHKERRQ(ierr); 5757d3d1a6afSToby Isaac } 5758d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*numIndices,PETSC_SCALAR,&tmpValues);CHKERRQ(ierr); 5759d3d1a6afSToby Isaac ierr = ISRestoreIndices(aIS,&anchors);CHKERRQ(ierr); 5760d3d1a6afSToby Isaac 5761d3d1a6afSToby Isaac /* output */ 5762d3d1a6afSToby Isaac *outNumPoints = newNumPoints; 5763d3d1a6afSToby Isaac *outNumIndices = newNumIndices; 5764d3d1a6afSToby Isaac *outPoints = newPoints; 5765d3d1a6afSToby Isaac *outValues = newValues; 5766d3d1a6afSToby Isaac for (f = 0; f < numFields; f++) { 5767d3d1a6afSToby Isaac offsets[f] = newOffsets[f]; 5768d3d1a6afSToby Isaac } 5769d3d1a6afSToby Isaac PetscFunctionReturn(0); 5770d3d1a6afSToby Isaac } 5771d3d1a6afSToby Isaac 5772d3d1a6afSToby Isaac #undef __FUNCT__ 5773552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 57747f5d1fdeSMatthew G. Knepley /*@C 57757f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 57767f5d1fdeSMatthew G. Knepley 57777f5d1fdeSMatthew G. Knepley Not collective 57787f5d1fdeSMatthew G. Knepley 57797f5d1fdeSMatthew G. Knepley Input Parameters: 57807f5d1fdeSMatthew G. Knepley + dm - The DM 5781ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5782ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 57837f5d1fdeSMatthew G. Knepley . A - The matrix 57847f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 57857f5d1fdeSMatthew G. Knepley . values - The array of values 57867f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 57877f5d1fdeSMatthew G. Knepley 57887f5d1fdeSMatthew G. Knepley Fortran Notes: 57897f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 57907f5d1fdeSMatthew G. Knepley 57917f5d1fdeSMatthew G. Knepley Level: intermediate 57927f5d1fdeSMatthew G. Knepley 57937f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 57947f5d1fdeSMatthew G. Knepley @*/ 57957c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5796552f7358SJed Brown { 5797552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 57981b406b76SMatthew G. Knepley PetscSection clSection; 57991b406b76SMatthew G. Knepley IS clPoints; 5800d3d1a6afSToby Isaac PetscInt *points = NULL, *newPoints; 58011b406b76SMatthew G. Knepley const PetscInt *clp; 5802552f7358SJed Brown PetscInt *indices; 5803552f7358SJed Brown PetscInt offsets[32]; 5804d3d1a6afSToby Isaac PetscInt numFields, numPoints, newNumPoints, numIndices, newNumIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5805d3d1a6afSToby Isaac PetscScalar *newValues; 5806552f7358SJed Brown PetscErrorCode ierr; 5807552f7358SJed Brown 5808552f7358SJed Brown PetscFunctionBegin; 5809552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5810ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 58113dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5812ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 58133dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58143dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5815552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 581682f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5817552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 58181b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 58191b406b76SMatthew G. Knepley if (!clPoints) { 5820552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5821552f7358SJed Brown /* Compress out points not in the section */ 5822552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5823552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5824552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5825552f7358SJed Brown points[q*2] = points[p]; 5826552f7358SJed Brown points[q*2+1] = points[p+1]; 5827552f7358SJed Brown ++q; 5828552f7358SJed Brown } 5829552f7358SJed Brown } 5830552f7358SJed Brown numPoints = q; 58311b406b76SMatthew G. Knepley } else { 58321b406b76SMatthew G. Knepley PetscInt dof, off; 58331b406b76SMatthew G. Knepley 58341b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 58351b406b76SMatthew G. Knepley numPoints = dof/2; 58361b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 58371b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 58381b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 58391b406b76SMatthew G. Knepley } 5840552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5841552f7358SJed Brown PetscInt fdof; 5842552f7358SJed Brown 5843552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5844552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5845552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5846552f7358SJed Brown offsets[f+1] += fdof; 5847552f7358SJed Brown } 5848552f7358SJed Brown numIndices += dof; 5849552f7358SJed Brown } 58500d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58510d644c17SKarl Rupp 585282f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5853d3d1a6afSToby Isaac ierr = DMPlexConstraintsModifyMat(dm,section,numPoints,numIndices,points,values,&newNumPoints,&newNumIndices,&newPoints,&newValues,offsets);CHKERRQ(ierr); 5854d3d1a6afSToby Isaac if (newNumPoints) { 5855d3d1a6afSToby Isaac if (!clPoints) { 5856d3d1a6afSToby Isaac ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5857d3d1a6afSToby Isaac } else { 5858d3d1a6afSToby Isaac ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 5859d3d1a6afSToby Isaac } 5860d3d1a6afSToby Isaac numPoints = newNumPoints; 5861d3d1a6afSToby Isaac numIndices = newNumIndices; 5862d3d1a6afSToby Isaac points = newPoints; 5863d3d1a6afSToby Isaac values = newValues; 5864d3d1a6afSToby Isaac } 5865552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5866552f7358SJed Brown if (numFields) { 5867552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5868552f7358SJed Brown PetscInt o = points[p+1]; 5869552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5870552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5871552f7358SJed Brown } 5872552f7358SJed Brown } else { 5873e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5874552f7358SJed Brown PetscInt o = points[p+1]; 5875552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5876e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5877552f7358SJed Brown } 5878552f7358SJed Brown } 5879b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5880552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5881552f7358SJed Brown if (ierr) { 5882552f7358SJed Brown PetscMPIInt rank; 5883552f7358SJed Brown PetscErrorCode ierr2; 5884552f7358SJed Brown 588582f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 588677a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5887b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 58886a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5889552f7358SJed Brown CHKERRQ(ierr); 5890552f7358SJed Brown } 5891d3d1a6afSToby Isaac if (newNumPoints) { 5892d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,newNumIndices*newNumIndices,PETSC_SCALAR,&newValues);CHKERRQ(ierr); 5893d3d1a6afSToby Isaac ierr = DMRestoreWorkArray(dm,2*newNumPoints,PETSC_INT,&newPoints);CHKERRQ(ierr); 5894d3d1a6afSToby Isaac } 5895d3d1a6afSToby Isaac else { 58961b406b76SMatthew G. Knepley if (!clPoints) { 5897552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 58981b406b76SMatthew G. Knepley } else { 58991b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 59001b406b76SMatthew G. Knepley } 5901d3d1a6afSToby Isaac } 5902552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5903552f7358SJed Brown PetscFunctionReturn(0); 5904552f7358SJed Brown } 5905552f7358SJed Brown 5906552f7358SJed Brown #undef __FUNCT__ 5907de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5908de41b84cSMatthew 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) 5909de41b84cSMatthew G. Knepley { 5910de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5911de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5912de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5913de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5914de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5915de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 59164ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5917de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5918de41b84cSMatthew G. Knepley 5919de41b84cSMatthew G. Knepley PetscFunctionBegin; 5920de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5921de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5922de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5923de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5924de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5925de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5926de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5927de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5928de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5929de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5930de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5931de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5932de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5933de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5934de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5935de41b84cSMatthew G. Knepley /* Column indices */ 5936de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 59374ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5938de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5939de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5940de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5941de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5942de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5943de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5944de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5945de41b84cSMatthew G. Knepley ++q; 5946de41b84cSMatthew G. Knepley } 5947de41b84cSMatthew G. Knepley } 5948de41b84cSMatthew G. Knepley numCPoints = q; 5949de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5950de41b84cSMatthew G. Knepley PetscInt fdof; 5951de41b84cSMatthew G. Knepley 5952de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 59534ca5e9f5SMatthew G. Knepley if (!dof) continue; 5954de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5955de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5956de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5957de41b84cSMatthew G. Knepley } 5958de41b84cSMatthew G. Knepley numCIndices += dof; 5959de41b84cSMatthew G. Knepley } 5960de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5961de41b84cSMatthew G. Knepley /* Row indices */ 5962de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5963de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 59641ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5965de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5966de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5967de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5968de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5969de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5970de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5971de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 59724ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 59734ca5e9f5SMatthew G. Knepley if (!dof) continue; 59744ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 59754ca5e9f5SMatthew G. Knepley if (s < q) continue; 5976de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5977de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5978de41b84cSMatthew G. Knepley ++q; 5979de41b84cSMatthew G. Knepley } 5980de41b84cSMatthew G. Knepley } 5981de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5982de41b84cSMatthew G. Knepley } 5983de41b84cSMatthew G. Knepley numFPoints = q; 5984de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5985de41b84cSMatthew G. Knepley PetscInt fdof; 5986de41b84cSMatthew G. Knepley 5987de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 59884ca5e9f5SMatthew G. Knepley if (!dof) continue; 5989de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5990de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5991de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5992de41b84cSMatthew G. Knepley } 5993de41b84cSMatthew G. Knepley numFIndices += dof; 5994de41b84cSMatthew G. Knepley } 5995de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5996de41b84cSMatthew G. Knepley 5997de41b84cSMatthew 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); 5998de41b84cSMatthew 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); 5999de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6000de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6001de41b84cSMatthew G. Knepley if (numFields) { 6002de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 6003de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6004de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6005de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 6006de41b84cSMatthew G. Knepley } 6007de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 6008de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6009de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6010de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 6011de41b84cSMatthew G. Knepley } 6012de41b84cSMatthew G. Knepley } else { 6013de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 6014de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6015de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6016de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 6017de41b84cSMatthew G. Knepley } 6018de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 6019de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6020de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6021de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 6022de41b84cSMatthew G. Knepley } 6023de41b84cSMatthew G. Knepley } 6024de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 6025de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 6026de41b84cSMatthew G. Knepley if (ierr) { 6027de41b84cSMatthew G. Knepley PetscMPIInt rank; 6028de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 6029de41b84cSMatthew G. Knepley 6030de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 6031de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 6032de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 6033de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 6034de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 6035de41b84cSMatthew G. Knepley CHKERRQ(ierr); 6036de41b84cSMatthew G. Knepley } 6037549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 6038de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 6039de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6040de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6041de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 6042de41b84cSMatthew G. Knepley } 6043de41b84cSMatthew G. Knepley 6044de41b84cSMatthew G. Knepley #undef __FUNCT__ 60457c927364SMatthew G. Knepley #define __FUNCT__ "DMPlexMatGetClosureIndicesRefined" 60467c927364SMatthew G. Knepley PetscErrorCode DMPlexMatGetClosureIndicesRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, PetscInt point, PetscInt cindices[], PetscInt findices[]) 60477c927364SMatthew G. Knepley { 60487c927364SMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 60497c927364SMatthew G. Knepley PetscInt *cpoints = NULL; 60507c927364SMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 60517c927364SMatthew G. Knepley CellRefiner cellRefiner; 60527c927364SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 60537c927364SMatthew G. Knepley PetscErrorCode ierr; 60547c927364SMatthew G. Knepley 60557c927364SMatthew G. Knepley PetscFunctionBegin; 60567c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 60577c927364SMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 60587c927364SMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 60597c927364SMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 60607c927364SMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 60617c927364SMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 60627c927364SMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 60637c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 60647c927364SMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 60657c927364SMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 60667c927364SMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 60677c927364SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 60687c927364SMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 60697c927364SMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 60707c927364SMatthew G. Knepley /* Column indices */ 60717c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 60727c927364SMatthew G. Knepley maxFPoints = numCPoints; 60737c927364SMatthew G. Knepley /* Compress out points not in the section */ 60747c927364SMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 60757c927364SMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 60767c927364SMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 60777c927364SMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 60787c927364SMatthew G. Knepley cpoints[q*2] = cpoints[p]; 60797c927364SMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 60807c927364SMatthew G. Knepley ++q; 60817c927364SMatthew G. Knepley } 60827c927364SMatthew G. Knepley } 60837c927364SMatthew G. Knepley numCPoints = q; 60847c927364SMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 60857c927364SMatthew G. Knepley PetscInt fdof; 60867c927364SMatthew G. Knepley 60877c927364SMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 60887c927364SMatthew G. Knepley if (!dof) continue; 60897c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 60907c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 60917c927364SMatthew G. Knepley coffsets[f+1] += fdof; 60927c927364SMatthew G. Knepley } 60937c927364SMatthew G. Knepley numCIndices += dof; 60947c927364SMatthew G. Knepley } 60957c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 60967c927364SMatthew G. Knepley /* Row indices */ 60977c927364SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 60987c927364SMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 60997c927364SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 61007c927364SMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 61017c927364SMatthew G. Knepley /* TODO Map from coarse to fine cells */ 61027c927364SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 61037c927364SMatthew G. Knepley /* Compress out points not in the section */ 61047c927364SMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 61057c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 61067c927364SMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 61077c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 61087c927364SMatthew G. Knepley if (!dof) continue; 61097c927364SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 61107c927364SMatthew G. Knepley if (s < q) continue; 61117c927364SMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 61127c927364SMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 61137c927364SMatthew G. Knepley ++q; 61147c927364SMatthew G. Knepley } 61157c927364SMatthew G. Knepley } 61167c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 61177c927364SMatthew G. Knepley } 61187c927364SMatthew G. Knepley numFPoints = q; 61197c927364SMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 61207c927364SMatthew G. Knepley PetscInt fdof; 61217c927364SMatthew G. Knepley 61227c927364SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 61237c927364SMatthew G. Knepley if (!dof) continue; 61247c927364SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 61257c927364SMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 61267c927364SMatthew G. Knepley foffsets[f+1] += fdof; 61277c927364SMatthew G. Knepley } 61287c927364SMatthew G. Knepley numFIndices += dof; 61297c927364SMatthew G. Knepley } 61307c927364SMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 61317c927364SMatthew G. Knepley 61327c927364SMatthew 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); 61337c927364SMatthew 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); 61347c927364SMatthew G. Knepley if (numFields) { 61357c927364SMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 61367c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 61377c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 61387c927364SMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 61397c927364SMatthew G. Knepley } 61407c927364SMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 61417c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 61427c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 61437c927364SMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 61447c927364SMatthew G. Knepley } 61457c927364SMatthew G. Knepley } else { 61467c927364SMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 61477c927364SMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 61487c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 61497c927364SMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 61507c927364SMatthew G. Knepley } 61517c927364SMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 61527c927364SMatthew G. Knepley PetscInt o = cpoints[p+1]; 61537c927364SMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 61547c927364SMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 61557c927364SMatthew G. Knepley } 61567c927364SMatthew G. Knepley } 61577c927364SMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 61587c927364SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 61597c927364SMatthew G. Knepley PetscFunctionReturn(0); 61607c927364SMatthew G. Knepley } 61617c927364SMatthew G. Knepley 61627c927364SMatthew G. Knepley #undef __FUNCT__ 6163770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 6164f96281f8SMatthew G. Knepley /*@ 6165f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 6166f96281f8SMatthew G. Knepley 6167f96281f8SMatthew G. Knepley Input Parameter: 6168f96281f8SMatthew G. Knepley . dm - The DMPlex object 6169f96281f8SMatthew G. Knepley 6170f96281f8SMatthew G. Knepley Output Parameters: 6171f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 6172dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 6173dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 6174dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 6175f96281f8SMatthew G. Knepley 6176f96281f8SMatthew G. Knepley Level: developer 6177f96281f8SMatthew G. Knepley 6178dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexSetHybridBounds() 6179f96281f8SMatthew G. Knepley @*/ 6180770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 6181552f7358SJed Brown { 6182552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6183770b213bSMatthew G Knepley PetscInt dim; 6184770b213bSMatthew G Knepley PetscErrorCode ierr; 6185552f7358SJed Brown 6186552f7358SJed Brown PetscFunctionBegin; 6187552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6188c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6189770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 6190770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 6191770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 6192770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 6193552f7358SJed Brown PetscFunctionReturn(0); 6194552f7358SJed Brown } 6195552f7358SJed Brown 6196552f7358SJed Brown #undef __FUNCT__ 6197770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 6198dc5a3409SMatthew G. Knepley /*@ 6199dc5a3409SMatthew G. Knepley DMPlexSetHybridBounds - Set the first mesh point of each dimension which is a hybrid 6200dc5a3409SMatthew G. Knepley 6201dc5a3409SMatthew G. Knepley Input Parameters: 6202dc5a3409SMatthew G. Knepley . dm - The DMPlex object 6203dc5a3409SMatthew G. Knepley . cMax - The first hybrid cell 6204dc5a3409SMatthew G. Knepley . fMax - The first hybrid face 6205dc5a3409SMatthew G. Knepley . eMax - The first hybrid edge 6206dc5a3409SMatthew G. Knepley - vMax - The first hybrid vertex 6207dc5a3409SMatthew G. Knepley 6208dc5a3409SMatthew G. Knepley Level: developer 6209dc5a3409SMatthew G. Knepley 6210dc5a3409SMatthew G. Knepley .seealso DMPlexCreateHybridMesh(), DMPlexGetHybridBounds() 6211dc5a3409SMatthew G. Knepley @*/ 6212770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 6213552f7358SJed Brown { 6214552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6215770b213bSMatthew G Knepley PetscInt dim; 6216770b213bSMatthew G Knepley PetscErrorCode ierr; 6217552f7358SJed Brown 6218552f7358SJed Brown PetscFunctionBegin; 6219552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6220c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6221770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 6222770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 6223770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 6224770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 6225552f7358SJed Brown PetscFunctionReturn(0); 6226552f7358SJed Brown } 6227552f7358SJed Brown 6228552f7358SJed Brown #undef __FUNCT__ 6229552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 6230552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 6231552f7358SJed Brown { 6232552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6233552f7358SJed Brown 6234552f7358SJed Brown PetscFunctionBegin; 6235552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6236552f7358SJed Brown PetscValidPointer(cellHeight, 2); 6237552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 6238552f7358SJed Brown PetscFunctionReturn(0); 6239552f7358SJed Brown } 6240552f7358SJed Brown 6241552f7358SJed Brown #undef __FUNCT__ 6242552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 6243552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 6244552f7358SJed Brown { 6245552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6246552f7358SJed Brown 6247552f7358SJed Brown PetscFunctionBegin; 6248552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6249552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 6250552f7358SJed Brown PetscFunctionReturn(0); 6251552f7358SJed Brown } 6252552f7358SJed Brown 6253552f7358SJed Brown #undef __FUNCT__ 6254552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 6255552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 6256ef48cebcSMatthew G. Knepley static PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscInt shift, PetscInt *globalSize, PetscSF sf, IS *numbering) 6257552f7358SJed Brown { 6258552f7358SJed Brown PetscSection section, globalSection; 6259552f7358SJed Brown PetscInt *numbers, p; 6260552f7358SJed Brown PetscErrorCode ierr; 6261552f7358SJed Brown 6262552f7358SJed Brown PetscFunctionBegin; 626382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 6264552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 6265552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6266552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 6267552f7358SJed Brown } 6268552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 6269552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 6270785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 6271552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6272552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 6273ef48cebcSMatthew G. Knepley if (numbers[p-pStart] < 0) numbers[p-pStart] -= shift; 6274ef48cebcSMatthew G. Knepley else numbers[p-pStart] += shift; 6275552f7358SJed Brown } 627682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 6277ef48cebcSMatthew G. Knepley if (globalSize) { 6278ef48cebcSMatthew G. Knepley PetscLayout layout; 6279ef48cebcSMatthew G. Knepley ierr = PetscSectionGetPointLayout(PetscObjectComm((PetscObject) dm), globalSection, &layout);CHKERRQ(ierr); 6280ef48cebcSMatthew G. Knepley ierr = PetscLayoutGetSize(layout, globalSize);CHKERRQ(ierr); 6281ef48cebcSMatthew G. Knepley ierr = PetscLayoutDestroy(&layout);CHKERRQ(ierr); 6282ef48cebcSMatthew G. Knepley } 6283552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6284552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 6285552f7358SJed Brown PetscFunctionReturn(0); 6286552f7358SJed Brown } 6287552f7358SJed Brown 6288552f7358SJed Brown #undef __FUNCT__ 6289552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 6290552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 6291552f7358SJed Brown { 6292552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6293552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 6294552f7358SJed Brown PetscErrorCode ierr; 6295552f7358SJed Brown 6296552f7358SJed Brown PetscFunctionBegin; 6297552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6298552f7358SJed Brown if (!mesh->globalCellNumbers) { 6299552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6300552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 63010298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 63020d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6303ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, 0, NULL, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6304552f7358SJed Brown } 6305552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6306552f7358SJed Brown PetscFunctionReturn(0); 6307552f7358SJed Brown } 6308552f7358SJed Brown 6309552f7358SJed Brown #undef __FUNCT__ 6310552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6311552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6312552f7358SJed Brown { 6313552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6314552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6315552f7358SJed Brown PetscErrorCode ierr; 6316552f7358SJed Brown 6317552f7358SJed Brown PetscFunctionBegin; 6318552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6319552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6320552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 63210298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 63220d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6323ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, 0, NULL, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6324552f7358SJed Brown } 6325552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6326552f7358SJed Brown PetscFunctionReturn(0); 6327552f7358SJed Brown } 6328552f7358SJed Brown 6329ef48cebcSMatthew G. Knepley #undef __FUNCT__ 6330ef48cebcSMatthew G. Knepley #define __FUNCT__ "DMPlexCreatePointNumbering" 6331ef48cebcSMatthew G. Knepley PetscErrorCode DMPlexCreatePointNumbering(DM dm, IS *globalPointNumbers) 6332ef48cebcSMatthew G. Knepley { 6333ef48cebcSMatthew G. Knepley IS nums[4]; 6334ef48cebcSMatthew G. Knepley PetscInt depths[4]; 6335ef48cebcSMatthew G. Knepley PetscInt depth, d, shift = 0; 6336ef48cebcSMatthew G. Knepley PetscErrorCode ierr; 6337ef48cebcSMatthew G. Knepley 6338ef48cebcSMatthew G. Knepley PetscFunctionBegin; 6339ef48cebcSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6340ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6341ef48cebcSMatthew G. Knepley depths[0] = depth; depths[1] = 0; 6342ef48cebcSMatthew G. Knepley for (d = 2; d <= depth; ++d) depths[d] = depth-d+1; 6343ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) { 6344ef48cebcSMatthew G. Knepley PetscInt pStart, pEnd, gsize; 6345ef48cebcSMatthew G. Knepley 6346ef48cebcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, depths[d], &pStart, &pEnd);CHKERRQ(ierr); 6347ef48cebcSMatthew G. Knepley ierr = DMPlexCreateNumbering_Private(dm, pStart, pEnd, shift, &gsize, dm->sf, &nums[d]);CHKERRQ(ierr); 6348ef48cebcSMatthew G. Knepley shift += gsize; 6349ef48cebcSMatthew G. Knepley } 6350ef48cebcSMatthew G. Knepley ierr = ISConcatenate(PetscObjectComm((PetscObject) dm), depth+1, nums, globalPointNumbers); 6351ef48cebcSMatthew G. Knepley for (d = 0; d <= depth; ++d) {ierr = ISDestroy(&nums[d]);CHKERRQ(ierr);} 6352ef48cebcSMatthew G. Knepley PetscFunctionReturn(0); 6353ef48cebcSMatthew G. Knepley } 6354ef48cebcSMatthew G. Knepley 6355552f7358SJed Brown 6356552f7358SJed Brown #undef __FUNCT__ 6357552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6358552f7358SJed Brown /*@C 6359552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6360552f7358SJed Brown the local section and an SF describing the section point overlap. 6361552f7358SJed Brown 6362552f7358SJed Brown Input Parameters: 6363552f7358SJed Brown + s - The PetscSection for the local field layout 6364552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6365552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6366552f7358SJed Brown . label - The label specifying the points 6367552f7358SJed Brown - labelValue - The label stratum specifying the points 6368552f7358SJed Brown 6369552f7358SJed Brown Output Parameter: 6370552f7358SJed Brown . gsection - The PetscSection for the global field layout 6371552f7358SJed Brown 6372552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6373552f7358SJed Brown 6374552f7358SJed Brown Level: developer 6375552f7358SJed Brown 6376552f7358SJed Brown .seealso: PetscSectionCreate() 6377552f7358SJed Brown @*/ 6378552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6379552f7358SJed Brown { 63807ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6381552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6382552f7358SJed Brown PetscErrorCode ierr; 6383552f7358SJed Brown 6384552f7358SJed Brown PetscFunctionBegin; 63854c0d72c2SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr); 6386552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6387552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 63887ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 63897ec39499SMatthew G. Knepley if (nroots >= 0) { 63907ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 63911795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 63927ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 63931795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 63947ec39499SMatthew G. Knepley } else { 63957ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 63967ec39499SMatthew G. Knepley } 63977ec39499SMatthew G. Knepley } 6398552f7358SJed Brown /* Mark ghost points with negative dof */ 6399552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6400552f7358SJed Brown PetscInt value; 6401552f7358SJed Brown 6402552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6403552f7358SJed Brown if (value != labelValue) continue; 6404552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6405552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6406552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6407552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 64087ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6409552f7358SJed Brown } 6410552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6411552f7358SJed Brown if (nroots >= 0) { 64127ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64137ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6414552f7358SJed Brown if (nroots > pEnd-pStart) { 64157ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6416552f7358SJed Brown } 6417552f7358SJed Brown } 6418552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6419552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6420552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6421552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6422552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6423552f7358SJed Brown } 64244c0d72c2SMatthew G. Knepley ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr); 6425552f7358SJed Brown globalOff -= off; 6426552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6427552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 64287ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6429552f7358SJed Brown } 6430552f7358SJed Brown /* Put in negative offsets for ghost points */ 6431552f7358SJed Brown if (nroots >= 0) { 64327ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64337ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6434552f7358SJed Brown if (nroots > pEnd-pStart) { 64357ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6436552f7358SJed Brown } 6437552f7358SJed Brown } 64387ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6439552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6440552f7358SJed Brown PetscFunctionReturn(0); 6441552f7358SJed Brown } 6442ca8062c8SMatthew G. Knepley 6443ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6444ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6445ca8062c8SMatthew G. Knepley /*@ 6446ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6447ca8062c8SMatthew G. Knepley 6448ca8062c8SMatthew G. Knepley Input Parameters: 6449ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6450ca8062c8SMatthew G. Knepley 6451ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6452ca8062c8SMatthew G. Knepley 6453ca8062c8SMatthew G. Knepley Level: developer 6454ca8062c8SMatthew G. Knepley 64559bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6456ca8062c8SMatthew G. Knepley @*/ 6457ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6458ca8062c8SMatthew G. Knepley { 6459ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6460ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6461ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6462ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6463ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6464ca8062c8SMatthew G. Knepley 6465ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6466ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6467ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6468ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6469ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6470ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6471ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6472ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6473ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6474ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 647542e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 647642e66dfaSMatthew G. Knepley PetscInt d; 647742e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 647842e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 647942e66dfaSMatthew G. Knepley } 6480ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6481ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6482ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6483ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6484ca8062c8SMatthew G. Knepley } 648542e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 6486ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6487ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6488ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6489ca8062c8SMatthew G. Knepley } 6490ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6491ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6492ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6493ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6494ca8062c8SMatthew G. Knepley } 6495ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 649642e66dfaSMatthew G. Knepley if (dup) { 649742e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 649842e66dfaSMatthew G. Knepley } else { 6499ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6500ca8062c8SMatthew G. Knepley } 6501ca8062c8SMatthew G. Knepley } 650242e66dfaSMatthew G. Knepley } 6503ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6504ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6505ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6506ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6507ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6508ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6509ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6510ca8062c8SMatthew G. Knepley } 6511ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6512ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6513ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6514ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6515ca8062c8SMatthew G. Knepley } 6516ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6517ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6518ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6519ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6520ca8062c8SMatthew G. Knepley } 6521ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6522ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6523ca8062c8SMatthew G. Knepley } 6524ca8062c8SMatthew G. Knepley } 6525ca8062c8SMatthew G. Knepley } 6526ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6527ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6528ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6529ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6530ca8062c8SMatthew G. Knepley } 6531ca8062c8SMatthew G. Knepley 6532ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6533ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6534ca8062c8SMatthew G. Knepley /*@ 6535ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6536ca8062c8SMatthew G. Knepley 6537ca8062c8SMatthew G. Knepley Input Parameters: 6538ca8062c8SMatthew G. Knepley + dm - The DMPlex object 653958723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 654058723a97SMatthew G. Knepley - cellHeight - Normally 0 6541ca8062c8SMatthew G. Knepley 6542ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6543ca8062c8SMatthew G. Knepley 6544ca8062c8SMatthew G. Knepley Level: developer 6545ca8062c8SMatthew G. Knepley 65469bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6547ca8062c8SMatthew G. Knepley @*/ 654858723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6549ca8062c8SMatthew G. Knepley { 655042363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6551ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6552ca8062c8SMatthew G. Knepley 6553ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6554ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6555c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6556ca8062c8SMatthew G. Knepley switch (dim) { 655742363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 655842363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 655942363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6560ca8062c8SMatthew G. Knepley default: 6561ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6562ca8062c8SMatthew G. Knepley } 656358723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 656458723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6565ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6566ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6567ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 656858723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 656958723a97SMatthew G. Knepley 657058723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 657158723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 657258723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 657358723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 657458723a97SMatthew G. Knepley } 657558723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6576ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6577ca8062c8SMatthew G. Knepley } 657842363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 657942363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 658042363296SMatthew G. Knepley 658142363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 658242363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 658342363296SMatthew G. Knepley const PetscInt p = closure[cl]; 658442363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 658542363296SMatthew G. Knepley } 658642363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 658742363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 658842363296SMatthew G. Knepley } 6589ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6590ca8062c8SMatthew G. Knepley } 65919bf0dad6SMatthew G. Knepley 65929bf0dad6SMatthew G. Knepley #undef __FUNCT__ 65939bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 65949bf0dad6SMatthew G. Knepley /*@ 65959bf0dad6SMatthew 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 65969bf0dad6SMatthew G. Knepley 65979bf0dad6SMatthew G. Knepley Input Parameters: 65989bf0dad6SMatthew G. Knepley + dm - The DMPlex object 65999bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 66009bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 66019bf0dad6SMatthew G. Knepley 66029bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 66039bf0dad6SMatthew G. Knepley 66049bf0dad6SMatthew G. Knepley Level: developer 66059bf0dad6SMatthew G. Knepley 66069bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 66079bf0dad6SMatthew G. Knepley @*/ 66089bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 66099bf0dad6SMatthew G. Knepley { 66103554e41dSMatthew G. Knepley PetscInt pMax[4]; 66113554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 66129bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 66139bf0dad6SMatthew G. Knepley 66149bf0dad6SMatthew G. Knepley PetscFunctionBegin; 66159bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6616c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 66179bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 661825abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 66193554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 66203554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 66213554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 66229bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 66239bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 66249bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 66259bf0dad6SMatthew G. Knepley 662625abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 66279bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 66289bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 66299bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 66309bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66319bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 66329bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 66339bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 66349bf0dad6SMatthew G. Knepley } 66353554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66369bf0dad6SMatthew 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); 66379bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 66389bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 66399bf0dad6SMatthew G. Knepley 66409bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66419bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 66429bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 66439bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 66449bf0dad6SMatthew G. Knepley } 6645e003ed69SMatthew 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); 66469bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6647e003ed69SMatthew 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]); 66489bf0dad6SMatthew G. Knepley } 66499bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66509bf0dad6SMatthew G. Knepley } 66519bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66529bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66539bf0dad6SMatthew G. Knepley } 66543554e41dSMatthew G. Knepley } 6655552f7358SJed Brown PetscFunctionReturn(0); 6656552f7358SJed Brown } 66573913d7c8SMatthew G. Knepley 66583913d7c8SMatthew G. Knepley #undef __FUNCT__ 6659bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6660bceba477SMatthew G. Knepley /* Pointwise interpolation 6661bceba477SMatthew G. Knepley Just code FEM for now 6662bceba477SMatthew G. Knepley u^f = I u^c 66634ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 66644ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 66654ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6666bceba477SMatthew G. Knepley */ 6667bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6668bceba477SMatthew G. Knepley { 6669bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6670bceba477SMatthew G. Knepley PetscInt m, n; 6671a063dac3SMatthew G. Knepley void *ctx; 6672bceba477SMatthew G. Knepley PetscErrorCode ierr; 6673bceba477SMatthew G. Knepley 6674bceba477SMatthew G. Knepley PetscFunctionBegin; 6675bceba477SMatthew G. Knepley /* 6676bceba477SMatthew G. Knepley Loop over coarse cells 6677bceba477SMatthew G. Knepley Loop over coarse basis functions 6678bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6679bceba477SMatthew G. Knepley Loop over fine dual basis functions 6680bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6681bceba477SMatthew G. Knepley Sum 6682bceba477SMatthew G. Knepley Update local element matrix 6683bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6684bceba477SMatthew G. Knepley 6685bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6686bceba477SMatthew G. Knepley */ 6687bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6688bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6689bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6690bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6691bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6692bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6693bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6694bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6695a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6696a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 66975d1c2e58SMatthew G. Knepley /* Use naive scaling */ 66985d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6699a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6700a063dac3SMatthew G. Knepley } 6701bceba477SMatthew G. Knepley 6702a063dac3SMatthew G. Knepley #undef __FUNCT__ 6703a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6704a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6705a063dac3SMatthew G. Knepley { 670690748bafSMatthew G. Knepley PetscErrorCode ierr; 670790748bafSMatthew G. Knepley 6708a063dac3SMatthew G. Knepley PetscFunctionBegin; 67097c927364SMatthew G. Knepley ierr = DMPlexComputeInjectorFEM(dmCoarse, dmFine, ctx, NULL);CHKERRQ(ierr); 6710bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6711bceba477SMatthew G. Knepley } 6712bceba477SMatthew G. Knepley 6713bceba477SMatthew G. Knepley #undef __FUNCT__ 6714fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6715fd59a867SMatthew G. Knepley /* Pointwise interpolation 6716fd59a867SMatthew G. Knepley Just code FEM for now 6717fd59a867SMatthew G. Knepley u^f = I u^c 6718fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6719fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6720fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6721fd59a867SMatthew G. Knepley */ 6722fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6723fd59a867SMatthew G. Knepley { 6724fd59a867SMatthew G. Knepley PetscSection section; 6725fd59a867SMatthew G. Knepley IS *bcPoints; 6726286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6727286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6728fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6729fd59a867SMatthew G. Knepley 6730fd59a867SMatthew G. Knepley PetscFunctionBegin; 6731fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6732286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6733c73cfb54SMatthew G. Knepley ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr); 6734fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6735fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6736fd59a867SMatthew G. Knepley PetscBool isEssential; 673763d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6738fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6739fd59a867SMatthew G. Knepley } 6740fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6741fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6742fd59a867SMatthew G. Knepley const char *bdLabel; 6743fd59a867SMatthew G. Knepley DMLabel label; 6744fd59a867SMatthew G. Knepley const PetscInt *values; 67457391c1cbSMatthew G. Knepley PetscInt bd2, field, numValues; 6746c945be8dSMatthew G. Knepley PetscBool isEssential, duplicate = PETSC_FALSE; 6747fd59a867SMatthew G. Knepley 674863d5297fSMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6749fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6750fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 67517391c1cbSMatthew G. Knepley /* Only want to do this for FEM, and only once */ 67527391c1cbSMatthew G. Knepley for (bd2 = 0; bd2 < bd; ++bd2) { 67537391c1cbSMatthew G. Knepley const char *bdname; 67542f81efd2SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd2, NULL, NULL, &bdname, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 67557391c1cbSMatthew G. Knepley ierr = PetscStrcmp(bdname, bdLabel, &duplicate);CHKERRQ(ierr); 67567391c1cbSMatthew G. Knepley if (duplicate) break; 67577391c1cbSMatthew G. Knepley } 67587391c1cbSMatthew G. Knepley if (!duplicate) { 6759fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 676032720fa8SMatthew G. Knepley ierr = DMPlexLabelAddCells(dm, label);CHKERRQ(ierr); 67617391c1cbSMatthew G. Knepley } 676293a5981aSMatthew G. Knepley /* Filter out cells, if you actually want to constraint cells you need to do things by hand right now */ 6763fd59a867SMatthew G. Knepley if (isEssential) { 676493a5981aSMatthew G. Knepley IS tmp; 676593a5981aSMatthew G. Knepley PetscInt *newidx; 676693a5981aSMatthew G. Knepley const PetscInt *idx; 676793a5981aSMatthew G. Knepley PetscInt cStart, cEnd, n, p, newn = 0; 676893a5981aSMatthew G. Knepley 6769fd59a867SMatthew G. Knepley bcFields[bc] = field; 677093a5981aSMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &tmp);CHKERRQ(ierr); 677193a5981aSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 677293a5981aSMatthew G. Knepley ierr = ISGetLocalSize(tmp, &n);CHKERRQ(ierr); 677393a5981aSMatthew G. Knepley ierr = ISGetIndices(tmp, &idx);CHKERRQ(ierr); 677493a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) ++newn; 677593a5981aSMatthew G. Knepley ierr = PetscMalloc1(newn,&newidx);CHKERRQ(ierr); 677693a5981aSMatthew G. Knepley newn = 0; 677793a5981aSMatthew G. Knepley for (p = 0; p < n; ++p) if ((idx[p] < cStart) || (idx[p] >= cEnd)) newidx[newn++] = idx[p]; 677893a5981aSMatthew G. Knepley ierr = ISCreateGeneral(PetscObjectComm((PetscObject) dm), newn, newidx, PETSC_OWN_POINTER, &bcPoints[bc++]);CHKERRQ(ierr); 677993a5981aSMatthew G. Knepley ierr = ISRestoreIndices(tmp, &idx);CHKERRQ(ierr); 678093a5981aSMatthew G. Knepley ierr = ISDestroy(&tmp);CHKERRQ(ierr); 6781fd59a867SMatthew G. Knepley } 6782fd59a867SMatthew G. Knepley } 6783fd59a867SMatthew G. Knepley /* Handle discretization */ 6784fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6785286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6786fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6787fd59a867SMatthew G. Knepley PetscFE fe; 6788286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6789fd59a867SMatthew G. Knepley PetscInt d; 6790fd59a867SMatthew G. Knepley 679118abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6792fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6793286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6794286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6795fd59a867SMatthew G. Knepley } 6796286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6797286d8613SMatthew G. Knepley PetscInt d; 6798286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6799286d8613SMatthew 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."); 6800286d8613SMatthew G. Knepley } 6801286d8613SMatthew G. Knepley } 6802f8f126e8SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, §ion);CHKERRQ(ierr); 6803fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6804fd59a867SMatthew G. Knepley PetscFE fe; 6805fd59a867SMatthew G. Knepley const char *name; 680618abd763SMatthew G. Knepley 680718abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6808fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6809fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6810fd59a867SMatthew G. Knepley } 6811fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6812fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6813fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6814fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6815286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6816bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6817bceba477SMatthew G. Knepley } 6818bceba477SMatthew G. Knepley 6819bceba477SMatthew G. Knepley #undef __FUNCT__ 68203913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 68213913d7c8SMatthew G. Knepley /*@ 68223913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 68233913d7c8SMatthew G. Knepley 68243913d7c8SMatthew G. Knepley Input Parameter: 68253913d7c8SMatthew G. Knepley . dm - The DMPlex object 68263913d7c8SMatthew G. Knepley 68273913d7c8SMatthew G. Knepley Output Parameter: 68283913d7c8SMatthew G. Knepley . cdm - The coarse DM 68293913d7c8SMatthew G. Knepley 68303913d7c8SMatthew G. Knepley Level: intermediate 68313913d7c8SMatthew G. Knepley 68323913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 68333913d7c8SMatthew G. Knepley @*/ 68343913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 68353913d7c8SMatthew G. Knepley { 68363913d7c8SMatthew G. Knepley PetscFunctionBegin; 68373913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68383913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 68393913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 68403913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68413913d7c8SMatthew G. Knepley } 68423913d7c8SMatthew G. Knepley 68433913d7c8SMatthew G. Knepley #undef __FUNCT__ 68443913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 68453913d7c8SMatthew G. Knepley /*@ 68463913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 68473913d7c8SMatthew G. Knepley 68483913d7c8SMatthew G. Knepley Input Parameters: 68493913d7c8SMatthew G. Knepley + dm - The DMPlex object 68503913d7c8SMatthew G. Knepley - cdm - The coarse DM 68513913d7c8SMatthew G. Knepley 68523913d7c8SMatthew G. Knepley Level: intermediate 68533913d7c8SMatthew G. Knepley 68543913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 68553913d7c8SMatthew G. Knepley @*/ 68563913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 68573913d7c8SMatthew G. Knepley { 68583913d7c8SMatthew G. Knepley DM_Plex *mesh; 68593913d7c8SMatthew G. Knepley PetscErrorCode ierr; 68603913d7c8SMatthew G. Knepley 68613913d7c8SMatthew G. Knepley PetscFunctionBegin; 68623913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68633913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 68643913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 68653913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 68663913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 68673913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 68683913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68693913d7c8SMatthew G. Knepley } 6870a68b90caSToby Isaac 6871a68b90caSToby Isaac /* constraints */ 6872a68b90caSToby Isaac #undef __FUNCT__ 6873a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraints" 6874a68b90caSToby Isaac /*@ 6875a68b90caSToby Isaac DMPlexGetConstraints - Get the layout of the local point-to-point constraints 6876a68b90caSToby Isaac 6877a68b90caSToby Isaac not collective 6878a68b90caSToby Isaac 6879a68b90caSToby Isaac Input Parameters: 6880a68b90caSToby Isaac . dm - The DMPlex object 6881a68b90caSToby Isaac 6882a68b90caSToby Isaac Output Parameters: 6883a68b90caSToby Isaac + anchorSection - If not NULL, set to the section describing which points anchor the constrained points. 6884a68b90caSToby Isaac - anchorIS - If not NULL, set to the list of anchors indexed by anchorSection 6885a68b90caSToby Isaac 6886a68b90caSToby Isaac 6887a68b90caSToby Isaac Level: intermediate 6888a68b90caSToby Isaac 6889a68b90caSToby Isaac .seealso: DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6890a68b90caSToby Isaac @*/ 6891a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraints(DM dm, PetscSection *anchorSection, IS *anchorIS) 6892a68b90caSToby Isaac { 6893a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6894a68b90caSToby Isaac 6895a68b90caSToby Isaac PetscFunctionBegin; 6896a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6897a68b90caSToby Isaac if (anchorSection) *anchorSection = plex->anchorSection; 6898a68b90caSToby Isaac if (anchorIS) *anchorIS = plex->anchorIS; 6899a68b90caSToby Isaac PetscFunctionReturn(0); 6900a68b90caSToby Isaac } 6901a68b90caSToby Isaac 6902a68b90caSToby Isaac #undef __FUNCT__ 6903a68b90caSToby Isaac #define __FUNCT__ "DMGlobalToLocalHook_Plex_constraints" 6904a68b90caSToby Isaac static PetscErrorCode DMGlobalToLocalHook_Plex_constraints(DM dm, Vec g, InsertMode mode, Vec l, void *ctx) 6905a68b90caSToby Isaac { 6906a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6907a68b90caSToby Isaac Mat cMat; 6908a68b90caSToby Isaac Vec cVec; 6909a68b90caSToby Isaac PetscSection section, cSec; 6910a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof; 6911a68b90caSToby Isaac PetscErrorCode ierr; 6912a68b90caSToby Isaac 6913a68b90caSToby Isaac PetscFunctionBegin; 6914a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6915a68b90caSToby Isaac cMat = plex->constraintMat; 6916a68b90caSToby Isaac if (cMat && (mode == INSERT_VALUES || mode == INSERT_ALL_VALUES || mode == INSERT_BC_VALUES)) { 6917a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6918a68b90caSToby Isaac cSec = plex->constraintSection; 6919a68b90caSToby Isaac ierr = MatGetVecs(cMat,NULL,&cVec);CHKERRQ(ierr); 6920a68b90caSToby Isaac ierr = MatMult(cMat,l,cVec);CHKERRQ(ierr); 6921a68b90caSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 6922a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6923a68b90caSToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 6924a68b90caSToby Isaac if (dof) { 6925a68b90caSToby Isaac PetscScalar *vals; 6926a68b90caSToby Isaac ierr = VecGetValuesSection(cVec,cSec,p,&vals);CHKERRQ(ierr); 6927a68b90caSToby Isaac ierr = VecSetValuesSection(l,section,p,vals,INSERT_ALL_VALUES);CHKERRQ(ierr); 6928a68b90caSToby Isaac } 6929a68b90caSToby Isaac } 6930a68b90caSToby Isaac ierr = VecDestroy(&cVec);CHKERRQ(ierr); 6931a68b90caSToby Isaac } 6932a68b90caSToby Isaac PetscFunctionReturn(0); 6933a68b90caSToby Isaac } 6934a68b90caSToby Isaac 6935a68b90caSToby Isaac #undef __FUNCT__ 6936a68b90caSToby Isaac #define __FUNCT__ "DMLocalToGlobalHook_Plex_constraints" 6937a68b90caSToby Isaac static PetscErrorCode DMLocalToGlobalHook_Plex_constraints(DM dm, Vec l, InsertMode mode, Vec g, void *ctx) 6938a68b90caSToby Isaac { 6939a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 6940a68b90caSToby Isaac Mat cMat; 6941a68b90caSToby Isaac Vec cVec; 6942a68b90caSToby Isaac PetscSection section, cSec; 6943a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof; 6944a68b90caSToby Isaac PetscErrorCode ierr; 6945a68b90caSToby Isaac 6946a68b90caSToby Isaac PetscFunctionBegin; 6947a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6948a68b90caSToby Isaac cMat = plex->constraintMat; 6949a68b90caSToby Isaac if (cMat && (mode == ADD_VALUES || mode == ADD_ALL_VALUES || mode == ADD_BC_VALUES)) { 6950a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 6951a68b90caSToby Isaac cSec = plex->constraintSection; 6952a68b90caSToby Isaac ierr = MatGetVecs(cMat,NULL,&cVec);CHKERRQ(ierr); 6953a68b90caSToby Isaac ierr = PetscSectionGetChart(cSec,&pStart,&pEnd);CHKERRQ(ierr); 6954a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 6955a68b90caSToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 6956a68b90caSToby Isaac if (dof) { 6957a68b90caSToby Isaac PetscInt d; 6958a68b90caSToby Isaac PetscScalar *vals; 6959a68b90caSToby Isaac ierr = VecGetValuesSection(l,section,p,&vals);CHKERRQ(ierr); 6960a68b90caSToby Isaac ierr = VecSetValuesSection(cVec,cSec,p,vals,mode);CHKERRQ(ierr); 6961a68b90caSToby Isaac /* for this to be the true transpose, we have to zero the values that 6962a68b90caSToby Isaac * we just extracted */ 6963a68b90caSToby Isaac for (d = 0; d < dof; d++) { 6964a68b90caSToby Isaac vals[d] = 0.; 6965a68b90caSToby Isaac } 6966a68b90caSToby Isaac } 6967a68b90caSToby Isaac } 6968a68b90caSToby Isaac ierr = MatMultTransposeAdd(cMat,cVec,l,l);CHKERRQ(ierr); 6969a68b90caSToby Isaac ierr = VecDestroy(&cVec);CHKERRQ(ierr); 6970a68b90caSToby Isaac } 6971a68b90caSToby Isaac PetscFunctionReturn(0); 6972a68b90caSToby Isaac } 6973a68b90caSToby Isaac 6974a68b90caSToby Isaac #undef __FUNCT__ 6975a68b90caSToby Isaac #define __FUNCT__ "DMPlexSetConstraints" 6976a68b90caSToby Isaac /*@ 6977a68b90caSToby Isaac DMPlexSetConstraints - Set the layout of the local point-to-point constraints. Unlike boundary conditions, when a 6978a68b90caSToby Isaac point's degrees of freedom in a section are constrained to an outside value, the point-to-point constraints set a 6979a68b90caSToby Isaac point's degrees of freedom to be a linear combination of other points' degrees of freedom. 6980a68b90caSToby Isaac 6981a68b90caSToby Isaac After specifying the layout of constraints with DMPlexSetConstraints(), one specifies the constraints by calling 6982a68b90caSToby Isaac DMPlexGetConstraintMatrix() and filling in the entries. This matrix will be used fill in the constrained values 6983a68b90caSToby Isaac from the anchor values in local vectors in DMGlobalToLocalEnd() with mode = INSERT_VALUES, and its transpose is used 6984a68b90caSToby Isaac to sum constrained values back to their anchor values in DMLocalToGlobalBegin() with mode = ADD_VALUES. 6985a68b90caSToby Isaac 6986a68b90caSToby Isaac logically collective 6987a68b90caSToby Isaac 6988a68b90caSToby Isaac Input Parameters: 6989a68b90caSToby Isaac + dm - The DMPlex object 6990a68b90caSToby Isaac . anchorSection - The section that describes the mapping from constrained points to the anchor points listed in anchorIS. 6991a68b90caSToby Isaac - anchorIS - The list of all anchor points. 6992a68b90caSToby Isaac 6993a68b90caSToby Isaac The reference counts of anchorSection and anchorIS are incremented. 6994a68b90caSToby Isaac 6995a68b90caSToby Isaac 6996a68b90caSToby Isaac Level: intermediate 6997a68b90caSToby Isaac 6998a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 6999a68b90caSToby Isaac @*/ 7000a68b90caSToby Isaac PetscErrorCode DMPlexSetConstraints(DM dm, PetscSection anchorSection, IS anchorIS) 7001a68b90caSToby Isaac { 7002a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7003a68b90caSToby Isaac PetscErrorCode ierr; 7004a68b90caSToby Isaac 7005a68b90caSToby Isaac PetscFunctionBegin; 7006a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7007a68b90caSToby Isaac 7008a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorSection);CHKERRQ(ierr); 7009a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->anchorSection);CHKERRQ(ierr); 7010a68b90caSToby Isaac plex->anchorSection = anchorSection; 7011a68b90caSToby Isaac 7012a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)anchorIS);CHKERRQ(ierr); 7013a68b90caSToby Isaac ierr = ISDestroy(&plex->anchorIS);CHKERRQ(ierr); 7014a68b90caSToby Isaac plex->anchorIS = anchorIS; 7015a68b90caSToby Isaac 7016a68b90caSToby Isaac #if defined(PETSC_USE_DEBUG) 7017a68b90caSToby Isaac if (anchorIS && anchorSection) { 7018a68b90caSToby Isaac PetscInt size, a, pStart, pEnd; 7019a68b90caSToby Isaac const PetscInt *anchors; 7020a68b90caSToby Isaac 7021a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 7022a68b90caSToby Isaac ierr = ISGetLocalSize(anchorIS,&size);CHKERRQ(ierr); 7023a68b90caSToby Isaac ierr = ISGetIndices(anchorIS,&anchors);CHKERRQ(ierr); 7024a68b90caSToby Isaac for (a = 0; a < size; a++) { 7025a68b90caSToby Isaac PetscInt p; 7026a68b90caSToby Isaac 7027a68b90caSToby Isaac p = anchors[a]; 7028a68b90caSToby Isaac if (p >= pStart && p < pEnd) { 7029a68b90caSToby Isaac PetscInt dof; 7030a68b90caSToby Isaac 7031a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 7032a68b90caSToby Isaac if (dof) { 7033a68b90caSToby Isaac PetscErrorCode ierr2; 7034a68b90caSToby Isaac 7035a68b90caSToby Isaac ierr2 = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr2); 7036a68b90caSToby Isaac SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Point %d cannot be constrained and an anchor",p); 7037a68b90caSToby Isaac } 7038a68b90caSToby Isaac } 7039a68b90caSToby Isaac } 7040a68b90caSToby Isaac ierr = ISRestoreIndices(anchorIS,&anchors);CHKERRQ(ierr); 7041a68b90caSToby Isaac } 7042a68b90caSToby Isaac #endif 7043a68b90caSToby Isaac 7044a68b90caSToby Isaac ierr = PetscSectionDestroy(&plex->constraintSection);CHKERRQ(ierr); 7045a68b90caSToby Isaac ierr = MatDestroy(&plex->constraintMat);CHKERRQ(ierr); 7046a68b90caSToby Isaac 7047a68b90caSToby Isaac if (anchorSection) { 7048a68b90caSToby Isaac /* add the constraint hooks if they have not already been added */ 7049a68b90caSToby Isaac { 7050a68b90caSToby Isaac DMGlobalToLocalHookLink link,next=NULL; 7051a68b90caSToby Isaac for (link=dm->gtolhook; link; link=next) { 7052a68b90caSToby Isaac next = link->next; 7053a68b90caSToby Isaac if (link->endhook == DMGlobalToLocalHook_Plex_constraints) { 7054a68b90caSToby Isaac break; 7055a68b90caSToby Isaac } 7056a68b90caSToby Isaac } 7057a68b90caSToby Isaac if (!link) { 7058a68b90caSToby Isaac ierr = DMGlobalToLocalHookAdd(dm,NULL,DMGlobalToLocalHook_Plex_constraints,NULL);CHKERRQ(ierr); 7059a68b90caSToby Isaac } 7060a68b90caSToby Isaac } 7061a68b90caSToby Isaac { 7062a68b90caSToby Isaac DMLocalToGlobalHookLink link,next=NULL; 7063a68b90caSToby Isaac for (link=dm->ltoghook; link; link=next) { 7064a68b90caSToby Isaac next = link->next; 7065a68b90caSToby Isaac if (link->beginhook == DMLocalToGlobalHook_Plex_constraints) { 7066a68b90caSToby Isaac break; 7067a68b90caSToby Isaac } 7068a68b90caSToby Isaac } 7069a68b90caSToby Isaac if (!link) { 7070a68b90caSToby Isaac ierr = DMLocalToGlobalHookAdd(dm,DMLocalToGlobalHook_Plex_constraints,NULL,NULL);CHKERRQ(ierr); 7071a68b90caSToby Isaac } 7072a68b90caSToby Isaac } 7073a68b90caSToby Isaac } 7074a68b90caSToby Isaac else { 7075a68b90caSToby Isaac /* remove the constraint hooks if they were added before */ 7076a68b90caSToby Isaac { 7077a68b90caSToby Isaac DMGlobalToLocalHookLink prev=NULL,link,next=NULL; 7078a68b90caSToby Isaac for (link=dm->gtolhook; link; link=next) { 7079a68b90caSToby Isaac next = link->next; 7080a68b90caSToby Isaac if (link->endhook == DMGlobalToLocalHook_Plex_constraints) { 7081a68b90caSToby Isaac break; 7082a68b90caSToby Isaac } 7083a68b90caSToby Isaac } 7084a68b90caSToby Isaac if (link) { 7085a68b90caSToby Isaac ierr = PetscFree(link);CHKERRQ(ierr); 7086a68b90caSToby Isaac if (prev) { 7087a68b90caSToby Isaac prev->next = next; 7088a68b90caSToby Isaac } 7089a68b90caSToby Isaac else { 7090a68b90caSToby Isaac dm->gtolhook = next; 7091a68b90caSToby Isaac } 7092a68b90caSToby Isaac } 7093a68b90caSToby Isaac } 7094a68b90caSToby Isaac { 7095a68b90caSToby Isaac DMLocalToGlobalHookLink prev=NULL,link,next=NULL; 7096a68b90caSToby Isaac for (link=dm->ltoghook; link; link=next) { 7097a68b90caSToby Isaac next = link->next; 7098a68b90caSToby Isaac if (link->beginhook == DMLocalToGlobalHook_Plex_constraints) { 7099a68b90caSToby Isaac break; 7100a68b90caSToby Isaac } 7101a68b90caSToby Isaac } 7102a68b90caSToby Isaac if (link) { 7103a68b90caSToby Isaac ierr = PetscFree(link);CHKERRQ(ierr); 7104a68b90caSToby Isaac if (prev) { 7105a68b90caSToby Isaac prev->next = next; 7106a68b90caSToby Isaac } 7107a68b90caSToby Isaac else { 7108a68b90caSToby Isaac dm->ltoghook = next; 7109a68b90caSToby Isaac } 7110a68b90caSToby Isaac } 7111a68b90caSToby Isaac } 7112a68b90caSToby Isaac } 7113a68b90caSToby Isaac 7114a68b90caSToby Isaac PetscFunctionReturn(0); 7115a68b90caSToby Isaac } 7116a68b90caSToby Isaac 7117a68b90caSToby Isaac #undef __FUNCT__ 7118a68b90caSToby Isaac #define __FUNCT__ "DMPlexCreateConstraintSection" 7119a68b90caSToby Isaac static PetscErrorCode DMPlexCreateConstraintSection(DM dm, PetscSection *cSec) 7120a68b90caSToby Isaac { 7121a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7122a68b90caSToby Isaac PetscSection section, anchorSection; 7123a68b90caSToby Isaac PetscInt pStart, pEnd, p, dof, numFields, f; 7124a68b90caSToby Isaac PetscErrorCode ierr; 7125a68b90caSToby Isaac 7126a68b90caSToby Isaac PetscFunctionBegin; 7127a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7128a68b90caSToby Isaac anchorSection = plex->anchorSection; 7129a68b90caSToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 7130a68b90caSToby Isaac ierr = PetscSectionCreate(PetscObjectComm((PetscObject)section),cSec);CHKERRQ(ierr); 7131a68b90caSToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 7132a68b90caSToby Isaac ierr = PetscSectionSetNumFields(*cSec,numFields);CHKERRQ(ierr); 7133a68b90caSToby Isaac ierr = PetscSectionGetChart(anchorSection,&pStart,&pEnd);CHKERRQ(ierr); 7134a68b90caSToby Isaac ierr = PetscSectionSetChart(*cSec,pStart,pEnd);CHKERRQ(ierr); 7135a68b90caSToby Isaac for (p = pStart; p < pEnd; p++) { 7136a68b90caSToby Isaac ierr = PetscSectionGetDof(anchorSection,p,&dof);CHKERRQ(ierr); 7137a68b90caSToby Isaac if (dof) { 7138a68b90caSToby Isaac ierr = PetscSectionGetDof(section,p,&dof);CHKERRQ(ierr); 7139a68b90caSToby Isaac ierr = PetscSectionSetDof(*cSec,p,dof);CHKERRQ(ierr); 7140a68b90caSToby Isaac for (f = 0; f < numFields; f++) { 7141a68b90caSToby Isaac ierr = PetscSectionGetFieldDof(section,p,f,&dof);CHKERRQ(ierr); 7142a68b90caSToby Isaac ierr = PetscSectionSetFieldDof(*cSec,p,f,dof);CHKERRQ(ierr); 7143a68b90caSToby Isaac } 7144a68b90caSToby Isaac } 7145a68b90caSToby Isaac } 7146a68b90caSToby Isaac ierr = PetscSectionSetUp(*cSec);CHKERRQ(ierr); 7147a68b90caSToby Isaac PetscFunctionReturn(0); 7148a68b90caSToby Isaac } 7149a68b90caSToby Isaac 7150a68b90caSToby Isaac #undef __FUNCT__ 7151a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraintSection" 7152a68b90caSToby Isaac /*@ 7153a68b90caSToby Isaac DMPlexGetConstraintSection - Get the section that maps constrained points to rows of the constraint matrix. 7154a68b90caSToby Isaac 7155a68b90caSToby Isaac The default section obtained with DMGetDefaultSection() maps points to columns of the constraint matrix. 7156a68b90caSToby Isaac 7157a68b90caSToby Isaac logically collective 7158a68b90caSToby Isaac 7159a68b90caSToby Isaac Input Parameters: 7160a68b90caSToby Isaac . dm - The DMPlex object 7161a68b90caSToby Isaac 7162a68b90caSToby Isaac Output Parameters: 7163a68b90caSToby Isaac . cSec - If not NULL, set to the section describing which points anchor the constrained points. 7164a68b90caSToby Isaac 7165a68b90caSToby Isaac 7166a68b90caSToby Isaac Level: intermediate 7167a68b90caSToby Isaac 7168a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintMatrix(), DMPlexSetConstraintMatrix() 7169a68b90caSToby Isaac @*/ 7170a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraintSection(DM dm, PetscSection *cSec) 7171a68b90caSToby Isaac { 7172a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7173a68b90caSToby Isaac PetscErrorCode ierr; 7174a68b90caSToby Isaac 7175a68b90caSToby Isaac PetscFunctionBegin; 7176a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7177a68b90caSToby Isaac if (plex->anchorSection && !plex->constraintSection) { 7178a68b90caSToby Isaac ierr = DMPlexCreateConstraintSection(dm,&plex->constraintSection);CHKERRQ(ierr); 7179a68b90caSToby Isaac } 7180a68b90caSToby Isaac if (cSec) *cSec = plex->constraintSection; 7181a68b90caSToby Isaac PetscFunctionReturn(0); 7182a68b90caSToby Isaac } 7183a68b90caSToby Isaac 7184a68b90caSToby Isaac #undef __FUNCT__ 71850ac89760SToby Isaac #define __FUNCT__ "DMPlexCreateConstraintMatrix" 71860ac89760SToby Isaac static PetscErrorCode DMPlexCreateConstraintMatrix(DM dm, Mat *cMat) 71870ac89760SToby Isaac { 71880ac89760SToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 71890ac89760SToby Isaac PetscSection section, aSec, cSec; 71900ac89760SToby Isaac PetscInt pStart, pEnd, p, dof, aDof, aOff, off, nnz, annz, m, n, q, a, offset, *i, *j; 71910ac89760SToby Isaac const PetscInt *anchors; 71920ac89760SToby Isaac PetscInt numFields, f; 71930ac89760SToby Isaac PetscErrorCode ierr; 71940ac89760SToby Isaac 71950ac89760SToby Isaac PetscFunctionBegin; 71960ac89760SToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 71970ac89760SToby Isaac ierr = DMGetDefaultSection(dm,§ion);CHKERRQ(ierr); 71980ac89760SToby Isaac ierr = DMPlexGetConstraintSection(dm, &cSec);CHKERRQ(ierr); 71990ac89760SToby Isaac ierr = PetscSectionGetStorageSize(cSec, &m);CHKERRQ(ierr); 72000ac89760SToby Isaac ierr = PetscSectionGetStorageSize(section, &n);CHKERRQ(ierr); 72010ac89760SToby Isaac ierr = MatCreate(PETSC_COMM_SELF,cMat);CHKERRQ(ierr); 72020ac89760SToby Isaac ierr = MatSetSizes(*cMat,m,n,m,n);CHKERRQ(ierr); 72030ac89760SToby Isaac ierr = MatSetType(*cMat,MATSEQAIJ); 72040ac89760SToby Isaac aSec = plex->anchorSection; 72050ac89760SToby Isaac ierr = ISGetIndices(plex->anchorIS,&anchors);CHKERRQ(ierr); 72060ac89760SToby Isaac ierr = PetscSectionGetChart(aSec,&pStart,&pEnd);CHKERRQ(ierr); 72070ac89760SToby Isaac ierr = PetscMalloc1(m+1,&i);CHKERRQ(ierr); 72080ac89760SToby Isaac i[0] = 0; 72090ac89760SToby Isaac ierr = PetscSectionGetNumFields(section,&numFields);CHKERRQ(ierr); 72100ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 72110ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&dof);CHKERRQ(ierr); 72120ac89760SToby Isaac if (!dof) continue; 72130ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&off);CHKERRQ(ierr); 72140ac89760SToby Isaac if (numFields) { 72150ac89760SToby Isaac for (f = 0; f < numFields; f++) { 72160ac89760SToby Isaac annz = 0; 72170ac89760SToby Isaac for (q = 0; q < dof; q++) { 72180ac89760SToby Isaac a = anchors[off + q]; 72190ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 72200ac89760SToby Isaac annz += aDof; 72210ac89760SToby Isaac } 72220ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 72230ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(cSec,p,f,&off);CHKERRQ(ierr); 72240ac89760SToby Isaac for (q = 0; q < dof; q++) { 72250ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 72260ac89760SToby Isaac } 72270ac89760SToby Isaac } 72280ac89760SToby Isaac } 72290ac89760SToby Isaac else { 72300ac89760SToby Isaac annz = 0; 72310ac89760SToby Isaac for (q = 0; q < dof; q++) { 72320ac89760SToby Isaac a = anchors[off + q]; 72330ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 72340ac89760SToby Isaac annz += aDof; 72350ac89760SToby Isaac } 72360ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 72370ac89760SToby Isaac ierr = PetscSectionGetOffset(cSec,p,&off);CHKERRQ(ierr); 72380ac89760SToby Isaac for (q = 0; q < dof; q++) { 72390ac89760SToby Isaac i[off + q + 1] = i[off + q] + annz; 72400ac89760SToby Isaac } 72410ac89760SToby Isaac } 72420ac89760SToby Isaac } 72430ac89760SToby Isaac nnz = i[m]; 72440ac89760SToby Isaac ierr = PetscMalloc1(nnz,&j);CHKERRQ(ierr); 72450ac89760SToby Isaac offset = 0; 72460ac89760SToby Isaac for (p = pStart; p < pEnd; p++) { 72470ac89760SToby Isaac if (numFields) { 72480ac89760SToby Isaac for (f = 0; f < numFields; f++) { 72490ac89760SToby Isaac ierr = PetscSectionGetFieldDof(cSec,p,f,&dof);CHKERRQ(ierr); 72500ac89760SToby Isaac for (q = 0; q < dof; q++) { 72510ac89760SToby Isaac PetscInt rDof, rOff, r; 72520ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 72530ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 72540ac89760SToby Isaac for (r = 0; r < rDof; r++) { 72550ac89760SToby Isaac PetscInt s; 72560ac89760SToby Isaac 72570ac89760SToby Isaac a = anchors[rOff + r]; 72580ac89760SToby Isaac 72590ac89760SToby Isaac ierr = PetscSectionGetFieldDof(section,a,f,&aDof);CHKERRQ(ierr); 72600ac89760SToby Isaac ierr = PetscSectionGetFieldOffset(section,a,f,&aOff);CHKERRQ(ierr); 72610ac89760SToby Isaac for (s = 0; s < aDof; s++) { 72620ac89760SToby Isaac j[offset++] = aOff + s; 72630ac89760SToby Isaac } 72640ac89760SToby Isaac } 72650ac89760SToby Isaac } 72660ac89760SToby Isaac } 72670ac89760SToby Isaac } 72680ac89760SToby Isaac else { 72690ac89760SToby Isaac ierr = PetscSectionGetDof(cSec,p,&dof);CHKERRQ(ierr); 72700ac89760SToby Isaac for (q = 0; q < dof; q++) { 72710ac89760SToby Isaac PetscInt rDof, rOff, r; 72720ac89760SToby Isaac ierr = PetscSectionGetDof(aSec,p,&rDof);CHKERRQ(ierr); 72730ac89760SToby Isaac ierr = PetscSectionGetOffset(aSec,p,&rOff);CHKERRQ(ierr); 72740ac89760SToby Isaac for (r = 0; r < rDof; r++) { 72750ac89760SToby Isaac PetscInt s; 72760ac89760SToby Isaac 72770ac89760SToby Isaac a = anchors[rOff + r]; 72780ac89760SToby Isaac 72790ac89760SToby Isaac ierr = PetscSectionGetDof(section,a,&aDof);CHKERRQ(ierr); 72800ac89760SToby Isaac ierr = PetscSectionGetOffset(section,a,&aOff);CHKERRQ(ierr); 72810ac89760SToby Isaac for (s = 0; s < aDof; s++) { 72820ac89760SToby Isaac j[offset++] = aOff + s; 72830ac89760SToby Isaac } 72840ac89760SToby Isaac } 72850ac89760SToby Isaac } 72860ac89760SToby Isaac } 72870ac89760SToby Isaac } 72880ac89760SToby Isaac ierr = MatSeqAIJSetPreallocationCSR(*cMat,i,j,NULL);CHKERRQ(ierr); 72890ac89760SToby Isaac ierr = PetscFree2(i,j);CHKERRQ(ierr); 72900ac89760SToby Isaac ierr = ISRestoreIndices(plex->anchorIS,&anchors);CHKERRQ(ierr); 72910ac89760SToby Isaac PetscFunctionReturn(0); 72920ac89760SToby Isaac } 72930ac89760SToby Isaac 72940ac89760SToby Isaac #undef __FUNCT__ 7295a68b90caSToby Isaac #define __FUNCT__ "DMPlexGetConstraintMatrix" 7296a68b90caSToby Isaac /*@ 7297a68b90caSToby Isaac DMPlexGetConstraintMatrix - Get the matrix that specifies the point-to-point constraints. 7298a68b90caSToby Isaac 7299a68b90caSToby Isaac logically collective 7300a68b90caSToby Isaac 7301a68b90caSToby Isaac Input Parameters: 7302a68b90caSToby Isaac . dm - The DMPlex object 7303a68b90caSToby Isaac 7304a68b90caSToby Isaac Output Parameters: 7305a68b90caSToby Isaac . cMat - If not NULL, returns the constraint matrix. If the constraint matrix has not been created before, then it is 7306a68b90caSToby Isaac created and its nonzero structure is allocated, so that the user can insert values. 7307a68b90caSToby Isaac 7308a68b90caSToby Isaac 7309a68b90caSToby Isaac Level: intermediate 7310a68b90caSToby Isaac 7311a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexSetConstraintMatrix() 7312a68b90caSToby Isaac @*/ 7313a68b90caSToby Isaac PetscErrorCode DMPlexGetConstraintMatrix(DM dm, Mat *cMat) 7314a68b90caSToby Isaac { 7315a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7316a68b90caSToby Isaac PetscErrorCode ierr; 7317a68b90caSToby Isaac 7318a68b90caSToby Isaac PetscFunctionBegin; 7319a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 73200ac89760SToby Isaac if (plex->anchorSection && !plex->constraintMat) { 73210ac89760SToby Isaac ierr = DMPlexCreateConstraintMatrix(dm,&plex->constraintMat);CHKERRQ(ierr); 73220ac89760SToby Isaac } 7323a68b90caSToby Isaac if (cMat) *cMat = plex->constraintMat; 7324a68b90caSToby Isaac PetscFunctionReturn(0); 7325a68b90caSToby Isaac } 7326a68b90caSToby Isaac 7327a68b90caSToby Isaac #undef __FUNCT__ 7328a68b90caSToby Isaac #define __FUNCT__ "DMPlexSetConstraintMatrix" 7329a68b90caSToby Isaac /*@ 7330a68b90caSToby Isaac DMPlexSetConstraintMatrix - Set the matrix that specifies the point-to-point constraints. It should have the same 7331a68b90caSToby Isaac number of rows as the layout size of the section returned by DMPlexGetConstraintSection(), and it should have the 7332a68b90caSToby Isaac same number of columns as the layout size of the section returned by DMGetDefaultSection(). For the constraint 7333a68b90caSToby Isaac matrix to be used when constructing a matrix in, e.g., DMPlexSNESComputeJacobianFEM(), then MatGetValues() must be 7334a68b90caSToby Isaac implemented. 7335a68b90caSToby Isaac 7336a68b90caSToby Isaac logically collective 7337a68b90caSToby Isaac 7338a68b90caSToby Isaac Input Parameters: 7339a68b90caSToby Isaac + dm - The DMPlex object 7340a68b90caSToby Isaac - cMat - The constraint matrix. 7341a68b90caSToby Isaac 7342a68b90caSToby Isaac The reference count of cMat is incremented. 7343a68b90caSToby Isaac 7344a68b90caSToby Isaac 7345a68b90caSToby Isaac Level: advanced. 7346a68b90caSToby Isaac 7347a68b90caSToby Isaac .seealso: DMPlexGetConstraints(), DMPlexSetConstraints(), DMPlexGetConstraintSection(), DMPlexGetConstraintMatrix() 7348a68b90caSToby Isaac @*/ 7349a68b90caSToby Isaac PetscErrorCode DMPlexSetConstraintMatrix(DM dm, Mat cMat) 7350a68b90caSToby Isaac { 7351a68b90caSToby Isaac DM_Plex *plex = (DM_Plex *)dm->data; 7352a68b90caSToby Isaac PetscErrorCode ierr; 7353a68b90caSToby Isaac 7354a68b90caSToby Isaac PetscFunctionBegin; 7355a68b90caSToby Isaac PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 7356a68b90caSToby Isaac ierr = PetscObjectReference((PetscObject)cMat);CHKERRQ(ierr); 7357a68b90caSToby Isaac ierr = MatDestroy(&plex->constraintMat);CHKERRQ(ierr); 7358a68b90caSToby Isaac plex->constraintMat = cMat; 7359a68b90caSToby Isaac PetscFunctionReturn(0); 7360a68b90caSToby Isaac } 7361*0f7c717fSToby Isaac 7362*0f7c717fSToby Isaac typedef struct _projectConstraintsCtx 7363*0f7c717fSToby Isaac { 7364*0f7c717fSToby Isaac DM dm; 7365*0f7c717fSToby Isaac Vec mask; 7366*0f7c717fSToby Isaac } 7367*0f7c717fSToby Isaac projectConstraintsCtx; 7368*0f7c717fSToby Isaac 7369*0f7c717fSToby Isaac #undef __FUNCT__ 7370*0f7c717fSToby Isaac #define __FUNCT__ "MatMult_PlexProjectConstraintsNormal" 7371*0f7c717fSToby Isaac PetscErrorCode MatMult_PlexProjectConstraintsNormal(Mat CtC, Vec x, Vec y) 7372*0f7c717fSToby Isaac { 7373*0f7c717fSToby Isaac DM dm; 7374*0f7c717fSToby Isaac Vec local, mask; 7375*0f7c717fSToby Isaac projectConstraintsCtx *ctx; 7376*0f7c717fSToby Isaac PetscErrorCode ierr; 7377*0f7c717fSToby Isaac 7378*0f7c717fSToby Isaac PetscFunctionBegin; 7379*0f7c717fSToby Isaac ierr = MatShellGetContext(CtC,&ctx);CHKERRQ(ierr); 7380*0f7c717fSToby Isaac dm = ctx->dm; 7381*0f7c717fSToby Isaac mask = ctx->mask; 7382*0f7c717fSToby Isaac ierr = DMGetLocalVector(dm,&local);CHKERRQ(ierr); 7383*0f7c717fSToby Isaac ierr = DMGlobalToLocalBegin(dm,x,INSERT_VALUES,local);CHKERRQ(ierr); 7384*0f7c717fSToby Isaac ierr = DMGlobalToLocalEnd(dm,x,INSERT_VALUES,local);CHKERRQ(ierr); 7385*0f7c717fSToby Isaac ierr = VecPointwiseMult(local,mask,local);CHKERRQ(ierr); 7386*0f7c717fSToby Isaac ierr = VecSet(y,0.);CHKERRQ(ierr); 7387*0f7c717fSToby Isaac ierr = DMLocalToGlobalBegin(dm,local,ADD_VALUES,y);CHKERRQ(ierr); 7388*0f7c717fSToby Isaac ierr = DMLocalToGlobalEnd(dm,local,ADD_VALUES,y);CHKERRQ(ierr); 7389*0f7c717fSToby Isaac ierr = DMRestoreLocalVector(dm,&local);CHKERRQ(ierr); 7390*0f7c717fSToby Isaac PetscFunctionReturn(0); 7391*0f7c717fSToby Isaac } 7392*0f7c717fSToby Isaac 7393*0f7c717fSToby Isaac #undef __FUNCT__ 7394*0f7c717fSToby Isaac #define __FUNCT__ "DMPlexProjectConstraints_Internal" 7395*0f7c717fSToby Isaac /* Solve the normal equation for the constraints: x is local and y is global */ 7396*0f7c717fSToby Isaac PetscErrorCode DMPlexProjectConstraints_Internal(DM dm, Vec x, Vec y) 7397*0f7c717fSToby Isaac { 7398*0f7c717fSToby Isaac Mat cMat, CtC; 7399*0f7c717fSToby Isaac PetscInt n, N, cStart, cEnd, c; 7400*0f7c717fSToby Isaac KSP ksp; 7401*0f7c717fSToby Isaac PC pc; 7402*0f7c717fSToby Isaac Vec global, mask; 7403*0f7c717fSToby Isaac projectConstraintsCtx ctx; 7404*0f7c717fSToby Isaac PetscErrorCode ierr; 7405*0f7c717fSToby Isaac 7406*0f7c717fSToby Isaac PetscFunctionBegin; 7407*0f7c717fSToby Isaac ierr = DMPlexGetConstraintMatrix(dm,&cMat);CHKERRQ(ierr); 7408*0f7c717fSToby Isaac if (!cMat) { 7409*0f7c717fSToby Isaac PetscFunctionReturn(0); 7410*0f7c717fSToby Isaac } 7411*0f7c717fSToby Isaac ierr = DMGetLocalVector(dm,&mask);CHKERRQ(ierr); 7412*0f7c717fSToby Isaac ierr = VecSet(mask,0.0);CHKERRQ(ierr); 7413*0f7c717fSToby Isaac ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr); 7414*0f7c717fSToby Isaac if (cEnd > cStart) { 7415*0f7c717fSToby Isaac PetscScalar *ones; 7416*0f7c717fSToby Isaac PetscInt numValues, i; 7417*0f7c717fSToby Isaac 7418*0f7c717fSToby Isaac ierr = DMPlexVecGetClosure(dm,NULL,mask,cStart,&numValues,NULL);CHKERRQ(ierr); 7419*0f7c717fSToby Isaac ierr = PetscMalloc1(numValues,&ones);CHKERRQ(ierr); 7420*0f7c717fSToby Isaac for (i = 0; i < numValues; i++) { 7421*0f7c717fSToby Isaac ones[i] = 1.; 7422*0f7c717fSToby Isaac } 7423*0f7c717fSToby Isaac for (c = cStart; c < cEnd; c++) { 7424*0f7c717fSToby Isaac ierr = DMPlexVecSetClosure(dm,NULL,mask,c,ones,INSERT_VALUES);CHKERRQ(ierr); 7425*0f7c717fSToby Isaac } 7426*0f7c717fSToby Isaac ierr = PetscFree(ones);CHKERRQ(ierr); 7427*0f7c717fSToby Isaac } 7428*0f7c717fSToby Isaac ctx.dm = dm; 7429*0f7c717fSToby Isaac ctx.mask = mask; 7430*0f7c717fSToby Isaac ierr = VecGetSize(y,&N);CHKERRQ(ierr); 7431*0f7c717fSToby Isaac ierr = VecGetLocalSize(y,&n);CHKERRQ(ierr); 7432*0f7c717fSToby Isaac ierr = MatCreate(PetscObjectComm((PetscObject)dm),&CtC);CHKERRQ(ierr); 7433*0f7c717fSToby Isaac ierr = MatSetSizes(CtC,n,n,N,N);CHKERRQ(ierr); 7434*0f7c717fSToby Isaac ierr = MatSetType(CtC,MATSHELL);CHKERRQ(ierr); 7435*0f7c717fSToby Isaac ierr = MatSetUp(CtC);CHKERRQ(ierr); 7436*0f7c717fSToby Isaac ierr = MatShellSetContext(CtC,&ctx);CHKERRQ(ierr); 7437*0f7c717fSToby Isaac ierr = MatShellSetOperation(CtC,MATOP_MULT,(void(*)(void))MatMult_PlexProjectConstraintsNormal);CHKERRQ(ierr); 7438*0f7c717fSToby Isaac ierr = KSPCreate(PetscObjectComm((PetscObject)dm),&ksp);CHKERRQ(ierr); 7439*0f7c717fSToby Isaac ierr = KSPSetOperators(ksp,CtC,CtC);CHKERRQ(ierr); 7440*0f7c717fSToby Isaac ierr = KSPSetType(ksp,KSPCG);CHKERRQ(ierr); 7441*0f7c717fSToby Isaac ierr = KSPGetPC(ksp,&pc);CHKERRQ(ierr); 7442*0f7c717fSToby Isaac ierr = PCSetType(pc,PCNONE);CHKERRQ(ierr); 7443*0f7c717fSToby Isaac ierr = KSPSetInitialGuessNonzero(ksp,PETSC_TRUE);CHKERRQ(ierr); 7444*0f7c717fSToby Isaac ierr = KSPSetUp(ksp);CHKERRQ(ierr); 7445*0f7c717fSToby Isaac ierr = DMGetGlobalVector(dm,&global);CHKERRQ(ierr); 7446*0f7c717fSToby Isaac ierr = VecSet(global,0.);CHKERRQ(ierr); 7447*0f7c717fSToby Isaac ierr = VecPointwiseMult(x,mask,x);CHKERRQ(ierr); 7448*0f7c717fSToby Isaac ierr = DMLocalToGlobalBegin(dm,x,ADD_VALUES,global);CHKERRQ(ierr); 7449*0f7c717fSToby Isaac ierr = DMLocalToGlobalEnd(dm,x,ADD_VALUES,global);CHKERRQ(ierr); 7450*0f7c717fSToby Isaac ierr = KSPSetFromOptions(ksp);CHKERRQ(ierr); 7451*0f7c717fSToby Isaac ierr = KSPSolve(ksp,global,y);CHKERRQ(ierr); 7452*0f7c717fSToby Isaac ierr = DMRestoreGlobalVector(dm,&global);CHKERRQ(ierr); 7453*0f7c717fSToby Isaac /* clean up */ 7454*0f7c717fSToby Isaac ierr = DMRestoreLocalVector(dm,&mask);CHKERRQ(ierr); 7455*0f7c717fSToby Isaac ierr = KSPDestroy(&ksp);CHKERRQ(ierr); 7456*0f7c717fSToby Isaac ierr = MatDestroy(&CtC);CHKERRQ(ierr); 7457*0f7c717fSToby Isaac PetscFunctionReturn(0); 7458*0f7c717fSToby Isaac } 7459