134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2552f7358SJed Brown #include <../src/sys/utils/hash.h> 3d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 40c312b8eSJed Brown #include <petscsf.h> 5552f7358SJed Brown 6552f7358SJed Brown /* Logging support */ 71337e6e5SMatthew 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; 8552f7358SJed Brown 95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 11552f7358SJed Brown 12552f7358SJed Brown #undef __FUNCT__ 13552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 14552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 15552f7358SJed Brown { 16552f7358SJed Brown DM dm; 17552f7358SJed Brown PetscBool isvtk; 18552f7358SJed Brown PetscErrorCode ierr; 19552f7358SJed Brown 20552f7358SJed Brown PetscFunctionBegin; 21552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 2282f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 23552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 24552f7358SJed Brown if (isvtk) { 25552f7358SJed Brown PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD; 26552f7358SJed Brown PetscSection section; 27552f7358SJed Brown PetscInt dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0; 28552f7358SJed Brown 29552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 30552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 310298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 320298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 1, &fStart, NULL);CHKERRQ(ierr); 330298fd71SBarry Smith ierr = DMPlexGetDepthStratum(dm, 0, &vStart, NULL);CHKERRQ(ierr); 34552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 35552f7358SJed Brown /* Assumes that numer of dofs per point of each stratum is constant, natural for VTK */ 36552f7358SJed Brown if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 37552f7358SJed Brown if ((fStart >= pStart) && (fStart < pEnd)) {ierr = PetscSectionGetDof(section, fStart, &fdof);CHKERRQ(ierr);} 38552f7358SJed Brown if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 39552f7358SJed Brown if (cdof && fdof && vdof) { /* Actually Q2 or some such, but visualize as Q1 */ 40552f7358SJed Brown ft = (cdof == dim) ? PETSC_VTK_POINT_VECTOR_FIELD : PETSC_VTK_POINT_FIELD; 41552f7358SJed Brown } else if (cdof && vdof) { 42ce94432eSBarry Smith SETERRQ(PetscObjectComm((PetscObject)viewer),PETSC_ERR_SUP,"No support for viewing mixed space with dofs at both vertices and cells"); 43552f7358SJed Brown } else if (cdof) { 44552f7358SJed Brown /* TODO: This assumption should be removed when there is a way of identifying whether a space is conceptually a 45552f7358SJed Brown * vector or just happens to have the same number of dofs as the dimension. */ 46552f7358SJed Brown if (cdof == dim) { 47552f7358SJed Brown ft = PETSC_VTK_CELL_VECTOR_FIELD; 48552f7358SJed Brown } else { 49552f7358SJed Brown ft = PETSC_VTK_CELL_FIELD; 50552f7358SJed Brown } 51552f7358SJed Brown } else if (vdof) { 52552f7358SJed Brown if (vdof == dim) { 53552f7358SJed Brown ft = PETSC_VTK_POINT_VECTOR_FIELD; 54552f7358SJed Brown } else { 55552f7358SJed Brown ft = PETSC_VTK_POINT_FIELD; 56552f7358SJed Brown } 5782f516ccSBarry Smith } else SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 58552f7358SJed Brown 59552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 60552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 61552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 62552f7358SJed Brown } else { 63552f7358SJed Brown PetscBool isseq; 64552f7358SJed Brown 65552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 66552f7358SJed Brown if (isseq) { 67552f7358SJed Brown ierr = VecView_Seq(v, viewer);CHKERRQ(ierr); 68552f7358SJed Brown } else { 69552f7358SJed Brown ierr = VecView_MPI(v, viewer);CHKERRQ(ierr); 70552f7358SJed Brown } 71552f7358SJed Brown } 72552f7358SJed Brown PetscFunctionReturn(0); 73552f7358SJed Brown } 74552f7358SJed Brown 75552f7358SJed Brown #undef __FUNCT__ 76552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 77552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 78552f7358SJed Brown { 79552f7358SJed Brown DM dm; 80552f7358SJed Brown PetscBool isvtk; 81552f7358SJed Brown PetscErrorCode ierr; 82552f7358SJed Brown 83552f7358SJed Brown PetscFunctionBegin; 84552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 8582f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 86552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 87552f7358SJed Brown if (isvtk) { 88552f7358SJed Brown Vec locv; 89552f7358SJed Brown const char *name; 90552f7358SJed Brown 91552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 92552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 93552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 94552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 95552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 96552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 97552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 98552f7358SJed Brown } else { 99552f7358SJed Brown PetscBool isseq; 100552f7358SJed Brown 101552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 102552f7358SJed Brown if (isseq) { 103552f7358SJed Brown ierr = VecView_Seq(v, viewer);CHKERRQ(ierr); 104552f7358SJed Brown } else { 105552f7358SJed Brown ierr = VecView_MPI(v, viewer);CHKERRQ(ierr); 106552f7358SJed Brown } 107552f7358SJed Brown } 108552f7358SJed Brown PetscFunctionReturn(0); 109552f7358SJed Brown } 110552f7358SJed Brown 111552f7358SJed Brown #undef __FUNCT__ 112552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 113552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 114552f7358SJed Brown { 115552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 116552f7358SJed Brown DM cdm; 117552f7358SJed Brown DMLabel markers; 118552f7358SJed Brown PetscSection coordSection; 119552f7358SJed Brown Vec coordinates; 120552f7358SJed Brown PetscViewerFormat format; 121552f7358SJed Brown PetscErrorCode ierr; 122552f7358SJed Brown 123552f7358SJed Brown PetscFunctionBegin; 124552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 125552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 126552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 127552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 128552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 129552f7358SJed Brown const char *name; 130552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 131552f7358SJed Brown PetscInt pStart, pEnd, p; 132552f7358SJed Brown PetscMPIInt rank, size; 133552f7358SJed Brown 13482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 13582f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 136552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 137552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 138552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 139552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 140552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 141552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 142552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 143552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 144552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 145552f7358SJed Brown PetscInt dof, off, s; 146552f7358SJed Brown 147552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 148552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 149552f7358SJed Brown for (s = off; s < off+dof; ++s) { 150552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 151552f7358SJed Brown } 152552f7358SJed Brown } 153552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 154552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 155552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 156552f7358SJed Brown PetscInt dof, off, c; 157552f7358SJed Brown 158552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 159552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 160552f7358SJed Brown for (c = off; c < off+dof; ++c) { 161552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 162552f7358SJed Brown } 163552f7358SJed Brown } 164552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 1650298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 166552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 167552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 168552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 169552f7358SJed Brown if (size > 1) { 170552f7358SJed Brown PetscSF sf; 171552f7358SJed Brown 172552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 173552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 174552f7358SJed Brown } 175552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 176552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 177552f7358SJed Brown const char *name; 178552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 179552f7358SJed Brown const int numColors = 3; 180552f7358SJed Brown PetscReal scale = 2.0; 181552f7358SJed Brown PetscScalar *coords; 182552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 183552f7358SJed Brown PetscMPIInt rank, size; 184552f7358SJed Brown 185552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18682f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 18782f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 188552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 189552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 190770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 191770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 192552f7358SJed Brown \\usepackage{tikz}\n\ 193552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 194552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 195552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 196552f7358SJed Brown \\begin{document}\n\ 197552f7358SJed Brown \\section{%s}\n\ 198770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 199770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 200770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 201770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 202770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 203770b213bSMatthew G Knepley } else if (p > 0) { 204770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 205770b213bSMatthew G Knepley } 206770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 207770b213bSMatthew G Knepley } 208770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 209770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 210552f7358SJed Brown /* Plot vertices */ 211552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 212552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 213552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 214552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 215552f7358SJed Brown PetscInt off, dof, d; 216552f7358SJed Brown 217552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 220552f7358SJed Brown for (d = 0; d < dof; ++d) { 221552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2226712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 223552f7358SJed Brown } 224552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 225552f7358SJed Brown } 226552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 228552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 229552f7358SJed Brown /* Plot edges */ 230552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 231552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 232552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 233552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 234552f7358SJed Brown const PetscInt *cone; 235552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 236552f7358SJed Brown 237552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 23882f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 239552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 240552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 241552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 242552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 243552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 244552f7358SJed Brown for (d = 0; d < dof; ++d) { 245552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2466712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 247552f7358SJed Brown } 248552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 249552f7358SJed Brown } 250552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 251552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 253552f7358SJed Brown /* Plot cells */ 254552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 255552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2560298fd71SBarry Smith PetscInt *closure = NULL; 257552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 258552f7358SJed Brown 259552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 260552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 261552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 262552f7358SJed Brown const PetscInt point = closure[p]; 263552f7358SJed Brown 264552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 265552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 266552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 267552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 268552f7358SJed Brown } 269552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 270552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 271552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 272552f7358SJed Brown } 273552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 274552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 275770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 276552f7358SJed Brown } else { 27782f516ccSBarry Smith MPI_Comm comm; 278834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 279834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 280552f7358SJed Brown PetscInt pStart, pEnd, p; 281a57dd577SMatthew G Knepley PetscInt numLabels, l; 2821143a3c0SMatthew G. Knepley const char *name; 283552f7358SJed Brown PetscMPIInt size; 284552f7358SJed Brown 28582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 286552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 287552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2885f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 2891143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 2901143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 291552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 292552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 293834065abSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 294dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 295552f7358SJed Brown if (depth == 1) { 296552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 297552f7358SJed Brown pEnd = pEnd - pStart; 298552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 299552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 300552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 301552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 302552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 303552f7358SJed Brown pEnd = pEnd - pStart; 304552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 305552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 306552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 307552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 308552f7358SJed Brown } else { 309552f7358SJed Brown for (d = 0; d <= dim; d++) { 310552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 311834065abSMatthew G. Knepley pEnd -= pStart; 312834065abSMatthew G. Knepley pMax[d] -= pStart; 313552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 314834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 315552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 316834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 317834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 318834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 319834065abSMatthew G. Knepley } 320552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 321552f7358SJed Brown } 322552f7358SJed Brown } 323834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 324a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 325a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 326a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 327a57dd577SMatthew G Knepley DMLabel label; 328a57dd577SMatthew G Knepley const char *name; 329a57dd577SMatthew G Knepley IS valueIS; 330a57dd577SMatthew G Knepley const PetscInt *values; 331a57dd577SMatthew G Knepley PetscInt numValues, v; 332a57dd577SMatthew G Knepley 333a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 334a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 335a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 336a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 337a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 338a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 339a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 340a57dd577SMatthew G Knepley PetscInt size; 341a57dd577SMatthew G Knepley 342a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 343a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 344a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 345a57dd577SMatthew G Knepley } 346a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 347a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 3484d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 349a57dd577SMatthew G Knepley } 350552f7358SJed Brown } 351552f7358SJed Brown PetscFunctionReturn(0); 352552f7358SJed Brown } 353552f7358SJed Brown 354552f7358SJed Brown #undef __FUNCT__ 355552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 356552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 357552f7358SJed Brown { 358552f7358SJed Brown PetscBool iascii, isbinary; 359552f7358SJed Brown PetscErrorCode ierr; 360552f7358SJed Brown 361552f7358SJed Brown PetscFunctionBegin; 362552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 363552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 364552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 365552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 366552f7358SJed Brown if (iascii) { 367552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 368552f7358SJed Brown #if 0 369552f7358SJed Brown } else if (isbinary) { 370552f7358SJed Brown ierr = DMPlexView_Binary(dm, viewer);CHKERRQ(ierr); 371552f7358SJed Brown #endif 37211aeaf0aSBarry Smith } 373552f7358SJed Brown PetscFunctionReturn(0); 374552f7358SJed Brown } 375552f7358SJed Brown 376552f7358SJed Brown #undef __FUNCT__ 3776c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 3786c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 3796c73c22cSMatthew G. Knepley { 3806c73c22cSMatthew G. Knepley DMBoundary b, next; 3816c73c22cSMatthew G. Knepley PetscErrorCode ierr; 3826c73c22cSMatthew G. Knepley 3836c73c22cSMatthew G. Knepley PetscFunctionBeginUser; 3846c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 3856c73c22cSMatthew G. Knepley b = *boundary; 3866c73c22cSMatthew G. Knepley *boundary = NULL; 3876c73c22cSMatthew G. Knepley for (; b; b = next) { 3886c73c22cSMatthew G. Knepley next = b->next; 3896c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 3906c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 3916c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 3926c73c22cSMatthew G. Knepley } 3936c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 3946c73c22cSMatthew G. Knepley } 3956c73c22cSMatthew G. Knepley 3966c73c22cSMatthew G. Knepley #undef __FUNCT__ 397552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 398552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 399552f7358SJed Brown { 400552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 401552f7358SJed Brown DMLabel next = mesh->labels; 402552f7358SJed Brown PetscErrorCode ierr; 403552f7358SJed Brown 404552f7358SJed Brown PetscFunctionBegin; 4050d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 406552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 407552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 408552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 409552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 410552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 411552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 412552f7358SJed Brown while (next) { 413552f7358SJed Brown DMLabel tmp = next->next; 414552f7358SJed Brown 415552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 416552f7358SJed Brown next = tmp; 417552f7358SJed Brown } 4183913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 419a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 420552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 421552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 4226c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 423552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 424552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 425552f7358SJed Brown PetscFunctionReturn(0); 426552f7358SJed Brown } 427552f7358SJed Brown 428552f7358SJed Brown #undef __FUNCT__ 429552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 430b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 431552f7358SJed Brown { 432552f7358SJed Brown PetscSection section, sectionGlobal; 433552f7358SJed Brown PetscInt bs = -1; 434552f7358SJed Brown PetscInt localSize; 43589545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 436552f7358SJed Brown PetscErrorCode ierr; 437b412c318SBarry Smith MatType mtype; 438552f7358SJed Brown 439552f7358SJed Brown PetscFunctionBegin; 440607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 441b412c318SBarry Smith mtype = dm->mattype; 442552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 443552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 444552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 445552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 44682f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 447552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 448552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 449552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 450552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 451552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 452552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 453552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 454552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 455552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 456552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 457552f7358SJed Brown if (!isShell) { 458552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 4592a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 460552f7358SJed Brown 461552f7358SJed Brown if (bs < 0) { 462552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 463fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 464552f7358SJed Brown 465552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 466552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 467552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 468fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 469fad22124SMatthew G Knepley if (dof-cdof) { 4702a28c762SMatthew G Knepley if (bs < 0) { 471fad22124SMatthew G Knepley bs = dof-cdof; 472fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 4732a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 4742a28c762SMatthew G Knepley bs = 1; 475552f7358SJed Brown break; 476552f7358SJed Brown } 477552f7358SJed Brown } 4782a28c762SMatthew G Knepley } 4792a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 4802a28c762SMatthew G Knepley bsLocal = bs; 48182f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4822a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 48382f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4842a28c762SMatthew G Knepley if (bsMin != bsMax) { 4852a28c762SMatthew G Knepley bs = 1; 4862a28c762SMatthew G Knepley } else { 4872a28c762SMatthew G Knepley bs = bsMax; 4882a28c762SMatthew G Knepley } 489552f7358SJed Brown } else { 490552f7358SJed Brown bs = 1; 491552f7358SJed Brown } 492552f7358SJed Brown } 4931795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 494552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 495552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 496552f7358SJed Brown } 497552f7358SJed Brown PetscFunctionReturn(0); 498552f7358SJed Brown } 499552f7358SJed Brown 500552f7358SJed Brown #undef __FUNCT__ 501552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 502552f7358SJed Brown /*@ 503552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 504552f7358SJed Brown 505552f7358SJed Brown Not collective 506552f7358SJed Brown 507552f7358SJed Brown Input Parameter: 508552f7358SJed Brown . mesh - The DMPlex 509552f7358SJed Brown 510552f7358SJed Brown Output Parameter: 511552f7358SJed Brown . dim - The topological mesh dimension 512552f7358SJed Brown 513552f7358SJed Brown Level: beginner 514552f7358SJed Brown 515552f7358SJed Brown .seealso: DMPlexCreate() 516552f7358SJed Brown @*/ 517552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 518552f7358SJed Brown { 519552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 520552f7358SJed Brown 521552f7358SJed Brown PetscFunctionBegin; 522552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 523552f7358SJed Brown PetscValidPointer(dim, 2); 524552f7358SJed Brown *dim = mesh->dim; 525552f7358SJed Brown PetscFunctionReturn(0); 526552f7358SJed Brown } 527552f7358SJed Brown 528552f7358SJed Brown #undef __FUNCT__ 529552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 530552f7358SJed Brown /*@ 531552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 532552f7358SJed Brown 533552f7358SJed Brown Collective on mesh 534552f7358SJed Brown 535552f7358SJed Brown Input Parameters: 536552f7358SJed Brown + mesh - The DMPlex 537552f7358SJed Brown - dim - The topological mesh dimension 538552f7358SJed Brown 539552f7358SJed Brown Level: beginner 540552f7358SJed Brown 541552f7358SJed Brown .seealso: DMPlexCreate() 542552f7358SJed Brown @*/ 543552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 544552f7358SJed Brown { 545552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 546552f7358SJed Brown 547552f7358SJed Brown PetscFunctionBegin; 548552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 549552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 550552f7358SJed Brown mesh->dim = dim; 551552f7358SJed Brown mesh->preallocCenterDim = dim; 552552f7358SJed Brown PetscFunctionReturn(0); 553552f7358SJed Brown } 554552f7358SJed Brown 555552f7358SJed Brown #undef __FUNCT__ 556552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 557552f7358SJed Brown /*@ 558552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 559552f7358SJed Brown 560552f7358SJed Brown Not collective 561552f7358SJed Brown 562552f7358SJed Brown Input Parameter: 563552f7358SJed Brown . mesh - The DMPlex 564552f7358SJed Brown 565552f7358SJed Brown Output Parameters: 566552f7358SJed Brown + pStart - The first mesh point 567552f7358SJed Brown - pEnd - The upper bound for mesh points 568552f7358SJed Brown 569552f7358SJed Brown Level: beginner 570552f7358SJed Brown 571552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 572552f7358SJed Brown @*/ 573552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 574552f7358SJed Brown { 575552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 576552f7358SJed Brown PetscErrorCode ierr; 577552f7358SJed Brown 578552f7358SJed Brown PetscFunctionBegin; 579552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 580552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 581552f7358SJed Brown PetscFunctionReturn(0); 582552f7358SJed Brown } 583552f7358SJed Brown 584552f7358SJed Brown #undef __FUNCT__ 585552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 586552f7358SJed Brown /*@ 587552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 588552f7358SJed Brown 589552f7358SJed Brown Not collective 590552f7358SJed Brown 591552f7358SJed Brown Input Parameters: 592552f7358SJed Brown + mesh - The DMPlex 593552f7358SJed Brown . pStart - The first mesh point 594552f7358SJed Brown - pEnd - The upper bound for mesh points 595552f7358SJed Brown 596552f7358SJed Brown Output Parameters: 597552f7358SJed Brown 598552f7358SJed Brown Level: beginner 599552f7358SJed Brown 600552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 601552f7358SJed Brown @*/ 602552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 603552f7358SJed Brown { 604552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 605552f7358SJed Brown PetscErrorCode ierr; 606552f7358SJed Brown 607552f7358SJed Brown PetscFunctionBegin; 608552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 609552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 610552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 611552f7358SJed Brown PetscFunctionReturn(0); 612552f7358SJed Brown } 613552f7358SJed Brown 614552f7358SJed Brown #undef __FUNCT__ 615552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 616552f7358SJed Brown /*@ 617552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 618552f7358SJed Brown 619552f7358SJed Brown Not collective 620552f7358SJed Brown 621552f7358SJed Brown Input Parameters: 622552f7358SJed Brown + mesh - The DMPlex 623552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 624552f7358SJed Brown 625552f7358SJed Brown Output Parameter: 626552f7358SJed Brown . size - The cone size for point p 627552f7358SJed Brown 628552f7358SJed Brown Level: beginner 629552f7358SJed Brown 630552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 631552f7358SJed Brown @*/ 632552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 633552f7358SJed Brown { 634552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 635552f7358SJed Brown PetscErrorCode ierr; 636552f7358SJed Brown 637552f7358SJed Brown PetscFunctionBegin; 638552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 639552f7358SJed Brown PetscValidPointer(size, 3); 640552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 641552f7358SJed Brown PetscFunctionReturn(0); 642552f7358SJed Brown } 643552f7358SJed Brown 644552f7358SJed Brown #undef __FUNCT__ 645552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 646552f7358SJed Brown /*@ 647552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 648552f7358SJed Brown 649552f7358SJed Brown Not collective 650552f7358SJed Brown 651552f7358SJed Brown Input Parameters: 652552f7358SJed Brown + mesh - The DMPlex 653552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 654552f7358SJed Brown - size - The cone size for point p 655552f7358SJed Brown 656552f7358SJed Brown Output Parameter: 657552f7358SJed Brown 658552f7358SJed Brown Note: 659552f7358SJed Brown This should be called after DMPlexSetChart(). 660552f7358SJed Brown 661552f7358SJed Brown Level: beginner 662552f7358SJed Brown 663552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 664552f7358SJed Brown @*/ 665552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 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 = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 6730d644c17SKarl Rupp 674552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 675552f7358SJed Brown PetscFunctionReturn(0); 676552f7358SJed Brown } 677552f7358SJed Brown 678552f7358SJed Brown #undef __FUNCT__ 679552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 680552f7358SJed Brown /*@C 681552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 682552f7358SJed Brown 683552f7358SJed Brown Not collective 684552f7358SJed Brown 685552f7358SJed Brown Input Parameters: 686552f7358SJed Brown + mesh - The DMPlex 687552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 688552f7358SJed Brown 689552f7358SJed Brown Output Parameter: 690552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 691552f7358SJed Brown 692552f7358SJed Brown Level: beginner 693552f7358SJed Brown 6943813dfbdSMatthew G Knepley Fortran Notes: 6953813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 6963813dfbdSMatthew G Knepley include petsc.h90 in your code. 6973813dfbdSMatthew G Knepley 6983813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 699552f7358SJed Brown 700552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 701552f7358SJed Brown @*/ 702552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 703552f7358SJed Brown { 704552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 705552f7358SJed Brown PetscInt off; 706552f7358SJed Brown PetscErrorCode ierr; 707552f7358SJed Brown 708552f7358SJed Brown PetscFunctionBegin; 709552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 710552f7358SJed Brown PetscValidPointer(cone, 3); 711552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 712552f7358SJed Brown *cone = &mesh->cones[off]; 713552f7358SJed Brown PetscFunctionReturn(0); 714552f7358SJed Brown } 715552f7358SJed Brown 716552f7358SJed Brown #undef __FUNCT__ 717552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 718552f7358SJed Brown /*@ 719552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 720552f7358SJed Brown 721552f7358SJed Brown Not collective 722552f7358SJed Brown 723552f7358SJed Brown Input Parameters: 724552f7358SJed Brown + mesh - The DMPlex 725552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 726552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 727552f7358SJed Brown 728552f7358SJed Brown Output Parameter: 729552f7358SJed Brown 730552f7358SJed Brown Note: 731552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 732552f7358SJed Brown 733552f7358SJed Brown Level: beginner 734552f7358SJed Brown 735552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 736552f7358SJed Brown @*/ 737552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 738552f7358SJed Brown { 739552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 740552f7358SJed Brown PetscInt pStart, pEnd; 741552f7358SJed Brown PetscInt dof, off, c; 742552f7358SJed Brown PetscErrorCode ierr; 743552f7358SJed Brown 744552f7358SJed Brown PetscFunctionBegin; 745552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 746552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 747552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 748552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 749552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 75082f516ccSBarry 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); 751552f7358SJed Brown for (c = 0; c < dof; ++c) { 75282f516ccSBarry 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); 753552f7358SJed Brown mesh->cones[off+c] = cone[c]; 754552f7358SJed Brown } 755552f7358SJed Brown PetscFunctionReturn(0); 756552f7358SJed Brown } 757552f7358SJed Brown 758552f7358SJed Brown #undef __FUNCT__ 759552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 760552f7358SJed Brown /*@C 761552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 762552f7358SJed Brown 763552f7358SJed Brown Not collective 764552f7358SJed Brown 765552f7358SJed Brown Input Parameters: 766552f7358SJed Brown + mesh - The DMPlex 767552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 768552f7358SJed Brown 769552f7358SJed Brown Output Parameter: 770552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 771552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 772552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 773552f7358SJed Brown the index of the cone point on which to start. 774552f7358SJed Brown 775552f7358SJed Brown Level: beginner 776552f7358SJed Brown 7773813dfbdSMatthew G Knepley Fortran Notes: 7783813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7793813dfbdSMatthew G Knepley include petsc.h90 in your code. 7803813dfbdSMatthew G Knepley 7813813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 782552f7358SJed Brown 783552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 784552f7358SJed Brown @*/ 785552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 786552f7358SJed Brown { 787552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 788552f7358SJed Brown PetscInt off; 789552f7358SJed Brown PetscErrorCode ierr; 790552f7358SJed Brown 791552f7358SJed Brown PetscFunctionBegin; 792552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 793552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 794552f7358SJed Brown { 795552f7358SJed Brown PetscInt dof; 796552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 797552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 798552f7358SJed Brown } 799552f7358SJed Brown #endif 800552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8010d644c17SKarl Rupp 802552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 803552f7358SJed Brown PetscFunctionReturn(0); 804552f7358SJed Brown } 805552f7358SJed Brown 806552f7358SJed Brown #undef __FUNCT__ 807552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 808552f7358SJed Brown /*@ 809552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 810552f7358SJed Brown 811552f7358SJed Brown Not collective 812552f7358SJed Brown 813552f7358SJed Brown Input Parameters: 814552f7358SJed Brown + mesh - The DMPlex 815552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 816552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 817552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 818552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 819552f7358SJed Brown the index of the cone point on which to start. 820552f7358SJed Brown 821552f7358SJed Brown Output Parameter: 822552f7358SJed Brown 823552f7358SJed Brown Note: 824552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 825552f7358SJed Brown 826552f7358SJed Brown Level: beginner 827552f7358SJed Brown 828552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 829552f7358SJed Brown @*/ 830552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 831552f7358SJed Brown { 832552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 833552f7358SJed Brown PetscInt pStart, pEnd; 834552f7358SJed Brown PetscInt dof, off, c; 835552f7358SJed Brown PetscErrorCode ierr; 836552f7358SJed Brown 837552f7358SJed Brown PetscFunctionBegin; 838552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 839552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 840552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 841552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 842552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84382f516ccSBarry 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); 844552f7358SJed Brown for (c = 0; c < dof; ++c) { 845552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 846552f7358SJed Brown 847552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 84882f516ccSBarry 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); 849552f7358SJed Brown mesh->coneOrientations[off+c] = o; 850552f7358SJed Brown } 851552f7358SJed Brown PetscFunctionReturn(0); 852552f7358SJed Brown } 853552f7358SJed Brown 854552f7358SJed Brown #undef __FUNCT__ 855552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 856552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 857552f7358SJed Brown { 858552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 859552f7358SJed Brown PetscInt pStart, pEnd; 860552f7358SJed Brown PetscInt dof, off; 861552f7358SJed Brown PetscErrorCode ierr; 862552f7358SJed Brown 863552f7358SJed Brown PetscFunctionBegin; 864552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 865552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 86682f516ccSBarry 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); 86782f516ccSBarry 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); 86877c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 86977c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 87077c88f5bSMatthew 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); 871552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 872552f7358SJed Brown PetscFunctionReturn(0); 873552f7358SJed Brown } 874552f7358SJed Brown 875552f7358SJed Brown #undef __FUNCT__ 87677c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 87777c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 87877c88f5bSMatthew G Knepley { 87977c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 88077c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 88177c88f5bSMatthew G Knepley PetscInt dof, off; 88277c88f5bSMatthew G Knepley PetscErrorCode ierr; 88377c88f5bSMatthew G Knepley 88477c88f5bSMatthew G Knepley PetscFunctionBegin; 88577c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 88677c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 88777c88f5bSMatthew 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); 88877c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 88977c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 89077c88f5bSMatthew 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); 89177c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 89277c88f5bSMatthew G Knepley PetscFunctionReturn(0); 89377c88f5bSMatthew G Knepley } 89477c88f5bSMatthew G Knepley 89577c88f5bSMatthew G Knepley #undef __FUNCT__ 896552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 897552f7358SJed Brown /*@ 898552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 899552f7358SJed Brown 900552f7358SJed Brown Not collective 901552f7358SJed Brown 902552f7358SJed Brown Input Parameters: 903552f7358SJed Brown + mesh - The DMPlex 904552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 905552f7358SJed Brown 906552f7358SJed Brown Output Parameter: 907552f7358SJed Brown . size - The support size for point p 908552f7358SJed Brown 909552f7358SJed Brown Level: beginner 910552f7358SJed Brown 911552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 912552f7358SJed Brown @*/ 913552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 914552f7358SJed Brown { 915552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 916552f7358SJed Brown PetscErrorCode ierr; 917552f7358SJed Brown 918552f7358SJed Brown PetscFunctionBegin; 919552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 920552f7358SJed Brown PetscValidPointer(size, 3); 921552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 922552f7358SJed Brown PetscFunctionReturn(0); 923552f7358SJed Brown } 924552f7358SJed Brown 925552f7358SJed Brown #undef __FUNCT__ 926552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 927552f7358SJed Brown /*@ 928552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 929552f7358SJed Brown 930552f7358SJed Brown Not collective 931552f7358SJed Brown 932552f7358SJed Brown Input Parameters: 933552f7358SJed Brown + mesh - The DMPlex 934552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 935552f7358SJed Brown - size - The support size for point p 936552f7358SJed Brown 937552f7358SJed Brown Output Parameter: 938552f7358SJed Brown 939552f7358SJed Brown Note: 940552f7358SJed Brown This should be called after DMPlexSetChart(). 941552f7358SJed Brown 942552f7358SJed Brown Level: beginner 943552f7358SJed Brown 944552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 945552f7358SJed Brown @*/ 946552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 947552f7358SJed Brown { 948552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 949552f7358SJed Brown PetscErrorCode ierr; 950552f7358SJed Brown 951552f7358SJed Brown PetscFunctionBegin; 952552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 953552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 9540d644c17SKarl Rupp 955552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 956552f7358SJed Brown PetscFunctionReturn(0); 957552f7358SJed Brown } 958552f7358SJed Brown 959552f7358SJed Brown #undef __FUNCT__ 960552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 961552f7358SJed Brown /*@C 962552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 963552f7358SJed Brown 964552f7358SJed Brown Not collective 965552f7358SJed Brown 966552f7358SJed Brown Input Parameters: 967552f7358SJed Brown + mesh - The DMPlex 968552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 969552f7358SJed Brown 970552f7358SJed Brown Output Parameter: 971552f7358SJed Brown . support - An array of points which are on the out-edges for point p 972552f7358SJed Brown 973552f7358SJed Brown Level: beginner 974552f7358SJed Brown 9753813dfbdSMatthew G Knepley Fortran Notes: 9763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9773813dfbdSMatthew G Knepley include petsc.h90 in your code. 9783813dfbdSMatthew G Knepley 9793813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 9803813dfbdSMatthew G Knepley 981552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 982552f7358SJed Brown @*/ 983552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 984552f7358SJed Brown { 985552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 986552f7358SJed Brown PetscInt off; 987552f7358SJed Brown PetscErrorCode ierr; 988552f7358SJed Brown 989552f7358SJed Brown PetscFunctionBegin; 990552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 991552f7358SJed Brown PetscValidPointer(support, 3); 992552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 993552f7358SJed Brown *support = &mesh->supports[off]; 994552f7358SJed Brown PetscFunctionReturn(0); 995552f7358SJed Brown } 996552f7358SJed Brown 997552f7358SJed Brown #undef __FUNCT__ 998552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 999552f7358SJed Brown /*@ 1000552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1001552f7358SJed Brown 1002552f7358SJed Brown Not collective 1003552f7358SJed Brown 1004552f7358SJed Brown Input Parameters: 1005552f7358SJed Brown + mesh - The DMPlex 1006552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1007552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1008552f7358SJed Brown 1009552f7358SJed Brown Output Parameter: 1010552f7358SJed Brown 1011552f7358SJed Brown Note: 1012552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1013552f7358SJed Brown 1014552f7358SJed Brown Level: beginner 1015552f7358SJed Brown 1016552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1017552f7358SJed Brown @*/ 1018552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1019552f7358SJed Brown { 1020552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1021552f7358SJed Brown PetscInt pStart, pEnd; 1022552f7358SJed Brown PetscInt dof, off, c; 1023552f7358SJed Brown PetscErrorCode ierr; 1024552f7358SJed Brown 1025552f7358SJed Brown PetscFunctionBegin; 1026552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1027552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1028552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1029552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1030552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 103182f516ccSBarry 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); 1032552f7358SJed Brown for (c = 0; c < dof; ++c) { 103382f516ccSBarry 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); 1034552f7358SJed Brown mesh->supports[off+c] = support[c]; 1035552f7358SJed Brown } 1036552f7358SJed Brown PetscFunctionReturn(0); 1037552f7358SJed Brown } 1038552f7358SJed Brown 1039552f7358SJed Brown #undef __FUNCT__ 1040552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1041552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1042552f7358SJed Brown { 1043552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1044552f7358SJed Brown PetscInt pStart, pEnd; 1045552f7358SJed Brown PetscInt dof, off; 1046552f7358SJed Brown PetscErrorCode ierr; 1047552f7358SJed Brown 1048552f7358SJed Brown PetscFunctionBegin; 1049552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1050552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1051552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1052552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 105382f516ccSBarry 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); 105482f516ccSBarry 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); 105582f516ccSBarry 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); 1056552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1057552f7358SJed Brown PetscFunctionReturn(0); 1058552f7358SJed Brown } 1059552f7358SJed Brown 1060552f7358SJed Brown #undef __FUNCT__ 1061552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1062552f7358SJed Brown /*@C 1063552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1064552f7358SJed Brown 1065552f7358SJed Brown Not collective 1066552f7358SJed Brown 1067552f7358SJed Brown Input Parameters: 1068552f7358SJed Brown + mesh - The DMPlex 1069552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1070552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 10710298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1072552f7358SJed Brown 1073552f7358SJed Brown Output Parameters: 1074552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1075552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1076552f7358SJed Brown 1077552f7358SJed Brown Note: 10780298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1079552f7358SJed Brown 10803813dfbdSMatthew G Knepley Fortran Notes: 10813813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10823813dfbdSMatthew G Knepley include petsc.h90 in your code. 10833813dfbdSMatthew G Knepley 10843813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 10853813dfbdSMatthew G Knepley 1086552f7358SJed Brown Level: beginner 1087552f7358SJed Brown 1088552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1089552f7358SJed Brown @*/ 1090552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1091552f7358SJed Brown { 1092552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1093552f7358SJed Brown PetscInt *closure, *fifo; 10940298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1095552f7358SJed Brown PetscInt tmpSize, t; 1096552f7358SJed Brown PetscInt depth = 0, maxSize; 1097552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1098552f7358SJed Brown PetscErrorCode ierr; 1099552f7358SJed Brown 1100552f7358SJed Brown PetscFunctionBegin; 1101552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1102552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1103552f7358SJed Brown /* This is only 1-level */ 1104552f7358SJed Brown if (useCone) { 1105552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1106552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1107552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1108552f7358SJed Brown } else { 1109552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1110552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1111552f7358SJed Brown } 1112bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1113bfbcdd7aSMatthew G. Knepley if (*points) { 1114bfbcdd7aSMatthew G. Knepley closure = *points; 1115bfbcdd7aSMatthew G. Knepley } else { 1116bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1117bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1118bfbcdd7aSMatthew G. Knepley } 1119bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1120bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1121bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1122bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1123bfbcdd7aSMatthew G. Knepley } 1124bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1125bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1126bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1127bfbcdd7aSMatthew G. Knepley } 1128bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1129bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1130bfbcdd7aSMatthew G. Knepley if (*points) { 1131bfbcdd7aSMatthew G. Knepley closure = *points; 1132bfbcdd7aSMatthew G. Knepley } else { 1133bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1134bfbcdd7aSMatthew G. Knepley } 1135bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1136552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1137552f7358SJed Brown const PetscInt cp = tmp[t]; 1138552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1139552f7358SJed Brown 1140552f7358SJed Brown closure[closureSize] = cp; 1141552f7358SJed Brown closure[closureSize+1] = co; 1142552f7358SJed Brown fifo[fifoSize] = cp; 1143552f7358SJed Brown fifo[fifoSize+1] = co; 1144552f7358SJed Brown } 1145bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1146552f7358SJed Brown while (fifoSize - fifoStart) { 1147552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1148552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1149552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1150552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1151552f7358SJed Brown 1152552f7358SJed Brown if (useCone) { 1153552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1154552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1155552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1156552f7358SJed Brown } else { 1157552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1158552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 11590298fd71SBarry Smith tmpO = NULL; 1160552f7358SJed Brown } 1161552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1162552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1163552f7358SJed Brown const PetscInt cp = tmp[i]; 11642e1b13c2SMatthew 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. */ 11652e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 11662e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 11672e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1168552f7358SJed Brown PetscInt c; 1169552f7358SJed Brown 11702e1b13c2SMatthew G. Knepley if (rev) { 11712e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 11722e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 11732e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 11742e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 11752e1b13c2SMatthew G. Knepley } 1176552f7358SJed Brown /* Check for duplicate */ 1177552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1178552f7358SJed Brown if (closure[c] == cp) break; 1179552f7358SJed Brown } 1180552f7358SJed Brown if (c == closureSize) { 1181552f7358SJed Brown closure[closureSize] = cp; 1182552f7358SJed Brown closure[closureSize+1] = co; 1183552f7358SJed Brown fifo[fifoSize] = cp; 1184552f7358SJed Brown fifo[fifoSize+1] = co; 1185552f7358SJed Brown closureSize += 2; 1186552f7358SJed Brown fifoSize += 2; 1187552f7358SJed Brown } 1188552f7358SJed Brown } 1189552f7358SJed Brown fifoStart += 2; 1190552f7358SJed Brown } 1191552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1192552f7358SJed Brown if (points) *points = closure; 1193552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1194552f7358SJed Brown PetscFunctionReturn(0); 1195552f7358SJed Brown } 1196552f7358SJed Brown 1197552f7358SJed Brown #undef __FUNCT__ 11989bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 11999bf0dad6SMatthew G. Knepley /*@C 12009bf0dad6SMatthew 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 12019bf0dad6SMatthew G. Knepley 12029bf0dad6SMatthew G. Knepley Not collective 12039bf0dad6SMatthew G. Knepley 12049bf0dad6SMatthew G. Knepley Input Parameters: 12059bf0dad6SMatthew G. Knepley + mesh - The DMPlex 12069bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 12079bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 12089bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12099bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 12109bf0dad6SMatthew G. Knepley 12119bf0dad6SMatthew G. Knepley Output Parameters: 12129bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 12139bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 12149bf0dad6SMatthew G. Knepley 12159bf0dad6SMatthew G. Knepley Note: 12169bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 12179bf0dad6SMatthew G. Knepley 12189bf0dad6SMatthew G. Knepley Fortran Notes: 12199bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12209bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 12219bf0dad6SMatthew G. Knepley 12229bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12239bf0dad6SMatthew G. Knepley 12249bf0dad6SMatthew G. Knepley Level: beginner 12259bf0dad6SMatthew G. Knepley 12269bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 12279bf0dad6SMatthew G. Knepley @*/ 12289bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 12299bf0dad6SMatthew G. Knepley { 12309bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 12319bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 12329bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 12339bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 12349bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 12359bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 12369bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 12379bf0dad6SMatthew G. Knepley 12389bf0dad6SMatthew G. Knepley PetscFunctionBegin; 12399bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 12409bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 12419bf0dad6SMatthew G. Knepley /* This is only 1-level */ 12429bf0dad6SMatthew G. Knepley if (useCone) { 12439bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 12449bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 12459bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 12469bf0dad6SMatthew G. Knepley } else { 12479bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 12489bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 12499bf0dad6SMatthew G. Knepley } 12509bf0dad6SMatthew G. Knepley if (depth == 1) { 12519bf0dad6SMatthew G. Knepley if (*points) { 12529bf0dad6SMatthew G. Knepley closure = *points; 12539bf0dad6SMatthew G. Knepley } else { 12549bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 12559bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12569bf0dad6SMatthew G. Knepley } 12579bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12589bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 12599bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12609bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 12619bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 12629bf0dad6SMatthew G. Knepley } 12639bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 12649bf0dad6SMatthew G. Knepley if (points) *points = closure; 12659bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 12669bf0dad6SMatthew G. Knepley } 12679bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 12689bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 12699bf0dad6SMatthew G. Knepley if (*points) { 12709bf0dad6SMatthew G. Knepley closure = *points; 12719bf0dad6SMatthew G. Knepley } else { 12729bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12739bf0dad6SMatthew G. Knepley } 12749bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12759bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 12769bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12779bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 12789bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 12799bf0dad6SMatthew G. Knepley 12809bf0dad6SMatthew G. Knepley if (ornt < 0) { 12819bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 12829bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12839bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12849bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12859bf0dad6SMatthew G. Knepley } 12869bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 12879bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 12889bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 12899bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 12909bf0dad6SMatthew G. Knepley } 12919bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 12929bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 12939bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 12949bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 12959bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 12969bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 12979bf0dad6SMatthew G. Knepley 12989bf0dad6SMatthew G. Knepley if (useCone) { 12999bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13009bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13019bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13029bf0dad6SMatthew G. Knepley } else { 13039bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 13049bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13059bf0dad6SMatthew G. Knepley tmpO = NULL; 13069bf0dad6SMatthew G. Knepley } 13079bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 13089bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 13099bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13109bf0dad6SMatthew 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. */ 13119bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 13129bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 13139bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13149bf0dad6SMatthew G. Knepley PetscInt c; 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley if (rev) { 13179bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13189bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13199bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13209bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13219bf0dad6SMatthew G. Knepley } 13229bf0dad6SMatthew G. Knepley /* Check for duplicate */ 13239bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 13249bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 13259bf0dad6SMatthew G. Knepley } 13269bf0dad6SMatthew G. Knepley if (c == closureSize) { 13279bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13289bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13299bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13309bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13319bf0dad6SMatthew G. Knepley closureSize += 2; 13329bf0dad6SMatthew G. Knepley fifoSize += 2; 13339bf0dad6SMatthew G. Knepley } 13349bf0dad6SMatthew G. Knepley } 13359bf0dad6SMatthew G. Knepley fifoStart += 2; 13369bf0dad6SMatthew G. Knepley } 13379bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13389bf0dad6SMatthew G. Knepley if (points) *points = closure; 13399bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13409bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13419bf0dad6SMatthew G. Knepley } 13429bf0dad6SMatthew G. Knepley 13439bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1344552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1345552f7358SJed Brown /*@C 1346552f7358SJed 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 1347552f7358SJed Brown 1348552f7358SJed Brown Not collective 1349552f7358SJed Brown 1350552f7358SJed Brown Input Parameters: 1351552f7358SJed Brown + mesh - The DMPlex 1352552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1353552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1354e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1355e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1356552f7358SJed Brown 1357552f7358SJed Brown Note: 13580298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1359552f7358SJed Brown 13603813dfbdSMatthew G Knepley Fortran Notes: 13613813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13623813dfbdSMatthew G Knepley include petsc.h90 in your code. 13633813dfbdSMatthew G Knepley 13643813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13653813dfbdSMatthew G Knepley 1366552f7358SJed Brown Level: beginner 1367552f7358SJed Brown 1368552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1369552f7358SJed Brown @*/ 1370552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1371552f7358SJed Brown { 1372552f7358SJed Brown PetscErrorCode ierr; 1373552f7358SJed Brown 1374552f7358SJed Brown PetscFunctionBegin; 1375552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1376e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1377e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1378552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 13794ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1380552f7358SJed Brown PetscFunctionReturn(0); 1381552f7358SJed Brown } 1382552f7358SJed Brown 1383552f7358SJed Brown #undef __FUNCT__ 1384552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1385552f7358SJed Brown /*@ 1386552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1387552f7358SJed Brown 1388552f7358SJed Brown Not collective 1389552f7358SJed Brown 1390552f7358SJed Brown Input Parameter: 1391552f7358SJed Brown . mesh - The DMPlex 1392552f7358SJed Brown 1393552f7358SJed Brown Output Parameters: 1394552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1395552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1396552f7358SJed Brown 1397552f7358SJed Brown Level: beginner 1398552f7358SJed Brown 1399552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1400552f7358SJed Brown @*/ 1401552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1402552f7358SJed Brown { 1403552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1404552f7358SJed Brown 1405552f7358SJed Brown PetscFunctionBegin; 1406552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1407552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1408552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1409552f7358SJed Brown PetscFunctionReturn(0); 1410552f7358SJed Brown } 1411552f7358SJed Brown 1412552f7358SJed Brown #undef __FUNCT__ 1413552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1414552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1415552f7358SJed Brown { 1416552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1417552f7358SJed Brown PetscInt size; 1418552f7358SJed Brown PetscErrorCode ierr; 1419552f7358SJed Brown 1420552f7358SJed Brown PetscFunctionBegin; 1421552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1422552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1423552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 14241795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 14251795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1426552f7358SJed Brown if (mesh->maxSupportSize) { 1427552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1428552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 14291795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1430552f7358SJed Brown } 1431552f7358SJed Brown PetscFunctionReturn(0); 1432552f7358SJed Brown } 1433552f7358SJed Brown 1434552f7358SJed Brown #undef __FUNCT__ 1435552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1436552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1437552f7358SJed Brown { 1438552f7358SJed Brown PetscErrorCode ierr; 1439552f7358SJed Brown 1440552f7358SJed Brown PetscFunctionBegin; 14414d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 14424d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1443552f7358SJed Brown PetscFunctionReturn(0); 1444552f7358SJed Brown } 1445552f7358SJed Brown 1446552f7358SJed Brown #undef __FUNCT__ 1447552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1448552f7358SJed Brown /*@ 1449552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1450552f7358SJed Brown 1451552f7358SJed Brown Not collective 1452552f7358SJed Brown 1453552f7358SJed Brown Input Parameter: 1454552f7358SJed Brown . mesh - The DMPlex 1455552f7358SJed Brown 1456552f7358SJed Brown Output Parameter: 1457552f7358SJed Brown 1458552f7358SJed Brown Note: 1459552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1460552f7358SJed Brown 1461552f7358SJed Brown Level: beginner 1462552f7358SJed Brown 1463552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1464552f7358SJed Brown @*/ 1465552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1466552f7358SJed Brown { 1467552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1468552f7358SJed Brown PetscInt *offsets; 1469552f7358SJed Brown PetscInt supportSize; 1470552f7358SJed Brown PetscInt pStart, pEnd, p; 1471552f7358SJed Brown PetscErrorCode ierr; 1472552f7358SJed Brown 1473552f7358SJed Brown PetscFunctionBegin; 1474552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 147582f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1476552f7358SJed Brown /* Calculate support sizes */ 1477552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1478552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1479552f7358SJed Brown PetscInt dof, off, c; 1480552f7358SJed Brown 1481552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1482552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1483552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1484552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1485552f7358SJed Brown } 1486552f7358SJed Brown } 1487552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1488552f7358SJed Brown PetscInt dof; 1489552f7358SJed Brown 1490552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 14910d644c17SKarl Rupp 1492552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1493552f7358SJed Brown } 1494552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1495552f7358SJed Brown /* Calculate supports */ 1496552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 14971795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 14981795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1499552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1500552f7358SJed Brown PetscInt dof, off, c; 1501552f7358SJed Brown 1502552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1503552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1504552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1505552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1506552f7358SJed Brown PetscInt offS; 1507552f7358SJed Brown 1508552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 15090d644c17SKarl Rupp 1510552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1511552f7358SJed Brown ++offsets[q]; 1512552f7358SJed Brown } 1513552f7358SJed Brown } 1514552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1515552f7358SJed Brown PetscFunctionReturn(0); 1516552f7358SJed Brown } 1517552f7358SJed Brown 1518552f7358SJed Brown #undef __FUNCT__ 1519552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1520552f7358SJed Brown /*@ 1521552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1522552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1523552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1524552f7358SJed Brown the DAG. 1525552f7358SJed Brown 1526552f7358SJed Brown Not collective 1527552f7358SJed Brown 1528552f7358SJed Brown Input Parameter: 1529552f7358SJed Brown . mesh - The DMPlex 1530552f7358SJed Brown 1531552f7358SJed Brown Output Parameter: 1532552f7358SJed Brown 1533552f7358SJed Brown Notes: 1534552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1535552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1536552f7358SJed Brown 1537552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1538552f7358SJed Brown 1539552f7358SJed Brown Level: beginner 1540552f7358SJed Brown 1541552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1542552f7358SJed Brown @*/ 1543552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1544552f7358SJed Brown { 1545aa50250dSMatthew G. Knepley DMLabel label; 1546552f7358SJed Brown PetscInt pStart, pEnd, p; 1547552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1548552f7358SJed Brown PetscErrorCode ierr; 1549552f7358SJed Brown 1550552f7358SJed Brown PetscFunctionBegin; 1551552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1552552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1553552f7358SJed Brown /* Calculate depth */ 1554aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1555aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1556aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1557552f7358SJed Brown /* Initialize roots and count leaves */ 1558552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1559552f7358SJed Brown PetscInt coneSize, supportSize; 1560552f7358SJed Brown 1561552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1562552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1563552f7358SJed Brown if (!coneSize && supportSize) { 1564552f7358SJed Brown ++numRoots; 1565aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1566552f7358SJed Brown } else if (!supportSize && coneSize) { 1567552f7358SJed Brown ++numLeaves; 1568552f7358SJed Brown } else if (!supportSize && !coneSize) { 1569552f7358SJed Brown /* Isolated points */ 1570aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1571552f7358SJed Brown } 1572552f7358SJed Brown } 1573552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1574552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1575552f7358SJed Brown PetscInt coneSize, supportSize; 1576552f7358SJed Brown 1577552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1578552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1579552f7358SJed Brown if (!supportSize && coneSize) { 1580aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1581552f7358SJed Brown } 1582552f7358SJed Brown } 1583552f7358SJed Brown } else { 158474ef644bSMatthew G. Knepley IS pointIS; 158574ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1586552f7358SJed Brown 158774ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 158874ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 158974ef644bSMatthew G. Knepley while (numPoints) { 159074ef644bSMatthew G. Knepley const PetscInt *points; 159174ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 159274ef644bSMatthew G. Knepley 159374ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 159474ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 159574ef644bSMatthew G. Knepley const PetscInt point = points[p]; 159674ef644bSMatthew G. Knepley const PetscInt *support; 159774ef644bSMatthew G. Knepley PetscInt supportSize, s; 159874ef644bSMatthew G. Knepley 159974ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 160074ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 160174ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 160274ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1603552f7358SJed Brown } 1604552f7358SJed Brown } 16055edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 160674ef644bSMatthew G. Knepley ++level; 160774ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 160874ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 160974ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 161074ef644bSMatthew G. Knepley else {numPoints = 0;} 161174ef644bSMatthew G. Knepley } 161274ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 161374ef644bSMatthew G. Knepley } 1614552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1615552f7358SJed Brown PetscFunctionReturn(0); 1616552f7358SJed Brown } 1617552f7358SJed Brown 1618552f7358SJed Brown #undef __FUNCT__ 1619552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1620552f7358SJed Brown /*@C 1621552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1622552f7358SJed Brown 1623552f7358SJed Brown Not Collective 1624552f7358SJed Brown 1625552f7358SJed Brown Input Parameters: 1626552f7358SJed Brown + dm - The DMPlex object 1627552f7358SJed Brown . numPoints - The number of input points for the join 1628552f7358SJed Brown - points - The input points 1629552f7358SJed Brown 1630552f7358SJed Brown Output Parameters: 1631552f7358SJed Brown + numCoveredPoints - The number of points in the join 1632552f7358SJed Brown - coveredPoints - The points in the join 1633552f7358SJed Brown 1634552f7358SJed Brown Level: intermediate 1635552f7358SJed Brown 1636552f7358SJed Brown Note: Currently, this is restricted to a single level join 1637552f7358SJed Brown 16383813dfbdSMatthew G Knepley Fortran Notes: 16393813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16403813dfbdSMatthew G Knepley include petsc.h90 in your code. 16413813dfbdSMatthew G Knepley 16423813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16433813dfbdSMatthew G Knepley 1644552f7358SJed Brown .keywords: mesh 1645552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1646552f7358SJed Brown @*/ 1647552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1648552f7358SJed Brown { 1649552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1650552f7358SJed Brown PetscInt *join[2]; 1651552f7358SJed Brown PetscInt joinSize, i = 0; 1652552f7358SJed Brown PetscInt dof, off, p, c, m; 1653552f7358SJed Brown PetscErrorCode ierr; 1654552f7358SJed Brown 1655552f7358SJed Brown PetscFunctionBegin; 1656552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1657552f7358SJed Brown PetscValidPointer(points, 2); 1658552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1659552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1660552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1661552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1662552f7358SJed Brown /* Copy in support of first point */ 1663552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1664552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1665552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1666552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1667552f7358SJed Brown } 1668552f7358SJed Brown /* Check each successive support */ 1669552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1670552f7358SJed Brown PetscInt newJoinSize = 0; 1671552f7358SJed Brown 1672552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1673552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1674552f7358SJed Brown for (c = 0; c < dof; ++c) { 1675552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1676552f7358SJed Brown 1677552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1678552f7358SJed Brown if (point == join[i][m]) { 1679552f7358SJed Brown join[1-i][newJoinSize++] = point; 1680552f7358SJed Brown break; 1681552f7358SJed Brown } 1682552f7358SJed Brown } 1683552f7358SJed Brown } 1684552f7358SJed Brown joinSize = newJoinSize; 1685552f7358SJed Brown i = 1-i; 1686552f7358SJed Brown } 1687552f7358SJed Brown *numCoveredPoints = joinSize; 1688552f7358SJed Brown *coveredPoints = join[i]; 1689552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1690552f7358SJed Brown PetscFunctionReturn(0); 1691552f7358SJed Brown } 1692552f7358SJed Brown 1693552f7358SJed Brown #undef __FUNCT__ 1694552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1695552f7358SJed Brown /*@C 1696552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1697552f7358SJed Brown 1698552f7358SJed Brown Not Collective 1699552f7358SJed Brown 1700552f7358SJed Brown Input Parameters: 1701552f7358SJed Brown + dm - The DMPlex object 1702552f7358SJed Brown . numPoints - The number of input points for the join 1703552f7358SJed Brown - points - The input points 1704552f7358SJed Brown 1705552f7358SJed Brown Output Parameters: 1706552f7358SJed Brown + numCoveredPoints - The number of points in the join 1707552f7358SJed Brown - coveredPoints - The points in the join 1708552f7358SJed Brown 17093813dfbdSMatthew G Knepley Fortran Notes: 17103813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17113813dfbdSMatthew G Knepley include petsc.h90 in your code. 17123813dfbdSMatthew G Knepley 17133813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17143813dfbdSMatthew G Knepley 1715552f7358SJed Brown Level: intermediate 1716552f7358SJed Brown 1717552f7358SJed Brown .keywords: mesh 1718552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1719552f7358SJed Brown @*/ 1720552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1721552f7358SJed Brown { 1722552f7358SJed Brown PetscErrorCode ierr; 1723552f7358SJed Brown 1724552f7358SJed Brown PetscFunctionBegin; 1725552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1726d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1727d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1728d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1729552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1730d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1731552f7358SJed Brown PetscFunctionReturn(0); 1732552f7358SJed Brown } 1733552f7358SJed Brown 1734552f7358SJed Brown #undef __FUNCT__ 1735552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1736552f7358SJed Brown /*@C 1737552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1738552f7358SJed Brown 1739552f7358SJed Brown Not Collective 1740552f7358SJed Brown 1741552f7358SJed Brown Input Parameters: 1742552f7358SJed Brown + dm - The DMPlex object 1743552f7358SJed Brown . numPoints - The number of input points for the join 1744552f7358SJed Brown - points - The input points 1745552f7358SJed Brown 1746552f7358SJed Brown Output Parameters: 1747552f7358SJed Brown + numCoveredPoints - The number of points in the join 1748552f7358SJed Brown - coveredPoints - The points in the join 1749552f7358SJed Brown 17503813dfbdSMatthew G Knepley Fortran Notes: 17513813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17523813dfbdSMatthew G Knepley include petsc.h90 in your code. 17533813dfbdSMatthew G Knepley 17543813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17553813dfbdSMatthew G Knepley 1756552f7358SJed Brown Level: intermediate 1757552f7358SJed Brown 1758552f7358SJed Brown .keywords: mesh 1759552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1760552f7358SJed Brown @*/ 1761552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1762552f7358SJed Brown { 1763552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1764552f7358SJed Brown PetscInt *offsets, **closures; 1765552f7358SJed Brown PetscInt *join[2]; 1766552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1767552f7358SJed Brown PetscInt p, d, c, m; 1768552f7358SJed Brown PetscErrorCode ierr; 1769552f7358SJed Brown 1770552f7358SJed Brown PetscFunctionBegin; 1771552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1772552f7358SJed Brown PetscValidPointer(points, 2); 1773552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1774552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1775552f7358SJed Brown 1776552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 17771795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1778552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1779e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1780552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1781552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1782552f7358SJed Brown 1783552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1784552f7358SJed Brown PetscInt closureSize; 1785552f7358SJed Brown 1786552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 17870d644c17SKarl Rupp 1788552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1789552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1790552f7358SJed Brown PetscInt pStart, pEnd, i; 1791552f7358SJed Brown 1792552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1793552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1794552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1795552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1796552f7358SJed Brown break; 1797552f7358SJed Brown } 1798552f7358SJed Brown } 1799552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1800552f7358SJed Brown } 180182f516ccSBarry 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); 1802552f7358SJed Brown } 1803552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1804552f7358SJed Brown PetscInt dof; 1805552f7358SJed Brown 1806552f7358SJed Brown /* Copy in support of first point */ 1807552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1808552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1809552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1810552f7358SJed Brown } 1811552f7358SJed Brown /* Check each successive cone */ 1812552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1813552f7358SJed Brown PetscInt newJoinSize = 0; 1814552f7358SJed Brown 1815552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1816552f7358SJed Brown for (c = 0; c < dof; ++c) { 1817552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1818552f7358SJed Brown 1819552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1820552f7358SJed Brown if (point == join[i][m]) { 1821552f7358SJed Brown join[1-i][newJoinSize++] = point; 1822552f7358SJed Brown break; 1823552f7358SJed Brown } 1824552f7358SJed Brown } 1825552f7358SJed Brown } 1826552f7358SJed Brown joinSize = newJoinSize; 1827552f7358SJed Brown i = 1-i; 1828552f7358SJed Brown } 1829552f7358SJed Brown if (joinSize) break; 1830552f7358SJed Brown } 1831552f7358SJed Brown *numCoveredPoints = joinSize; 1832552f7358SJed Brown *coveredPoints = join[i]; 1833552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 18340298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1835552f7358SJed Brown } 1836552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1837552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1838552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1839552f7358SJed Brown PetscFunctionReturn(0); 1840552f7358SJed Brown } 1841552f7358SJed Brown 1842552f7358SJed Brown #undef __FUNCT__ 1843552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1844552f7358SJed Brown /*@C 1845552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1846552f7358SJed Brown 1847552f7358SJed Brown Not Collective 1848552f7358SJed Brown 1849552f7358SJed Brown Input Parameters: 1850552f7358SJed Brown + dm - The DMPlex object 1851552f7358SJed Brown . numPoints - The number of input points for the meet 1852552f7358SJed Brown - points - The input points 1853552f7358SJed Brown 1854552f7358SJed Brown Output Parameters: 1855552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1856552f7358SJed Brown - coveredPoints - The points in the meet 1857552f7358SJed Brown 1858552f7358SJed Brown Level: intermediate 1859552f7358SJed Brown 1860552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1861552f7358SJed Brown 18623813dfbdSMatthew G Knepley Fortran Notes: 18633813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18643813dfbdSMatthew G Knepley include petsc.h90 in your code. 18653813dfbdSMatthew G Knepley 18663813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18673813dfbdSMatthew G Knepley 1868552f7358SJed Brown .keywords: mesh 1869552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1870552f7358SJed Brown @*/ 1871552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1872552f7358SJed Brown { 1873552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1874552f7358SJed Brown PetscInt *meet[2]; 1875552f7358SJed Brown PetscInt meetSize, i = 0; 1876552f7358SJed Brown PetscInt dof, off, p, c, m; 1877552f7358SJed Brown PetscErrorCode ierr; 1878552f7358SJed Brown 1879552f7358SJed Brown PetscFunctionBegin; 1880552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1881552f7358SJed Brown PetscValidPointer(points, 2); 1882552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1883552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1884552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1885552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1886552f7358SJed Brown /* Copy in cone of first point */ 1887552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1888552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1889552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1890552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1891552f7358SJed Brown } 1892552f7358SJed Brown /* Check each successive cone */ 1893552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1894552f7358SJed Brown PetscInt newMeetSize = 0; 1895552f7358SJed Brown 1896552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1897552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1898552f7358SJed Brown for (c = 0; c < dof; ++c) { 1899552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1900552f7358SJed Brown 1901552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1902552f7358SJed Brown if (point == meet[i][m]) { 1903552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1904552f7358SJed Brown break; 1905552f7358SJed Brown } 1906552f7358SJed Brown } 1907552f7358SJed Brown } 1908552f7358SJed Brown meetSize = newMeetSize; 1909552f7358SJed Brown i = 1-i; 1910552f7358SJed Brown } 1911552f7358SJed Brown *numCoveringPoints = meetSize; 1912552f7358SJed Brown *coveringPoints = meet[i]; 1913552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 1914552f7358SJed Brown PetscFunctionReturn(0); 1915552f7358SJed Brown } 1916552f7358SJed Brown 1917552f7358SJed Brown #undef __FUNCT__ 1918552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 1919552f7358SJed Brown /*@C 1920552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 1921552f7358SJed Brown 1922552f7358SJed Brown Not Collective 1923552f7358SJed Brown 1924552f7358SJed Brown Input Parameters: 1925552f7358SJed Brown + dm - The DMPlex object 1926552f7358SJed Brown . numPoints - The number of input points for the meet 1927552f7358SJed Brown - points - The input points 1928552f7358SJed Brown 1929552f7358SJed Brown Output Parameters: 1930552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1931552f7358SJed Brown - coveredPoints - The points in the meet 1932552f7358SJed Brown 1933552f7358SJed Brown Level: intermediate 1934552f7358SJed Brown 19353813dfbdSMatthew G Knepley Fortran Notes: 19363813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19373813dfbdSMatthew G Knepley include petsc.h90 in your code. 19383813dfbdSMatthew G Knepley 19393813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19403813dfbdSMatthew G Knepley 1941552f7358SJed Brown .keywords: mesh 1942552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 1943552f7358SJed Brown @*/ 1944552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1945552f7358SJed Brown { 1946552f7358SJed Brown PetscErrorCode ierr; 1947552f7358SJed Brown 1948552f7358SJed Brown PetscFunctionBegin; 1949552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1950d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1951d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1952d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 1953552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1954d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1955552f7358SJed Brown PetscFunctionReturn(0); 1956552f7358SJed Brown } 1957552f7358SJed Brown 1958552f7358SJed Brown #undef __FUNCT__ 1959552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 1960552f7358SJed Brown /*@C 1961552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 1962552f7358SJed Brown 1963552f7358SJed Brown Not Collective 1964552f7358SJed Brown 1965552f7358SJed Brown Input Parameters: 1966552f7358SJed Brown + dm - The DMPlex object 1967552f7358SJed Brown . numPoints - The number of input points for the meet 1968552f7358SJed Brown - points - The input points 1969552f7358SJed Brown 1970552f7358SJed Brown Output Parameters: 1971552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1972552f7358SJed Brown - coveredPoints - The points in the meet 1973552f7358SJed Brown 1974552f7358SJed Brown Level: intermediate 1975552f7358SJed Brown 19763813dfbdSMatthew G Knepley Fortran Notes: 19773813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19783813dfbdSMatthew G Knepley include petsc.h90 in your code. 19793813dfbdSMatthew G Knepley 19803813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19813813dfbdSMatthew G Knepley 1982552f7358SJed Brown .keywords: mesh 1983552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 1984552f7358SJed Brown @*/ 1985552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1986552f7358SJed Brown { 1987552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1988552f7358SJed Brown PetscInt *offsets, **closures; 1989552f7358SJed Brown PetscInt *meet[2]; 1990552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 1991552f7358SJed Brown PetscInt p, h, c, m; 1992552f7358SJed Brown PetscErrorCode ierr; 1993552f7358SJed Brown 1994552f7358SJed Brown PetscFunctionBegin; 1995552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1996552f7358SJed Brown PetscValidPointer(points, 2); 1997552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1998552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1999552f7358SJed Brown 2000552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2001785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2002552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2003e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2004552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2005552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2006552f7358SJed Brown 2007552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2008552f7358SJed Brown PetscInt closureSize; 2009552f7358SJed Brown 2010552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 20110d644c17SKarl Rupp 2012552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2013552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2014552f7358SJed Brown PetscInt pStart, pEnd, i; 2015552f7358SJed Brown 2016552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2017552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2018552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2019552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2020552f7358SJed Brown break; 2021552f7358SJed Brown } 2022552f7358SJed Brown } 2023552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2024552f7358SJed Brown } 202582f516ccSBarry 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); 2026552f7358SJed Brown } 2027552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2028552f7358SJed Brown PetscInt dof; 2029552f7358SJed Brown 2030552f7358SJed Brown /* Copy in cone of first point */ 2031552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2032552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2033552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2034552f7358SJed Brown } 2035552f7358SJed Brown /* Check each successive cone */ 2036552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2037552f7358SJed Brown PetscInt newMeetSize = 0; 2038552f7358SJed Brown 2039552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2040552f7358SJed Brown for (c = 0; c < dof; ++c) { 2041552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2042552f7358SJed Brown 2043552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2044552f7358SJed Brown if (point == meet[i][m]) { 2045552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2046552f7358SJed Brown break; 2047552f7358SJed Brown } 2048552f7358SJed Brown } 2049552f7358SJed Brown } 2050552f7358SJed Brown meetSize = newMeetSize; 2051552f7358SJed Brown i = 1-i; 2052552f7358SJed Brown } 2053552f7358SJed Brown if (meetSize) break; 2054552f7358SJed Brown } 2055552f7358SJed Brown *numCoveredPoints = meetSize; 2056552f7358SJed Brown *coveredPoints = meet[i]; 2057552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20580298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2059552f7358SJed Brown } 2060552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2061552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2062552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2063552f7358SJed Brown PetscFunctionReturn(0); 2064552f7358SJed Brown } 2065552f7358SJed Brown 2066552f7358SJed Brown #undef __FUNCT__ 20674e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 20684e3744c5SMatthew G. Knepley /*@C 20694e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 20704e3744c5SMatthew G. Knepley 20714e3744c5SMatthew G. Knepley Not Collective 20724e3744c5SMatthew G. Knepley 20734e3744c5SMatthew G. Knepley Input Parameters: 20744e3744c5SMatthew G. Knepley + dmA - A DMPlex object 20754e3744c5SMatthew G. Knepley - dmB - A DMPlex object 20764e3744c5SMatthew G. Knepley 20774e3744c5SMatthew G. Knepley Output Parameters: 20784e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 20794e3744c5SMatthew G. Knepley 20804e3744c5SMatthew G. Knepley Level: intermediate 20814e3744c5SMatthew G. Knepley 20824e3744c5SMatthew G. Knepley Notes: 20834e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 20844e3744c5SMatthew G. Knepley 20854e3744c5SMatthew G. Knepley .keywords: mesh 20864e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 20874e3744c5SMatthew G. Knepley @*/ 20884e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 20894e3744c5SMatthew G. Knepley { 20904e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 20914e3744c5SMatthew G. Knepley PetscErrorCode ierr; 20924e3744c5SMatthew G. Knepley 20934e3744c5SMatthew G. Knepley PetscFunctionBegin; 20944e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 20954e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 20964e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 20974e3744c5SMatthew G. Knepley 20984e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 20994e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21004e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 21014e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 21024e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 21034e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 21044e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 21054e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 21064e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 21074e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 21084e3744c5SMatthew G. Knepley 21094e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 21104e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 21114e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 21124e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 21134e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 21144e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 21154e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 21164e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 21174e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 21184e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 21194e3744c5SMatthew G. Knepley } 21204e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 21214e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 21224e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 21234e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 21244e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 21254e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 21264e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 21274e3744c5SMatthew G. Knepley } 21284e3744c5SMatthew G. Knepley } 21294e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 21304e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 21314e3744c5SMatthew G. Knepley } 21324e3744c5SMatthew G. Knepley 21334e3744c5SMatthew G. Knepley #undef __FUNCT__ 213418ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 213518ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2136a6dfd86eSKarl Rupp { 213782f516ccSBarry Smith MPI_Comm comm; 2138552f7358SJed Brown PetscErrorCode ierr; 2139552f7358SJed Brown 2140552f7358SJed Brown PetscFunctionBegin; 214182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2142552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2143552f7358SJed Brown switch (cellDim) { 2144552f7358SJed Brown case 0: 2145552f7358SJed Brown *numFaceVertices = 0; 2146552f7358SJed Brown break; 2147552f7358SJed Brown case 1: 2148552f7358SJed Brown *numFaceVertices = 1; 2149552f7358SJed Brown break; 2150552f7358SJed Brown case 2: 2151552f7358SJed Brown switch (numCorners) { 215219436ca2SJed Brown case 3: /* triangle */ 215319436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2154552f7358SJed Brown break; 215519436ca2SJed Brown case 4: /* quadrilateral */ 215619436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2157552f7358SJed Brown break; 215819436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 215919436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2160552f7358SJed Brown break; 216119436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 216219436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2163552f7358SJed Brown break; 2164552f7358SJed Brown default: 2165552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2166552f7358SJed Brown } 2167552f7358SJed Brown break; 2168552f7358SJed Brown case 3: 2169552f7358SJed Brown switch (numCorners) { 217019436ca2SJed Brown case 4: /* tetradehdron */ 217119436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2172552f7358SJed Brown break; 217319436ca2SJed Brown case 6: /* tet cohesive cells */ 217419436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2175552f7358SJed Brown break; 217619436ca2SJed Brown case 8: /* hexahedron */ 217719436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2178552f7358SJed Brown break; 217919436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 218019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2181552f7358SJed Brown break; 218219436ca2SJed Brown case 10: /* quadratic tetrahedron */ 218319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2184552f7358SJed Brown break; 218519436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 218619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2187552f7358SJed Brown break; 218819436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 218919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2190552f7358SJed Brown break; 219119436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 219219436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2193552f7358SJed Brown break; 2194552f7358SJed Brown default: 2195552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2196552f7358SJed Brown } 2197552f7358SJed Brown break; 2198552f7358SJed Brown default: 2199552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2200552f7358SJed Brown } 2201552f7358SJed Brown PetscFunctionReturn(0); 2202552f7358SJed Brown } 2203552f7358SJed Brown 2204552f7358SJed Brown #undef __FUNCT__ 2205d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2206d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2207d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2208d27a0f52SMatthew G. Knepley { 2209a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2210a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2211a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2212d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2213d27a0f52SMatthew G. Knepley 2214d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2215d27a0f52SMatthew G. Knepley /* Truth Table 2216d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2217d27a0f52SMatthew G. Knepley F 0 flips no F F F 2218d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2219d27a0f52SMatthew G. Knepley F 2 flips no T F T 2220d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2221d27a0f52SMatthew G. Knepley T 1 flip no 2222d27a0f52SMatthew G. Knepley T 2 flips yes 2223d27a0f52SMatthew G. Knepley */ 2224a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2225d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2226a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2227d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2228a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2229a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2230a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2231a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2232a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2233a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2234785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2235a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2236a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2237defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2238a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2239a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2240a1b4d4a2SMatthew G. Knepley 2241a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2242a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2243a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2244a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2245a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2246a1b4d4a2SMatthew G. Knepley } 2247a1b4d4a2SMatthew G. Knepley } 2248a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2249a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2250d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2251a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2252d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2253d27a0f52SMatthew G. Knepley 2254a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2255a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2256a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2257d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2258d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2259a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 226086cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2261a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 226286cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2263d27a0f52SMatthew G. Knepley 2264d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2265d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2266d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2267d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2268d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2269d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2270a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2271a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2272a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2273a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2274a1b4d4a2SMatthew G. Knepley } 2275a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2276a1b4d4a2SMatthew 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); 2277a1b4d4a2SMatthew G. Knepley } 2278a1b4d4a2SMatthew 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]); 2279a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2280a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2281a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2282a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2283a1b4d4a2SMatthew G. Knepley } 2284a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2285a1b4d4a2SMatthew 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); 2286a1b4d4a2SMatthew G. Knepley } 2287a1b4d4a2SMatthew 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]); 2288d27a0f52SMatthew G. Knepley 2289d27a0f52SMatthew G. Knepley if (dim == 1) { 2290d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2291d27a0f52SMatthew G. Knepley } else { 2292d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2293d27a0f52SMatthew G. Knepley } 2294d27a0f52SMatthew G. Knepley 2295d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2296d27a0f52SMatthew 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]); 2297d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2298a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2299d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2300a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2301d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 230286cff514SMatthew 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"); 2303a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2304a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2305d27a0f52SMatthew G. Knepley } 2306fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2307fedde076SMatthew G. Knepley { 2308fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2309fedde076SMatthew G. Knepley PetscSF sf; 2310fedde076SMatthew G. Knepley const PetscInt *lpoints; 2311fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 231213048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2313fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2314a1b4d4a2SMatthew G. Knepley 2315fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2316fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2317fedde076SMatthew G. Knepley if (numLeaves >= 0) { 231862ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 231962ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 232062ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 232113048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 232262ad4a6aSMatthew G. Knepley 2323fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2324fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2325fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2326fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2327fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2328fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2329fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2330fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2331fedde076SMatthew G. Knepley PetscInt supportSize; 2332fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2333fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2334fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2335fedde076SMatthew G. Knepley } 2336fedde076SMatthew G. Knepley } 2337fedde076SMatthew G. Knepley } 233813048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2339fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2340fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2341fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2342fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2343fedde076SMatthew G. Knepley 2344fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 234562ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2346fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2347fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 23485b7033fcSMatthew G. Knepley if (dim == 1) { 23495b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 23505b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 23515b7033fcSMatthew G. Knepley } else { 2352fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2353fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2354fedde076SMatthew G. Knepley } 23555b7033fcSMatthew G. Knepley } 2356fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2357fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2358fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2359fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2360fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2361fedde076SMatthew G. Knepley 236213048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 236313048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 236413048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2365fedde076SMatthew G. Knepley } 236613048561SMatthew G. Knepley /* Collect the graph on 0 */ 236713048561SMatthew G. Knepley { 236813048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 236913048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 237013048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 237113048561SMatthew G. Knepley PetscInt *adj = NULL; 237213048561SMatthew G. Knepley PetscBool *val = NULL; 237313048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 237413048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 237513048561SMatthew G. Knepley PetscInt debug = 0; 237613048561SMatthew G. Knepley 237713048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 237813048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 237913048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 238013048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 238113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 238213048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 238313048561SMatthew G. Knepley } 238413048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 238513048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 238613048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 238713048561SMatthew G. Knepley if (debug) { 238813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 238913048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 239013048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 239113048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 239213048561SMatthew G. Knepley } 239313048561SMatthew G. Knepley } 239413048561SMatthew G. Knepley } 239513048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 239613048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 239713048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 239813048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 239913048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 240013048561SMatthew G. Knepley pTop = pBottom = 0; 240113048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 240213048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 240313048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 240413048561SMatthew G. Knepley procFIFO[pBottom++] = p; 240513048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 240613048561SMatthew G. Knepley /* Consider each proc in FIFO */ 240713048561SMatthew G. Knepley while (pTop < pBottom) { 240813048561SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch; 240913048561SMatthew G. Knepley 241013048561SMatthew G. Knepley proc = procFIFO[pTop++]; 241113048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 241213048561SMatthew G. Knepley /* Loop over neighboring procs */ 241313048561SMatthew G. Knepley for (n = 0; n < recvcounts[proc]; ++n) { 241413048561SMatthew G. Knepley nproc = adj[displs[proc]+n]; 241513048561SMatthew G. Knepley mismatch = val[displs[proc]+n] ? 0 : 1; 241613048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 241713048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 241813048561SMatthew G. Knepley 241913048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 242013048561SMatthew 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); 242113048561SMatthew G. Knepley if (!flippedB) { 242213048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 242313048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 242413048561SMatthew 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"); 242513048561SMatthew G. Knepley if (!seen) { 242613048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 242713048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 242813048561SMatthew G. Knepley } 242913048561SMatthew G. Knepley } 243013048561SMatthew G. Knepley } 243113048561SMatthew G. Knepley } 243213048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 243313048561SMatthew G. Knepley 243413048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 243513048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 243613048561SMatthew G. Knepley { 243713048561SMatthew G. Knepley PetscBool *flips; 243813048561SMatthew G. Knepley 243913048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 244013048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 244113048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 244213048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 244313048561SMatthew G. Knepley } 244413048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 244513048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 244613048561SMatthew G. Knepley } 244713048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 244813048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 244913048561SMatthew G. Knepley } 245013048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2451fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 245213048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2453fedde076SMatthew G. Knepley } 2454fedde076SMatthew G. Knepley } 2455fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2456d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2457d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2458d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2459a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2460f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2461f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2462d27a0f52SMatthew G. Knepley 2463a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2464a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2465a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2466a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2467a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2468a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2469a1b4d4a2SMatthew G. Knepley 2470a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2471a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2472a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2473d27a0f52SMatthew G. Knepley } 2474a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2475a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2476f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2477f4e909fcSMatthew G. Knepley faceSize = coneSize; 2478f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2479f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2480f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2481f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2482f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2483f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2484f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2485f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2486f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2487f4e909fcSMatthew G. Knepley } 2488f4e909fcSMatthew G. Knepley } 2489d27a0f52SMatthew G. Knepley } 2490d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2491d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2492d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2493a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2494a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2495a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2496d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2497d27a0f52SMatthew G. Knepley } 2498d27a0f52SMatthew G. Knepley 2499d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2500cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal" 2501cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[]) 2502cb1e1211SMatthew G Knepley { 2503cb1e1211SMatthew G Knepley const PetscInt *support = NULL; 2504cb1e1211SMatthew G Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, supportSize, s; 2505cb1e1211SMatthew G Knepley PetscErrorCode ierr; 2506cb1e1211SMatthew G Knepley 2507cb1e1211SMatthew G Knepley PetscFunctionBegin; 2508cb1e1211SMatthew G Knepley if (useClosure) { 2509cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr); 2510cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr); 2511cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2512cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2513cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2514cb1e1211SMatthew G Knepley 2515cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2516cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr); 2517cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2518cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2519cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2520cb1e1211SMatthew G Knepley } 2521cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2522cb1e1211SMatthew G Knepley } 2523cb1e1211SMatthew G Knepley } 2524cb1e1211SMatthew G Knepley } else { 2525cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 2526cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 2527cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2528cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2529cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2530cb1e1211SMatthew G Knepley 2531cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2532cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2533cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2534cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2535cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2536cb1e1211SMatthew G Knepley } 2537cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2538cb1e1211SMatthew G Knepley } 2539cb1e1211SMatthew G Knepley } 2540cb1e1211SMatthew G Knepley } 2541cb1e1211SMatthew G Knepley *adjSize = numAdj; 2542cb1e1211SMatthew G Knepley PetscFunctionReturn(0); 2543cb1e1211SMatthew G Knepley } 2544cb1e1211SMatthew G Knepley 2545cb1e1211SMatthew G Knepley #undef __FUNCT__ 2546552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR" 254777c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency) 25480adebc6cSBarry Smith { 2549552f7358SJed Brown const PetscInt maxFaceCases = 30; 2550552f7358SJed Brown PetscInt numFaceCases = 0; 2551552f7358SJed Brown PetscInt numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */ 2552552f7358SJed Brown PetscInt *off, *adj; 2553552f7358SJed Brown PetscInt *neighborCells, *tmpClosure; 2554552f7358SJed Brown PetscInt maxConeSize, maxSupportSize, maxClosure, maxNeighbors; 255577c88f5bSMatthew G Knepley PetscInt dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell; 2556552f7358SJed Brown PetscErrorCode ierr; 2557552f7358SJed Brown 2558552f7358SJed Brown PetscFunctionBegin; 2559552f7358SJed Brown /* For parallel partitioning, I think you have to communicate supports */ 2560552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 256177c88f5bSMatthew G Knepley cellDim = dim - cellHeight; 2562552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 256377c88f5bSMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 2564552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 2565552f7358SJed Brown if (cEnd - cStart == 0) { 2566552f7358SJed Brown if (numVertices) *numVertices = 0; 25670298fd71SBarry Smith if (offsets) *offsets = NULL; 25680298fd71SBarry Smith if (adjacency) *adjacency = NULL; 2569552f7358SJed Brown PetscFunctionReturn(0); 2570552f7358SJed Brown } 2571552f7358SJed Brown numCells = cEnd - cStart; 257277c88f5bSMatthew G Knepley faceDepth = depth - cellHeight; 25730d957afbSMatthew G. Knepley if (dim == depth) { 2574e430e843SMatthew G. Knepley PetscInt f, fStart, fEnd; 2575e430e843SMatthew G. Knepley 25761795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2577e430e843SMatthew G. Knepley /* Count neighboring cells */ 2578e430e843SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 2579e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2580e430e843SMatthew G. Knepley const PetscInt *support; 2581e430e843SMatthew G. Knepley PetscInt supportSize; 2582e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2583e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2584e430e843SMatthew G. Knepley if (supportSize == 2) { 2585e430e843SMatthew G. Knepley ++off[support[0]-cStart+1]; 2586e430e843SMatthew G. Knepley ++off[support[1]-cStart+1]; 2587e430e843SMatthew G. Knepley } 2588e430e843SMatthew G. Knepley } 2589e430e843SMatthew G. Knepley /* Prefix sum */ 2590e430e843SMatthew G. Knepley for (c = 1; c <= numCells; ++c) off[c] += off[c-1]; 2591e430e843SMatthew G. Knepley if (adjacency) { 2592e430e843SMatthew G. Knepley PetscInt *tmp; 2593e430e843SMatthew G. Knepley 2594785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2595785e854fSJed Brown ierr = PetscMalloc1((numCells+1), &tmp);CHKERRQ(ierr); 2596e430e843SMatthew G. Knepley ierr = PetscMemcpy(tmp, off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr); 2597e430e843SMatthew G. Knepley /* Get neighboring cells */ 2598e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2599e430e843SMatthew G. Knepley const PetscInt *support; 2600e430e843SMatthew G. Knepley PetscInt supportSize; 2601e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2602e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2603e430e843SMatthew G. Knepley if (supportSize == 2) { 2604e430e843SMatthew G. Knepley adj[tmp[support[0]-cStart]++] = support[1]; 2605e430e843SMatthew G. Knepley adj[tmp[support[1]-cStart]++] = support[0]; 2606e430e843SMatthew G. Knepley } 2607e430e843SMatthew G. Knepley } 2608e430e843SMatthew G. Knepley #if defined(PETSC_USE_DEBUG) 26090d957afbSMatthew G. Knepley for (c = 0; c < cEnd-cStart; ++c) if (tmp[c] != off[c+1]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Offset %d != %d for cell %d", tmp[c], off[c], c+cStart); 2610e430e843SMatthew G. Knepley #endif 2611e430e843SMatthew G. Knepley ierr = PetscFree(tmp);CHKERRQ(ierr); 2612e430e843SMatthew G. Knepley } 2613e430e843SMatthew G. Knepley if (numVertices) *numVertices = numCells; 2614e430e843SMatthew G. Knepley if (offsets) *offsets = off; 2615e430e843SMatthew G. Knepley if (adjacency) *adjacency = adj; 2616e430e843SMatthew G. Knepley PetscFunctionReturn(0); 2617e430e843SMatthew G. Knepley } 2618552f7358SJed Brown /* Setup face recognition */ 261977c88f5bSMatthew G Knepley if (faceDepth == 1) { 2620552f7358SJed Brown PetscInt cornersSeen[30] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; /* Could use PetscBT */ 2621552f7358SJed Brown 2622552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2623552f7358SJed Brown PetscInt corners; 2624552f7358SJed Brown 2625552f7358SJed Brown ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr); 2626552f7358SJed Brown if (!cornersSeen[corners]) { 2627552f7358SJed Brown PetscInt nFV; 2628552f7358SJed Brown 262982f516ccSBarry Smith if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases"); 2630552f7358SJed Brown cornersSeen[corners] = 1; 26310d644c17SKarl Rupp 263218ad9376SMatthew G. Knepley ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr); 26330d644c17SKarl Rupp 2634552f7358SJed Brown numFaceVertices[numFaceCases++] = nFV; 2635552f7358SJed Brown } 2636552f7358SJed Brown } 2637552f7358SJed Brown } 2638e7b80042SMatthew G. Knepley maxClosure = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1)); 2639e7b80042SMatthew G. Knepley maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1); 2640dcca6d9dSJed Brown ierr = PetscMalloc2(maxNeighbors,&neighborCells,maxClosure,&tmpClosure);CHKERRQ(ierr); 26411795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2642552f7358SJed Brown /* Count neighboring cells */ 2643552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2644552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2645552f7358SJed Brown 2646cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2647552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2648552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 26494d25b1e8SKarl Rupp PetscInt cellPair[2]; 265077c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2651552f7358SJed Brown PetscInt meetSize = 0; 26520298fd71SBarry Smith const PetscInt *meet = NULL; 2653552f7358SJed Brown 26544d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2655552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2656552f7358SJed Brown if (!found) { 2657552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2658552f7358SJed Brown if (meetSize) { 2659552f7358SJed Brown PetscInt f; 2660552f7358SJed Brown 2661552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2662552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2663552f7358SJed Brown found = PETSC_TRUE; 2664552f7358SJed Brown break; 2665552f7358SJed Brown } 2666552f7358SJed Brown } 2667552f7358SJed Brown } 2668552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2669552f7358SJed Brown } 26700d644c17SKarl Rupp if (found) ++off[cell-cStart+1]; 2671552f7358SJed Brown } 2672552f7358SJed Brown } 2673552f7358SJed Brown /* Prefix sum */ 26740d644c17SKarl Rupp for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1]; 26750d644c17SKarl Rupp 2676552f7358SJed Brown if (adjacency) { 2677785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2678552f7358SJed Brown /* Get neighboring cells */ 2679552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2680552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2681552f7358SJed Brown PetscInt cellOffset = 0; 2682552f7358SJed Brown 2683cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2684552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2685552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 26864d25b1e8SKarl Rupp PetscInt cellPair[2]; 268777c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2688552f7358SJed Brown PetscInt meetSize = 0; 26890298fd71SBarry Smith const PetscInt *meet = NULL; 2690552f7358SJed Brown 26914d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2692552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2693552f7358SJed Brown if (!found) { 2694552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2695552f7358SJed Brown if (meetSize) { 2696552f7358SJed Brown PetscInt f; 2697552f7358SJed Brown 2698552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2699552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2700552f7358SJed Brown found = PETSC_TRUE; 2701552f7358SJed Brown break; 2702552f7358SJed Brown } 2703552f7358SJed Brown } 2704552f7358SJed Brown } 2705552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2706552f7358SJed Brown } 2707552f7358SJed Brown if (found) { 2708552f7358SJed Brown adj[off[cell-cStart]+cellOffset] = neighborCells[n]; 2709552f7358SJed Brown ++cellOffset; 2710552f7358SJed Brown } 2711552f7358SJed Brown } 2712552f7358SJed Brown } 2713552f7358SJed Brown } 2714552f7358SJed Brown ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr); 2715552f7358SJed Brown if (numVertices) *numVertices = numCells; 2716552f7358SJed Brown if (offsets) *offsets = off; 2717552f7358SJed Brown if (adjacency) *adjacency = adj; 2718552f7358SJed Brown PetscFunctionReturn(0); 2719552f7358SJed Brown } 2720552f7358SJed Brown 2721519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2722519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2723552f7358SJed Brown #include <unistd.h> 2724552f7358SJed Brown #endif 2725552f7358SJed Brown /* Chaco does not have an include file */ 272639d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts, 2727552f7358SJed Brown float *ewgts, float *x, float *y, float *z, char *outassignname, 2728552f7358SJed Brown char *outfilename, short *assignment, int architecture, int ndims_tot, 2729552f7358SJed Brown int mesh_dims[3], double *goal, int global_method, int local_method, 2730552f7358SJed Brown int rqi_flag, int vmax, int ndims, double eigtol, long seed); 2731552f7358SJed Brown 2732552f7358SJed Brown extern int FREE_GRAPH; 2733552f7358SJed Brown 2734552f7358SJed Brown #undef __FUNCT__ 2735552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco" 2736552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2737552f7358SJed Brown { 2738552f7358SJed Brown enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3}; 273982f516ccSBarry Smith MPI_Comm comm; 2740552f7358SJed Brown int nvtxs = numVertices; /* number of vertices in full graph */ 2741552f7358SJed Brown int *vwgts = NULL; /* weights for all vertices */ 2742552f7358SJed Brown float *ewgts = NULL; /* weights for all edges */ 2743552f7358SJed Brown float *x = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */ 2744552f7358SJed Brown char *outassignname = NULL; /* name of assignment output file */ 2745552f7358SJed Brown char *outfilename = NULL; /* output file name */ 2746552f7358SJed Brown int architecture = 1; /* 0 => hypercube, d => d-dimensional mesh */ 2747552f7358SJed Brown int ndims_tot = 0; /* total number of cube dimensions to divide */ 2748552f7358SJed Brown int mesh_dims[3]; /* dimensions of mesh of processors */ 2749552f7358SJed Brown double *goal = NULL; /* desired set sizes for each set */ 2750552f7358SJed Brown int global_method = 1; /* global partitioning algorithm */ 2751552f7358SJed Brown int local_method = 1; /* local partitioning algorithm */ 2752552f7358SJed Brown int rqi_flag = 0; /* should I use RQI/Symmlq eigensolver? */ 2753552f7358SJed Brown int vmax = 200; /* how many vertices to coarsen down to? */ 2754552f7358SJed Brown int ndims = 1; /* number of eigenvectors (2^d sets) */ 2755552f7358SJed Brown double eigtol = 0.001; /* tolerance on eigenvectors */ 2756552f7358SJed Brown long seed = 123636512; /* for random graph mutations */ 2757552f7358SJed Brown short int *assignment; /* Output partition */ 2758552f7358SJed Brown int fd_stdout, fd_pipe[2]; 2759552f7358SJed Brown PetscInt *points; 2760552f7358SJed Brown PetscMPIInt commSize; 2761552f7358SJed Brown int i, v, p; 2762552f7358SJed Brown PetscErrorCode ierr; 2763552f7358SJed Brown 2764552f7358SJed Brown PetscFunctionBegin; 276582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2766552f7358SJed Brown ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 2767552f7358SJed Brown if (!numVertices) { 2768552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2769552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2770552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 27710298fd71SBarry Smith ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2772552f7358SJed Brown PetscFunctionReturn(0); 2773552f7358SJed Brown } 2774552f7358SJed Brown FREE_GRAPH = 0; /* Do not let Chaco free my memory */ 27750d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) ++adjacency[i]; 27760d644c17SKarl Rupp 2777552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2778552f7358SJed Brown /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */ 2779552f7358SJed Brown SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported"); 2780552f7358SJed Brown } 2781552f7358SJed Brown mesh_dims[0] = commSize; 2782552f7358SJed Brown mesh_dims[1] = 1; 2783552f7358SJed Brown mesh_dims[2] = 1; 2784785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &assignment);CHKERRQ(ierr); 2785552f7358SJed Brown /* Chaco outputs to stdout. We redirect this to a buffer. */ 2786552f7358SJed Brown /* TODO: check error codes for UNIX calls */ 2787519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2788552f7358SJed Brown { 27897995c745SJed Brown int piperet; 27907995c745SJed Brown piperet = pipe(fd_pipe); 27917995c745SJed Brown if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe"); 2792552f7358SJed Brown fd_stdout = dup(1); 2793552f7358SJed Brown close(1); 2794552f7358SJed Brown dup2(fd_pipe[1], 1); 2795552f7358SJed Brown } 2796552f7358SJed Brown #endif 2797552f7358SJed Brown ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename, 2798552f7358SJed Brown assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag, 2799552f7358SJed Brown vmax, ndims, eigtol, seed); 2800519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2801552f7358SJed Brown { 2802552f7358SJed Brown char msgLog[10000]; 2803552f7358SJed Brown int count; 2804552f7358SJed Brown 2805552f7358SJed Brown fflush(stdout); 2806552f7358SJed Brown count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char)); 2807552f7358SJed Brown if (count < 0) count = 0; 2808552f7358SJed Brown msgLog[count] = 0; 2809552f7358SJed Brown close(1); 2810552f7358SJed Brown dup2(fd_stdout, 1); 2811552f7358SJed Brown close(fd_stdout); 2812552f7358SJed Brown close(fd_pipe[0]); 2813552f7358SJed Brown close(fd_pipe[1]); 2814552f7358SJed Brown if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog); 2815552f7358SJed Brown } 2816552f7358SJed Brown #endif 2817552f7358SJed Brown /* Convert to PetscSection+IS */ 2818552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2819552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2820552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2821552f7358SJed Brown ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 2822552f7358SJed Brown } 2823552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2824785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 2825552f7358SJed Brown for (p = 0, i = 0; p < commSize; ++p) { 2826552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2827552f7358SJed Brown if (assignment[v] == p) points[i++] = v; 2828552f7358SJed Brown } 2829552f7358SJed Brown } 2830552f7358SJed Brown if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 2831552f7358SJed Brown ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2832552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2833552f7358SJed Brown /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */ 2834552f7358SJed Brown } 2835552f7358SJed Brown ierr = PetscFree(assignment);CHKERRQ(ierr); 28360d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) --adjacency[i]; 2837552f7358SJed Brown PetscFunctionReturn(0); 2838552f7358SJed Brown } 2839552f7358SJed Brown #endif 2840552f7358SJed Brown 2841519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 284225cda350SMatthew G. Knepley #include <parmetis.h> 284325cda350SMatthew G. Knepley 2844552f7358SJed Brown #undef __FUNCT__ 2845552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis" 2846552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2847552f7358SJed Brown { 284825cda350SMatthew G. Knepley MPI_Comm comm; 284954695375SMatthew G. Knepley PetscInt nvtxs = numVertices; /* The number of vertices in full graph */ 285054695375SMatthew G. Knepley PetscInt *vtxdist; /* Distribution of vertices across processes */ 285154695375SMatthew G. Knepley PetscInt *xadj = start; /* Start of edge list for each vertex */ 285254695375SMatthew G. Knepley PetscInt *adjncy = adjacency; /* Edge lists for all vertices */ 285354695375SMatthew G. Knepley PetscInt *vwgt = NULL; /* Vertex weights */ 285454695375SMatthew G. Knepley PetscInt *adjwgt = NULL; /* Edge weights */ 285554695375SMatthew G. Knepley PetscInt wgtflag = 0; /* Indicates which weights are present */ 285654695375SMatthew G. Knepley PetscInt numflag = 0; /* Indicates initial offset (0 or 1) */ 285754695375SMatthew G. Knepley PetscInt ncon = 1; /* The number of weights per vertex */ 285854695375SMatthew G. Knepley PetscInt nparts; /* The number of partitions */ 285954695375SMatthew G. Knepley PetscReal *tpwgts; /* The fraction of vertex weights assigned to each partition */ 286054695375SMatthew G. Knepley PetscReal *ubvec; /* The balance intolerance for vertex weights */ 286154695375SMatthew G. Knepley PetscInt options[5]; /* Options */ 286254695375SMatthew G. Knepley /* Outputs */ 286354695375SMatthew G. Knepley PetscInt edgeCut; /* The number of edges cut by the partition */ 286425cda350SMatthew G. Knepley PetscInt *assignment, *points; 286525cda350SMatthew G. Knepley PetscMPIInt commSize, rank, p, v, i; 286625cda350SMatthew G. Knepley PetscErrorCode ierr; 286725cda350SMatthew G. Knepley 2868552f7358SJed Brown PetscFunctionBegin; 286925cda350SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr); 287025cda350SMatthew G. Knepley ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 287125cda350SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 287225cda350SMatthew G. Knepley nparts = commSize; 287325cda350SMatthew G. Knepley options[0] = 0; /* Use all defaults */ 287425cda350SMatthew G. Knepley /* Calculate vertex distribution */ 2875dcca6d9dSJed Brown ierr = PetscMalloc4(nparts+1,&vtxdist,nparts*ncon,&tpwgts,ncon,&ubvec,nvtxs,&assignment);CHKERRQ(ierr); 287625cda350SMatthew G. Knepley vtxdist[0] = 0; 287725cda350SMatthew G. Knepley ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr); 287825cda350SMatthew G. Knepley for (p = 2; p <= nparts; ++p) { 287925cda350SMatthew G. Knepley vtxdist[p] += vtxdist[p-1]; 288025cda350SMatthew G. Knepley } 288125cda350SMatthew G. Knepley /* Calculate weights */ 288225cda350SMatthew G. Knepley for (p = 0; p < nparts; ++p) { 288325cda350SMatthew G. Knepley tpwgts[p] = 1.0/nparts; 288425cda350SMatthew G. Knepley } 288525cda350SMatthew G. Knepley ubvec[0] = 1.05; 288625cda350SMatthew G. Knepley 288725cda350SMatthew G. Knepley if (nparts == 1) { 288825cda350SMatthew G. Knepley ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt)); 288925cda350SMatthew G. Knepley } else { 289025cda350SMatthew G. Knepley if (vtxdist[1] == vtxdist[nparts]) { 289125cda350SMatthew G. Knepley if (!rank) { 2892e7ee2502SMatthew G. Knepley PetscStackPush("METIS_PartGraphKway"); 2893e7ee2502SMatthew G. Knepley ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment); 2894e7ee2502SMatthew G. Knepley PetscStackPop; 2895e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()"); 289625cda350SMatthew G. Knepley } 289725cda350SMatthew G. Knepley } else { 2898e7ee2502SMatthew G. Knepley PetscStackPush("ParMETIS_V3_PartKway"); 2899e7ee2502SMatthew G. Knepley ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm); 2900e7ee2502SMatthew G. Knepley PetscStackPop; 2901e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()"); 290225cda350SMatthew G. Knepley } 290325cda350SMatthew G. Knepley } 290425cda350SMatthew G. Knepley /* Convert to PetscSection+IS */ 290525cda350SMatthew G. Knepley ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 290625cda350SMatthew G. Knepley ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 290725cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 290825cda350SMatthew G. Knepley ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 290925cda350SMatthew G. Knepley } 291025cda350SMatthew G. Knepley ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2911785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 291225cda350SMatthew G. Knepley for (p = 0, i = 0; p < commSize; ++p) { 291325cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 291425cda350SMatthew G. Knepley if (assignment[v] == p) points[i++] = v; 291525cda350SMatthew G. Knepley } 291625cda350SMatthew G. Knepley } 291725cda350SMatthew G. Knepley if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 291825cda350SMatthew G. Knepley ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 291925cda350SMatthew G. Knepley ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr); 2920552f7358SJed Brown PetscFunctionReturn(0); 2921552f7358SJed Brown } 2922552f7358SJed Brown #endif 2923552f7358SJed Brown 2924552f7358SJed Brown #undef __FUNCT__ 2925552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition" 2926552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */ 2927a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition) 2928a6dfd86eSKarl Rupp { 2929552f7358SJed Brown PetscHashI h; 2930552f7358SJed Brown const PetscInt *points; 2931552f7358SJed Brown PetscInt **tmpPoints, *newPoints, totPoints = 0; 2932552f7358SJed Brown PetscInt pStart, pEnd, part, q; 2933552f7358SJed Brown PetscErrorCode ierr; 2934552f7358SJed Brown 2935552f7358SJed Brown PetscFunctionBegin; 2936552f7358SJed Brown PetscHashICreate(h); 293782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2938552f7358SJed Brown ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr); 2939552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr); 2940552f7358SJed Brown ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr); 2941785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &tmpPoints);CHKERRQ(ierr); 2942552f7358SJed Brown for (part = pStart; part < pEnd; ++part) { 2943552f7358SJed Brown PetscInt numPoints, nP, numNewPoints, off, p, n = 0; 2944552f7358SJed Brown 2945552f7358SJed Brown PetscHashIClear(h); 2946552f7358SJed Brown ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr); 2947552f7358SJed Brown ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr); 2948552f7358SJed Brown /* Add all existing points to h */ 2949552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2950552f7358SJed Brown const PetscInt point = points[off+p]; 2951552f7358SJed Brown PetscHashIAdd(h, point, 1); 2952552f7358SJed Brown } 2953552f7358SJed Brown PetscHashISize(h, nP); 295482f516ccSBarry Smith if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP); 2955552f7358SJed Brown /* Add all points in next BFS level */ 2956552f7358SJed Brown /* TODO We are brute forcing here, but could check the adjacency size to find the boundary */ 2957552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2958552f7358SJed Brown const PetscInt point = points[off+p]; 2959552f7358SJed Brown PetscInt s = start[point], e = start[point+1], a; 2960552f7358SJed Brown 29610d644c17SKarl Rupp for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1); 2962552f7358SJed Brown } 2963552f7358SJed Brown PetscHashISize(h, numNewPoints); 2964552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr); 2965785e854fSJed Brown ierr = PetscMalloc1(numNewPoints, &tmpPoints[part]);CHKERRQ(ierr); 2966c9fc7396SMatthew G. Knepley ierr = PetscHashIGetKeys(h, &n, tmpPoints[part]);CHKERRQ(ierr); 2967552f7358SJed Brown totPoints += numNewPoints; 2968552f7358SJed Brown } 2969552f7358SJed Brown ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr); 2970552f7358SJed Brown PetscHashIDestroy(h); 2971552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2972785e854fSJed Brown ierr = PetscMalloc1(totPoints, &newPoints);CHKERRQ(ierr); 2973552f7358SJed Brown for (part = pStart, q = 0; part < pEnd; ++part) { 2974552f7358SJed Brown PetscInt numPoints, p; 2975552f7358SJed Brown 2976552f7358SJed Brown ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr); 29770d644c17SKarl Rupp for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p]; 2978552f7358SJed Brown ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr); 2979552f7358SJed Brown } 2980552f7358SJed Brown ierr = PetscFree(tmpPoints);CHKERRQ(ierr); 298182f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2982552f7358SJed Brown PetscFunctionReturn(0); 2983552f7358SJed Brown } 2984552f7358SJed Brown 2985552f7358SJed Brown #undef __FUNCT__ 2986552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition" 2987552f7358SJed Brown /* 2988552f7358SJed Brown DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height 2989552f7358SJed Brown 2990552f7358SJed Brown Collective on DM 2991552f7358SJed Brown 2992552f7358SJed Brown Input Parameters: 2993552f7358SJed Brown + dm - The DM 2994552f7358SJed Brown . height - The height for points in the partition 2995552f7358SJed Brown - enlarge - Expand each partition with neighbors 2996552f7358SJed Brown 2997552f7358SJed Brown Output Parameters: 2998552f7358SJed Brown + partSection - The PetscSection giving the division of points by partition 2999552f7358SJed Brown . partition - The list of points by partition 30000298fd71SBarry Smith . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL 30010298fd71SBarry Smith - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL 3002552f7358SJed Brown 3003552f7358SJed Brown Level: developer 3004552f7358SJed Brown 3005552f7358SJed Brown .seealso DMPlexDistribute() 3006552f7358SJed Brown */ 3007ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition) 30080adebc6cSBarry Smith { 3009ac17c9edSMatthew G. Knepley char partname[1024]; 3010ac17c9edSMatthew G. Knepley PetscBool isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg; 3011552f7358SJed Brown PetscMPIInt size; 3012552f7358SJed Brown PetscErrorCode ierr; 3013552f7358SJed Brown 3014552f7358SJed Brown PetscFunctionBegin; 301582f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 30160d644c17SKarl Rupp 30170298fd71SBarry Smith *origPartSection = NULL; 30180298fd71SBarry Smith *origPartition = NULL; 3019552f7358SJed Brown if (size == 1) { 3020552f7358SJed Brown PetscInt *points; 3021552f7358SJed Brown PetscInt cStart, cEnd, c; 3022552f7358SJed Brown 3023552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 302482f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 3025552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr); 3026552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr); 3027552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 3028785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &points);CHKERRQ(ierr); 30290d644c17SKarl Rupp for (c = cStart; c < cEnd; ++c) points[c] = c; 303082f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 3031552f7358SJed Brown PetscFunctionReturn(0); 3032552f7358SJed Brown } 3033ac17c9edSMatthew G. Knepley ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr); 3034ac17c9edSMatthew G. Knepley if (flg) name = partname; 3035ac17c9edSMatthew G. Knepley if (name) { 3036ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr); 3037ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr); 3038ac17c9edSMatthew G. Knepley } 3039552f7358SJed Brown if (height == 0) { 3040552f7358SJed Brown PetscInt numVertices; 30410298fd71SBarry Smith PetscInt *start = NULL; 30420298fd71SBarry Smith PetscInt *adjacency = NULL; 3043552f7358SJed Brown 304477c88f5bSMatthew G Knepley ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr); 3045ac17c9edSMatthew G. Knepley if (!name || isChaco) { 3046519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 3047552f7358SJed Brown ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 3048ac17c9edSMatthew G. Knepley #else 3049ac17c9edSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco."); 3050552f7358SJed Brown #endif 3051ac17c9edSMatthew G. Knepley } else if (isMetis) { 3052519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 3053552f7358SJed Brown ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 3054552f7358SJed Brown #endif 3055ac17c9edSMatthew G. Knepley } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name); 3056552f7358SJed Brown if (enlarge) { 3057552f7358SJed Brown *origPartSection = *partSection; 3058552f7358SJed Brown *origPartition = *partition; 30590d644c17SKarl Rupp 3060552f7358SJed Brown ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr); 3061552f7358SJed Brown } 3062552f7358SJed Brown ierr = PetscFree(start);CHKERRQ(ierr); 3063552f7358SJed Brown ierr = PetscFree(adjacency);CHKERRQ(ierr); 3064552f7358SJed Brown # if 0 3065552f7358SJed Brown } else if (height == 1) { 3066552f7358SJed Brown /* Build the dual graph for faces and partition the hypergraph */ 3067552f7358SJed Brown PetscInt numEdges; 3068552f7358SJed Brown 3069552f7358SJed Brown buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase()); 3070552f7358SJed Brown GraphPartitioner().partition(numEdges, start, adjacency, partition, manager); 3071552f7358SJed Brown destroyCSR(numEdges, start, adjacency); 3072552f7358SJed Brown #endif 307382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height); 3074552f7358SJed Brown PetscFunctionReturn(0); 3075552f7358SJed Brown } 3076552f7358SJed Brown 3077552f7358SJed Brown #undef __FUNCT__ 3078552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure" 30790adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition) 30800adebc6cSBarry Smith { 3081552f7358SJed Brown /* const PetscInt height = 0; */ 3082552f7358SJed Brown const PetscInt *partArray; 3083cb3cb6d9SJed Brown PetscInt *allPoints, *packPoints; 3084cb3cb6d9SJed Brown PetscInt rStart, rEnd, rank, pStart, pEnd, newSize; 3085552f7358SJed Brown PetscErrorCode ierr; 3086cb3cb6d9SJed Brown PetscBT bt; 3087cb3cb6d9SJed Brown PetscSegBuffer segpack,segpart; 3088552f7358SJed Brown 3089552f7358SJed Brown PetscFunctionBegin; 3090552f7358SJed Brown ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr); 3091552f7358SJed Brown ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr); 309282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 3093552f7358SJed Brown ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr); 3094cb3cb6d9SJed Brown ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr); 3095cb3cb6d9SJed Brown ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr); 3096cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr); 3097cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr); 3098552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 3099471ecdacSJed Brown PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints; 3100552f7358SJed Brown 3101552f7358SJed Brown ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr); 3102552f7358SJed Brown ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr); 3103552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 3104552f7358SJed Brown PetscInt point = partArray[offset+p], closureSize, c; 31050298fd71SBarry Smith PetscInt *closure = NULL; 3106552f7358SJed Brown 3107552f7358SJed Brown /* TODO Include support for height > 0 case */ 3108552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3109cb3cb6d9SJed Brown for (c=0; c<closureSize; c++) { 3110cb3cb6d9SJed Brown PetscInt cpoint = closure[c*2]; 3111cb3cb6d9SJed Brown if (!PetscBTLookupSet(bt,cpoint-pStart)) { 3112471ecdacSJed Brown PetscInt *PETSC_RESTRICT pt; 3113cb3cb6d9SJed Brown partSize++; 3114471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr); 3115cb3cb6d9SJed Brown *pt = cpoint; 3116552f7358SJed Brown } 3117cb3cb6d9SJed Brown } 3118552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3119552f7358SJed Brown } 3120552f7358SJed Brown ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr); 3121471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr); 3122471ecdacSJed Brown ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr); 3123471ecdacSJed Brown ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr); 3124471ecdacSJed Brown for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);} 3125552f7358SJed Brown } 3126cb3cb6d9SJed Brown ierr = PetscBTDestroy(&bt);CHKERRQ(ierr); 3127cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr); 3128cb3cb6d9SJed Brown 3129552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3130552f7358SJed Brown ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr); 3131785e854fSJed Brown ierr = PetscMalloc1(newSize, &allPoints);CHKERRQ(ierr); 3132552f7358SJed Brown 3133137cf7b6SJed Brown ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr); 3134552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 3135cb3cb6d9SJed Brown PetscInt numPoints, offset; 3136552f7358SJed Brown 3137cb3cb6d9SJed Brown ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr); 3138cb3cb6d9SJed Brown ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr); 3139cb3cb6d9SJed Brown ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr); 3140cb3cb6d9SJed Brown packPoints += numPoints; 3141552f7358SJed Brown } 3142cb3cb6d9SJed Brown 3143cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr); 3144552f7358SJed Brown ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr); 314582f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 3146552f7358SJed Brown PetscFunctionReturn(0); 3147552f7358SJed Brown } 3148552f7358SJed Brown 3149552f7358SJed Brown #undef __FUNCT__ 3150552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField" 31511858a729SMatthew G. Knepley /*@ 31521858a729SMatthew G. Knepley DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 31531858a729SMatthew G. Knepley 31541858a729SMatthew G. Knepley Collective on DM 31551858a729SMatthew G. Knepley 3156552f7358SJed Brown Input Parameters: 31571858a729SMatthew G. Knepley + dm - The DMPlex object 31581858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 31591858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 31601858a729SMatthew G. Knepley - originalVec - The existing data 3161552f7358SJed Brown 3162552f7358SJed Brown Output Parameters: 31631858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 31641858a729SMatthew G. Knepley - newVec - The new data 31651858a729SMatthew G. Knepley 31661858a729SMatthew G. Knepley Level: developer 31671858a729SMatthew G. Knepley 31681858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData() 31691858a729SMatthew G. Knepley @*/ 3170552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec) 3171552f7358SJed Brown { 3172552f7358SJed Brown PetscSF fieldSF; 3173552f7358SJed Brown PetscInt *remoteOffsets, fieldSize; 3174552f7358SJed Brown PetscScalar *originalValues, *newValues; 3175552f7358SJed Brown PetscErrorCode ierr; 3176552f7358SJed Brown 3177552f7358SJed Brown PetscFunctionBegin; 31781337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3179552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 3180552f7358SJed Brown 3181552f7358SJed Brown ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 3182552f7358SJed Brown ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr); 3183c0dedaeaSBarry Smith ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr); 3184552f7358SJed Brown 3185552f7358SJed Brown ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr); 3186552f7358SJed Brown ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr); 3187552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 3188552f7358SJed Brown ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3189552f7358SJed Brown ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3190552f7358SJed Brown ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 3191552f7358SJed Brown ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr); 3192552f7358SJed Brown ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr); 31931337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3194552f7358SJed Brown PetscFunctionReturn(0); 3195552f7358SJed Brown } 3196552f7358SJed Brown 3197552f7358SJed Brown #undef __FUNCT__ 31981858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData" 31991858a729SMatthew G. Knepley /*@ 32001858a729SMatthew G. Knepley DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 32011858a729SMatthew G. Knepley 32021858a729SMatthew G. Knepley Collective on DM 32031858a729SMatthew G. Knepley 32041858a729SMatthew G. Knepley Input Parameters: 32051858a729SMatthew G. Knepley + dm - The DMPlex object 32061858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 32071858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 32081858a729SMatthew G. Knepley . datatype - The type of data 32091858a729SMatthew G. Knepley - originalData - The existing data 32101858a729SMatthew G. Knepley 32111858a729SMatthew G. Knepley Output Parameters: 32121858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 32131858a729SMatthew G. Knepley - newData - The new data 32141858a729SMatthew G. Knepley 32151858a729SMatthew G. Knepley Level: developer 32161858a729SMatthew G. Knepley 32171858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField() 32181858a729SMatthew G. Knepley @*/ 32191858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData) 32201858a729SMatthew G. Knepley { 32211858a729SMatthew G. Knepley PetscSF fieldSF; 32221858a729SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 32231858a729SMatthew G. Knepley PetscMPIInt dataSize; 32241858a729SMatthew G. Knepley PetscErrorCode ierr; 32251858a729SMatthew G. Knepley 32261858a729SMatthew G. Knepley PetscFunctionBegin; 32271337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 32281858a729SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 32291858a729SMatthew G. Knepley 32301858a729SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 32311858a729SMatthew G. Knepley ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr); 32321858a729SMatthew G. Knepley ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr); 32331858a729SMatthew G. Knepley 32341858a729SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 32351858a729SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 32361858a729SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 32371858a729SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 32381337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 32391858a729SMatthew G. Knepley PetscFunctionReturn(0); 32401858a729SMatthew G. Knepley } 32411858a729SMatthew G. Knepley 32421858a729SMatthew G. Knepley #undef __FUNCT__ 3243552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute" 3244552f7358SJed Brown /*@C 3245552f7358SJed Brown DMPlexDistribute - Distributes the mesh and any associated sections. 3246552f7358SJed Brown 3247552f7358SJed Brown Not Collective 3248552f7358SJed Brown 3249552f7358SJed Brown Input Parameter: 3250552f7358SJed Brown + dm - The original DMPlex object 3251552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default 3252552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default 3253552f7358SJed Brown 3254552f7358SJed Brown Output Parameter: 3255e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution 3256e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL 3257552f7358SJed Brown 32580298fd71SBarry Smith Note: If the mesh was not distributed, the return value is NULL 3259552f7358SJed Brown 3260552f7358SJed Brown Level: intermediate 3261552f7358SJed Brown 3262552f7358SJed Brown .keywords: mesh, elements 3263552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace() 3264552f7358SJed Brown @*/ 3265e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel) 3266552f7358SJed Brown { 3267552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data, *pmesh; 326882f516ccSBarry Smith MPI_Comm comm; 3269552f7358SJed Brown const PetscInt height = 0; 3270552f7358SJed Brown PetscInt dim, numRemoteRanks; 3271057e8d19SMichael Lange IS origCellPart, origPart, cellPart, part; 3272057e8d19SMichael Lange PetscSection origCellPartSection, origPartSection, cellPartSection, partSection; 3273552f7358SJed Brown PetscSFNode *remoteRanks; 3274552f7358SJed Brown PetscSF partSF, pointSF, coneSF; 3275552f7358SJed Brown ISLocalToGlobalMapping renumbering; 3276552f7358SJed Brown PetscSection originalConeSection, newConeSection; 3277552f7358SJed Brown PetscInt *remoteOffsets; 3278552f7358SJed Brown PetscInt *cones, *newCones, newConesSize; 3279552f7358SJed Brown PetscBool flg; 3280552f7358SJed Brown PetscMPIInt rank, numProcs, p; 3281552f7358SJed Brown PetscErrorCode ierr; 3282552f7358SJed Brown 3283552f7358SJed Brown PetscFunctionBegin; 3284552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3285e7ba9e7aSMatthew G. Knepley if (sf) PetscValidPointer(sf,4); 3286e7ba9e7aSMatthew G. Knepley PetscValidPointer(dmParallel,5); 32870d644c17SKarl Rupp 3288552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 328982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3290552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3291552f7358SJed Brown ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr); 32920d644c17SKarl Rupp 32930298fd71SBarry Smith *dmParallel = NULL; 3294552f7358SJed Brown if (numProcs == 1) PetscFunctionReturn(0); 3295552f7358SJed Brown 3296552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3297552f7358SJed Brown /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */ 3298b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 329982f516ccSBarry Smith if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented"); 3300ac17c9edSMatthew G. Knepley ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr); 3301552f7358SJed Brown /* Create SF assuming a serial partition for all processes: Could check for IS length here */ 33020d644c17SKarl Rupp if (!rank) numRemoteRanks = numProcs; 33030d644c17SKarl Rupp else numRemoteRanks = 0; 3304785e854fSJed Brown ierr = PetscMalloc1(numRemoteRanks, &remoteRanks);CHKERRQ(ierr); 3305552f7358SJed Brown for (p = 0; p < numRemoteRanks; ++p) { 3306552f7358SJed Brown remoteRanks[p].rank = p; 3307552f7358SJed Brown remoteRanks[p].index = 0; 3308552f7358SJed Brown } 3309552f7358SJed Brown ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr); 33100298fd71SBarry Smith ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr); 3311552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr); 3312552f7358SJed Brown if (flg) { 3313552f7358SJed Brown ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr); 3314552f7358SJed Brown ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 33150298fd71SBarry Smith ierr = ISView(cellPart, NULL);CHKERRQ(ierr); 3316552f7358SJed Brown if (origCellPart) { 3317552f7358SJed Brown ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr); 3318552f7358SJed Brown ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 33190298fd71SBarry Smith ierr = ISView(origCellPart, NULL);CHKERRQ(ierr); 3320552f7358SJed Brown } 33210298fd71SBarry Smith ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr); 3322552f7358SJed Brown } 3323552f7358SJed Brown /* Close the partition over the mesh */ 3324552f7358SJed Brown ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr); 3325552f7358SJed Brown ierr = ISDestroy(&cellPart);CHKERRQ(ierr); 3326552f7358SJed Brown ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr); 3327552f7358SJed Brown /* Create new mesh */ 3328552f7358SJed Brown ierr = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr); 3329552f7358SJed Brown ierr = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr); 3330552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr); 3331552f7358SJed Brown pmesh = (DM_Plex*) (*dmParallel)->data; 3332552f7358SJed Brown /* Distribute sieve points and the global point numbering (replaces creating remote bases) */ 3333552f7358SJed Brown ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr); 3334552f7358SJed Brown if (flg) { 3335552f7358SJed Brown ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr); 3336552f7358SJed Brown ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 33370298fd71SBarry Smith ierr = ISView(part, NULL);CHKERRQ(ierr); 33380298fd71SBarry Smith ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr); 3339552f7358SJed Brown ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr); 33400298fd71SBarry Smith ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr); 3341552f7358SJed Brown } 3342b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 33431337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3344552f7358SJed Brown /* Distribute cone section */ 3345552f7358SJed Brown ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr); 3346552f7358SJed Brown ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr); 3347552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr); 3348552f7358SJed Brown ierr = DMSetUp(*dmParallel);CHKERRQ(ierr); 3349552f7358SJed Brown { 3350552f7358SJed Brown PetscInt pStart, pEnd, p; 3351552f7358SJed Brown 3352552f7358SJed Brown ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr); 3353552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3354552f7358SJed Brown PetscInt coneSize; 3355552f7358SJed Brown ierr = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr); 3356552f7358SJed Brown pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize); 3357552f7358SJed Brown } 3358552f7358SJed Brown } 3359552f7358SJed Brown /* Communicate and renumber cones */ 3360552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr); 3361552f7358SJed Brown ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr); 3362552f7358SJed Brown ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr); 3363552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3364552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3365552f7358SJed Brown ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr); 33660298fd71SBarry Smith ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr); 3367552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr); 3368552f7358SJed Brown if (flg) { 3369552f7358SJed Brown ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr); 3370552f7358SJed Brown ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 3371552f7358SJed Brown ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr); 3372552f7358SJed Brown ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 33730298fd71SBarry Smith ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr); 3374552f7358SJed Brown } 3375552f7358SJed Brown ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr); 3376552f7358SJed Brown ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr); 3377552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3378552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3379552f7358SJed Brown ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr); 33801337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3381552f7358SJed Brown /* Create supports and stratify sieve */ 3382552f7358SJed Brown { 3383552f7358SJed Brown PetscInt pStart, pEnd; 3384552f7358SJed Brown 3385552f7358SJed Brown ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 3386552f7358SJed Brown ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 3387552f7358SJed Brown } 3388552f7358SJed Brown ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr); 3389552f7358SJed Brown ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr); 3390552f7358SJed Brown /* Distribute Coordinates */ 3391552f7358SJed Brown { 3392552f7358SJed Brown PetscSection originalCoordSection, newCoordSection; 3393552f7358SJed Brown Vec originalCoordinates, newCoordinates; 3394552f7358SJed Brown const char *name; 3395552f7358SJed Brown 339669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr); 339769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr); 3398552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr); 3399552f7358SJed Brown ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr); 3400552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr); 3401552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr); 3402552f7358SJed Brown 3403552f7358SJed Brown ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr); 3404552f7358SJed Brown ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr); 3405552f7358SJed Brown ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 3406552f7358SJed Brown } 3407552f7358SJed Brown /* Distribute labels */ 3408b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 3409552f7358SJed Brown { 3410552f7358SJed Brown DMLabel next = mesh->labels, newNext = pmesh->labels; 3411552f7358SJed Brown PetscInt numLabels = 0, l; 3412552f7358SJed Brown 3413552f7358SJed Brown /* Bcast number of labels */ 341420cb08bdSMatthew G. Knepley while (next) {++numLabels; next = next->next;} 3415552f7358SJed Brown ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3416552f7358SJed Brown next = mesh->labels; 3417552f7358SJed Brown for (l = 0; l < numLabels; ++l) { 341820cb08bdSMatthew G. Knepley DMLabel labelNew; 3419552f7358SJed Brown PetscBool isdepth; 3420552f7358SJed Brown 342120cb08bdSMatthew G. Knepley /* Skip "depth" because it is recreated */ 342220cb08bdSMatthew G. Knepley if (!rank) {ierr = PetscStrcmp(next->name, "depth", &isdepth);CHKERRQ(ierr);} 342320cb08bdSMatthew G. Knepley ierr = MPI_Bcast(&isdepth, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 342420cb08bdSMatthew G. Knepley if (isdepth) {if (!rank) next = next->next; continue;} 342520cb08bdSMatthew G. Knepley ierr = DMLabelDistribute(next, partSection, part, renumbering, &labelNew);CHKERRQ(ierr); 3426552f7358SJed Brown /* Insert into list */ 342720cb08bdSMatthew G. Knepley if (newNext) newNext->next = labelNew; 342820cb08bdSMatthew G. Knepley else pmesh->labels = labelNew; 342920cb08bdSMatthew G. Knepley newNext = labelNew; 34300d644c17SKarl Rupp if (!rank) next = next->next; 3431552f7358SJed Brown } 3432552f7358SJed Brown } 3433b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 34345a9d0af9SMatthew G. Knepley /* Setup hybrid structure */ 34355a9d0af9SMatthew G. Knepley { 34365a9d0af9SMatthew G. Knepley const PetscInt *gpoints; 34375a9d0af9SMatthew G. Knepley PetscInt depth, n, d; 34385a9d0af9SMatthew G. Knepley 34395a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];} 34405a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr); 34415a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr); 34425a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr); 34435a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 34445a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 34455a9d0af9SMatthew G. Knepley PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p; 34465a9d0af9SMatthew G. Knepley 34475a9d0af9SMatthew G. Knepley if (pmax < 0) continue; 34485a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr); 34496dfbe1fcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr); 34505a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr); 34515a9d0af9SMatthew G. Knepley for (p = 0; p < n; ++p) { 34525a9d0af9SMatthew G. Knepley const PetscInt point = gpoints[p]; 34535a9d0af9SMatthew G. Knepley 34545a9d0af9SMatthew G. Knepley if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax; 34555a9d0af9SMatthew G. Knepley } 34565a9d0af9SMatthew G. Knepley if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax; 34575a9d0af9SMatthew G. Knepley else pmesh->hybridPointMax[d] = -1; 34585a9d0af9SMatthew G. Knepley } 34595a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr); 34605a9d0af9SMatthew G. Knepley } 3461552f7358SJed Brown /* Cleanup Partition */ 3462552f7358SJed Brown ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr); 3463552f7358SJed Brown ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr); 3464552f7358SJed Brown ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr); 3465552f7358SJed Brown ierr = ISDestroy(&part);CHKERRQ(ierr); 3466552f7358SJed Brown /* Create point SF for parallel mesh */ 3467b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3468552f7358SJed Brown { 3469552f7358SJed Brown const PetscInt *leaves; 3470552f7358SJed Brown PetscSFNode *remotePoints, *rowners, *lowners; 3471552f7358SJed Brown PetscInt numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints; 3472552f7358SJed Brown PetscInt pStart, pEnd; 3473552f7358SJed Brown 3474552f7358SJed Brown ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr); 34750298fd71SBarry Smith ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr); 3476dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&rowners,numLeaves,&lowners);CHKERRQ(ierr); 3477552f7358SJed Brown for (p=0; p<numRoots; p++) { 3478552f7358SJed Brown rowners[p].rank = -1; 3479552f7358SJed Brown rowners[p].index = -1; 3480552f7358SJed Brown } 3481552f7358SJed Brown if (origCellPart) { 3482057e8d19SMichael Lange /* Make sure points in the original partition are not assigned to other procs */ 3483057e8d19SMichael Lange const PetscInt *origPoints; 3484552f7358SJed Brown 3485057e8d19SMichael Lange ierr = DMPlexCreatePartitionClosure(dm, origCellPartSection, origCellPart, &origPartSection, &origPart);CHKERRQ(ierr); 3486057e8d19SMichael Lange ierr = ISGetIndices(origPart, &origPoints);CHKERRQ(ierr); 3487552f7358SJed Brown for (p = 0; p < numProcs; ++p) { 3488552f7358SJed Brown PetscInt dof, off, d; 3489552f7358SJed Brown 3490057e8d19SMichael Lange ierr = PetscSectionGetDof(origPartSection, p, &dof);CHKERRQ(ierr); 3491057e8d19SMichael Lange ierr = PetscSectionGetOffset(origPartSection, p, &off);CHKERRQ(ierr); 3492552f7358SJed Brown for (d = off; d < off+dof; ++d) { 3493057e8d19SMichael Lange rowners[origPoints[d]].rank = p; 3494552f7358SJed Brown } 3495552f7358SJed Brown } 3496057e8d19SMichael Lange ierr = ISRestoreIndices(origPart, &origPoints);CHKERRQ(ierr); 3497057e8d19SMichael Lange ierr = ISDestroy(&origPart);CHKERRQ(ierr); 3498057e8d19SMichael Lange ierr = PetscSectionDestroy(&origPartSection);CHKERRQ(ierr); 3499552f7358SJed Brown } 3500552f7358SJed Brown ierr = ISDestroy(&origCellPart);CHKERRQ(ierr); 3501552f7358SJed Brown ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr); 3502552f7358SJed Brown 3503552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3504552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3505552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3506552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */ 3507552f7358SJed Brown lowners[p].rank = rank; 3508552f7358SJed Brown lowners[p].index = leaves ? leaves[p] : p; 3509552f7358SJed Brown } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */ 3510552f7358SJed Brown lowners[p].rank = -2; 3511552f7358SJed Brown lowners[p].index = -2; 3512552f7358SJed Brown } 3513552f7358SJed Brown } 3514552f7358SJed Brown for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */ 3515552f7358SJed Brown rowners[p].rank = -3; 3516552f7358SJed Brown rowners[p].index = -3; 3517552f7358SJed Brown } 3518552f7358SJed Brown ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3519552f7358SJed Brown ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3520552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3521552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3522552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3523552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed"); 3524552f7358SJed Brown if (lowners[p].rank != rank) ++numGhostPoints; 3525552f7358SJed Brown } 3526785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &ghostPoints);CHKERRQ(ierr); 3527785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &remotePoints);CHKERRQ(ierr); 3528552f7358SJed Brown for (p = 0, gp = 0; p < numLeaves; ++p) { 3529552f7358SJed Brown if (lowners[p].rank != rank) { 3530552f7358SJed Brown ghostPoints[gp] = leaves ? leaves[p] : p; 3531552f7358SJed Brown remotePoints[gp].rank = lowners[p].rank; 3532552f7358SJed Brown remotePoints[gp].index = lowners[p].index; 3533552f7358SJed Brown ++gp; 3534552f7358SJed Brown } 3535552f7358SJed Brown } 3536552f7358SJed Brown ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr); 3537552f7358SJed Brown ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3538552f7358SJed Brown ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr); 3539552f7358SJed Brown } 3540b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3541552f7358SJed Brown /* Cleanup */ 3542e7ba9e7aSMatthew G. Knepley if (sf) {*sf = pointSF;} 3543e7ba9e7aSMatthew G. Knepley else {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);} 3544552f7358SJed Brown ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr); 3545552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 3546552f7358SJed Brown PetscFunctionReturn(0); 3547552f7358SJed Brown } 3548552f7358SJed Brown 35492e1b13c2SMatthew G. Knepley #undef __FUNCT__ 35509db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 35519db3b87dSMatthew G. Knepley /*@C 35529db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 35539db3b87dSMatthew G. Knepley 35549db3b87dSMatthew G. Knepley Input Parameters: 35559db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 35569db3b87dSMatthew G. Knepley - cone - The incoming cone 35579db3b87dSMatthew G. Knepley 35589db3b87dSMatthew G. Knepley Output Parameter: 35599db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 35609db3b87dSMatthew G. Knepley 35619db3b87dSMatthew G. Knepley Level: developer 35629db3b87dSMatthew G. Knepley 35639db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 35649db3b87dSMatthew G. Knepley @*/ 35659db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 35662e1b13c2SMatthew G. Knepley { 35679db3b87dSMatthew G. Knepley int tmpc; 35682e1b13c2SMatthew G. Knepley 35692e1b13c2SMatthew G. Knepley PetscFunctionBegin; 35709db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 35719db3b87dSMatthew G. Knepley switch (numCorners) { 35729db3b87dSMatthew G. Knepley case 4: 35731885f254SMatthew G. Knepley tmpc = cone[0]; 35741885f254SMatthew G. Knepley cone[0] = cone[1]; 35751885f254SMatthew G. Knepley cone[1] = tmpc; 35769db3b87dSMatthew G. Knepley break; 35779db3b87dSMatthew G. Knepley case 8: 35789db3b87dSMatthew G. Knepley tmpc = cone[1]; 35799db3b87dSMatthew G. Knepley cone[1] = cone[3]; 35809db3b87dSMatthew G. Knepley cone[3] = tmpc; 35819db3b87dSMatthew G. Knepley break; 35829db3b87dSMatthew G. Knepley default: break; 35839db3b87dSMatthew G. Knepley } 35849db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 35859db3b87dSMatthew G. Knepley } 35869db3b87dSMatthew G. Knepley 35879db3b87dSMatthew G. Knepley #undef __FUNCT__ 35889db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 35899db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 35909db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 35919db3b87dSMatthew G. Knepley { 35929db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 35939db3b87dSMatthew G. Knepley PetscErrorCode ierr; 35949db3b87dSMatthew G. Knepley 35959db3b87dSMatthew G. Knepley PetscFunctionBegin; 35969db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 35979db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 35982e1b13c2SMatthew G. Knepley } 35992e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 36002e1b13c2SMatthew G. Knepley } 36012e1b13c2SMatthew G. Knepley 3602519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3603552f7358SJed Brown #include <triangle.h> 3604552f7358SJed Brown 3605552f7358SJed Brown #undef __FUNCT__ 3606552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 36070adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 36080adebc6cSBarry Smith { 3609552f7358SJed Brown PetscFunctionBegin; 3610552f7358SJed Brown inputCtx->numberofpoints = 0; 3611552f7358SJed Brown inputCtx->numberofpointattributes = 0; 36120298fd71SBarry Smith inputCtx->pointlist = NULL; 36130298fd71SBarry Smith inputCtx->pointattributelist = NULL; 36140298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 3615552f7358SJed Brown inputCtx->numberofsegments = 0; 36160298fd71SBarry Smith inputCtx->segmentlist = NULL; 36170298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 3618552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 36190298fd71SBarry Smith inputCtx->trianglelist = NULL; 3620552f7358SJed Brown inputCtx->numberofholes = 0; 36210298fd71SBarry Smith inputCtx->holelist = NULL; 3622552f7358SJed Brown inputCtx->numberofregions = 0; 36230298fd71SBarry Smith inputCtx->regionlist = NULL; 3624552f7358SJed Brown PetscFunctionReturn(0); 3625552f7358SJed Brown } 3626552f7358SJed Brown 3627552f7358SJed Brown #undef __FUNCT__ 3628552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 36290adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 36300adebc6cSBarry Smith { 3631552f7358SJed Brown PetscFunctionBegin; 3632552f7358SJed Brown outputCtx->numberofpoints = 0; 36330298fd71SBarry Smith outputCtx->pointlist = NULL; 36340298fd71SBarry Smith outputCtx->pointattributelist = NULL; 36350298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 3636552f7358SJed Brown outputCtx->numberoftriangles = 0; 36370298fd71SBarry Smith outputCtx->trianglelist = NULL; 36380298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 36390298fd71SBarry Smith outputCtx->neighborlist = NULL; 36400298fd71SBarry Smith outputCtx->segmentlist = NULL; 36410298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 3642552f7358SJed Brown outputCtx->numberofedges = 0; 36430298fd71SBarry Smith outputCtx->edgelist = NULL; 36440298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 3645552f7358SJed Brown PetscFunctionReturn(0); 3646552f7358SJed Brown } 3647552f7358SJed Brown 3648552f7358SJed Brown #undef __FUNCT__ 3649552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 36500adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 36510adebc6cSBarry Smith { 3652552f7358SJed Brown PetscFunctionBegin; 365323b0c128SMatthew G. Knepley free(outputCtx->pointlist); 3654552f7358SJed Brown free(outputCtx->pointmarkerlist); 365523b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 365623b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 3657552f7358SJed Brown free(outputCtx->edgelist); 3658552f7358SJed Brown free(outputCtx->edgemarkerlist); 3659552f7358SJed Brown free(outputCtx->trianglelist); 3660552f7358SJed Brown free(outputCtx->neighborlist); 3661552f7358SJed Brown PetscFunctionReturn(0); 3662552f7358SJed Brown } 3663552f7358SJed Brown 3664552f7358SJed Brown #undef __FUNCT__ 3665552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 3666552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 3667552f7358SJed Brown { 366882f516ccSBarry Smith MPI_Comm comm; 3669552f7358SJed Brown PetscInt dim = 2; 3670552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 3671552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 3672552f7358SJed Brown struct triangulateio in; 3673552f7358SJed Brown struct triangulateio out; 3674552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 3675552f7358SJed Brown PetscMPIInt rank; 3676552f7358SJed Brown PetscErrorCode ierr; 3677552f7358SJed Brown 3678552f7358SJed Brown PetscFunctionBegin; 367982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3680552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3681552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3682552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3683552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 36840d644c17SKarl Rupp 3685552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3686552f7358SJed Brown if (in.numberofpoints > 0) { 3687552f7358SJed Brown PetscSection coordSection; 3688552f7358SJed Brown Vec coordinates; 3689552f7358SJed Brown PetscScalar *array; 3690552f7358SJed Brown 3691785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3692785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3693552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 369469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3695552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3696552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3697552f7358SJed Brown const PetscInt idx = v - vStart; 3698552f7358SJed Brown PetscInt off, d; 3699552f7358SJed Brown 3700552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3701552f7358SJed Brown for (d = 0; d < dim; ++d) { 3702552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3703552f7358SJed Brown } 3704552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3705552f7358SJed Brown } 3706552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3707552f7358SJed Brown } 3708552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 3709552f7358SJed Brown in.numberofsegments = eEnd - eStart; 3710552f7358SJed Brown if (in.numberofsegments > 0) { 3711785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 3712785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 3713552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 3714552f7358SJed Brown const PetscInt idx = e - eStart; 3715552f7358SJed Brown const PetscInt *cone; 3716552f7358SJed Brown 3717552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 37180d644c17SKarl Rupp 3719552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 3720552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 37210d644c17SKarl Rupp 3722552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 3723552f7358SJed Brown } 3724552f7358SJed Brown } 3725552f7358SJed Brown #if 0 /* Do not currently support holes */ 3726552f7358SJed Brown PetscReal *holeCoords; 3727552f7358SJed Brown PetscInt h, d; 3728552f7358SJed Brown 3729552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3730552f7358SJed Brown if (in.numberofholes > 0) { 3731785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3732552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3733552f7358SJed Brown for (d = 0; d < dim; ++d) { 3734552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3735552f7358SJed Brown } 3736552f7358SJed Brown } 3737552f7358SJed Brown } 3738552f7358SJed Brown #endif 3739552f7358SJed Brown if (!rank) { 3740552f7358SJed Brown char args[32]; 3741552f7358SJed Brown 3742552f7358SJed Brown /* Take away 'Q' for verbose output */ 3743552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3744552f7358SJed Brown if (createConvexHull) { 3745552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 3746552f7358SJed Brown } 3747552f7358SJed Brown if (constrained) { 3748552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 3749552f7358SJed Brown } 37500298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3751552f7358SJed Brown } 3752552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3753552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3754552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3755552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3756552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 3757552f7358SJed Brown 3758552f7358SJed Brown { 3759552f7358SJed Brown const PetscInt numCorners = 3; 3760552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3761552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3762552f7358SJed Brown const int *cells = out.trianglelist; 3763552f7358SJed Brown const double *meshCoords = out.pointlist; 3764552f7358SJed Brown 37650fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3766552f7358SJed Brown /* Set labels */ 3767552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3768552f7358SJed Brown if (out.pointmarkerlist[v]) { 3769552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3770552f7358SJed Brown } 3771552f7358SJed Brown } 3772552f7358SJed Brown if (interpolate) { 3773552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3774552f7358SJed Brown if (out.edgemarkerlist[e]) { 3775552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3776552f7358SJed Brown const PetscInt *edges; 3777552f7358SJed Brown PetscInt numEdges; 3778552f7358SJed Brown 3779552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3780552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3781552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3782552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3783552f7358SJed Brown } 3784552f7358SJed Brown } 3785552f7358SJed Brown } 3786552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3787552f7358SJed Brown } 3788552f7358SJed Brown #if 0 /* Do not currently support holes */ 3789552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3790552f7358SJed Brown #endif 3791552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3792552f7358SJed Brown PetscFunctionReturn(0); 3793552f7358SJed Brown } 3794552f7358SJed Brown 3795552f7358SJed Brown #undef __FUNCT__ 3796552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 3797552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 3798552f7358SJed Brown { 379982f516ccSBarry Smith MPI_Comm comm; 3800552f7358SJed Brown PetscInt dim = 2; 3801552f7358SJed Brown struct triangulateio in; 3802552f7358SJed Brown struct triangulateio out; 3803552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3804552f7358SJed Brown PetscMPIInt rank; 3805552f7358SJed Brown PetscErrorCode ierr; 3806552f7358SJed Brown 3807552f7358SJed Brown PetscFunctionBegin; 380882f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3809552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3810552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3811552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3812552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3813552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3814552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 38150d644c17SKarl Rupp 3816552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3817552f7358SJed Brown if (in.numberofpoints > 0) { 3818552f7358SJed Brown PetscSection coordSection; 3819552f7358SJed Brown Vec coordinates; 3820552f7358SJed Brown PetscScalar *array; 3821552f7358SJed Brown 3822785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3823785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3824552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 382569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3826552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3827552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3828552f7358SJed Brown const PetscInt idx = v - vStart; 3829552f7358SJed Brown PetscInt off, d; 3830552f7358SJed Brown 3831552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3832552f7358SJed Brown for (d = 0; d < dim; ++d) { 3833552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3834552f7358SJed Brown } 3835552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3836552f7358SJed Brown } 3837552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3838552f7358SJed Brown } 3839552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 38400d644c17SKarl Rupp 3841552f7358SJed Brown in.numberofcorners = 3; 3842552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 38430d644c17SKarl Rupp 3844552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 3845552f7358SJed Brown if (in.numberoftriangles > 0) { 3846785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 3847552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3848552f7358SJed Brown const PetscInt idx = c - cStart; 38490298fd71SBarry Smith PetscInt *closure = NULL; 3850552f7358SJed Brown PetscInt closureSize; 3851552f7358SJed Brown 3852552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3853552f7358SJed 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); 3854552f7358SJed Brown for (v = 0; v < 3; ++v) { 3855552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 3856552f7358SJed Brown } 3857552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3858552f7358SJed Brown } 3859552f7358SJed Brown } 3860552f7358SJed Brown /* TODO: Segment markers are missing on input */ 3861552f7358SJed Brown #if 0 /* Do not currently support holes */ 3862552f7358SJed Brown PetscReal *holeCoords; 3863552f7358SJed Brown PetscInt h, d; 3864552f7358SJed Brown 3865552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3866552f7358SJed Brown if (in.numberofholes > 0) { 3867785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3868552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3869552f7358SJed Brown for (d = 0; d < dim; ++d) { 3870552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3871552f7358SJed Brown } 3872552f7358SJed Brown } 3873552f7358SJed Brown } 3874552f7358SJed Brown #endif 3875552f7358SJed Brown if (!rank) { 3876552f7358SJed Brown char args[32]; 3877552f7358SJed Brown 3878552f7358SJed Brown /* Take away 'Q' for verbose output */ 3879552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 38800298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3881552f7358SJed Brown } 3882552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3883552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3884552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3885552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3886552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3887552f7358SJed Brown 3888552f7358SJed Brown { 3889552f7358SJed Brown const PetscInt numCorners = 3; 3890552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3891552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3892552f7358SJed Brown const int *cells = out.trianglelist; 3893552f7358SJed Brown const double *meshCoords = out.pointlist; 3894552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3895552f7358SJed Brown 38960fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3897552f7358SJed Brown /* Set labels */ 3898552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3899552f7358SJed Brown if (out.pointmarkerlist[v]) { 3900552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3901552f7358SJed Brown } 3902552f7358SJed Brown } 3903552f7358SJed Brown if (interpolate) { 3904552f7358SJed Brown PetscInt e; 3905552f7358SJed Brown 3906552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3907552f7358SJed Brown if (out.edgemarkerlist[e]) { 3908552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3909552f7358SJed Brown const PetscInt *edges; 3910552f7358SJed Brown PetscInt numEdges; 3911552f7358SJed Brown 3912552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3913552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3914552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3915552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3916552f7358SJed Brown } 3917552f7358SJed Brown } 3918552f7358SJed Brown } 3919552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3920552f7358SJed Brown } 3921552f7358SJed Brown #if 0 /* Do not currently support holes */ 3922552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3923552f7358SJed Brown #endif 3924552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3925552f7358SJed Brown PetscFunctionReturn(0); 3926552f7358SJed Brown } 3927552f7358SJed Brown #endif 3928552f7358SJed Brown 3929519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3930552f7358SJed Brown #include <tetgen.h> 3931552f7358SJed Brown #undef __FUNCT__ 3932552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3933552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3934552f7358SJed Brown { 393582f516ccSBarry Smith MPI_Comm comm; 3936552f7358SJed Brown const PetscInt dim = 3; 3937552f7358SJed Brown ::tetgenio in; 3938552f7358SJed Brown ::tetgenio out; 3939552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3940552f7358SJed Brown PetscMPIInt rank; 3941552f7358SJed Brown PetscErrorCode ierr; 3942552f7358SJed Brown 3943552f7358SJed Brown PetscFunctionBegin; 394482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3945552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3946552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3947552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3948552f7358SJed Brown if (in.numberofpoints > 0) { 3949552f7358SJed Brown PetscSection coordSection; 3950552f7358SJed Brown Vec coordinates; 3951552f7358SJed Brown PetscScalar *array; 3952552f7358SJed Brown 3953552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3954552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 39550d644c17SKarl Rupp 3956552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 395769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3958552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3959552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3960552f7358SJed Brown const PetscInt idx = v - vStart; 3961552f7358SJed Brown PetscInt off, d; 3962552f7358SJed Brown 3963552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 39640d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3965552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3966552f7358SJed Brown } 3967552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3968552f7358SJed Brown } 3969552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 39700d644c17SKarl Rupp 3971552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3972552f7358SJed Brown if (in.numberoffacets > 0) { 3973552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3974552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3975552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3976552f7358SJed Brown const PetscInt idx = f - fStart; 39770298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3978552f7358SJed Brown 3979552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3980552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3981552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3982552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3983552f7358SJed Brown 3984552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3985552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3986552f7358SJed Brown const PetscInt point = points[p]; 39870d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3988552f7358SJed Brown } 3989552f7358SJed Brown 3990552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3991552f7358SJed Brown poly->numberofvertices = numVertices; 3992552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3993552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3994552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3995552f7358SJed Brown poly->vertexlist[v] = vIdx; 3996552f7358SJed Brown } 3997552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3998552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3999552f7358SJed Brown } 4000552f7358SJed Brown } 4001552f7358SJed Brown if (!rank) { 4002552f7358SJed Brown char args[32]; 4003552f7358SJed Brown 4004552f7358SJed Brown /* Take away 'Q' for verbose output */ 4005552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 4006552f7358SJed Brown ::tetrahedralize(args, &in, &out); 4007552f7358SJed Brown } 4008552f7358SJed Brown { 4009552f7358SJed Brown const PetscInt numCorners = 4; 4010552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 4011552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 4012552f7358SJed Brown const double *meshCoords = out.pointlist; 40131d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 4014552f7358SJed Brown 40159db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 40160fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 4017552f7358SJed Brown /* Set labels */ 4018552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4019552f7358SJed Brown if (out.pointmarkerlist[v]) { 4020552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 4021552f7358SJed Brown } 4022552f7358SJed Brown } 4023552f7358SJed Brown if (interpolate) { 4024552f7358SJed Brown PetscInt e; 4025552f7358SJed Brown 4026552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 4027552f7358SJed Brown if (out.edgemarkerlist[e]) { 4028552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 4029552f7358SJed Brown const PetscInt *edges; 4030552f7358SJed Brown PetscInt numEdges; 4031552f7358SJed Brown 4032552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4033552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4034552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 4035552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4036552f7358SJed Brown } 4037552f7358SJed Brown } 4038552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 4039552f7358SJed Brown if (out.trifacemarkerlist[f]) { 4040552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 4041552f7358SJed Brown const PetscInt *faces; 4042552f7358SJed Brown PetscInt numFaces; 4043552f7358SJed Brown 4044552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4045552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4046552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 4047552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4048552f7358SJed Brown } 4049552f7358SJed Brown } 4050552f7358SJed Brown } 4051552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 4052552f7358SJed Brown } 4053552f7358SJed Brown PetscFunctionReturn(0); 4054552f7358SJed Brown } 4055552f7358SJed Brown 4056552f7358SJed Brown #undef __FUNCT__ 4057552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 4058552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 4059552f7358SJed Brown { 406082f516ccSBarry Smith MPI_Comm comm; 4061552f7358SJed Brown const PetscInt dim = 3; 4062552f7358SJed Brown ::tetgenio in; 4063552f7358SJed Brown ::tetgenio out; 4064552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 4065552f7358SJed Brown PetscMPIInt rank; 4066552f7358SJed Brown PetscErrorCode ierr; 4067552f7358SJed Brown 4068552f7358SJed Brown PetscFunctionBegin; 406982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 4070552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4071552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4072552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 4073552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 40740d644c17SKarl Rupp 4075552f7358SJed Brown in.numberofpoints = vEnd - vStart; 4076552f7358SJed Brown if (in.numberofpoints > 0) { 4077552f7358SJed Brown PetscSection coordSection; 4078552f7358SJed Brown Vec coordinates; 4079552f7358SJed Brown PetscScalar *array; 4080552f7358SJed Brown 4081552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 4082552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 40830d644c17SKarl Rupp 4084552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 408569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 4086552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4087552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4088552f7358SJed Brown const PetscInt idx = v - vStart; 4089552f7358SJed Brown PetscInt off, d; 4090552f7358SJed Brown 4091552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 40920d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 4093552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 4094552f7358SJed Brown } 4095552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4096552f7358SJed Brown } 4097552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 40980d644c17SKarl Rupp 4099552f7358SJed Brown in.numberofcorners = 4; 4100552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 4101552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 4102552f7358SJed Brown if (in.numberoftetrahedra > 0) { 4103552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 4104552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4105552f7358SJed Brown const PetscInt idx = c - cStart; 41060298fd71SBarry Smith PetscInt *closure = NULL; 4107552f7358SJed Brown PetscInt closureSize; 4108552f7358SJed Brown 4109552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4110552f7358SJed 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); 4111552f7358SJed Brown for (v = 0; v < 4; ++v) { 4112552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4113552f7358SJed Brown } 4114552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4115552f7358SJed Brown } 4116552f7358SJed Brown } 411719436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 4118552f7358SJed Brown if (!rank) { 4119552f7358SJed Brown char args[32]; 4120552f7358SJed Brown 4121552f7358SJed Brown /* Take away 'Q' for verbose output */ 412219436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 4123552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 4124552f7358SJed Brown ::tetrahedralize(args, &in, &out); 4125552f7358SJed Brown } 4126552f7358SJed Brown in.tetrahedronvolumelist = NULL; 4127552f7358SJed Brown 4128552f7358SJed Brown { 4129552f7358SJed Brown const PetscInt numCorners = 4; 4130552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 4131552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 4132552f7358SJed Brown const double *meshCoords = out.pointlist; 41331d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 41341d4b4d7bSJed Brown 4135552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4136552f7358SJed Brown 41379db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 41380fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4139552f7358SJed Brown /* Set labels */ 4140552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4141552f7358SJed Brown if (out.pointmarkerlist[v]) { 4142552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 4143552f7358SJed Brown } 4144552f7358SJed Brown } 4145552f7358SJed Brown if (interpolate) { 4146552f7358SJed Brown PetscInt e, f; 4147552f7358SJed Brown 4148552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 4149552f7358SJed Brown if (out.edgemarkerlist[e]) { 4150552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 4151552f7358SJed Brown const PetscInt *edges; 4152552f7358SJed Brown PetscInt numEdges; 4153552f7358SJed Brown 4154552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4155552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4156552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 4157552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4158552f7358SJed Brown } 4159552f7358SJed Brown } 4160552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 4161552f7358SJed Brown if (out.trifacemarkerlist[f]) { 4162552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 4163552f7358SJed Brown const PetscInt *faces; 4164552f7358SJed Brown PetscInt numFaces; 4165552f7358SJed Brown 4166552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4167552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4168552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 4169552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4170552f7358SJed Brown } 4171552f7358SJed Brown } 4172552f7358SJed Brown } 4173552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4174552f7358SJed Brown } 4175552f7358SJed Brown PetscFunctionReturn(0); 4176552f7358SJed Brown } 4177552f7358SJed Brown #endif 4178552f7358SJed Brown 4179519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4180aaa7dc30SBarry Smith #include <ctetgen.h> 4181552f7358SJed Brown 4182552f7358SJed Brown #undef __FUNCT__ 4183552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 4184552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 4185552f7358SJed Brown { 418682f516ccSBarry Smith MPI_Comm comm; 4187552f7358SJed Brown const PetscInt dim = 3; 4188552f7358SJed Brown PLC *in, *out; 4189552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 4190552f7358SJed Brown PetscMPIInt rank; 4191552f7358SJed Brown PetscErrorCode ierr; 4192552f7358SJed Brown 4193552f7358SJed Brown PetscFunctionBegin; 419482f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 41950298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4196552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4197552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 4198552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4199552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 42000d644c17SKarl Rupp 4201552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4202552f7358SJed Brown if (in->numberofpoints > 0) { 4203552f7358SJed Brown PetscSection coordSection; 4204552f7358SJed Brown Vec coordinates; 4205552f7358SJed Brown PetscScalar *array; 4206552f7358SJed Brown 4207785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4208785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4209552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 421069d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 4211552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4212552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4213552f7358SJed Brown const PetscInt idx = v - vStart; 4214552f7358SJed Brown PetscInt off, d, m; 4215552f7358SJed Brown 4216552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4217552f7358SJed Brown for (d = 0; d < dim; ++d) { 4218552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4219552f7358SJed Brown } 4220552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 42210d644c17SKarl Rupp 4222552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4223552f7358SJed Brown } 4224552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4225552f7358SJed Brown } 4226552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 42270d644c17SKarl Rupp 4228552f7358SJed Brown in->numberoffacets = fEnd - fStart; 4229552f7358SJed Brown if (in->numberoffacets > 0) { 4230785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 4231785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 4232552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 4233552f7358SJed Brown const PetscInt idx = f - fStart; 42340298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 4235552f7358SJed Brown polygon *poly; 4236552f7358SJed Brown 4237552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 42380d644c17SKarl Rupp 4239785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 42400d644c17SKarl Rupp 4241552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 42420298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 4243552f7358SJed Brown 4244552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4245552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4246552f7358SJed Brown const PetscInt point = points[p]; 42470d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 4248552f7358SJed Brown } 4249552f7358SJed Brown 4250552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 4251552f7358SJed Brown poly->numberofvertices = numVertices; 4252785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 4253552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4254552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 4255552f7358SJed Brown poly->vertexlist[v] = vIdx; 4256552f7358SJed Brown } 4257552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 4258552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 4259552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4260552f7358SJed Brown } 4261552f7358SJed Brown } 4262552f7358SJed Brown if (!rank) { 4263552f7358SJed Brown TetGenOpts t; 4264552f7358SJed Brown 4265552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 4266552f7358SJed Brown t.in = boundary; /* Should go away */ 4267552f7358SJed Brown t.plc = 1; 4268552f7358SJed Brown t.quality = 1; 4269552f7358SJed Brown t.edgesout = 1; 4270552f7358SJed Brown t.zeroindex = 1; 4271552f7358SJed Brown t.quiet = 1; 4272552f7358SJed Brown t.verbose = verbose; 4273552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4274552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4275552f7358SJed Brown } 4276552f7358SJed Brown { 4277552f7358SJed Brown const PetscInt numCorners = 4; 4278552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4279552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4280552f7358SJed Brown const double *meshCoords = out->pointlist; 42811d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4282552f7358SJed Brown 42839db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 42840fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 4285552f7358SJed Brown /* Set labels */ 4286552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4287552f7358SJed Brown if (out->pointmarkerlist[v]) { 4288552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4289552f7358SJed Brown } 4290552f7358SJed Brown } 4291552f7358SJed Brown if (interpolate) { 4292552f7358SJed Brown PetscInt e; 4293552f7358SJed Brown 4294552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4295552f7358SJed Brown if (out->edgemarkerlist[e]) { 4296552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4297552f7358SJed Brown const PetscInt *edges; 4298552f7358SJed Brown PetscInt numEdges; 4299552f7358SJed Brown 4300552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4301552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4302552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4303552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4304552f7358SJed Brown } 4305552f7358SJed Brown } 4306552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4307552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4308552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4309552f7358SJed Brown const PetscInt *faces; 4310552f7358SJed Brown PetscInt numFaces; 4311552f7358SJed Brown 4312552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4313552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4314552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4315552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4316552f7358SJed Brown } 4317552f7358SJed Brown } 4318552f7358SJed Brown } 4319552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 4320552f7358SJed Brown } 4321552f7358SJed Brown 4322552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4323552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4324552f7358SJed Brown PetscFunctionReturn(0); 4325552f7358SJed Brown } 4326552f7358SJed Brown 4327552f7358SJed Brown #undef __FUNCT__ 4328552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 4329552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 4330552f7358SJed Brown { 433182f516ccSBarry Smith MPI_Comm comm; 4332552f7358SJed Brown const PetscInt dim = 3; 4333552f7358SJed Brown PLC *in, *out; 4334552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 4335552f7358SJed Brown PetscMPIInt rank; 4336552f7358SJed Brown PetscErrorCode ierr; 4337552f7358SJed Brown 4338552f7358SJed Brown PetscFunctionBegin; 433982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 43400298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4341552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4342552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4343552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 4344552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 4345552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4346552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 43470d644c17SKarl Rupp 4348552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4349552f7358SJed Brown if (in->numberofpoints > 0) { 4350552f7358SJed Brown PetscSection coordSection; 4351552f7358SJed Brown Vec coordinates; 4352552f7358SJed Brown PetscScalar *array; 4353552f7358SJed Brown 4354785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4355785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4356552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 435769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 4358552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4359552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4360552f7358SJed Brown const PetscInt idx = v - vStart; 4361552f7358SJed Brown PetscInt off, d, m; 4362552f7358SJed Brown 4363552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4364552f7358SJed Brown for (d = 0; d < dim; ++d) { 4365552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4366552f7358SJed Brown } 4367552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 43680d644c17SKarl Rupp 4369552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4370552f7358SJed Brown } 4371552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4372552f7358SJed Brown } 4373552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 43740d644c17SKarl Rupp 4375552f7358SJed Brown in->numberofcorners = 4; 4376552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 4377552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 4378552f7358SJed Brown if (in->numberoftetrahedra > 0) { 4379785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 4380552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4381552f7358SJed Brown const PetscInt idx = c - cStart; 43820298fd71SBarry Smith PetscInt *closure = NULL; 4383552f7358SJed Brown PetscInt closureSize; 4384552f7358SJed Brown 4385552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4386552f7358SJed 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); 4387552f7358SJed Brown for (v = 0; v < 4; ++v) { 4388552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4389552f7358SJed Brown } 4390552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4391552f7358SJed Brown } 4392552f7358SJed Brown } 4393552f7358SJed Brown if (!rank) { 4394552f7358SJed Brown TetGenOpts t; 4395552f7358SJed Brown 4396552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 43970d644c17SKarl Rupp 4398552f7358SJed Brown t.in = dm; /* Should go away */ 4399552f7358SJed Brown t.refine = 1; 4400552f7358SJed Brown t.varvolume = 1; 4401552f7358SJed Brown t.quality = 1; 4402552f7358SJed Brown t.edgesout = 1; 4403552f7358SJed Brown t.zeroindex = 1; 4404552f7358SJed Brown t.quiet = 1; 4405552f7358SJed Brown t.verbose = verbose; /* Change this */ 44060d644c17SKarl Rupp 4407552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4408552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4409552f7358SJed Brown } 4410552f7358SJed Brown { 4411552f7358SJed Brown const PetscInt numCorners = 4; 4412552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4413552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4414552f7358SJed Brown const double *meshCoords = out->pointlist; 44151d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4416552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4417552f7358SJed Brown 44189db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 44190fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4420552f7358SJed Brown /* Set labels */ 4421552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4422552f7358SJed Brown if (out->pointmarkerlist[v]) { 4423552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4424552f7358SJed Brown } 4425552f7358SJed Brown } 4426552f7358SJed Brown if (interpolate) { 4427552f7358SJed Brown PetscInt e, f; 4428552f7358SJed Brown 4429552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4430552f7358SJed Brown if (out->edgemarkerlist[e]) { 4431552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4432552f7358SJed Brown const PetscInt *edges; 4433552f7358SJed Brown PetscInt numEdges; 4434552f7358SJed Brown 4435552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4436552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4437552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4438552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4439552f7358SJed Brown } 4440552f7358SJed Brown } 4441552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4442552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4443552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4444552f7358SJed Brown const PetscInt *faces; 4445552f7358SJed Brown PetscInt numFaces; 4446552f7358SJed Brown 4447552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4448552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4449552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4450552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4451552f7358SJed Brown } 4452552f7358SJed Brown } 4453552f7358SJed Brown } 4454552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4455552f7358SJed Brown } 4456552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4457552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4458552f7358SJed Brown PetscFunctionReturn(0); 4459552f7358SJed Brown } 4460552f7358SJed Brown #endif 4461552f7358SJed Brown 4462552f7358SJed Brown #undef __FUNCT__ 4463552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 4464552f7358SJed Brown /*@C 4465552f7358SJed Brown DMPlexGenerate - Generates a mesh. 4466552f7358SJed Brown 4467552f7358SJed Brown Not Collective 4468552f7358SJed Brown 4469552f7358SJed Brown Input Parameters: 4470552f7358SJed Brown + boundary - The DMPlex boundary object 4471552f7358SJed Brown . name - The mesh generation package name 4472552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 4473552f7358SJed Brown 4474552f7358SJed Brown Output Parameter: 4475552f7358SJed Brown . mesh - The DMPlex object 4476552f7358SJed Brown 4477552f7358SJed Brown Level: intermediate 4478552f7358SJed Brown 4479552f7358SJed Brown .keywords: mesh, elements 4480552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 4481552f7358SJed Brown @*/ 4482552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 4483552f7358SJed Brown { 4484552f7358SJed Brown PetscInt dim; 4485552f7358SJed Brown char genname[1024]; 4486552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4487552f7358SJed Brown PetscErrorCode ierr; 4488552f7358SJed Brown 4489552f7358SJed Brown PetscFunctionBegin; 4490552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 4491552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 4492552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 4493552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 44940d644c17SKarl Rupp if (flg) name = genname; 4495552f7358SJed Brown if (name) { 4496552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4497552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4498552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4499552f7358SJed Brown } 4500552f7358SJed Brown switch (dim) { 4501552f7358SJed Brown case 1: 4502552f7358SJed Brown if (!name || isTriangle) { 4503519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4504552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 4505552f7358SJed Brown #else 450682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 4507552f7358SJed Brown #endif 450882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4509552f7358SJed Brown break; 4510552f7358SJed Brown case 2: 4511552f7358SJed Brown if (!name || isCTetgen) { 4512519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4513552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4514552f7358SJed Brown #else 451582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4516552f7358SJed Brown #endif 4517552f7358SJed Brown } else if (isTetgen) { 4518519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4519552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4520552f7358SJed Brown #else 452182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4522552f7358SJed Brown #endif 452382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4524552f7358SJed Brown break; 4525552f7358SJed Brown default: 452682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 4527552f7358SJed Brown } 4528552f7358SJed Brown PetscFunctionReturn(0); 4529552f7358SJed Brown } 4530552f7358SJed Brown 4531552f7358SJed Brown #undef __FUNCT__ 4532552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 4533552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 4534552f7358SJed Brown { 4535552f7358SJed Brown PetscReal refinementLimit; 4536552f7358SJed Brown PetscInt dim, cStart, cEnd; 45370298fd71SBarry Smith char genname[1024], *name = NULL; 4538552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4539552f7358SJed Brown PetscErrorCode ierr; 4540552f7358SJed Brown 4541552f7358SJed Brown PetscFunctionBegin; 4542552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 4543552f7358SJed Brown if (isUniform) { 4544552f7358SJed Brown CellRefiner cellRefiner; 4545552f7358SJed Brown 4546509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 4547509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 4548552f7358SJed Brown PetscFunctionReturn(0); 4549552f7358SJed Brown } 4550552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 4551552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 4552552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 4553552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 4554552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 45550d644c17SKarl Rupp if (flg) name = genname; 4556552f7358SJed Brown if (name) { 4557552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4558552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4559552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4560552f7358SJed Brown } 4561552f7358SJed Brown switch (dim) { 4562552f7358SJed Brown case 2: 4563552f7358SJed Brown if (!name || isTriangle) { 4564519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4565552f7358SJed Brown double *maxVolumes; 4566552f7358SJed Brown PetscInt c; 4567552f7358SJed Brown 4568785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 45690d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4570552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 45716b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 4572552f7358SJed Brown #else 457382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 4574552f7358SJed Brown #endif 457582f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4576552f7358SJed Brown break; 4577552f7358SJed Brown case 3: 4578552f7358SJed Brown if (!name || isCTetgen) { 4579519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4580552f7358SJed Brown PetscReal *maxVolumes; 4581552f7358SJed Brown PetscInt c; 4582552f7358SJed Brown 4583785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 45840d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4585552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4586552f7358SJed Brown #else 458782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4588552f7358SJed Brown #endif 4589552f7358SJed Brown } else if (isTetgen) { 4590519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4591552f7358SJed Brown double *maxVolumes; 4592552f7358SJed Brown PetscInt c; 4593552f7358SJed Brown 4594785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 45950d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4596552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4597552f7358SJed Brown #else 459882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4599552f7358SJed Brown #endif 460082f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4601552f7358SJed Brown break; 4602552f7358SJed Brown default: 460382f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 4604552f7358SJed Brown } 4605552f7358SJed Brown PetscFunctionReturn(0); 4606552f7358SJed Brown } 4607552f7358SJed Brown 4608552f7358SJed Brown #undef __FUNCT__ 46090a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 46100a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 46110a6ba040SMatthew G. Knepley { 46120a6ba040SMatthew G. Knepley DM cdm = dm; 46130a6ba040SMatthew G. Knepley PetscInt r; 46140a6ba040SMatthew G. Knepley PetscBool isUniform; 46150a6ba040SMatthew G. Knepley PetscErrorCode ierr; 46160a6ba040SMatthew G. Knepley 46170a6ba040SMatthew G. Knepley PetscFunctionBegin; 46180a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 46190a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 46200a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 46210a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 46220a6ba040SMatthew G. Knepley 46230a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 46240a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 46250a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 46260a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 46270a6ba040SMatthew G. Knepley } 46280a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 46290a6ba040SMatthew G. Knepley } 46300a6ba040SMatthew G. Knepley 46310a6ba040SMatthew G. Knepley #undef __FUNCT__ 46320a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 46330a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 46340a6ba040SMatthew G. Knepley { 46350a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4636549a8adaSMatthew G. Knepley PetscErrorCode ierr; 46370a6ba040SMatthew G. Knepley 46380a6ba040SMatthew G. Knepley PetscFunctionBegin; 4639549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 46400a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 46410a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 46420a6ba040SMatthew G. Knepley } 46430a6ba040SMatthew G. Knepley 46440a6ba040SMatthew G. Knepley #undef __FUNCT__ 4645aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 4646552f7358SJed Brown /*@ 4647aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 4648552f7358SJed Brown 4649552f7358SJed Brown Not Collective 4650552f7358SJed Brown 4651aa50250dSMatthew G. Knepley Input Parameter: 4652552f7358SJed Brown . dm - The DMPlex object 4653552f7358SJed Brown 4654aa50250dSMatthew G. Knepley Output Parameter: 4655aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 4656552f7358SJed Brown 4657552f7358SJed Brown Level: developer 4658552f7358SJed Brown 4659aa50250dSMatthew G. Knepley .keywords: mesh, points 4660aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4661aa50250dSMatthew G. Knepley @*/ 4662aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 4663aa50250dSMatthew G. Knepley { 4664aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4665aa50250dSMatthew G. Knepley PetscErrorCode ierr; 4666aa50250dSMatthew G. Knepley 4667aa50250dSMatthew G. Knepley PetscFunctionBegin; 4668aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4669aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 467063d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 4671aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 4672aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 4673aa50250dSMatthew G. Knepley } 4674aa50250dSMatthew G. Knepley 4675aa50250dSMatthew G. Knepley #undef __FUNCT__ 4676aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 4677aa50250dSMatthew G. Knepley /*@ 4678aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 4679aa50250dSMatthew G. Knepley 4680aa50250dSMatthew G. Knepley Not Collective 4681aa50250dSMatthew G. Knepley 4682aa50250dSMatthew G. Knepley Input Parameter: 4683aa50250dSMatthew G. Knepley . dm - The DMPlex object 4684aa50250dSMatthew G. Knepley 4685aa50250dSMatthew G. Knepley Output Parameter: 4686aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 4687aa50250dSMatthew G. Knepley 4688aa50250dSMatthew G. Knepley Level: developer 4689552f7358SJed Brown 4690552f7358SJed Brown .keywords: mesh, points 4691aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4692552f7358SJed Brown @*/ 4693552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 4694552f7358SJed Brown { 4695aa50250dSMatthew G. Knepley DMLabel label; 4696aa50250dSMatthew G. Knepley PetscInt d = 0; 4697552f7358SJed Brown PetscErrorCode ierr; 4698552f7358SJed Brown 4699552f7358SJed Brown PetscFunctionBegin; 4700552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4701552f7358SJed Brown PetscValidPointer(depth, 2); 4702aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4703aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 4704552f7358SJed Brown *depth = d-1; 4705552f7358SJed Brown PetscFunctionReturn(0); 4706552f7358SJed Brown } 4707552f7358SJed Brown 4708552f7358SJed Brown #undef __FUNCT__ 4709552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 4710552f7358SJed Brown /*@ 4711552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 4712552f7358SJed Brown 4713552f7358SJed Brown Not Collective 4714552f7358SJed Brown 4715552f7358SJed Brown Input Parameters: 4716552f7358SJed Brown + dm - The DMPlex object 4717552f7358SJed Brown - stratumValue - The requested depth 4718552f7358SJed Brown 4719552f7358SJed Brown Output Parameters: 4720552f7358SJed Brown + start - The first point at this depth 4721552f7358SJed Brown - end - One beyond the last point at this depth 4722552f7358SJed Brown 4723552f7358SJed Brown Level: developer 4724552f7358SJed Brown 4725552f7358SJed Brown .keywords: mesh, points 4726552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 4727552f7358SJed Brown @*/ 47280adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 47290adebc6cSBarry Smith { 4730aa50250dSMatthew G. Knepley DMLabel label; 473163d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 4732552f7358SJed Brown PetscErrorCode ierr; 4733552f7358SJed Brown 4734552f7358SJed Brown PetscFunctionBegin; 4735552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 473663d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 473763d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4738552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 47390d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 474063d1a920SMatthew G. Knepley if (stratumValue < 0) { 474163d1a920SMatthew G. Knepley if (start) *start = pStart; 474263d1a920SMatthew G. Knepley if (end) *end = pEnd; 474363d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4744552f7358SJed Brown } 4745aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 474663d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 474763d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 4748552f7358SJed Brown PetscFunctionReturn(0); 4749552f7358SJed Brown } 4750552f7358SJed Brown 4751552f7358SJed Brown #undef __FUNCT__ 4752552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4753552f7358SJed Brown /*@ 4754552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4755552f7358SJed Brown 4756552f7358SJed Brown Not Collective 4757552f7358SJed Brown 4758552f7358SJed Brown Input Parameters: 4759552f7358SJed Brown + dm - The DMPlex object 4760552f7358SJed Brown - stratumValue - The requested height 4761552f7358SJed Brown 4762552f7358SJed Brown Output Parameters: 4763552f7358SJed Brown + start - The first point at this height 4764552f7358SJed Brown - end - One beyond the last point at this height 4765552f7358SJed Brown 4766552f7358SJed Brown Level: developer 4767552f7358SJed Brown 4768552f7358SJed Brown .keywords: mesh, points 4769552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4770552f7358SJed Brown @*/ 47710adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 47720adebc6cSBarry Smith { 4773aa50250dSMatthew G. Knepley DMLabel label; 477463d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4775552f7358SJed Brown PetscErrorCode ierr; 4776552f7358SJed Brown 4777552f7358SJed Brown PetscFunctionBegin; 4778552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 477963d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 478063d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4781552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 47820d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 478363d1a920SMatthew G. Knepley if (stratumValue < 0) { 478463d1a920SMatthew G. Knepley if (start) *start = pStart; 478563d1a920SMatthew G. Knepley if (end) *end = pEnd; 478663d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4787552f7358SJed Brown } 4788aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4789aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 479063d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 479163d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4792552f7358SJed Brown PetscFunctionReturn(0); 4793552f7358SJed Brown } 4794552f7358SJed Brown 4795552f7358SJed Brown #undef __FUNCT__ 4796552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4797552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4798a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4799a6dfd86eSKarl Rupp { 4800552f7358SJed Brown PetscInt *numDofTot; 4801916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4802916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4803552f7358SJed Brown PetscErrorCode ierr; 4804552f7358SJed Brown 4805552f7358SJed Brown PetscFunctionBegin; 4806785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4807552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4808552f7358SJed Brown numDofTot[d] = 0; 48090d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4810552f7358SJed Brown } 481182f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4812552f7358SJed Brown if (numFields > 0) { 4813552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4814552f7358SJed Brown if (numComp) { 4815552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4816552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4817552f7358SJed Brown } 4818552f7358SJed Brown } 4819552f7358SJed Brown } 4820552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4821552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4822916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4823916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4824916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4825916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4826552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4827552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4828552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4829552f7358SJed Brown } 4830552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4831552f7358SJed Brown } 4832552f7358SJed Brown } 4833552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4834552f7358SJed Brown PetscFunctionReturn(0); 4835552f7358SJed Brown } 4836552f7358SJed Brown 4837552f7358SJed Brown #undef __FUNCT__ 4838552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4839552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4840552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4841552f7358SJed Brown */ 4842a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4843a6dfd86eSKarl Rupp { 4844552f7358SJed Brown PetscInt numFields; 4845552f7358SJed Brown PetscInt bc; 4846552f7358SJed Brown PetscErrorCode ierr; 4847552f7358SJed Brown 4848552f7358SJed Brown PetscFunctionBegin; 4849552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4850552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4851552f7358SJed Brown PetscInt field = 0; 4852552f7358SJed Brown const PetscInt *idx; 4853552f7358SJed Brown PetscInt n, i; 4854552f7358SJed Brown 48550d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4856552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4857552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4858552f7358SJed Brown for (i = 0; i < n; ++i) { 4859552f7358SJed Brown const PetscInt p = idx[i]; 4860552f7358SJed Brown PetscInt numConst = constDof; 4861552f7358SJed Brown 4862552f7358SJed Brown /* Constrain every dof on the point */ 4863552f7358SJed Brown if (numConst < 0) { 4864552f7358SJed Brown if (numFields) { 4865552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4866552f7358SJed Brown } else { 4867552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4868552f7358SJed Brown } 4869552f7358SJed Brown } 4870552f7358SJed Brown if (numFields) { 4871552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4872552f7358SJed Brown } 4873552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4874552f7358SJed Brown } 4875552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4876552f7358SJed Brown } 4877552f7358SJed Brown PetscFunctionReturn(0); 4878552f7358SJed Brown } 4879552f7358SJed Brown 4880552f7358SJed Brown #undef __FUNCT__ 4881552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4882552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 48830adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 48840adebc6cSBarry Smith { 4885552f7358SJed Brown PetscInt *maxConstraints; 4886552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4887552f7358SJed Brown PetscErrorCode ierr; 4888552f7358SJed Brown 4889552f7358SJed Brown PetscFunctionBegin; 4890552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4891552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4892785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 48930d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4894552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4895552f7358SJed Brown PetscInt cdof; 4896552f7358SJed Brown 4897552f7358SJed Brown if (numFields) { 4898552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4899552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4900552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4901552f7358SJed Brown } 4902552f7358SJed Brown } else { 4903552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4904552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4905552f7358SJed Brown } 4906552f7358SJed Brown } 4907552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4908552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4909552f7358SJed Brown } 4910552f7358SJed Brown if (maxConstraints[numFields]) { 4911552f7358SJed Brown PetscInt *indices; 4912552f7358SJed Brown 4913785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4914552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4915552f7358SJed Brown PetscInt cdof, d; 4916552f7358SJed Brown 4917552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4918552f7358SJed Brown if (cdof) { 4919552f7358SJed 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]); 4920552f7358SJed Brown if (numFields) { 4921552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4922552f7358SJed Brown 4923552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4924552f7358SJed Brown PetscInt cfdof, fdof; 4925552f7358SJed Brown 4926552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4927552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4928552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 49290d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4930552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 49310d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4932552f7358SJed Brown numConst += cfdof; 4933552f7358SJed Brown foff += fdof; 4934552f7358SJed Brown } 4935552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4936552f7358SJed Brown } else { 49370d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4938552f7358SJed Brown } 4939552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4940552f7358SJed Brown } 4941552f7358SJed Brown } 4942552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4943552f7358SJed Brown } 4944552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4945552f7358SJed Brown PetscFunctionReturn(0); 4946552f7358SJed Brown } 4947552f7358SJed Brown 4948552f7358SJed Brown #undef __FUNCT__ 4949552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4950552f7358SJed Brown /* Set the constrained field indices on each point */ 49510adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 49520adebc6cSBarry Smith { 4953552f7358SJed Brown const PetscInt *points, *indices; 4954552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4955552f7358SJed Brown PetscErrorCode ierr; 4956552f7358SJed Brown 4957552f7358SJed Brown PetscFunctionBegin; 4958552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4959552f7358SJed 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); 4960552f7358SJed Brown 4961552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4962552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4963552f7358SJed Brown if (!constraintIndices) { 4964552f7358SJed Brown PetscInt *idx, i; 4965552f7358SJed Brown 4966552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4967785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 49680d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4969552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4970552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4971552f7358SJed Brown } 4972552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4973552f7358SJed Brown } else { 4974552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4975552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4976552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4977552f7358SJed Brown PetscInt fcdof; 4978552f7358SJed Brown 4979552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 498082f516ccSBarry 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); 4981552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4982552f7358SJed Brown } 4983552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4984552f7358SJed Brown } 4985552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4986552f7358SJed Brown PetscFunctionReturn(0); 4987552f7358SJed Brown } 4988552f7358SJed Brown 4989552f7358SJed Brown #undef __FUNCT__ 4990552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4991552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 49920adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 49930adebc6cSBarry Smith { 4994552f7358SJed Brown PetscInt *indices; 4995552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4996552f7358SJed Brown PetscErrorCode ierr; 4997552f7358SJed Brown 4998552f7358SJed Brown PetscFunctionBegin; 4999552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 5000785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 5001552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 500282f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 5003552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5004552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5005552f7358SJed Brown PetscInt cdof, d; 5006552f7358SJed Brown 5007552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 5008552f7358SJed Brown if (cdof) { 5009552f7358SJed Brown PetscInt numConst = 0, foff = 0; 5010552f7358SJed Brown 5011552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5012552f7358SJed Brown const PetscInt *fcind; 5013552f7358SJed Brown PetscInt fdof, fcdof; 5014552f7358SJed Brown 5015552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 5016552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 5017552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 5018552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 50190d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 5020552f7358SJed Brown foff += fdof; 5021552f7358SJed Brown numConst += fcdof; 5022552f7358SJed Brown } 502382f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 5024552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 5025552f7358SJed Brown } 5026552f7358SJed Brown } 5027552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 5028552f7358SJed Brown PetscFunctionReturn(0); 5029552f7358SJed Brown } 5030552f7358SJed Brown 5031552f7358SJed Brown #undef __FUNCT__ 5032552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 5033552f7358SJed Brown /*@C 5034552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 5035552f7358SJed Brown 5036552f7358SJed Brown Not Collective 5037552f7358SJed Brown 5038552f7358SJed Brown Input Parameters: 5039552f7358SJed Brown + dm - The DMPlex object 5040552f7358SJed Brown . dim - The spatial dimension of the problem 5041552f7358SJed Brown . numFields - The number of fields in the problem 5042552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 5043552f7358SJed 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 5044552f7358SJed Brown . numBC - The number of boundary conditions 5045552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 5046552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 5047552f7358SJed Brown 5048552f7358SJed Brown Output Parameter: 5049552f7358SJed Brown . section - The PetscSection object 5050552f7358SJed Brown 5051552f7358SJed 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 5052552f7358SJed Brown nubmer of dof for field 0 on each edge. 5053552f7358SJed Brown 5054552f7358SJed Brown Level: developer 5055552f7358SJed Brown 50563813dfbdSMatthew G Knepley Fortran Notes: 50573813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 50583813dfbdSMatthew G Knepley 5059552f7358SJed Brown .keywords: mesh, elements 5060552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 5061552f7358SJed Brown @*/ 5062a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscSection *section) 5063a6dfd86eSKarl Rupp { 5064552f7358SJed Brown PetscErrorCode ierr; 5065552f7358SJed Brown 5066552f7358SJed Brown PetscFunctionBegin; 5067552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 5068552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 5069552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 5070552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 5071ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 5072552f7358SJed Brown PetscFunctionReturn(0); 5073552f7358SJed Brown } 5074552f7358SJed Brown 5075552f7358SJed Brown #undef __FUNCT__ 5076552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 50770adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 50780adebc6cSBarry Smith { 5079552f7358SJed Brown PetscSection section; 5080552f7358SJed Brown PetscErrorCode ierr; 5081552f7358SJed Brown 5082552f7358SJed Brown PetscFunctionBegin; 508338221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 508482f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5085552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 50861d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5087552f7358SJed Brown PetscFunctionReturn(0); 5088552f7358SJed Brown } 5089552f7358SJed Brown 5090552f7358SJed Brown #undef __FUNCT__ 5091552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 50920adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 50930adebc6cSBarry Smith { 5094552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5095552f7358SJed Brown 5096552f7358SJed Brown PetscFunctionBegin; 5097552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5098552f7358SJed Brown if (section) *section = mesh->coneSection; 5099552f7358SJed Brown PetscFunctionReturn(0); 5100552f7358SJed Brown } 5101552f7358SJed Brown 5102552f7358SJed Brown #undef __FUNCT__ 51038cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 51048cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 51058cb4d582SMatthew G. Knepley { 51068cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 51078cb4d582SMatthew G. Knepley 51088cb4d582SMatthew G. Knepley PetscFunctionBegin; 51098cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 51108cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 51118cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 51128cb4d582SMatthew G. Knepley } 51138cb4d582SMatthew G. Knepley 51148cb4d582SMatthew G. Knepley #undef __FUNCT__ 5115552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 5116a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 5117a6dfd86eSKarl Rupp { 5118552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5119552f7358SJed Brown 5120552f7358SJed Brown PetscFunctionBegin; 5121552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5122552f7358SJed Brown if (cones) *cones = mesh->cones; 5123552f7358SJed Brown PetscFunctionReturn(0); 5124552f7358SJed Brown } 5125552f7358SJed Brown 5126552f7358SJed Brown #undef __FUNCT__ 5127552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 5128a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 5129a6dfd86eSKarl Rupp { 5130552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5131552f7358SJed Brown 5132552f7358SJed Brown PetscFunctionBegin; 5133552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5134552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 5135552f7358SJed Brown PetscFunctionReturn(0); 5136552f7358SJed Brown } 5137552f7358SJed Brown 5138552f7358SJed Brown /******************************** FEM Support **********************************/ 5139552f7358SJed Brown 5140552f7358SJed Brown #undef __FUNCT__ 51411a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 51421a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5143a6dfd86eSKarl Rupp { 5144552f7358SJed Brown PetscScalar *array, *vArray; 5145d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 51461a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 5147552f7358SJed Brown PetscErrorCode ierr; 5148552f7358SJed Brown 51491b406b76SMatthew G. Knepley PetscFunctionBeginHot; 51502a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 51515a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 51525a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 51535a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 51543f7cbbe7SMatthew G. Knepley if (!values || !*values) { 51559df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 51569df71ca4SMatthew G. Knepley PetscInt dof; 5157d9917b9dSMatthew G. Knepley 51589df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 51599df71ca4SMatthew G. Knepley size += dof; 51609df71ca4SMatthew G. Knepley } 51619df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 51629df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 51632a3aaacfSMatthew G. Knepley PetscInt dof; 51645a1bb5cfSMatthew G. Knepley 51655a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 51662a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 51675a1bb5cfSMatthew G. Knepley size += dof; 51685a1bb5cfSMatthew G. Knepley } 51693f7cbbe7SMatthew G. Knepley if (!values) { 51703f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 51713f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 51723f7cbbe7SMatthew G. Knepley } 51735a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 5174982e9ed1SMatthew G. Knepley } else { 5175982e9ed1SMatthew G. Knepley array = *values; 5176982e9ed1SMatthew G. Knepley } 51779df71ca4SMatthew G. Knepley size = 0; 51785a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 51799df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 51809df71ca4SMatthew G. Knepley PetscInt dof, off, d; 51819df71ca4SMatthew G. Knepley PetscScalar *varr; 5182d9917b9dSMatthew G. Knepley 51839df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 51849df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 51859df71ca4SMatthew G. Knepley varr = &vArray[off]; 51861a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 51871a271a75SMatthew G. Knepley array[offset] = varr[d]; 51889df71ca4SMatthew G. Knepley } 51899df71ca4SMatthew G. Knepley size += dof; 51909df71ca4SMatthew G. Knepley } 51919df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 51929df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 51939df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 51945a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 51955a1bb5cfSMatthew G. Knepley PetscScalar *varr; 51965a1bb5cfSMatthew G. Knepley 519752ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 51985a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 51995a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 52005a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 52015a1bb5cfSMatthew G. Knepley if (o >= 0) { 52021a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 52031a271a75SMatthew G. Knepley array[offset] = varr[d]; 52045a1bb5cfSMatthew G. Knepley } 52055a1bb5cfSMatthew G. Knepley } else { 52061a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 52071a271a75SMatthew G. Knepley array[offset] = varr[d]; 52085a1bb5cfSMatthew G. Knepley } 52095a1bb5cfSMatthew G. Knepley } 52109df71ca4SMatthew G. Knepley size += dof; 52115a1bb5cfSMatthew G. Knepley } 52125a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 52139df71ca4SMatthew G. Knepley if (!*values) { 52145a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 52155a1bb5cfSMatthew G. Knepley *values = array; 52169df71ca4SMatthew G. Knepley } else { 52179df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 52188c312ff3SMatthew G. Knepley *csize = size; 52199df71ca4SMatthew G. Knepley } 52205a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 52215a1bb5cfSMatthew G. Knepley } 5222d9917b9dSMatthew G. Knepley 5223d9917b9dSMatthew G. Knepley #undef __FUNCT__ 52241a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 52251a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 52261a271a75SMatthew G. Knepley { 52271a271a75SMatthew G. Knepley PetscInt offset = 0, p; 52281a271a75SMatthew G. Knepley PetscErrorCode ierr; 52291a271a75SMatthew G. Knepley 52301a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5231fe02ba77SJed Brown *size = 0; 52321a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 52331a271a75SMatthew G. Knepley const PetscInt point = points[p]; 52341a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 52351a271a75SMatthew G. Knepley PetscInt dof, off, d; 52361a271a75SMatthew G. Knepley const PetscScalar *varr; 52371a271a75SMatthew G. Knepley 52381a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 52391a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 52401a271a75SMatthew G. Knepley varr = &vArray[off]; 52411a271a75SMatthew G. Knepley if (o >= 0) { 52421a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 52431a271a75SMatthew G. Knepley } else { 52441a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 52451a271a75SMatthew G. Knepley } 52461a271a75SMatthew G. Knepley } 52471a271a75SMatthew G. Knepley *size = offset; 52481a271a75SMatthew G. Knepley PetscFunctionReturn(0); 52491a271a75SMatthew G. Knepley } 52501a271a75SMatthew G. Knepley 52511a271a75SMatthew G. Knepley #undef __FUNCT__ 52521a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 52531a271a75SMatthew 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[]) 52541a271a75SMatthew G. Knepley { 52551a271a75SMatthew G. Knepley PetscInt offset = 0, f; 52561a271a75SMatthew G. Knepley PetscErrorCode ierr; 52571a271a75SMatthew G. Knepley 52581a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5259fe02ba77SJed Brown *size = 0; 52601a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 52611a271a75SMatthew G. Knepley PetscInt fcomp, p; 52621a271a75SMatthew G. Knepley 52631a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 52641a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 52651a271a75SMatthew G. Knepley const PetscInt point = points[p]; 52661a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 52671a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 52681a271a75SMatthew G. Knepley const PetscScalar *varr; 52691a271a75SMatthew G. Knepley 52701a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 52711a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 52721a271a75SMatthew G. Knepley varr = &vArray[foff]; 52731a271a75SMatthew G. Knepley if (o >= 0) { 52741a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 52751a271a75SMatthew G. Knepley } else { 52761a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 52771a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 52781a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 52791a271a75SMatthew G. Knepley } 52801a271a75SMatthew G. Knepley } 52811a271a75SMatthew G. Knepley } 52821a271a75SMatthew G. Knepley } 52831a271a75SMatthew G. Knepley } 52841a271a75SMatthew G. Knepley *size = offset; 52851a271a75SMatthew G. Knepley PetscFunctionReturn(0); 52861a271a75SMatthew G. Knepley } 52871a271a75SMatthew G. Knepley 52881a271a75SMatthew G. Knepley #undef __FUNCT__ 5289552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 5290552f7358SJed Brown /*@C 5291552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 5292552f7358SJed Brown 5293552f7358SJed Brown Not collective 5294552f7358SJed Brown 5295552f7358SJed Brown Input Parameters: 5296552f7358SJed Brown + dm - The DM 5297552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5298552f7358SJed Brown . v - The local vector 5299552f7358SJed Brown - point - The sieve point in the DM 5300552f7358SJed Brown 5301552f7358SJed Brown Output Parameters: 5302552f7358SJed Brown + csize - The number of values in the closure, or NULL 5303552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5304552f7358SJed Brown 5305552f7358SJed Brown Fortran Notes: 5306552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 5307552f7358SJed Brown include petsc.h90 in your code. 5308552f7358SJed Brown 5309552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 5310552f7358SJed Brown 5311552f7358SJed Brown Level: intermediate 5312552f7358SJed Brown 5313552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5314552f7358SJed Brown @*/ 5315552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5316552f7358SJed Brown { 5317552f7358SJed Brown PetscSection clSection; 5318d9917b9dSMatthew G. Knepley IS clPoints; 5319552f7358SJed Brown PetscScalar *array, *vArray; 5320552f7358SJed Brown PetscInt *points = NULL; 5321d9917b9dSMatthew G. Knepley const PetscInt *clp; 53221a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 5323552f7358SJed Brown PetscErrorCode ierr; 5324552f7358SJed Brown 5325d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 5326552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5327552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 53281a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 53291a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5330552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5331552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5332552f7358SJed Brown if (depth == 1 && numFields < 2) { 53331a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 5334552f7358SJed Brown PetscFunctionReturn(0); 5335552f7358SJed Brown } 53361a271a75SMatthew G. Knepley /* Get points */ 5337d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5338d9917b9dSMatthew G. Knepley if (!clPoints) { 53391a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 5340552f7358SJed Brown 53411a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5342552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5343552f7358SJed Brown /* Compress out points not in the section */ 5344552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5345552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5346552f7358SJed Brown points[q*2] = points[p]; 5347552f7358SJed Brown points[q*2+1] = points[p+1]; 5348552f7358SJed Brown ++q; 5349552f7358SJed Brown } 5350552f7358SJed Brown } 5351552f7358SJed Brown numPoints = q; 5352d9917b9dSMatthew G. Knepley } else { 5353d9917b9dSMatthew G. Knepley PetscInt dof, off; 5354552f7358SJed Brown 5355d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5356d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5357d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 53581a271a75SMatthew G. Knepley numPoints = dof/2; 5359d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5360552f7358SJed Brown } 53611a271a75SMatthew G. Knepley /* Get array */ 5362552f7358SJed Brown if (!values || !*values) { 53631a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 5364552f7358SJed Brown 53651a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5366552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 53671a271a75SMatthew G. Knepley asize += dof; 5368552f7358SJed Brown } 5369bd6c0d32SMatthew G. Knepley if (!values) { 5370d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 53711a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 53721a271a75SMatthew G. Knepley if (csize) *csize = asize; 5373bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 5374bd6c0d32SMatthew G. Knepley } 53751a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 5376d0f6b257SMatthew G. Knepley } else { 5377d0f6b257SMatthew G. Knepley array = *values; 5378d0f6b257SMatthew G. Knepley } 5379552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 53801a271a75SMatthew G. Knepley /* Get values */ 5381ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 53821a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 53831a271a75SMatthew G. Knepley /* Cleanup points */ 53841a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 53851a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 53861a271a75SMatthew G. Knepley /* Cleanup array */ 5387552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 5388d0f6b257SMatthew G. Knepley if (!*values) { 5389552f7358SJed Brown if (csize) *csize = size; 5390552f7358SJed Brown *values = array; 5391d0f6b257SMatthew G. Knepley } else { 5392d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 5393d0f6b257SMatthew G. Knepley *csize = size; 5394d0f6b257SMatthew G. Knepley } 5395552f7358SJed Brown PetscFunctionReturn(0); 5396552f7358SJed Brown } 5397552f7358SJed Brown 5398552f7358SJed Brown #undef __FUNCT__ 5399552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 5400552f7358SJed Brown /*@C 5401552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 5402552f7358SJed Brown 5403552f7358SJed Brown Not collective 5404552f7358SJed Brown 5405552f7358SJed Brown Input Parameters: 5406552f7358SJed Brown + dm - The DM 54070298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 5408552f7358SJed Brown . v - The local vector 5409552f7358SJed Brown . point - The sieve point in the DM 54100298fd71SBarry Smith . csize - The number of values in the closure, or NULL 5411552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5412552f7358SJed Brown 54133813dfbdSMatthew G Knepley Fortran Notes: 54143813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 54153813dfbdSMatthew G Knepley include petsc.h90 in your code. 54163813dfbdSMatthew G Knepley 54173813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 54183813dfbdSMatthew G Knepley 5419552f7358SJed Brown Level: intermediate 5420552f7358SJed Brown 5421552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5422552f7358SJed Brown @*/ 54237c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5424a6dfd86eSKarl Rupp { 5425552f7358SJed Brown PetscInt size = 0; 5426552f7358SJed Brown PetscErrorCode ierr; 5427552f7358SJed Brown 5428552f7358SJed Brown PetscFunctionBegin; 5429552f7358SJed Brown /* Should work without recalculating size */ 5430552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 5431552f7358SJed Brown PetscFunctionReturn(0); 5432552f7358SJed Brown } 5433552f7358SJed Brown 5434552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 5435552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 5436552f7358SJed Brown 5437552f7358SJed Brown #undef __FUNCT__ 5438552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 54391a271a75SMatthew 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[]) 5440552f7358SJed Brown { 5441552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5442552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5443552f7358SJed Brown PetscScalar *a; 5444552f7358SJed Brown PetscInt off, cind = 0, k; 5445552f7358SJed Brown PetscErrorCode ierr; 5446552f7358SJed Brown 5447552f7358SJed Brown PetscFunctionBegin; 5448552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5449552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5450552f7358SJed Brown a = &array[off]; 5451552f7358SJed Brown if (!cdof || setBC) { 5452552f7358SJed Brown if (orientation >= 0) { 5453552f7358SJed Brown for (k = 0; k < dof; ++k) { 5454552f7358SJed Brown fuse(&a[k], values[k]); 5455552f7358SJed Brown } 5456552f7358SJed Brown } else { 5457552f7358SJed Brown for (k = 0; k < dof; ++k) { 5458552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5459552f7358SJed Brown } 5460552f7358SJed Brown } 5461552f7358SJed Brown } else { 5462552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5463552f7358SJed Brown if (orientation >= 0) { 5464552f7358SJed Brown for (k = 0; k < dof; ++k) { 5465552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5466552f7358SJed Brown fuse(&a[k], values[k]); 5467552f7358SJed Brown } 5468552f7358SJed Brown } else { 5469552f7358SJed Brown for (k = 0; k < dof; ++k) { 5470552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5471552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5472552f7358SJed Brown } 5473552f7358SJed Brown } 5474552f7358SJed Brown } 5475552f7358SJed Brown PetscFunctionReturn(0); 5476552f7358SJed Brown } 5477552f7358SJed Brown 5478552f7358SJed Brown #undef __FUNCT__ 5479a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 54801a271a75SMatthew 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[]) 5481a5e93ea8SMatthew G. Knepley { 5482a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 5483a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5484a5e93ea8SMatthew G. Knepley PetscScalar *a; 5485a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 5486a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5487a5e93ea8SMatthew G. Knepley 5488a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5489a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5490a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5491a5e93ea8SMatthew G. Knepley a = &array[off]; 5492a5e93ea8SMatthew G. Knepley if (cdof) { 5493a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5494a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 5495a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5496a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5497a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 5498a5e93ea8SMatthew G. Knepley ++cind; 5499a5e93ea8SMatthew G. Knepley } 5500a5e93ea8SMatthew G. Knepley } 5501a5e93ea8SMatthew G. Knepley } else { 5502a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5503a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5504a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 5505a5e93ea8SMatthew G. Knepley ++cind; 5506a5e93ea8SMatthew G. Knepley } 5507a5e93ea8SMatthew G. Knepley } 5508a5e93ea8SMatthew G. Knepley } 5509a5e93ea8SMatthew G. Knepley } 5510a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5511a5e93ea8SMatthew G. Knepley } 5512a5e93ea8SMatthew G. Knepley 5513a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 5514552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 55151a271a75SMatthew 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[]) 5516a6dfd86eSKarl Rupp { 5517552f7358SJed Brown PetscScalar *a; 55181a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 55191a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 55201a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5521552f7358SJed Brown PetscErrorCode ierr; 5522552f7358SJed Brown 5523552f7358SJed Brown PetscFunctionBegin; 5524552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5525552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 55261a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 55271a271a75SMatthew G. Knepley a = &array[foff]; 5528552f7358SJed Brown if (!fcdof || setBC) { 55291a271a75SMatthew G. Knepley if (o >= 0) { 55301a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 5531552f7358SJed Brown } else { 5532552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5533552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 55341a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5535552f7358SJed Brown } 5536552f7358SJed Brown } 5537552f7358SJed Brown } 5538552f7358SJed Brown } else { 5539552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 55401a271a75SMatthew G. Knepley if (o >= 0) { 5541552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5542552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 55431a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5544552f7358SJed Brown } 5545552f7358SJed Brown } else { 5546552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5547552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5548552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 55491a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5550552f7358SJed Brown } 5551552f7358SJed Brown } 5552552f7358SJed Brown } 5553552f7358SJed Brown } 55541a271a75SMatthew G. Knepley *offset += fdof; 5555552f7358SJed Brown PetscFunctionReturn(0); 5556552f7358SJed Brown } 5557552f7358SJed Brown 5558552f7358SJed Brown #undef __FUNCT__ 5559a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 55601a271a75SMatthew 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[]) 5561a5e93ea8SMatthew G. Knepley { 5562a5e93ea8SMatthew G. Knepley PetscScalar *a; 55631a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 55641a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 55651a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5566a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5567a5e93ea8SMatthew G. Knepley 5568a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5569a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5570a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 55711a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 55721a271a75SMatthew G. Knepley a = &array[foff]; 5573a5e93ea8SMatthew G. Knepley if (fcdof) { 5574a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 55751a271a75SMatthew G. Knepley if (o >= 0) { 5576a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 5577a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 55781a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5579a5e93ea8SMatthew G. Knepley ++cind; 5580a5e93ea8SMatthew G. Knepley } 5581a5e93ea8SMatthew G. Knepley } 5582a5e93ea8SMatthew G. Knepley } else { 5583a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 5584a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 5585a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 55861a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5587a5e93ea8SMatthew G. Knepley ++cind; 5588a5e93ea8SMatthew G. Knepley } 5589a5e93ea8SMatthew G. Knepley } 5590a5e93ea8SMatthew G. Knepley } 5591a5e93ea8SMatthew G. Knepley } 5592a5e93ea8SMatthew G. Knepley } 55931a271a75SMatthew G. Knepley *offset += fdof; 5594a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5595a5e93ea8SMatthew G. Knepley } 5596a5e93ea8SMatthew G. Knepley 5597a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 55981b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 55991a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 5600a6dfd86eSKarl Rupp { 5601552f7358SJed Brown PetscScalar *array; 56021b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 56031b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 5604552f7358SJed Brown PetscErrorCode ierr; 5605552f7358SJed Brown 56061b406b76SMatthew G. Knepley PetscFunctionBeginHot; 5607b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5608b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 5609b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 5610b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 5611b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5612b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 5613b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 5614b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 5615b6ebb6e6SMatthew G. Knepley 5616b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 5617b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 5618b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 5619b6ebb6e6SMatthew G. Knepley { 5620b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5621b6ebb6e6SMatthew G. Knepley PetscScalar *a; 5622b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 5623b6ebb6e6SMatthew G. Knepley 5624b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 5625b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 5626b6ebb6e6SMatthew G. Knepley a = &array[coff]; 5627b6ebb6e6SMatthew G. Knepley if (!cdof) { 5628b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5629b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5630b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5631b6ebb6e6SMatthew G. Knepley } 5632b6ebb6e6SMatthew G. Knepley } else { 5633b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5634b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5635b6ebb6e6SMatthew G. Knepley } 5636b6ebb6e6SMatthew G. Knepley } 5637b6ebb6e6SMatthew G. Knepley } else { 5638b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 5639b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5640b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5641b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5642b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5643b6ebb6e6SMatthew G. Knepley } 5644b6ebb6e6SMatthew G. Knepley } else { 5645b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5646b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5647b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5648b6ebb6e6SMatthew G. Knepley } 5649b6ebb6e6SMatthew G. Knepley } 5650b6ebb6e6SMatthew G. Knepley } 5651b6ebb6e6SMatthew G. Knepley } 5652b6ebb6e6SMatthew G. Knepley } 5653b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5654b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 5655b6ebb6e6SMatthew G. Knepley } 56561b406b76SMatthew G. Knepley 56571b406b76SMatthew G. Knepley #undef __FUNCT__ 56581b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 56591b406b76SMatthew G. Knepley /*@C 56601b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 56611b406b76SMatthew G. Knepley 56621b406b76SMatthew G. Knepley Not collective 56631b406b76SMatthew G. Knepley 56641b406b76SMatthew G. Knepley Input Parameters: 56651b406b76SMatthew G. Knepley + dm - The DM 56661b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 56671b406b76SMatthew G. Knepley . v - The local vector 56681b406b76SMatthew G. Knepley . point - The sieve point in the DM 56691b406b76SMatthew G. Knepley . values - The array of values 56701b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 56711b406b76SMatthew G. Knepley 56721b406b76SMatthew G. Knepley Fortran Notes: 56731b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 56741b406b76SMatthew G. Knepley 56751b406b76SMatthew G. Knepley Level: intermediate 56761b406b76SMatthew G. Knepley 56771b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 56781b406b76SMatthew G. Knepley @*/ 56791b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 56801b406b76SMatthew G. Knepley { 56811b406b76SMatthew G. Knepley PetscSection clSection; 56821b406b76SMatthew G. Knepley IS clPoints; 56831b406b76SMatthew G. Knepley PetscScalar *array; 56841b406b76SMatthew G. Knepley PetscInt *points = NULL; 56851b406b76SMatthew G. Knepley const PetscInt *clp; 56861a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 56871b406b76SMatthew G. Knepley PetscErrorCode ierr; 56881b406b76SMatthew G. Knepley 56891a271a75SMatthew G. Knepley PetscFunctionBeginHot; 56901b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 56911b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 56921a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 56931a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 56941b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 56951b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 56961b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 56971a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 56981b406b76SMatthew G. Knepley PetscFunctionReturn(0); 56991b406b76SMatthew G. Knepley } 57001a271a75SMatthew G. Knepley /* Get points */ 57011b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 57021b406b76SMatthew G. Knepley if (!clPoints) { 57031a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 57041a271a75SMatthew G. Knepley 57051a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5706552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5707552f7358SJed Brown /* Compress out points not in the section */ 5708552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5709552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5710552f7358SJed Brown points[q*2] = points[p]; 5711552f7358SJed Brown points[q*2+1] = points[p+1]; 5712552f7358SJed Brown ++q; 5713552f7358SJed Brown } 5714552f7358SJed Brown } 5715552f7358SJed Brown numPoints = q; 57161b406b76SMatthew G. Knepley } else { 57171b406b76SMatthew G. Knepley PetscInt dof, off; 5718552f7358SJed Brown 57191b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 57201b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 57211b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 57221a271a75SMatthew G. Knepley numPoints = dof/2; 57231b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 5724552f7358SJed Brown } 57251a271a75SMatthew G. Knepley /* Get array */ 5726552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 57271a271a75SMatthew G. Knepley /* Get values */ 5728ef90cfe2SMatthew G. Knepley if (numFields > 0) { 57291a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5730552f7358SJed Brown for (f = 0; f < numFields; ++f) { 57311a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5732552f7358SJed Brown switch (mode) { 5733552f7358SJed Brown case INSERT_VALUES: 5734552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 57351a271a75SMatthew G. Knepley const PetscInt point = points[p]; 57361a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 57371a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5738552f7358SJed Brown } break; 5739552f7358SJed Brown case INSERT_ALL_VALUES: 5740552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 57411a271a75SMatthew G. Knepley const PetscInt point = points[p]; 57421a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 57431a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5744552f7358SJed Brown } break; 5745a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5746a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 57471a271a75SMatthew G. Knepley const PetscInt point = points[p]; 57481a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 57491a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5750a5e93ea8SMatthew G. Knepley } break; 5751552f7358SJed Brown case ADD_VALUES: 5752552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 57531a271a75SMatthew G. Knepley const PetscInt point = points[p]; 57541a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 57551a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5756552f7358SJed Brown } break; 5757552f7358SJed Brown case ADD_ALL_VALUES: 5758552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 57591a271a75SMatthew G. Knepley const PetscInt point = points[p]; 57601a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 57611a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5762552f7358SJed Brown } break; 5763552f7358SJed Brown default: 576482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5765552f7358SJed Brown } 57661a271a75SMatthew G. Knepley } 5767552f7358SJed Brown } else { 57681a271a75SMatthew G. Knepley PetscInt dof, off; 57691a271a75SMatthew G. Knepley 5770552f7358SJed Brown switch (mode) { 5771552f7358SJed Brown case INSERT_VALUES: 5772552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5773552f7358SJed Brown PetscInt o = points[p+1]; 5774552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5775552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5776552f7358SJed Brown } break; 5777552f7358SJed Brown case INSERT_ALL_VALUES: 5778552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5779552f7358SJed Brown PetscInt o = points[p+1]; 5780552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5781552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5782552f7358SJed Brown } break; 5783a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5784a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5785a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5786a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5787a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5788a5e93ea8SMatthew G. Knepley } break; 5789552f7358SJed Brown case ADD_VALUES: 5790552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5791552f7358SJed Brown PetscInt o = points[p+1]; 5792552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5793552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5794552f7358SJed Brown } break; 5795552f7358SJed Brown case ADD_ALL_VALUES: 5796552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5797552f7358SJed Brown PetscInt o = points[p+1]; 5798552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5799552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5800552f7358SJed Brown } break; 5801552f7358SJed Brown default: 580282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5803552f7358SJed Brown } 5804552f7358SJed Brown } 58051a271a75SMatthew G. Knepley /* Cleanup points */ 58061a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 58071a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 58081a271a75SMatthew G. Knepley /* Cleanup array */ 5809552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5810552f7358SJed Brown PetscFunctionReturn(0); 5811552f7358SJed Brown } 5812552f7358SJed Brown 5813552f7358SJed Brown #undef __FUNCT__ 5814552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5815b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 5816552f7358SJed Brown { 5817552f7358SJed Brown PetscMPIInt rank; 5818552f7358SJed Brown PetscInt i, j; 5819552f7358SJed Brown PetscErrorCode ierr; 5820552f7358SJed Brown 5821552f7358SJed Brown PetscFunctionBegin; 582282f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 582377a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5824b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5825b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5826b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5827b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 582877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5829b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5830519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 58317eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5832552f7358SJed Brown #else 5833b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 5834552f7358SJed Brown #endif 5835552f7358SJed Brown } 583677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5837552f7358SJed Brown } 5838552f7358SJed Brown PetscFunctionReturn(0); 5839552f7358SJed Brown } 5840552f7358SJed Brown 5841552f7358SJed Brown #undef __FUNCT__ 5842552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5843552f7358SJed Brown /* . off - The global offset of this point */ 5844e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5845a6dfd86eSKarl Rupp { 5846e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5847552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5848552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5849552f7358SJed Brown PetscInt cind = 0, k; 5850552f7358SJed Brown PetscErrorCode ierr; 5851552f7358SJed Brown 5852552f7358SJed Brown PetscFunctionBegin; 5853552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5854552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5855552f7358SJed Brown if (!cdof || setBC) { 5856552f7358SJed Brown if (orientation >= 0) { 5857e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5858552f7358SJed Brown } else { 5859e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5860552f7358SJed Brown } 5861552f7358SJed Brown } else { 5862552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5863552f7358SJed Brown if (orientation >= 0) { 5864552f7358SJed Brown for (k = 0; k < dof; ++k) { 5865552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5866552f7358SJed Brown /* Insert check for returning constrained indices */ 5867e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5868552f7358SJed Brown ++cind; 5869552f7358SJed Brown } else { 5870e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5871552f7358SJed Brown } 5872552f7358SJed Brown } 5873552f7358SJed Brown } else { 5874552f7358SJed Brown for (k = 0; k < dof; ++k) { 5875552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5876552f7358SJed Brown /* Insert check for returning constrained indices */ 5877e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5878552f7358SJed Brown ++cind; 5879552f7358SJed Brown } else { 5880e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5881552f7358SJed Brown } 5882552f7358SJed Brown } 5883552f7358SJed Brown } 5884552f7358SJed Brown } 5885e6ccafaeSMatthew G Knepley *loff += dof; 5886552f7358SJed Brown PetscFunctionReturn(0); 5887552f7358SJed Brown } 5888552f7358SJed Brown 5889552f7358SJed Brown #undef __FUNCT__ 5890552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5891552f7358SJed Brown /* . off - The global offset of this point */ 5892a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5893a6dfd86eSKarl Rupp { 5894552f7358SJed Brown PetscInt numFields, foff, f; 5895552f7358SJed Brown PetscErrorCode ierr; 5896552f7358SJed Brown 5897552f7358SJed Brown PetscFunctionBegin; 5898552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5899552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5900552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5901552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5902552f7358SJed Brown PetscInt cind = 0, k, c; 5903552f7358SJed Brown 5904552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5905552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5906552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5907552f7358SJed Brown if (!cfdof || setBC) { 5908552f7358SJed Brown if (orientation >= 0) { 59090d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5910552f7358SJed Brown } else { 5911552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5912552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5913552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5914552f7358SJed Brown } 5915552f7358SJed Brown } 5916552f7358SJed Brown } 5917552f7358SJed Brown } else { 5918552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5919552f7358SJed Brown if (orientation >= 0) { 5920552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5921552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5922552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5923552f7358SJed Brown ++cind; 5924552f7358SJed Brown } else { 5925552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5926552f7358SJed Brown } 5927552f7358SJed Brown } 5928552f7358SJed Brown } else { 5929552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5930552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5931552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5932552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5933552f7358SJed Brown ++cind; 5934552f7358SJed Brown } else { 5935552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5936552f7358SJed Brown } 5937552f7358SJed Brown } 5938552f7358SJed Brown } 5939552f7358SJed Brown } 5940552f7358SJed Brown } 5941552f7358SJed Brown foff += fdof - cfdof; 5942552f7358SJed Brown foffs[f] += fdof; 5943552f7358SJed Brown } 5944552f7358SJed Brown PetscFunctionReturn(0); 5945552f7358SJed Brown } 5946552f7358SJed Brown 5947552f7358SJed Brown #undef __FUNCT__ 5948552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 59497f5d1fdeSMatthew G. Knepley /*@C 59507f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 59517f5d1fdeSMatthew G. Knepley 59527f5d1fdeSMatthew G. Knepley Not collective 59537f5d1fdeSMatthew G. Knepley 59547f5d1fdeSMatthew G. Knepley Input Parameters: 59557f5d1fdeSMatthew G. Knepley + dm - The DM 5956ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5957ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 59587f5d1fdeSMatthew G. Knepley . A - The matrix 59597f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 59607f5d1fdeSMatthew G. Knepley . values - The array of values 59617f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 59627f5d1fdeSMatthew G. Knepley 59637f5d1fdeSMatthew G. Knepley Fortran Notes: 59647f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 59657f5d1fdeSMatthew G. Knepley 59667f5d1fdeSMatthew G. Knepley Level: intermediate 59677f5d1fdeSMatthew G. Knepley 59687f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 59697f5d1fdeSMatthew G. Knepley @*/ 59707c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5971552f7358SJed Brown { 5972552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 59731b406b76SMatthew G. Knepley PetscSection clSection; 59741b406b76SMatthew G. Knepley IS clPoints; 59750298fd71SBarry Smith PetscInt *points = NULL; 59761b406b76SMatthew G. Knepley const PetscInt *clp; 5977552f7358SJed Brown PetscInt *indices; 5978552f7358SJed Brown PetscInt offsets[32]; 5979552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5980552f7358SJed Brown PetscErrorCode ierr; 5981552f7358SJed Brown 5982552f7358SJed Brown PetscFunctionBegin; 5983552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5984ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 59853dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5986ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 59873dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 59883dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5989552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 599082f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5991552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 59921b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 59931b406b76SMatthew G. Knepley if (!clPoints) { 5994552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5995552f7358SJed Brown /* Compress out points not in the section */ 5996552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5997552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5998552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5999552f7358SJed Brown points[q*2] = points[p]; 6000552f7358SJed Brown points[q*2+1] = points[p+1]; 6001552f7358SJed Brown ++q; 6002552f7358SJed Brown } 6003552f7358SJed Brown } 6004552f7358SJed Brown numPoints = q; 60051b406b76SMatthew G. Knepley } else { 60061b406b76SMatthew G. Knepley PetscInt dof, off; 60071b406b76SMatthew G. Knepley 60081b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 60091b406b76SMatthew G. Knepley numPoints = dof/2; 60101b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 60111b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 60121b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 60131b406b76SMatthew G. Knepley } 6014552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 6015552f7358SJed Brown PetscInt fdof; 6016552f7358SJed Brown 6017552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 6018552f7358SJed Brown for (f = 0; f < numFields; ++f) { 6019552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 6020552f7358SJed Brown offsets[f+1] += fdof; 6021552f7358SJed Brown } 6022552f7358SJed Brown numIndices += dof; 6023552f7358SJed Brown } 60240d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 60250d644c17SKarl Rupp 602682f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 6027552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 6028552f7358SJed Brown if (numFields) { 6029552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 6030552f7358SJed Brown PetscInt o = points[p+1]; 6031552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 6032552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 6033552f7358SJed Brown } 6034552f7358SJed Brown } else { 6035e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 6036552f7358SJed Brown PetscInt o = points[p+1]; 6037552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 6038e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 6039552f7358SJed Brown } 6040552f7358SJed Brown } 6041b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 6042552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 6043552f7358SJed Brown if (ierr) { 6044552f7358SJed Brown PetscMPIInt rank; 6045552f7358SJed Brown PetscErrorCode ierr2; 6046552f7358SJed Brown 604782f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 604877a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 6049b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 60506a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 6051552f7358SJed Brown CHKERRQ(ierr); 6052552f7358SJed Brown } 60531b406b76SMatthew G. Knepley if (!clPoints) { 6054552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 60551b406b76SMatthew G. Knepley } else { 60561b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 60571b406b76SMatthew G. Knepley } 6058552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 6059552f7358SJed Brown PetscFunctionReturn(0); 6060552f7358SJed Brown } 6061552f7358SJed Brown 6062552f7358SJed Brown #undef __FUNCT__ 6063de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 6064de41b84cSMatthew 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) 6065de41b84cSMatthew G. Knepley { 6066de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 6067de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 6068de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 6069de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 6070de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 6071de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 60724ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 6073de41b84cSMatthew G. Knepley PetscErrorCode ierr; 6074de41b84cSMatthew G. Knepley 6075de41b84cSMatthew G. Knepley PetscFunctionBegin; 6076de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 6077de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 6078de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 6079de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 6080de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 6081de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 6082de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 6083de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 6084de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 6085de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 6086de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 6087de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 6088de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 6089de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 6090de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 6091de41b84cSMatthew G. Knepley /* Column indices */ 6092de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 60934ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 6094de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 6095de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 6096de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 6097de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 6098de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 6099de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 6100de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 6101de41b84cSMatthew G. Knepley ++q; 6102de41b84cSMatthew G. Knepley } 6103de41b84cSMatthew G. Knepley } 6104de41b84cSMatthew G. Knepley numCPoints = q; 6105de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 6106de41b84cSMatthew G. Knepley PetscInt fdof; 6107de41b84cSMatthew G. Knepley 6108de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 61094ca5e9f5SMatthew G. Knepley if (!dof) continue; 6110de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6111de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 6112de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 6113de41b84cSMatthew G. Knepley } 6114de41b84cSMatthew G. Knepley numCIndices += dof; 6115de41b84cSMatthew G. Knepley } 6116de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 6117de41b84cSMatthew G. Knepley /* Row indices */ 6118de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 6119de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 61201ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 6121de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 6122de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 6123de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 6124de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 6125de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 6126de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 6127de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 61284ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 61294ca5e9f5SMatthew G. Knepley if (!dof) continue; 61304ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 61314ca5e9f5SMatthew G. Knepley if (s < q) continue; 6132de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 6133de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 6134de41b84cSMatthew G. Knepley ++q; 6135de41b84cSMatthew G. Knepley } 6136de41b84cSMatthew G. Knepley } 6137de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 6138de41b84cSMatthew G. Knepley } 6139de41b84cSMatthew G. Knepley numFPoints = q; 6140de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 6141de41b84cSMatthew G. Knepley PetscInt fdof; 6142de41b84cSMatthew G. Knepley 6143de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 61444ca5e9f5SMatthew G. Knepley if (!dof) continue; 6145de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6146de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 6147de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 6148de41b84cSMatthew G. Knepley } 6149de41b84cSMatthew G. Knepley numFIndices += dof; 6150de41b84cSMatthew G. Knepley } 6151de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 6152de41b84cSMatthew G. Knepley 6153de41b84cSMatthew 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); 6154de41b84cSMatthew 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); 6155de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6156de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6157de41b84cSMatthew G. Knepley if (numFields) { 6158de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 6159de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6160de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6161de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 6162de41b84cSMatthew G. Knepley } 6163de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 6164de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6165de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6166de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 6167de41b84cSMatthew G. Knepley } 6168de41b84cSMatthew G. Knepley } else { 6169de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 6170de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6171de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6172de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 6173de41b84cSMatthew G. Knepley } 6174de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 6175de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6176de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6177de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 6178de41b84cSMatthew G. Knepley } 6179de41b84cSMatthew G. Knepley } 6180de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 6181de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 6182de41b84cSMatthew G. Knepley if (ierr) { 6183de41b84cSMatthew G. Knepley PetscMPIInt rank; 6184de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 6185de41b84cSMatthew G. Knepley 6186de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 6187de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 6188de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 6189de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 6190de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 6191de41b84cSMatthew G. Knepley CHKERRQ(ierr); 6192de41b84cSMatthew G. Knepley } 6193549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 6194de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 6195de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6196de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6197de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 6198de41b84cSMatthew G. Knepley } 6199de41b84cSMatthew G. Knepley 6200de41b84cSMatthew G. Knepley #undef __FUNCT__ 6201770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 6202f96281f8SMatthew G. Knepley /*@ 6203f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 6204f96281f8SMatthew G. Knepley 6205f96281f8SMatthew G. Knepley Input Parameter: 6206f96281f8SMatthew G. Knepley . dm - The DMPlex object 6207f96281f8SMatthew G. Knepley 6208f96281f8SMatthew G. Knepley Output Parameters: 6209f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 6210f96281f8SMatthew G. Knepley . cMax - The first hybrid face 6211f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 6212f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 6213f96281f8SMatthew G. Knepley 6214f96281f8SMatthew G. Knepley Level: developer 6215f96281f8SMatthew G. Knepley 6216f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 6217f96281f8SMatthew G. Knepley @*/ 6218770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 6219552f7358SJed Brown { 6220552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6221770b213bSMatthew G Knepley PetscInt dim; 6222770b213bSMatthew G Knepley PetscErrorCode ierr; 6223552f7358SJed Brown 6224552f7358SJed Brown PetscFunctionBegin; 6225552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6226770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6227770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 6228770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 6229770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 6230770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 6231552f7358SJed Brown PetscFunctionReturn(0); 6232552f7358SJed Brown } 6233552f7358SJed Brown 6234552f7358SJed Brown #undef __FUNCT__ 6235770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 6236770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 6237552f7358SJed Brown { 6238552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6239770b213bSMatthew G Knepley PetscInt dim; 6240770b213bSMatthew G Knepley PetscErrorCode ierr; 6241552f7358SJed Brown 6242552f7358SJed Brown PetscFunctionBegin; 6243552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6244770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6245770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 6246770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 6247770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 6248770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 6249552f7358SJed Brown PetscFunctionReturn(0); 6250552f7358SJed Brown } 6251552f7358SJed Brown 6252552f7358SJed Brown #undef __FUNCT__ 6253552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 6254552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 6255552f7358SJed Brown { 6256552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6257552f7358SJed Brown 6258552f7358SJed Brown PetscFunctionBegin; 6259552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6260552f7358SJed Brown PetscValidPointer(cellHeight, 2); 6261552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 6262552f7358SJed Brown PetscFunctionReturn(0); 6263552f7358SJed Brown } 6264552f7358SJed Brown 6265552f7358SJed Brown #undef __FUNCT__ 6266552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 6267552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 6268552f7358SJed Brown { 6269552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6270552f7358SJed Brown 6271552f7358SJed Brown PetscFunctionBegin; 6272552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6273552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 6274552f7358SJed Brown PetscFunctionReturn(0); 6275552f7358SJed Brown } 6276552f7358SJed Brown 6277552f7358SJed Brown #undef __FUNCT__ 6278552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 6279552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 6280552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 6281552f7358SJed Brown { 6282552f7358SJed Brown PetscSection section, globalSection; 6283552f7358SJed Brown PetscInt *numbers, p; 6284552f7358SJed Brown PetscErrorCode ierr; 6285552f7358SJed Brown 6286552f7358SJed Brown PetscFunctionBegin; 628782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 6288552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 6289552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6290552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 6291552f7358SJed Brown } 6292552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 6293552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 6294785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 6295552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6296552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 6297552f7358SJed Brown } 629882f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 6299552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6300552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 6301552f7358SJed Brown PetscFunctionReturn(0); 6302552f7358SJed Brown } 6303552f7358SJed Brown 6304552f7358SJed Brown #undef __FUNCT__ 6305552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 6306552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 6307552f7358SJed Brown { 6308552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6309552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 6310552f7358SJed Brown PetscErrorCode ierr; 6311552f7358SJed Brown 6312552f7358SJed Brown PetscFunctionBegin; 6313552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6314552f7358SJed Brown if (!mesh->globalCellNumbers) { 6315552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6316552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 63170298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 63180d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6319552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6320552f7358SJed Brown } 6321552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6322552f7358SJed Brown PetscFunctionReturn(0); 6323552f7358SJed Brown } 6324552f7358SJed Brown 6325552f7358SJed Brown #undef __FUNCT__ 6326552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6327552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6328552f7358SJed Brown { 6329552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6330552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6331552f7358SJed Brown PetscErrorCode ierr; 6332552f7358SJed Brown 6333552f7358SJed Brown PetscFunctionBegin; 6334552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6335552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6336552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 63370298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 63380d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6339552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6340552f7358SJed Brown } 6341552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6342552f7358SJed Brown PetscFunctionReturn(0); 6343552f7358SJed Brown } 6344552f7358SJed Brown 6345552f7358SJed Brown 6346552f7358SJed Brown #undef __FUNCT__ 6347552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6348552f7358SJed Brown /*@C 6349552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6350552f7358SJed Brown the local section and an SF describing the section point overlap. 6351552f7358SJed Brown 6352552f7358SJed Brown Input Parameters: 6353552f7358SJed Brown + s - The PetscSection for the local field layout 6354552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6355552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6356552f7358SJed Brown . label - The label specifying the points 6357552f7358SJed Brown - labelValue - The label stratum specifying the points 6358552f7358SJed Brown 6359552f7358SJed Brown Output Parameter: 6360552f7358SJed Brown . gsection - The PetscSection for the global field layout 6361552f7358SJed Brown 6362552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6363552f7358SJed Brown 6364552f7358SJed Brown Level: developer 6365552f7358SJed Brown 6366552f7358SJed Brown .seealso: PetscSectionCreate() 6367552f7358SJed Brown @*/ 6368552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6369552f7358SJed Brown { 63707ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6371552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6372552f7358SJed Brown PetscErrorCode ierr; 6373552f7358SJed Brown 6374552f7358SJed Brown PetscFunctionBegin; 6375552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 6376552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6377552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 63787ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 63797ec39499SMatthew G. Knepley if (nroots >= 0) { 63807ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 63811795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 63827ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 63831795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 63847ec39499SMatthew G. Knepley } else { 63857ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 63867ec39499SMatthew G. Knepley } 63877ec39499SMatthew G. Knepley } 6388552f7358SJed Brown /* Mark ghost points with negative dof */ 6389552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6390552f7358SJed Brown PetscInt value; 6391552f7358SJed Brown 6392552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6393552f7358SJed Brown if (value != labelValue) continue; 6394552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6395552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6396552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6397552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 63987ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6399552f7358SJed Brown } 6400552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6401552f7358SJed Brown if (nroots >= 0) { 64027ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64037ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6404552f7358SJed Brown if (nroots > pEnd-pStart) { 64057ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6406552f7358SJed Brown } 6407552f7358SJed Brown } 6408552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6409552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6410552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6411552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6412552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6413552f7358SJed Brown } 6414552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 6415552f7358SJed Brown globalOff -= off; 6416552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6417552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 64187ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6419552f7358SJed Brown } 6420552f7358SJed Brown /* Put in negative offsets for ghost points */ 6421552f7358SJed Brown if (nroots >= 0) { 64227ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 64237ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6424552f7358SJed Brown if (nroots > pEnd-pStart) { 64257ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6426552f7358SJed Brown } 6427552f7358SJed Brown } 64287ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6429552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6430552f7358SJed Brown PetscFunctionReturn(0); 6431552f7358SJed Brown } 6432ca8062c8SMatthew G. Knepley 6433ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6434ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6435ca8062c8SMatthew G. Knepley /*@ 6436ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6437ca8062c8SMatthew G. Knepley 6438ca8062c8SMatthew G. Knepley Input Parameters: 6439ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6440ca8062c8SMatthew G. Knepley 6441ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6442ca8062c8SMatthew G. Knepley 6443ca8062c8SMatthew G. Knepley Level: developer 6444ca8062c8SMatthew G. Knepley 64459bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6446ca8062c8SMatthew G. Knepley @*/ 6447ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6448ca8062c8SMatthew G. Knepley { 6449ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6450ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6451ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6452ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6453ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6454ca8062c8SMatthew G. Knepley 6455ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6456ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6457ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6458ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6459ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6460ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6461ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6462ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6463ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6464ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 646542e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 646642e66dfaSMatthew G. Knepley PetscInt d; 646742e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 646842e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 646942e66dfaSMatthew G. Knepley } 6470ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6471ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6472ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6473ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6474ca8062c8SMatthew G. Knepley } 647542e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 6476ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6477ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6478ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6479ca8062c8SMatthew G. Knepley } 6480ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6481ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6482ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6483ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6484ca8062c8SMatthew G. Knepley } 6485ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 648642e66dfaSMatthew G. Knepley if (dup) { 648742e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 648842e66dfaSMatthew G. Knepley } else { 6489ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6490ca8062c8SMatthew G. Knepley } 6491ca8062c8SMatthew G. Knepley } 649242e66dfaSMatthew G. Knepley } 6493ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6494ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6495ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6496ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6497ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6498ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6499ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6500ca8062c8SMatthew G. Knepley } 6501ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6502ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6503ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6504ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6505ca8062c8SMatthew G. Knepley } 6506ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6507ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6508ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6509ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6510ca8062c8SMatthew G. Knepley } 6511ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6512ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6513ca8062c8SMatthew G. Knepley } 6514ca8062c8SMatthew G. Knepley } 6515ca8062c8SMatthew G. Knepley } 6516ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6517ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6518ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6519ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6520ca8062c8SMatthew G. Knepley } 6521ca8062c8SMatthew G. Knepley 6522ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6523ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6524ca8062c8SMatthew G. Knepley /*@ 6525ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6526ca8062c8SMatthew G. Knepley 6527ca8062c8SMatthew G. Knepley Input Parameters: 6528ca8062c8SMatthew G. Knepley + dm - The DMPlex object 652958723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 653058723a97SMatthew G. Knepley - cellHeight - Normally 0 6531ca8062c8SMatthew G. Knepley 6532ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6533ca8062c8SMatthew G. Knepley 6534ca8062c8SMatthew G. Knepley Level: developer 6535ca8062c8SMatthew G. Knepley 65369bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6537ca8062c8SMatthew G. Knepley @*/ 653858723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6539ca8062c8SMatthew G. Knepley { 654042363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6541ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6542ca8062c8SMatthew G. Knepley 6543ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6544ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6545ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6546ca8062c8SMatthew G. Knepley switch (dim) { 654742363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 654842363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 654942363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6550ca8062c8SMatthew G. Knepley default: 6551ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6552ca8062c8SMatthew G. Knepley } 655358723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 655458723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6555ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6556ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6557ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 655858723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 655958723a97SMatthew G. Knepley 656058723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 656158723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 656258723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 656358723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 656458723a97SMatthew G. Knepley } 656558723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6566ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6567ca8062c8SMatthew G. Knepley } 656842363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 656942363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 657042363296SMatthew G. Knepley 657142363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 657242363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 657342363296SMatthew G. Knepley const PetscInt p = closure[cl]; 657442363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 657542363296SMatthew G. Knepley } 657642363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 657742363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 657842363296SMatthew G. Knepley } 6579ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6580ca8062c8SMatthew G. Knepley } 65819bf0dad6SMatthew G. Knepley 65829bf0dad6SMatthew G. Knepley #undef __FUNCT__ 65839bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 65849bf0dad6SMatthew G. Knepley /*@ 65859bf0dad6SMatthew 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 65869bf0dad6SMatthew G. Knepley 65879bf0dad6SMatthew G. Knepley Input Parameters: 65889bf0dad6SMatthew G. Knepley + dm - The DMPlex object 65899bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 65909bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 65919bf0dad6SMatthew G. Knepley 65929bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 65939bf0dad6SMatthew G. Knepley 65949bf0dad6SMatthew G. Knepley Level: developer 65959bf0dad6SMatthew G. Knepley 65969bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 65979bf0dad6SMatthew G. Knepley @*/ 65989bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 65999bf0dad6SMatthew G. Knepley { 66003554e41dSMatthew G. Knepley PetscInt pMax[4]; 66013554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 66029bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 66039bf0dad6SMatthew G. Knepley 66049bf0dad6SMatthew G. Knepley PetscFunctionBegin; 66059bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 66069bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 66079bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 660825abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 66093554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 66103554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 66113554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 66129bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 66139bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 66149bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 66159bf0dad6SMatthew G. Knepley 661625abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 66179bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 66189bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 66199bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 66209bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66219bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 66229bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 66239bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 66249bf0dad6SMatthew G. Knepley } 66253554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66269bf0dad6SMatthew 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); 66279bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 66289bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 66299bf0dad6SMatthew G. Knepley 66309bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66319bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 66329bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 66339bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 66349bf0dad6SMatthew G. Knepley } 6635e003ed69SMatthew 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); 66369bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6637e003ed69SMatthew 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]); 66389bf0dad6SMatthew G. Knepley } 66399bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 66409bf0dad6SMatthew G. Knepley } 66419bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 66429bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 66439bf0dad6SMatthew G. Knepley } 66443554e41dSMatthew G. Knepley } 6645552f7358SJed Brown PetscFunctionReturn(0); 6646552f7358SJed Brown } 66473913d7c8SMatthew G. Knepley 66483913d7c8SMatthew G. Knepley #undef __FUNCT__ 6649bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6650bceba477SMatthew G. Knepley /* Pointwise interpolation 6651bceba477SMatthew G. Knepley Just code FEM for now 6652bceba477SMatthew G. Knepley u^f = I u^c 66534ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 66544ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 66554ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6656bceba477SMatthew G. Knepley */ 6657bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6658bceba477SMatthew G. Knepley { 6659bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6660bceba477SMatthew G. Knepley PetscInt m, n; 6661a063dac3SMatthew G. Knepley void *ctx; 6662bceba477SMatthew G. Knepley PetscErrorCode ierr; 6663bceba477SMatthew G. Knepley 6664bceba477SMatthew G. Knepley PetscFunctionBegin; 6665bceba477SMatthew G. Knepley /* 6666bceba477SMatthew G. Knepley Loop over coarse cells 6667bceba477SMatthew G. Knepley Loop over coarse basis functions 6668bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6669bceba477SMatthew G. Knepley Loop over fine dual basis functions 6670bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6671bceba477SMatthew G. Knepley Sum 6672bceba477SMatthew G. Knepley Update local element matrix 6673bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6674bceba477SMatthew G. Knepley 6675bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6676bceba477SMatthew G. Knepley */ 6677bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6678bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6679bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6680bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6681bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6682bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6683bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6684bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6685bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 6686bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 6687bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 6688a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6689a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 6690*5d1c2e58SMatthew G. Knepley /* Use naive scaling */ 6691*5d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 6692a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6693a063dac3SMatthew G. Knepley } 6694bceba477SMatthew G. Knepley 6695a063dac3SMatthew G. Knepley #undef __FUNCT__ 6696a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6697a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6698a063dac3SMatthew G. Knepley { 669990748bafSMatthew G. Knepley Vec cv, fv; 670090748bafSMatthew G. Knepley IS cis, fis, fpointIS; 670190748bafSMatthew G. Knepley PetscSection sc, gsc, gsf; 670290748bafSMatthew G. Knepley const PetscInt *fpoints; 670390748bafSMatthew G. Knepley PetscInt *cindices, *findices; 670490748bafSMatthew G. Knepley PetscInt cpStart, cpEnd, m, off, cp; 670590748bafSMatthew G. Knepley PetscErrorCode ierr; 670690748bafSMatthew G. Knepley 6707a063dac3SMatthew G. Knepley PetscFunctionBegin; 670890748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 670990748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr); 671090748bafSMatthew G. Knepley ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr); 671190748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 671290748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 671390748bafSMatthew G. Knepley ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr); 671490748bafSMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr); 671590748bafSMatthew G. Knepley ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr); 671690748bafSMatthew G. Knepley ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr); 671790748bafSMatthew G. Knepley ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr); 671890748bafSMatthew G. Knepley for (cp = cpStart, off = 0; cp < cpEnd; ++cp) { 671990748bafSMatthew G. Knepley const PetscInt *cdofsC = NULL; 672090748bafSMatthew G. Knepley PetscInt fp = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e; 672190748bafSMatthew G. Knepley 672290748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr); 672390748bafSMatthew G. Knepley if (dofC <= 0) continue; 672490748bafSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr); 672590748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr); 672690748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr); 672790748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr); 672890748bafSMatthew G. Knepley if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);} 672990748bafSMatthew G. Knepley if (dofC != dofF) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has %d coarse dofs != %d fine dofs", cp, fp, dofC, dofF); 673090748bafSMatthew G. Knepley if (offC < 0 || offF < 0) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Coarse point %d has invalid offset %d (%d)", cp, offC, offF); 673190748bafSMatthew G. Knepley for (d = 0, e = 0; d < dofC; ++d) { 673290748bafSMatthew G. Knepley if (cdofsC && cdofsC[e] == d) {++e; continue;} 673390748bafSMatthew G. Knepley cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d; 673490748bafSMatthew G. Knepley } 673590748bafSMatthew G. Knepley if (e != cdofC) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has invalid number of constraints %d != %d", cp, fp, e, cdofC); 673690748bafSMatthew G. Knepley off += dofC-cdofC; 673790748bafSMatthew G. Knepley } 673890748bafSMatthew G. Knepley ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr); 673990748bafSMatthew G. Knepley if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m); 674090748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr); 674190748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr); 674290748bafSMatthew G. Knepley ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr); 674390748bafSMatthew G. Knepley ierr = ISDestroy(&cis);CHKERRQ(ierr); 674490748bafSMatthew G. Knepley ierr = ISDestroy(&fis);CHKERRQ(ierr); 674590748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr); 674690748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 674790748bafSMatthew G. Knepley ierr = ISDestroy(&fpointIS);CHKERRQ(ierr); 6748bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6749bceba477SMatthew G. Knepley } 6750bceba477SMatthew G. Knepley 6751bceba477SMatthew G. Knepley #undef __FUNCT__ 6752fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6753fd59a867SMatthew G. Knepley /* Pointwise interpolation 6754fd59a867SMatthew G. Knepley Just code FEM for now 6755fd59a867SMatthew G. Knepley u^f = I u^c 6756fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6757fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6758fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6759fd59a867SMatthew G. Knepley */ 6760fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6761fd59a867SMatthew G. Knepley { 6762fd59a867SMatthew G. Knepley PetscSection section; 6763fd59a867SMatthew G. Knepley IS *bcPoints; 6764286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6765286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6766fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6767fd59a867SMatthew G. Knepley 6768fd59a867SMatthew G. Knepley PetscFunctionBegin; 6769fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6770286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6771fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6772fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6773fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6774fd59a867SMatthew G. Knepley PetscBool isEssential; 6775fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6776fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6777fd59a867SMatthew G. Knepley } 6778fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6779fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6780fd59a867SMatthew G. Knepley const char *bdLabel; 6781fd59a867SMatthew G. Knepley DMLabel label; 6782fd59a867SMatthew G. Knepley const PetscInt *values; 6783fd59a867SMatthew G. Knepley PetscInt field, numValues; 6784fd59a867SMatthew G. Knepley PetscBool isEssential, has; 6785fd59a867SMatthew G. Knepley 6786fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6787fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6788fd59a867SMatthew G. Knepley ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr); 6789fd59a867SMatthew G. Knepley if (!has) { 6790fd59a867SMatthew G. Knepley ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr); 6791fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6792fd59a867SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 6793fd59a867SMatthew G. Knepley } 6794fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6795fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 6796fd59a867SMatthew G. Knepley if (isEssential) { 6797fd59a867SMatthew G. Knepley bcFields[bc] = field; 6798fd59a867SMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &bcPoints[bc++]);CHKERRQ(ierr); 6799fd59a867SMatthew G. Knepley } 6800fd59a867SMatthew G. Knepley } 6801fd59a867SMatthew G. Knepley /* Handle discretization */ 6802fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6803286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6804fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6805fd59a867SMatthew G. Knepley PetscFE fe; 6806286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6807fd59a867SMatthew G. Knepley PetscInt d; 6808fd59a867SMatthew G. Knepley 680918abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6810fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6811286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6812286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6813fd59a867SMatthew G. Knepley } 6814286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6815286d8613SMatthew G. Knepley PetscInt d; 6816286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6817286d8613SMatthew 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."); 6818286d8613SMatthew G. Knepley } 6819286d8613SMatthew G. Knepley } 6820286d8613SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, §ion);CHKERRQ(ierr); 6821fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6822fd59a867SMatthew G. Knepley PetscFE fe; 6823fd59a867SMatthew G. Knepley const char *name; 682418abd763SMatthew G. Knepley 682518abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6826fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6827fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6828fd59a867SMatthew G. Knepley } 6829fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6830fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6831fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6832fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6833286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6834bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6835bceba477SMatthew G. Knepley } 6836bceba477SMatthew G. Knepley 6837bceba477SMatthew G. Knepley #undef __FUNCT__ 68383913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 68393913d7c8SMatthew G. Knepley /*@ 68403913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 68413913d7c8SMatthew G. Knepley 68423913d7c8SMatthew G. Knepley Input Parameter: 68433913d7c8SMatthew G. Knepley . dm - The DMPlex object 68443913d7c8SMatthew G. Knepley 68453913d7c8SMatthew G. Knepley Output Parameter: 68463913d7c8SMatthew G. Knepley . cdm - The coarse DM 68473913d7c8SMatthew G. Knepley 68483913d7c8SMatthew G. Knepley Level: intermediate 68493913d7c8SMatthew G. Knepley 68503913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 68513913d7c8SMatthew G. Knepley @*/ 68523913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 68533913d7c8SMatthew G. Knepley { 68543913d7c8SMatthew G. Knepley PetscFunctionBegin; 68553913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68563913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 68573913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 68583913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68593913d7c8SMatthew G. Knepley } 68603913d7c8SMatthew G. Knepley 68613913d7c8SMatthew G. Knepley #undef __FUNCT__ 68623913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 68633913d7c8SMatthew G. Knepley /*@ 68643913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 68653913d7c8SMatthew G. Knepley 68663913d7c8SMatthew G. Knepley Input Parameters: 68673913d7c8SMatthew G. Knepley + dm - The DMPlex object 68683913d7c8SMatthew G. Knepley - cdm - The coarse DM 68693913d7c8SMatthew G. Knepley 68703913d7c8SMatthew G. Knepley Level: intermediate 68713913d7c8SMatthew G. Knepley 68723913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 68733913d7c8SMatthew G. Knepley @*/ 68743913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 68753913d7c8SMatthew G. Knepley { 68763913d7c8SMatthew G. Knepley DM_Plex *mesh; 68773913d7c8SMatthew G. Knepley PetscErrorCode ierr; 68783913d7c8SMatthew G. Knepley 68793913d7c8SMatthew G. Knepley PetscFunctionBegin; 68803913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 68813913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 68823913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 68833913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 68843913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 68853913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 68863913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 68873913d7c8SMatthew G. Knepley } 6888