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__ 377552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 378552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 379552f7358SJed Brown { 380552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 381552f7358SJed Brown DMLabel next = mesh->labels; 382552f7358SJed Brown PetscErrorCode ierr; 383552f7358SJed Brown 384552f7358SJed Brown PetscFunctionBegin; 3850d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 386552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 387552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 388552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 389552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 390552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 391552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 392552f7358SJed Brown while (next) { 393552f7358SJed Brown DMLabel tmp = next->next; 394552f7358SJed Brown 395552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 396552f7358SJed Brown next = tmp; 397552f7358SJed Brown } 398a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 399552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 400552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 401552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 402552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 403552f7358SJed Brown PetscFunctionReturn(0); 404552f7358SJed Brown } 405552f7358SJed Brown 406552f7358SJed Brown #undef __FUNCT__ 407552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 408b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 409552f7358SJed Brown { 410552f7358SJed Brown PetscSection section, sectionGlobal; 411552f7358SJed Brown PetscInt bs = -1; 412552f7358SJed Brown PetscInt localSize; 41389545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 414552f7358SJed Brown PetscErrorCode ierr; 415b412c318SBarry Smith MatType mtype; 416552f7358SJed Brown 417552f7358SJed Brown PetscFunctionBegin; 418607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 419b412c318SBarry Smith mtype = dm->mattype; 420552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 421552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 422552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 423552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 42482f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 425552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 426552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 427552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 428552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 429552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 430552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 431552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 432552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 433552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 434552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 435552f7358SJed Brown if (!isShell) { 436552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 4372a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 438552f7358SJed Brown 439552f7358SJed Brown if (bs < 0) { 440552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 441fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 442552f7358SJed Brown 443552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 444552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 445552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 446fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 447fad22124SMatthew G Knepley if (dof-cdof) { 4482a28c762SMatthew G Knepley if (bs < 0) { 449fad22124SMatthew G Knepley bs = dof-cdof; 450fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 4512a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 4522a28c762SMatthew G Knepley bs = 1; 453552f7358SJed Brown break; 454552f7358SJed Brown } 455552f7358SJed Brown } 4562a28c762SMatthew G Knepley } 4572a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 4582a28c762SMatthew G Knepley bsLocal = bs; 45982f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4602a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 46182f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4622a28c762SMatthew G Knepley if (bsMin != bsMax) { 4632a28c762SMatthew G Knepley bs = 1; 4642a28c762SMatthew G Knepley } else { 4652a28c762SMatthew G Knepley bs = bsMax; 4662a28c762SMatthew G Knepley } 467552f7358SJed Brown } else { 468552f7358SJed Brown bs = 1; 469552f7358SJed Brown } 470552f7358SJed Brown } 4711795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 472552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 473552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 474552f7358SJed Brown } 475552f7358SJed Brown PetscFunctionReturn(0); 476552f7358SJed Brown } 477552f7358SJed Brown 478552f7358SJed Brown #undef __FUNCT__ 479552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 480552f7358SJed Brown /*@ 481552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 482552f7358SJed Brown 483552f7358SJed Brown Not collective 484552f7358SJed Brown 485552f7358SJed Brown Input Parameter: 486552f7358SJed Brown . mesh - The DMPlex 487552f7358SJed Brown 488552f7358SJed Brown Output Parameter: 489552f7358SJed Brown . dim - The topological mesh dimension 490552f7358SJed Brown 491552f7358SJed Brown Level: beginner 492552f7358SJed Brown 493552f7358SJed Brown .seealso: DMPlexCreate() 494552f7358SJed Brown @*/ 495552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 496552f7358SJed Brown { 497552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 498552f7358SJed Brown 499552f7358SJed Brown PetscFunctionBegin; 500552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 501552f7358SJed Brown PetscValidPointer(dim, 2); 502552f7358SJed Brown *dim = mesh->dim; 503552f7358SJed Brown PetscFunctionReturn(0); 504552f7358SJed Brown } 505552f7358SJed Brown 506552f7358SJed Brown #undef __FUNCT__ 507552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 508552f7358SJed Brown /*@ 509552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 510552f7358SJed Brown 511552f7358SJed Brown Collective on mesh 512552f7358SJed Brown 513552f7358SJed Brown Input Parameters: 514552f7358SJed Brown + mesh - The DMPlex 515552f7358SJed Brown - dim - The topological mesh dimension 516552f7358SJed Brown 517552f7358SJed Brown Level: beginner 518552f7358SJed Brown 519552f7358SJed Brown .seealso: DMPlexCreate() 520552f7358SJed Brown @*/ 521552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 522552f7358SJed Brown { 523552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 524552f7358SJed Brown 525552f7358SJed Brown PetscFunctionBegin; 526552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 527552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 528552f7358SJed Brown mesh->dim = dim; 529552f7358SJed Brown mesh->preallocCenterDim = dim; 530552f7358SJed Brown PetscFunctionReturn(0); 531552f7358SJed Brown } 532552f7358SJed Brown 533552f7358SJed Brown #undef __FUNCT__ 534552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 535552f7358SJed Brown /*@ 536552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 537552f7358SJed Brown 538552f7358SJed Brown Not collective 539552f7358SJed Brown 540552f7358SJed Brown Input Parameter: 541552f7358SJed Brown . mesh - The DMPlex 542552f7358SJed Brown 543552f7358SJed Brown Output Parameters: 544552f7358SJed Brown + pStart - The first mesh point 545552f7358SJed Brown - pEnd - The upper bound for mesh points 546552f7358SJed Brown 547552f7358SJed Brown Level: beginner 548552f7358SJed Brown 549552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 550552f7358SJed Brown @*/ 551552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 552552f7358SJed Brown { 553552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 554552f7358SJed Brown PetscErrorCode ierr; 555552f7358SJed Brown 556552f7358SJed Brown PetscFunctionBegin; 557552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 558552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 559552f7358SJed Brown PetscFunctionReturn(0); 560552f7358SJed Brown } 561552f7358SJed Brown 562552f7358SJed Brown #undef __FUNCT__ 563552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 564552f7358SJed Brown /*@ 565552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 566552f7358SJed Brown 567552f7358SJed Brown Not collective 568552f7358SJed Brown 569552f7358SJed Brown Input Parameters: 570552f7358SJed Brown + mesh - The DMPlex 571552f7358SJed Brown . pStart - The first mesh point 572552f7358SJed Brown - pEnd - The upper bound for mesh points 573552f7358SJed Brown 574552f7358SJed Brown Output Parameters: 575552f7358SJed Brown 576552f7358SJed Brown Level: beginner 577552f7358SJed Brown 578552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 579552f7358SJed Brown @*/ 580552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 581552f7358SJed Brown { 582552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 583552f7358SJed Brown PetscErrorCode ierr; 584552f7358SJed Brown 585552f7358SJed Brown PetscFunctionBegin; 586552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 587552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 588552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 589552f7358SJed Brown PetscFunctionReturn(0); 590552f7358SJed Brown } 591552f7358SJed Brown 592552f7358SJed Brown #undef __FUNCT__ 593552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 594552f7358SJed Brown /*@ 595552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 596552f7358SJed Brown 597552f7358SJed Brown Not collective 598552f7358SJed Brown 599552f7358SJed Brown Input Parameters: 600552f7358SJed Brown + mesh - The DMPlex 601552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 602552f7358SJed Brown 603552f7358SJed Brown Output Parameter: 604552f7358SJed Brown . size - The cone size for point p 605552f7358SJed Brown 606552f7358SJed Brown Level: beginner 607552f7358SJed Brown 608552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 609552f7358SJed Brown @*/ 610552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 611552f7358SJed Brown { 612552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 613552f7358SJed Brown PetscErrorCode ierr; 614552f7358SJed Brown 615552f7358SJed Brown PetscFunctionBegin; 616552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 617552f7358SJed Brown PetscValidPointer(size, 3); 618552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 619552f7358SJed Brown PetscFunctionReturn(0); 620552f7358SJed Brown } 621552f7358SJed Brown 622552f7358SJed Brown #undef __FUNCT__ 623552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 624552f7358SJed Brown /*@ 625552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 626552f7358SJed Brown 627552f7358SJed Brown Not collective 628552f7358SJed Brown 629552f7358SJed Brown Input Parameters: 630552f7358SJed Brown + mesh - The DMPlex 631552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 632552f7358SJed Brown - size - The cone size for point p 633552f7358SJed Brown 634552f7358SJed Brown Output Parameter: 635552f7358SJed Brown 636552f7358SJed Brown Note: 637552f7358SJed Brown This should be called after DMPlexSetChart(). 638552f7358SJed Brown 639552f7358SJed Brown Level: beginner 640552f7358SJed Brown 641552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 642552f7358SJed Brown @*/ 643552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 644552f7358SJed Brown { 645552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 646552f7358SJed Brown PetscErrorCode ierr; 647552f7358SJed Brown 648552f7358SJed Brown PetscFunctionBegin; 649552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 650552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 6510d644c17SKarl Rupp 652552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 653552f7358SJed Brown PetscFunctionReturn(0); 654552f7358SJed Brown } 655552f7358SJed Brown 656552f7358SJed Brown #undef __FUNCT__ 657552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 658552f7358SJed Brown /*@C 659552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 660552f7358SJed Brown 661552f7358SJed Brown Not collective 662552f7358SJed Brown 663552f7358SJed Brown Input Parameters: 664552f7358SJed Brown + mesh - The DMPlex 665552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 666552f7358SJed Brown 667552f7358SJed Brown Output Parameter: 668552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 669552f7358SJed Brown 670552f7358SJed Brown Level: beginner 671552f7358SJed Brown 6723813dfbdSMatthew G Knepley Fortran Notes: 6733813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 6743813dfbdSMatthew G Knepley include petsc.h90 in your code. 6753813dfbdSMatthew G Knepley 6763813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 677552f7358SJed Brown 678552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 679552f7358SJed Brown @*/ 680552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 681552f7358SJed Brown { 682552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 683552f7358SJed Brown PetscInt off; 684552f7358SJed Brown PetscErrorCode ierr; 685552f7358SJed Brown 686552f7358SJed Brown PetscFunctionBegin; 687552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 688552f7358SJed Brown PetscValidPointer(cone, 3); 689552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 690552f7358SJed Brown *cone = &mesh->cones[off]; 691552f7358SJed Brown PetscFunctionReturn(0); 692552f7358SJed Brown } 693552f7358SJed Brown 694552f7358SJed Brown #undef __FUNCT__ 695552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 696552f7358SJed Brown /*@ 697552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 698552f7358SJed Brown 699552f7358SJed Brown Not collective 700552f7358SJed Brown 701552f7358SJed Brown Input Parameters: 702552f7358SJed Brown + mesh - The DMPlex 703552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 704552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 705552f7358SJed Brown 706552f7358SJed Brown Output Parameter: 707552f7358SJed Brown 708552f7358SJed Brown Note: 709552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 710552f7358SJed Brown 711552f7358SJed Brown Level: beginner 712552f7358SJed Brown 713552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 714552f7358SJed Brown @*/ 715552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 716552f7358SJed Brown { 717552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 718552f7358SJed Brown PetscInt pStart, pEnd; 719552f7358SJed Brown PetscInt dof, off, c; 720552f7358SJed Brown PetscErrorCode ierr; 721552f7358SJed Brown 722552f7358SJed Brown PetscFunctionBegin; 723552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 724552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 725552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 726552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 727552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 72882f516ccSBarry 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); 729552f7358SJed Brown for (c = 0; c < dof; ++c) { 73082f516ccSBarry 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); 731552f7358SJed Brown mesh->cones[off+c] = cone[c]; 732552f7358SJed Brown } 733552f7358SJed Brown PetscFunctionReturn(0); 734552f7358SJed Brown } 735552f7358SJed Brown 736552f7358SJed Brown #undef __FUNCT__ 737552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 738552f7358SJed Brown /*@C 739552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 740552f7358SJed Brown 741552f7358SJed Brown Not collective 742552f7358SJed Brown 743552f7358SJed Brown Input Parameters: 744552f7358SJed Brown + mesh - The DMPlex 745552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 746552f7358SJed Brown 747552f7358SJed Brown Output Parameter: 748552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 749552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 750552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 751552f7358SJed Brown the index of the cone point on which to start. 752552f7358SJed Brown 753552f7358SJed Brown Level: beginner 754552f7358SJed Brown 7553813dfbdSMatthew G Knepley Fortran Notes: 7563813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7573813dfbdSMatthew G Knepley include petsc.h90 in your code. 7583813dfbdSMatthew G Knepley 7593813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 760552f7358SJed Brown 761552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 762552f7358SJed Brown @*/ 763552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 764552f7358SJed Brown { 765552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 766552f7358SJed Brown PetscInt off; 767552f7358SJed Brown PetscErrorCode ierr; 768552f7358SJed Brown 769552f7358SJed Brown PetscFunctionBegin; 770552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 771552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 772552f7358SJed Brown { 773552f7358SJed Brown PetscInt dof; 774552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 775552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 776552f7358SJed Brown } 777552f7358SJed Brown #endif 778552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 7790d644c17SKarl Rupp 780552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 781552f7358SJed Brown PetscFunctionReturn(0); 782552f7358SJed Brown } 783552f7358SJed Brown 784552f7358SJed Brown #undef __FUNCT__ 785552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 786552f7358SJed Brown /*@ 787552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 788552f7358SJed Brown 789552f7358SJed Brown Not collective 790552f7358SJed Brown 791552f7358SJed Brown Input Parameters: 792552f7358SJed Brown + mesh - The DMPlex 793552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 794552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 795552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 796552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 797552f7358SJed Brown the index of the cone point on which to start. 798552f7358SJed Brown 799552f7358SJed Brown Output Parameter: 800552f7358SJed Brown 801552f7358SJed Brown Note: 802552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 803552f7358SJed Brown 804552f7358SJed Brown Level: beginner 805552f7358SJed Brown 806552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 807552f7358SJed Brown @*/ 808552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 809552f7358SJed Brown { 810552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 811552f7358SJed Brown PetscInt pStart, pEnd; 812552f7358SJed Brown PetscInt dof, off, c; 813552f7358SJed Brown PetscErrorCode ierr; 814552f7358SJed Brown 815552f7358SJed Brown PetscFunctionBegin; 816552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 817552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 818552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 819552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 820552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 82182f516ccSBarry 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); 822552f7358SJed Brown for (c = 0; c < dof; ++c) { 823552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 824552f7358SJed Brown 825552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 82682f516ccSBarry 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); 827552f7358SJed Brown mesh->coneOrientations[off+c] = o; 828552f7358SJed Brown } 829552f7358SJed Brown PetscFunctionReturn(0); 830552f7358SJed Brown } 831552f7358SJed Brown 832552f7358SJed Brown #undef __FUNCT__ 833552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 834552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 835552f7358SJed Brown { 836552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 837552f7358SJed Brown PetscInt pStart, pEnd; 838552f7358SJed Brown PetscInt dof, off; 839552f7358SJed Brown PetscErrorCode ierr; 840552f7358SJed Brown 841552f7358SJed Brown PetscFunctionBegin; 842552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 843552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 84482f516ccSBarry 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); 84582f516ccSBarry 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); 84677c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 84777c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84877c88f5bSMatthew 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); 849552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 850552f7358SJed Brown PetscFunctionReturn(0); 851552f7358SJed Brown } 852552f7358SJed Brown 853552f7358SJed Brown #undef __FUNCT__ 85477c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 85577c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 85677c88f5bSMatthew G Knepley { 85777c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 85877c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 85977c88f5bSMatthew G Knepley PetscInt dof, off; 86077c88f5bSMatthew G Knepley PetscErrorCode ierr; 86177c88f5bSMatthew G Knepley 86277c88f5bSMatthew G Knepley PetscFunctionBegin; 86377c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 86477c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 86577c88f5bSMatthew 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); 86677c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 86777c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 86877c88f5bSMatthew 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); 86977c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 87077c88f5bSMatthew G Knepley PetscFunctionReturn(0); 87177c88f5bSMatthew G Knepley } 87277c88f5bSMatthew G Knepley 87377c88f5bSMatthew G Knepley #undef __FUNCT__ 874552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 875552f7358SJed Brown /*@ 876552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 877552f7358SJed Brown 878552f7358SJed Brown Not collective 879552f7358SJed Brown 880552f7358SJed Brown Input Parameters: 881552f7358SJed Brown + mesh - The DMPlex 882552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 883552f7358SJed Brown 884552f7358SJed Brown Output Parameter: 885552f7358SJed Brown . size - The support size for point p 886552f7358SJed Brown 887552f7358SJed Brown Level: beginner 888552f7358SJed Brown 889552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 890552f7358SJed Brown @*/ 891552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 892552f7358SJed Brown { 893552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 894552f7358SJed Brown PetscErrorCode ierr; 895552f7358SJed Brown 896552f7358SJed Brown PetscFunctionBegin; 897552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 898552f7358SJed Brown PetscValidPointer(size, 3); 899552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 900552f7358SJed Brown PetscFunctionReturn(0); 901552f7358SJed Brown } 902552f7358SJed Brown 903552f7358SJed Brown #undef __FUNCT__ 904552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 905552f7358SJed Brown /*@ 906552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 907552f7358SJed Brown 908552f7358SJed Brown Not collective 909552f7358SJed Brown 910552f7358SJed Brown Input Parameters: 911552f7358SJed Brown + mesh - The DMPlex 912552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 913552f7358SJed Brown - size - The support size for point p 914552f7358SJed Brown 915552f7358SJed Brown Output Parameter: 916552f7358SJed Brown 917552f7358SJed Brown Note: 918552f7358SJed Brown This should be called after DMPlexSetChart(). 919552f7358SJed Brown 920552f7358SJed Brown Level: beginner 921552f7358SJed Brown 922552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 923552f7358SJed Brown @*/ 924552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 925552f7358SJed Brown { 926552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 927552f7358SJed Brown PetscErrorCode ierr; 928552f7358SJed Brown 929552f7358SJed Brown PetscFunctionBegin; 930552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 931552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 9320d644c17SKarl Rupp 933552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 934552f7358SJed Brown PetscFunctionReturn(0); 935552f7358SJed Brown } 936552f7358SJed Brown 937552f7358SJed Brown #undef __FUNCT__ 938552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 939552f7358SJed Brown /*@C 940552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 941552f7358SJed Brown 942552f7358SJed Brown Not collective 943552f7358SJed Brown 944552f7358SJed Brown Input Parameters: 945552f7358SJed Brown + mesh - The DMPlex 946552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 947552f7358SJed Brown 948552f7358SJed Brown Output Parameter: 949552f7358SJed Brown . support - An array of points which are on the out-edges for point p 950552f7358SJed Brown 951552f7358SJed Brown Level: beginner 952552f7358SJed Brown 9533813dfbdSMatthew G Knepley Fortran Notes: 9543813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9553813dfbdSMatthew G Knepley include petsc.h90 in your code. 9563813dfbdSMatthew G Knepley 9573813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 9583813dfbdSMatthew G Knepley 959552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 960552f7358SJed Brown @*/ 961552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 962552f7358SJed Brown { 963552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 964552f7358SJed Brown PetscInt off; 965552f7358SJed Brown PetscErrorCode ierr; 966552f7358SJed Brown 967552f7358SJed Brown PetscFunctionBegin; 968552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 969552f7358SJed Brown PetscValidPointer(support, 3); 970552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 971552f7358SJed Brown *support = &mesh->supports[off]; 972552f7358SJed Brown PetscFunctionReturn(0); 973552f7358SJed Brown } 974552f7358SJed Brown 975552f7358SJed Brown #undef __FUNCT__ 976552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 977552f7358SJed Brown /*@ 978552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 979552f7358SJed Brown 980552f7358SJed Brown Not collective 981552f7358SJed Brown 982552f7358SJed Brown Input Parameters: 983552f7358SJed Brown + mesh - The DMPlex 984552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 985552f7358SJed Brown - support - An array of points which are on the in-edges for point p 986552f7358SJed Brown 987552f7358SJed Brown Output Parameter: 988552f7358SJed Brown 989552f7358SJed Brown Note: 990552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 991552f7358SJed Brown 992552f7358SJed Brown Level: beginner 993552f7358SJed Brown 994552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 995552f7358SJed Brown @*/ 996552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 997552f7358SJed Brown { 998552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 999552f7358SJed Brown PetscInt pStart, pEnd; 1000552f7358SJed Brown PetscInt dof, off, c; 1001552f7358SJed Brown PetscErrorCode ierr; 1002552f7358SJed Brown 1003552f7358SJed Brown PetscFunctionBegin; 1004552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1005552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1006552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1007552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1008552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 100982f516ccSBarry 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); 1010552f7358SJed Brown for (c = 0; c < dof; ++c) { 101182f516ccSBarry 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); 1012552f7358SJed Brown mesh->supports[off+c] = support[c]; 1013552f7358SJed Brown } 1014552f7358SJed Brown PetscFunctionReturn(0); 1015552f7358SJed Brown } 1016552f7358SJed Brown 1017552f7358SJed Brown #undef __FUNCT__ 1018552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1019552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1020552f7358SJed Brown { 1021552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1022552f7358SJed Brown PetscInt pStart, pEnd; 1023552f7358SJed Brown PetscInt dof, off; 1024552f7358SJed Brown PetscErrorCode ierr; 1025552f7358SJed Brown 1026552f7358SJed Brown PetscFunctionBegin; 1027552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1028552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1029552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 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); 103282f516ccSBarry 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); 103382f516ccSBarry 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); 1034552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1035552f7358SJed Brown PetscFunctionReturn(0); 1036552f7358SJed Brown } 1037552f7358SJed Brown 1038552f7358SJed Brown #undef __FUNCT__ 1039552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1040552f7358SJed Brown /*@C 1041552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1042552f7358SJed Brown 1043552f7358SJed Brown Not collective 1044552f7358SJed Brown 1045552f7358SJed Brown Input Parameters: 1046552f7358SJed Brown + mesh - The DMPlex 1047552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1048552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 10490298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1050552f7358SJed Brown 1051552f7358SJed Brown Output Parameters: 1052552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1053552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1054552f7358SJed Brown 1055552f7358SJed Brown Note: 10560298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1057552f7358SJed Brown 10583813dfbdSMatthew G Knepley Fortran Notes: 10593813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10603813dfbdSMatthew G Knepley include petsc.h90 in your code. 10613813dfbdSMatthew G Knepley 10623813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 10633813dfbdSMatthew G Knepley 1064552f7358SJed Brown Level: beginner 1065552f7358SJed Brown 1066552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1067552f7358SJed Brown @*/ 1068552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1069552f7358SJed Brown { 1070552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1071552f7358SJed Brown PetscInt *closure, *fifo; 10720298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1073552f7358SJed Brown PetscInt tmpSize, t; 1074552f7358SJed Brown PetscInt depth = 0, maxSize; 1075552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1076552f7358SJed Brown PetscErrorCode ierr; 1077552f7358SJed Brown 1078552f7358SJed Brown PetscFunctionBegin; 1079552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1080552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1081552f7358SJed Brown /* This is only 1-level */ 1082552f7358SJed Brown if (useCone) { 1083552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1084552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1085552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1086552f7358SJed Brown } else { 1087552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1088552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1089552f7358SJed Brown } 1090bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1091bfbcdd7aSMatthew G. Knepley if (*points) { 1092bfbcdd7aSMatthew G. Knepley closure = *points; 1093bfbcdd7aSMatthew G. Knepley } else { 1094bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1095bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1096bfbcdd7aSMatthew G. Knepley } 1097bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1098bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1099bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1100bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1101bfbcdd7aSMatthew G. Knepley } 1102bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1103bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1104bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1105bfbcdd7aSMatthew G. Knepley } 1106bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1107bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1108bfbcdd7aSMatthew G. Knepley if (*points) { 1109bfbcdd7aSMatthew G. Knepley closure = *points; 1110bfbcdd7aSMatthew G. Knepley } else { 1111bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1112bfbcdd7aSMatthew G. Knepley } 1113bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1114552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1115552f7358SJed Brown const PetscInt cp = tmp[t]; 1116552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1117552f7358SJed Brown 1118552f7358SJed Brown closure[closureSize] = cp; 1119552f7358SJed Brown closure[closureSize+1] = co; 1120552f7358SJed Brown fifo[fifoSize] = cp; 1121552f7358SJed Brown fifo[fifoSize+1] = co; 1122552f7358SJed Brown } 1123bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1124552f7358SJed Brown while (fifoSize - fifoStart) { 1125552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1126552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1127552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1128552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1129552f7358SJed Brown 1130552f7358SJed Brown if (useCone) { 1131552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1132552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1133552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1134552f7358SJed Brown } else { 1135552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1136552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 11370298fd71SBarry Smith tmpO = NULL; 1138552f7358SJed Brown } 1139552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1140552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1141552f7358SJed Brown const PetscInt cp = tmp[i]; 11422e1b13c2SMatthew 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. */ 11432e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 11442e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 11452e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1146552f7358SJed Brown PetscInt c; 1147552f7358SJed Brown 11482e1b13c2SMatthew G. Knepley if (rev) { 11492e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 11502e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 11512e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 11522e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 11532e1b13c2SMatthew G. Knepley } 1154552f7358SJed Brown /* Check for duplicate */ 1155552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1156552f7358SJed Brown if (closure[c] == cp) break; 1157552f7358SJed Brown } 1158552f7358SJed Brown if (c == closureSize) { 1159552f7358SJed Brown closure[closureSize] = cp; 1160552f7358SJed Brown closure[closureSize+1] = co; 1161552f7358SJed Brown fifo[fifoSize] = cp; 1162552f7358SJed Brown fifo[fifoSize+1] = co; 1163552f7358SJed Brown closureSize += 2; 1164552f7358SJed Brown fifoSize += 2; 1165552f7358SJed Brown } 1166552f7358SJed Brown } 1167552f7358SJed Brown fifoStart += 2; 1168552f7358SJed Brown } 1169552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1170552f7358SJed Brown if (points) *points = closure; 1171552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1172552f7358SJed Brown PetscFunctionReturn(0); 1173552f7358SJed Brown } 1174552f7358SJed Brown 1175552f7358SJed Brown #undef __FUNCT__ 11769bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 11779bf0dad6SMatthew G. Knepley /*@C 11789bf0dad6SMatthew 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 11799bf0dad6SMatthew G. Knepley 11809bf0dad6SMatthew G. Knepley Not collective 11819bf0dad6SMatthew G. Knepley 11829bf0dad6SMatthew G. Knepley Input Parameters: 11839bf0dad6SMatthew G. Knepley + mesh - The DMPlex 11849bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 11859bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 11869bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11879bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 11889bf0dad6SMatthew G. Knepley 11899bf0dad6SMatthew G. Knepley Output Parameters: 11909bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 11919bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 11929bf0dad6SMatthew G. Knepley 11939bf0dad6SMatthew G. Knepley Note: 11949bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 11959bf0dad6SMatthew G. Knepley 11969bf0dad6SMatthew G. Knepley Fortran Notes: 11979bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11989bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 11999bf0dad6SMatthew G. Knepley 12009bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12019bf0dad6SMatthew G. Knepley 12029bf0dad6SMatthew G. Knepley Level: beginner 12039bf0dad6SMatthew G. Knepley 12049bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 12059bf0dad6SMatthew G. Knepley @*/ 12069bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 12079bf0dad6SMatthew G. Knepley { 12089bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 12099bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 12109bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 12119bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 12129bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 12139bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 12149bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 12159bf0dad6SMatthew G. Knepley 12169bf0dad6SMatthew G. Knepley PetscFunctionBegin; 12179bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 12189bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 12199bf0dad6SMatthew G. Knepley /* This is only 1-level */ 12209bf0dad6SMatthew G. Knepley if (useCone) { 12219bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 12229bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 12239bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 12249bf0dad6SMatthew G. Knepley } else { 12259bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 12269bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 12279bf0dad6SMatthew G. Knepley } 12289bf0dad6SMatthew G. Knepley if (depth == 1) { 12299bf0dad6SMatthew G. Knepley if (*points) { 12309bf0dad6SMatthew G. Knepley closure = *points; 12319bf0dad6SMatthew G. Knepley } else { 12329bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 12339bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12349bf0dad6SMatthew G. Knepley } 12359bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12369bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 12379bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12389bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 12399bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 12409bf0dad6SMatthew G. Knepley } 12419bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 12429bf0dad6SMatthew G. Knepley if (points) *points = closure; 12439bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 12449bf0dad6SMatthew G. Knepley } 12459bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 12469bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 12479bf0dad6SMatthew G. Knepley if (*points) { 12489bf0dad6SMatthew G. Knepley closure = *points; 12499bf0dad6SMatthew G. Knepley } else { 12509bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12519bf0dad6SMatthew G. Knepley } 12529bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12539bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 12549bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12559bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 12569bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 12579bf0dad6SMatthew G. Knepley 12589bf0dad6SMatthew G. Knepley if (ornt < 0) { 12599bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 12609bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12619bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12629bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12639bf0dad6SMatthew G. Knepley } 12649bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 12659bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 12669bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 12679bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 12689bf0dad6SMatthew G. Knepley } 12699bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 12709bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 12719bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 12729bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 12739bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 12749bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 12759bf0dad6SMatthew G. Knepley 12769bf0dad6SMatthew G. Knepley if (useCone) { 12779bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 12789bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 12799bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 12809bf0dad6SMatthew G. Knepley } else { 12819bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 12829bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12839bf0dad6SMatthew G. Knepley tmpO = NULL; 12849bf0dad6SMatthew G. Knepley } 12859bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 12869bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 12879bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 12889bf0dad6SMatthew 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. */ 12899bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12909bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12919bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 12929bf0dad6SMatthew G. Knepley PetscInt c; 12939bf0dad6SMatthew G. Knepley 12949bf0dad6SMatthew G. Knepley if (rev) { 12959bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 12969bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12979bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12989bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12999bf0dad6SMatthew G. Knepley } 13009bf0dad6SMatthew G. Knepley /* Check for duplicate */ 13019bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 13029bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 13039bf0dad6SMatthew G. Knepley } 13049bf0dad6SMatthew G. Knepley if (c == closureSize) { 13059bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13069bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13079bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13089bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13099bf0dad6SMatthew G. Knepley closureSize += 2; 13109bf0dad6SMatthew G. Knepley fifoSize += 2; 13119bf0dad6SMatthew G. Knepley } 13129bf0dad6SMatthew G. Knepley } 13139bf0dad6SMatthew G. Knepley fifoStart += 2; 13149bf0dad6SMatthew G. Knepley } 13159bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13169bf0dad6SMatthew G. Knepley if (points) *points = closure; 13179bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13189bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13199bf0dad6SMatthew G. Knepley } 13209bf0dad6SMatthew G. Knepley 13219bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1322552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1323552f7358SJed Brown /*@C 1324552f7358SJed 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 1325552f7358SJed Brown 1326552f7358SJed Brown Not collective 1327552f7358SJed Brown 1328552f7358SJed Brown Input Parameters: 1329552f7358SJed Brown + mesh - The DMPlex 1330552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1331552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1332e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1333e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1334552f7358SJed Brown 1335552f7358SJed Brown Note: 13360298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1337552f7358SJed Brown 13383813dfbdSMatthew G Knepley Fortran Notes: 13393813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13403813dfbdSMatthew G Knepley include petsc.h90 in your code. 13413813dfbdSMatthew G Knepley 13423813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13433813dfbdSMatthew G Knepley 1344552f7358SJed Brown Level: beginner 1345552f7358SJed Brown 1346552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1347552f7358SJed Brown @*/ 1348552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1349552f7358SJed Brown { 1350552f7358SJed Brown PetscErrorCode ierr; 1351552f7358SJed Brown 1352552f7358SJed Brown PetscFunctionBegin; 1353552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1354e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1355e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1356552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 13574ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1358552f7358SJed Brown PetscFunctionReturn(0); 1359552f7358SJed Brown } 1360552f7358SJed Brown 1361552f7358SJed Brown #undef __FUNCT__ 1362552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1363552f7358SJed Brown /*@ 1364552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1365552f7358SJed Brown 1366552f7358SJed Brown Not collective 1367552f7358SJed Brown 1368552f7358SJed Brown Input Parameter: 1369552f7358SJed Brown . mesh - The DMPlex 1370552f7358SJed Brown 1371552f7358SJed Brown Output Parameters: 1372552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1373552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1374552f7358SJed Brown 1375552f7358SJed Brown Level: beginner 1376552f7358SJed Brown 1377552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1378552f7358SJed Brown @*/ 1379552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1380552f7358SJed Brown { 1381552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1382552f7358SJed Brown 1383552f7358SJed Brown PetscFunctionBegin; 1384552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1385552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1386552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1387552f7358SJed Brown PetscFunctionReturn(0); 1388552f7358SJed Brown } 1389552f7358SJed Brown 1390552f7358SJed Brown #undef __FUNCT__ 1391552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1392552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1393552f7358SJed Brown { 1394552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1395552f7358SJed Brown PetscInt size; 1396552f7358SJed Brown PetscErrorCode ierr; 1397552f7358SJed Brown 1398552f7358SJed Brown PetscFunctionBegin; 1399552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1400552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1401552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 14021795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 14031795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1404552f7358SJed Brown if (mesh->maxSupportSize) { 1405552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1406552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 14071795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1408552f7358SJed Brown } 1409552f7358SJed Brown PetscFunctionReturn(0); 1410552f7358SJed Brown } 1411552f7358SJed Brown 1412552f7358SJed Brown #undef __FUNCT__ 1413552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1414552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1415552f7358SJed Brown { 1416552f7358SJed Brown PetscErrorCode ierr; 1417552f7358SJed Brown 1418552f7358SJed Brown PetscFunctionBegin; 14194d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 14204d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1421552f7358SJed Brown PetscFunctionReturn(0); 1422552f7358SJed Brown } 1423552f7358SJed Brown 1424552f7358SJed Brown #undef __FUNCT__ 1425552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1426552f7358SJed Brown /*@ 1427552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1428552f7358SJed Brown 1429552f7358SJed Brown Not collective 1430552f7358SJed Brown 1431552f7358SJed Brown Input Parameter: 1432552f7358SJed Brown . mesh - The DMPlex 1433552f7358SJed Brown 1434552f7358SJed Brown Output Parameter: 1435552f7358SJed Brown 1436552f7358SJed Brown Note: 1437552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1438552f7358SJed Brown 1439552f7358SJed Brown Level: beginner 1440552f7358SJed Brown 1441552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1442552f7358SJed Brown @*/ 1443552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1444552f7358SJed Brown { 1445552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1446552f7358SJed Brown PetscInt *offsets; 1447552f7358SJed Brown PetscInt supportSize; 1448552f7358SJed Brown PetscInt pStart, pEnd, p; 1449552f7358SJed Brown PetscErrorCode ierr; 1450552f7358SJed Brown 1451552f7358SJed Brown PetscFunctionBegin; 1452552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 145382f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1454552f7358SJed Brown /* Calculate support sizes */ 1455552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1456552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1457552f7358SJed Brown PetscInt dof, off, c; 1458552f7358SJed Brown 1459552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1460552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1461552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1462552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1463552f7358SJed Brown } 1464552f7358SJed Brown } 1465552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1466552f7358SJed Brown PetscInt dof; 1467552f7358SJed Brown 1468552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 14690d644c17SKarl Rupp 1470552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1471552f7358SJed Brown } 1472552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1473552f7358SJed Brown /* Calculate supports */ 1474552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 14751795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 14761795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1477552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1478552f7358SJed Brown PetscInt dof, off, c; 1479552f7358SJed Brown 1480552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1481552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1482552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1483552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1484552f7358SJed Brown PetscInt offS; 1485552f7358SJed Brown 1486552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 14870d644c17SKarl Rupp 1488552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1489552f7358SJed Brown ++offsets[q]; 1490552f7358SJed Brown } 1491552f7358SJed Brown } 1492552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1493552f7358SJed Brown PetscFunctionReturn(0); 1494552f7358SJed Brown } 1495552f7358SJed Brown 1496552f7358SJed Brown #undef __FUNCT__ 1497552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1498552f7358SJed Brown /*@ 1499552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1500552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1501552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1502552f7358SJed Brown the DAG. 1503552f7358SJed Brown 1504552f7358SJed Brown Not collective 1505552f7358SJed Brown 1506552f7358SJed Brown Input Parameter: 1507552f7358SJed Brown . mesh - The DMPlex 1508552f7358SJed Brown 1509552f7358SJed Brown Output Parameter: 1510552f7358SJed Brown 1511552f7358SJed Brown Notes: 1512552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1513552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1514552f7358SJed Brown 1515552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1516552f7358SJed Brown 1517552f7358SJed Brown Level: beginner 1518552f7358SJed Brown 1519552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1520552f7358SJed Brown @*/ 1521552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1522552f7358SJed Brown { 1523aa50250dSMatthew G. Knepley DMLabel label; 1524552f7358SJed Brown PetscInt pStart, pEnd, p; 1525552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1526552f7358SJed Brown PetscErrorCode ierr; 1527552f7358SJed Brown 1528552f7358SJed Brown PetscFunctionBegin; 1529552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1530552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1531552f7358SJed Brown /* Calculate depth */ 1532aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1533aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1534aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1535552f7358SJed Brown /* Initialize roots and count leaves */ 1536552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1537552f7358SJed Brown PetscInt coneSize, supportSize; 1538552f7358SJed Brown 1539552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1540552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1541552f7358SJed Brown if (!coneSize && supportSize) { 1542552f7358SJed Brown ++numRoots; 1543aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1544552f7358SJed Brown } else if (!supportSize && coneSize) { 1545552f7358SJed Brown ++numLeaves; 1546552f7358SJed Brown } else if (!supportSize && !coneSize) { 1547552f7358SJed Brown /* Isolated points */ 1548aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1549552f7358SJed Brown } 1550552f7358SJed Brown } 1551552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1552552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1553552f7358SJed Brown PetscInt coneSize, supportSize; 1554552f7358SJed Brown 1555552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1556552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1557552f7358SJed Brown if (!supportSize && coneSize) { 1558aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1559552f7358SJed Brown } 1560552f7358SJed Brown } 1561552f7358SJed Brown } else { 156274ef644bSMatthew G. Knepley IS pointIS; 156374ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1564552f7358SJed Brown 156574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 156674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 156774ef644bSMatthew G. Knepley while (numPoints) { 156874ef644bSMatthew G. Knepley const PetscInt *points; 156974ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 157074ef644bSMatthew G. Knepley 157174ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 157274ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 157374ef644bSMatthew G. Knepley const PetscInt point = points[p]; 157474ef644bSMatthew G. Knepley const PetscInt *support; 157574ef644bSMatthew G. Knepley PetscInt supportSize, s; 157674ef644bSMatthew G. Knepley 157774ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 157874ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 157974ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 158074ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1581552f7358SJed Brown } 1582552f7358SJed Brown } 15835edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 158474ef644bSMatthew G. Knepley ++level; 158574ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 158674ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 158774ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 158874ef644bSMatthew G. Knepley else {numPoints = 0;} 158974ef644bSMatthew G. Knepley } 159074ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 159174ef644bSMatthew G. Knepley } 1592552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1593552f7358SJed Brown PetscFunctionReturn(0); 1594552f7358SJed Brown } 1595552f7358SJed Brown 1596552f7358SJed Brown #undef __FUNCT__ 1597552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1598552f7358SJed Brown /*@C 1599552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1600552f7358SJed Brown 1601552f7358SJed Brown Not Collective 1602552f7358SJed Brown 1603552f7358SJed Brown Input Parameters: 1604552f7358SJed Brown + dm - The DMPlex object 1605552f7358SJed Brown . numPoints - The number of input points for the join 1606552f7358SJed Brown - points - The input points 1607552f7358SJed Brown 1608552f7358SJed Brown Output Parameters: 1609552f7358SJed Brown + numCoveredPoints - The number of points in the join 1610552f7358SJed Brown - coveredPoints - The points in the join 1611552f7358SJed Brown 1612552f7358SJed Brown Level: intermediate 1613552f7358SJed Brown 1614552f7358SJed Brown Note: Currently, this is restricted to a single level join 1615552f7358SJed Brown 16163813dfbdSMatthew G Knepley Fortran Notes: 16173813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16183813dfbdSMatthew G Knepley include petsc.h90 in your code. 16193813dfbdSMatthew G Knepley 16203813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16213813dfbdSMatthew G Knepley 1622552f7358SJed Brown .keywords: mesh 1623552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1624552f7358SJed Brown @*/ 1625552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1626552f7358SJed Brown { 1627552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1628552f7358SJed Brown PetscInt *join[2]; 1629552f7358SJed Brown PetscInt joinSize, i = 0; 1630552f7358SJed Brown PetscInt dof, off, p, c, m; 1631552f7358SJed Brown PetscErrorCode ierr; 1632552f7358SJed Brown 1633552f7358SJed Brown PetscFunctionBegin; 1634552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1635552f7358SJed Brown PetscValidPointer(points, 2); 1636552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1637552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1638552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1639552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1640552f7358SJed Brown /* Copy in support of first point */ 1641552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1642552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1643552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1644552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1645552f7358SJed Brown } 1646552f7358SJed Brown /* Check each successive support */ 1647552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1648552f7358SJed Brown PetscInt newJoinSize = 0; 1649552f7358SJed Brown 1650552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1651552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1652552f7358SJed Brown for (c = 0; c < dof; ++c) { 1653552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1654552f7358SJed Brown 1655552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1656552f7358SJed Brown if (point == join[i][m]) { 1657552f7358SJed Brown join[1-i][newJoinSize++] = point; 1658552f7358SJed Brown break; 1659552f7358SJed Brown } 1660552f7358SJed Brown } 1661552f7358SJed Brown } 1662552f7358SJed Brown joinSize = newJoinSize; 1663552f7358SJed Brown i = 1-i; 1664552f7358SJed Brown } 1665552f7358SJed Brown *numCoveredPoints = joinSize; 1666552f7358SJed Brown *coveredPoints = join[i]; 1667552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1668552f7358SJed Brown PetscFunctionReturn(0); 1669552f7358SJed Brown } 1670552f7358SJed Brown 1671552f7358SJed Brown #undef __FUNCT__ 1672552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1673552f7358SJed Brown /*@C 1674552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1675552f7358SJed Brown 1676552f7358SJed Brown Not Collective 1677552f7358SJed Brown 1678552f7358SJed Brown Input Parameters: 1679552f7358SJed Brown + dm - The DMPlex object 1680552f7358SJed Brown . numPoints - The number of input points for the join 1681552f7358SJed Brown - points - The input points 1682552f7358SJed Brown 1683552f7358SJed Brown Output Parameters: 1684552f7358SJed Brown + numCoveredPoints - The number of points in the join 1685552f7358SJed Brown - coveredPoints - The points in the join 1686552f7358SJed Brown 16873813dfbdSMatthew G Knepley Fortran Notes: 16883813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16893813dfbdSMatthew G Knepley include petsc.h90 in your code. 16903813dfbdSMatthew G Knepley 16913813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16923813dfbdSMatthew G Knepley 1693552f7358SJed Brown Level: intermediate 1694552f7358SJed Brown 1695552f7358SJed Brown .keywords: mesh 1696552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1697552f7358SJed Brown @*/ 1698552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1699552f7358SJed Brown { 1700552f7358SJed Brown PetscErrorCode ierr; 1701552f7358SJed Brown 1702552f7358SJed Brown PetscFunctionBegin; 1703552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1704d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1705d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1706d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1707552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1708d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1709552f7358SJed Brown PetscFunctionReturn(0); 1710552f7358SJed Brown } 1711552f7358SJed Brown 1712552f7358SJed Brown #undef __FUNCT__ 1713552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1714552f7358SJed Brown /*@C 1715552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1716552f7358SJed Brown 1717552f7358SJed Brown Not Collective 1718552f7358SJed Brown 1719552f7358SJed Brown Input Parameters: 1720552f7358SJed Brown + dm - The DMPlex object 1721552f7358SJed Brown . numPoints - The number of input points for the join 1722552f7358SJed Brown - points - The input points 1723552f7358SJed Brown 1724552f7358SJed Brown Output Parameters: 1725552f7358SJed Brown + numCoveredPoints - The number of points in the join 1726552f7358SJed Brown - coveredPoints - The points in the join 1727552f7358SJed Brown 17283813dfbdSMatthew G Knepley Fortran Notes: 17293813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17303813dfbdSMatthew G Knepley include petsc.h90 in your code. 17313813dfbdSMatthew G Knepley 17323813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17333813dfbdSMatthew G Knepley 1734552f7358SJed Brown Level: intermediate 1735552f7358SJed Brown 1736552f7358SJed Brown .keywords: mesh 1737552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1738552f7358SJed Brown @*/ 1739552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1740552f7358SJed Brown { 1741552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1742552f7358SJed Brown PetscInt *offsets, **closures; 1743552f7358SJed Brown PetscInt *join[2]; 1744552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1745552f7358SJed Brown PetscInt p, d, c, m; 1746552f7358SJed Brown PetscErrorCode ierr; 1747552f7358SJed Brown 1748552f7358SJed Brown PetscFunctionBegin; 1749552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1750552f7358SJed Brown PetscValidPointer(points, 2); 1751552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1752552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1753552f7358SJed Brown 1754552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 17551795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1756552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1757e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1758552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1759552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1760552f7358SJed Brown 1761552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1762552f7358SJed Brown PetscInt closureSize; 1763552f7358SJed Brown 1764552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 17650d644c17SKarl Rupp 1766552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1767552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1768552f7358SJed Brown PetscInt pStart, pEnd, i; 1769552f7358SJed Brown 1770552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1771552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1772552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1773552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1774552f7358SJed Brown break; 1775552f7358SJed Brown } 1776552f7358SJed Brown } 1777552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1778552f7358SJed Brown } 177982f516ccSBarry 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); 1780552f7358SJed Brown } 1781552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1782552f7358SJed Brown PetscInt dof; 1783552f7358SJed Brown 1784552f7358SJed Brown /* Copy in support of first point */ 1785552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1786552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1787552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1788552f7358SJed Brown } 1789552f7358SJed Brown /* Check each successive cone */ 1790552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1791552f7358SJed Brown PetscInt newJoinSize = 0; 1792552f7358SJed Brown 1793552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1794552f7358SJed Brown for (c = 0; c < dof; ++c) { 1795552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1796552f7358SJed Brown 1797552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1798552f7358SJed Brown if (point == join[i][m]) { 1799552f7358SJed Brown join[1-i][newJoinSize++] = point; 1800552f7358SJed Brown break; 1801552f7358SJed Brown } 1802552f7358SJed Brown } 1803552f7358SJed Brown } 1804552f7358SJed Brown joinSize = newJoinSize; 1805552f7358SJed Brown i = 1-i; 1806552f7358SJed Brown } 1807552f7358SJed Brown if (joinSize) break; 1808552f7358SJed Brown } 1809552f7358SJed Brown *numCoveredPoints = joinSize; 1810552f7358SJed Brown *coveredPoints = join[i]; 1811552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 18120298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1813552f7358SJed Brown } 1814552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1815552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1816552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1817552f7358SJed Brown PetscFunctionReturn(0); 1818552f7358SJed Brown } 1819552f7358SJed Brown 1820552f7358SJed Brown #undef __FUNCT__ 1821552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1822552f7358SJed Brown /*@C 1823552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1824552f7358SJed Brown 1825552f7358SJed Brown Not Collective 1826552f7358SJed Brown 1827552f7358SJed Brown Input Parameters: 1828552f7358SJed Brown + dm - The DMPlex object 1829552f7358SJed Brown . numPoints - The number of input points for the meet 1830552f7358SJed Brown - points - The input points 1831552f7358SJed Brown 1832552f7358SJed Brown Output Parameters: 1833552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1834552f7358SJed Brown - coveredPoints - The points in the meet 1835552f7358SJed Brown 1836552f7358SJed Brown Level: intermediate 1837552f7358SJed Brown 1838552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1839552f7358SJed Brown 18403813dfbdSMatthew G Knepley Fortran Notes: 18413813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18423813dfbdSMatthew G Knepley include petsc.h90 in your code. 18433813dfbdSMatthew G Knepley 18443813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18453813dfbdSMatthew G Knepley 1846552f7358SJed Brown .keywords: mesh 1847552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1848552f7358SJed Brown @*/ 1849552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1850552f7358SJed Brown { 1851552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1852552f7358SJed Brown PetscInt *meet[2]; 1853552f7358SJed Brown PetscInt meetSize, i = 0; 1854552f7358SJed Brown PetscInt dof, off, p, c, m; 1855552f7358SJed Brown PetscErrorCode ierr; 1856552f7358SJed Brown 1857552f7358SJed Brown PetscFunctionBegin; 1858552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1859552f7358SJed Brown PetscValidPointer(points, 2); 1860552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1861552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1862552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1863552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1864552f7358SJed Brown /* Copy in cone of first point */ 1865552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1866552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1867552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1868552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1869552f7358SJed Brown } 1870552f7358SJed Brown /* Check each successive cone */ 1871552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1872552f7358SJed Brown PetscInt newMeetSize = 0; 1873552f7358SJed Brown 1874552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1875552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1876552f7358SJed Brown for (c = 0; c < dof; ++c) { 1877552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1878552f7358SJed Brown 1879552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1880552f7358SJed Brown if (point == meet[i][m]) { 1881552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1882552f7358SJed Brown break; 1883552f7358SJed Brown } 1884552f7358SJed Brown } 1885552f7358SJed Brown } 1886552f7358SJed Brown meetSize = newMeetSize; 1887552f7358SJed Brown i = 1-i; 1888552f7358SJed Brown } 1889552f7358SJed Brown *numCoveringPoints = meetSize; 1890552f7358SJed Brown *coveringPoints = meet[i]; 1891552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 1892552f7358SJed Brown PetscFunctionReturn(0); 1893552f7358SJed Brown } 1894552f7358SJed Brown 1895552f7358SJed Brown #undef __FUNCT__ 1896552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 1897552f7358SJed Brown /*@C 1898552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 1899552f7358SJed Brown 1900552f7358SJed Brown Not Collective 1901552f7358SJed Brown 1902552f7358SJed Brown Input Parameters: 1903552f7358SJed Brown + dm - The DMPlex object 1904552f7358SJed Brown . numPoints - The number of input points for the meet 1905552f7358SJed Brown - points - The input points 1906552f7358SJed Brown 1907552f7358SJed Brown Output Parameters: 1908552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1909552f7358SJed Brown - coveredPoints - The points in the meet 1910552f7358SJed Brown 1911552f7358SJed Brown Level: intermediate 1912552f7358SJed Brown 19133813dfbdSMatthew G Knepley Fortran Notes: 19143813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19153813dfbdSMatthew G Knepley include petsc.h90 in your code. 19163813dfbdSMatthew G Knepley 19173813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19183813dfbdSMatthew G Knepley 1919552f7358SJed Brown .keywords: mesh 1920552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 1921552f7358SJed Brown @*/ 1922552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1923552f7358SJed Brown { 1924552f7358SJed Brown PetscErrorCode ierr; 1925552f7358SJed Brown 1926552f7358SJed Brown PetscFunctionBegin; 1927552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1928d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1929d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1930d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 1931552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1932d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1933552f7358SJed Brown PetscFunctionReturn(0); 1934552f7358SJed Brown } 1935552f7358SJed Brown 1936552f7358SJed Brown #undef __FUNCT__ 1937552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 1938552f7358SJed Brown /*@C 1939552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 1940552f7358SJed Brown 1941552f7358SJed Brown Not Collective 1942552f7358SJed Brown 1943552f7358SJed Brown Input Parameters: 1944552f7358SJed Brown + dm - The DMPlex object 1945552f7358SJed Brown . numPoints - The number of input points for the meet 1946552f7358SJed Brown - points - The input points 1947552f7358SJed Brown 1948552f7358SJed Brown Output Parameters: 1949552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1950552f7358SJed Brown - coveredPoints - The points in the meet 1951552f7358SJed Brown 1952552f7358SJed Brown Level: intermediate 1953552f7358SJed Brown 19543813dfbdSMatthew G Knepley Fortran Notes: 19553813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19563813dfbdSMatthew G Knepley include petsc.h90 in your code. 19573813dfbdSMatthew G Knepley 19583813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19593813dfbdSMatthew G Knepley 1960552f7358SJed Brown .keywords: mesh 1961552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 1962552f7358SJed Brown @*/ 1963552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1964552f7358SJed Brown { 1965552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1966552f7358SJed Brown PetscInt *offsets, **closures; 1967552f7358SJed Brown PetscInt *meet[2]; 1968552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 1969552f7358SJed Brown PetscInt p, h, c, m; 1970552f7358SJed Brown PetscErrorCode ierr; 1971552f7358SJed Brown 1972552f7358SJed Brown PetscFunctionBegin; 1973552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1974552f7358SJed Brown PetscValidPointer(points, 2); 1975552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1976552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1977552f7358SJed Brown 1978552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 1979785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 1980552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1981e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 1982552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1983552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1984552f7358SJed Brown 1985552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1986552f7358SJed Brown PetscInt closureSize; 1987552f7358SJed Brown 1988552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 19890d644c17SKarl Rupp 1990552f7358SJed Brown offsets[p*(height+2)+0] = 0; 1991552f7358SJed Brown for (h = 0; h < height+1; ++h) { 1992552f7358SJed Brown PetscInt pStart, pEnd, i; 1993552f7358SJed Brown 1994552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 1995552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 1996552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1997552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 1998552f7358SJed Brown break; 1999552f7358SJed Brown } 2000552f7358SJed Brown } 2001552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2002552f7358SJed Brown } 200382f516ccSBarry 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); 2004552f7358SJed Brown } 2005552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2006552f7358SJed Brown PetscInt dof; 2007552f7358SJed Brown 2008552f7358SJed Brown /* Copy in cone of first point */ 2009552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2010552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2011552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2012552f7358SJed Brown } 2013552f7358SJed Brown /* Check each successive cone */ 2014552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2015552f7358SJed Brown PetscInt newMeetSize = 0; 2016552f7358SJed Brown 2017552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2018552f7358SJed Brown for (c = 0; c < dof; ++c) { 2019552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2020552f7358SJed Brown 2021552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2022552f7358SJed Brown if (point == meet[i][m]) { 2023552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2024552f7358SJed Brown break; 2025552f7358SJed Brown } 2026552f7358SJed Brown } 2027552f7358SJed Brown } 2028552f7358SJed Brown meetSize = newMeetSize; 2029552f7358SJed Brown i = 1-i; 2030552f7358SJed Brown } 2031552f7358SJed Brown if (meetSize) break; 2032552f7358SJed Brown } 2033552f7358SJed Brown *numCoveredPoints = meetSize; 2034552f7358SJed Brown *coveredPoints = meet[i]; 2035552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20360298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2037552f7358SJed Brown } 2038552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2039552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2040552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2041552f7358SJed Brown PetscFunctionReturn(0); 2042552f7358SJed Brown } 2043552f7358SJed Brown 2044552f7358SJed Brown #undef __FUNCT__ 20454e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 20464e3744c5SMatthew G. Knepley /*@C 20474e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 20484e3744c5SMatthew G. Knepley 20494e3744c5SMatthew G. Knepley Not Collective 20504e3744c5SMatthew G. Knepley 20514e3744c5SMatthew G. Knepley Input Parameters: 20524e3744c5SMatthew G. Knepley + dmA - A DMPlex object 20534e3744c5SMatthew G. Knepley - dmB - A DMPlex object 20544e3744c5SMatthew G. Knepley 20554e3744c5SMatthew G. Knepley Output Parameters: 20564e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 20574e3744c5SMatthew G. Knepley 20584e3744c5SMatthew G. Knepley Level: intermediate 20594e3744c5SMatthew G. Knepley 20604e3744c5SMatthew G. Knepley Notes: 20614e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 20624e3744c5SMatthew G. Knepley 20634e3744c5SMatthew G. Knepley .keywords: mesh 20644e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 20654e3744c5SMatthew G. Knepley @*/ 20664e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 20674e3744c5SMatthew G. Knepley { 20684e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 20694e3744c5SMatthew G. Knepley PetscErrorCode ierr; 20704e3744c5SMatthew G. Knepley 20714e3744c5SMatthew G. Knepley PetscFunctionBegin; 20724e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 20734e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 20744e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 20754e3744c5SMatthew G. Knepley 20764e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 20774e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 20784e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 20794e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 20804e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 20814e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 20824e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 20834e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 20844e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 20854e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 20864e3744c5SMatthew G. Knepley 20874e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 20884e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 20894e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 20904e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 20914e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 20924e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 20934e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 20944e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 20954e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 20964e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 20974e3744c5SMatthew G. Knepley } 20984e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 20994e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 21004e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 21014e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 21024e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 21034e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 21044e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 21054e3744c5SMatthew G. Knepley } 21064e3744c5SMatthew G. Knepley } 21074e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 21084e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 21094e3744c5SMatthew G. Knepley } 21104e3744c5SMatthew G. Knepley 21114e3744c5SMatthew G. Knepley #undef __FUNCT__ 211218ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 211318ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2114a6dfd86eSKarl Rupp { 211582f516ccSBarry Smith MPI_Comm comm; 2116552f7358SJed Brown PetscErrorCode ierr; 2117552f7358SJed Brown 2118552f7358SJed Brown PetscFunctionBegin; 211982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2120552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2121552f7358SJed Brown switch (cellDim) { 2122552f7358SJed Brown case 0: 2123552f7358SJed Brown *numFaceVertices = 0; 2124552f7358SJed Brown break; 2125552f7358SJed Brown case 1: 2126552f7358SJed Brown *numFaceVertices = 1; 2127552f7358SJed Brown break; 2128552f7358SJed Brown case 2: 2129552f7358SJed Brown switch (numCorners) { 213019436ca2SJed Brown case 3: /* triangle */ 213119436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2132552f7358SJed Brown break; 213319436ca2SJed Brown case 4: /* quadrilateral */ 213419436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2135552f7358SJed Brown break; 213619436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 213719436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2138552f7358SJed Brown break; 213919436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 214019436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2141552f7358SJed Brown break; 2142552f7358SJed Brown default: 2143552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2144552f7358SJed Brown } 2145552f7358SJed Brown break; 2146552f7358SJed Brown case 3: 2147552f7358SJed Brown switch (numCorners) { 214819436ca2SJed Brown case 4: /* tetradehdron */ 214919436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2150552f7358SJed Brown break; 215119436ca2SJed Brown case 6: /* tet cohesive cells */ 215219436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2153552f7358SJed Brown break; 215419436ca2SJed Brown case 8: /* hexahedron */ 215519436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2156552f7358SJed Brown break; 215719436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 215819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2159552f7358SJed Brown break; 216019436ca2SJed Brown case 10: /* quadratic tetrahedron */ 216119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2162552f7358SJed Brown break; 216319436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 216419436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2165552f7358SJed Brown break; 216619436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 216719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2168552f7358SJed Brown break; 216919436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 217019436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2171552f7358SJed Brown break; 2172552f7358SJed Brown default: 2173552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2174552f7358SJed Brown } 2175552f7358SJed Brown break; 2176552f7358SJed Brown default: 2177552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2178552f7358SJed Brown } 2179552f7358SJed Brown PetscFunctionReturn(0); 2180552f7358SJed Brown } 2181552f7358SJed Brown 2182552f7358SJed Brown #undef __FUNCT__ 2183d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2184d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2185d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2186d27a0f52SMatthew G. Knepley { 2187a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2188a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2189a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2190d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2191d27a0f52SMatthew G. Knepley 2192d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2193d27a0f52SMatthew G. Knepley /* Truth Table 2194d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2195d27a0f52SMatthew G. Knepley F 0 flips no F F F 2196d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2197d27a0f52SMatthew G. Knepley F 2 flips no T F T 2198d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2199d27a0f52SMatthew G. Knepley T 1 flip no 2200d27a0f52SMatthew G. Knepley T 2 flips yes 2201d27a0f52SMatthew G. Knepley */ 2202a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2203d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2204a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2205d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2206a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2207a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2208a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2209a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2210a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2211a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2212785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2213a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2214a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2215defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2216a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2217a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2218a1b4d4a2SMatthew G. Knepley 2219a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2220a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2221a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2222a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2223a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2224a1b4d4a2SMatthew G. Knepley } 2225a1b4d4a2SMatthew G. Knepley } 2226a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2227a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2228d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2229a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2230d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2231d27a0f52SMatthew G. Knepley 2232a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2233a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2234a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2235d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2236d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2237a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 223886cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2239a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 224086cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2241d27a0f52SMatthew G. Knepley 2242d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2243d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2244d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2245d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2246d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2247d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2248a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2249a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2250a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2251a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2252a1b4d4a2SMatthew G. Knepley } 2253a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2254a1b4d4a2SMatthew 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); 2255a1b4d4a2SMatthew G. Knepley } 2256a1b4d4a2SMatthew 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]); 2257a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2258a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2259a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2260a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2261a1b4d4a2SMatthew G. Knepley } 2262a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2263a1b4d4a2SMatthew 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); 2264a1b4d4a2SMatthew G. Knepley } 2265a1b4d4a2SMatthew 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]); 2266d27a0f52SMatthew G. Knepley 2267d27a0f52SMatthew G. Knepley if (dim == 1) { 2268d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2269d27a0f52SMatthew G. Knepley } else { 2270d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2271d27a0f52SMatthew G. Knepley } 2272d27a0f52SMatthew G. Knepley 2273d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2274d27a0f52SMatthew 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]); 2275d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2276a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2277d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2278a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2279d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 228086cff514SMatthew 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"); 2281a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2282a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2283d27a0f52SMatthew G. Knepley } 2284*fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2285*fedde076SMatthew G. Knepley { 2286*fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2287*fedde076SMatthew G. Knepley PetscSF sf; 2288*fedde076SMatthew G. Knepley const PetscInt *lpoints; 2289*fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 2290*fedde076SMatthew G. Knepley PetscInt *neighbors; 2291*fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2292*fedde076SMatthew G. Knepley PetscBool match; 2293a1b4d4a2SMatthew G. Knepley 2294*fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2295*fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2296*fedde076SMatthew G. Knepley if (numLeaves >= 0) { 2297*fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2298*fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2299*fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2300*fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2301*fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2302*fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2303*fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2304*fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2305*fedde076SMatthew G. Knepley PetscInt supportSize; 2306*fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2307*fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2308*fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2309*fedde076SMatthew G. Knepley } 2310*fedde076SMatthew G. Knepley } 2311*fedde076SMatthew G. Knepley } 2312*fedde076SMatthew G. Knepley const PetscInt *cone, *ornt, *support; 2313*fedde076SMatthew G. Knepley PetscInt coneSize, supportSize; 2314*fedde076SMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 2315*fedde076SMatthew G. Knepley 2316*fedde076SMatthew G. Knepley ierr = PetscCalloc2(numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2317*fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2318*fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2319*fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2320*fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2321*fedde076SMatthew G. Knepley 2322*fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 2323*fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2324*fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 2325*fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2326*fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2327*fedde076SMatthew G. Knepley } 2328*fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2329*fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2330*fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2331*fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2332*fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2333*fedde076SMatthew G. Knepley 2334*fedde076SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match = PETSC_TRUE; 2335*fedde076SMatthew G. Knepley else match = PETSC_FALSE; 2336*fedde076SMatthew G. Knepley } 2337*fedde076SMatthew G. Knepley ierr = PetscFree2(rornt,lornt);CHKERRQ(ierr); 2338*fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 2339*fedde076SMatthew G. Knepley } 2340*fedde076SMatthew G. Knepley /* 2341*fedde076SMatthew G. Knepley - Vertex can be flipped, which negates all edges 2342*fedde076SMatthew G. Knepley - How do we solve this graph problem? I think we can do the same algorithm, BFS using a FIFO 2343*fedde076SMatthew G. Knepley */ 2344*fedde076SMatthew G. Knepley if (!match) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2345*fedde076SMatthew G. Knepley } 2346*fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2347d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2348d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2349d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2350a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2351f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2352f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2353d27a0f52SMatthew G. Knepley 2354a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2355a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2356a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2357a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2358a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2359a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2360a1b4d4a2SMatthew G. Knepley 2361a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2362a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2363a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2364d27a0f52SMatthew G. Knepley } 2365a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2366a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2367f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2368f4e909fcSMatthew G. Knepley faceSize = coneSize; 2369f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2370f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2371f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2372f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2373f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2374f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2375f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2376f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2377f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2378f4e909fcSMatthew G. Knepley } 2379f4e909fcSMatthew G. Knepley } 2380d27a0f52SMatthew G. Knepley } 2381d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2382d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2383d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2384a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2385a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2386a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2387d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2388d27a0f52SMatthew G. Knepley } 2389d27a0f52SMatthew G. Knepley 2390d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2391cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal" 2392cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[]) 2393cb1e1211SMatthew G Knepley { 2394cb1e1211SMatthew G Knepley const PetscInt *support = NULL; 2395cb1e1211SMatthew G Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, supportSize, s; 2396cb1e1211SMatthew G Knepley PetscErrorCode ierr; 2397cb1e1211SMatthew G Knepley 2398cb1e1211SMatthew G Knepley PetscFunctionBegin; 2399cb1e1211SMatthew G Knepley if (useClosure) { 2400cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr); 2401cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr); 2402cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2403cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2404cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2405cb1e1211SMatthew G Knepley 2406cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2407cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr); 2408cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2409cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2410cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2411cb1e1211SMatthew G Knepley } 2412cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2413cb1e1211SMatthew G Knepley } 2414cb1e1211SMatthew G Knepley } 2415cb1e1211SMatthew G Knepley } else { 2416cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 2417cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 2418cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2419cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2420cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2421cb1e1211SMatthew G Knepley 2422cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2423cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2424cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2425cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2426cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2427cb1e1211SMatthew G Knepley } 2428cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2429cb1e1211SMatthew G Knepley } 2430cb1e1211SMatthew G Knepley } 2431cb1e1211SMatthew G Knepley } 2432cb1e1211SMatthew G Knepley *adjSize = numAdj; 2433cb1e1211SMatthew G Knepley PetscFunctionReturn(0); 2434cb1e1211SMatthew G Knepley } 2435cb1e1211SMatthew G Knepley 2436cb1e1211SMatthew G Knepley #undef __FUNCT__ 2437552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR" 243877c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency) 24390adebc6cSBarry Smith { 2440552f7358SJed Brown const PetscInt maxFaceCases = 30; 2441552f7358SJed Brown PetscInt numFaceCases = 0; 2442552f7358SJed Brown PetscInt numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */ 2443552f7358SJed Brown PetscInt *off, *adj; 2444552f7358SJed Brown PetscInt *neighborCells, *tmpClosure; 2445552f7358SJed Brown PetscInt maxConeSize, maxSupportSize, maxClosure, maxNeighbors; 244677c88f5bSMatthew G Knepley PetscInt dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell; 2447552f7358SJed Brown PetscErrorCode ierr; 2448552f7358SJed Brown 2449552f7358SJed Brown PetscFunctionBegin; 2450552f7358SJed Brown /* For parallel partitioning, I think you have to communicate supports */ 2451552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 245277c88f5bSMatthew G Knepley cellDim = dim - cellHeight; 2453552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 245477c88f5bSMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 2455552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 2456552f7358SJed Brown if (cEnd - cStart == 0) { 2457552f7358SJed Brown if (numVertices) *numVertices = 0; 24580298fd71SBarry Smith if (offsets) *offsets = NULL; 24590298fd71SBarry Smith if (adjacency) *adjacency = NULL; 2460552f7358SJed Brown PetscFunctionReturn(0); 2461552f7358SJed Brown } 2462552f7358SJed Brown numCells = cEnd - cStart; 246377c88f5bSMatthew G Knepley faceDepth = depth - cellHeight; 24640d957afbSMatthew G. Knepley if (dim == depth) { 2465e430e843SMatthew G. Knepley PetscInt f, fStart, fEnd; 2466e430e843SMatthew G. Knepley 24671795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2468e430e843SMatthew G. Knepley /* Count neighboring cells */ 2469e430e843SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 2470e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2471e430e843SMatthew G. Knepley const PetscInt *support; 2472e430e843SMatthew G. Knepley PetscInt supportSize; 2473e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2474e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2475e430e843SMatthew G. Knepley if (supportSize == 2) { 2476e430e843SMatthew G. Knepley ++off[support[0]-cStart+1]; 2477e430e843SMatthew G. Knepley ++off[support[1]-cStart+1]; 2478e430e843SMatthew G. Knepley } 2479e430e843SMatthew G. Knepley } 2480e430e843SMatthew G. Knepley /* Prefix sum */ 2481e430e843SMatthew G. Knepley for (c = 1; c <= numCells; ++c) off[c] += off[c-1]; 2482e430e843SMatthew G. Knepley if (adjacency) { 2483e430e843SMatthew G. Knepley PetscInt *tmp; 2484e430e843SMatthew G. Knepley 2485785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2486785e854fSJed Brown ierr = PetscMalloc1((numCells+1), &tmp);CHKERRQ(ierr); 2487e430e843SMatthew G. Knepley ierr = PetscMemcpy(tmp, off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr); 2488e430e843SMatthew G. Knepley /* Get neighboring cells */ 2489e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2490e430e843SMatthew G. Knepley const PetscInt *support; 2491e430e843SMatthew G. Knepley PetscInt supportSize; 2492e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2493e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2494e430e843SMatthew G. Knepley if (supportSize == 2) { 2495e430e843SMatthew G. Knepley adj[tmp[support[0]-cStart]++] = support[1]; 2496e430e843SMatthew G. Knepley adj[tmp[support[1]-cStart]++] = support[0]; 2497e430e843SMatthew G. Knepley } 2498e430e843SMatthew G. Knepley } 2499e430e843SMatthew G. Knepley #if defined(PETSC_USE_DEBUG) 25000d957afbSMatthew 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); 2501e430e843SMatthew G. Knepley #endif 2502e430e843SMatthew G. Knepley ierr = PetscFree(tmp);CHKERRQ(ierr); 2503e430e843SMatthew G. Knepley } 2504e430e843SMatthew G. Knepley if (numVertices) *numVertices = numCells; 2505e430e843SMatthew G. Knepley if (offsets) *offsets = off; 2506e430e843SMatthew G. Knepley if (adjacency) *adjacency = adj; 2507e430e843SMatthew G. Knepley PetscFunctionReturn(0); 2508e430e843SMatthew G. Knepley } 2509552f7358SJed Brown /* Setup face recognition */ 251077c88f5bSMatthew G Knepley if (faceDepth == 1) { 2511552f7358SJed 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 */ 2512552f7358SJed Brown 2513552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2514552f7358SJed Brown PetscInt corners; 2515552f7358SJed Brown 2516552f7358SJed Brown ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr); 2517552f7358SJed Brown if (!cornersSeen[corners]) { 2518552f7358SJed Brown PetscInt nFV; 2519552f7358SJed Brown 252082f516ccSBarry Smith if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases"); 2521552f7358SJed Brown cornersSeen[corners] = 1; 25220d644c17SKarl Rupp 252318ad9376SMatthew G. Knepley ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr); 25240d644c17SKarl Rupp 2525552f7358SJed Brown numFaceVertices[numFaceCases++] = nFV; 2526552f7358SJed Brown } 2527552f7358SJed Brown } 2528552f7358SJed Brown } 2529e7b80042SMatthew G. Knepley maxClosure = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1)); 2530e7b80042SMatthew G. Knepley maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1); 2531dcca6d9dSJed Brown ierr = PetscMalloc2(maxNeighbors,&neighborCells,maxClosure,&tmpClosure);CHKERRQ(ierr); 25321795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2533552f7358SJed Brown /* Count neighboring cells */ 2534552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2535552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2536552f7358SJed Brown 2537cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2538552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2539552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 25404d25b1e8SKarl Rupp PetscInt cellPair[2]; 254177c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2542552f7358SJed Brown PetscInt meetSize = 0; 25430298fd71SBarry Smith const PetscInt *meet = NULL; 2544552f7358SJed Brown 25454d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2546552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2547552f7358SJed Brown if (!found) { 2548552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2549552f7358SJed Brown if (meetSize) { 2550552f7358SJed Brown PetscInt f; 2551552f7358SJed Brown 2552552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2553552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2554552f7358SJed Brown found = PETSC_TRUE; 2555552f7358SJed Brown break; 2556552f7358SJed Brown } 2557552f7358SJed Brown } 2558552f7358SJed Brown } 2559552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2560552f7358SJed Brown } 25610d644c17SKarl Rupp if (found) ++off[cell-cStart+1]; 2562552f7358SJed Brown } 2563552f7358SJed Brown } 2564552f7358SJed Brown /* Prefix sum */ 25650d644c17SKarl Rupp for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1]; 25660d644c17SKarl Rupp 2567552f7358SJed Brown if (adjacency) { 2568785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2569552f7358SJed Brown /* Get neighboring cells */ 2570552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2571552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2572552f7358SJed Brown PetscInt cellOffset = 0; 2573552f7358SJed Brown 2574cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2575552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2576552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 25774d25b1e8SKarl Rupp PetscInt cellPair[2]; 257877c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2579552f7358SJed Brown PetscInt meetSize = 0; 25800298fd71SBarry Smith const PetscInt *meet = NULL; 2581552f7358SJed Brown 25824d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2583552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2584552f7358SJed Brown if (!found) { 2585552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2586552f7358SJed Brown if (meetSize) { 2587552f7358SJed Brown PetscInt f; 2588552f7358SJed Brown 2589552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2590552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2591552f7358SJed Brown found = PETSC_TRUE; 2592552f7358SJed Brown break; 2593552f7358SJed Brown } 2594552f7358SJed Brown } 2595552f7358SJed Brown } 2596552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2597552f7358SJed Brown } 2598552f7358SJed Brown if (found) { 2599552f7358SJed Brown adj[off[cell-cStart]+cellOffset] = neighborCells[n]; 2600552f7358SJed Brown ++cellOffset; 2601552f7358SJed Brown } 2602552f7358SJed Brown } 2603552f7358SJed Brown } 2604552f7358SJed Brown } 2605552f7358SJed Brown ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr); 2606552f7358SJed Brown if (numVertices) *numVertices = numCells; 2607552f7358SJed Brown if (offsets) *offsets = off; 2608552f7358SJed Brown if (adjacency) *adjacency = adj; 2609552f7358SJed Brown PetscFunctionReturn(0); 2610552f7358SJed Brown } 2611552f7358SJed Brown 2612519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2613519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2614552f7358SJed Brown #include <unistd.h> 2615552f7358SJed Brown #endif 2616552f7358SJed Brown /* Chaco does not have an include file */ 261739d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts, 2618552f7358SJed Brown float *ewgts, float *x, float *y, float *z, char *outassignname, 2619552f7358SJed Brown char *outfilename, short *assignment, int architecture, int ndims_tot, 2620552f7358SJed Brown int mesh_dims[3], double *goal, int global_method, int local_method, 2621552f7358SJed Brown int rqi_flag, int vmax, int ndims, double eigtol, long seed); 2622552f7358SJed Brown 2623552f7358SJed Brown extern int FREE_GRAPH; 2624552f7358SJed Brown 2625552f7358SJed Brown #undef __FUNCT__ 2626552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco" 2627552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2628552f7358SJed Brown { 2629552f7358SJed Brown enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3}; 263082f516ccSBarry Smith MPI_Comm comm; 2631552f7358SJed Brown int nvtxs = numVertices; /* number of vertices in full graph */ 2632552f7358SJed Brown int *vwgts = NULL; /* weights for all vertices */ 2633552f7358SJed Brown float *ewgts = NULL; /* weights for all edges */ 2634552f7358SJed Brown float *x = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */ 2635552f7358SJed Brown char *outassignname = NULL; /* name of assignment output file */ 2636552f7358SJed Brown char *outfilename = NULL; /* output file name */ 2637552f7358SJed Brown int architecture = 1; /* 0 => hypercube, d => d-dimensional mesh */ 2638552f7358SJed Brown int ndims_tot = 0; /* total number of cube dimensions to divide */ 2639552f7358SJed Brown int mesh_dims[3]; /* dimensions of mesh of processors */ 2640552f7358SJed Brown double *goal = NULL; /* desired set sizes for each set */ 2641552f7358SJed Brown int global_method = 1; /* global partitioning algorithm */ 2642552f7358SJed Brown int local_method = 1; /* local partitioning algorithm */ 2643552f7358SJed Brown int rqi_flag = 0; /* should I use RQI/Symmlq eigensolver? */ 2644552f7358SJed Brown int vmax = 200; /* how many vertices to coarsen down to? */ 2645552f7358SJed Brown int ndims = 1; /* number of eigenvectors (2^d sets) */ 2646552f7358SJed Brown double eigtol = 0.001; /* tolerance on eigenvectors */ 2647552f7358SJed Brown long seed = 123636512; /* for random graph mutations */ 2648552f7358SJed Brown short int *assignment; /* Output partition */ 2649552f7358SJed Brown int fd_stdout, fd_pipe[2]; 2650552f7358SJed Brown PetscInt *points; 2651552f7358SJed Brown PetscMPIInt commSize; 2652552f7358SJed Brown int i, v, p; 2653552f7358SJed Brown PetscErrorCode ierr; 2654552f7358SJed Brown 2655552f7358SJed Brown PetscFunctionBegin; 265682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2657552f7358SJed Brown ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 2658552f7358SJed Brown if (!numVertices) { 2659552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2660552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2661552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 26620298fd71SBarry Smith ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2663552f7358SJed Brown PetscFunctionReturn(0); 2664552f7358SJed Brown } 2665552f7358SJed Brown FREE_GRAPH = 0; /* Do not let Chaco free my memory */ 26660d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) ++adjacency[i]; 26670d644c17SKarl Rupp 2668552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2669552f7358SJed Brown /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */ 2670552f7358SJed Brown SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported"); 2671552f7358SJed Brown } 2672552f7358SJed Brown mesh_dims[0] = commSize; 2673552f7358SJed Brown mesh_dims[1] = 1; 2674552f7358SJed Brown mesh_dims[2] = 1; 2675785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &assignment);CHKERRQ(ierr); 2676552f7358SJed Brown /* Chaco outputs to stdout. We redirect this to a buffer. */ 2677552f7358SJed Brown /* TODO: check error codes for UNIX calls */ 2678519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2679552f7358SJed Brown { 26807995c745SJed Brown int piperet; 26817995c745SJed Brown piperet = pipe(fd_pipe); 26827995c745SJed Brown if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe"); 2683552f7358SJed Brown fd_stdout = dup(1); 2684552f7358SJed Brown close(1); 2685552f7358SJed Brown dup2(fd_pipe[1], 1); 2686552f7358SJed Brown } 2687552f7358SJed Brown #endif 2688552f7358SJed Brown ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename, 2689552f7358SJed Brown assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag, 2690552f7358SJed Brown vmax, ndims, eigtol, seed); 2691519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2692552f7358SJed Brown { 2693552f7358SJed Brown char msgLog[10000]; 2694552f7358SJed Brown int count; 2695552f7358SJed Brown 2696552f7358SJed Brown fflush(stdout); 2697552f7358SJed Brown count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char)); 2698552f7358SJed Brown if (count < 0) count = 0; 2699552f7358SJed Brown msgLog[count] = 0; 2700552f7358SJed Brown close(1); 2701552f7358SJed Brown dup2(fd_stdout, 1); 2702552f7358SJed Brown close(fd_stdout); 2703552f7358SJed Brown close(fd_pipe[0]); 2704552f7358SJed Brown close(fd_pipe[1]); 2705552f7358SJed Brown if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog); 2706552f7358SJed Brown } 2707552f7358SJed Brown #endif 2708552f7358SJed Brown /* Convert to PetscSection+IS */ 2709552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2710552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2711552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2712552f7358SJed Brown ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 2713552f7358SJed Brown } 2714552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2715785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 2716552f7358SJed Brown for (p = 0, i = 0; p < commSize; ++p) { 2717552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2718552f7358SJed Brown if (assignment[v] == p) points[i++] = v; 2719552f7358SJed Brown } 2720552f7358SJed Brown } 2721552f7358SJed Brown if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 2722552f7358SJed Brown ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2723552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2724552f7358SJed Brown /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */ 2725552f7358SJed Brown } 2726552f7358SJed Brown ierr = PetscFree(assignment);CHKERRQ(ierr); 27270d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) --adjacency[i]; 2728552f7358SJed Brown PetscFunctionReturn(0); 2729552f7358SJed Brown } 2730552f7358SJed Brown #endif 2731552f7358SJed Brown 2732519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 273325cda350SMatthew G. Knepley #include <parmetis.h> 273425cda350SMatthew G. Knepley 2735552f7358SJed Brown #undef __FUNCT__ 2736552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis" 2737552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2738552f7358SJed Brown { 273925cda350SMatthew G. Knepley MPI_Comm comm; 274054695375SMatthew G. Knepley PetscInt nvtxs = numVertices; /* The number of vertices in full graph */ 274154695375SMatthew G. Knepley PetscInt *vtxdist; /* Distribution of vertices across processes */ 274254695375SMatthew G. Knepley PetscInt *xadj = start; /* Start of edge list for each vertex */ 274354695375SMatthew G. Knepley PetscInt *adjncy = adjacency; /* Edge lists for all vertices */ 274454695375SMatthew G. Knepley PetscInt *vwgt = NULL; /* Vertex weights */ 274554695375SMatthew G. Knepley PetscInt *adjwgt = NULL; /* Edge weights */ 274654695375SMatthew G. Knepley PetscInt wgtflag = 0; /* Indicates which weights are present */ 274754695375SMatthew G. Knepley PetscInt numflag = 0; /* Indicates initial offset (0 or 1) */ 274854695375SMatthew G. Knepley PetscInt ncon = 1; /* The number of weights per vertex */ 274954695375SMatthew G. Knepley PetscInt nparts; /* The number of partitions */ 275054695375SMatthew G. Knepley PetscReal *tpwgts; /* The fraction of vertex weights assigned to each partition */ 275154695375SMatthew G. Knepley PetscReal *ubvec; /* The balance intolerance for vertex weights */ 275254695375SMatthew G. Knepley PetscInt options[5]; /* Options */ 275354695375SMatthew G. Knepley /* Outputs */ 275454695375SMatthew G. Knepley PetscInt edgeCut; /* The number of edges cut by the partition */ 275525cda350SMatthew G. Knepley PetscInt *assignment, *points; 275625cda350SMatthew G. Knepley PetscMPIInt commSize, rank, p, v, i; 275725cda350SMatthew G. Knepley PetscErrorCode ierr; 275825cda350SMatthew G. Knepley 2759552f7358SJed Brown PetscFunctionBegin; 276025cda350SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr); 276125cda350SMatthew G. Knepley ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 276225cda350SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 276325cda350SMatthew G. Knepley nparts = commSize; 276425cda350SMatthew G. Knepley options[0] = 0; /* Use all defaults */ 276525cda350SMatthew G. Knepley /* Calculate vertex distribution */ 2766dcca6d9dSJed Brown ierr = PetscMalloc4(nparts+1,&vtxdist,nparts*ncon,&tpwgts,ncon,&ubvec,nvtxs,&assignment);CHKERRQ(ierr); 276725cda350SMatthew G. Knepley vtxdist[0] = 0; 276825cda350SMatthew G. Knepley ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr); 276925cda350SMatthew G. Knepley for (p = 2; p <= nparts; ++p) { 277025cda350SMatthew G. Knepley vtxdist[p] += vtxdist[p-1]; 277125cda350SMatthew G. Knepley } 277225cda350SMatthew G. Knepley /* Calculate weights */ 277325cda350SMatthew G. Knepley for (p = 0; p < nparts; ++p) { 277425cda350SMatthew G. Knepley tpwgts[p] = 1.0/nparts; 277525cda350SMatthew G. Knepley } 277625cda350SMatthew G. Knepley ubvec[0] = 1.05; 277725cda350SMatthew G. Knepley 277825cda350SMatthew G. Knepley if (nparts == 1) { 277925cda350SMatthew G. Knepley ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt)); 278025cda350SMatthew G. Knepley } else { 278125cda350SMatthew G. Knepley if (vtxdist[1] == vtxdist[nparts]) { 278225cda350SMatthew G. Knepley if (!rank) { 2783e7ee2502SMatthew G. Knepley PetscStackPush("METIS_PartGraphKway"); 2784e7ee2502SMatthew G. Knepley ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment); 2785e7ee2502SMatthew G. Knepley PetscStackPop; 2786e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()"); 278725cda350SMatthew G. Knepley } 278825cda350SMatthew G. Knepley } else { 2789e7ee2502SMatthew G. Knepley PetscStackPush("ParMETIS_V3_PartKway"); 2790e7ee2502SMatthew G. Knepley ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm); 2791e7ee2502SMatthew G. Knepley PetscStackPop; 2792e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()"); 279325cda350SMatthew G. Knepley } 279425cda350SMatthew G. Knepley } 279525cda350SMatthew G. Knepley /* Convert to PetscSection+IS */ 279625cda350SMatthew G. Knepley ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 279725cda350SMatthew G. Knepley ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 279825cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 279925cda350SMatthew G. Knepley ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 280025cda350SMatthew G. Knepley } 280125cda350SMatthew G. Knepley ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2802785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 280325cda350SMatthew G. Knepley for (p = 0, i = 0; p < commSize; ++p) { 280425cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 280525cda350SMatthew G. Knepley if (assignment[v] == p) points[i++] = v; 280625cda350SMatthew G. Knepley } 280725cda350SMatthew G. Knepley } 280825cda350SMatthew G. Knepley if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 280925cda350SMatthew G. Knepley ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 281025cda350SMatthew G. Knepley ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr); 2811552f7358SJed Brown PetscFunctionReturn(0); 2812552f7358SJed Brown } 2813552f7358SJed Brown #endif 2814552f7358SJed Brown 2815552f7358SJed Brown #undef __FUNCT__ 2816552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition" 2817552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */ 2818a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition) 2819a6dfd86eSKarl Rupp { 2820552f7358SJed Brown PetscHashI h; 2821552f7358SJed Brown const PetscInt *points; 2822552f7358SJed Brown PetscInt **tmpPoints, *newPoints, totPoints = 0; 2823552f7358SJed Brown PetscInt pStart, pEnd, part, q; 2824552f7358SJed Brown PetscErrorCode ierr; 2825552f7358SJed Brown 2826552f7358SJed Brown PetscFunctionBegin; 2827552f7358SJed Brown PetscHashICreate(h); 282882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2829552f7358SJed Brown ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr); 2830552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr); 2831552f7358SJed Brown ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr); 2832785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &tmpPoints);CHKERRQ(ierr); 2833552f7358SJed Brown for (part = pStart; part < pEnd; ++part) { 2834552f7358SJed Brown PetscInt numPoints, nP, numNewPoints, off, p, n = 0; 2835552f7358SJed Brown 2836552f7358SJed Brown PetscHashIClear(h); 2837552f7358SJed Brown ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr); 2838552f7358SJed Brown ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr); 2839552f7358SJed Brown /* Add all existing points to h */ 2840552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2841552f7358SJed Brown const PetscInt point = points[off+p]; 2842552f7358SJed Brown PetscHashIAdd(h, point, 1); 2843552f7358SJed Brown } 2844552f7358SJed Brown PetscHashISize(h, nP); 284582f516ccSBarry Smith if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP); 2846552f7358SJed Brown /* Add all points in next BFS level */ 2847552f7358SJed Brown /* TODO We are brute forcing here, but could check the adjacency size to find the boundary */ 2848552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2849552f7358SJed Brown const PetscInt point = points[off+p]; 2850552f7358SJed Brown PetscInt s = start[point], e = start[point+1], a; 2851552f7358SJed Brown 28520d644c17SKarl Rupp for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1); 2853552f7358SJed Brown } 2854552f7358SJed Brown PetscHashISize(h, numNewPoints); 2855552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr); 2856785e854fSJed Brown ierr = PetscMalloc1(numNewPoints, &tmpPoints[part]);CHKERRQ(ierr); 2857c9fc7396SMatthew G. Knepley ierr = PetscHashIGetKeys(h, &n, tmpPoints[part]);CHKERRQ(ierr); 2858552f7358SJed Brown totPoints += numNewPoints; 2859552f7358SJed Brown } 2860552f7358SJed Brown ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr); 2861552f7358SJed Brown PetscHashIDestroy(h); 2862552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2863785e854fSJed Brown ierr = PetscMalloc1(totPoints, &newPoints);CHKERRQ(ierr); 2864552f7358SJed Brown for (part = pStart, q = 0; part < pEnd; ++part) { 2865552f7358SJed Brown PetscInt numPoints, p; 2866552f7358SJed Brown 2867552f7358SJed Brown ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr); 28680d644c17SKarl Rupp for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p]; 2869552f7358SJed Brown ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr); 2870552f7358SJed Brown } 2871552f7358SJed Brown ierr = PetscFree(tmpPoints);CHKERRQ(ierr); 287282f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2873552f7358SJed Brown PetscFunctionReturn(0); 2874552f7358SJed Brown } 2875552f7358SJed Brown 2876552f7358SJed Brown #undef __FUNCT__ 2877552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition" 2878552f7358SJed Brown /* 2879552f7358SJed Brown DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height 2880552f7358SJed Brown 2881552f7358SJed Brown Collective on DM 2882552f7358SJed Brown 2883552f7358SJed Brown Input Parameters: 2884552f7358SJed Brown + dm - The DM 2885552f7358SJed Brown . height - The height for points in the partition 2886552f7358SJed Brown - enlarge - Expand each partition with neighbors 2887552f7358SJed Brown 2888552f7358SJed Brown Output Parameters: 2889552f7358SJed Brown + partSection - The PetscSection giving the division of points by partition 2890552f7358SJed Brown . partition - The list of points by partition 28910298fd71SBarry Smith . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL 28920298fd71SBarry Smith - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL 2893552f7358SJed Brown 2894552f7358SJed Brown Level: developer 2895552f7358SJed Brown 2896552f7358SJed Brown .seealso DMPlexDistribute() 2897552f7358SJed Brown */ 2898ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition) 28990adebc6cSBarry Smith { 2900ac17c9edSMatthew G. Knepley char partname[1024]; 2901ac17c9edSMatthew G. Knepley PetscBool isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg; 2902552f7358SJed Brown PetscMPIInt size; 2903552f7358SJed Brown PetscErrorCode ierr; 2904552f7358SJed Brown 2905552f7358SJed Brown PetscFunctionBegin; 290682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 29070d644c17SKarl Rupp 29080298fd71SBarry Smith *origPartSection = NULL; 29090298fd71SBarry Smith *origPartition = NULL; 2910552f7358SJed Brown if (size == 1) { 2911552f7358SJed Brown PetscInt *points; 2912552f7358SJed Brown PetscInt cStart, cEnd, c; 2913552f7358SJed Brown 2914552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 291582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2916552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr); 2917552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr); 2918552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2919785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &points);CHKERRQ(ierr); 29200d644c17SKarl Rupp for (c = cStart; c < cEnd; ++c) points[c] = c; 292182f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2922552f7358SJed Brown PetscFunctionReturn(0); 2923552f7358SJed Brown } 2924ac17c9edSMatthew G. Knepley ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr); 2925ac17c9edSMatthew G. Knepley if (flg) name = partname; 2926ac17c9edSMatthew G. Knepley if (name) { 2927ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr); 2928ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr); 2929ac17c9edSMatthew G. Knepley } 2930552f7358SJed Brown if (height == 0) { 2931552f7358SJed Brown PetscInt numVertices; 29320298fd71SBarry Smith PetscInt *start = NULL; 29330298fd71SBarry Smith PetscInt *adjacency = NULL; 2934552f7358SJed Brown 293577c88f5bSMatthew G Knepley ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr); 2936ac17c9edSMatthew G. Knepley if (!name || isChaco) { 2937519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2938552f7358SJed Brown ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2939ac17c9edSMatthew G. Knepley #else 2940ac17c9edSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco."); 2941552f7358SJed Brown #endif 2942ac17c9edSMatthew G. Knepley } else if (isMetis) { 2943519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 2944552f7358SJed Brown ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2945552f7358SJed Brown #endif 2946ac17c9edSMatthew G. Knepley } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name); 2947552f7358SJed Brown if (enlarge) { 2948552f7358SJed Brown *origPartSection = *partSection; 2949552f7358SJed Brown *origPartition = *partition; 29500d644c17SKarl Rupp 2951552f7358SJed Brown ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr); 2952552f7358SJed Brown } 2953552f7358SJed Brown ierr = PetscFree(start);CHKERRQ(ierr); 2954552f7358SJed Brown ierr = PetscFree(adjacency);CHKERRQ(ierr); 2955552f7358SJed Brown # if 0 2956552f7358SJed Brown } else if (height == 1) { 2957552f7358SJed Brown /* Build the dual graph for faces and partition the hypergraph */ 2958552f7358SJed Brown PetscInt numEdges; 2959552f7358SJed Brown 2960552f7358SJed Brown buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase()); 2961552f7358SJed Brown GraphPartitioner().partition(numEdges, start, adjacency, partition, manager); 2962552f7358SJed Brown destroyCSR(numEdges, start, adjacency); 2963552f7358SJed Brown #endif 296482f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height); 2965552f7358SJed Brown PetscFunctionReturn(0); 2966552f7358SJed Brown } 2967552f7358SJed Brown 2968552f7358SJed Brown #undef __FUNCT__ 2969552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure" 29700adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition) 29710adebc6cSBarry Smith { 2972552f7358SJed Brown /* const PetscInt height = 0; */ 2973552f7358SJed Brown const PetscInt *partArray; 2974cb3cb6d9SJed Brown PetscInt *allPoints, *packPoints; 2975cb3cb6d9SJed Brown PetscInt rStart, rEnd, rank, pStart, pEnd, newSize; 2976552f7358SJed Brown PetscErrorCode ierr; 2977cb3cb6d9SJed Brown PetscBT bt; 2978cb3cb6d9SJed Brown PetscSegBuffer segpack,segpart; 2979552f7358SJed Brown 2980552f7358SJed Brown PetscFunctionBegin; 2981552f7358SJed Brown ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr); 2982552f7358SJed Brown ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr); 298382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2984552f7358SJed Brown ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr); 2985cb3cb6d9SJed Brown ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr); 2986cb3cb6d9SJed Brown ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr); 2987cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr); 2988cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr); 2989552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2990471ecdacSJed Brown PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints; 2991552f7358SJed Brown 2992552f7358SJed Brown ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr); 2993552f7358SJed Brown ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr); 2994552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2995552f7358SJed Brown PetscInt point = partArray[offset+p], closureSize, c; 29960298fd71SBarry Smith PetscInt *closure = NULL; 2997552f7358SJed Brown 2998552f7358SJed Brown /* TODO Include support for height > 0 case */ 2999552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3000cb3cb6d9SJed Brown for (c=0; c<closureSize; c++) { 3001cb3cb6d9SJed Brown PetscInt cpoint = closure[c*2]; 3002cb3cb6d9SJed Brown if (!PetscBTLookupSet(bt,cpoint-pStart)) { 3003471ecdacSJed Brown PetscInt *PETSC_RESTRICT pt; 3004cb3cb6d9SJed Brown partSize++; 3005471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr); 3006cb3cb6d9SJed Brown *pt = cpoint; 3007552f7358SJed Brown } 3008cb3cb6d9SJed Brown } 3009552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3010552f7358SJed Brown } 3011552f7358SJed Brown ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr); 3012471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr); 3013471ecdacSJed Brown ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr); 3014471ecdacSJed Brown ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr); 3015471ecdacSJed Brown for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);} 3016552f7358SJed Brown } 3017cb3cb6d9SJed Brown ierr = PetscBTDestroy(&bt);CHKERRQ(ierr); 3018cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr); 3019cb3cb6d9SJed Brown 3020552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 3021552f7358SJed Brown ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr); 3022785e854fSJed Brown ierr = PetscMalloc1(newSize, &allPoints);CHKERRQ(ierr); 3023552f7358SJed Brown 3024137cf7b6SJed Brown ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr); 3025552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 3026cb3cb6d9SJed Brown PetscInt numPoints, offset; 3027552f7358SJed Brown 3028cb3cb6d9SJed Brown ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr); 3029cb3cb6d9SJed Brown ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr); 3030cb3cb6d9SJed Brown ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr); 3031cb3cb6d9SJed Brown packPoints += numPoints; 3032552f7358SJed Brown } 3033cb3cb6d9SJed Brown 3034cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr); 3035552f7358SJed Brown ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr); 303682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 3037552f7358SJed Brown PetscFunctionReturn(0); 3038552f7358SJed Brown } 3039552f7358SJed Brown 3040552f7358SJed Brown #undef __FUNCT__ 3041552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField" 30421858a729SMatthew G. Knepley /*@ 30431858a729SMatthew G. Knepley DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 30441858a729SMatthew G. Knepley 30451858a729SMatthew G. Knepley Collective on DM 30461858a729SMatthew G. Knepley 3047552f7358SJed Brown Input Parameters: 30481858a729SMatthew G. Knepley + dm - The DMPlex object 30491858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 30501858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 30511858a729SMatthew G. Knepley - originalVec - The existing data 3052552f7358SJed Brown 3053552f7358SJed Brown Output Parameters: 30541858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 30551858a729SMatthew G. Knepley - newVec - The new data 30561858a729SMatthew G. Knepley 30571858a729SMatthew G. Knepley Level: developer 30581858a729SMatthew G. Knepley 30591858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData() 30601858a729SMatthew G. Knepley @*/ 3061552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec) 3062552f7358SJed Brown { 3063552f7358SJed Brown PetscSF fieldSF; 3064552f7358SJed Brown PetscInt *remoteOffsets, fieldSize; 3065552f7358SJed Brown PetscScalar *originalValues, *newValues; 3066552f7358SJed Brown PetscErrorCode ierr; 3067552f7358SJed Brown 3068552f7358SJed Brown PetscFunctionBegin; 30691337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3070552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 3071552f7358SJed Brown 3072552f7358SJed Brown ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 3073552f7358SJed Brown ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr); 3074c0dedaeaSBarry Smith ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr); 3075552f7358SJed Brown 3076552f7358SJed Brown ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr); 3077552f7358SJed Brown ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr); 3078552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 3079552f7358SJed Brown ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3080552f7358SJed Brown ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3081552f7358SJed Brown ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 3082552f7358SJed Brown ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr); 3083552f7358SJed Brown ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr); 30841337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3085552f7358SJed Brown PetscFunctionReturn(0); 3086552f7358SJed Brown } 3087552f7358SJed Brown 3088552f7358SJed Brown #undef __FUNCT__ 30891858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData" 30901858a729SMatthew G. Knepley /*@ 30911858a729SMatthew G. Knepley DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 30921858a729SMatthew G. Knepley 30931858a729SMatthew G. Knepley Collective on DM 30941858a729SMatthew G. Knepley 30951858a729SMatthew G. Knepley Input Parameters: 30961858a729SMatthew G. Knepley + dm - The DMPlex object 30971858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 30981858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 30991858a729SMatthew G. Knepley . datatype - The type of data 31001858a729SMatthew G. Knepley - originalData - The existing data 31011858a729SMatthew G. Knepley 31021858a729SMatthew G. Knepley Output Parameters: 31031858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 31041858a729SMatthew G. Knepley - newData - The new data 31051858a729SMatthew G. Knepley 31061858a729SMatthew G. Knepley Level: developer 31071858a729SMatthew G. Knepley 31081858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField() 31091858a729SMatthew G. Knepley @*/ 31101858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData) 31111858a729SMatthew G. Knepley { 31121858a729SMatthew G. Knepley PetscSF fieldSF; 31131858a729SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 31141858a729SMatthew G. Knepley PetscMPIInt dataSize; 31151858a729SMatthew G. Knepley PetscErrorCode ierr; 31161858a729SMatthew G. Knepley 31171858a729SMatthew G. Knepley PetscFunctionBegin; 31181337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 31191858a729SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 31201858a729SMatthew G. Knepley 31211858a729SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 31221858a729SMatthew G. Knepley ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr); 31231858a729SMatthew G. Knepley ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr); 31241858a729SMatthew G. Knepley 31251858a729SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 31261858a729SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 31271858a729SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 31281858a729SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 31291337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 31301858a729SMatthew G. Knepley PetscFunctionReturn(0); 31311858a729SMatthew G. Knepley } 31321858a729SMatthew G. Knepley 31331858a729SMatthew G. Knepley #undef __FUNCT__ 3134552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute" 3135552f7358SJed Brown /*@C 3136552f7358SJed Brown DMPlexDistribute - Distributes the mesh and any associated sections. 3137552f7358SJed Brown 3138552f7358SJed Brown Not Collective 3139552f7358SJed Brown 3140552f7358SJed Brown Input Parameter: 3141552f7358SJed Brown + dm - The original DMPlex object 3142552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default 3143552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default 3144552f7358SJed Brown 3145552f7358SJed Brown Output Parameter: 3146e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution 3147e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL 3148552f7358SJed Brown 31490298fd71SBarry Smith Note: If the mesh was not distributed, the return value is NULL 3150552f7358SJed Brown 3151552f7358SJed Brown Level: intermediate 3152552f7358SJed Brown 3153552f7358SJed Brown .keywords: mesh, elements 3154552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace() 3155552f7358SJed Brown @*/ 3156e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel) 3157552f7358SJed Brown { 3158552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data, *pmesh; 315982f516ccSBarry Smith MPI_Comm comm; 3160552f7358SJed Brown const PetscInt height = 0; 3161552f7358SJed Brown PetscInt dim, numRemoteRanks; 3162057e8d19SMichael Lange IS origCellPart, origPart, cellPart, part; 3163057e8d19SMichael Lange PetscSection origCellPartSection, origPartSection, cellPartSection, partSection; 3164552f7358SJed Brown PetscSFNode *remoteRanks; 3165552f7358SJed Brown PetscSF partSF, pointSF, coneSF; 3166552f7358SJed Brown ISLocalToGlobalMapping renumbering; 3167552f7358SJed Brown PetscSection originalConeSection, newConeSection; 3168552f7358SJed Brown PetscInt *remoteOffsets; 3169552f7358SJed Brown PetscInt *cones, *newCones, newConesSize; 3170552f7358SJed Brown PetscBool flg; 3171552f7358SJed Brown PetscMPIInt rank, numProcs, p; 3172552f7358SJed Brown PetscErrorCode ierr; 3173552f7358SJed Brown 3174552f7358SJed Brown PetscFunctionBegin; 3175552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3176e7ba9e7aSMatthew G. Knepley if (sf) PetscValidPointer(sf,4); 3177e7ba9e7aSMatthew G. Knepley PetscValidPointer(dmParallel,5); 31780d644c17SKarl Rupp 3179552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 318082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3181552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3182552f7358SJed Brown ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr); 31830d644c17SKarl Rupp 31840298fd71SBarry Smith *dmParallel = NULL; 3185552f7358SJed Brown if (numProcs == 1) PetscFunctionReturn(0); 3186552f7358SJed Brown 3187552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3188552f7358SJed Brown /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */ 3189b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 319082f516ccSBarry Smith if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented"); 3191ac17c9edSMatthew G. Knepley ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr); 3192552f7358SJed Brown /* Create SF assuming a serial partition for all processes: Could check for IS length here */ 31930d644c17SKarl Rupp if (!rank) numRemoteRanks = numProcs; 31940d644c17SKarl Rupp else numRemoteRanks = 0; 3195785e854fSJed Brown ierr = PetscMalloc1(numRemoteRanks, &remoteRanks);CHKERRQ(ierr); 3196552f7358SJed Brown for (p = 0; p < numRemoteRanks; ++p) { 3197552f7358SJed Brown remoteRanks[p].rank = p; 3198552f7358SJed Brown remoteRanks[p].index = 0; 3199552f7358SJed Brown } 3200552f7358SJed Brown ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr); 32010298fd71SBarry Smith ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr); 3202552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr); 3203552f7358SJed Brown if (flg) { 3204552f7358SJed Brown ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr); 3205552f7358SJed Brown ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 32060298fd71SBarry Smith ierr = ISView(cellPart, NULL);CHKERRQ(ierr); 3207552f7358SJed Brown if (origCellPart) { 3208552f7358SJed Brown ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr); 3209552f7358SJed Brown ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 32100298fd71SBarry Smith ierr = ISView(origCellPart, NULL);CHKERRQ(ierr); 3211552f7358SJed Brown } 32120298fd71SBarry Smith ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr); 3213552f7358SJed Brown } 3214552f7358SJed Brown /* Close the partition over the mesh */ 3215552f7358SJed Brown ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr); 3216552f7358SJed Brown ierr = ISDestroy(&cellPart);CHKERRQ(ierr); 3217552f7358SJed Brown ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr); 3218552f7358SJed Brown /* Create new mesh */ 3219552f7358SJed Brown ierr = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr); 3220552f7358SJed Brown ierr = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr); 3221552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr); 3222552f7358SJed Brown pmesh = (DM_Plex*) (*dmParallel)->data; 3223552f7358SJed Brown /* Distribute sieve points and the global point numbering (replaces creating remote bases) */ 3224552f7358SJed Brown ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr); 3225552f7358SJed Brown if (flg) { 3226552f7358SJed Brown ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr); 3227552f7358SJed Brown ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 32280298fd71SBarry Smith ierr = ISView(part, NULL);CHKERRQ(ierr); 32290298fd71SBarry Smith ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr); 3230552f7358SJed Brown ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr); 32310298fd71SBarry Smith ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr); 3232552f7358SJed Brown } 3233b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 32341337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3235552f7358SJed Brown /* Distribute cone section */ 3236552f7358SJed Brown ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr); 3237552f7358SJed Brown ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr); 3238552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr); 3239552f7358SJed Brown ierr = DMSetUp(*dmParallel);CHKERRQ(ierr); 3240552f7358SJed Brown { 3241552f7358SJed Brown PetscInt pStart, pEnd, p; 3242552f7358SJed Brown 3243552f7358SJed Brown ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr); 3244552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3245552f7358SJed Brown PetscInt coneSize; 3246552f7358SJed Brown ierr = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr); 3247552f7358SJed Brown pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize); 3248552f7358SJed Brown } 3249552f7358SJed Brown } 3250552f7358SJed Brown /* Communicate and renumber cones */ 3251552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr); 3252552f7358SJed Brown ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr); 3253552f7358SJed Brown ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr); 3254552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3255552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3256552f7358SJed Brown ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr); 32570298fd71SBarry Smith ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr); 3258552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr); 3259552f7358SJed Brown if (flg) { 3260552f7358SJed Brown ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr); 3261552f7358SJed Brown ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 3262552f7358SJed Brown ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr); 3263552f7358SJed Brown ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 32640298fd71SBarry Smith ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr); 3265552f7358SJed Brown } 3266552f7358SJed Brown ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr); 3267552f7358SJed Brown ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr); 3268552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3269552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3270552f7358SJed Brown ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr); 32711337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3272552f7358SJed Brown /* Create supports and stratify sieve */ 3273552f7358SJed Brown { 3274552f7358SJed Brown PetscInt pStart, pEnd; 3275552f7358SJed Brown 3276552f7358SJed Brown ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 3277552f7358SJed Brown ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 3278552f7358SJed Brown } 3279552f7358SJed Brown ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr); 3280552f7358SJed Brown ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr); 3281552f7358SJed Brown /* Distribute Coordinates */ 3282552f7358SJed Brown { 3283552f7358SJed Brown PetscSection originalCoordSection, newCoordSection; 3284552f7358SJed Brown Vec originalCoordinates, newCoordinates; 3285552f7358SJed Brown const char *name; 3286552f7358SJed Brown 328769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr); 328869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr); 3289552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr); 3290552f7358SJed Brown ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr); 3291552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr); 3292552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr); 3293552f7358SJed Brown 3294552f7358SJed Brown ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr); 3295552f7358SJed Brown ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr); 3296552f7358SJed Brown ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 3297552f7358SJed Brown } 3298552f7358SJed Brown /* Distribute labels */ 3299b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 3300552f7358SJed Brown { 3301552f7358SJed Brown DMLabel next = mesh->labels, newNext = pmesh->labels; 3302552f7358SJed Brown PetscInt numLabels = 0, l; 3303552f7358SJed Brown 3304552f7358SJed Brown /* Bcast number of labels */ 330520cb08bdSMatthew G. Knepley while (next) {++numLabels; next = next->next;} 3306552f7358SJed Brown ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3307552f7358SJed Brown next = mesh->labels; 3308552f7358SJed Brown for (l = 0; l < numLabels; ++l) { 330920cb08bdSMatthew G. Knepley DMLabel labelNew; 3310552f7358SJed Brown PetscBool isdepth; 3311552f7358SJed Brown 331220cb08bdSMatthew G. Knepley /* Skip "depth" because it is recreated */ 331320cb08bdSMatthew G. Knepley if (!rank) {ierr = PetscStrcmp(next->name, "depth", &isdepth);CHKERRQ(ierr);} 331420cb08bdSMatthew G. Knepley ierr = MPI_Bcast(&isdepth, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 331520cb08bdSMatthew G. Knepley if (isdepth) {if (!rank) next = next->next; continue;} 331620cb08bdSMatthew G. Knepley ierr = DMLabelDistribute(next, partSection, part, renumbering, &labelNew);CHKERRQ(ierr); 3317552f7358SJed Brown /* Insert into list */ 331820cb08bdSMatthew G. Knepley if (newNext) newNext->next = labelNew; 331920cb08bdSMatthew G. Knepley else pmesh->labels = labelNew; 332020cb08bdSMatthew G. Knepley newNext = labelNew; 33210d644c17SKarl Rupp if (!rank) next = next->next; 3322552f7358SJed Brown } 3323552f7358SJed Brown } 3324b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 33255a9d0af9SMatthew G. Knepley /* Setup hybrid structure */ 33265a9d0af9SMatthew G. Knepley { 33275a9d0af9SMatthew G. Knepley const PetscInt *gpoints; 33285a9d0af9SMatthew G. Knepley PetscInt depth, n, d; 33295a9d0af9SMatthew G. Knepley 33305a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];} 33315a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr); 33325a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr); 33335a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr); 33345a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 33355a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 33365a9d0af9SMatthew G. Knepley PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p; 33375a9d0af9SMatthew G. Knepley 33385a9d0af9SMatthew G. Knepley if (pmax < 0) continue; 33395a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr); 33406dfbe1fcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr); 33415a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr); 33425a9d0af9SMatthew G. Knepley for (p = 0; p < n; ++p) { 33435a9d0af9SMatthew G. Knepley const PetscInt point = gpoints[p]; 33445a9d0af9SMatthew G. Knepley 33455a9d0af9SMatthew G. Knepley if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax; 33465a9d0af9SMatthew G. Knepley } 33475a9d0af9SMatthew G. Knepley if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax; 33485a9d0af9SMatthew G. Knepley else pmesh->hybridPointMax[d] = -1; 33495a9d0af9SMatthew G. Knepley } 33505a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr); 33515a9d0af9SMatthew G. Knepley } 3352552f7358SJed Brown /* Cleanup Partition */ 3353552f7358SJed Brown ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr); 3354552f7358SJed Brown ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr); 3355552f7358SJed Brown ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr); 3356552f7358SJed Brown ierr = ISDestroy(&part);CHKERRQ(ierr); 3357552f7358SJed Brown /* Create point SF for parallel mesh */ 3358b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3359552f7358SJed Brown { 3360552f7358SJed Brown const PetscInt *leaves; 3361552f7358SJed Brown PetscSFNode *remotePoints, *rowners, *lowners; 3362552f7358SJed Brown PetscInt numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints; 3363552f7358SJed Brown PetscInt pStart, pEnd; 3364552f7358SJed Brown 3365552f7358SJed Brown ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr); 33660298fd71SBarry Smith ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr); 3367dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&rowners,numLeaves,&lowners);CHKERRQ(ierr); 3368552f7358SJed Brown for (p=0; p<numRoots; p++) { 3369552f7358SJed Brown rowners[p].rank = -1; 3370552f7358SJed Brown rowners[p].index = -1; 3371552f7358SJed Brown } 3372552f7358SJed Brown if (origCellPart) { 3373057e8d19SMichael Lange /* Make sure points in the original partition are not assigned to other procs */ 3374057e8d19SMichael Lange const PetscInt *origPoints; 3375552f7358SJed Brown 3376057e8d19SMichael Lange ierr = DMPlexCreatePartitionClosure(dm, origCellPartSection, origCellPart, &origPartSection, &origPart);CHKERRQ(ierr); 3377057e8d19SMichael Lange ierr = ISGetIndices(origPart, &origPoints);CHKERRQ(ierr); 3378552f7358SJed Brown for (p = 0; p < numProcs; ++p) { 3379552f7358SJed Brown PetscInt dof, off, d; 3380552f7358SJed Brown 3381057e8d19SMichael Lange ierr = PetscSectionGetDof(origPartSection, p, &dof);CHKERRQ(ierr); 3382057e8d19SMichael Lange ierr = PetscSectionGetOffset(origPartSection, p, &off);CHKERRQ(ierr); 3383552f7358SJed Brown for (d = off; d < off+dof; ++d) { 3384057e8d19SMichael Lange rowners[origPoints[d]].rank = p; 3385552f7358SJed Brown } 3386552f7358SJed Brown } 3387057e8d19SMichael Lange ierr = ISRestoreIndices(origPart, &origPoints);CHKERRQ(ierr); 3388057e8d19SMichael Lange ierr = ISDestroy(&origPart);CHKERRQ(ierr); 3389057e8d19SMichael Lange ierr = PetscSectionDestroy(&origPartSection);CHKERRQ(ierr); 3390552f7358SJed Brown } 3391552f7358SJed Brown ierr = ISDestroy(&origCellPart);CHKERRQ(ierr); 3392552f7358SJed Brown ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr); 3393552f7358SJed Brown 3394552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3395552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3396552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3397552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */ 3398552f7358SJed Brown lowners[p].rank = rank; 3399552f7358SJed Brown lowners[p].index = leaves ? leaves[p] : p; 3400552f7358SJed Brown } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */ 3401552f7358SJed Brown lowners[p].rank = -2; 3402552f7358SJed Brown lowners[p].index = -2; 3403552f7358SJed Brown } 3404552f7358SJed Brown } 3405552f7358SJed Brown for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */ 3406552f7358SJed Brown rowners[p].rank = -3; 3407552f7358SJed Brown rowners[p].index = -3; 3408552f7358SJed Brown } 3409552f7358SJed Brown ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3410552f7358SJed Brown ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3411552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3412552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3413552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3414552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed"); 3415552f7358SJed Brown if (lowners[p].rank != rank) ++numGhostPoints; 3416552f7358SJed Brown } 3417785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &ghostPoints);CHKERRQ(ierr); 3418785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &remotePoints);CHKERRQ(ierr); 3419552f7358SJed Brown for (p = 0, gp = 0; p < numLeaves; ++p) { 3420552f7358SJed Brown if (lowners[p].rank != rank) { 3421552f7358SJed Brown ghostPoints[gp] = leaves ? leaves[p] : p; 3422552f7358SJed Brown remotePoints[gp].rank = lowners[p].rank; 3423552f7358SJed Brown remotePoints[gp].index = lowners[p].index; 3424552f7358SJed Brown ++gp; 3425552f7358SJed Brown } 3426552f7358SJed Brown } 3427552f7358SJed Brown ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr); 3428552f7358SJed Brown ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3429552f7358SJed Brown ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr); 3430552f7358SJed Brown } 3431b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3432552f7358SJed Brown /* Cleanup */ 3433e7ba9e7aSMatthew G. Knepley if (sf) {*sf = pointSF;} 3434e7ba9e7aSMatthew G. Knepley else {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);} 3435552f7358SJed Brown ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr); 3436552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 3437552f7358SJed Brown PetscFunctionReturn(0); 3438552f7358SJed Brown } 3439552f7358SJed Brown 34402e1b13c2SMatthew G. Knepley #undef __FUNCT__ 34419db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 34429db3b87dSMatthew G. Knepley /*@C 34439db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 34449db3b87dSMatthew G. Knepley 34459db3b87dSMatthew G. Knepley Input Parameters: 34469db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 34479db3b87dSMatthew G. Knepley - cone - The incoming cone 34489db3b87dSMatthew G. Knepley 34499db3b87dSMatthew G. Knepley Output Parameter: 34509db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 34519db3b87dSMatthew G. Knepley 34529db3b87dSMatthew G. Knepley Level: developer 34539db3b87dSMatthew G. Knepley 34549db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 34559db3b87dSMatthew G. Knepley @*/ 34569db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 34572e1b13c2SMatthew G. Knepley { 34589db3b87dSMatthew G. Knepley int tmpc; 34592e1b13c2SMatthew G. Knepley 34602e1b13c2SMatthew G. Knepley PetscFunctionBegin; 34619db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 34629db3b87dSMatthew G. Knepley switch (numCorners) { 34639db3b87dSMatthew G. Knepley case 4: 34641885f254SMatthew G. Knepley tmpc = cone[0]; 34651885f254SMatthew G. Knepley cone[0] = cone[1]; 34661885f254SMatthew G. Knepley cone[1] = tmpc; 34679db3b87dSMatthew G. Knepley break; 34689db3b87dSMatthew G. Knepley case 8: 34699db3b87dSMatthew G. Knepley tmpc = cone[1]; 34709db3b87dSMatthew G. Knepley cone[1] = cone[3]; 34719db3b87dSMatthew G. Knepley cone[3] = tmpc; 34729db3b87dSMatthew G. Knepley break; 34739db3b87dSMatthew G. Knepley default: break; 34749db3b87dSMatthew G. Knepley } 34759db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 34769db3b87dSMatthew G. Knepley } 34779db3b87dSMatthew G. Knepley 34789db3b87dSMatthew G. Knepley #undef __FUNCT__ 34799db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 34809db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 34819db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 34829db3b87dSMatthew G. Knepley { 34839db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 34849db3b87dSMatthew G. Knepley PetscErrorCode ierr; 34859db3b87dSMatthew G. Knepley 34869db3b87dSMatthew G. Knepley PetscFunctionBegin; 34879db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 34889db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 34892e1b13c2SMatthew G. Knepley } 34902e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 34912e1b13c2SMatthew G. Knepley } 34922e1b13c2SMatthew G. Knepley 3493519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3494552f7358SJed Brown #include <triangle.h> 3495552f7358SJed Brown 3496552f7358SJed Brown #undef __FUNCT__ 3497552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 34980adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 34990adebc6cSBarry Smith { 3500552f7358SJed Brown PetscFunctionBegin; 3501552f7358SJed Brown inputCtx->numberofpoints = 0; 3502552f7358SJed Brown inputCtx->numberofpointattributes = 0; 35030298fd71SBarry Smith inputCtx->pointlist = NULL; 35040298fd71SBarry Smith inputCtx->pointattributelist = NULL; 35050298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 3506552f7358SJed Brown inputCtx->numberofsegments = 0; 35070298fd71SBarry Smith inputCtx->segmentlist = NULL; 35080298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 3509552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 35100298fd71SBarry Smith inputCtx->trianglelist = NULL; 3511552f7358SJed Brown inputCtx->numberofholes = 0; 35120298fd71SBarry Smith inputCtx->holelist = NULL; 3513552f7358SJed Brown inputCtx->numberofregions = 0; 35140298fd71SBarry Smith inputCtx->regionlist = NULL; 3515552f7358SJed Brown PetscFunctionReturn(0); 3516552f7358SJed Brown } 3517552f7358SJed Brown 3518552f7358SJed Brown #undef __FUNCT__ 3519552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 35200adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 35210adebc6cSBarry Smith { 3522552f7358SJed Brown PetscFunctionBegin; 3523552f7358SJed Brown outputCtx->numberofpoints = 0; 35240298fd71SBarry Smith outputCtx->pointlist = NULL; 35250298fd71SBarry Smith outputCtx->pointattributelist = NULL; 35260298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 3527552f7358SJed Brown outputCtx->numberoftriangles = 0; 35280298fd71SBarry Smith outputCtx->trianglelist = NULL; 35290298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 35300298fd71SBarry Smith outputCtx->neighborlist = NULL; 35310298fd71SBarry Smith outputCtx->segmentlist = NULL; 35320298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 3533552f7358SJed Brown outputCtx->numberofedges = 0; 35340298fd71SBarry Smith outputCtx->edgelist = NULL; 35350298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 3536552f7358SJed Brown PetscFunctionReturn(0); 3537552f7358SJed Brown } 3538552f7358SJed Brown 3539552f7358SJed Brown #undef __FUNCT__ 3540552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 35410adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 35420adebc6cSBarry Smith { 3543552f7358SJed Brown PetscFunctionBegin; 3544552f7358SJed Brown free(outputCtx->pointmarkerlist); 3545552f7358SJed Brown free(outputCtx->edgelist); 3546552f7358SJed Brown free(outputCtx->edgemarkerlist); 3547552f7358SJed Brown free(outputCtx->trianglelist); 3548552f7358SJed Brown free(outputCtx->neighborlist); 3549552f7358SJed Brown PetscFunctionReturn(0); 3550552f7358SJed Brown } 3551552f7358SJed Brown 3552552f7358SJed Brown #undef __FUNCT__ 3553552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 3554552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 3555552f7358SJed Brown { 355682f516ccSBarry Smith MPI_Comm comm; 3557552f7358SJed Brown PetscInt dim = 2; 3558552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 3559552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 3560552f7358SJed Brown struct triangulateio in; 3561552f7358SJed Brown struct triangulateio out; 3562552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 3563552f7358SJed Brown PetscMPIInt rank; 3564552f7358SJed Brown PetscErrorCode ierr; 3565552f7358SJed Brown 3566552f7358SJed Brown PetscFunctionBegin; 356782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3568552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3569552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3570552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3571552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 35720d644c17SKarl Rupp 3573552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3574552f7358SJed Brown if (in.numberofpoints > 0) { 3575552f7358SJed Brown PetscSection coordSection; 3576552f7358SJed Brown Vec coordinates; 3577552f7358SJed Brown PetscScalar *array; 3578552f7358SJed Brown 3579785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3580785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3581552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 358269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3583552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3584552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3585552f7358SJed Brown const PetscInt idx = v - vStart; 3586552f7358SJed Brown PetscInt off, d; 3587552f7358SJed Brown 3588552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3589552f7358SJed Brown for (d = 0; d < dim; ++d) { 3590552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3591552f7358SJed Brown } 3592552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3593552f7358SJed Brown } 3594552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3595552f7358SJed Brown } 3596552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 3597552f7358SJed Brown in.numberofsegments = eEnd - eStart; 3598552f7358SJed Brown if (in.numberofsegments > 0) { 3599785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 3600785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 3601552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 3602552f7358SJed Brown const PetscInt idx = e - eStart; 3603552f7358SJed Brown const PetscInt *cone; 3604552f7358SJed Brown 3605552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 36060d644c17SKarl Rupp 3607552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 3608552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 36090d644c17SKarl Rupp 3610552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 3611552f7358SJed Brown } 3612552f7358SJed Brown } 3613552f7358SJed Brown #if 0 /* Do not currently support holes */ 3614552f7358SJed Brown PetscReal *holeCoords; 3615552f7358SJed Brown PetscInt h, d; 3616552f7358SJed Brown 3617552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3618552f7358SJed Brown if (in.numberofholes > 0) { 3619785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3620552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3621552f7358SJed Brown for (d = 0; d < dim; ++d) { 3622552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3623552f7358SJed Brown } 3624552f7358SJed Brown } 3625552f7358SJed Brown } 3626552f7358SJed Brown #endif 3627552f7358SJed Brown if (!rank) { 3628552f7358SJed Brown char args[32]; 3629552f7358SJed Brown 3630552f7358SJed Brown /* Take away 'Q' for verbose output */ 3631552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3632552f7358SJed Brown if (createConvexHull) { 3633552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 3634552f7358SJed Brown } 3635552f7358SJed Brown if (constrained) { 3636552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 3637552f7358SJed Brown } 36380298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3639552f7358SJed Brown } 3640552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3641552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3642552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3643552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3644552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 3645552f7358SJed Brown 3646552f7358SJed Brown { 3647552f7358SJed Brown const PetscInt numCorners = 3; 3648552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3649552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3650552f7358SJed Brown const int *cells = out.trianglelist; 3651552f7358SJed Brown const double *meshCoords = out.pointlist; 3652552f7358SJed Brown 36530fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3654552f7358SJed Brown /* Set labels */ 3655552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3656552f7358SJed Brown if (out.pointmarkerlist[v]) { 3657552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3658552f7358SJed Brown } 3659552f7358SJed Brown } 3660552f7358SJed Brown if (interpolate) { 3661552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3662552f7358SJed Brown if (out.edgemarkerlist[e]) { 3663552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3664552f7358SJed Brown const PetscInt *edges; 3665552f7358SJed Brown PetscInt numEdges; 3666552f7358SJed Brown 3667552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3668552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3669552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3670552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3671552f7358SJed Brown } 3672552f7358SJed Brown } 3673552f7358SJed Brown } 3674552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3675552f7358SJed Brown } 3676552f7358SJed Brown #if 0 /* Do not currently support holes */ 3677552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3678552f7358SJed Brown #endif 3679552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3680552f7358SJed Brown PetscFunctionReturn(0); 3681552f7358SJed Brown } 3682552f7358SJed Brown 3683552f7358SJed Brown #undef __FUNCT__ 3684552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 3685552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 3686552f7358SJed Brown { 368782f516ccSBarry Smith MPI_Comm comm; 3688552f7358SJed Brown PetscInt dim = 2; 3689552f7358SJed Brown struct triangulateio in; 3690552f7358SJed Brown struct triangulateio out; 3691552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3692552f7358SJed Brown PetscMPIInt rank; 3693552f7358SJed Brown PetscErrorCode ierr; 3694552f7358SJed Brown 3695552f7358SJed Brown PetscFunctionBegin; 369682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3697552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3698552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3699552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3700552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3701552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3702552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 37030d644c17SKarl Rupp 3704552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3705552f7358SJed Brown if (in.numberofpoints > 0) { 3706552f7358SJed Brown PetscSection coordSection; 3707552f7358SJed Brown Vec coordinates; 3708552f7358SJed Brown PetscScalar *array; 3709552f7358SJed Brown 3710785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3711785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3712552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 371369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3714552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3715552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3716552f7358SJed Brown const PetscInt idx = v - vStart; 3717552f7358SJed Brown PetscInt off, d; 3718552f7358SJed Brown 3719552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3720552f7358SJed Brown for (d = 0; d < dim; ++d) { 3721552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3722552f7358SJed Brown } 3723552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3724552f7358SJed Brown } 3725552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3726552f7358SJed Brown } 3727552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 37280d644c17SKarl Rupp 3729552f7358SJed Brown in.numberofcorners = 3; 3730552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 37310d644c17SKarl Rupp 3732552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 3733552f7358SJed Brown if (in.numberoftriangles > 0) { 3734785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 3735552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3736552f7358SJed Brown const PetscInt idx = c - cStart; 37370298fd71SBarry Smith PetscInt *closure = NULL; 3738552f7358SJed Brown PetscInt closureSize; 3739552f7358SJed Brown 3740552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3741552f7358SJed 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); 3742552f7358SJed Brown for (v = 0; v < 3; ++v) { 3743552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 3744552f7358SJed Brown } 3745552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3746552f7358SJed Brown } 3747552f7358SJed Brown } 3748552f7358SJed Brown /* TODO: Segment markers are missing on input */ 3749552f7358SJed Brown #if 0 /* Do not currently support holes */ 3750552f7358SJed Brown PetscReal *holeCoords; 3751552f7358SJed Brown PetscInt h, d; 3752552f7358SJed Brown 3753552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3754552f7358SJed Brown if (in.numberofholes > 0) { 3755785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3756552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3757552f7358SJed Brown for (d = 0; d < dim; ++d) { 3758552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3759552f7358SJed Brown } 3760552f7358SJed Brown } 3761552f7358SJed Brown } 3762552f7358SJed Brown #endif 3763552f7358SJed Brown if (!rank) { 3764552f7358SJed Brown char args[32]; 3765552f7358SJed Brown 3766552f7358SJed Brown /* Take away 'Q' for verbose output */ 3767552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 37680298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3769552f7358SJed Brown } 3770552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3771552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3772552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3773552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3774552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3775552f7358SJed Brown 3776552f7358SJed Brown { 3777552f7358SJed Brown const PetscInt numCorners = 3; 3778552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3779552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3780552f7358SJed Brown const int *cells = out.trianglelist; 3781552f7358SJed Brown const double *meshCoords = out.pointlist; 3782552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3783552f7358SJed Brown 37840fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3785552f7358SJed Brown /* Set labels */ 3786552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3787552f7358SJed Brown if (out.pointmarkerlist[v]) { 3788552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3789552f7358SJed Brown } 3790552f7358SJed Brown } 3791552f7358SJed Brown if (interpolate) { 3792552f7358SJed Brown PetscInt e; 3793552f7358SJed Brown 3794552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3795552f7358SJed Brown if (out.edgemarkerlist[e]) { 3796552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3797552f7358SJed Brown const PetscInt *edges; 3798552f7358SJed Brown PetscInt numEdges; 3799552f7358SJed Brown 3800552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3801552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3802552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3803552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3804552f7358SJed Brown } 3805552f7358SJed Brown } 3806552f7358SJed Brown } 3807552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3808552f7358SJed Brown } 3809552f7358SJed Brown #if 0 /* Do not currently support holes */ 3810552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3811552f7358SJed Brown #endif 3812552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3813552f7358SJed Brown PetscFunctionReturn(0); 3814552f7358SJed Brown } 3815552f7358SJed Brown #endif 3816552f7358SJed Brown 3817519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3818552f7358SJed Brown #include <tetgen.h> 3819552f7358SJed Brown #undef __FUNCT__ 3820552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3821552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3822552f7358SJed Brown { 382382f516ccSBarry Smith MPI_Comm comm; 3824552f7358SJed Brown const PetscInt dim = 3; 3825552f7358SJed Brown ::tetgenio in; 3826552f7358SJed Brown ::tetgenio out; 3827552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3828552f7358SJed Brown PetscMPIInt rank; 3829552f7358SJed Brown PetscErrorCode ierr; 3830552f7358SJed Brown 3831552f7358SJed Brown PetscFunctionBegin; 383282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3833552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3834552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3835552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3836552f7358SJed Brown if (in.numberofpoints > 0) { 3837552f7358SJed Brown PetscSection coordSection; 3838552f7358SJed Brown Vec coordinates; 3839552f7358SJed Brown PetscScalar *array; 3840552f7358SJed Brown 3841552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3842552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 38430d644c17SKarl Rupp 3844552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 384569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3846552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3847552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3848552f7358SJed Brown const PetscInt idx = v - vStart; 3849552f7358SJed Brown PetscInt off, d; 3850552f7358SJed Brown 3851552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 38520d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3853552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3854552f7358SJed Brown } 3855552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3856552f7358SJed Brown } 3857552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 38580d644c17SKarl Rupp 3859552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3860552f7358SJed Brown if (in.numberoffacets > 0) { 3861552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3862552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3863552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3864552f7358SJed Brown const PetscInt idx = f - fStart; 38650298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3866552f7358SJed Brown 3867552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3868552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3869552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3870552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3871552f7358SJed Brown 3872552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3873552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3874552f7358SJed Brown const PetscInt point = points[p]; 38750d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3876552f7358SJed Brown } 3877552f7358SJed Brown 3878552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3879552f7358SJed Brown poly->numberofvertices = numVertices; 3880552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3881552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3882552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3883552f7358SJed Brown poly->vertexlist[v] = vIdx; 3884552f7358SJed Brown } 3885552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3886552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3887552f7358SJed Brown } 3888552f7358SJed Brown } 3889552f7358SJed Brown if (!rank) { 3890552f7358SJed Brown char args[32]; 3891552f7358SJed Brown 3892552f7358SJed Brown /* Take away 'Q' for verbose output */ 3893552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3894552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3895552f7358SJed Brown } 3896552f7358SJed Brown { 3897552f7358SJed Brown const PetscInt numCorners = 4; 3898552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3899552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3900552f7358SJed Brown const double *meshCoords = out.pointlist; 39011d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3902552f7358SJed Brown 39039db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 39040fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3905552f7358SJed Brown /* Set labels */ 3906552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3907552f7358SJed Brown if (out.pointmarkerlist[v]) { 3908552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3909552f7358SJed Brown } 3910552f7358SJed Brown } 3911552f7358SJed Brown if (interpolate) { 3912552f7358SJed Brown PetscInt e; 3913552f7358SJed Brown 3914552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3915552f7358SJed Brown if (out.edgemarkerlist[e]) { 3916552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3917552f7358SJed Brown const PetscInt *edges; 3918552f7358SJed Brown PetscInt numEdges; 3919552f7358SJed Brown 3920552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3921552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3922552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3923552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3924552f7358SJed Brown } 3925552f7358SJed Brown } 3926552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3927552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3928552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3929552f7358SJed Brown const PetscInt *faces; 3930552f7358SJed Brown PetscInt numFaces; 3931552f7358SJed Brown 3932552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3933552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3934552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3935552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3936552f7358SJed Brown } 3937552f7358SJed Brown } 3938552f7358SJed Brown } 3939552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3940552f7358SJed Brown } 3941552f7358SJed Brown PetscFunctionReturn(0); 3942552f7358SJed Brown } 3943552f7358SJed Brown 3944552f7358SJed Brown #undef __FUNCT__ 3945552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3946552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3947552f7358SJed Brown { 394882f516ccSBarry Smith MPI_Comm comm; 3949552f7358SJed Brown const PetscInt dim = 3; 3950552f7358SJed Brown ::tetgenio in; 3951552f7358SJed Brown ::tetgenio out; 3952552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3953552f7358SJed Brown PetscMPIInt rank; 3954552f7358SJed Brown PetscErrorCode ierr; 3955552f7358SJed Brown 3956552f7358SJed Brown PetscFunctionBegin; 395782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3958552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3959552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3960552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3961552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 39620d644c17SKarl Rupp 3963552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3964552f7358SJed Brown if (in.numberofpoints > 0) { 3965552f7358SJed Brown PetscSection coordSection; 3966552f7358SJed Brown Vec coordinates; 3967552f7358SJed Brown PetscScalar *array; 3968552f7358SJed Brown 3969552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3970552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 39710d644c17SKarl Rupp 3972552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 397369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3974552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3975552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3976552f7358SJed Brown const PetscInt idx = v - vStart; 3977552f7358SJed Brown PetscInt off, d; 3978552f7358SJed Brown 3979552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 39800d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3981552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3982552f7358SJed Brown } 3983552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3984552f7358SJed Brown } 3985552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 39860d644c17SKarl Rupp 3987552f7358SJed Brown in.numberofcorners = 4; 3988552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3989552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3990552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3991552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3992552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3993552f7358SJed Brown const PetscInt idx = c - cStart; 39940298fd71SBarry Smith PetscInt *closure = NULL; 3995552f7358SJed Brown PetscInt closureSize; 3996552f7358SJed Brown 3997552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3998552f7358SJed 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); 3999552f7358SJed Brown for (v = 0; v < 4; ++v) { 4000552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4001552f7358SJed Brown } 4002552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4003552f7358SJed Brown } 4004552f7358SJed Brown } 400519436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 4006552f7358SJed Brown if (!rank) { 4007552f7358SJed Brown char args[32]; 4008552f7358SJed Brown 4009552f7358SJed Brown /* Take away 'Q' for verbose output */ 401019436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 4011552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 4012552f7358SJed Brown ::tetrahedralize(args, &in, &out); 4013552f7358SJed Brown } 4014552f7358SJed Brown in.tetrahedronvolumelist = NULL; 4015552f7358SJed Brown 4016552f7358SJed Brown { 4017552f7358SJed Brown const PetscInt numCorners = 4; 4018552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 4019552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 4020552f7358SJed Brown const double *meshCoords = out.pointlist; 40211d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 40221d4b4d7bSJed Brown 4023552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4024552f7358SJed Brown 40259db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 40260fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4027552f7358SJed Brown /* Set labels */ 4028552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4029552f7358SJed Brown if (out.pointmarkerlist[v]) { 4030552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 4031552f7358SJed Brown } 4032552f7358SJed Brown } 4033552f7358SJed Brown if (interpolate) { 4034552f7358SJed Brown PetscInt e, f; 4035552f7358SJed Brown 4036552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 4037552f7358SJed Brown if (out.edgemarkerlist[e]) { 4038552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 4039552f7358SJed Brown const PetscInt *edges; 4040552f7358SJed Brown PetscInt numEdges; 4041552f7358SJed Brown 4042552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4043552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4044552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 4045552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4046552f7358SJed Brown } 4047552f7358SJed Brown } 4048552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 4049552f7358SJed Brown if (out.trifacemarkerlist[f]) { 4050552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 4051552f7358SJed Brown const PetscInt *faces; 4052552f7358SJed Brown PetscInt numFaces; 4053552f7358SJed Brown 4054552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4055552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4056552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 4057552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4058552f7358SJed Brown } 4059552f7358SJed Brown } 4060552f7358SJed Brown } 4061552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4062552f7358SJed Brown } 4063552f7358SJed Brown PetscFunctionReturn(0); 4064552f7358SJed Brown } 4065552f7358SJed Brown #endif 4066552f7358SJed Brown 4067519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4068552f7358SJed Brown #include "ctetgen.h" 4069552f7358SJed Brown 4070552f7358SJed Brown #undef __FUNCT__ 4071552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 4072552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 4073552f7358SJed Brown { 407482f516ccSBarry Smith MPI_Comm comm; 4075552f7358SJed Brown const PetscInt dim = 3; 4076552f7358SJed Brown PLC *in, *out; 4077552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 4078552f7358SJed Brown PetscMPIInt rank; 4079552f7358SJed Brown PetscErrorCode ierr; 4080552f7358SJed Brown 4081552f7358SJed Brown PetscFunctionBegin; 408282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 40830298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4084552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4085552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 4086552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4087552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 40880d644c17SKarl Rupp 4089552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4090552f7358SJed Brown if (in->numberofpoints > 0) { 4091552f7358SJed Brown PetscSection coordSection; 4092552f7358SJed Brown Vec coordinates; 4093552f7358SJed Brown PetscScalar *array; 4094552f7358SJed Brown 4095785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4096785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4097552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 409869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 4099552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4100552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4101552f7358SJed Brown const PetscInt idx = v - vStart; 4102552f7358SJed Brown PetscInt off, d, m; 4103552f7358SJed Brown 4104552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4105552f7358SJed Brown for (d = 0; d < dim; ++d) { 4106552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4107552f7358SJed Brown } 4108552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 41090d644c17SKarl Rupp 4110552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4111552f7358SJed Brown } 4112552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4113552f7358SJed Brown } 4114552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 41150d644c17SKarl Rupp 4116552f7358SJed Brown in->numberoffacets = fEnd - fStart; 4117552f7358SJed Brown if (in->numberoffacets > 0) { 4118785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 4119785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 4120552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 4121552f7358SJed Brown const PetscInt idx = f - fStart; 41220298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 4123552f7358SJed Brown polygon *poly; 4124552f7358SJed Brown 4125552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 41260d644c17SKarl Rupp 4127785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 41280d644c17SKarl Rupp 4129552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 41300298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 4131552f7358SJed Brown 4132552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4133552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4134552f7358SJed Brown const PetscInt point = points[p]; 41350d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 4136552f7358SJed Brown } 4137552f7358SJed Brown 4138552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 4139552f7358SJed Brown poly->numberofvertices = numVertices; 4140785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 4141552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4142552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 4143552f7358SJed Brown poly->vertexlist[v] = vIdx; 4144552f7358SJed Brown } 4145552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 4146552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 4147552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4148552f7358SJed Brown } 4149552f7358SJed Brown } 4150552f7358SJed Brown if (!rank) { 4151552f7358SJed Brown TetGenOpts t; 4152552f7358SJed Brown 4153552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 4154552f7358SJed Brown t.in = boundary; /* Should go away */ 4155552f7358SJed Brown t.plc = 1; 4156552f7358SJed Brown t.quality = 1; 4157552f7358SJed Brown t.edgesout = 1; 4158552f7358SJed Brown t.zeroindex = 1; 4159552f7358SJed Brown t.quiet = 1; 4160552f7358SJed Brown t.verbose = verbose; 4161552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4162552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4163552f7358SJed Brown } 4164552f7358SJed Brown { 4165552f7358SJed Brown const PetscInt numCorners = 4; 4166552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4167552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4168552f7358SJed Brown const double *meshCoords = out->pointlist; 41691d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4170552f7358SJed Brown 41719db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 41720fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 4173552f7358SJed Brown /* Set labels */ 4174552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4175552f7358SJed Brown if (out->pointmarkerlist[v]) { 4176552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4177552f7358SJed Brown } 4178552f7358SJed Brown } 4179552f7358SJed Brown if (interpolate) { 4180552f7358SJed Brown PetscInt e; 4181552f7358SJed Brown 4182552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4183552f7358SJed Brown if (out->edgemarkerlist[e]) { 4184552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4185552f7358SJed Brown const PetscInt *edges; 4186552f7358SJed Brown PetscInt numEdges; 4187552f7358SJed Brown 4188552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4189552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4190552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4191552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4192552f7358SJed Brown } 4193552f7358SJed Brown } 4194552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4195552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4196552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4197552f7358SJed Brown const PetscInt *faces; 4198552f7358SJed Brown PetscInt numFaces; 4199552f7358SJed Brown 4200552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4201552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4202552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4203552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4204552f7358SJed Brown } 4205552f7358SJed Brown } 4206552f7358SJed Brown } 4207552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 4208552f7358SJed Brown } 4209552f7358SJed Brown 4210552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4211552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4212552f7358SJed Brown PetscFunctionReturn(0); 4213552f7358SJed Brown } 4214552f7358SJed Brown 4215552f7358SJed Brown #undef __FUNCT__ 4216552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 4217552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 4218552f7358SJed Brown { 421982f516ccSBarry Smith MPI_Comm comm; 4220552f7358SJed Brown const PetscInt dim = 3; 4221552f7358SJed Brown PLC *in, *out; 4222552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 4223552f7358SJed Brown PetscMPIInt rank; 4224552f7358SJed Brown PetscErrorCode ierr; 4225552f7358SJed Brown 4226552f7358SJed Brown PetscFunctionBegin; 422782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 42280298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4229552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4230552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4231552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 4232552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 4233552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4234552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 42350d644c17SKarl Rupp 4236552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4237552f7358SJed Brown if (in->numberofpoints > 0) { 4238552f7358SJed Brown PetscSection coordSection; 4239552f7358SJed Brown Vec coordinates; 4240552f7358SJed Brown PetscScalar *array; 4241552f7358SJed Brown 4242785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4243785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4244552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 424569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 4246552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4247552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4248552f7358SJed Brown const PetscInt idx = v - vStart; 4249552f7358SJed Brown PetscInt off, d, m; 4250552f7358SJed Brown 4251552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4252552f7358SJed Brown for (d = 0; d < dim; ++d) { 4253552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4254552f7358SJed Brown } 4255552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 42560d644c17SKarl Rupp 4257552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4258552f7358SJed Brown } 4259552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4260552f7358SJed Brown } 4261552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 42620d644c17SKarl Rupp 4263552f7358SJed Brown in->numberofcorners = 4; 4264552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 4265552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 4266552f7358SJed Brown if (in->numberoftetrahedra > 0) { 4267785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 4268552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4269552f7358SJed Brown const PetscInt idx = c - cStart; 42700298fd71SBarry Smith PetscInt *closure = NULL; 4271552f7358SJed Brown PetscInt closureSize; 4272552f7358SJed Brown 4273552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4274552f7358SJed 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); 4275552f7358SJed Brown for (v = 0; v < 4; ++v) { 4276552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4277552f7358SJed Brown } 4278552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4279552f7358SJed Brown } 4280552f7358SJed Brown } 4281552f7358SJed Brown if (!rank) { 4282552f7358SJed Brown TetGenOpts t; 4283552f7358SJed Brown 4284552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 42850d644c17SKarl Rupp 4286552f7358SJed Brown t.in = dm; /* Should go away */ 4287552f7358SJed Brown t.refine = 1; 4288552f7358SJed Brown t.varvolume = 1; 4289552f7358SJed Brown t.quality = 1; 4290552f7358SJed Brown t.edgesout = 1; 4291552f7358SJed Brown t.zeroindex = 1; 4292552f7358SJed Brown t.quiet = 1; 4293552f7358SJed Brown t.verbose = verbose; /* Change this */ 42940d644c17SKarl Rupp 4295552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4296552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4297552f7358SJed Brown } 4298552f7358SJed Brown { 4299552f7358SJed Brown const PetscInt numCorners = 4; 4300552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4301552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4302552f7358SJed Brown const double *meshCoords = out->pointlist; 43031d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4304552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4305552f7358SJed Brown 43069db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 43070fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4308552f7358SJed Brown /* Set labels */ 4309552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4310552f7358SJed Brown if (out->pointmarkerlist[v]) { 4311552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4312552f7358SJed Brown } 4313552f7358SJed Brown } 4314552f7358SJed Brown if (interpolate) { 4315552f7358SJed Brown PetscInt e, f; 4316552f7358SJed Brown 4317552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4318552f7358SJed Brown if (out->edgemarkerlist[e]) { 4319552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4320552f7358SJed Brown const PetscInt *edges; 4321552f7358SJed Brown PetscInt numEdges; 4322552f7358SJed Brown 4323552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4324552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4325552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4326552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4327552f7358SJed Brown } 4328552f7358SJed Brown } 4329552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4330552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4331552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4332552f7358SJed Brown const PetscInt *faces; 4333552f7358SJed Brown PetscInt numFaces; 4334552f7358SJed Brown 4335552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4336552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4337552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4338552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4339552f7358SJed Brown } 4340552f7358SJed Brown } 4341552f7358SJed Brown } 4342552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4343552f7358SJed Brown } 4344552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4345552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4346552f7358SJed Brown PetscFunctionReturn(0); 4347552f7358SJed Brown } 4348552f7358SJed Brown #endif 4349552f7358SJed Brown 4350552f7358SJed Brown #undef __FUNCT__ 4351552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 4352552f7358SJed Brown /*@C 4353552f7358SJed Brown DMPlexGenerate - Generates a mesh. 4354552f7358SJed Brown 4355552f7358SJed Brown Not Collective 4356552f7358SJed Brown 4357552f7358SJed Brown Input Parameters: 4358552f7358SJed Brown + boundary - The DMPlex boundary object 4359552f7358SJed Brown . name - The mesh generation package name 4360552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 4361552f7358SJed Brown 4362552f7358SJed Brown Output Parameter: 4363552f7358SJed Brown . mesh - The DMPlex object 4364552f7358SJed Brown 4365552f7358SJed Brown Level: intermediate 4366552f7358SJed Brown 4367552f7358SJed Brown .keywords: mesh, elements 4368552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 4369552f7358SJed Brown @*/ 4370552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 4371552f7358SJed Brown { 4372552f7358SJed Brown PetscInt dim; 4373552f7358SJed Brown char genname[1024]; 4374552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4375552f7358SJed Brown PetscErrorCode ierr; 4376552f7358SJed Brown 4377552f7358SJed Brown PetscFunctionBegin; 4378552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 4379552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 4380552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 4381552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 43820d644c17SKarl Rupp if (flg) name = genname; 4383552f7358SJed Brown if (name) { 4384552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4385552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4386552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4387552f7358SJed Brown } 4388552f7358SJed Brown switch (dim) { 4389552f7358SJed Brown case 1: 4390552f7358SJed Brown if (!name || isTriangle) { 4391519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4392552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 4393552f7358SJed Brown #else 439482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 4395552f7358SJed Brown #endif 439682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4397552f7358SJed Brown break; 4398552f7358SJed Brown case 2: 4399552f7358SJed Brown if (!name || isCTetgen) { 4400519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4401552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4402552f7358SJed Brown #else 440382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4404552f7358SJed Brown #endif 4405552f7358SJed Brown } else if (isTetgen) { 4406519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4407552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4408552f7358SJed Brown #else 440982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4410552f7358SJed Brown #endif 441182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4412552f7358SJed Brown break; 4413552f7358SJed Brown default: 441482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 4415552f7358SJed Brown } 4416552f7358SJed Brown PetscFunctionReturn(0); 4417552f7358SJed Brown } 4418552f7358SJed Brown 4419552f7358SJed Brown #undef __FUNCT__ 4420552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 4421552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 4422552f7358SJed Brown { 4423552f7358SJed Brown PetscReal refinementLimit; 4424552f7358SJed Brown PetscInt dim, cStart, cEnd; 44250298fd71SBarry Smith char genname[1024], *name = NULL; 4426552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4427552f7358SJed Brown PetscErrorCode ierr; 4428552f7358SJed Brown 4429552f7358SJed Brown PetscFunctionBegin; 4430552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 4431552f7358SJed Brown if (isUniform) { 4432552f7358SJed Brown CellRefiner cellRefiner; 4433552f7358SJed Brown 4434509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 4435509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 4436552f7358SJed Brown PetscFunctionReturn(0); 4437552f7358SJed Brown } 4438552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 4439552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 4440552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 4441552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 4442552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 44430d644c17SKarl Rupp if (flg) name = genname; 4444552f7358SJed Brown if (name) { 4445552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4446552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4447552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4448552f7358SJed Brown } 4449552f7358SJed Brown switch (dim) { 4450552f7358SJed Brown case 2: 4451552f7358SJed Brown if (!name || isTriangle) { 4452519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4453552f7358SJed Brown double *maxVolumes; 4454552f7358SJed Brown PetscInt c; 4455552f7358SJed Brown 4456785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44570d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4458552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 44596b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 4460552f7358SJed Brown #else 446182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 4462552f7358SJed Brown #endif 446382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4464552f7358SJed Brown break; 4465552f7358SJed Brown case 3: 4466552f7358SJed Brown if (!name || isCTetgen) { 4467519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4468552f7358SJed Brown PetscReal *maxVolumes; 4469552f7358SJed Brown PetscInt c; 4470552f7358SJed Brown 4471785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44720d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4473552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4474552f7358SJed Brown #else 447582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4476552f7358SJed Brown #endif 4477552f7358SJed Brown } else if (isTetgen) { 4478519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4479552f7358SJed Brown double *maxVolumes; 4480552f7358SJed Brown PetscInt c; 4481552f7358SJed Brown 4482785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44830d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4484552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4485552f7358SJed Brown #else 448682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4487552f7358SJed Brown #endif 448882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4489552f7358SJed Brown break; 4490552f7358SJed Brown default: 449182f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 4492552f7358SJed Brown } 4493552f7358SJed Brown PetscFunctionReturn(0); 4494552f7358SJed Brown } 4495552f7358SJed Brown 4496552f7358SJed Brown #undef __FUNCT__ 4497aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 4498552f7358SJed Brown /*@ 4499aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 4500552f7358SJed Brown 4501552f7358SJed Brown Not Collective 4502552f7358SJed Brown 4503aa50250dSMatthew G. Knepley Input Parameter: 4504552f7358SJed Brown . dm - The DMPlex object 4505552f7358SJed Brown 4506aa50250dSMatthew G. Knepley Output Parameter: 4507aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 4508552f7358SJed Brown 4509552f7358SJed Brown Level: developer 4510552f7358SJed Brown 4511aa50250dSMatthew G. Knepley .keywords: mesh, points 4512aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4513aa50250dSMatthew G. Knepley @*/ 4514aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 4515aa50250dSMatthew G. Knepley { 4516aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4517aa50250dSMatthew G. Knepley PetscErrorCode ierr; 4518aa50250dSMatthew G. Knepley 4519aa50250dSMatthew G. Knepley PetscFunctionBegin; 4520aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4521aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 452263d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 4523aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 4524aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 4525aa50250dSMatthew G. Knepley } 4526aa50250dSMatthew G. Knepley 4527aa50250dSMatthew G. Knepley #undef __FUNCT__ 4528aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 4529aa50250dSMatthew G. Knepley /*@ 4530aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 4531aa50250dSMatthew G. Knepley 4532aa50250dSMatthew G. Knepley Not Collective 4533aa50250dSMatthew G. Knepley 4534aa50250dSMatthew G. Knepley Input Parameter: 4535aa50250dSMatthew G. Knepley . dm - The DMPlex object 4536aa50250dSMatthew G. Knepley 4537aa50250dSMatthew G. Knepley Output Parameter: 4538aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 4539aa50250dSMatthew G. Knepley 4540aa50250dSMatthew G. Knepley Level: developer 4541552f7358SJed Brown 4542552f7358SJed Brown .keywords: mesh, points 4543aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4544552f7358SJed Brown @*/ 4545552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 4546552f7358SJed Brown { 4547aa50250dSMatthew G. Knepley DMLabel label; 4548aa50250dSMatthew G. Knepley PetscInt d = 0; 4549552f7358SJed Brown PetscErrorCode ierr; 4550552f7358SJed Brown 4551552f7358SJed Brown PetscFunctionBegin; 4552552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4553552f7358SJed Brown PetscValidPointer(depth, 2); 4554aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4555aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 4556552f7358SJed Brown *depth = d-1; 4557552f7358SJed Brown PetscFunctionReturn(0); 4558552f7358SJed Brown } 4559552f7358SJed Brown 4560552f7358SJed Brown #undef __FUNCT__ 4561552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 4562552f7358SJed Brown /*@ 4563552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 4564552f7358SJed Brown 4565552f7358SJed Brown Not Collective 4566552f7358SJed Brown 4567552f7358SJed Brown Input Parameters: 4568552f7358SJed Brown + dm - The DMPlex object 4569552f7358SJed Brown - stratumValue - The requested depth 4570552f7358SJed Brown 4571552f7358SJed Brown Output Parameters: 4572552f7358SJed Brown + start - The first point at this depth 4573552f7358SJed Brown - end - One beyond the last point at this depth 4574552f7358SJed Brown 4575552f7358SJed Brown Level: developer 4576552f7358SJed Brown 4577552f7358SJed Brown .keywords: mesh, points 4578552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 4579552f7358SJed Brown @*/ 45800adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 45810adebc6cSBarry Smith { 4582aa50250dSMatthew G. Knepley DMLabel label; 458363d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 4584552f7358SJed Brown PetscErrorCode ierr; 4585552f7358SJed Brown 4586552f7358SJed Brown PetscFunctionBegin; 4587552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 458863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 458963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4590552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 45910d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 459263d1a920SMatthew G. Knepley if (stratumValue < 0) { 459363d1a920SMatthew G. Knepley if (start) *start = pStart; 459463d1a920SMatthew G. Knepley if (end) *end = pEnd; 459563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4596552f7358SJed Brown } 4597aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 459863d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 459963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 4600552f7358SJed Brown PetscFunctionReturn(0); 4601552f7358SJed Brown } 4602552f7358SJed Brown 4603552f7358SJed Brown #undef __FUNCT__ 4604552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4605552f7358SJed Brown /*@ 4606552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4607552f7358SJed Brown 4608552f7358SJed Brown Not Collective 4609552f7358SJed Brown 4610552f7358SJed Brown Input Parameters: 4611552f7358SJed Brown + dm - The DMPlex object 4612552f7358SJed Brown - stratumValue - The requested height 4613552f7358SJed Brown 4614552f7358SJed Brown Output Parameters: 4615552f7358SJed Brown + start - The first point at this height 4616552f7358SJed Brown - end - One beyond the last point at this height 4617552f7358SJed Brown 4618552f7358SJed Brown Level: developer 4619552f7358SJed Brown 4620552f7358SJed Brown .keywords: mesh, points 4621552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4622552f7358SJed Brown @*/ 46230adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 46240adebc6cSBarry Smith { 4625aa50250dSMatthew G. Knepley DMLabel label; 462663d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4627552f7358SJed Brown PetscErrorCode ierr; 4628552f7358SJed Brown 4629552f7358SJed Brown PetscFunctionBegin; 4630552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 463163d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 463263d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4633552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 46340d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 463563d1a920SMatthew G. Knepley if (stratumValue < 0) { 463663d1a920SMatthew G. Knepley if (start) *start = pStart; 463763d1a920SMatthew G. Knepley if (end) *end = pEnd; 463863d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4639552f7358SJed Brown } 4640aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4641aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 464263d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 464363d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4644552f7358SJed Brown PetscFunctionReturn(0); 4645552f7358SJed Brown } 4646552f7358SJed Brown 4647552f7358SJed Brown #undef __FUNCT__ 4648552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4649552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4650a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4651a6dfd86eSKarl Rupp { 4652552f7358SJed Brown PetscInt *numDofTot; 4653916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4654916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4655552f7358SJed Brown PetscErrorCode ierr; 4656552f7358SJed Brown 4657552f7358SJed Brown PetscFunctionBegin; 4658785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4659552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4660552f7358SJed Brown numDofTot[d] = 0; 46610d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4662552f7358SJed Brown } 466382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4664552f7358SJed Brown if (numFields > 0) { 4665552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4666552f7358SJed Brown if (numComp) { 4667552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4668552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4669552f7358SJed Brown } 4670552f7358SJed Brown } 4671552f7358SJed Brown } 4672552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4673552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4674916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4675916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4676916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4677916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4678552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4679552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4680552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4681552f7358SJed Brown } 4682552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4683552f7358SJed Brown } 4684552f7358SJed Brown } 4685552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4686552f7358SJed Brown PetscFunctionReturn(0); 4687552f7358SJed Brown } 4688552f7358SJed Brown 4689552f7358SJed Brown #undef __FUNCT__ 4690552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4691552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4692552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4693552f7358SJed Brown */ 4694a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4695a6dfd86eSKarl Rupp { 4696552f7358SJed Brown PetscInt numFields; 4697552f7358SJed Brown PetscInt bc; 4698552f7358SJed Brown PetscErrorCode ierr; 4699552f7358SJed Brown 4700552f7358SJed Brown PetscFunctionBegin; 4701552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4702552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4703552f7358SJed Brown PetscInt field = 0; 4704552f7358SJed Brown const PetscInt *idx; 4705552f7358SJed Brown PetscInt n, i; 4706552f7358SJed Brown 47070d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4708552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4709552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4710552f7358SJed Brown for (i = 0; i < n; ++i) { 4711552f7358SJed Brown const PetscInt p = idx[i]; 4712552f7358SJed Brown PetscInt numConst = constDof; 4713552f7358SJed Brown 4714552f7358SJed Brown /* Constrain every dof on the point */ 4715552f7358SJed Brown if (numConst < 0) { 4716552f7358SJed Brown if (numFields) { 4717552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4718552f7358SJed Brown } else { 4719552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4720552f7358SJed Brown } 4721552f7358SJed Brown } 4722552f7358SJed Brown if (numFields) { 4723552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4724552f7358SJed Brown } 4725552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4726552f7358SJed Brown } 4727552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4728552f7358SJed Brown } 4729552f7358SJed Brown PetscFunctionReturn(0); 4730552f7358SJed Brown } 4731552f7358SJed Brown 4732552f7358SJed Brown #undef __FUNCT__ 4733552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4734552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 47350adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 47360adebc6cSBarry Smith { 4737552f7358SJed Brown PetscInt *maxConstraints; 4738552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4739552f7358SJed Brown PetscErrorCode ierr; 4740552f7358SJed Brown 4741552f7358SJed Brown PetscFunctionBegin; 4742552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4743552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4744785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 47450d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4746552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4747552f7358SJed Brown PetscInt cdof; 4748552f7358SJed Brown 4749552f7358SJed Brown if (numFields) { 4750552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4751552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4752552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4753552f7358SJed Brown } 4754552f7358SJed Brown } else { 4755552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4756552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4757552f7358SJed Brown } 4758552f7358SJed Brown } 4759552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4760552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4761552f7358SJed Brown } 4762552f7358SJed Brown if (maxConstraints[numFields]) { 4763552f7358SJed Brown PetscInt *indices; 4764552f7358SJed Brown 4765785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4766552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4767552f7358SJed Brown PetscInt cdof, d; 4768552f7358SJed Brown 4769552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4770552f7358SJed Brown if (cdof) { 4771552f7358SJed 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]); 4772552f7358SJed Brown if (numFields) { 4773552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4774552f7358SJed Brown 4775552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4776552f7358SJed Brown PetscInt cfdof, fdof; 4777552f7358SJed Brown 4778552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4779552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4780552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 47810d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4782552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 47830d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4784552f7358SJed Brown numConst += cfdof; 4785552f7358SJed Brown foff += fdof; 4786552f7358SJed Brown } 4787552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4788552f7358SJed Brown } else { 47890d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4790552f7358SJed Brown } 4791552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4792552f7358SJed Brown } 4793552f7358SJed Brown } 4794552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4795552f7358SJed Brown } 4796552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4797552f7358SJed Brown PetscFunctionReturn(0); 4798552f7358SJed Brown } 4799552f7358SJed Brown 4800552f7358SJed Brown #undef __FUNCT__ 4801552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4802552f7358SJed Brown /* Set the constrained field indices on each point */ 48030adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 48040adebc6cSBarry Smith { 4805552f7358SJed Brown const PetscInt *points, *indices; 4806552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4807552f7358SJed Brown PetscErrorCode ierr; 4808552f7358SJed Brown 4809552f7358SJed Brown PetscFunctionBegin; 4810552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4811552f7358SJed 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); 4812552f7358SJed Brown 4813552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4814552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4815552f7358SJed Brown if (!constraintIndices) { 4816552f7358SJed Brown PetscInt *idx, i; 4817552f7358SJed Brown 4818552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4819785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 48200d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4821552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4822552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4823552f7358SJed Brown } 4824552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4825552f7358SJed Brown } else { 4826552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4827552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4828552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4829552f7358SJed Brown PetscInt fcdof; 4830552f7358SJed Brown 4831552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 483282f516ccSBarry 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); 4833552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4834552f7358SJed Brown } 4835552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4836552f7358SJed Brown } 4837552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4838552f7358SJed Brown PetscFunctionReturn(0); 4839552f7358SJed Brown } 4840552f7358SJed Brown 4841552f7358SJed Brown #undef __FUNCT__ 4842552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4843552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 48440adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 48450adebc6cSBarry Smith { 4846552f7358SJed Brown PetscInt *indices; 4847552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4848552f7358SJed Brown PetscErrorCode ierr; 4849552f7358SJed Brown 4850552f7358SJed Brown PetscFunctionBegin; 4851552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4852785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4853552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 485482f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4855552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4856552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4857552f7358SJed Brown PetscInt cdof, d; 4858552f7358SJed Brown 4859552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4860552f7358SJed Brown if (cdof) { 4861552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4862552f7358SJed Brown 4863552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4864552f7358SJed Brown const PetscInt *fcind; 4865552f7358SJed Brown PetscInt fdof, fcdof; 4866552f7358SJed Brown 4867552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4868552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4869552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4870552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 48710d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4872552f7358SJed Brown foff += fdof; 4873552f7358SJed Brown numConst += fcdof; 4874552f7358SJed Brown } 487582f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4876552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4877552f7358SJed Brown } 4878552f7358SJed Brown } 4879552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4880552f7358SJed Brown PetscFunctionReturn(0); 4881552f7358SJed Brown } 4882552f7358SJed Brown 4883552f7358SJed Brown #undef __FUNCT__ 4884552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4885552f7358SJed Brown /*@C 4886552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4887552f7358SJed Brown 4888552f7358SJed Brown Not Collective 4889552f7358SJed Brown 4890552f7358SJed Brown Input Parameters: 4891552f7358SJed Brown + dm - The DMPlex object 4892552f7358SJed Brown . dim - The spatial dimension of the problem 4893552f7358SJed Brown . numFields - The number of fields in the problem 4894552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4895552f7358SJed 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 4896552f7358SJed Brown . numBC - The number of boundary conditions 4897552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4898552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4899552f7358SJed Brown 4900552f7358SJed Brown Output Parameter: 4901552f7358SJed Brown . section - The PetscSection object 4902552f7358SJed Brown 4903552f7358SJed 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 4904552f7358SJed Brown nubmer of dof for field 0 on each edge. 4905552f7358SJed Brown 4906552f7358SJed Brown Level: developer 4907552f7358SJed Brown 49083813dfbdSMatthew G Knepley Fortran Notes: 49093813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 49103813dfbdSMatthew G Knepley 4911552f7358SJed Brown .keywords: mesh, elements 4912552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4913552f7358SJed Brown @*/ 4914a6dfd86eSKarl 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) 4915a6dfd86eSKarl Rupp { 4916552f7358SJed Brown PetscErrorCode ierr; 4917552f7358SJed Brown 4918552f7358SJed Brown PetscFunctionBegin; 4919552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4920552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4921552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4922552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4923ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4924552f7358SJed Brown PetscFunctionReturn(0); 4925552f7358SJed Brown } 4926552f7358SJed Brown 4927552f7358SJed Brown #undef __FUNCT__ 4928552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 49290adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 49300adebc6cSBarry Smith { 4931552f7358SJed Brown PetscSection section; 4932552f7358SJed Brown PetscErrorCode ierr; 4933552f7358SJed Brown 4934552f7358SJed Brown PetscFunctionBegin; 493538221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 493682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4937552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 49381d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4939552f7358SJed Brown PetscFunctionReturn(0); 4940552f7358SJed Brown } 4941552f7358SJed Brown 4942552f7358SJed Brown #undef __FUNCT__ 4943552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 49440adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 49450adebc6cSBarry Smith { 4946552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4947552f7358SJed Brown 4948552f7358SJed Brown PetscFunctionBegin; 4949552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4950552f7358SJed Brown if (section) *section = mesh->coneSection; 4951552f7358SJed Brown PetscFunctionReturn(0); 4952552f7358SJed Brown } 4953552f7358SJed Brown 4954552f7358SJed Brown #undef __FUNCT__ 49558cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 49568cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 49578cb4d582SMatthew G. Knepley { 49588cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 49598cb4d582SMatthew G. Knepley 49608cb4d582SMatthew G. Knepley PetscFunctionBegin; 49618cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49628cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 49638cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 49648cb4d582SMatthew G. Knepley } 49658cb4d582SMatthew G. Knepley 49668cb4d582SMatthew G. Knepley #undef __FUNCT__ 4967552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4968a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4969a6dfd86eSKarl Rupp { 4970552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4971552f7358SJed Brown 4972552f7358SJed Brown PetscFunctionBegin; 4973552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4974552f7358SJed Brown if (cones) *cones = mesh->cones; 4975552f7358SJed Brown PetscFunctionReturn(0); 4976552f7358SJed Brown } 4977552f7358SJed Brown 4978552f7358SJed Brown #undef __FUNCT__ 4979552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4980a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4981a6dfd86eSKarl Rupp { 4982552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4983552f7358SJed Brown 4984552f7358SJed Brown PetscFunctionBegin; 4985552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4986552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4987552f7358SJed Brown PetscFunctionReturn(0); 4988552f7358SJed Brown } 4989552f7358SJed Brown 4990552f7358SJed Brown /******************************** FEM Support **********************************/ 4991552f7358SJed Brown 4992552f7358SJed Brown #undef __FUNCT__ 49931a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 49941a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4995a6dfd86eSKarl Rupp { 4996552f7358SJed Brown PetscScalar *array, *vArray; 4997d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 49981a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4999552f7358SJed Brown PetscErrorCode ierr; 5000552f7358SJed Brown 50011b406b76SMatthew G. Knepley PetscFunctionBeginHot; 50022a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 50035a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 50045a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 50055a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 50063f7cbbe7SMatthew G. Knepley if (!values || !*values) { 50079df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50089df71ca4SMatthew G. Knepley PetscInt dof; 5009d9917b9dSMatthew G. Knepley 50109df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50119df71ca4SMatthew G. Knepley size += dof; 50129df71ca4SMatthew G. Knepley } 50139df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50149df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50152a3aaacfSMatthew G. Knepley PetscInt dof; 50165a1bb5cfSMatthew G. Knepley 50175a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50182a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50195a1bb5cfSMatthew G. Knepley size += dof; 50205a1bb5cfSMatthew G. Knepley } 50213f7cbbe7SMatthew G. Knepley if (!values) { 50223f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 50233f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 50243f7cbbe7SMatthew G. Knepley } 50255a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 5026982e9ed1SMatthew G. Knepley } else { 5027982e9ed1SMatthew G. Knepley array = *values; 5028982e9ed1SMatthew G. Knepley } 50299df71ca4SMatthew G. Knepley size = 0; 50305a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 50319df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50329df71ca4SMatthew G. Knepley PetscInt dof, off, d; 50339df71ca4SMatthew G. Knepley PetscScalar *varr; 5034d9917b9dSMatthew G. Knepley 50359df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50369df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50379df71ca4SMatthew G. Knepley varr = &vArray[off]; 50381a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 50391a271a75SMatthew G. Knepley array[offset] = varr[d]; 50409df71ca4SMatthew G. Knepley } 50419df71ca4SMatthew G. Knepley size += dof; 50429df71ca4SMatthew G. Knepley } 50439df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50449df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50459df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 50465a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 50475a1bb5cfSMatthew G. Knepley PetscScalar *varr; 50485a1bb5cfSMatthew G. Knepley 504952ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50505a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50515a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 50525a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 50535a1bb5cfSMatthew G. Knepley if (o >= 0) { 50541a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 50551a271a75SMatthew G. Knepley array[offset] = varr[d]; 50565a1bb5cfSMatthew G. Knepley } 50575a1bb5cfSMatthew G. Knepley } else { 50581a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 50591a271a75SMatthew G. Knepley array[offset] = varr[d]; 50605a1bb5cfSMatthew G. Knepley } 50615a1bb5cfSMatthew G. Knepley } 50629df71ca4SMatthew G. Knepley size += dof; 50635a1bb5cfSMatthew G. Knepley } 50645a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 50659df71ca4SMatthew G. Knepley if (!*values) { 50665a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 50675a1bb5cfSMatthew G. Knepley *values = array; 50689df71ca4SMatthew G. Knepley } else { 50699df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 50708c312ff3SMatthew G. Knepley *csize = size; 50719df71ca4SMatthew G. Knepley } 50725a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 50735a1bb5cfSMatthew G. Knepley } 5074d9917b9dSMatthew G. Knepley 5075d9917b9dSMatthew G. Knepley #undef __FUNCT__ 50761a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 50771a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 50781a271a75SMatthew G. Knepley { 50791a271a75SMatthew G. Knepley PetscInt offset = 0, p; 50801a271a75SMatthew G. Knepley PetscErrorCode ierr; 50811a271a75SMatthew G. Knepley 50821a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5083fe02ba77SJed Brown *size = 0; 50841a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50851a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50861a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50871a271a75SMatthew G. Knepley PetscInt dof, off, d; 50881a271a75SMatthew G. Knepley const PetscScalar *varr; 50891a271a75SMatthew G. Knepley 50901a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50911a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50921a271a75SMatthew G. Knepley varr = &vArray[off]; 50931a271a75SMatthew G. Knepley if (o >= 0) { 50941a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 50951a271a75SMatthew G. Knepley } else { 50961a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 50971a271a75SMatthew G. Knepley } 50981a271a75SMatthew G. Knepley } 50991a271a75SMatthew G. Knepley *size = offset; 51001a271a75SMatthew G. Knepley PetscFunctionReturn(0); 51011a271a75SMatthew G. Knepley } 51021a271a75SMatthew G. Knepley 51031a271a75SMatthew G. Knepley #undef __FUNCT__ 51041a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 51051a271a75SMatthew 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[]) 51061a271a75SMatthew G. Knepley { 51071a271a75SMatthew G. Knepley PetscInt offset = 0, f; 51081a271a75SMatthew G. Knepley PetscErrorCode ierr; 51091a271a75SMatthew G. Knepley 51101a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5111fe02ba77SJed Brown *size = 0; 51121a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 51131a271a75SMatthew G. Knepley PetscInt fcomp, p; 51141a271a75SMatthew G. Knepley 51151a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 51161a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 51171a271a75SMatthew G. Knepley const PetscInt point = points[p]; 51181a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 51191a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 51201a271a75SMatthew G. Knepley const PetscScalar *varr; 51211a271a75SMatthew G. Knepley 51221a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 51231a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 51241a271a75SMatthew G. Knepley varr = &vArray[foff]; 51251a271a75SMatthew G. Knepley if (o >= 0) { 51261a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 51271a271a75SMatthew G. Knepley } else { 51281a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 51291a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 51301a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 51311a271a75SMatthew G. Knepley } 51321a271a75SMatthew G. Knepley } 51331a271a75SMatthew G. Knepley } 51341a271a75SMatthew G. Knepley } 51351a271a75SMatthew G. Knepley } 51361a271a75SMatthew G. Knepley *size = offset; 51371a271a75SMatthew G. Knepley PetscFunctionReturn(0); 51381a271a75SMatthew G. Knepley } 51391a271a75SMatthew G. Knepley 51401a271a75SMatthew G. Knepley #undef __FUNCT__ 5141552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 5142552f7358SJed Brown /*@C 5143552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 5144552f7358SJed Brown 5145552f7358SJed Brown Not collective 5146552f7358SJed Brown 5147552f7358SJed Brown Input Parameters: 5148552f7358SJed Brown + dm - The DM 5149552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5150552f7358SJed Brown . v - The local vector 5151552f7358SJed Brown - point - The sieve point in the DM 5152552f7358SJed Brown 5153552f7358SJed Brown Output Parameters: 5154552f7358SJed Brown + csize - The number of values in the closure, or NULL 5155552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5156552f7358SJed Brown 5157552f7358SJed Brown Fortran Notes: 5158552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 5159552f7358SJed Brown include petsc.h90 in your code. 5160552f7358SJed Brown 5161552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 5162552f7358SJed Brown 5163552f7358SJed Brown Level: intermediate 5164552f7358SJed Brown 5165552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5166552f7358SJed Brown @*/ 5167552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5168552f7358SJed Brown { 5169552f7358SJed Brown PetscSection clSection; 5170d9917b9dSMatthew G. Knepley IS clPoints; 5171552f7358SJed Brown PetscScalar *array, *vArray; 5172552f7358SJed Brown PetscInt *points = NULL; 5173d9917b9dSMatthew G. Knepley const PetscInt *clp; 51741a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 5175552f7358SJed Brown PetscErrorCode ierr; 5176552f7358SJed Brown 5177d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 5178552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5179552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 51801a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 51811a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5182552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5183552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5184552f7358SJed Brown if (depth == 1 && numFields < 2) { 51851a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 5186552f7358SJed Brown PetscFunctionReturn(0); 5187552f7358SJed Brown } 51881a271a75SMatthew G. Knepley /* Get points */ 5189d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5190d9917b9dSMatthew G. Knepley if (!clPoints) { 51911a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 5192552f7358SJed Brown 51931a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5194552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5195552f7358SJed Brown /* Compress out points not in the section */ 5196552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5197552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5198552f7358SJed Brown points[q*2] = points[p]; 5199552f7358SJed Brown points[q*2+1] = points[p+1]; 5200552f7358SJed Brown ++q; 5201552f7358SJed Brown } 5202552f7358SJed Brown } 5203552f7358SJed Brown numPoints = q; 5204d9917b9dSMatthew G. Knepley } else { 5205d9917b9dSMatthew G. Knepley PetscInt dof, off; 5206552f7358SJed Brown 5207d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5208d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5209d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 52101a271a75SMatthew G. Knepley numPoints = dof/2; 5211d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5212552f7358SJed Brown } 52131a271a75SMatthew G. Knepley /* Get array */ 5214552f7358SJed Brown if (!values || !*values) { 52151a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 5216552f7358SJed Brown 52171a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5218552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 52191a271a75SMatthew G. Knepley asize += dof; 5220552f7358SJed Brown } 5221bd6c0d32SMatthew G. Knepley if (!values) { 5222d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 52231a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 52241a271a75SMatthew G. Knepley if (csize) *csize = asize; 5225bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 5226bd6c0d32SMatthew G. Knepley } 52271a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 5228d0f6b257SMatthew G. Knepley } else { 5229d0f6b257SMatthew G. Knepley array = *values; 5230d0f6b257SMatthew G. Knepley } 5231552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 52321a271a75SMatthew G. Knepley /* Get values */ 52331a271a75SMatthew G. Knepley if (numFields > 1) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 52341a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 52351a271a75SMatthew G. Knepley /* Cleanup points */ 52361a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 52371a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 52381a271a75SMatthew G. Knepley /* Cleanup array */ 5239552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 5240d0f6b257SMatthew G. Knepley if (!*values) { 5241552f7358SJed Brown if (csize) *csize = size; 5242552f7358SJed Brown *values = array; 5243d0f6b257SMatthew G. Knepley } else { 5244d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 5245d0f6b257SMatthew G. Knepley *csize = size; 5246d0f6b257SMatthew G. Knepley } 5247552f7358SJed Brown PetscFunctionReturn(0); 5248552f7358SJed Brown } 5249552f7358SJed Brown 5250552f7358SJed Brown #undef __FUNCT__ 5251552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 5252552f7358SJed Brown /*@C 5253552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 5254552f7358SJed Brown 5255552f7358SJed Brown Not collective 5256552f7358SJed Brown 5257552f7358SJed Brown Input Parameters: 5258552f7358SJed Brown + dm - The DM 52590298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 5260552f7358SJed Brown . v - The local vector 5261552f7358SJed Brown . point - The sieve point in the DM 52620298fd71SBarry Smith . csize - The number of values in the closure, or NULL 5263552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5264552f7358SJed Brown 52653813dfbdSMatthew G Knepley Fortran Notes: 52663813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 52673813dfbdSMatthew G Knepley include petsc.h90 in your code. 52683813dfbdSMatthew G Knepley 52693813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 52703813dfbdSMatthew G Knepley 5271552f7358SJed Brown Level: intermediate 5272552f7358SJed Brown 5273552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5274552f7358SJed Brown @*/ 52757c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5276a6dfd86eSKarl Rupp { 5277552f7358SJed Brown PetscInt size = 0; 5278552f7358SJed Brown PetscErrorCode ierr; 5279552f7358SJed Brown 5280552f7358SJed Brown PetscFunctionBegin; 5281552f7358SJed Brown /* Should work without recalculating size */ 5282552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 5283552f7358SJed Brown PetscFunctionReturn(0); 5284552f7358SJed Brown } 5285552f7358SJed Brown 5286552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 5287552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 5288552f7358SJed Brown 5289552f7358SJed Brown #undef __FUNCT__ 5290552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 52911a271a75SMatthew 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[]) 5292552f7358SJed Brown { 5293552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5294552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5295552f7358SJed Brown PetscScalar *a; 5296552f7358SJed Brown PetscInt off, cind = 0, k; 5297552f7358SJed Brown PetscErrorCode ierr; 5298552f7358SJed Brown 5299552f7358SJed Brown PetscFunctionBegin; 5300552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5301552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5302552f7358SJed Brown a = &array[off]; 5303552f7358SJed Brown if (!cdof || setBC) { 5304552f7358SJed Brown if (orientation >= 0) { 5305552f7358SJed Brown for (k = 0; k < dof; ++k) { 5306552f7358SJed Brown fuse(&a[k], values[k]); 5307552f7358SJed Brown } 5308552f7358SJed Brown } else { 5309552f7358SJed Brown for (k = 0; k < dof; ++k) { 5310552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5311552f7358SJed Brown } 5312552f7358SJed Brown } 5313552f7358SJed Brown } else { 5314552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5315552f7358SJed Brown if (orientation >= 0) { 5316552f7358SJed Brown for (k = 0; k < dof; ++k) { 5317552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5318552f7358SJed Brown fuse(&a[k], values[k]); 5319552f7358SJed Brown } 5320552f7358SJed Brown } else { 5321552f7358SJed Brown for (k = 0; k < dof; ++k) { 5322552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5323552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5324552f7358SJed Brown } 5325552f7358SJed Brown } 5326552f7358SJed Brown } 5327552f7358SJed Brown PetscFunctionReturn(0); 5328552f7358SJed Brown } 5329552f7358SJed Brown 5330552f7358SJed Brown #undef __FUNCT__ 5331a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 53321a271a75SMatthew 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[]) 5333a5e93ea8SMatthew G. Knepley { 5334a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 5335a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5336a5e93ea8SMatthew G. Knepley PetscScalar *a; 5337a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 5338a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5339a5e93ea8SMatthew G. Knepley 5340a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5341a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5342a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5343a5e93ea8SMatthew G. Knepley a = &array[off]; 5344a5e93ea8SMatthew G. Knepley if (cdof) { 5345a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5346a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 5347a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5348a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5349a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 5350a5e93ea8SMatthew G. Knepley ++cind; 5351a5e93ea8SMatthew G. Knepley } 5352a5e93ea8SMatthew G. Knepley } 5353a5e93ea8SMatthew G. Knepley } else { 5354a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5355a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5356a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 5357a5e93ea8SMatthew G. Knepley ++cind; 5358a5e93ea8SMatthew G. Knepley } 5359a5e93ea8SMatthew G. Knepley } 5360a5e93ea8SMatthew G. Knepley } 5361a5e93ea8SMatthew G. Knepley } 5362a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5363a5e93ea8SMatthew G. Knepley } 5364a5e93ea8SMatthew G. Knepley 5365a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 5366552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 53671a271a75SMatthew 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[]) 5368a6dfd86eSKarl Rupp { 5369552f7358SJed Brown PetscScalar *a; 53701a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 53711a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 53721a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5373552f7358SJed Brown PetscErrorCode ierr; 5374552f7358SJed Brown 5375552f7358SJed Brown PetscFunctionBegin; 5376552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5377552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 53781a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 53791a271a75SMatthew G. Knepley a = &array[foff]; 5380552f7358SJed Brown if (!fcdof || setBC) { 53811a271a75SMatthew G. Knepley if (o >= 0) { 53821a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 5383552f7358SJed Brown } else { 5384552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5385552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 53861a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5387552f7358SJed Brown } 5388552f7358SJed Brown } 5389552f7358SJed Brown } 5390552f7358SJed Brown } else { 5391552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 53921a271a75SMatthew G. Knepley if (o >= 0) { 5393552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5394552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 53951a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5396552f7358SJed Brown } 5397552f7358SJed Brown } else { 5398552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5399552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5400552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 54011a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5402552f7358SJed Brown } 5403552f7358SJed Brown } 5404552f7358SJed Brown } 5405552f7358SJed Brown } 54061a271a75SMatthew G. Knepley *offset += fdof; 5407552f7358SJed Brown PetscFunctionReturn(0); 5408552f7358SJed Brown } 5409552f7358SJed Brown 5410552f7358SJed Brown #undef __FUNCT__ 5411a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 54121a271a75SMatthew 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[]) 5413a5e93ea8SMatthew G. Knepley { 5414a5e93ea8SMatthew G. Knepley PetscScalar *a; 54151a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 54161a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 54171a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5418a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5419a5e93ea8SMatthew G. Knepley 5420a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5421a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5422a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 54231a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 54241a271a75SMatthew G. Knepley a = &array[foff]; 5425a5e93ea8SMatthew G. Knepley if (fcdof) { 5426a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 54271a271a75SMatthew G. Knepley if (o >= 0) { 5428a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 5429a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 54301a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5431a5e93ea8SMatthew G. Knepley ++cind; 5432a5e93ea8SMatthew G. Knepley } 5433a5e93ea8SMatthew G. Knepley } 5434a5e93ea8SMatthew G. Knepley } else { 5435a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 5436a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 5437a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 54381a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5439a5e93ea8SMatthew G. Knepley ++cind; 5440a5e93ea8SMatthew G. Knepley } 5441a5e93ea8SMatthew G. Knepley } 5442a5e93ea8SMatthew G. Knepley } 5443a5e93ea8SMatthew G. Knepley } 5444a5e93ea8SMatthew G. Knepley } 54451a271a75SMatthew G. Knepley *offset += fdof; 5446a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5447a5e93ea8SMatthew G. Knepley } 5448a5e93ea8SMatthew G. Knepley 5449a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 54501b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 54511a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 5452a6dfd86eSKarl Rupp { 5453552f7358SJed Brown PetscScalar *array; 54541b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 54551b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 5456552f7358SJed Brown PetscErrorCode ierr; 5457552f7358SJed Brown 54581b406b76SMatthew G. Knepley PetscFunctionBeginHot; 5459b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5460b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 5461b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 5462b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 5463b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5464b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 5465b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 5466b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 5467b6ebb6e6SMatthew G. Knepley 5468b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 5469b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 5470b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 5471b6ebb6e6SMatthew G. Knepley { 5472b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5473b6ebb6e6SMatthew G. Knepley PetscScalar *a; 5474b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 5475b6ebb6e6SMatthew G. Knepley 5476b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 5477b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 5478b6ebb6e6SMatthew G. Knepley a = &array[coff]; 5479b6ebb6e6SMatthew G. Knepley if (!cdof) { 5480b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5481b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5482b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5483b6ebb6e6SMatthew G. Knepley } 5484b6ebb6e6SMatthew G. Knepley } else { 5485b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5486b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5487b6ebb6e6SMatthew G. Knepley } 5488b6ebb6e6SMatthew G. Knepley } 5489b6ebb6e6SMatthew G. Knepley } else { 5490b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 5491b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5492b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5493b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5494b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5495b6ebb6e6SMatthew G. Knepley } 5496b6ebb6e6SMatthew G. Knepley } else { 5497b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5498b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5499b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5500b6ebb6e6SMatthew G. Knepley } 5501b6ebb6e6SMatthew G. Knepley } 5502b6ebb6e6SMatthew G. Knepley } 5503b6ebb6e6SMatthew G. Knepley } 5504b6ebb6e6SMatthew G. Knepley } 5505b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5506b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 5507b6ebb6e6SMatthew G. Knepley } 55081b406b76SMatthew G. Knepley 55091b406b76SMatthew G. Knepley #undef __FUNCT__ 55101b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 55111b406b76SMatthew G. Knepley /*@C 55121b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 55131b406b76SMatthew G. Knepley 55141b406b76SMatthew G. Knepley Not collective 55151b406b76SMatthew G. Knepley 55161b406b76SMatthew G. Knepley Input Parameters: 55171b406b76SMatthew G. Knepley + dm - The DM 55181b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 55191b406b76SMatthew G. Knepley . v - The local vector 55201b406b76SMatthew G. Knepley . point - The sieve point in the DM 55211b406b76SMatthew G. Knepley . values - The array of values 55221b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 55231b406b76SMatthew G. Knepley 55241b406b76SMatthew G. Knepley Fortran Notes: 55251b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 55261b406b76SMatthew G. Knepley 55271b406b76SMatthew G. Knepley Level: intermediate 55281b406b76SMatthew G. Knepley 55291b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 55301b406b76SMatthew G. Knepley @*/ 55311b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 55321b406b76SMatthew G. Knepley { 55331b406b76SMatthew G. Knepley PetscSection clSection; 55341b406b76SMatthew G. Knepley IS clPoints; 55351b406b76SMatthew G. Knepley PetscScalar *array; 55361b406b76SMatthew G. Knepley PetscInt *points = NULL; 55371b406b76SMatthew G. Knepley const PetscInt *clp; 55381a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 55391b406b76SMatthew G. Knepley PetscErrorCode ierr; 55401b406b76SMatthew G. Knepley 55411a271a75SMatthew G. Knepley PetscFunctionBeginHot; 55421b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 55431b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 55441a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 55451a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 55461b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 55471b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 55481b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 55491a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 55501b406b76SMatthew G. Knepley PetscFunctionReturn(0); 55511b406b76SMatthew G. Knepley } 55521a271a75SMatthew G. Knepley /* Get points */ 55531b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 55541b406b76SMatthew G. Knepley if (!clPoints) { 55551a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 55561a271a75SMatthew G. Knepley 55571a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5558552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5559552f7358SJed Brown /* Compress out points not in the section */ 5560552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5561552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5562552f7358SJed Brown points[q*2] = points[p]; 5563552f7358SJed Brown points[q*2+1] = points[p+1]; 5564552f7358SJed Brown ++q; 5565552f7358SJed Brown } 5566552f7358SJed Brown } 5567552f7358SJed Brown numPoints = q; 55681b406b76SMatthew G. Knepley } else { 55691b406b76SMatthew G. Knepley PetscInt dof, off; 5570552f7358SJed Brown 55711b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 55721b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 55731b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 55741a271a75SMatthew G. Knepley numPoints = dof/2; 55751b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 5576552f7358SJed Brown } 55771a271a75SMatthew G. Knepley /* Get array */ 5578552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 55791a271a75SMatthew G. Knepley /* Get values */ 5580f723297eSMatthew G. Knepley if (numFields > 1) { 55811a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5582552f7358SJed Brown for (f = 0; f < numFields; ++f) { 55831a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5584552f7358SJed Brown switch (mode) { 5585552f7358SJed Brown case INSERT_VALUES: 5586552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55871a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55881a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55891a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5590552f7358SJed Brown } break; 5591552f7358SJed Brown case INSERT_ALL_VALUES: 5592552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55931a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55941a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55951a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5596552f7358SJed Brown } break; 5597a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5598a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 55991a271a75SMatthew G. Knepley const PetscInt point = points[p]; 56001a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 56011a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5602a5e93ea8SMatthew G. Knepley } break; 5603552f7358SJed Brown case ADD_VALUES: 5604552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 56051a271a75SMatthew G. Knepley const PetscInt point = points[p]; 56061a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 56071a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5608552f7358SJed Brown } break; 5609552f7358SJed Brown case ADD_ALL_VALUES: 5610552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 56111a271a75SMatthew G. Knepley const PetscInt point = points[p]; 56121a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 56131a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5614552f7358SJed Brown } break; 5615552f7358SJed Brown default: 561682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5617552f7358SJed Brown } 56181a271a75SMatthew G. Knepley } 5619552f7358SJed Brown } else { 56201a271a75SMatthew G. Knepley PetscInt dof, off; 56211a271a75SMatthew G. Knepley 5622552f7358SJed Brown switch (mode) { 5623552f7358SJed Brown case INSERT_VALUES: 5624552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5625552f7358SJed Brown PetscInt o = points[p+1]; 5626552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5627552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5628552f7358SJed Brown } break; 5629552f7358SJed Brown case INSERT_ALL_VALUES: 5630552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5631552f7358SJed Brown PetscInt o = points[p+1]; 5632552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5633552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5634552f7358SJed Brown } break; 5635a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5636a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5637a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5638a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5639a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5640a5e93ea8SMatthew G. Knepley } break; 5641552f7358SJed Brown case ADD_VALUES: 5642552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5643552f7358SJed Brown PetscInt o = points[p+1]; 5644552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5645552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5646552f7358SJed Brown } break; 5647552f7358SJed Brown case ADD_ALL_VALUES: 5648552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5649552f7358SJed Brown PetscInt o = points[p+1]; 5650552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5651552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5652552f7358SJed Brown } break; 5653552f7358SJed Brown default: 565482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5655552f7358SJed Brown } 5656552f7358SJed Brown } 56571a271a75SMatthew G. Knepley /* Cleanup points */ 56581a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 56591a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 56601a271a75SMatthew G. Knepley /* Cleanup array */ 5661552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5662552f7358SJed Brown PetscFunctionReturn(0); 5663552f7358SJed Brown } 5664552f7358SJed Brown 5665552f7358SJed Brown #undef __FUNCT__ 5666552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 56677c1f9639SMatthew G Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numIndices, const PetscInt indices[], const PetscScalar values[]) 5668552f7358SJed Brown { 5669552f7358SJed Brown PetscMPIInt rank; 5670552f7358SJed Brown PetscInt i, j; 5671552f7358SJed Brown PetscErrorCode ierr; 5672552f7358SJed Brown 5673552f7358SJed Brown PetscFunctionBegin; 567482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 567577a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5676552f7358SJed Brown for (i = 0; i < numIndices; i++) { 567777a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat indices[%D] = %D\n", rank, i, indices[i]);CHKERRQ(ierr); 5678552f7358SJed Brown } 5679552f7358SJed Brown for (i = 0; i < numIndices; i++) { 568077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5681552f7358SJed Brown for (j = 0; j < numIndices; j++) { 5682519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 568357622a8eSBarry Smith ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numIndices+j]), (double)PetscImaginaryPart(values[i*numIndices+j]));CHKERRQ(ierr); 5684552f7358SJed Brown #else 568557622a8eSBarry Smith ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numIndices+j]);CHKERRQ(ierr); 5686552f7358SJed Brown #endif 5687552f7358SJed Brown } 568877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5689552f7358SJed Brown } 5690552f7358SJed Brown PetscFunctionReturn(0); 5691552f7358SJed Brown } 5692552f7358SJed Brown 5693552f7358SJed Brown #undef __FUNCT__ 5694552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5695552f7358SJed Brown /* . off - The global offset of this point */ 5696e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5697a6dfd86eSKarl Rupp { 5698e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5699552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5700552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5701552f7358SJed Brown PetscInt cind = 0, k; 5702552f7358SJed Brown PetscErrorCode ierr; 5703552f7358SJed Brown 5704552f7358SJed Brown PetscFunctionBegin; 5705552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5706552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5707552f7358SJed Brown if (!cdof || setBC) { 5708552f7358SJed Brown if (orientation >= 0) { 5709e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5710552f7358SJed Brown } else { 5711e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5712552f7358SJed Brown } 5713552f7358SJed Brown } else { 5714552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5715552f7358SJed Brown if (orientation >= 0) { 5716552f7358SJed Brown for (k = 0; k < dof; ++k) { 5717552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5718552f7358SJed Brown /* Insert check for returning constrained indices */ 5719e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5720552f7358SJed Brown ++cind; 5721552f7358SJed Brown } else { 5722e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5723552f7358SJed Brown } 5724552f7358SJed Brown } 5725552f7358SJed Brown } else { 5726552f7358SJed Brown for (k = 0; k < dof; ++k) { 5727552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5728552f7358SJed Brown /* Insert check for returning constrained indices */ 5729e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5730552f7358SJed Brown ++cind; 5731552f7358SJed Brown } else { 5732e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5733552f7358SJed Brown } 5734552f7358SJed Brown } 5735552f7358SJed Brown } 5736552f7358SJed Brown } 5737e6ccafaeSMatthew G Knepley *loff += dof; 5738552f7358SJed Brown PetscFunctionReturn(0); 5739552f7358SJed Brown } 5740552f7358SJed Brown 5741552f7358SJed Brown #undef __FUNCT__ 5742552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5743552f7358SJed Brown /* . off - The global offset of this point */ 5744a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5745a6dfd86eSKarl Rupp { 5746552f7358SJed Brown PetscInt numFields, foff, f; 5747552f7358SJed Brown PetscErrorCode ierr; 5748552f7358SJed Brown 5749552f7358SJed Brown PetscFunctionBegin; 5750552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5751552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5752552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5753552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5754552f7358SJed Brown PetscInt cind = 0, k, c; 5755552f7358SJed Brown 5756552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5757552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5758552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5759552f7358SJed Brown if (!cfdof || setBC) { 5760552f7358SJed Brown if (orientation >= 0) { 57610d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5762552f7358SJed Brown } else { 5763552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5764552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5765552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5766552f7358SJed Brown } 5767552f7358SJed Brown } 5768552f7358SJed Brown } 5769552f7358SJed Brown } else { 5770552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5771552f7358SJed Brown if (orientation >= 0) { 5772552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5773552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5774552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5775552f7358SJed Brown ++cind; 5776552f7358SJed Brown } else { 5777552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5778552f7358SJed Brown } 5779552f7358SJed Brown } 5780552f7358SJed Brown } else { 5781552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5782552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5783552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5784552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5785552f7358SJed Brown ++cind; 5786552f7358SJed Brown } else { 5787552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5788552f7358SJed Brown } 5789552f7358SJed Brown } 5790552f7358SJed Brown } 5791552f7358SJed Brown } 5792552f7358SJed Brown } 5793552f7358SJed Brown foff += fdof - cfdof; 5794552f7358SJed Brown foffs[f] += fdof; 5795552f7358SJed Brown } 5796552f7358SJed Brown PetscFunctionReturn(0); 5797552f7358SJed Brown } 5798552f7358SJed Brown 5799552f7358SJed Brown #undef __FUNCT__ 5800552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 58017f5d1fdeSMatthew G. Knepley /*@C 58027f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 58037f5d1fdeSMatthew G. Knepley 58047f5d1fdeSMatthew G. Knepley Not collective 58057f5d1fdeSMatthew G. Knepley 58067f5d1fdeSMatthew G. Knepley Input Parameters: 58077f5d1fdeSMatthew G. Knepley + dm - The DM 5808ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5809ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 58107f5d1fdeSMatthew G. Knepley . A - The matrix 58117f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 58127f5d1fdeSMatthew G. Knepley . values - The array of values 58137f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 58147f5d1fdeSMatthew G. Knepley 58157f5d1fdeSMatthew G. Knepley Fortran Notes: 58167f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 58177f5d1fdeSMatthew G. Knepley 58187f5d1fdeSMatthew G. Knepley Level: intermediate 58197f5d1fdeSMatthew G. Knepley 58207f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 58217f5d1fdeSMatthew G. Knepley @*/ 58227c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5823552f7358SJed Brown { 5824552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 58251b406b76SMatthew G. Knepley PetscSection clSection; 58261b406b76SMatthew G. Knepley IS clPoints; 58270298fd71SBarry Smith PetscInt *points = NULL; 58281b406b76SMatthew G. Knepley const PetscInt *clp; 5829552f7358SJed Brown PetscInt *indices; 5830552f7358SJed Brown PetscInt offsets[32]; 5831552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5832552f7358SJed Brown PetscErrorCode ierr; 5833552f7358SJed Brown 5834552f7358SJed Brown PetscFunctionBegin; 5835552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5836ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 58373dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5838ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 58393dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58403dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5841552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 584282f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5843552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 58441b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 58451b406b76SMatthew G. Knepley if (!clPoints) { 5846552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5847552f7358SJed Brown /* Compress out points not in the section */ 5848552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5849552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5850552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5851552f7358SJed Brown points[q*2] = points[p]; 5852552f7358SJed Brown points[q*2+1] = points[p+1]; 5853552f7358SJed Brown ++q; 5854552f7358SJed Brown } 5855552f7358SJed Brown } 5856552f7358SJed Brown numPoints = q; 58571b406b76SMatthew G. Knepley } else { 58581b406b76SMatthew G. Knepley PetscInt dof, off; 58591b406b76SMatthew G. Knepley 58601b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 58611b406b76SMatthew G. Knepley numPoints = dof/2; 58621b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 58631b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 58641b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 58651b406b76SMatthew G. Knepley } 5866552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5867552f7358SJed Brown PetscInt fdof; 5868552f7358SJed Brown 5869552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5870552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5871552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5872552f7358SJed Brown offsets[f+1] += fdof; 5873552f7358SJed Brown } 5874552f7358SJed Brown numIndices += dof; 5875552f7358SJed Brown } 58760d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58770d644c17SKarl Rupp 587882f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5879552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5880552f7358SJed Brown if (numFields) { 5881552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5882552f7358SJed Brown PetscInt o = points[p+1]; 5883552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5884552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5885552f7358SJed Brown } 5886552f7358SJed Brown } else { 5887e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5888552f7358SJed Brown PetscInt o = points[p+1]; 5889552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5890e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5891552f7358SJed Brown } 5892552f7358SJed Brown } 589377a6746dSMatthew G Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr);} 5894552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5895552f7358SJed Brown if (ierr) { 5896552f7358SJed Brown PetscMPIInt rank; 5897552f7358SJed Brown PetscErrorCode ierr2; 5898552f7358SJed Brown 589982f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 590077a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 590177a6746dSMatthew G Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr2); 59026a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5903552f7358SJed Brown CHKERRQ(ierr); 5904552f7358SJed Brown } 59051b406b76SMatthew G. Knepley if (!clPoints) { 5906552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 59071b406b76SMatthew G. Knepley } else { 59081b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 59091b406b76SMatthew G. Knepley } 5910552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5911552f7358SJed Brown PetscFunctionReturn(0); 5912552f7358SJed Brown } 5913552f7358SJed Brown 5914552f7358SJed Brown #undef __FUNCT__ 5915770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5916f96281f8SMatthew G. Knepley /*@ 5917f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5918f96281f8SMatthew G. Knepley 5919f96281f8SMatthew G. Knepley Input Parameter: 5920f96281f8SMatthew G. Knepley . dm - The DMPlex object 5921f96281f8SMatthew G. Knepley 5922f96281f8SMatthew G. Knepley Output Parameters: 5923f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5924f96281f8SMatthew G. Knepley . cMax - The first hybrid face 5925f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 5926f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 5927f96281f8SMatthew G. Knepley 5928f96281f8SMatthew G. Knepley Level: developer 5929f96281f8SMatthew G. Knepley 5930f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 5931f96281f8SMatthew G. Knepley @*/ 5932770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5933552f7358SJed Brown { 5934552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5935770b213bSMatthew G Knepley PetscInt dim; 5936770b213bSMatthew G Knepley PetscErrorCode ierr; 5937552f7358SJed Brown 5938552f7358SJed Brown PetscFunctionBegin; 5939552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5940770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5941770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5942770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5943770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5944770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5945552f7358SJed Brown PetscFunctionReturn(0); 5946552f7358SJed Brown } 5947552f7358SJed Brown 5948552f7358SJed Brown #undef __FUNCT__ 5949770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5950770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5951552f7358SJed Brown { 5952552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5953770b213bSMatthew G Knepley PetscInt dim; 5954770b213bSMatthew G Knepley PetscErrorCode ierr; 5955552f7358SJed Brown 5956552f7358SJed Brown PetscFunctionBegin; 5957552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5958770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5959770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5960770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5961770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5962770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5963552f7358SJed Brown PetscFunctionReturn(0); 5964552f7358SJed Brown } 5965552f7358SJed Brown 5966552f7358SJed Brown #undef __FUNCT__ 5967552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5968552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5969552f7358SJed Brown { 5970552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5971552f7358SJed Brown 5972552f7358SJed Brown PetscFunctionBegin; 5973552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5974552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5975552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5976552f7358SJed Brown PetscFunctionReturn(0); 5977552f7358SJed Brown } 5978552f7358SJed Brown 5979552f7358SJed Brown #undef __FUNCT__ 5980552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5981552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5982552f7358SJed Brown { 5983552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5984552f7358SJed Brown 5985552f7358SJed Brown PetscFunctionBegin; 5986552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5987552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5988552f7358SJed Brown PetscFunctionReturn(0); 5989552f7358SJed Brown } 5990552f7358SJed Brown 5991552f7358SJed Brown #undef __FUNCT__ 5992552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5993552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5994552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 5995552f7358SJed Brown { 5996552f7358SJed Brown PetscSection section, globalSection; 5997552f7358SJed Brown PetscInt *numbers, p; 5998552f7358SJed Brown PetscErrorCode ierr; 5999552f7358SJed Brown 6000552f7358SJed Brown PetscFunctionBegin; 600182f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 6002552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 6003552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6004552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 6005552f7358SJed Brown } 6006552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 6007552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 6008785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 6009552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6010552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 6011552f7358SJed Brown } 601282f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 6013552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6014552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 6015552f7358SJed Brown PetscFunctionReturn(0); 6016552f7358SJed Brown } 6017552f7358SJed Brown 6018552f7358SJed Brown #undef __FUNCT__ 6019552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 6020552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 6021552f7358SJed Brown { 6022552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6023552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 6024552f7358SJed Brown PetscErrorCode ierr; 6025552f7358SJed Brown 6026552f7358SJed Brown PetscFunctionBegin; 6027552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6028552f7358SJed Brown if (!mesh->globalCellNumbers) { 6029552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6030552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 60310298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 60320d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6033552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6034552f7358SJed Brown } 6035552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6036552f7358SJed Brown PetscFunctionReturn(0); 6037552f7358SJed Brown } 6038552f7358SJed Brown 6039552f7358SJed Brown #undef __FUNCT__ 6040552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6041552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6042552f7358SJed Brown { 6043552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6044552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6045552f7358SJed Brown PetscErrorCode ierr; 6046552f7358SJed Brown 6047552f7358SJed Brown PetscFunctionBegin; 6048552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6049552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6050552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 60510298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 60520d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6053552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6054552f7358SJed Brown } 6055552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6056552f7358SJed Brown PetscFunctionReturn(0); 6057552f7358SJed Brown } 6058552f7358SJed Brown 6059552f7358SJed Brown 6060552f7358SJed Brown #undef __FUNCT__ 6061552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6062552f7358SJed Brown /*@C 6063552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6064552f7358SJed Brown the local section and an SF describing the section point overlap. 6065552f7358SJed Brown 6066552f7358SJed Brown Input Parameters: 6067552f7358SJed Brown + s - The PetscSection for the local field layout 6068552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6069552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6070552f7358SJed Brown . label - The label specifying the points 6071552f7358SJed Brown - labelValue - The label stratum specifying the points 6072552f7358SJed Brown 6073552f7358SJed Brown Output Parameter: 6074552f7358SJed Brown . gsection - The PetscSection for the global field layout 6075552f7358SJed Brown 6076552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6077552f7358SJed Brown 6078552f7358SJed Brown Level: developer 6079552f7358SJed Brown 6080552f7358SJed Brown .seealso: PetscSectionCreate() 6081552f7358SJed Brown @*/ 6082552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6083552f7358SJed Brown { 60847ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6085552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6086552f7358SJed Brown PetscErrorCode ierr; 6087552f7358SJed Brown 6088552f7358SJed Brown PetscFunctionBegin; 6089552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 6090552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6091552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 60927ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 60937ec39499SMatthew G. Knepley if (nroots >= 0) { 60947ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 60951795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 60967ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 60971795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 60987ec39499SMatthew G. Knepley } else { 60997ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 61007ec39499SMatthew G. Knepley } 61017ec39499SMatthew G. Knepley } 6102552f7358SJed Brown /* Mark ghost points with negative dof */ 6103552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6104552f7358SJed Brown PetscInt value; 6105552f7358SJed Brown 6106552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6107552f7358SJed Brown if (value != labelValue) continue; 6108552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6109552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6110552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6111552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 61127ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6113552f7358SJed Brown } 6114552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6115552f7358SJed Brown if (nroots >= 0) { 61167ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 61177ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6118552f7358SJed Brown if (nroots > pEnd-pStart) { 61197ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6120552f7358SJed Brown } 6121552f7358SJed Brown } 6122552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6123552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6124552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6125552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6126552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6127552f7358SJed Brown } 6128552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 6129552f7358SJed Brown globalOff -= off; 6130552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6131552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 61327ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6133552f7358SJed Brown } 6134552f7358SJed Brown /* Put in negative offsets for ghost points */ 6135552f7358SJed Brown if (nroots >= 0) { 61367ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 61377ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6138552f7358SJed Brown if (nroots > pEnd-pStart) { 61397ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6140552f7358SJed Brown } 6141552f7358SJed Brown } 61427ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6143552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6144552f7358SJed Brown PetscFunctionReturn(0); 6145552f7358SJed Brown } 6146ca8062c8SMatthew G. Knepley 6147ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6148ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6149ca8062c8SMatthew G. Knepley /*@ 6150ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6151ca8062c8SMatthew G. Knepley 6152ca8062c8SMatthew G. Knepley Input Parameters: 6153ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6154ca8062c8SMatthew G. Knepley 6155ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6156ca8062c8SMatthew G. Knepley 6157ca8062c8SMatthew G. Knepley Level: developer 6158ca8062c8SMatthew G. Knepley 61599bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6160ca8062c8SMatthew G. Knepley @*/ 6161ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6162ca8062c8SMatthew G. Knepley { 6163ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6164ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6165ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6166ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6167ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6168ca8062c8SMatthew G. Knepley 6169ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6170ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6171ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6172ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6173ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6174ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6175ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6176ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6177ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6178ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6179ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6180ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6181ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6182ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6183ca8062c8SMatthew G. Knepley } 6184ca8062c8SMatthew G. Knepley if (s >= supportSize) { 6185ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6186ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6187ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6188ca8062c8SMatthew G. Knepley } 6189ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6190ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6191ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6192ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6193ca8062c8SMatthew G. Knepley } 6194ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6195ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6196ca8062c8SMatthew G. Knepley } 6197ca8062c8SMatthew G. Knepley } 6198ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6199ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6200ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6201ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6202ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6203ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6204ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6205ca8062c8SMatthew G. Knepley } 6206ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6207ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6208ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6209ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6210ca8062c8SMatthew G. Knepley } 6211ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6212ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6213ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6214ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6215ca8062c8SMatthew G. Knepley } 6216ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6217ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6218ca8062c8SMatthew G. Knepley } 6219ca8062c8SMatthew G. Knepley } 6220ca8062c8SMatthew G. Knepley } 6221ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6222ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6223ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6224ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6225ca8062c8SMatthew G. Knepley } 6226ca8062c8SMatthew G. Knepley 6227ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6228ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6229ca8062c8SMatthew G. Knepley /*@ 6230ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6231ca8062c8SMatthew G. Knepley 6232ca8062c8SMatthew G. Knepley Input Parameters: 6233ca8062c8SMatthew G. Knepley + dm - The DMPlex object 623458723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 623558723a97SMatthew G. Knepley - cellHeight - Normally 0 6236ca8062c8SMatthew G. Knepley 6237ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6238ca8062c8SMatthew G. Knepley 6239ca8062c8SMatthew G. Knepley Level: developer 6240ca8062c8SMatthew G. Knepley 62419bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6242ca8062c8SMatthew G. Knepley @*/ 624358723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6244ca8062c8SMatthew G. Knepley { 624542363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6246ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6247ca8062c8SMatthew G. Knepley 6248ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6249ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6250ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6251ca8062c8SMatthew G. Knepley switch (dim) { 625242363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 625342363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 625442363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6255ca8062c8SMatthew G. Knepley default: 6256ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6257ca8062c8SMatthew G. Knepley } 625858723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 625958723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6260ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6261ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6262ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 626358723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 626458723a97SMatthew G. Knepley 626558723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 626658723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 626758723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 626858723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 626958723a97SMatthew G. Knepley } 627058723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6271ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6272ca8062c8SMatthew G. Knepley } 627342363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 627442363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 627542363296SMatthew G. Knepley 627642363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 627742363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 627842363296SMatthew G. Knepley const PetscInt p = closure[cl]; 627942363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 628042363296SMatthew G. Knepley } 628142363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 628242363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 628342363296SMatthew G. Knepley } 6284ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6285ca8062c8SMatthew G. Knepley } 62869bf0dad6SMatthew G. Knepley 62879bf0dad6SMatthew G. Knepley #undef __FUNCT__ 62889bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 62899bf0dad6SMatthew G. Knepley /*@ 62909bf0dad6SMatthew 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 62919bf0dad6SMatthew G. Knepley 62929bf0dad6SMatthew G. Knepley Input Parameters: 62939bf0dad6SMatthew G. Knepley + dm - The DMPlex object 62949bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 62959bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 62969bf0dad6SMatthew G. Knepley 62979bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 62989bf0dad6SMatthew G. Knepley 62999bf0dad6SMatthew G. Knepley Level: developer 63009bf0dad6SMatthew G. Knepley 63019bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 63029bf0dad6SMatthew G. Knepley @*/ 63039bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 63049bf0dad6SMatthew G. Knepley { 63053554e41dSMatthew G. Knepley PetscInt pMax[4]; 63063554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 63079bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 63089bf0dad6SMatthew G. Knepley 63099bf0dad6SMatthew G. Knepley PetscFunctionBegin; 63109bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 63119bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 63129bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 631325abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 63143554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 63153554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 63163554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 63179bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 63189bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 63199bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 63209bf0dad6SMatthew G. Knepley 632125abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 63229bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 63239bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 63249bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 63259bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 63269bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 63279bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 63289bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 63299bf0dad6SMatthew G. Knepley } 63303554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 63319bf0dad6SMatthew 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); 63329bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 63339bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 63349bf0dad6SMatthew G. Knepley 63359bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 63369bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 63379bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 63389bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 63399bf0dad6SMatthew G. Knepley } 6340e003ed69SMatthew 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); 63419bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6342e003ed69SMatthew 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]); 63439bf0dad6SMatthew G. Knepley } 63449bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 63459bf0dad6SMatthew G. Knepley } 63469bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 63479bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 63489bf0dad6SMatthew G. Knepley } 63493554e41dSMatthew G. Knepley } 6350552f7358SJed Brown PetscFunctionReturn(0); 6351552f7358SJed Brown } 6352