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 } 3983913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 399a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 400552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 401552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 402552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 403552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 404552f7358SJed Brown PetscFunctionReturn(0); 405552f7358SJed Brown } 406552f7358SJed Brown 407552f7358SJed Brown #undef __FUNCT__ 408552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 409b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 410552f7358SJed Brown { 411552f7358SJed Brown PetscSection section, sectionGlobal; 412552f7358SJed Brown PetscInt bs = -1; 413552f7358SJed Brown PetscInt localSize; 41489545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 415552f7358SJed Brown PetscErrorCode ierr; 416b412c318SBarry Smith MatType mtype; 417552f7358SJed Brown 418552f7358SJed Brown PetscFunctionBegin; 419607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 420b412c318SBarry Smith mtype = dm->mattype; 421552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 422552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 423552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 424552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 42582f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 426552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 427552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 428552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 429552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 430552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 431552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 432552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 433552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 434552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 435552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 436552f7358SJed Brown if (!isShell) { 437552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 4382a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 439552f7358SJed Brown 440552f7358SJed Brown if (bs < 0) { 441552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 442fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 443552f7358SJed Brown 444552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 445552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 446552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 447fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 448fad22124SMatthew G Knepley if (dof-cdof) { 4492a28c762SMatthew G Knepley if (bs < 0) { 450fad22124SMatthew G Knepley bs = dof-cdof; 451fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 4522a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 4532a28c762SMatthew G Knepley bs = 1; 454552f7358SJed Brown break; 455552f7358SJed Brown } 456552f7358SJed Brown } 4572a28c762SMatthew G Knepley } 4582a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 4592a28c762SMatthew G Knepley bsLocal = bs; 46082f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4612a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 46282f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4632a28c762SMatthew G Knepley if (bsMin != bsMax) { 4642a28c762SMatthew G Knepley bs = 1; 4652a28c762SMatthew G Knepley } else { 4662a28c762SMatthew G Knepley bs = bsMax; 4672a28c762SMatthew G Knepley } 468552f7358SJed Brown } else { 469552f7358SJed Brown bs = 1; 470552f7358SJed Brown } 471552f7358SJed Brown } 4721795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 473552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 474552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 475552f7358SJed Brown } 476552f7358SJed Brown PetscFunctionReturn(0); 477552f7358SJed Brown } 478552f7358SJed Brown 479552f7358SJed Brown #undef __FUNCT__ 480552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 481552f7358SJed Brown /*@ 482552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 483552f7358SJed Brown 484552f7358SJed Brown Not collective 485552f7358SJed Brown 486552f7358SJed Brown Input Parameter: 487552f7358SJed Brown . mesh - The DMPlex 488552f7358SJed Brown 489552f7358SJed Brown Output Parameter: 490552f7358SJed Brown . dim - The topological mesh dimension 491552f7358SJed Brown 492552f7358SJed Brown Level: beginner 493552f7358SJed Brown 494552f7358SJed Brown .seealso: DMPlexCreate() 495552f7358SJed Brown @*/ 496552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 497552f7358SJed Brown { 498552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 499552f7358SJed Brown 500552f7358SJed Brown PetscFunctionBegin; 501552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 502552f7358SJed Brown PetscValidPointer(dim, 2); 503552f7358SJed Brown *dim = mesh->dim; 504552f7358SJed Brown PetscFunctionReturn(0); 505552f7358SJed Brown } 506552f7358SJed Brown 507552f7358SJed Brown #undef __FUNCT__ 508552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 509552f7358SJed Brown /*@ 510552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 511552f7358SJed Brown 512552f7358SJed Brown Collective on mesh 513552f7358SJed Brown 514552f7358SJed Brown Input Parameters: 515552f7358SJed Brown + mesh - The DMPlex 516552f7358SJed Brown - dim - The topological mesh dimension 517552f7358SJed Brown 518552f7358SJed Brown Level: beginner 519552f7358SJed Brown 520552f7358SJed Brown .seealso: DMPlexCreate() 521552f7358SJed Brown @*/ 522552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 523552f7358SJed Brown { 524552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 525552f7358SJed Brown 526552f7358SJed Brown PetscFunctionBegin; 527552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 528552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 529552f7358SJed Brown mesh->dim = dim; 530552f7358SJed Brown mesh->preallocCenterDim = dim; 531552f7358SJed Brown PetscFunctionReturn(0); 532552f7358SJed Brown } 533552f7358SJed Brown 534552f7358SJed Brown #undef __FUNCT__ 535552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 536552f7358SJed Brown /*@ 537552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 538552f7358SJed Brown 539552f7358SJed Brown Not collective 540552f7358SJed Brown 541552f7358SJed Brown Input Parameter: 542552f7358SJed Brown . mesh - The DMPlex 543552f7358SJed Brown 544552f7358SJed Brown Output Parameters: 545552f7358SJed Brown + pStart - The first mesh point 546552f7358SJed Brown - pEnd - The upper bound for mesh points 547552f7358SJed Brown 548552f7358SJed Brown Level: beginner 549552f7358SJed Brown 550552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 551552f7358SJed Brown @*/ 552552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 553552f7358SJed Brown { 554552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 555552f7358SJed Brown PetscErrorCode ierr; 556552f7358SJed Brown 557552f7358SJed Brown PetscFunctionBegin; 558552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 559552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 560552f7358SJed Brown PetscFunctionReturn(0); 561552f7358SJed Brown } 562552f7358SJed Brown 563552f7358SJed Brown #undef __FUNCT__ 564552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 565552f7358SJed Brown /*@ 566552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 567552f7358SJed Brown 568552f7358SJed Brown Not collective 569552f7358SJed Brown 570552f7358SJed Brown Input Parameters: 571552f7358SJed Brown + mesh - The DMPlex 572552f7358SJed Brown . pStart - The first mesh point 573552f7358SJed Brown - pEnd - The upper bound for mesh points 574552f7358SJed Brown 575552f7358SJed Brown Output Parameters: 576552f7358SJed Brown 577552f7358SJed Brown Level: beginner 578552f7358SJed Brown 579552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 580552f7358SJed Brown @*/ 581552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 582552f7358SJed Brown { 583552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 584552f7358SJed Brown PetscErrorCode ierr; 585552f7358SJed Brown 586552f7358SJed Brown PetscFunctionBegin; 587552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 588552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 589552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 590552f7358SJed Brown PetscFunctionReturn(0); 591552f7358SJed Brown } 592552f7358SJed Brown 593552f7358SJed Brown #undef __FUNCT__ 594552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 595552f7358SJed Brown /*@ 596552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 597552f7358SJed Brown 598552f7358SJed Brown Not collective 599552f7358SJed Brown 600552f7358SJed Brown Input Parameters: 601552f7358SJed Brown + mesh - The DMPlex 602552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 603552f7358SJed Brown 604552f7358SJed Brown Output Parameter: 605552f7358SJed Brown . size - The cone size for point p 606552f7358SJed Brown 607552f7358SJed Brown Level: beginner 608552f7358SJed Brown 609552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 610552f7358SJed Brown @*/ 611552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 612552f7358SJed Brown { 613552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 614552f7358SJed Brown PetscErrorCode ierr; 615552f7358SJed Brown 616552f7358SJed Brown PetscFunctionBegin; 617552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 618552f7358SJed Brown PetscValidPointer(size, 3); 619552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 620552f7358SJed Brown PetscFunctionReturn(0); 621552f7358SJed Brown } 622552f7358SJed Brown 623552f7358SJed Brown #undef __FUNCT__ 624552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 625552f7358SJed Brown /*@ 626552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 627552f7358SJed Brown 628552f7358SJed Brown Not collective 629552f7358SJed Brown 630552f7358SJed Brown Input Parameters: 631552f7358SJed Brown + mesh - The DMPlex 632552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 633552f7358SJed Brown - size - The cone size for point p 634552f7358SJed Brown 635552f7358SJed Brown Output Parameter: 636552f7358SJed Brown 637552f7358SJed Brown Note: 638552f7358SJed Brown This should be called after DMPlexSetChart(). 639552f7358SJed Brown 640552f7358SJed Brown Level: beginner 641552f7358SJed Brown 642552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 643552f7358SJed Brown @*/ 644552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 645552f7358SJed Brown { 646552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 647552f7358SJed Brown PetscErrorCode ierr; 648552f7358SJed Brown 649552f7358SJed Brown PetscFunctionBegin; 650552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 651552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 6520d644c17SKarl Rupp 653552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 654552f7358SJed Brown PetscFunctionReturn(0); 655552f7358SJed Brown } 656552f7358SJed Brown 657552f7358SJed Brown #undef __FUNCT__ 658552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 659552f7358SJed Brown /*@C 660552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 661552f7358SJed Brown 662552f7358SJed Brown Not collective 663552f7358SJed Brown 664552f7358SJed Brown Input Parameters: 665552f7358SJed Brown + mesh - The DMPlex 666552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 667552f7358SJed Brown 668552f7358SJed Brown Output Parameter: 669552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 670552f7358SJed Brown 671552f7358SJed Brown Level: beginner 672552f7358SJed Brown 6733813dfbdSMatthew G Knepley Fortran Notes: 6743813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 6753813dfbdSMatthew G Knepley include petsc.h90 in your code. 6763813dfbdSMatthew G Knepley 6773813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 678552f7358SJed Brown 679552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 680552f7358SJed Brown @*/ 681552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 682552f7358SJed Brown { 683552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 684552f7358SJed Brown PetscInt off; 685552f7358SJed Brown PetscErrorCode ierr; 686552f7358SJed Brown 687552f7358SJed Brown PetscFunctionBegin; 688552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 689552f7358SJed Brown PetscValidPointer(cone, 3); 690552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 691552f7358SJed Brown *cone = &mesh->cones[off]; 692552f7358SJed Brown PetscFunctionReturn(0); 693552f7358SJed Brown } 694552f7358SJed Brown 695552f7358SJed Brown #undef __FUNCT__ 696552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 697552f7358SJed Brown /*@ 698552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 699552f7358SJed Brown 700552f7358SJed Brown Not collective 701552f7358SJed Brown 702552f7358SJed Brown Input Parameters: 703552f7358SJed Brown + mesh - The DMPlex 704552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 705552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 706552f7358SJed Brown 707552f7358SJed Brown Output Parameter: 708552f7358SJed Brown 709552f7358SJed Brown Note: 710552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 711552f7358SJed Brown 712552f7358SJed Brown Level: beginner 713552f7358SJed Brown 714552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 715552f7358SJed Brown @*/ 716552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 717552f7358SJed Brown { 718552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 719552f7358SJed Brown PetscInt pStart, pEnd; 720552f7358SJed Brown PetscInt dof, off, c; 721552f7358SJed Brown PetscErrorCode ierr; 722552f7358SJed Brown 723552f7358SJed Brown PetscFunctionBegin; 724552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 725552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 726552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 727552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 728552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 72982f516ccSBarry 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); 730552f7358SJed Brown for (c = 0; c < dof; ++c) { 73182f516ccSBarry 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); 732552f7358SJed Brown mesh->cones[off+c] = cone[c]; 733552f7358SJed Brown } 734552f7358SJed Brown PetscFunctionReturn(0); 735552f7358SJed Brown } 736552f7358SJed Brown 737552f7358SJed Brown #undef __FUNCT__ 738552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 739552f7358SJed Brown /*@C 740552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 741552f7358SJed Brown 742552f7358SJed Brown Not collective 743552f7358SJed Brown 744552f7358SJed Brown Input Parameters: 745552f7358SJed Brown + mesh - The DMPlex 746552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 747552f7358SJed Brown 748552f7358SJed Brown Output Parameter: 749552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 750552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 751552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 752552f7358SJed Brown the index of the cone point on which to start. 753552f7358SJed Brown 754552f7358SJed Brown Level: beginner 755552f7358SJed Brown 7563813dfbdSMatthew G Knepley Fortran Notes: 7573813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7583813dfbdSMatthew G Knepley include petsc.h90 in your code. 7593813dfbdSMatthew G Knepley 7603813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 761552f7358SJed Brown 762552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 763552f7358SJed Brown @*/ 764552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 765552f7358SJed Brown { 766552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 767552f7358SJed Brown PetscInt off; 768552f7358SJed Brown PetscErrorCode ierr; 769552f7358SJed Brown 770552f7358SJed Brown PetscFunctionBegin; 771552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 772552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 773552f7358SJed Brown { 774552f7358SJed Brown PetscInt dof; 775552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 776552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 777552f7358SJed Brown } 778552f7358SJed Brown #endif 779552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 7800d644c17SKarl Rupp 781552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 782552f7358SJed Brown PetscFunctionReturn(0); 783552f7358SJed Brown } 784552f7358SJed Brown 785552f7358SJed Brown #undef __FUNCT__ 786552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 787552f7358SJed Brown /*@ 788552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 789552f7358SJed Brown 790552f7358SJed Brown Not collective 791552f7358SJed Brown 792552f7358SJed Brown Input Parameters: 793552f7358SJed Brown + mesh - The DMPlex 794552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 795552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 796552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 797552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 798552f7358SJed Brown the index of the cone point on which to start. 799552f7358SJed Brown 800552f7358SJed Brown Output Parameter: 801552f7358SJed Brown 802552f7358SJed Brown Note: 803552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 804552f7358SJed Brown 805552f7358SJed Brown Level: beginner 806552f7358SJed Brown 807552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 808552f7358SJed Brown @*/ 809552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 810552f7358SJed Brown { 811552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 812552f7358SJed Brown PetscInt pStart, pEnd; 813552f7358SJed Brown PetscInt dof, off, c; 814552f7358SJed Brown PetscErrorCode ierr; 815552f7358SJed Brown 816552f7358SJed Brown PetscFunctionBegin; 817552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 818552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 819552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 820552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 821552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 82282f516ccSBarry 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); 823552f7358SJed Brown for (c = 0; c < dof; ++c) { 824552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 825552f7358SJed Brown 826552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 82782f516ccSBarry 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); 828552f7358SJed Brown mesh->coneOrientations[off+c] = o; 829552f7358SJed Brown } 830552f7358SJed Brown PetscFunctionReturn(0); 831552f7358SJed Brown } 832552f7358SJed Brown 833552f7358SJed Brown #undef __FUNCT__ 834552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 835552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 836552f7358SJed Brown { 837552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 838552f7358SJed Brown PetscInt pStart, pEnd; 839552f7358SJed Brown PetscInt dof, off; 840552f7358SJed Brown PetscErrorCode ierr; 841552f7358SJed Brown 842552f7358SJed Brown PetscFunctionBegin; 843552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 844552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 84582f516ccSBarry 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); 84682f516ccSBarry 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); 84777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 84877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84977c88f5bSMatthew 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); 850552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 851552f7358SJed Brown PetscFunctionReturn(0); 852552f7358SJed Brown } 853552f7358SJed Brown 854552f7358SJed Brown #undef __FUNCT__ 85577c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 85677c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 85777c88f5bSMatthew G Knepley { 85877c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 85977c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 86077c88f5bSMatthew G Knepley PetscInt dof, off; 86177c88f5bSMatthew G Knepley PetscErrorCode ierr; 86277c88f5bSMatthew G Knepley 86377c88f5bSMatthew G Knepley PetscFunctionBegin; 86477c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 86577c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 86677c88f5bSMatthew 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); 86777c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 86877c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 86977c88f5bSMatthew 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); 87077c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 87177c88f5bSMatthew G Knepley PetscFunctionReturn(0); 87277c88f5bSMatthew G Knepley } 87377c88f5bSMatthew G Knepley 87477c88f5bSMatthew G Knepley #undef __FUNCT__ 875552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 876552f7358SJed Brown /*@ 877552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 878552f7358SJed Brown 879552f7358SJed Brown Not collective 880552f7358SJed Brown 881552f7358SJed Brown Input Parameters: 882552f7358SJed Brown + mesh - The DMPlex 883552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 884552f7358SJed Brown 885552f7358SJed Brown Output Parameter: 886552f7358SJed Brown . size - The support size for point p 887552f7358SJed Brown 888552f7358SJed Brown Level: beginner 889552f7358SJed Brown 890552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 891552f7358SJed Brown @*/ 892552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 893552f7358SJed Brown { 894552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 895552f7358SJed Brown PetscErrorCode ierr; 896552f7358SJed Brown 897552f7358SJed Brown PetscFunctionBegin; 898552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 899552f7358SJed Brown PetscValidPointer(size, 3); 900552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 901552f7358SJed Brown PetscFunctionReturn(0); 902552f7358SJed Brown } 903552f7358SJed Brown 904552f7358SJed Brown #undef __FUNCT__ 905552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 906552f7358SJed Brown /*@ 907552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 908552f7358SJed Brown 909552f7358SJed Brown Not collective 910552f7358SJed Brown 911552f7358SJed Brown Input Parameters: 912552f7358SJed Brown + mesh - The DMPlex 913552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 914552f7358SJed Brown - size - The support size for point p 915552f7358SJed Brown 916552f7358SJed Brown Output Parameter: 917552f7358SJed Brown 918552f7358SJed Brown Note: 919552f7358SJed Brown This should be called after DMPlexSetChart(). 920552f7358SJed Brown 921552f7358SJed Brown Level: beginner 922552f7358SJed Brown 923552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 924552f7358SJed Brown @*/ 925552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 926552f7358SJed Brown { 927552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 928552f7358SJed Brown PetscErrorCode ierr; 929552f7358SJed Brown 930552f7358SJed Brown PetscFunctionBegin; 931552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 932552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 9330d644c17SKarl Rupp 934552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 935552f7358SJed Brown PetscFunctionReturn(0); 936552f7358SJed Brown } 937552f7358SJed Brown 938552f7358SJed Brown #undef __FUNCT__ 939552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 940552f7358SJed Brown /*@C 941552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 942552f7358SJed Brown 943552f7358SJed Brown Not collective 944552f7358SJed Brown 945552f7358SJed Brown Input Parameters: 946552f7358SJed Brown + mesh - The DMPlex 947552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 948552f7358SJed Brown 949552f7358SJed Brown Output Parameter: 950552f7358SJed Brown . support - An array of points which are on the out-edges for point p 951552f7358SJed Brown 952552f7358SJed Brown Level: beginner 953552f7358SJed Brown 9543813dfbdSMatthew G Knepley Fortran Notes: 9553813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9563813dfbdSMatthew G Knepley include petsc.h90 in your code. 9573813dfbdSMatthew G Knepley 9583813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 9593813dfbdSMatthew G Knepley 960552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 961552f7358SJed Brown @*/ 962552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 963552f7358SJed Brown { 964552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 965552f7358SJed Brown PetscInt off; 966552f7358SJed Brown PetscErrorCode ierr; 967552f7358SJed Brown 968552f7358SJed Brown PetscFunctionBegin; 969552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 970552f7358SJed Brown PetscValidPointer(support, 3); 971552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 972552f7358SJed Brown *support = &mesh->supports[off]; 973552f7358SJed Brown PetscFunctionReturn(0); 974552f7358SJed Brown } 975552f7358SJed Brown 976552f7358SJed Brown #undef __FUNCT__ 977552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 978552f7358SJed Brown /*@ 979552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 980552f7358SJed Brown 981552f7358SJed Brown Not collective 982552f7358SJed Brown 983552f7358SJed Brown Input Parameters: 984552f7358SJed Brown + mesh - The DMPlex 985552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 986552f7358SJed Brown - support - An array of points which are on the in-edges for point p 987552f7358SJed Brown 988552f7358SJed Brown Output Parameter: 989552f7358SJed Brown 990552f7358SJed Brown Note: 991552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 992552f7358SJed Brown 993552f7358SJed Brown Level: beginner 994552f7358SJed Brown 995552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 996552f7358SJed Brown @*/ 997552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 998552f7358SJed Brown { 999552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1000552f7358SJed Brown PetscInt pStart, pEnd; 1001552f7358SJed Brown PetscInt dof, off, c; 1002552f7358SJed Brown PetscErrorCode ierr; 1003552f7358SJed Brown 1004552f7358SJed Brown PetscFunctionBegin; 1005552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1006552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1007552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1008552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1009552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 101082f516ccSBarry 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); 1011552f7358SJed Brown for (c = 0; c < dof; ++c) { 101282f516ccSBarry 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); 1013552f7358SJed Brown mesh->supports[off+c] = support[c]; 1014552f7358SJed Brown } 1015552f7358SJed Brown PetscFunctionReturn(0); 1016552f7358SJed Brown } 1017552f7358SJed Brown 1018552f7358SJed Brown #undef __FUNCT__ 1019552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1020552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1021552f7358SJed Brown { 1022552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1023552f7358SJed Brown PetscInt pStart, pEnd; 1024552f7358SJed Brown PetscInt dof, off; 1025552f7358SJed Brown PetscErrorCode ierr; 1026552f7358SJed Brown 1027552f7358SJed Brown PetscFunctionBegin; 1028552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1029552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1030552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1031552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 103282f516ccSBarry 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); 103382f516ccSBarry 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); 103482f516ccSBarry 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); 1035552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1036552f7358SJed Brown PetscFunctionReturn(0); 1037552f7358SJed Brown } 1038552f7358SJed Brown 1039552f7358SJed Brown #undef __FUNCT__ 1040552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1041552f7358SJed Brown /*@C 1042552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1043552f7358SJed Brown 1044552f7358SJed Brown Not collective 1045552f7358SJed Brown 1046552f7358SJed Brown Input Parameters: 1047552f7358SJed Brown + mesh - The DMPlex 1048552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1049552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 10500298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1051552f7358SJed Brown 1052552f7358SJed Brown Output Parameters: 1053552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1054552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1055552f7358SJed Brown 1056552f7358SJed Brown Note: 10570298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1058552f7358SJed Brown 10593813dfbdSMatthew G Knepley Fortran Notes: 10603813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10613813dfbdSMatthew G Knepley include petsc.h90 in your code. 10623813dfbdSMatthew G Knepley 10633813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 10643813dfbdSMatthew G Knepley 1065552f7358SJed Brown Level: beginner 1066552f7358SJed Brown 1067552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1068552f7358SJed Brown @*/ 1069552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1070552f7358SJed Brown { 1071552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1072552f7358SJed Brown PetscInt *closure, *fifo; 10730298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1074552f7358SJed Brown PetscInt tmpSize, t; 1075552f7358SJed Brown PetscInt depth = 0, maxSize; 1076552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1077552f7358SJed Brown PetscErrorCode ierr; 1078552f7358SJed Brown 1079552f7358SJed Brown PetscFunctionBegin; 1080552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1081552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1082552f7358SJed Brown /* This is only 1-level */ 1083552f7358SJed Brown if (useCone) { 1084552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1085552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1086552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1087552f7358SJed Brown } else { 1088552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1089552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1090552f7358SJed Brown } 1091bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1092bfbcdd7aSMatthew G. Knepley if (*points) { 1093bfbcdd7aSMatthew G. Knepley closure = *points; 1094bfbcdd7aSMatthew G. Knepley } else { 1095bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1096bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1097bfbcdd7aSMatthew G. Knepley } 1098bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1099bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1100bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1101bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1102bfbcdd7aSMatthew G. Knepley } 1103bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1104bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1105bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1106bfbcdd7aSMatthew G. Knepley } 1107bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1108bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1109bfbcdd7aSMatthew G. Knepley if (*points) { 1110bfbcdd7aSMatthew G. Knepley closure = *points; 1111bfbcdd7aSMatthew G. Knepley } else { 1112bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1113bfbcdd7aSMatthew G. Knepley } 1114bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1115552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1116552f7358SJed Brown const PetscInt cp = tmp[t]; 1117552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1118552f7358SJed Brown 1119552f7358SJed Brown closure[closureSize] = cp; 1120552f7358SJed Brown closure[closureSize+1] = co; 1121552f7358SJed Brown fifo[fifoSize] = cp; 1122552f7358SJed Brown fifo[fifoSize+1] = co; 1123552f7358SJed Brown } 1124bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1125552f7358SJed Brown while (fifoSize - fifoStart) { 1126552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1127552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1128552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1129552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1130552f7358SJed Brown 1131552f7358SJed Brown if (useCone) { 1132552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1133552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1134552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1135552f7358SJed Brown } else { 1136552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1137552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 11380298fd71SBarry Smith tmpO = NULL; 1139552f7358SJed Brown } 1140552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1141552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1142552f7358SJed Brown const PetscInt cp = tmp[i]; 11432e1b13c2SMatthew 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. */ 11442e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 11452e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 11462e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1147552f7358SJed Brown PetscInt c; 1148552f7358SJed Brown 11492e1b13c2SMatthew G. Knepley if (rev) { 11502e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 11512e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 11522e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 11532e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 11542e1b13c2SMatthew G. Knepley } 1155552f7358SJed Brown /* Check for duplicate */ 1156552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1157552f7358SJed Brown if (closure[c] == cp) break; 1158552f7358SJed Brown } 1159552f7358SJed Brown if (c == closureSize) { 1160552f7358SJed Brown closure[closureSize] = cp; 1161552f7358SJed Brown closure[closureSize+1] = co; 1162552f7358SJed Brown fifo[fifoSize] = cp; 1163552f7358SJed Brown fifo[fifoSize+1] = co; 1164552f7358SJed Brown closureSize += 2; 1165552f7358SJed Brown fifoSize += 2; 1166552f7358SJed Brown } 1167552f7358SJed Brown } 1168552f7358SJed Brown fifoStart += 2; 1169552f7358SJed Brown } 1170552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1171552f7358SJed Brown if (points) *points = closure; 1172552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1173552f7358SJed Brown PetscFunctionReturn(0); 1174552f7358SJed Brown } 1175552f7358SJed Brown 1176552f7358SJed Brown #undef __FUNCT__ 11779bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 11789bf0dad6SMatthew G. Knepley /*@C 11799bf0dad6SMatthew 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 11809bf0dad6SMatthew G. Knepley 11819bf0dad6SMatthew G. Knepley Not collective 11829bf0dad6SMatthew G. Knepley 11839bf0dad6SMatthew G. Knepley Input Parameters: 11849bf0dad6SMatthew G. Knepley + mesh - The DMPlex 11859bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 11869bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 11879bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11889bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 11899bf0dad6SMatthew G. Knepley 11909bf0dad6SMatthew G. Knepley Output Parameters: 11919bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 11929bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 11939bf0dad6SMatthew G. Knepley 11949bf0dad6SMatthew G. Knepley Note: 11959bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 11969bf0dad6SMatthew G. Knepley 11979bf0dad6SMatthew G. Knepley Fortran Notes: 11989bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11999bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 12009bf0dad6SMatthew G. Knepley 12019bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12029bf0dad6SMatthew G. Knepley 12039bf0dad6SMatthew G. Knepley Level: beginner 12049bf0dad6SMatthew G. Knepley 12059bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 12069bf0dad6SMatthew G. Knepley @*/ 12079bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 12089bf0dad6SMatthew G. Knepley { 12099bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 12109bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 12119bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 12129bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 12139bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 12149bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 12159bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 12169bf0dad6SMatthew G. Knepley 12179bf0dad6SMatthew G. Knepley PetscFunctionBegin; 12189bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 12199bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 12209bf0dad6SMatthew G. Knepley /* This is only 1-level */ 12219bf0dad6SMatthew G. Knepley if (useCone) { 12229bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 12239bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 12249bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 12259bf0dad6SMatthew G. Knepley } else { 12269bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 12279bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 12289bf0dad6SMatthew G. Knepley } 12299bf0dad6SMatthew G. Knepley if (depth == 1) { 12309bf0dad6SMatthew G. Knepley if (*points) { 12319bf0dad6SMatthew G. Knepley closure = *points; 12329bf0dad6SMatthew G. Knepley } else { 12339bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 12349bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12359bf0dad6SMatthew G. Knepley } 12369bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12379bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 12389bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12399bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 12409bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 12419bf0dad6SMatthew G. Knepley } 12429bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 12439bf0dad6SMatthew G. Knepley if (points) *points = closure; 12449bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 12459bf0dad6SMatthew G. Knepley } 12469bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 12479bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 12489bf0dad6SMatthew G. Knepley if (*points) { 12499bf0dad6SMatthew G. Knepley closure = *points; 12509bf0dad6SMatthew G. Knepley } else { 12519bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12529bf0dad6SMatthew G. Knepley } 12539bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12549bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 12559bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12569bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 12579bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 12589bf0dad6SMatthew G. Knepley 12599bf0dad6SMatthew G. Knepley if (ornt < 0) { 12609bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 12619bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12629bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12639bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12649bf0dad6SMatthew G. Knepley } 12659bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 12669bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 12679bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 12689bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 12699bf0dad6SMatthew G. Knepley } 12709bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 12719bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 12729bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 12739bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 12749bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 12759bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 12769bf0dad6SMatthew G. Knepley 12779bf0dad6SMatthew G. Knepley if (useCone) { 12789bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 12799bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 12809bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 12819bf0dad6SMatthew G. Knepley } else { 12829bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 12839bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12849bf0dad6SMatthew G. Knepley tmpO = NULL; 12859bf0dad6SMatthew G. Knepley } 12869bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 12879bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 12889bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 12899bf0dad6SMatthew 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. */ 12909bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12919bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12929bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 12939bf0dad6SMatthew G. Knepley PetscInt c; 12949bf0dad6SMatthew G. Knepley 12959bf0dad6SMatthew G. Knepley if (rev) { 12969bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 12979bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12989bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12999bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13009bf0dad6SMatthew G. Knepley } 13019bf0dad6SMatthew G. Knepley /* Check for duplicate */ 13029bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 13039bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 13049bf0dad6SMatthew G. Knepley } 13059bf0dad6SMatthew G. Knepley if (c == closureSize) { 13069bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13079bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13089bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13099bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13109bf0dad6SMatthew G. Knepley closureSize += 2; 13119bf0dad6SMatthew G. Knepley fifoSize += 2; 13129bf0dad6SMatthew G. Knepley } 13139bf0dad6SMatthew G. Knepley } 13149bf0dad6SMatthew G. Knepley fifoStart += 2; 13159bf0dad6SMatthew G. Knepley } 13169bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13179bf0dad6SMatthew G. Knepley if (points) *points = closure; 13189bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13199bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13209bf0dad6SMatthew G. Knepley } 13219bf0dad6SMatthew G. Knepley 13229bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1323552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1324552f7358SJed Brown /*@C 1325552f7358SJed 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 1326552f7358SJed Brown 1327552f7358SJed Brown Not collective 1328552f7358SJed Brown 1329552f7358SJed Brown Input Parameters: 1330552f7358SJed Brown + mesh - The DMPlex 1331552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1332552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1333e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1334e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1335552f7358SJed Brown 1336552f7358SJed Brown Note: 13370298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1338552f7358SJed Brown 13393813dfbdSMatthew G Knepley Fortran Notes: 13403813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13413813dfbdSMatthew G Knepley include petsc.h90 in your code. 13423813dfbdSMatthew G Knepley 13433813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13443813dfbdSMatthew G Knepley 1345552f7358SJed Brown Level: beginner 1346552f7358SJed Brown 1347552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1348552f7358SJed Brown @*/ 1349552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1350552f7358SJed Brown { 1351552f7358SJed Brown PetscErrorCode ierr; 1352552f7358SJed Brown 1353552f7358SJed Brown PetscFunctionBegin; 1354552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1355e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1356e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1357552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 13584ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1359552f7358SJed Brown PetscFunctionReturn(0); 1360552f7358SJed Brown } 1361552f7358SJed Brown 1362552f7358SJed Brown #undef __FUNCT__ 1363552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1364552f7358SJed Brown /*@ 1365552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1366552f7358SJed Brown 1367552f7358SJed Brown Not collective 1368552f7358SJed Brown 1369552f7358SJed Brown Input Parameter: 1370552f7358SJed Brown . mesh - The DMPlex 1371552f7358SJed Brown 1372552f7358SJed Brown Output Parameters: 1373552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1374552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1375552f7358SJed Brown 1376552f7358SJed Brown Level: beginner 1377552f7358SJed Brown 1378552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1379552f7358SJed Brown @*/ 1380552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1381552f7358SJed Brown { 1382552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1383552f7358SJed Brown 1384552f7358SJed Brown PetscFunctionBegin; 1385552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1386552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1387552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1388552f7358SJed Brown PetscFunctionReturn(0); 1389552f7358SJed Brown } 1390552f7358SJed Brown 1391552f7358SJed Brown #undef __FUNCT__ 1392552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1393552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1394552f7358SJed Brown { 1395552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1396552f7358SJed Brown PetscInt size; 1397552f7358SJed Brown PetscErrorCode ierr; 1398552f7358SJed Brown 1399552f7358SJed Brown PetscFunctionBegin; 1400552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1401552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1402552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 14031795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 14041795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1405552f7358SJed Brown if (mesh->maxSupportSize) { 1406552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1407552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 14081795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1409552f7358SJed Brown } 1410552f7358SJed Brown PetscFunctionReturn(0); 1411552f7358SJed Brown } 1412552f7358SJed Brown 1413552f7358SJed Brown #undef __FUNCT__ 1414552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1415552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1416552f7358SJed Brown { 1417552f7358SJed Brown PetscErrorCode ierr; 1418552f7358SJed Brown 1419552f7358SJed Brown PetscFunctionBegin; 14204d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 14214d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1422552f7358SJed Brown PetscFunctionReturn(0); 1423552f7358SJed Brown } 1424552f7358SJed Brown 1425552f7358SJed Brown #undef __FUNCT__ 1426552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1427552f7358SJed Brown /*@ 1428552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1429552f7358SJed Brown 1430552f7358SJed Brown Not collective 1431552f7358SJed Brown 1432552f7358SJed Brown Input Parameter: 1433552f7358SJed Brown . mesh - The DMPlex 1434552f7358SJed Brown 1435552f7358SJed Brown Output Parameter: 1436552f7358SJed Brown 1437552f7358SJed Brown Note: 1438552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1439552f7358SJed Brown 1440552f7358SJed Brown Level: beginner 1441552f7358SJed Brown 1442552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1443552f7358SJed Brown @*/ 1444552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1445552f7358SJed Brown { 1446552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1447552f7358SJed Brown PetscInt *offsets; 1448552f7358SJed Brown PetscInt supportSize; 1449552f7358SJed Brown PetscInt pStart, pEnd, p; 1450552f7358SJed Brown PetscErrorCode ierr; 1451552f7358SJed Brown 1452552f7358SJed Brown PetscFunctionBegin; 1453552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 145482f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1455552f7358SJed Brown /* Calculate support sizes */ 1456552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1457552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1458552f7358SJed Brown PetscInt dof, off, c; 1459552f7358SJed Brown 1460552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1461552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1462552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1463552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1464552f7358SJed Brown } 1465552f7358SJed Brown } 1466552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1467552f7358SJed Brown PetscInt dof; 1468552f7358SJed Brown 1469552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 14700d644c17SKarl Rupp 1471552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1472552f7358SJed Brown } 1473552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1474552f7358SJed Brown /* Calculate supports */ 1475552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 14761795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 14771795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1478552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1479552f7358SJed Brown PetscInt dof, off, c; 1480552f7358SJed Brown 1481552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1482552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1483552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1484552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1485552f7358SJed Brown PetscInt offS; 1486552f7358SJed Brown 1487552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 14880d644c17SKarl Rupp 1489552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1490552f7358SJed Brown ++offsets[q]; 1491552f7358SJed Brown } 1492552f7358SJed Brown } 1493552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1494552f7358SJed Brown PetscFunctionReturn(0); 1495552f7358SJed Brown } 1496552f7358SJed Brown 1497552f7358SJed Brown #undef __FUNCT__ 1498552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1499552f7358SJed Brown /*@ 1500552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1501552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1502552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1503552f7358SJed Brown the DAG. 1504552f7358SJed Brown 1505552f7358SJed Brown Not collective 1506552f7358SJed Brown 1507552f7358SJed Brown Input Parameter: 1508552f7358SJed Brown . mesh - The DMPlex 1509552f7358SJed Brown 1510552f7358SJed Brown Output Parameter: 1511552f7358SJed Brown 1512552f7358SJed Brown Notes: 1513552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1514552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1515552f7358SJed Brown 1516552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1517552f7358SJed Brown 1518552f7358SJed Brown Level: beginner 1519552f7358SJed Brown 1520552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1521552f7358SJed Brown @*/ 1522552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1523552f7358SJed Brown { 1524aa50250dSMatthew G. Knepley DMLabel label; 1525552f7358SJed Brown PetscInt pStart, pEnd, p; 1526552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1527552f7358SJed Brown PetscErrorCode ierr; 1528552f7358SJed Brown 1529552f7358SJed Brown PetscFunctionBegin; 1530552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1531552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1532552f7358SJed Brown /* Calculate depth */ 1533aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1534aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1535aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1536552f7358SJed Brown /* Initialize roots and count leaves */ 1537552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1538552f7358SJed Brown PetscInt coneSize, supportSize; 1539552f7358SJed Brown 1540552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1541552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1542552f7358SJed Brown if (!coneSize && supportSize) { 1543552f7358SJed Brown ++numRoots; 1544aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1545552f7358SJed Brown } else if (!supportSize && coneSize) { 1546552f7358SJed Brown ++numLeaves; 1547552f7358SJed Brown } else if (!supportSize && !coneSize) { 1548552f7358SJed Brown /* Isolated points */ 1549aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1550552f7358SJed Brown } 1551552f7358SJed Brown } 1552552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1553552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1554552f7358SJed Brown PetscInt coneSize, supportSize; 1555552f7358SJed Brown 1556552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1557552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1558552f7358SJed Brown if (!supportSize && coneSize) { 1559aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1560552f7358SJed Brown } 1561552f7358SJed Brown } 1562552f7358SJed Brown } else { 156374ef644bSMatthew G. Knepley IS pointIS; 156474ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1565552f7358SJed Brown 156674ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 156774ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 156874ef644bSMatthew G. Knepley while (numPoints) { 156974ef644bSMatthew G. Knepley const PetscInt *points; 157074ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 157174ef644bSMatthew G. Knepley 157274ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 157374ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 157474ef644bSMatthew G. Knepley const PetscInt point = points[p]; 157574ef644bSMatthew G. Knepley const PetscInt *support; 157674ef644bSMatthew G. Knepley PetscInt supportSize, s; 157774ef644bSMatthew G. Knepley 157874ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 157974ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 158074ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 158174ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1582552f7358SJed Brown } 1583552f7358SJed Brown } 15845edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 158574ef644bSMatthew G. Knepley ++level; 158674ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 158774ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 158874ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 158974ef644bSMatthew G. Knepley else {numPoints = 0;} 159074ef644bSMatthew G. Knepley } 159174ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 159274ef644bSMatthew G. Knepley } 1593552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1594552f7358SJed Brown PetscFunctionReturn(0); 1595552f7358SJed Brown } 1596552f7358SJed Brown 1597552f7358SJed Brown #undef __FUNCT__ 1598552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1599552f7358SJed Brown /*@C 1600552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1601552f7358SJed Brown 1602552f7358SJed Brown Not Collective 1603552f7358SJed Brown 1604552f7358SJed Brown Input Parameters: 1605552f7358SJed Brown + dm - The DMPlex object 1606552f7358SJed Brown . numPoints - The number of input points for the join 1607552f7358SJed Brown - points - The input points 1608552f7358SJed Brown 1609552f7358SJed Brown Output Parameters: 1610552f7358SJed Brown + numCoveredPoints - The number of points in the join 1611552f7358SJed Brown - coveredPoints - The points in the join 1612552f7358SJed Brown 1613552f7358SJed Brown Level: intermediate 1614552f7358SJed Brown 1615552f7358SJed Brown Note: Currently, this is restricted to a single level join 1616552f7358SJed Brown 16173813dfbdSMatthew G Knepley Fortran Notes: 16183813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16193813dfbdSMatthew G Knepley include petsc.h90 in your code. 16203813dfbdSMatthew G Knepley 16213813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16223813dfbdSMatthew G Knepley 1623552f7358SJed Brown .keywords: mesh 1624552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1625552f7358SJed Brown @*/ 1626552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1627552f7358SJed Brown { 1628552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1629552f7358SJed Brown PetscInt *join[2]; 1630552f7358SJed Brown PetscInt joinSize, i = 0; 1631552f7358SJed Brown PetscInt dof, off, p, c, m; 1632552f7358SJed Brown PetscErrorCode ierr; 1633552f7358SJed Brown 1634552f7358SJed Brown PetscFunctionBegin; 1635552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1636552f7358SJed Brown PetscValidPointer(points, 2); 1637552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1638552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1639552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1640552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1641552f7358SJed Brown /* Copy in support of first point */ 1642552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1643552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1644552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1645552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1646552f7358SJed Brown } 1647552f7358SJed Brown /* Check each successive support */ 1648552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1649552f7358SJed Brown PetscInt newJoinSize = 0; 1650552f7358SJed Brown 1651552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1652552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1653552f7358SJed Brown for (c = 0; c < dof; ++c) { 1654552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1655552f7358SJed Brown 1656552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1657552f7358SJed Brown if (point == join[i][m]) { 1658552f7358SJed Brown join[1-i][newJoinSize++] = point; 1659552f7358SJed Brown break; 1660552f7358SJed Brown } 1661552f7358SJed Brown } 1662552f7358SJed Brown } 1663552f7358SJed Brown joinSize = newJoinSize; 1664552f7358SJed Brown i = 1-i; 1665552f7358SJed Brown } 1666552f7358SJed Brown *numCoveredPoints = joinSize; 1667552f7358SJed Brown *coveredPoints = join[i]; 1668552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1669552f7358SJed Brown PetscFunctionReturn(0); 1670552f7358SJed Brown } 1671552f7358SJed Brown 1672552f7358SJed Brown #undef __FUNCT__ 1673552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1674552f7358SJed Brown /*@C 1675552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1676552f7358SJed Brown 1677552f7358SJed Brown Not Collective 1678552f7358SJed Brown 1679552f7358SJed Brown Input Parameters: 1680552f7358SJed Brown + dm - The DMPlex object 1681552f7358SJed Brown . numPoints - The number of input points for the join 1682552f7358SJed Brown - points - The input points 1683552f7358SJed Brown 1684552f7358SJed Brown Output Parameters: 1685552f7358SJed Brown + numCoveredPoints - The number of points in the join 1686552f7358SJed Brown - coveredPoints - The points in the join 1687552f7358SJed Brown 16883813dfbdSMatthew G Knepley Fortran Notes: 16893813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16903813dfbdSMatthew G Knepley include petsc.h90 in your code. 16913813dfbdSMatthew G Knepley 16923813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16933813dfbdSMatthew G Knepley 1694552f7358SJed Brown Level: intermediate 1695552f7358SJed Brown 1696552f7358SJed Brown .keywords: mesh 1697552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1698552f7358SJed Brown @*/ 1699552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1700552f7358SJed Brown { 1701552f7358SJed Brown PetscErrorCode ierr; 1702552f7358SJed Brown 1703552f7358SJed Brown PetscFunctionBegin; 1704552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1705d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1706d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1707d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1708552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1709d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1710552f7358SJed Brown PetscFunctionReturn(0); 1711552f7358SJed Brown } 1712552f7358SJed Brown 1713552f7358SJed Brown #undef __FUNCT__ 1714552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1715552f7358SJed Brown /*@C 1716552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1717552f7358SJed Brown 1718552f7358SJed Brown Not Collective 1719552f7358SJed Brown 1720552f7358SJed Brown Input Parameters: 1721552f7358SJed Brown + dm - The DMPlex object 1722552f7358SJed Brown . numPoints - The number of input points for the join 1723552f7358SJed Brown - points - The input points 1724552f7358SJed Brown 1725552f7358SJed Brown Output Parameters: 1726552f7358SJed Brown + numCoveredPoints - The number of points in the join 1727552f7358SJed Brown - coveredPoints - The points in the join 1728552f7358SJed Brown 17293813dfbdSMatthew G Knepley Fortran Notes: 17303813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17313813dfbdSMatthew G Knepley include petsc.h90 in your code. 17323813dfbdSMatthew G Knepley 17333813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17343813dfbdSMatthew G Knepley 1735552f7358SJed Brown Level: intermediate 1736552f7358SJed Brown 1737552f7358SJed Brown .keywords: mesh 1738552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1739552f7358SJed Brown @*/ 1740552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1741552f7358SJed Brown { 1742552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1743552f7358SJed Brown PetscInt *offsets, **closures; 1744552f7358SJed Brown PetscInt *join[2]; 1745552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1746552f7358SJed Brown PetscInt p, d, c, m; 1747552f7358SJed Brown PetscErrorCode ierr; 1748552f7358SJed Brown 1749552f7358SJed Brown PetscFunctionBegin; 1750552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1751552f7358SJed Brown PetscValidPointer(points, 2); 1752552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1753552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1754552f7358SJed Brown 1755552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 17561795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1757552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1758e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1759552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1760552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1761552f7358SJed Brown 1762552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1763552f7358SJed Brown PetscInt closureSize; 1764552f7358SJed Brown 1765552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 17660d644c17SKarl Rupp 1767552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1768552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1769552f7358SJed Brown PetscInt pStart, pEnd, i; 1770552f7358SJed Brown 1771552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1772552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1773552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1774552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1775552f7358SJed Brown break; 1776552f7358SJed Brown } 1777552f7358SJed Brown } 1778552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1779552f7358SJed Brown } 178082f516ccSBarry 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); 1781552f7358SJed Brown } 1782552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1783552f7358SJed Brown PetscInt dof; 1784552f7358SJed Brown 1785552f7358SJed Brown /* Copy in support of first point */ 1786552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1787552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1788552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1789552f7358SJed Brown } 1790552f7358SJed Brown /* Check each successive cone */ 1791552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1792552f7358SJed Brown PetscInt newJoinSize = 0; 1793552f7358SJed Brown 1794552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1795552f7358SJed Brown for (c = 0; c < dof; ++c) { 1796552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1797552f7358SJed Brown 1798552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1799552f7358SJed Brown if (point == join[i][m]) { 1800552f7358SJed Brown join[1-i][newJoinSize++] = point; 1801552f7358SJed Brown break; 1802552f7358SJed Brown } 1803552f7358SJed Brown } 1804552f7358SJed Brown } 1805552f7358SJed Brown joinSize = newJoinSize; 1806552f7358SJed Brown i = 1-i; 1807552f7358SJed Brown } 1808552f7358SJed Brown if (joinSize) break; 1809552f7358SJed Brown } 1810552f7358SJed Brown *numCoveredPoints = joinSize; 1811552f7358SJed Brown *coveredPoints = join[i]; 1812552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 18130298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1814552f7358SJed Brown } 1815552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1816552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1817552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1818552f7358SJed Brown PetscFunctionReturn(0); 1819552f7358SJed Brown } 1820552f7358SJed Brown 1821552f7358SJed Brown #undef __FUNCT__ 1822552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1823552f7358SJed Brown /*@C 1824552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1825552f7358SJed Brown 1826552f7358SJed Brown Not Collective 1827552f7358SJed Brown 1828552f7358SJed Brown Input Parameters: 1829552f7358SJed Brown + dm - The DMPlex object 1830552f7358SJed Brown . numPoints - The number of input points for the meet 1831552f7358SJed Brown - points - The input points 1832552f7358SJed Brown 1833552f7358SJed Brown Output Parameters: 1834552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1835552f7358SJed Brown - coveredPoints - The points in the meet 1836552f7358SJed Brown 1837552f7358SJed Brown Level: intermediate 1838552f7358SJed Brown 1839552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1840552f7358SJed Brown 18413813dfbdSMatthew G Knepley Fortran Notes: 18423813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18433813dfbdSMatthew G Knepley include petsc.h90 in your code. 18443813dfbdSMatthew G Knepley 18453813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18463813dfbdSMatthew G Knepley 1847552f7358SJed Brown .keywords: mesh 1848552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1849552f7358SJed Brown @*/ 1850552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1851552f7358SJed Brown { 1852552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1853552f7358SJed Brown PetscInt *meet[2]; 1854552f7358SJed Brown PetscInt meetSize, i = 0; 1855552f7358SJed Brown PetscInt dof, off, p, c, m; 1856552f7358SJed Brown PetscErrorCode ierr; 1857552f7358SJed Brown 1858552f7358SJed Brown PetscFunctionBegin; 1859552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1860552f7358SJed Brown PetscValidPointer(points, 2); 1861552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1862552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1863552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1864552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1865552f7358SJed Brown /* Copy in cone of first point */ 1866552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1867552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1868552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1869552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1870552f7358SJed Brown } 1871552f7358SJed Brown /* Check each successive cone */ 1872552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1873552f7358SJed Brown PetscInt newMeetSize = 0; 1874552f7358SJed Brown 1875552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1876552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1877552f7358SJed Brown for (c = 0; c < dof; ++c) { 1878552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1879552f7358SJed Brown 1880552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1881552f7358SJed Brown if (point == meet[i][m]) { 1882552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1883552f7358SJed Brown break; 1884552f7358SJed Brown } 1885552f7358SJed Brown } 1886552f7358SJed Brown } 1887552f7358SJed Brown meetSize = newMeetSize; 1888552f7358SJed Brown i = 1-i; 1889552f7358SJed Brown } 1890552f7358SJed Brown *numCoveringPoints = meetSize; 1891552f7358SJed Brown *coveringPoints = meet[i]; 1892552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 1893552f7358SJed Brown PetscFunctionReturn(0); 1894552f7358SJed Brown } 1895552f7358SJed Brown 1896552f7358SJed Brown #undef __FUNCT__ 1897552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 1898552f7358SJed Brown /*@C 1899552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 1900552f7358SJed Brown 1901552f7358SJed Brown Not Collective 1902552f7358SJed Brown 1903552f7358SJed Brown Input Parameters: 1904552f7358SJed Brown + dm - The DMPlex object 1905552f7358SJed Brown . numPoints - The number of input points for the meet 1906552f7358SJed Brown - points - The input points 1907552f7358SJed Brown 1908552f7358SJed Brown Output Parameters: 1909552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1910552f7358SJed Brown - coveredPoints - The points in the meet 1911552f7358SJed Brown 1912552f7358SJed Brown Level: intermediate 1913552f7358SJed Brown 19143813dfbdSMatthew G Knepley Fortran Notes: 19153813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19163813dfbdSMatthew G Knepley include petsc.h90 in your code. 19173813dfbdSMatthew G Knepley 19183813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19193813dfbdSMatthew G Knepley 1920552f7358SJed Brown .keywords: mesh 1921552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 1922552f7358SJed Brown @*/ 1923552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1924552f7358SJed Brown { 1925552f7358SJed Brown PetscErrorCode ierr; 1926552f7358SJed Brown 1927552f7358SJed Brown PetscFunctionBegin; 1928552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1929d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1930d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1931d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 1932552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1933d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1934552f7358SJed Brown PetscFunctionReturn(0); 1935552f7358SJed Brown } 1936552f7358SJed Brown 1937552f7358SJed Brown #undef __FUNCT__ 1938552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 1939552f7358SJed Brown /*@C 1940552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 1941552f7358SJed Brown 1942552f7358SJed Brown Not Collective 1943552f7358SJed Brown 1944552f7358SJed Brown Input Parameters: 1945552f7358SJed Brown + dm - The DMPlex object 1946552f7358SJed Brown . numPoints - The number of input points for the meet 1947552f7358SJed Brown - points - The input points 1948552f7358SJed Brown 1949552f7358SJed Brown Output Parameters: 1950552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1951552f7358SJed Brown - coveredPoints - The points in the meet 1952552f7358SJed Brown 1953552f7358SJed Brown Level: intermediate 1954552f7358SJed Brown 19553813dfbdSMatthew G Knepley Fortran Notes: 19563813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19573813dfbdSMatthew G Knepley include petsc.h90 in your code. 19583813dfbdSMatthew G Knepley 19593813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19603813dfbdSMatthew G Knepley 1961552f7358SJed Brown .keywords: mesh 1962552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 1963552f7358SJed Brown @*/ 1964552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1965552f7358SJed Brown { 1966552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1967552f7358SJed Brown PetscInt *offsets, **closures; 1968552f7358SJed Brown PetscInt *meet[2]; 1969552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 1970552f7358SJed Brown PetscInt p, h, c, m; 1971552f7358SJed Brown PetscErrorCode ierr; 1972552f7358SJed Brown 1973552f7358SJed Brown PetscFunctionBegin; 1974552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1975552f7358SJed Brown PetscValidPointer(points, 2); 1976552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1977552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1978552f7358SJed Brown 1979552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 1980785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 1981552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1982e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 1983552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1984552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1985552f7358SJed Brown 1986552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1987552f7358SJed Brown PetscInt closureSize; 1988552f7358SJed Brown 1989552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 19900d644c17SKarl Rupp 1991552f7358SJed Brown offsets[p*(height+2)+0] = 0; 1992552f7358SJed Brown for (h = 0; h < height+1; ++h) { 1993552f7358SJed Brown PetscInt pStart, pEnd, i; 1994552f7358SJed Brown 1995552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 1996552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 1997552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1998552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 1999552f7358SJed Brown break; 2000552f7358SJed Brown } 2001552f7358SJed Brown } 2002552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2003552f7358SJed Brown } 200482f516ccSBarry 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); 2005552f7358SJed Brown } 2006552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2007552f7358SJed Brown PetscInt dof; 2008552f7358SJed Brown 2009552f7358SJed Brown /* Copy in cone of first point */ 2010552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2011552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2012552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2013552f7358SJed Brown } 2014552f7358SJed Brown /* Check each successive cone */ 2015552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2016552f7358SJed Brown PetscInt newMeetSize = 0; 2017552f7358SJed Brown 2018552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2019552f7358SJed Brown for (c = 0; c < dof; ++c) { 2020552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2021552f7358SJed Brown 2022552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2023552f7358SJed Brown if (point == meet[i][m]) { 2024552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2025552f7358SJed Brown break; 2026552f7358SJed Brown } 2027552f7358SJed Brown } 2028552f7358SJed Brown } 2029552f7358SJed Brown meetSize = newMeetSize; 2030552f7358SJed Brown i = 1-i; 2031552f7358SJed Brown } 2032552f7358SJed Brown if (meetSize) break; 2033552f7358SJed Brown } 2034552f7358SJed Brown *numCoveredPoints = meetSize; 2035552f7358SJed Brown *coveredPoints = meet[i]; 2036552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20370298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2038552f7358SJed Brown } 2039552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2040552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2041552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2042552f7358SJed Brown PetscFunctionReturn(0); 2043552f7358SJed Brown } 2044552f7358SJed Brown 2045552f7358SJed Brown #undef __FUNCT__ 20464e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 20474e3744c5SMatthew G. Knepley /*@C 20484e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 20494e3744c5SMatthew G. Knepley 20504e3744c5SMatthew G. Knepley Not Collective 20514e3744c5SMatthew G. Knepley 20524e3744c5SMatthew G. Knepley Input Parameters: 20534e3744c5SMatthew G. Knepley + dmA - A DMPlex object 20544e3744c5SMatthew G. Knepley - dmB - A DMPlex object 20554e3744c5SMatthew G. Knepley 20564e3744c5SMatthew G. Knepley Output Parameters: 20574e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 20584e3744c5SMatthew G. Knepley 20594e3744c5SMatthew G. Knepley Level: intermediate 20604e3744c5SMatthew G. Knepley 20614e3744c5SMatthew G. Knepley Notes: 20624e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 20634e3744c5SMatthew G. Knepley 20644e3744c5SMatthew G. Knepley .keywords: mesh 20654e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 20664e3744c5SMatthew G. Knepley @*/ 20674e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 20684e3744c5SMatthew G. Knepley { 20694e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 20704e3744c5SMatthew G. Knepley PetscErrorCode ierr; 20714e3744c5SMatthew G. Knepley 20724e3744c5SMatthew G. Knepley PetscFunctionBegin; 20734e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 20744e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 20754e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 20764e3744c5SMatthew G. Knepley 20774e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 20784e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 20794e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 20804e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 20814e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 20824e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 20834e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 20844e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 20854e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 20864e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 20874e3744c5SMatthew G. Knepley 20884e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 20894e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 20904e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 20914e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 20924e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 20934e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 20944e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 20954e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 20964e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 20974e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 20984e3744c5SMatthew G. Knepley } 20994e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 21004e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 21014e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 21024e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 21034e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 21044e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 21054e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 21064e3744c5SMatthew G. Knepley } 21074e3744c5SMatthew G. Knepley } 21084e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 21094e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 21104e3744c5SMatthew G. Knepley } 21114e3744c5SMatthew G. Knepley 21124e3744c5SMatthew G. Knepley #undef __FUNCT__ 211318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 211418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2115a6dfd86eSKarl Rupp { 211682f516ccSBarry Smith MPI_Comm comm; 2117552f7358SJed Brown PetscErrorCode ierr; 2118552f7358SJed Brown 2119552f7358SJed Brown PetscFunctionBegin; 212082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2121552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2122552f7358SJed Brown switch (cellDim) { 2123552f7358SJed Brown case 0: 2124552f7358SJed Brown *numFaceVertices = 0; 2125552f7358SJed Brown break; 2126552f7358SJed Brown case 1: 2127552f7358SJed Brown *numFaceVertices = 1; 2128552f7358SJed Brown break; 2129552f7358SJed Brown case 2: 2130552f7358SJed Brown switch (numCorners) { 213119436ca2SJed Brown case 3: /* triangle */ 213219436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2133552f7358SJed Brown break; 213419436ca2SJed Brown case 4: /* quadrilateral */ 213519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2136552f7358SJed Brown break; 213719436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 213819436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2139552f7358SJed Brown break; 214019436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 214119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2142552f7358SJed Brown break; 2143552f7358SJed Brown default: 2144552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2145552f7358SJed Brown } 2146552f7358SJed Brown break; 2147552f7358SJed Brown case 3: 2148552f7358SJed Brown switch (numCorners) { 214919436ca2SJed Brown case 4: /* tetradehdron */ 215019436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2151552f7358SJed Brown break; 215219436ca2SJed Brown case 6: /* tet cohesive cells */ 215319436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2154552f7358SJed Brown break; 215519436ca2SJed Brown case 8: /* hexahedron */ 215619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2157552f7358SJed Brown break; 215819436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 215919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2160552f7358SJed Brown break; 216119436ca2SJed Brown case 10: /* quadratic tetrahedron */ 216219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2163552f7358SJed Brown break; 216419436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 216519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2166552f7358SJed Brown break; 216719436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 216819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2169552f7358SJed Brown break; 217019436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 217119436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2172552f7358SJed Brown break; 2173552f7358SJed Brown default: 2174552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2175552f7358SJed Brown } 2176552f7358SJed Brown break; 2177552f7358SJed Brown default: 2178552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2179552f7358SJed Brown } 2180552f7358SJed Brown PetscFunctionReturn(0); 2181552f7358SJed Brown } 2182552f7358SJed Brown 2183552f7358SJed Brown #undef __FUNCT__ 2184d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2185d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2186d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2187d27a0f52SMatthew G. Knepley { 2188a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2189a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2190a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2191d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2192d27a0f52SMatthew G. Knepley 2193d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2194d27a0f52SMatthew G. Knepley /* Truth Table 2195d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2196d27a0f52SMatthew G. Knepley F 0 flips no F F F 2197d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2198d27a0f52SMatthew G. Knepley F 2 flips no T F T 2199d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2200d27a0f52SMatthew G. Knepley T 1 flip no 2201d27a0f52SMatthew G. Knepley T 2 flips yes 2202d27a0f52SMatthew G. Knepley */ 2203a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2204d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2205a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2206d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2207a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2208a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2209a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2210a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2211a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2212a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2213785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2214a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2215a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2216defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2217a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2218a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2219a1b4d4a2SMatthew G. Knepley 2220a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2221a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2222a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2223a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2224a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2225a1b4d4a2SMatthew G. Knepley } 2226a1b4d4a2SMatthew G. Knepley } 2227a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2228a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2229d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2230a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2231d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2232d27a0f52SMatthew G. Knepley 2233a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2234a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2235a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2236d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2237d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2238a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 223986cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2240a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 224186cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2242d27a0f52SMatthew G. Knepley 2243d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2244d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2245d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2246d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2247d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2248d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2249a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2250a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2251a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2252a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2253a1b4d4a2SMatthew G. Knepley } 2254a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2255a1b4d4a2SMatthew 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); 2256a1b4d4a2SMatthew G. Knepley } 2257a1b4d4a2SMatthew 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]); 2258a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2259a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2260a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2261a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2262a1b4d4a2SMatthew G. Knepley } 2263a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2264a1b4d4a2SMatthew 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); 2265a1b4d4a2SMatthew G. Knepley } 2266a1b4d4a2SMatthew 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]); 2267d27a0f52SMatthew G. Knepley 2268d27a0f52SMatthew G. Knepley if (dim == 1) { 2269d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2270d27a0f52SMatthew G. Knepley } else { 2271d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2272d27a0f52SMatthew G. Knepley } 2273d27a0f52SMatthew G. Knepley 2274d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2275d27a0f52SMatthew 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]); 2276d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2277a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2278d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2279a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2280d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 228186cff514SMatthew 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"); 2282a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2283a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2284d27a0f52SMatthew G. Knepley } 2285a1b4d4a2SMatthew G. Knepley 2286d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2287d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2288d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2289a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2290f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2291f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2292d27a0f52SMatthew G. Knepley 2293a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2294a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2295a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2296a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2297a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2298a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2299a1b4d4a2SMatthew G. Knepley 2300a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2301a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2302a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2303d27a0f52SMatthew G. Knepley } 2304a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2305a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2306f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2307f4e909fcSMatthew G. Knepley faceSize = coneSize; 2308f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2309f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2310f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2311f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2312f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2313f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2314f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2315f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2316f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2317f4e909fcSMatthew G. Knepley } 2318f4e909fcSMatthew G. Knepley } 2319d27a0f52SMatthew G. Knepley } 2320d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2321d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2322d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2323a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2324a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2325a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2326d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2327d27a0f52SMatthew G. Knepley } 2328d27a0f52SMatthew G. Knepley 2329d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2330cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal" 2331cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[]) 2332cb1e1211SMatthew G Knepley { 2333cb1e1211SMatthew G Knepley const PetscInt *support = NULL; 2334cb1e1211SMatthew G Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, supportSize, s; 2335cb1e1211SMatthew G Knepley PetscErrorCode ierr; 2336cb1e1211SMatthew G Knepley 2337cb1e1211SMatthew G Knepley PetscFunctionBegin; 2338cb1e1211SMatthew G Knepley if (useClosure) { 2339cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr); 2340cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr); 2341cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2342cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2343cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2344cb1e1211SMatthew G Knepley 2345cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2346cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr); 2347cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2348cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2349cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2350cb1e1211SMatthew G Knepley } 2351cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2352cb1e1211SMatthew G Knepley } 2353cb1e1211SMatthew G Knepley } 2354cb1e1211SMatthew G Knepley } else { 2355cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 2356cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 2357cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2358cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2359cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2360cb1e1211SMatthew G Knepley 2361cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2362cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2363cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2364cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2365cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2366cb1e1211SMatthew G Knepley } 2367cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2368cb1e1211SMatthew G Knepley } 2369cb1e1211SMatthew G Knepley } 2370cb1e1211SMatthew G Knepley } 2371cb1e1211SMatthew G Knepley *adjSize = numAdj; 2372cb1e1211SMatthew G Knepley PetscFunctionReturn(0); 2373cb1e1211SMatthew G Knepley } 2374cb1e1211SMatthew G Knepley 2375cb1e1211SMatthew G Knepley #undef __FUNCT__ 2376552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR" 237777c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency) 23780adebc6cSBarry Smith { 2379552f7358SJed Brown const PetscInt maxFaceCases = 30; 2380552f7358SJed Brown PetscInt numFaceCases = 0; 2381552f7358SJed Brown PetscInt numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */ 2382552f7358SJed Brown PetscInt *off, *adj; 2383552f7358SJed Brown PetscInt *neighborCells, *tmpClosure; 2384552f7358SJed Brown PetscInt maxConeSize, maxSupportSize, maxClosure, maxNeighbors; 238577c88f5bSMatthew G Knepley PetscInt dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell; 2386552f7358SJed Brown PetscErrorCode ierr; 2387552f7358SJed Brown 2388552f7358SJed Brown PetscFunctionBegin; 2389552f7358SJed Brown /* For parallel partitioning, I think you have to communicate supports */ 2390552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 239177c88f5bSMatthew G Knepley cellDim = dim - cellHeight; 2392552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 239377c88f5bSMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 2394552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 2395552f7358SJed Brown if (cEnd - cStart == 0) { 2396552f7358SJed Brown if (numVertices) *numVertices = 0; 23970298fd71SBarry Smith if (offsets) *offsets = NULL; 23980298fd71SBarry Smith if (adjacency) *adjacency = NULL; 2399552f7358SJed Brown PetscFunctionReturn(0); 2400552f7358SJed Brown } 2401552f7358SJed Brown numCells = cEnd - cStart; 240277c88f5bSMatthew G Knepley faceDepth = depth - cellHeight; 24030d957afbSMatthew G. Knepley if (dim == depth) { 2404e430e843SMatthew G. Knepley PetscInt f, fStart, fEnd; 2405e430e843SMatthew G. Knepley 24061795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2407e430e843SMatthew G. Knepley /* Count neighboring cells */ 2408e430e843SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 2409e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2410e430e843SMatthew G. Knepley const PetscInt *support; 2411e430e843SMatthew G. Knepley PetscInt supportSize; 2412e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2413e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2414e430e843SMatthew G. Knepley if (supportSize == 2) { 2415e430e843SMatthew G. Knepley ++off[support[0]-cStart+1]; 2416e430e843SMatthew G. Knepley ++off[support[1]-cStart+1]; 2417e430e843SMatthew G. Knepley } 2418e430e843SMatthew G. Knepley } 2419e430e843SMatthew G. Knepley /* Prefix sum */ 2420e430e843SMatthew G. Knepley for (c = 1; c <= numCells; ++c) off[c] += off[c-1]; 2421e430e843SMatthew G. Knepley if (adjacency) { 2422e430e843SMatthew G. Knepley PetscInt *tmp; 2423e430e843SMatthew G. Knepley 2424785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2425785e854fSJed Brown ierr = PetscMalloc1((numCells+1), &tmp);CHKERRQ(ierr); 2426e430e843SMatthew G. Knepley ierr = PetscMemcpy(tmp, off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr); 2427e430e843SMatthew G. Knepley /* Get neighboring cells */ 2428e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2429e430e843SMatthew G. Knepley const PetscInt *support; 2430e430e843SMatthew G. Knepley PetscInt supportSize; 2431e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2432e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2433e430e843SMatthew G. Knepley if (supportSize == 2) { 2434e430e843SMatthew G. Knepley adj[tmp[support[0]-cStart]++] = support[1]; 2435e430e843SMatthew G. Knepley adj[tmp[support[1]-cStart]++] = support[0]; 2436e430e843SMatthew G. Knepley } 2437e430e843SMatthew G. Knepley } 2438e430e843SMatthew G. Knepley #if defined(PETSC_USE_DEBUG) 24390d957afbSMatthew 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); 2440e430e843SMatthew G. Knepley #endif 2441e430e843SMatthew G. Knepley ierr = PetscFree(tmp);CHKERRQ(ierr); 2442e430e843SMatthew G. Knepley } 2443e430e843SMatthew G. Knepley if (numVertices) *numVertices = numCells; 2444e430e843SMatthew G. Knepley if (offsets) *offsets = off; 2445e430e843SMatthew G. Knepley if (adjacency) *adjacency = adj; 2446e430e843SMatthew G. Knepley PetscFunctionReturn(0); 2447e430e843SMatthew G. Knepley } 2448552f7358SJed Brown /* Setup face recognition */ 244977c88f5bSMatthew G Knepley if (faceDepth == 1) { 2450552f7358SJed 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 */ 2451552f7358SJed Brown 2452552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2453552f7358SJed Brown PetscInt corners; 2454552f7358SJed Brown 2455552f7358SJed Brown ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr); 2456552f7358SJed Brown if (!cornersSeen[corners]) { 2457552f7358SJed Brown PetscInt nFV; 2458552f7358SJed Brown 245982f516ccSBarry Smith if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases"); 2460552f7358SJed Brown cornersSeen[corners] = 1; 24610d644c17SKarl Rupp 246218ad9376SMatthew G. Knepley ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr); 24630d644c17SKarl Rupp 2464552f7358SJed Brown numFaceVertices[numFaceCases++] = nFV; 2465552f7358SJed Brown } 2466552f7358SJed Brown } 2467552f7358SJed Brown } 2468e7b80042SMatthew G. Knepley maxClosure = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1)); 2469e7b80042SMatthew G. Knepley maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1); 2470dcca6d9dSJed Brown ierr = PetscMalloc2(maxNeighbors,&neighborCells,maxClosure,&tmpClosure);CHKERRQ(ierr); 24711795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2472552f7358SJed Brown /* Count neighboring cells */ 2473552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2474552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2475552f7358SJed Brown 2476cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2477552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2478552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 24794d25b1e8SKarl Rupp PetscInt cellPair[2]; 248077c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2481552f7358SJed Brown PetscInt meetSize = 0; 24820298fd71SBarry Smith const PetscInt *meet = NULL; 2483552f7358SJed Brown 24844d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2485552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2486552f7358SJed Brown if (!found) { 2487552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2488552f7358SJed Brown if (meetSize) { 2489552f7358SJed Brown PetscInt f; 2490552f7358SJed Brown 2491552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2492552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2493552f7358SJed Brown found = PETSC_TRUE; 2494552f7358SJed Brown break; 2495552f7358SJed Brown } 2496552f7358SJed Brown } 2497552f7358SJed Brown } 2498552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2499552f7358SJed Brown } 25000d644c17SKarl Rupp if (found) ++off[cell-cStart+1]; 2501552f7358SJed Brown } 2502552f7358SJed Brown } 2503552f7358SJed Brown /* Prefix sum */ 25040d644c17SKarl Rupp for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1]; 25050d644c17SKarl Rupp 2506552f7358SJed Brown if (adjacency) { 2507785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2508552f7358SJed Brown /* Get neighboring cells */ 2509552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2510552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2511552f7358SJed Brown PetscInt cellOffset = 0; 2512552f7358SJed Brown 2513cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2514552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2515552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 25164d25b1e8SKarl Rupp PetscInt cellPair[2]; 251777c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2518552f7358SJed Brown PetscInt meetSize = 0; 25190298fd71SBarry Smith const PetscInt *meet = NULL; 2520552f7358SJed Brown 25214d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2522552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2523552f7358SJed Brown if (!found) { 2524552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2525552f7358SJed Brown if (meetSize) { 2526552f7358SJed Brown PetscInt f; 2527552f7358SJed Brown 2528552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2529552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2530552f7358SJed Brown found = PETSC_TRUE; 2531552f7358SJed Brown break; 2532552f7358SJed Brown } 2533552f7358SJed Brown } 2534552f7358SJed Brown } 2535552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2536552f7358SJed Brown } 2537552f7358SJed Brown if (found) { 2538552f7358SJed Brown adj[off[cell-cStart]+cellOffset] = neighborCells[n]; 2539552f7358SJed Brown ++cellOffset; 2540552f7358SJed Brown } 2541552f7358SJed Brown } 2542552f7358SJed Brown } 2543552f7358SJed Brown } 2544552f7358SJed Brown ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr); 2545552f7358SJed Brown if (numVertices) *numVertices = numCells; 2546552f7358SJed Brown if (offsets) *offsets = off; 2547552f7358SJed Brown if (adjacency) *adjacency = adj; 2548552f7358SJed Brown PetscFunctionReturn(0); 2549552f7358SJed Brown } 2550552f7358SJed Brown 2551519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2552519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2553552f7358SJed Brown #include <unistd.h> 2554552f7358SJed Brown #endif 2555552f7358SJed Brown /* Chaco does not have an include file */ 255639d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts, 2557552f7358SJed Brown float *ewgts, float *x, float *y, float *z, char *outassignname, 2558552f7358SJed Brown char *outfilename, short *assignment, int architecture, int ndims_tot, 2559552f7358SJed Brown int mesh_dims[3], double *goal, int global_method, int local_method, 2560552f7358SJed Brown int rqi_flag, int vmax, int ndims, double eigtol, long seed); 2561552f7358SJed Brown 2562552f7358SJed Brown extern int FREE_GRAPH; 2563552f7358SJed Brown 2564552f7358SJed Brown #undef __FUNCT__ 2565552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco" 2566552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2567552f7358SJed Brown { 2568552f7358SJed Brown enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3}; 256982f516ccSBarry Smith MPI_Comm comm; 2570552f7358SJed Brown int nvtxs = numVertices; /* number of vertices in full graph */ 2571552f7358SJed Brown int *vwgts = NULL; /* weights for all vertices */ 2572552f7358SJed Brown float *ewgts = NULL; /* weights for all edges */ 2573552f7358SJed Brown float *x = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */ 2574552f7358SJed Brown char *outassignname = NULL; /* name of assignment output file */ 2575552f7358SJed Brown char *outfilename = NULL; /* output file name */ 2576552f7358SJed Brown int architecture = 1; /* 0 => hypercube, d => d-dimensional mesh */ 2577552f7358SJed Brown int ndims_tot = 0; /* total number of cube dimensions to divide */ 2578552f7358SJed Brown int mesh_dims[3]; /* dimensions of mesh of processors */ 2579552f7358SJed Brown double *goal = NULL; /* desired set sizes for each set */ 2580552f7358SJed Brown int global_method = 1; /* global partitioning algorithm */ 2581552f7358SJed Brown int local_method = 1; /* local partitioning algorithm */ 2582552f7358SJed Brown int rqi_flag = 0; /* should I use RQI/Symmlq eigensolver? */ 2583552f7358SJed Brown int vmax = 200; /* how many vertices to coarsen down to? */ 2584552f7358SJed Brown int ndims = 1; /* number of eigenvectors (2^d sets) */ 2585552f7358SJed Brown double eigtol = 0.001; /* tolerance on eigenvectors */ 2586552f7358SJed Brown long seed = 123636512; /* for random graph mutations */ 2587552f7358SJed Brown short int *assignment; /* Output partition */ 2588552f7358SJed Brown int fd_stdout, fd_pipe[2]; 2589552f7358SJed Brown PetscInt *points; 2590552f7358SJed Brown PetscMPIInt commSize; 2591552f7358SJed Brown int i, v, p; 2592552f7358SJed Brown PetscErrorCode ierr; 2593552f7358SJed Brown 2594552f7358SJed Brown PetscFunctionBegin; 259582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2596552f7358SJed Brown ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 2597552f7358SJed Brown if (!numVertices) { 2598552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2599552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2600552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 26010298fd71SBarry Smith ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2602552f7358SJed Brown PetscFunctionReturn(0); 2603552f7358SJed Brown } 2604552f7358SJed Brown FREE_GRAPH = 0; /* Do not let Chaco free my memory */ 26050d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) ++adjacency[i]; 26060d644c17SKarl Rupp 2607552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2608552f7358SJed Brown /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */ 2609552f7358SJed Brown SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported"); 2610552f7358SJed Brown } 2611552f7358SJed Brown mesh_dims[0] = commSize; 2612552f7358SJed Brown mesh_dims[1] = 1; 2613552f7358SJed Brown mesh_dims[2] = 1; 2614785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &assignment);CHKERRQ(ierr); 2615552f7358SJed Brown /* Chaco outputs to stdout. We redirect this to a buffer. */ 2616552f7358SJed Brown /* TODO: check error codes for UNIX calls */ 2617519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2618552f7358SJed Brown { 26197995c745SJed Brown int piperet; 26207995c745SJed Brown piperet = pipe(fd_pipe); 26217995c745SJed Brown if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe"); 2622552f7358SJed Brown fd_stdout = dup(1); 2623552f7358SJed Brown close(1); 2624552f7358SJed Brown dup2(fd_pipe[1], 1); 2625552f7358SJed Brown } 2626552f7358SJed Brown #endif 2627552f7358SJed Brown ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename, 2628552f7358SJed Brown assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag, 2629552f7358SJed Brown vmax, ndims, eigtol, seed); 2630519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2631552f7358SJed Brown { 2632552f7358SJed Brown char msgLog[10000]; 2633552f7358SJed Brown int count; 2634552f7358SJed Brown 2635552f7358SJed Brown fflush(stdout); 2636552f7358SJed Brown count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char)); 2637552f7358SJed Brown if (count < 0) count = 0; 2638552f7358SJed Brown msgLog[count] = 0; 2639552f7358SJed Brown close(1); 2640552f7358SJed Brown dup2(fd_stdout, 1); 2641552f7358SJed Brown close(fd_stdout); 2642552f7358SJed Brown close(fd_pipe[0]); 2643552f7358SJed Brown close(fd_pipe[1]); 2644552f7358SJed Brown if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog); 2645552f7358SJed Brown } 2646552f7358SJed Brown #endif 2647552f7358SJed Brown /* Convert to PetscSection+IS */ 2648552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2649552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2650552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2651552f7358SJed Brown ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 2652552f7358SJed Brown } 2653552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2654785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 2655552f7358SJed Brown for (p = 0, i = 0; p < commSize; ++p) { 2656552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2657552f7358SJed Brown if (assignment[v] == p) points[i++] = v; 2658552f7358SJed Brown } 2659552f7358SJed Brown } 2660552f7358SJed Brown if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 2661552f7358SJed Brown ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2662552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2663552f7358SJed Brown /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */ 2664552f7358SJed Brown } 2665552f7358SJed Brown ierr = PetscFree(assignment);CHKERRQ(ierr); 26660d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) --adjacency[i]; 2667552f7358SJed Brown PetscFunctionReturn(0); 2668552f7358SJed Brown } 2669552f7358SJed Brown #endif 2670552f7358SJed Brown 2671519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 267225cda350SMatthew G. Knepley #include <parmetis.h> 267325cda350SMatthew G. Knepley 2674552f7358SJed Brown #undef __FUNCT__ 2675552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis" 2676552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2677552f7358SJed Brown { 267825cda350SMatthew G. Knepley MPI_Comm comm; 267954695375SMatthew G. Knepley PetscInt nvtxs = numVertices; /* The number of vertices in full graph */ 268054695375SMatthew G. Knepley PetscInt *vtxdist; /* Distribution of vertices across processes */ 268154695375SMatthew G. Knepley PetscInt *xadj = start; /* Start of edge list for each vertex */ 268254695375SMatthew G. Knepley PetscInt *adjncy = adjacency; /* Edge lists for all vertices */ 268354695375SMatthew G. Knepley PetscInt *vwgt = NULL; /* Vertex weights */ 268454695375SMatthew G. Knepley PetscInt *adjwgt = NULL; /* Edge weights */ 268554695375SMatthew G. Knepley PetscInt wgtflag = 0; /* Indicates which weights are present */ 268654695375SMatthew G. Knepley PetscInt numflag = 0; /* Indicates initial offset (0 or 1) */ 268754695375SMatthew G. Knepley PetscInt ncon = 1; /* The number of weights per vertex */ 268854695375SMatthew G. Knepley PetscInt nparts; /* The number of partitions */ 268954695375SMatthew G. Knepley PetscReal *tpwgts; /* The fraction of vertex weights assigned to each partition */ 269054695375SMatthew G. Knepley PetscReal *ubvec; /* The balance intolerance for vertex weights */ 269154695375SMatthew G. Knepley PetscInt options[5]; /* Options */ 269254695375SMatthew G. Knepley /* Outputs */ 269354695375SMatthew G. Knepley PetscInt edgeCut; /* The number of edges cut by the partition */ 269425cda350SMatthew G. Knepley PetscInt *assignment, *points; 269525cda350SMatthew G. Knepley PetscMPIInt commSize, rank, p, v, i; 269625cda350SMatthew G. Knepley PetscErrorCode ierr; 269725cda350SMatthew G. Knepley 2698552f7358SJed Brown PetscFunctionBegin; 269925cda350SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr); 270025cda350SMatthew G. Knepley ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 270125cda350SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 270225cda350SMatthew G. Knepley nparts = commSize; 270325cda350SMatthew G. Knepley options[0] = 0; /* Use all defaults */ 270425cda350SMatthew G. Knepley /* Calculate vertex distribution */ 2705dcca6d9dSJed Brown ierr = PetscMalloc4(nparts+1,&vtxdist,nparts*ncon,&tpwgts,ncon,&ubvec,nvtxs,&assignment);CHKERRQ(ierr); 270625cda350SMatthew G. Knepley vtxdist[0] = 0; 270725cda350SMatthew G. Knepley ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr); 270825cda350SMatthew G. Knepley for (p = 2; p <= nparts; ++p) { 270925cda350SMatthew G. Knepley vtxdist[p] += vtxdist[p-1]; 271025cda350SMatthew G. Knepley } 271125cda350SMatthew G. Knepley /* Calculate weights */ 271225cda350SMatthew G. Knepley for (p = 0; p < nparts; ++p) { 271325cda350SMatthew G. Knepley tpwgts[p] = 1.0/nparts; 271425cda350SMatthew G. Knepley } 271525cda350SMatthew G. Knepley ubvec[0] = 1.05; 271625cda350SMatthew G. Knepley 271725cda350SMatthew G. Knepley if (nparts == 1) { 271825cda350SMatthew G. Knepley ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt)); 271925cda350SMatthew G. Knepley } else { 272025cda350SMatthew G. Knepley if (vtxdist[1] == vtxdist[nparts]) { 272125cda350SMatthew G. Knepley if (!rank) { 2722e7ee2502SMatthew G. Knepley PetscStackPush("METIS_PartGraphKway"); 2723e7ee2502SMatthew G. Knepley ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment); 2724e7ee2502SMatthew G. Knepley PetscStackPop; 2725e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()"); 272625cda350SMatthew G. Knepley } 272725cda350SMatthew G. Knepley } else { 2728e7ee2502SMatthew G. Knepley PetscStackPush("ParMETIS_V3_PartKway"); 2729e7ee2502SMatthew G. Knepley ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm); 2730e7ee2502SMatthew G. Knepley PetscStackPop; 2731e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()"); 273225cda350SMatthew G. Knepley } 273325cda350SMatthew G. Knepley } 273425cda350SMatthew G. Knepley /* Convert to PetscSection+IS */ 273525cda350SMatthew G. Knepley ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 273625cda350SMatthew G. Knepley ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 273725cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 273825cda350SMatthew G. Knepley ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 273925cda350SMatthew G. Knepley } 274025cda350SMatthew G. Knepley ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2741785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 274225cda350SMatthew G. Knepley for (p = 0, i = 0; p < commSize; ++p) { 274325cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 274425cda350SMatthew G. Knepley if (assignment[v] == p) points[i++] = v; 274525cda350SMatthew G. Knepley } 274625cda350SMatthew G. Knepley } 274725cda350SMatthew G. Knepley if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 274825cda350SMatthew G. Knepley ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 274925cda350SMatthew G. Knepley ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr); 2750552f7358SJed Brown PetscFunctionReturn(0); 2751552f7358SJed Brown } 2752552f7358SJed Brown #endif 2753552f7358SJed Brown 2754552f7358SJed Brown #undef __FUNCT__ 2755552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition" 2756552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */ 2757a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition) 2758a6dfd86eSKarl Rupp { 2759552f7358SJed Brown PetscHashI h; 2760552f7358SJed Brown const PetscInt *points; 2761552f7358SJed Brown PetscInt **tmpPoints, *newPoints, totPoints = 0; 2762552f7358SJed Brown PetscInt pStart, pEnd, part, q; 2763552f7358SJed Brown PetscErrorCode ierr; 2764552f7358SJed Brown 2765552f7358SJed Brown PetscFunctionBegin; 2766552f7358SJed Brown PetscHashICreate(h); 276782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2768552f7358SJed Brown ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr); 2769552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr); 2770552f7358SJed Brown ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr); 2771785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &tmpPoints);CHKERRQ(ierr); 2772552f7358SJed Brown for (part = pStart; part < pEnd; ++part) { 2773552f7358SJed Brown PetscInt numPoints, nP, numNewPoints, off, p, n = 0; 2774552f7358SJed Brown 2775552f7358SJed Brown PetscHashIClear(h); 2776552f7358SJed Brown ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr); 2777552f7358SJed Brown ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr); 2778552f7358SJed Brown /* Add all existing points to h */ 2779552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2780552f7358SJed Brown const PetscInt point = points[off+p]; 2781552f7358SJed Brown PetscHashIAdd(h, point, 1); 2782552f7358SJed Brown } 2783552f7358SJed Brown PetscHashISize(h, nP); 278482f516ccSBarry Smith if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP); 2785552f7358SJed Brown /* Add all points in next BFS level */ 2786552f7358SJed Brown /* TODO We are brute forcing here, but could check the adjacency size to find the boundary */ 2787552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2788552f7358SJed Brown const PetscInt point = points[off+p]; 2789552f7358SJed Brown PetscInt s = start[point], e = start[point+1], a; 2790552f7358SJed Brown 27910d644c17SKarl Rupp for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1); 2792552f7358SJed Brown } 2793552f7358SJed Brown PetscHashISize(h, numNewPoints); 2794552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr); 2795785e854fSJed Brown ierr = PetscMalloc1(numNewPoints, &tmpPoints[part]);CHKERRQ(ierr); 2796c9fc7396SMatthew G. Knepley ierr = PetscHashIGetKeys(h, &n, tmpPoints[part]);CHKERRQ(ierr); 2797552f7358SJed Brown totPoints += numNewPoints; 2798552f7358SJed Brown } 2799552f7358SJed Brown ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr); 2800552f7358SJed Brown PetscHashIDestroy(h); 2801552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2802785e854fSJed Brown ierr = PetscMalloc1(totPoints, &newPoints);CHKERRQ(ierr); 2803552f7358SJed Brown for (part = pStart, q = 0; part < pEnd; ++part) { 2804552f7358SJed Brown PetscInt numPoints, p; 2805552f7358SJed Brown 2806552f7358SJed Brown ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr); 28070d644c17SKarl Rupp for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p]; 2808552f7358SJed Brown ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr); 2809552f7358SJed Brown } 2810552f7358SJed Brown ierr = PetscFree(tmpPoints);CHKERRQ(ierr); 281182f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2812552f7358SJed Brown PetscFunctionReturn(0); 2813552f7358SJed Brown } 2814552f7358SJed Brown 2815552f7358SJed Brown #undef __FUNCT__ 2816552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition" 2817552f7358SJed Brown /* 2818552f7358SJed Brown DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height 2819552f7358SJed Brown 2820552f7358SJed Brown Collective on DM 2821552f7358SJed Brown 2822552f7358SJed Brown Input Parameters: 2823552f7358SJed Brown + dm - The DM 2824552f7358SJed Brown . height - The height for points in the partition 2825552f7358SJed Brown - enlarge - Expand each partition with neighbors 2826552f7358SJed Brown 2827552f7358SJed Brown Output Parameters: 2828552f7358SJed Brown + partSection - The PetscSection giving the division of points by partition 2829552f7358SJed Brown . partition - The list of points by partition 28300298fd71SBarry Smith . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL 28310298fd71SBarry Smith - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL 2832552f7358SJed Brown 2833552f7358SJed Brown Level: developer 2834552f7358SJed Brown 2835552f7358SJed Brown .seealso DMPlexDistribute() 2836552f7358SJed Brown */ 2837ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition) 28380adebc6cSBarry Smith { 2839ac17c9edSMatthew G. Knepley char partname[1024]; 2840ac17c9edSMatthew G. Knepley PetscBool isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg; 2841552f7358SJed Brown PetscMPIInt size; 2842552f7358SJed Brown PetscErrorCode ierr; 2843552f7358SJed Brown 2844552f7358SJed Brown PetscFunctionBegin; 284582f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 28460d644c17SKarl Rupp 28470298fd71SBarry Smith *origPartSection = NULL; 28480298fd71SBarry Smith *origPartition = NULL; 2849552f7358SJed Brown if (size == 1) { 2850552f7358SJed Brown PetscInt *points; 2851552f7358SJed Brown PetscInt cStart, cEnd, c; 2852552f7358SJed Brown 2853552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 285482f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2855552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr); 2856552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr); 2857552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2858785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &points);CHKERRQ(ierr); 28590d644c17SKarl Rupp for (c = cStart; c < cEnd; ++c) points[c] = c; 286082f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2861552f7358SJed Brown PetscFunctionReturn(0); 2862552f7358SJed Brown } 2863ac17c9edSMatthew G. Knepley ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr); 2864ac17c9edSMatthew G. Knepley if (flg) name = partname; 2865ac17c9edSMatthew G. Knepley if (name) { 2866ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr); 2867ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr); 2868ac17c9edSMatthew G. Knepley } 2869552f7358SJed Brown if (height == 0) { 2870552f7358SJed Brown PetscInt numVertices; 28710298fd71SBarry Smith PetscInt *start = NULL; 28720298fd71SBarry Smith PetscInt *adjacency = NULL; 2873552f7358SJed Brown 287477c88f5bSMatthew G Knepley ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr); 2875ac17c9edSMatthew G. Knepley if (!name || isChaco) { 2876519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2877552f7358SJed Brown ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2878ac17c9edSMatthew G. Knepley #else 2879ac17c9edSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco."); 2880552f7358SJed Brown #endif 2881ac17c9edSMatthew G. Knepley } else if (isMetis) { 2882519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 2883552f7358SJed Brown ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2884552f7358SJed Brown #endif 2885ac17c9edSMatthew G. Knepley } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name); 2886552f7358SJed Brown if (enlarge) { 2887552f7358SJed Brown *origPartSection = *partSection; 2888552f7358SJed Brown *origPartition = *partition; 28890d644c17SKarl Rupp 2890552f7358SJed Brown ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr); 2891552f7358SJed Brown } 2892552f7358SJed Brown ierr = PetscFree(start);CHKERRQ(ierr); 2893552f7358SJed Brown ierr = PetscFree(adjacency);CHKERRQ(ierr); 2894552f7358SJed Brown # if 0 2895552f7358SJed Brown } else if (height == 1) { 2896552f7358SJed Brown /* Build the dual graph for faces and partition the hypergraph */ 2897552f7358SJed Brown PetscInt numEdges; 2898552f7358SJed Brown 2899552f7358SJed Brown buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase()); 2900552f7358SJed Brown GraphPartitioner().partition(numEdges, start, adjacency, partition, manager); 2901552f7358SJed Brown destroyCSR(numEdges, start, adjacency); 2902552f7358SJed Brown #endif 290382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height); 2904552f7358SJed Brown PetscFunctionReturn(0); 2905552f7358SJed Brown } 2906552f7358SJed Brown 2907552f7358SJed Brown #undef __FUNCT__ 2908552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure" 29090adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition) 29100adebc6cSBarry Smith { 2911552f7358SJed Brown /* const PetscInt height = 0; */ 2912552f7358SJed Brown const PetscInt *partArray; 2913cb3cb6d9SJed Brown PetscInt *allPoints, *packPoints; 2914cb3cb6d9SJed Brown PetscInt rStart, rEnd, rank, pStart, pEnd, newSize; 2915552f7358SJed Brown PetscErrorCode ierr; 2916cb3cb6d9SJed Brown PetscBT bt; 2917cb3cb6d9SJed Brown PetscSegBuffer segpack,segpart; 2918552f7358SJed Brown 2919552f7358SJed Brown PetscFunctionBegin; 2920552f7358SJed Brown ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr); 2921552f7358SJed Brown ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr); 292282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2923552f7358SJed Brown ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr); 2924cb3cb6d9SJed Brown ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr); 2925cb3cb6d9SJed Brown ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr); 2926cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr); 2927cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr); 2928552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2929471ecdacSJed Brown PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints; 2930552f7358SJed Brown 2931552f7358SJed Brown ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr); 2932552f7358SJed Brown ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr); 2933552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2934552f7358SJed Brown PetscInt point = partArray[offset+p], closureSize, c; 29350298fd71SBarry Smith PetscInt *closure = NULL; 2936552f7358SJed Brown 2937552f7358SJed Brown /* TODO Include support for height > 0 case */ 2938552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2939cb3cb6d9SJed Brown for (c=0; c<closureSize; c++) { 2940cb3cb6d9SJed Brown PetscInt cpoint = closure[c*2]; 2941cb3cb6d9SJed Brown if (!PetscBTLookupSet(bt,cpoint-pStart)) { 2942471ecdacSJed Brown PetscInt *PETSC_RESTRICT pt; 2943cb3cb6d9SJed Brown partSize++; 2944471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr); 2945cb3cb6d9SJed Brown *pt = cpoint; 2946552f7358SJed Brown } 2947cb3cb6d9SJed Brown } 2948552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2949552f7358SJed Brown } 2950552f7358SJed Brown ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr); 2951471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr); 2952471ecdacSJed Brown ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr); 2953471ecdacSJed Brown ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr); 2954471ecdacSJed Brown for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);} 2955552f7358SJed Brown } 2956cb3cb6d9SJed Brown ierr = PetscBTDestroy(&bt);CHKERRQ(ierr); 2957cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr); 2958cb3cb6d9SJed Brown 2959552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 2960552f7358SJed Brown ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr); 2961785e854fSJed Brown ierr = PetscMalloc1(newSize, &allPoints);CHKERRQ(ierr); 2962552f7358SJed Brown 2963137cf7b6SJed Brown ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr); 2964552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2965cb3cb6d9SJed Brown PetscInt numPoints, offset; 2966552f7358SJed Brown 2967cb3cb6d9SJed Brown ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr); 2968cb3cb6d9SJed Brown ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr); 2969cb3cb6d9SJed Brown ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr); 2970cb3cb6d9SJed Brown packPoints += numPoints; 2971552f7358SJed Brown } 2972cb3cb6d9SJed Brown 2973cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr); 2974552f7358SJed Brown ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr); 297582f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2976552f7358SJed Brown PetscFunctionReturn(0); 2977552f7358SJed Brown } 2978552f7358SJed Brown 2979552f7358SJed Brown #undef __FUNCT__ 2980552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField" 29811858a729SMatthew G. Knepley /*@ 29821858a729SMatthew G. Knepley DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 29831858a729SMatthew G. Knepley 29841858a729SMatthew G. Knepley Collective on DM 29851858a729SMatthew G. Knepley 2986552f7358SJed Brown Input Parameters: 29871858a729SMatthew G. Knepley + dm - The DMPlex object 29881858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 29891858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 29901858a729SMatthew G. Knepley - originalVec - The existing data 2991552f7358SJed Brown 2992552f7358SJed Brown Output Parameters: 29931858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 29941858a729SMatthew G. Knepley - newVec - The new data 29951858a729SMatthew G. Knepley 29961858a729SMatthew G. Knepley Level: developer 29971858a729SMatthew G. Knepley 29981858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData() 29991858a729SMatthew G. Knepley @*/ 3000552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec) 3001552f7358SJed Brown { 3002552f7358SJed Brown PetscSF fieldSF; 3003552f7358SJed Brown PetscInt *remoteOffsets, fieldSize; 3004552f7358SJed Brown PetscScalar *originalValues, *newValues; 3005552f7358SJed Brown PetscErrorCode ierr; 3006552f7358SJed Brown 3007552f7358SJed Brown PetscFunctionBegin; 30081337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3009552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 3010552f7358SJed Brown 3011552f7358SJed Brown ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 3012552f7358SJed Brown ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr); 3013c0dedaeaSBarry Smith ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr); 3014552f7358SJed Brown 3015552f7358SJed Brown ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr); 3016552f7358SJed Brown ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr); 3017552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 3018552f7358SJed Brown ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3019552f7358SJed Brown ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3020552f7358SJed Brown ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 3021552f7358SJed Brown ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr); 3022552f7358SJed Brown ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr); 30231337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3024552f7358SJed Brown PetscFunctionReturn(0); 3025552f7358SJed Brown } 3026552f7358SJed Brown 3027552f7358SJed Brown #undef __FUNCT__ 30281858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData" 30291858a729SMatthew G. Knepley /*@ 30301858a729SMatthew G. Knepley DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 30311858a729SMatthew G. Knepley 30321858a729SMatthew G. Knepley Collective on DM 30331858a729SMatthew G. Knepley 30341858a729SMatthew G. Knepley Input Parameters: 30351858a729SMatthew G. Knepley + dm - The DMPlex object 30361858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 30371858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 30381858a729SMatthew G. Knepley . datatype - The type of data 30391858a729SMatthew G. Knepley - originalData - The existing data 30401858a729SMatthew G. Knepley 30411858a729SMatthew G. Knepley Output Parameters: 30421858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 30431858a729SMatthew G. Knepley - newData - The new data 30441858a729SMatthew G. Knepley 30451858a729SMatthew G. Knepley Level: developer 30461858a729SMatthew G. Knepley 30471858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField() 30481858a729SMatthew G. Knepley @*/ 30491858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData) 30501858a729SMatthew G. Knepley { 30511858a729SMatthew G. Knepley PetscSF fieldSF; 30521858a729SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 30531858a729SMatthew G. Knepley PetscMPIInt dataSize; 30541858a729SMatthew G. Knepley PetscErrorCode ierr; 30551858a729SMatthew G. Knepley 30561858a729SMatthew G. Knepley PetscFunctionBegin; 30571337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 30581858a729SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 30591858a729SMatthew G. Knepley 30601858a729SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 30611858a729SMatthew G. Knepley ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr); 30621858a729SMatthew G. Knepley ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr); 30631858a729SMatthew G. Knepley 30641858a729SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 30651858a729SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 30661858a729SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 30671858a729SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 30681337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 30691858a729SMatthew G. Knepley PetscFunctionReturn(0); 30701858a729SMatthew G. Knepley } 30711858a729SMatthew G. Knepley 30721858a729SMatthew G. Knepley #undef __FUNCT__ 3073552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute" 3074552f7358SJed Brown /*@C 3075552f7358SJed Brown DMPlexDistribute - Distributes the mesh and any associated sections. 3076552f7358SJed Brown 3077552f7358SJed Brown Not Collective 3078552f7358SJed Brown 3079552f7358SJed Brown Input Parameter: 3080552f7358SJed Brown + dm - The original DMPlex object 3081552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default 3082552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default 3083552f7358SJed Brown 3084552f7358SJed Brown Output Parameter: 3085e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution 3086e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL 3087552f7358SJed Brown 30880298fd71SBarry Smith Note: If the mesh was not distributed, the return value is NULL 3089552f7358SJed Brown 3090552f7358SJed Brown Level: intermediate 3091552f7358SJed Brown 3092552f7358SJed Brown .keywords: mesh, elements 3093552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace() 3094552f7358SJed Brown @*/ 3095e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel) 3096552f7358SJed Brown { 3097552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data, *pmesh; 309882f516ccSBarry Smith MPI_Comm comm; 3099552f7358SJed Brown const PetscInt height = 0; 3100552f7358SJed Brown PetscInt dim, numRemoteRanks; 3101057e8d19SMichael Lange IS origCellPart, origPart, cellPart, part; 3102057e8d19SMichael Lange PetscSection origCellPartSection, origPartSection, cellPartSection, partSection; 3103552f7358SJed Brown PetscSFNode *remoteRanks; 3104552f7358SJed Brown PetscSF partSF, pointSF, coneSF; 3105552f7358SJed Brown ISLocalToGlobalMapping renumbering; 3106552f7358SJed Brown PetscSection originalConeSection, newConeSection; 3107552f7358SJed Brown PetscInt *remoteOffsets; 3108552f7358SJed Brown PetscInt *cones, *newCones, newConesSize; 3109552f7358SJed Brown PetscBool flg; 3110552f7358SJed Brown PetscMPIInt rank, numProcs, p; 3111552f7358SJed Brown PetscErrorCode ierr; 3112552f7358SJed Brown 3113552f7358SJed Brown PetscFunctionBegin; 3114552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3115e7ba9e7aSMatthew G. Knepley if (sf) PetscValidPointer(sf,4); 3116e7ba9e7aSMatthew G. Knepley PetscValidPointer(dmParallel,5); 31170d644c17SKarl Rupp 3118552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 311982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3120552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3121552f7358SJed Brown ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr); 31220d644c17SKarl Rupp 31230298fd71SBarry Smith *dmParallel = NULL; 3124552f7358SJed Brown if (numProcs == 1) PetscFunctionReturn(0); 3125552f7358SJed Brown 3126552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3127552f7358SJed Brown /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */ 3128b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 312982f516ccSBarry Smith if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented"); 3130ac17c9edSMatthew G. Knepley ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr); 3131552f7358SJed Brown /* Create SF assuming a serial partition for all processes: Could check for IS length here */ 31320d644c17SKarl Rupp if (!rank) numRemoteRanks = numProcs; 31330d644c17SKarl Rupp else numRemoteRanks = 0; 3134785e854fSJed Brown ierr = PetscMalloc1(numRemoteRanks, &remoteRanks);CHKERRQ(ierr); 3135552f7358SJed Brown for (p = 0; p < numRemoteRanks; ++p) { 3136552f7358SJed Brown remoteRanks[p].rank = p; 3137552f7358SJed Brown remoteRanks[p].index = 0; 3138552f7358SJed Brown } 3139552f7358SJed Brown ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr); 31400298fd71SBarry Smith ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr); 3141552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr); 3142552f7358SJed Brown if (flg) { 3143552f7358SJed Brown ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr); 3144552f7358SJed Brown ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 31450298fd71SBarry Smith ierr = ISView(cellPart, NULL);CHKERRQ(ierr); 3146552f7358SJed Brown if (origCellPart) { 3147552f7358SJed Brown ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr); 3148552f7358SJed Brown ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 31490298fd71SBarry Smith ierr = ISView(origCellPart, NULL);CHKERRQ(ierr); 3150552f7358SJed Brown } 31510298fd71SBarry Smith ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr); 3152552f7358SJed Brown } 3153552f7358SJed Brown /* Close the partition over the mesh */ 3154552f7358SJed Brown ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr); 3155552f7358SJed Brown ierr = ISDestroy(&cellPart);CHKERRQ(ierr); 3156552f7358SJed Brown ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr); 3157552f7358SJed Brown /* Create new mesh */ 3158552f7358SJed Brown ierr = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr); 3159552f7358SJed Brown ierr = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr); 3160552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr); 3161552f7358SJed Brown pmesh = (DM_Plex*) (*dmParallel)->data; 3162552f7358SJed Brown /* Distribute sieve points and the global point numbering (replaces creating remote bases) */ 3163552f7358SJed Brown ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr); 3164552f7358SJed Brown if (flg) { 3165552f7358SJed Brown ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr); 3166552f7358SJed Brown ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 31670298fd71SBarry Smith ierr = ISView(part, NULL);CHKERRQ(ierr); 31680298fd71SBarry Smith ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr); 3169552f7358SJed Brown ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr); 31700298fd71SBarry Smith ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr); 3171552f7358SJed Brown } 3172b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 31731337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3174552f7358SJed Brown /* Distribute cone section */ 3175552f7358SJed Brown ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr); 3176552f7358SJed Brown ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr); 3177552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr); 3178552f7358SJed Brown ierr = DMSetUp(*dmParallel);CHKERRQ(ierr); 3179552f7358SJed Brown { 3180552f7358SJed Brown PetscInt pStart, pEnd, p; 3181552f7358SJed Brown 3182552f7358SJed Brown ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr); 3183552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3184552f7358SJed Brown PetscInt coneSize; 3185552f7358SJed Brown ierr = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr); 3186552f7358SJed Brown pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize); 3187552f7358SJed Brown } 3188552f7358SJed Brown } 3189552f7358SJed Brown /* Communicate and renumber cones */ 3190552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr); 3191552f7358SJed Brown ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr); 3192552f7358SJed Brown ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr); 3193552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3194552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3195552f7358SJed Brown ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr); 31960298fd71SBarry Smith ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr); 3197552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr); 3198552f7358SJed Brown if (flg) { 3199552f7358SJed Brown ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr); 3200552f7358SJed Brown ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 3201552f7358SJed Brown ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr); 3202552f7358SJed Brown ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 32030298fd71SBarry Smith ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr); 3204552f7358SJed Brown } 3205552f7358SJed Brown ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr); 3206552f7358SJed Brown ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr); 3207552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3208552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3209552f7358SJed Brown ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr); 32101337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3211552f7358SJed Brown /* Create supports and stratify sieve */ 3212552f7358SJed Brown { 3213552f7358SJed Brown PetscInt pStart, pEnd; 3214552f7358SJed Brown 3215552f7358SJed Brown ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 3216552f7358SJed Brown ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 3217552f7358SJed Brown } 3218552f7358SJed Brown ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr); 3219552f7358SJed Brown ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr); 3220552f7358SJed Brown /* Distribute Coordinates */ 3221552f7358SJed Brown { 3222552f7358SJed Brown PetscSection originalCoordSection, newCoordSection; 3223552f7358SJed Brown Vec originalCoordinates, newCoordinates; 3224552f7358SJed Brown const char *name; 3225552f7358SJed Brown 322669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr); 322769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr); 3228552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr); 3229552f7358SJed Brown ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr); 3230552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr); 3231552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr); 3232552f7358SJed Brown 3233552f7358SJed Brown ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr); 3234552f7358SJed Brown ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr); 3235552f7358SJed Brown ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 3236552f7358SJed Brown } 3237552f7358SJed Brown /* Distribute labels */ 3238b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 3239552f7358SJed Brown { 3240552f7358SJed Brown DMLabel next = mesh->labels, newNext = pmesh->labels; 3241552f7358SJed Brown PetscInt numLabels = 0, l; 3242552f7358SJed Brown 3243552f7358SJed Brown /* Bcast number of labels */ 324420cb08bdSMatthew G. Knepley while (next) {++numLabels; next = next->next;} 3245552f7358SJed Brown ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3246552f7358SJed Brown next = mesh->labels; 3247552f7358SJed Brown for (l = 0; l < numLabels; ++l) { 324820cb08bdSMatthew G. Knepley DMLabel labelNew; 3249552f7358SJed Brown PetscBool isdepth; 3250552f7358SJed Brown 325120cb08bdSMatthew G. Knepley /* Skip "depth" because it is recreated */ 325220cb08bdSMatthew G. Knepley if (!rank) {ierr = PetscStrcmp(next->name, "depth", &isdepth);CHKERRQ(ierr);} 325320cb08bdSMatthew G. Knepley ierr = MPI_Bcast(&isdepth, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 325420cb08bdSMatthew G. Knepley if (isdepth) {if (!rank) next = next->next; continue;} 325520cb08bdSMatthew G. Knepley ierr = DMLabelDistribute(next, partSection, part, renumbering, &labelNew);CHKERRQ(ierr); 3256552f7358SJed Brown /* Insert into list */ 325720cb08bdSMatthew G. Knepley if (newNext) newNext->next = labelNew; 325820cb08bdSMatthew G. Knepley else pmesh->labels = labelNew; 325920cb08bdSMatthew G. Knepley newNext = labelNew; 32600d644c17SKarl Rupp if (!rank) next = next->next; 3261552f7358SJed Brown } 3262552f7358SJed Brown } 3263b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 32645a9d0af9SMatthew G. Knepley /* Setup hybrid structure */ 32655a9d0af9SMatthew G. Knepley { 32665a9d0af9SMatthew G. Knepley const PetscInt *gpoints; 32675a9d0af9SMatthew G. Knepley PetscInt depth, n, d; 32685a9d0af9SMatthew G. Knepley 32695a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];} 32705a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr); 32715a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr); 32725a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr); 32735a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 32745a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 32755a9d0af9SMatthew G. Knepley PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p; 32765a9d0af9SMatthew G. Knepley 32775a9d0af9SMatthew G. Knepley if (pmax < 0) continue; 32785a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr); 32796dfbe1fcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr); 32805a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr); 32815a9d0af9SMatthew G. Knepley for (p = 0; p < n; ++p) { 32825a9d0af9SMatthew G. Knepley const PetscInt point = gpoints[p]; 32835a9d0af9SMatthew G. Knepley 32845a9d0af9SMatthew G. Knepley if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax; 32855a9d0af9SMatthew G. Knepley } 32865a9d0af9SMatthew G. Knepley if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax; 32875a9d0af9SMatthew G. Knepley else pmesh->hybridPointMax[d] = -1; 32885a9d0af9SMatthew G. Knepley } 32895a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr); 32905a9d0af9SMatthew G. Knepley } 3291552f7358SJed Brown /* Cleanup Partition */ 3292552f7358SJed Brown ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr); 3293552f7358SJed Brown ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr); 3294552f7358SJed Brown ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr); 3295552f7358SJed Brown ierr = ISDestroy(&part);CHKERRQ(ierr); 3296552f7358SJed Brown /* Create point SF for parallel mesh */ 3297b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3298552f7358SJed Brown { 3299552f7358SJed Brown const PetscInt *leaves; 3300552f7358SJed Brown PetscSFNode *remotePoints, *rowners, *lowners; 3301552f7358SJed Brown PetscInt numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints; 3302552f7358SJed Brown PetscInt pStart, pEnd; 3303552f7358SJed Brown 3304552f7358SJed Brown ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr); 33050298fd71SBarry Smith ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr); 3306dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&rowners,numLeaves,&lowners);CHKERRQ(ierr); 3307552f7358SJed Brown for (p=0; p<numRoots; p++) { 3308552f7358SJed Brown rowners[p].rank = -1; 3309552f7358SJed Brown rowners[p].index = -1; 3310552f7358SJed Brown } 3311552f7358SJed Brown if (origCellPart) { 3312057e8d19SMichael Lange /* Make sure points in the original partition are not assigned to other procs */ 3313057e8d19SMichael Lange const PetscInt *origPoints; 3314552f7358SJed Brown 3315057e8d19SMichael Lange ierr = DMPlexCreatePartitionClosure(dm, origCellPartSection, origCellPart, &origPartSection, &origPart);CHKERRQ(ierr); 3316057e8d19SMichael Lange ierr = ISGetIndices(origPart, &origPoints);CHKERRQ(ierr); 3317552f7358SJed Brown for (p = 0; p < numProcs; ++p) { 3318552f7358SJed Brown PetscInt dof, off, d; 3319552f7358SJed Brown 3320057e8d19SMichael Lange ierr = PetscSectionGetDof(origPartSection, p, &dof);CHKERRQ(ierr); 3321057e8d19SMichael Lange ierr = PetscSectionGetOffset(origPartSection, p, &off);CHKERRQ(ierr); 3322552f7358SJed Brown for (d = off; d < off+dof; ++d) { 3323057e8d19SMichael Lange rowners[origPoints[d]].rank = p; 3324552f7358SJed Brown } 3325552f7358SJed Brown } 3326057e8d19SMichael Lange ierr = ISRestoreIndices(origPart, &origPoints);CHKERRQ(ierr); 3327057e8d19SMichael Lange ierr = ISDestroy(&origPart);CHKERRQ(ierr); 3328057e8d19SMichael Lange ierr = PetscSectionDestroy(&origPartSection);CHKERRQ(ierr); 3329552f7358SJed Brown } 3330552f7358SJed Brown ierr = ISDestroy(&origCellPart);CHKERRQ(ierr); 3331552f7358SJed Brown ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr); 3332552f7358SJed Brown 3333552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3334552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3335552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3336552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */ 3337552f7358SJed Brown lowners[p].rank = rank; 3338552f7358SJed Brown lowners[p].index = leaves ? leaves[p] : p; 3339552f7358SJed Brown } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */ 3340552f7358SJed Brown lowners[p].rank = -2; 3341552f7358SJed Brown lowners[p].index = -2; 3342552f7358SJed Brown } 3343552f7358SJed Brown } 3344552f7358SJed Brown for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */ 3345552f7358SJed Brown rowners[p].rank = -3; 3346552f7358SJed Brown rowners[p].index = -3; 3347552f7358SJed Brown } 3348552f7358SJed Brown ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3349552f7358SJed Brown ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3350552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3351552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3352552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3353552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed"); 3354552f7358SJed Brown if (lowners[p].rank != rank) ++numGhostPoints; 3355552f7358SJed Brown } 3356785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &ghostPoints);CHKERRQ(ierr); 3357785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &remotePoints);CHKERRQ(ierr); 3358552f7358SJed Brown for (p = 0, gp = 0; p < numLeaves; ++p) { 3359552f7358SJed Brown if (lowners[p].rank != rank) { 3360552f7358SJed Brown ghostPoints[gp] = leaves ? leaves[p] : p; 3361552f7358SJed Brown remotePoints[gp].rank = lowners[p].rank; 3362552f7358SJed Brown remotePoints[gp].index = lowners[p].index; 3363552f7358SJed Brown ++gp; 3364552f7358SJed Brown } 3365552f7358SJed Brown } 3366552f7358SJed Brown ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr); 3367552f7358SJed Brown ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3368552f7358SJed Brown ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr); 3369552f7358SJed Brown } 3370b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3371552f7358SJed Brown /* Cleanup */ 3372e7ba9e7aSMatthew G. Knepley if (sf) {*sf = pointSF;} 3373e7ba9e7aSMatthew G. Knepley else {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);} 3374552f7358SJed Brown ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr); 3375552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 3376552f7358SJed Brown PetscFunctionReturn(0); 3377552f7358SJed Brown } 3378552f7358SJed Brown 33792e1b13c2SMatthew G. Knepley #undef __FUNCT__ 33809db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 33819db3b87dSMatthew G. Knepley /*@C 33829db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 33839db3b87dSMatthew G. Knepley 33849db3b87dSMatthew G. Knepley Input Parameters: 33859db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 33869db3b87dSMatthew G. Knepley - cone - The incoming cone 33879db3b87dSMatthew G. Knepley 33889db3b87dSMatthew G. Knepley Output Parameter: 33899db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 33909db3b87dSMatthew G. Knepley 33919db3b87dSMatthew G. Knepley Level: developer 33929db3b87dSMatthew G. Knepley 33939db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 33949db3b87dSMatthew G. Knepley @*/ 33959db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 33962e1b13c2SMatthew G. Knepley { 33979db3b87dSMatthew G. Knepley int tmpc; 33982e1b13c2SMatthew G. Knepley 33992e1b13c2SMatthew G. Knepley PetscFunctionBegin; 34009db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 34019db3b87dSMatthew G. Knepley switch (numCorners) { 34029db3b87dSMatthew G. Knepley case 4: 34031885f254SMatthew G. Knepley tmpc = cone[0]; 34041885f254SMatthew G. Knepley cone[0] = cone[1]; 34051885f254SMatthew G. Knepley cone[1] = tmpc; 34069db3b87dSMatthew G. Knepley break; 34079db3b87dSMatthew G. Knepley case 8: 34089db3b87dSMatthew G. Knepley tmpc = cone[1]; 34099db3b87dSMatthew G. Knepley cone[1] = cone[3]; 34109db3b87dSMatthew G. Knepley cone[3] = tmpc; 34119db3b87dSMatthew G. Knepley break; 34129db3b87dSMatthew G. Knepley default: break; 34139db3b87dSMatthew G. Knepley } 34149db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 34159db3b87dSMatthew G. Knepley } 34169db3b87dSMatthew G. Knepley 34179db3b87dSMatthew G. Knepley #undef __FUNCT__ 34189db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 34199db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 34209db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 34219db3b87dSMatthew G. Knepley { 34229db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 34239db3b87dSMatthew G. Knepley PetscErrorCode ierr; 34249db3b87dSMatthew G. Knepley 34259db3b87dSMatthew G. Knepley PetscFunctionBegin; 34269db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 34279db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 34282e1b13c2SMatthew G. Knepley } 34292e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 34302e1b13c2SMatthew G. Knepley } 34312e1b13c2SMatthew G. Knepley 3432519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3433552f7358SJed Brown #include <triangle.h> 3434552f7358SJed Brown 3435552f7358SJed Brown #undef __FUNCT__ 3436552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 34370adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 34380adebc6cSBarry Smith { 3439552f7358SJed Brown PetscFunctionBegin; 3440552f7358SJed Brown inputCtx->numberofpoints = 0; 3441552f7358SJed Brown inputCtx->numberofpointattributes = 0; 34420298fd71SBarry Smith inputCtx->pointlist = NULL; 34430298fd71SBarry Smith inputCtx->pointattributelist = NULL; 34440298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 3445552f7358SJed Brown inputCtx->numberofsegments = 0; 34460298fd71SBarry Smith inputCtx->segmentlist = NULL; 34470298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 3448552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 34490298fd71SBarry Smith inputCtx->trianglelist = NULL; 3450552f7358SJed Brown inputCtx->numberofholes = 0; 34510298fd71SBarry Smith inputCtx->holelist = NULL; 3452552f7358SJed Brown inputCtx->numberofregions = 0; 34530298fd71SBarry Smith inputCtx->regionlist = NULL; 3454552f7358SJed Brown PetscFunctionReturn(0); 3455552f7358SJed Brown } 3456552f7358SJed Brown 3457552f7358SJed Brown #undef __FUNCT__ 3458552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 34590adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 34600adebc6cSBarry Smith { 3461552f7358SJed Brown PetscFunctionBegin; 3462552f7358SJed Brown outputCtx->numberofpoints = 0; 34630298fd71SBarry Smith outputCtx->pointlist = NULL; 34640298fd71SBarry Smith outputCtx->pointattributelist = NULL; 34650298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 3466552f7358SJed Brown outputCtx->numberoftriangles = 0; 34670298fd71SBarry Smith outputCtx->trianglelist = NULL; 34680298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 34690298fd71SBarry Smith outputCtx->neighborlist = NULL; 34700298fd71SBarry Smith outputCtx->segmentlist = NULL; 34710298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 3472552f7358SJed Brown outputCtx->numberofedges = 0; 34730298fd71SBarry Smith outputCtx->edgelist = NULL; 34740298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 3475552f7358SJed Brown PetscFunctionReturn(0); 3476552f7358SJed Brown } 3477552f7358SJed Brown 3478552f7358SJed Brown #undef __FUNCT__ 3479552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 34800adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 34810adebc6cSBarry Smith { 3482552f7358SJed Brown PetscFunctionBegin; 3483552f7358SJed Brown free(outputCtx->pointmarkerlist); 3484552f7358SJed Brown free(outputCtx->edgelist); 3485552f7358SJed Brown free(outputCtx->edgemarkerlist); 3486552f7358SJed Brown free(outputCtx->trianglelist); 3487552f7358SJed Brown free(outputCtx->neighborlist); 3488552f7358SJed Brown PetscFunctionReturn(0); 3489552f7358SJed Brown } 3490552f7358SJed Brown 3491552f7358SJed Brown #undef __FUNCT__ 3492552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 3493552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 3494552f7358SJed Brown { 349582f516ccSBarry Smith MPI_Comm comm; 3496552f7358SJed Brown PetscInt dim = 2; 3497552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 3498552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 3499552f7358SJed Brown struct triangulateio in; 3500552f7358SJed Brown struct triangulateio out; 3501552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 3502552f7358SJed Brown PetscMPIInt rank; 3503552f7358SJed Brown PetscErrorCode ierr; 3504552f7358SJed Brown 3505552f7358SJed Brown PetscFunctionBegin; 350682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3507552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3508552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3509552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3510552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 35110d644c17SKarl Rupp 3512552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3513552f7358SJed Brown if (in.numberofpoints > 0) { 3514552f7358SJed Brown PetscSection coordSection; 3515552f7358SJed Brown Vec coordinates; 3516552f7358SJed Brown PetscScalar *array; 3517552f7358SJed Brown 3518785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3519785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3520552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 352169d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3522552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3523552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3524552f7358SJed Brown const PetscInt idx = v - vStart; 3525552f7358SJed Brown PetscInt off, d; 3526552f7358SJed Brown 3527552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3528552f7358SJed Brown for (d = 0; d < dim; ++d) { 3529552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3530552f7358SJed Brown } 3531552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3532552f7358SJed Brown } 3533552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3534552f7358SJed Brown } 3535552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 3536552f7358SJed Brown in.numberofsegments = eEnd - eStart; 3537552f7358SJed Brown if (in.numberofsegments > 0) { 3538785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 3539785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 3540552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 3541552f7358SJed Brown const PetscInt idx = e - eStart; 3542552f7358SJed Brown const PetscInt *cone; 3543552f7358SJed Brown 3544552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 35450d644c17SKarl Rupp 3546552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 3547552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 35480d644c17SKarl Rupp 3549552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 3550552f7358SJed Brown } 3551552f7358SJed Brown } 3552552f7358SJed Brown #if 0 /* Do not currently support holes */ 3553552f7358SJed Brown PetscReal *holeCoords; 3554552f7358SJed Brown PetscInt h, d; 3555552f7358SJed Brown 3556552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3557552f7358SJed Brown if (in.numberofholes > 0) { 3558785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3559552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3560552f7358SJed Brown for (d = 0; d < dim; ++d) { 3561552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3562552f7358SJed Brown } 3563552f7358SJed Brown } 3564552f7358SJed Brown } 3565552f7358SJed Brown #endif 3566552f7358SJed Brown if (!rank) { 3567552f7358SJed Brown char args[32]; 3568552f7358SJed Brown 3569552f7358SJed Brown /* Take away 'Q' for verbose output */ 3570552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3571552f7358SJed Brown if (createConvexHull) { 3572552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 3573552f7358SJed Brown } 3574552f7358SJed Brown if (constrained) { 3575552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 3576552f7358SJed Brown } 35770298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3578552f7358SJed Brown } 3579552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3580552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3581552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3582552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3583552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 3584552f7358SJed Brown 3585552f7358SJed Brown { 3586552f7358SJed Brown const PetscInt numCorners = 3; 3587552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3588552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3589552f7358SJed Brown const int *cells = out.trianglelist; 3590552f7358SJed Brown const double *meshCoords = out.pointlist; 3591552f7358SJed Brown 35920fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3593552f7358SJed Brown /* Set labels */ 3594552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3595552f7358SJed Brown if (out.pointmarkerlist[v]) { 3596552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3597552f7358SJed Brown } 3598552f7358SJed Brown } 3599552f7358SJed Brown if (interpolate) { 3600552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3601552f7358SJed Brown if (out.edgemarkerlist[e]) { 3602552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3603552f7358SJed Brown const PetscInt *edges; 3604552f7358SJed Brown PetscInt numEdges; 3605552f7358SJed Brown 3606552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3607552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3608552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3609552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3610552f7358SJed Brown } 3611552f7358SJed Brown } 3612552f7358SJed Brown } 3613552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3614552f7358SJed Brown } 3615552f7358SJed Brown #if 0 /* Do not currently support holes */ 3616552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3617552f7358SJed Brown #endif 3618552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3619552f7358SJed Brown PetscFunctionReturn(0); 3620552f7358SJed Brown } 3621552f7358SJed Brown 3622552f7358SJed Brown #undef __FUNCT__ 3623552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 3624552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 3625552f7358SJed Brown { 362682f516ccSBarry Smith MPI_Comm comm; 3627552f7358SJed Brown PetscInt dim = 2; 3628552f7358SJed Brown struct triangulateio in; 3629552f7358SJed Brown struct triangulateio out; 3630552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3631552f7358SJed Brown PetscMPIInt rank; 3632552f7358SJed Brown PetscErrorCode ierr; 3633552f7358SJed Brown 3634552f7358SJed Brown PetscFunctionBegin; 363582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3636552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3637552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3638552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3639552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3640552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3641552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 36420d644c17SKarl Rupp 3643552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3644552f7358SJed Brown if (in.numberofpoints > 0) { 3645552f7358SJed Brown PetscSection coordSection; 3646552f7358SJed Brown Vec coordinates; 3647552f7358SJed Brown PetscScalar *array; 3648552f7358SJed Brown 3649785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3650785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3651552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 365269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3653552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3654552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3655552f7358SJed Brown const PetscInt idx = v - vStart; 3656552f7358SJed Brown PetscInt off, d; 3657552f7358SJed Brown 3658552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3659552f7358SJed Brown for (d = 0; d < dim; ++d) { 3660552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3661552f7358SJed Brown } 3662552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3663552f7358SJed Brown } 3664552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3665552f7358SJed Brown } 3666552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 36670d644c17SKarl Rupp 3668552f7358SJed Brown in.numberofcorners = 3; 3669552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 36700d644c17SKarl Rupp 3671552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 3672552f7358SJed Brown if (in.numberoftriangles > 0) { 3673785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 3674552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3675552f7358SJed Brown const PetscInt idx = c - cStart; 36760298fd71SBarry Smith PetscInt *closure = NULL; 3677552f7358SJed Brown PetscInt closureSize; 3678552f7358SJed Brown 3679552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3680552f7358SJed 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); 3681552f7358SJed Brown for (v = 0; v < 3; ++v) { 3682552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 3683552f7358SJed Brown } 3684552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3685552f7358SJed Brown } 3686552f7358SJed Brown } 3687552f7358SJed Brown /* TODO: Segment markers are missing on input */ 3688552f7358SJed Brown #if 0 /* Do not currently support holes */ 3689552f7358SJed Brown PetscReal *holeCoords; 3690552f7358SJed Brown PetscInt h, d; 3691552f7358SJed Brown 3692552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3693552f7358SJed Brown if (in.numberofholes > 0) { 3694785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3695552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3696552f7358SJed Brown for (d = 0; d < dim; ++d) { 3697552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3698552f7358SJed Brown } 3699552f7358SJed Brown } 3700552f7358SJed Brown } 3701552f7358SJed Brown #endif 3702552f7358SJed Brown if (!rank) { 3703552f7358SJed Brown char args[32]; 3704552f7358SJed Brown 3705552f7358SJed Brown /* Take away 'Q' for verbose output */ 3706552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 37070298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3708552f7358SJed Brown } 3709552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3710552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3711552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3712552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3713552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3714552f7358SJed Brown 3715552f7358SJed Brown { 3716552f7358SJed Brown const PetscInt numCorners = 3; 3717552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3718552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3719552f7358SJed Brown const int *cells = out.trianglelist; 3720552f7358SJed Brown const double *meshCoords = out.pointlist; 3721552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3722552f7358SJed Brown 37230fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3724552f7358SJed Brown /* Set labels */ 3725552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3726552f7358SJed Brown if (out.pointmarkerlist[v]) { 3727552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3728552f7358SJed Brown } 3729552f7358SJed Brown } 3730552f7358SJed Brown if (interpolate) { 3731552f7358SJed Brown PetscInt e; 3732552f7358SJed Brown 3733552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3734552f7358SJed Brown if (out.edgemarkerlist[e]) { 3735552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3736552f7358SJed Brown const PetscInt *edges; 3737552f7358SJed Brown PetscInt numEdges; 3738552f7358SJed Brown 3739552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3740552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3741552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3742552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3743552f7358SJed Brown } 3744552f7358SJed Brown } 3745552f7358SJed Brown } 3746552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3747552f7358SJed Brown } 3748552f7358SJed Brown #if 0 /* Do not currently support holes */ 3749552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3750552f7358SJed Brown #endif 3751552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3752552f7358SJed Brown PetscFunctionReturn(0); 3753552f7358SJed Brown } 3754552f7358SJed Brown #endif 3755552f7358SJed Brown 3756519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3757552f7358SJed Brown #include <tetgen.h> 3758552f7358SJed Brown #undef __FUNCT__ 3759552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3760552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3761552f7358SJed Brown { 376282f516ccSBarry Smith MPI_Comm comm; 3763552f7358SJed Brown const PetscInt dim = 3; 3764552f7358SJed Brown ::tetgenio in; 3765552f7358SJed Brown ::tetgenio out; 3766552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3767552f7358SJed Brown PetscMPIInt rank; 3768552f7358SJed Brown PetscErrorCode ierr; 3769552f7358SJed Brown 3770552f7358SJed Brown PetscFunctionBegin; 377182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3772552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3773552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3774552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3775552f7358SJed Brown if (in.numberofpoints > 0) { 3776552f7358SJed Brown PetscSection coordSection; 3777552f7358SJed Brown Vec coordinates; 3778552f7358SJed Brown PetscScalar *array; 3779552f7358SJed Brown 3780552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3781552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 37820d644c17SKarl Rupp 3783552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 378469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3785552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3786552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3787552f7358SJed Brown const PetscInt idx = v - vStart; 3788552f7358SJed Brown PetscInt off, d; 3789552f7358SJed Brown 3790552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 37910d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3792552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3793552f7358SJed Brown } 3794552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3795552f7358SJed Brown } 3796552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 37970d644c17SKarl Rupp 3798552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3799552f7358SJed Brown if (in.numberoffacets > 0) { 3800552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3801552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3802552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3803552f7358SJed Brown const PetscInt idx = f - fStart; 38040298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3805552f7358SJed Brown 3806552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3807552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3808552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3809552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3810552f7358SJed Brown 3811552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3812552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3813552f7358SJed Brown const PetscInt point = points[p]; 38140d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3815552f7358SJed Brown } 3816552f7358SJed Brown 3817552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3818552f7358SJed Brown poly->numberofvertices = numVertices; 3819552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3820552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3821552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3822552f7358SJed Brown poly->vertexlist[v] = vIdx; 3823552f7358SJed Brown } 3824552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3825552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3826552f7358SJed Brown } 3827552f7358SJed Brown } 3828552f7358SJed Brown if (!rank) { 3829552f7358SJed Brown char args[32]; 3830552f7358SJed Brown 3831552f7358SJed Brown /* Take away 'Q' for verbose output */ 3832552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3833552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3834552f7358SJed Brown } 3835552f7358SJed Brown { 3836552f7358SJed Brown const PetscInt numCorners = 4; 3837552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3838552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3839552f7358SJed Brown const double *meshCoords = out.pointlist; 38401d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3841552f7358SJed Brown 38429db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 38430fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3844552f7358SJed Brown /* Set labels */ 3845552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3846552f7358SJed Brown if (out.pointmarkerlist[v]) { 3847552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3848552f7358SJed Brown } 3849552f7358SJed Brown } 3850552f7358SJed Brown if (interpolate) { 3851552f7358SJed Brown PetscInt e; 3852552f7358SJed Brown 3853552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3854552f7358SJed Brown if (out.edgemarkerlist[e]) { 3855552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3856552f7358SJed Brown const PetscInt *edges; 3857552f7358SJed Brown PetscInt numEdges; 3858552f7358SJed Brown 3859552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3860552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3861552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3862552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3863552f7358SJed Brown } 3864552f7358SJed Brown } 3865552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3866552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3867552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3868552f7358SJed Brown const PetscInt *faces; 3869552f7358SJed Brown PetscInt numFaces; 3870552f7358SJed Brown 3871552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3872552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3873552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3874552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3875552f7358SJed Brown } 3876552f7358SJed Brown } 3877552f7358SJed Brown } 3878552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3879552f7358SJed Brown } 3880552f7358SJed Brown PetscFunctionReturn(0); 3881552f7358SJed Brown } 3882552f7358SJed Brown 3883552f7358SJed Brown #undef __FUNCT__ 3884552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3885552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3886552f7358SJed Brown { 388782f516ccSBarry Smith MPI_Comm comm; 3888552f7358SJed Brown const PetscInt dim = 3; 3889552f7358SJed Brown ::tetgenio in; 3890552f7358SJed Brown ::tetgenio out; 3891552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3892552f7358SJed Brown PetscMPIInt rank; 3893552f7358SJed Brown PetscErrorCode ierr; 3894552f7358SJed Brown 3895552f7358SJed Brown PetscFunctionBegin; 389682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3897552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3898552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3899552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3900552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 39010d644c17SKarl Rupp 3902552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3903552f7358SJed Brown if (in.numberofpoints > 0) { 3904552f7358SJed Brown PetscSection coordSection; 3905552f7358SJed Brown Vec coordinates; 3906552f7358SJed Brown PetscScalar *array; 3907552f7358SJed Brown 3908552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3909552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 39100d644c17SKarl Rupp 3911552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 391269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3913552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3914552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3915552f7358SJed Brown const PetscInt idx = v - vStart; 3916552f7358SJed Brown PetscInt off, d; 3917552f7358SJed Brown 3918552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 39190d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3920552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3921552f7358SJed Brown } 3922552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3923552f7358SJed Brown } 3924552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 39250d644c17SKarl Rupp 3926552f7358SJed Brown in.numberofcorners = 4; 3927552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3928552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3929552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3930552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3931552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3932552f7358SJed Brown const PetscInt idx = c - cStart; 39330298fd71SBarry Smith PetscInt *closure = NULL; 3934552f7358SJed Brown PetscInt closureSize; 3935552f7358SJed Brown 3936552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3937552f7358SJed 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); 3938552f7358SJed Brown for (v = 0; v < 4; ++v) { 3939552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3940552f7358SJed Brown } 3941552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3942552f7358SJed Brown } 3943552f7358SJed Brown } 394419436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3945552f7358SJed Brown if (!rank) { 3946552f7358SJed Brown char args[32]; 3947552f7358SJed Brown 3948552f7358SJed Brown /* Take away 'Q' for verbose output */ 394919436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3950552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3951552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3952552f7358SJed Brown } 3953552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3954552f7358SJed Brown 3955552f7358SJed Brown { 3956552f7358SJed Brown const PetscInt numCorners = 4; 3957552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3958552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3959552f7358SJed Brown const double *meshCoords = out.pointlist; 39601d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 39611d4b4d7bSJed Brown 3962552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3963552f7358SJed Brown 39649db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 39650fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3966552f7358SJed Brown /* Set labels */ 3967552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3968552f7358SJed Brown if (out.pointmarkerlist[v]) { 3969552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3970552f7358SJed Brown } 3971552f7358SJed Brown } 3972552f7358SJed Brown if (interpolate) { 3973552f7358SJed Brown PetscInt e, f; 3974552f7358SJed Brown 3975552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3976552f7358SJed Brown if (out.edgemarkerlist[e]) { 3977552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3978552f7358SJed Brown const PetscInt *edges; 3979552f7358SJed Brown PetscInt numEdges; 3980552f7358SJed Brown 3981552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3982552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3983552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3984552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3985552f7358SJed Brown } 3986552f7358SJed Brown } 3987552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3988552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3989552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3990552f7358SJed Brown const PetscInt *faces; 3991552f7358SJed Brown PetscInt numFaces; 3992552f7358SJed Brown 3993552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3994552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3995552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3996552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3997552f7358SJed Brown } 3998552f7358SJed Brown } 3999552f7358SJed Brown } 4000552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4001552f7358SJed Brown } 4002552f7358SJed Brown PetscFunctionReturn(0); 4003552f7358SJed Brown } 4004552f7358SJed Brown #endif 4005552f7358SJed Brown 4006519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4007552f7358SJed Brown #include "ctetgen.h" 4008552f7358SJed Brown 4009552f7358SJed Brown #undef __FUNCT__ 4010552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 4011552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 4012552f7358SJed Brown { 401382f516ccSBarry Smith MPI_Comm comm; 4014552f7358SJed Brown const PetscInt dim = 3; 4015552f7358SJed Brown PLC *in, *out; 4016552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 4017552f7358SJed Brown PetscMPIInt rank; 4018552f7358SJed Brown PetscErrorCode ierr; 4019552f7358SJed Brown 4020552f7358SJed Brown PetscFunctionBegin; 402182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 40220298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4023552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4024552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 4025552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4026552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 40270d644c17SKarl Rupp 4028552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4029552f7358SJed Brown if (in->numberofpoints > 0) { 4030552f7358SJed Brown PetscSection coordSection; 4031552f7358SJed Brown Vec coordinates; 4032552f7358SJed Brown PetscScalar *array; 4033552f7358SJed Brown 4034785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4035785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4036552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 403769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 4038552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4039552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4040552f7358SJed Brown const PetscInt idx = v - vStart; 4041552f7358SJed Brown PetscInt off, d, m; 4042552f7358SJed Brown 4043552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4044552f7358SJed Brown for (d = 0; d < dim; ++d) { 4045552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4046552f7358SJed Brown } 4047552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 40480d644c17SKarl Rupp 4049552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4050552f7358SJed Brown } 4051552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4052552f7358SJed Brown } 4053552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 40540d644c17SKarl Rupp 4055552f7358SJed Brown in->numberoffacets = fEnd - fStart; 4056552f7358SJed Brown if (in->numberoffacets > 0) { 4057785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 4058785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 4059552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 4060552f7358SJed Brown const PetscInt idx = f - fStart; 40610298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 4062552f7358SJed Brown polygon *poly; 4063552f7358SJed Brown 4064552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 40650d644c17SKarl Rupp 4066785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 40670d644c17SKarl Rupp 4068552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 40690298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 4070552f7358SJed Brown 4071552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4072552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4073552f7358SJed Brown const PetscInt point = points[p]; 40740d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 4075552f7358SJed Brown } 4076552f7358SJed Brown 4077552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 4078552f7358SJed Brown poly->numberofvertices = numVertices; 4079785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 4080552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4081552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 4082552f7358SJed Brown poly->vertexlist[v] = vIdx; 4083552f7358SJed Brown } 4084552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 4085552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 4086552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4087552f7358SJed Brown } 4088552f7358SJed Brown } 4089552f7358SJed Brown if (!rank) { 4090552f7358SJed Brown TetGenOpts t; 4091552f7358SJed Brown 4092552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 4093552f7358SJed Brown t.in = boundary; /* Should go away */ 4094552f7358SJed Brown t.plc = 1; 4095552f7358SJed Brown t.quality = 1; 4096552f7358SJed Brown t.edgesout = 1; 4097552f7358SJed Brown t.zeroindex = 1; 4098552f7358SJed Brown t.quiet = 1; 4099552f7358SJed Brown t.verbose = verbose; 4100552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4101552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4102552f7358SJed Brown } 4103552f7358SJed Brown { 4104552f7358SJed Brown const PetscInt numCorners = 4; 4105552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4106552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4107552f7358SJed Brown const double *meshCoords = out->pointlist; 41081d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4109552f7358SJed Brown 41109db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 41110fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 4112552f7358SJed Brown /* Set labels */ 4113552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4114552f7358SJed Brown if (out->pointmarkerlist[v]) { 4115552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4116552f7358SJed Brown } 4117552f7358SJed Brown } 4118552f7358SJed Brown if (interpolate) { 4119552f7358SJed Brown PetscInt e; 4120552f7358SJed Brown 4121552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4122552f7358SJed Brown if (out->edgemarkerlist[e]) { 4123552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4124552f7358SJed Brown const PetscInt *edges; 4125552f7358SJed Brown PetscInt numEdges; 4126552f7358SJed Brown 4127552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4128552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4129552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4130552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4131552f7358SJed Brown } 4132552f7358SJed Brown } 4133552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4134552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4135552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4136552f7358SJed Brown const PetscInt *faces; 4137552f7358SJed Brown PetscInt numFaces; 4138552f7358SJed Brown 4139552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4140552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4141552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4142552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4143552f7358SJed Brown } 4144552f7358SJed Brown } 4145552f7358SJed Brown } 4146552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 4147552f7358SJed Brown } 4148552f7358SJed Brown 4149552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4150552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4151552f7358SJed Brown PetscFunctionReturn(0); 4152552f7358SJed Brown } 4153552f7358SJed Brown 4154552f7358SJed Brown #undef __FUNCT__ 4155552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 4156552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 4157552f7358SJed Brown { 415882f516ccSBarry Smith MPI_Comm comm; 4159552f7358SJed Brown const PetscInt dim = 3; 4160552f7358SJed Brown PLC *in, *out; 4161552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 4162552f7358SJed Brown PetscMPIInt rank; 4163552f7358SJed Brown PetscErrorCode ierr; 4164552f7358SJed Brown 4165552f7358SJed Brown PetscFunctionBegin; 416682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 41670298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4168552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4169552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4170552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 4171552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 4172552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4173552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 41740d644c17SKarl Rupp 4175552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4176552f7358SJed Brown if (in->numberofpoints > 0) { 4177552f7358SJed Brown PetscSection coordSection; 4178552f7358SJed Brown Vec coordinates; 4179552f7358SJed Brown PetscScalar *array; 4180552f7358SJed Brown 4181785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4182785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4183552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 418469d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 4185552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4186552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4187552f7358SJed Brown const PetscInt idx = v - vStart; 4188552f7358SJed Brown PetscInt off, d, m; 4189552f7358SJed Brown 4190552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4191552f7358SJed Brown for (d = 0; d < dim; ++d) { 4192552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4193552f7358SJed Brown } 4194552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 41950d644c17SKarl Rupp 4196552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4197552f7358SJed Brown } 4198552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4199552f7358SJed Brown } 4200552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 42010d644c17SKarl Rupp 4202552f7358SJed Brown in->numberofcorners = 4; 4203552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 4204552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 4205552f7358SJed Brown if (in->numberoftetrahedra > 0) { 4206785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 4207552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4208552f7358SJed Brown const PetscInt idx = c - cStart; 42090298fd71SBarry Smith PetscInt *closure = NULL; 4210552f7358SJed Brown PetscInt closureSize; 4211552f7358SJed Brown 4212552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4213552f7358SJed 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); 4214552f7358SJed Brown for (v = 0; v < 4; ++v) { 4215552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4216552f7358SJed Brown } 4217552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4218552f7358SJed Brown } 4219552f7358SJed Brown } 4220552f7358SJed Brown if (!rank) { 4221552f7358SJed Brown TetGenOpts t; 4222552f7358SJed Brown 4223552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 42240d644c17SKarl Rupp 4225552f7358SJed Brown t.in = dm; /* Should go away */ 4226552f7358SJed Brown t.refine = 1; 4227552f7358SJed Brown t.varvolume = 1; 4228552f7358SJed Brown t.quality = 1; 4229552f7358SJed Brown t.edgesout = 1; 4230552f7358SJed Brown t.zeroindex = 1; 4231552f7358SJed Brown t.quiet = 1; 4232552f7358SJed Brown t.verbose = verbose; /* Change this */ 42330d644c17SKarl Rupp 4234552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4235552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4236552f7358SJed Brown } 4237552f7358SJed Brown { 4238552f7358SJed Brown const PetscInt numCorners = 4; 4239552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4240552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4241552f7358SJed Brown const double *meshCoords = out->pointlist; 42421d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4243552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4244552f7358SJed Brown 42459db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 42460fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4247552f7358SJed Brown /* Set labels */ 4248552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4249552f7358SJed Brown if (out->pointmarkerlist[v]) { 4250552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4251552f7358SJed Brown } 4252552f7358SJed Brown } 4253552f7358SJed Brown if (interpolate) { 4254552f7358SJed Brown PetscInt e, f; 4255552f7358SJed Brown 4256552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4257552f7358SJed Brown if (out->edgemarkerlist[e]) { 4258552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4259552f7358SJed Brown const PetscInt *edges; 4260552f7358SJed Brown PetscInt numEdges; 4261552f7358SJed Brown 4262552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4263552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4264552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4265552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4266552f7358SJed Brown } 4267552f7358SJed Brown } 4268552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4269552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4270552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4271552f7358SJed Brown const PetscInt *faces; 4272552f7358SJed Brown PetscInt numFaces; 4273552f7358SJed Brown 4274552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4275552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4276552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4277552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4278552f7358SJed Brown } 4279552f7358SJed Brown } 4280552f7358SJed Brown } 4281552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4282552f7358SJed Brown } 4283552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4284552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4285552f7358SJed Brown PetscFunctionReturn(0); 4286552f7358SJed Brown } 4287552f7358SJed Brown #endif 4288552f7358SJed Brown 4289552f7358SJed Brown #undef __FUNCT__ 4290552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 4291552f7358SJed Brown /*@C 4292552f7358SJed Brown DMPlexGenerate - Generates a mesh. 4293552f7358SJed Brown 4294552f7358SJed Brown Not Collective 4295552f7358SJed Brown 4296552f7358SJed Brown Input Parameters: 4297552f7358SJed Brown + boundary - The DMPlex boundary object 4298552f7358SJed Brown . name - The mesh generation package name 4299552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 4300552f7358SJed Brown 4301552f7358SJed Brown Output Parameter: 4302552f7358SJed Brown . mesh - The DMPlex object 4303552f7358SJed Brown 4304552f7358SJed Brown Level: intermediate 4305552f7358SJed Brown 4306552f7358SJed Brown .keywords: mesh, elements 4307552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 4308552f7358SJed Brown @*/ 4309552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 4310552f7358SJed Brown { 4311552f7358SJed Brown PetscInt dim; 4312552f7358SJed Brown char genname[1024]; 4313552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4314552f7358SJed Brown PetscErrorCode ierr; 4315552f7358SJed Brown 4316552f7358SJed Brown PetscFunctionBegin; 4317552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 4318552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 4319552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 4320552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 43210d644c17SKarl Rupp if (flg) name = genname; 4322552f7358SJed Brown if (name) { 4323552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4324552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4325552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4326552f7358SJed Brown } 4327552f7358SJed Brown switch (dim) { 4328552f7358SJed Brown case 1: 4329552f7358SJed Brown if (!name || isTriangle) { 4330519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4331552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 4332552f7358SJed Brown #else 433382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 4334552f7358SJed Brown #endif 433582f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4336552f7358SJed Brown break; 4337552f7358SJed Brown case 2: 4338552f7358SJed Brown if (!name || isCTetgen) { 4339519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4340552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4341552f7358SJed Brown #else 434282f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4343552f7358SJed Brown #endif 4344552f7358SJed Brown } else if (isTetgen) { 4345519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4346552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4347552f7358SJed Brown #else 434882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4349552f7358SJed Brown #endif 435082f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4351552f7358SJed Brown break; 4352552f7358SJed Brown default: 435382f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 4354552f7358SJed Brown } 4355552f7358SJed Brown PetscFunctionReturn(0); 4356552f7358SJed Brown } 4357552f7358SJed Brown 4358552f7358SJed Brown #undef __FUNCT__ 4359552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 4360552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 4361552f7358SJed Brown { 4362552f7358SJed Brown PetscReal refinementLimit; 4363552f7358SJed Brown PetscInt dim, cStart, cEnd; 43640298fd71SBarry Smith char genname[1024], *name = NULL; 4365552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4366552f7358SJed Brown PetscErrorCode ierr; 4367552f7358SJed Brown 4368552f7358SJed Brown PetscFunctionBegin; 4369552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 4370552f7358SJed Brown if (isUniform) { 4371552f7358SJed Brown CellRefiner cellRefiner; 4372552f7358SJed Brown 4373509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 4374509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 4375552f7358SJed Brown PetscFunctionReturn(0); 4376552f7358SJed Brown } 4377552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 4378552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 4379552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 4380552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 4381552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->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 2: 4390552f7358SJed Brown if (!name || isTriangle) { 4391519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4392552f7358SJed Brown double *maxVolumes; 4393552f7358SJed Brown PetscInt c; 4394552f7358SJed Brown 4395785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 43960d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4397552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 43986b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 4399552f7358SJed Brown #else 440082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 4401552f7358SJed Brown #endif 440282f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4403552f7358SJed Brown break; 4404552f7358SJed Brown case 3: 4405552f7358SJed Brown if (!name || isCTetgen) { 4406519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4407552f7358SJed Brown PetscReal *maxVolumes; 4408552f7358SJed Brown PetscInt c; 4409552f7358SJed Brown 4410785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44110d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4412552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4413552f7358SJed Brown #else 441482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4415552f7358SJed Brown #endif 4416552f7358SJed Brown } else if (isTetgen) { 4417519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4418552f7358SJed Brown double *maxVolumes; 4419552f7358SJed Brown PetscInt c; 4420552f7358SJed Brown 4421785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44220d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4423552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4424552f7358SJed Brown #else 442582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4426552f7358SJed Brown #endif 442782f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4428552f7358SJed Brown break; 4429552f7358SJed Brown default: 443082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 4431552f7358SJed Brown } 4432552f7358SJed Brown PetscFunctionReturn(0); 4433552f7358SJed Brown } 4434552f7358SJed Brown 4435552f7358SJed Brown #undef __FUNCT__ 44360a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 44370a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 44380a6ba040SMatthew G. Knepley { 44390a6ba040SMatthew G. Knepley DM cdm = dm; 44400a6ba040SMatthew G. Knepley PetscInt r; 44410a6ba040SMatthew G. Knepley PetscBool isUniform; 44420a6ba040SMatthew G. Knepley PetscErrorCode ierr; 44430a6ba040SMatthew G. Knepley 44440a6ba040SMatthew G. Knepley PetscFunctionBegin; 44450a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 44460a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 44470a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 44480a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 44490a6ba040SMatthew G. Knepley 44500a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 44510a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 44520a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 44530a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 44540a6ba040SMatthew G. Knepley } 44550a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 44560a6ba040SMatthew G. Knepley } 44570a6ba040SMatthew G. Knepley 44580a6ba040SMatthew G. Knepley #undef __FUNCT__ 44590a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 44600a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 44610a6ba040SMatthew G. Knepley { 44620a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 44630a6ba040SMatthew G. Knepley 44640a6ba040SMatthew G. Knepley PetscFunctionBegin; 44650a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 44660a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 44670a6ba040SMatthew G. Knepley } 44680a6ba040SMatthew G. Knepley 44690a6ba040SMatthew G. Knepley #undef __FUNCT__ 4470aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 4471552f7358SJed Brown /*@ 4472aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 4473552f7358SJed Brown 4474552f7358SJed Brown Not Collective 4475552f7358SJed Brown 4476aa50250dSMatthew G. Knepley Input Parameter: 4477552f7358SJed Brown . dm - The DMPlex object 4478552f7358SJed Brown 4479aa50250dSMatthew G. Knepley Output Parameter: 4480aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 4481552f7358SJed Brown 4482552f7358SJed Brown Level: developer 4483552f7358SJed Brown 4484aa50250dSMatthew G. Knepley .keywords: mesh, points 4485aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4486aa50250dSMatthew G. Knepley @*/ 4487aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 4488aa50250dSMatthew G. Knepley { 4489aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4490aa50250dSMatthew G. Knepley PetscErrorCode ierr; 4491aa50250dSMatthew G. Knepley 4492aa50250dSMatthew G. Knepley PetscFunctionBegin; 4493aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4494aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 449563d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 4496aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 4497aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 4498aa50250dSMatthew G. Knepley } 4499aa50250dSMatthew G. Knepley 4500aa50250dSMatthew G. Knepley #undef __FUNCT__ 4501aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 4502aa50250dSMatthew G. Knepley /*@ 4503aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 4504aa50250dSMatthew G. Knepley 4505aa50250dSMatthew G. Knepley Not Collective 4506aa50250dSMatthew G. Knepley 4507aa50250dSMatthew G. Knepley Input Parameter: 4508aa50250dSMatthew G. Knepley . dm - The DMPlex object 4509aa50250dSMatthew G. Knepley 4510aa50250dSMatthew G. Knepley Output Parameter: 4511aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 4512aa50250dSMatthew G. Knepley 4513aa50250dSMatthew G. Knepley Level: developer 4514552f7358SJed Brown 4515552f7358SJed Brown .keywords: mesh, points 4516aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4517552f7358SJed Brown @*/ 4518552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 4519552f7358SJed Brown { 4520aa50250dSMatthew G. Knepley DMLabel label; 4521aa50250dSMatthew G. Knepley PetscInt d = 0; 4522552f7358SJed Brown PetscErrorCode ierr; 4523552f7358SJed Brown 4524552f7358SJed Brown PetscFunctionBegin; 4525552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4526552f7358SJed Brown PetscValidPointer(depth, 2); 4527aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4528aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 4529552f7358SJed Brown *depth = d-1; 4530552f7358SJed Brown PetscFunctionReturn(0); 4531552f7358SJed Brown } 4532552f7358SJed Brown 4533552f7358SJed Brown #undef __FUNCT__ 4534552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 4535552f7358SJed Brown /*@ 4536552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 4537552f7358SJed Brown 4538552f7358SJed Brown Not Collective 4539552f7358SJed Brown 4540552f7358SJed Brown Input Parameters: 4541552f7358SJed Brown + dm - The DMPlex object 4542552f7358SJed Brown - stratumValue - The requested depth 4543552f7358SJed Brown 4544552f7358SJed Brown Output Parameters: 4545552f7358SJed Brown + start - The first point at this depth 4546552f7358SJed Brown - end - One beyond the last point at this depth 4547552f7358SJed Brown 4548552f7358SJed Brown Level: developer 4549552f7358SJed Brown 4550552f7358SJed Brown .keywords: mesh, points 4551552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 4552552f7358SJed Brown @*/ 45530adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 45540adebc6cSBarry Smith { 4555aa50250dSMatthew G. Knepley DMLabel label; 455663d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 4557552f7358SJed Brown PetscErrorCode ierr; 4558552f7358SJed Brown 4559552f7358SJed Brown PetscFunctionBegin; 4560552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 456163d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 456263d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4563552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 45640d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 456563d1a920SMatthew G. Knepley if (stratumValue < 0) { 456663d1a920SMatthew G. Knepley if (start) *start = pStart; 456763d1a920SMatthew G. Knepley if (end) *end = pEnd; 456863d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4569552f7358SJed Brown } 4570aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 457163d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 457263d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 4573552f7358SJed Brown PetscFunctionReturn(0); 4574552f7358SJed Brown } 4575552f7358SJed Brown 4576552f7358SJed Brown #undef __FUNCT__ 4577552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4578552f7358SJed Brown /*@ 4579552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4580552f7358SJed Brown 4581552f7358SJed Brown Not Collective 4582552f7358SJed Brown 4583552f7358SJed Brown Input Parameters: 4584552f7358SJed Brown + dm - The DMPlex object 4585552f7358SJed Brown - stratumValue - The requested height 4586552f7358SJed Brown 4587552f7358SJed Brown Output Parameters: 4588552f7358SJed Brown + start - The first point at this height 4589552f7358SJed Brown - end - One beyond the last point at this height 4590552f7358SJed Brown 4591552f7358SJed Brown Level: developer 4592552f7358SJed Brown 4593552f7358SJed Brown .keywords: mesh, points 4594552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4595552f7358SJed Brown @*/ 45960adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 45970adebc6cSBarry Smith { 4598aa50250dSMatthew G. Knepley DMLabel label; 459963d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4600552f7358SJed Brown PetscErrorCode ierr; 4601552f7358SJed Brown 4602552f7358SJed Brown PetscFunctionBegin; 4603552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 460463d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 460563d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4606552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 46070d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 460863d1a920SMatthew G. Knepley if (stratumValue < 0) { 460963d1a920SMatthew G. Knepley if (start) *start = pStart; 461063d1a920SMatthew G. Knepley if (end) *end = pEnd; 461163d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4612552f7358SJed Brown } 4613aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4614aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 461563d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 461663d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4617552f7358SJed Brown PetscFunctionReturn(0); 4618552f7358SJed Brown } 4619552f7358SJed Brown 4620552f7358SJed Brown #undef __FUNCT__ 4621552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4622552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4623a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4624a6dfd86eSKarl Rupp { 4625552f7358SJed Brown PetscInt *numDofTot; 4626916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4627916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4628552f7358SJed Brown PetscErrorCode ierr; 4629552f7358SJed Brown 4630552f7358SJed Brown PetscFunctionBegin; 4631785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4632552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4633552f7358SJed Brown numDofTot[d] = 0; 46340d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4635552f7358SJed Brown } 463682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4637552f7358SJed Brown if (numFields > 0) { 4638552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4639552f7358SJed Brown if (numComp) { 4640552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4641552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4642552f7358SJed Brown } 4643552f7358SJed Brown } 4644552f7358SJed Brown } 4645552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4646552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4647916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4648916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4649916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4650916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4651552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4652552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4653552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4654552f7358SJed Brown } 4655552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4656552f7358SJed Brown } 4657552f7358SJed Brown } 4658552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4659552f7358SJed Brown PetscFunctionReturn(0); 4660552f7358SJed Brown } 4661552f7358SJed Brown 4662552f7358SJed Brown #undef __FUNCT__ 4663552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4664552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4665552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4666552f7358SJed Brown */ 4667a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4668a6dfd86eSKarl Rupp { 4669552f7358SJed Brown PetscInt numFields; 4670552f7358SJed Brown PetscInt bc; 4671552f7358SJed Brown PetscErrorCode ierr; 4672552f7358SJed Brown 4673552f7358SJed Brown PetscFunctionBegin; 4674552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4675552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4676552f7358SJed Brown PetscInt field = 0; 4677552f7358SJed Brown const PetscInt *idx; 4678552f7358SJed Brown PetscInt n, i; 4679552f7358SJed Brown 46800d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4681552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4682552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4683552f7358SJed Brown for (i = 0; i < n; ++i) { 4684552f7358SJed Brown const PetscInt p = idx[i]; 4685552f7358SJed Brown PetscInt numConst = constDof; 4686552f7358SJed Brown 4687552f7358SJed Brown /* Constrain every dof on the point */ 4688552f7358SJed Brown if (numConst < 0) { 4689552f7358SJed Brown if (numFields) { 4690552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4691552f7358SJed Brown } else { 4692552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4693552f7358SJed Brown } 4694552f7358SJed Brown } 4695552f7358SJed Brown if (numFields) { 4696552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4697552f7358SJed Brown } 4698552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4699552f7358SJed Brown } 4700552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4701552f7358SJed Brown } 4702552f7358SJed Brown PetscFunctionReturn(0); 4703552f7358SJed Brown } 4704552f7358SJed Brown 4705552f7358SJed Brown #undef __FUNCT__ 4706552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4707552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 47080adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 47090adebc6cSBarry Smith { 4710552f7358SJed Brown PetscInt *maxConstraints; 4711552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4712552f7358SJed Brown PetscErrorCode ierr; 4713552f7358SJed Brown 4714552f7358SJed Brown PetscFunctionBegin; 4715552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4716552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4717785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 47180d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4719552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4720552f7358SJed Brown PetscInt cdof; 4721552f7358SJed Brown 4722552f7358SJed Brown if (numFields) { 4723552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4724552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4725552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4726552f7358SJed Brown } 4727552f7358SJed Brown } else { 4728552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4729552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4730552f7358SJed Brown } 4731552f7358SJed Brown } 4732552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4733552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4734552f7358SJed Brown } 4735552f7358SJed Brown if (maxConstraints[numFields]) { 4736552f7358SJed Brown PetscInt *indices; 4737552f7358SJed Brown 4738785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4739552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4740552f7358SJed Brown PetscInt cdof, d; 4741552f7358SJed Brown 4742552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4743552f7358SJed Brown if (cdof) { 4744552f7358SJed 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]); 4745552f7358SJed Brown if (numFields) { 4746552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4747552f7358SJed Brown 4748552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4749552f7358SJed Brown PetscInt cfdof, fdof; 4750552f7358SJed Brown 4751552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4752552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4753552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 47540d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4755552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 47560d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4757552f7358SJed Brown numConst += cfdof; 4758552f7358SJed Brown foff += fdof; 4759552f7358SJed Brown } 4760552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4761552f7358SJed Brown } else { 47620d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4763552f7358SJed Brown } 4764552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4765552f7358SJed Brown } 4766552f7358SJed Brown } 4767552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4768552f7358SJed Brown } 4769552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4770552f7358SJed Brown PetscFunctionReturn(0); 4771552f7358SJed Brown } 4772552f7358SJed Brown 4773552f7358SJed Brown #undef __FUNCT__ 4774552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4775552f7358SJed Brown /* Set the constrained field indices on each point */ 47760adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 47770adebc6cSBarry Smith { 4778552f7358SJed Brown const PetscInt *points, *indices; 4779552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4780552f7358SJed Brown PetscErrorCode ierr; 4781552f7358SJed Brown 4782552f7358SJed Brown PetscFunctionBegin; 4783552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4784552f7358SJed 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); 4785552f7358SJed Brown 4786552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4787552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4788552f7358SJed Brown if (!constraintIndices) { 4789552f7358SJed Brown PetscInt *idx, i; 4790552f7358SJed Brown 4791552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4792785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 47930d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4794552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4795552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4796552f7358SJed Brown } 4797552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4798552f7358SJed Brown } else { 4799552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4800552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4801552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4802552f7358SJed Brown PetscInt fcdof; 4803552f7358SJed Brown 4804552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 480582f516ccSBarry 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); 4806552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4807552f7358SJed Brown } 4808552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4809552f7358SJed Brown } 4810552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4811552f7358SJed Brown PetscFunctionReturn(0); 4812552f7358SJed Brown } 4813552f7358SJed Brown 4814552f7358SJed Brown #undef __FUNCT__ 4815552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4816552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 48170adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 48180adebc6cSBarry Smith { 4819552f7358SJed Brown PetscInt *indices; 4820552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4821552f7358SJed Brown PetscErrorCode ierr; 4822552f7358SJed Brown 4823552f7358SJed Brown PetscFunctionBegin; 4824552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4825785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4826552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 482782f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4828552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4829552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4830552f7358SJed Brown PetscInt cdof, d; 4831552f7358SJed Brown 4832552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4833552f7358SJed Brown if (cdof) { 4834552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4835552f7358SJed Brown 4836552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4837552f7358SJed Brown const PetscInt *fcind; 4838552f7358SJed Brown PetscInt fdof, fcdof; 4839552f7358SJed Brown 4840552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4841552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4842552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4843552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 48440d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4845552f7358SJed Brown foff += fdof; 4846552f7358SJed Brown numConst += fcdof; 4847552f7358SJed Brown } 484882f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4849552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4850552f7358SJed Brown } 4851552f7358SJed Brown } 4852552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4853552f7358SJed Brown PetscFunctionReturn(0); 4854552f7358SJed Brown } 4855552f7358SJed Brown 4856552f7358SJed Brown #undef __FUNCT__ 4857552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4858552f7358SJed Brown /*@C 4859552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4860552f7358SJed Brown 4861552f7358SJed Brown Not Collective 4862552f7358SJed Brown 4863552f7358SJed Brown Input Parameters: 4864552f7358SJed Brown + dm - The DMPlex object 4865552f7358SJed Brown . dim - The spatial dimension of the problem 4866552f7358SJed Brown . numFields - The number of fields in the problem 4867552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4868552f7358SJed 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 4869552f7358SJed Brown . numBC - The number of boundary conditions 4870552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4871552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4872552f7358SJed Brown 4873552f7358SJed Brown Output Parameter: 4874552f7358SJed Brown . section - The PetscSection object 4875552f7358SJed Brown 4876552f7358SJed 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 4877552f7358SJed Brown nubmer of dof for field 0 on each edge. 4878552f7358SJed Brown 4879552f7358SJed Brown Level: developer 4880552f7358SJed Brown 48813813dfbdSMatthew G Knepley Fortran Notes: 48823813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 48833813dfbdSMatthew G Knepley 4884552f7358SJed Brown .keywords: mesh, elements 4885552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4886552f7358SJed Brown @*/ 4887a6dfd86eSKarl 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) 4888a6dfd86eSKarl Rupp { 4889552f7358SJed Brown PetscErrorCode ierr; 4890552f7358SJed Brown 4891552f7358SJed Brown PetscFunctionBegin; 4892552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4893552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4894552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4895552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4896ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4897552f7358SJed Brown PetscFunctionReturn(0); 4898552f7358SJed Brown } 4899552f7358SJed Brown 4900552f7358SJed Brown #undef __FUNCT__ 4901552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 49020adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 49030adebc6cSBarry Smith { 4904552f7358SJed Brown PetscSection section; 4905552f7358SJed Brown PetscErrorCode ierr; 4906552f7358SJed Brown 4907552f7358SJed Brown PetscFunctionBegin; 490838221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 490982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4910552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 49111d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4912552f7358SJed Brown PetscFunctionReturn(0); 4913552f7358SJed Brown } 4914552f7358SJed Brown 4915552f7358SJed Brown #undef __FUNCT__ 4916552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 49170adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 49180adebc6cSBarry Smith { 4919552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4920552f7358SJed Brown 4921552f7358SJed Brown PetscFunctionBegin; 4922552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4923552f7358SJed Brown if (section) *section = mesh->coneSection; 4924552f7358SJed Brown PetscFunctionReturn(0); 4925552f7358SJed Brown } 4926552f7358SJed Brown 4927552f7358SJed Brown #undef __FUNCT__ 49288cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 49298cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 49308cb4d582SMatthew G. Knepley { 49318cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 49328cb4d582SMatthew G. Knepley 49338cb4d582SMatthew G. Knepley PetscFunctionBegin; 49348cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49358cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 49368cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 49378cb4d582SMatthew G. Knepley } 49388cb4d582SMatthew G. Knepley 49398cb4d582SMatthew G. Knepley #undef __FUNCT__ 4940552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4941a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4942a6dfd86eSKarl Rupp { 4943552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4944552f7358SJed Brown 4945552f7358SJed Brown PetscFunctionBegin; 4946552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4947552f7358SJed Brown if (cones) *cones = mesh->cones; 4948552f7358SJed Brown PetscFunctionReturn(0); 4949552f7358SJed Brown } 4950552f7358SJed Brown 4951552f7358SJed Brown #undef __FUNCT__ 4952552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4953a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4954a6dfd86eSKarl Rupp { 4955552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4956552f7358SJed Brown 4957552f7358SJed Brown PetscFunctionBegin; 4958552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4959552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4960552f7358SJed Brown PetscFunctionReturn(0); 4961552f7358SJed Brown } 4962552f7358SJed Brown 4963552f7358SJed Brown /******************************** FEM Support **********************************/ 4964552f7358SJed Brown 4965552f7358SJed Brown #undef __FUNCT__ 49661a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 49671a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4968a6dfd86eSKarl Rupp { 4969552f7358SJed Brown PetscScalar *array, *vArray; 4970d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 49711a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4972552f7358SJed Brown PetscErrorCode ierr; 4973552f7358SJed Brown 49741b406b76SMatthew G. Knepley PetscFunctionBeginHot; 49752a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 49765a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 49775a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 49785a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 49793f7cbbe7SMatthew G. Knepley if (!values || !*values) { 49809df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 49819df71ca4SMatthew G. Knepley PetscInt dof; 4982d9917b9dSMatthew G. Knepley 49839df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 49849df71ca4SMatthew G. Knepley size += dof; 49859df71ca4SMatthew G. Knepley } 49869df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 49879df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 49882a3aaacfSMatthew G. Knepley PetscInt dof; 49895a1bb5cfSMatthew G. Knepley 49905a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 49912a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 49925a1bb5cfSMatthew G. Knepley size += dof; 49935a1bb5cfSMatthew G. Knepley } 49943f7cbbe7SMatthew G. Knepley if (!values) { 49953f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 49963f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 49973f7cbbe7SMatthew G. Knepley } 49985a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4999982e9ed1SMatthew G. Knepley } else { 5000982e9ed1SMatthew G. Knepley array = *values; 5001982e9ed1SMatthew G. Knepley } 50029df71ca4SMatthew G. Knepley size = 0; 50035a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 50049df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50059df71ca4SMatthew G. Knepley PetscInt dof, off, d; 50069df71ca4SMatthew G. Knepley PetscScalar *varr; 5007d9917b9dSMatthew G. Knepley 50089df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50099df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50109df71ca4SMatthew G. Knepley varr = &vArray[off]; 50111a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 50121a271a75SMatthew G. Knepley array[offset] = varr[d]; 50139df71ca4SMatthew G. Knepley } 50149df71ca4SMatthew G. Knepley size += dof; 50159df71ca4SMatthew G. Knepley } 50169df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50179df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50189df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 50195a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 50205a1bb5cfSMatthew G. Knepley PetscScalar *varr; 50215a1bb5cfSMatthew G. Knepley 502252ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50235a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50245a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 50255a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 50265a1bb5cfSMatthew G. Knepley if (o >= 0) { 50271a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 50281a271a75SMatthew G. Knepley array[offset] = varr[d]; 50295a1bb5cfSMatthew G. Knepley } 50305a1bb5cfSMatthew G. Knepley } else { 50311a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 50321a271a75SMatthew G. Knepley array[offset] = varr[d]; 50335a1bb5cfSMatthew G. Knepley } 50345a1bb5cfSMatthew G. Knepley } 50359df71ca4SMatthew G. Knepley size += dof; 50365a1bb5cfSMatthew G. Knepley } 50375a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 50389df71ca4SMatthew G. Knepley if (!*values) { 50395a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 50405a1bb5cfSMatthew G. Knepley *values = array; 50419df71ca4SMatthew G. Knepley } else { 50429df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 50438c312ff3SMatthew G. Knepley *csize = size; 50449df71ca4SMatthew G. Knepley } 50455a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 50465a1bb5cfSMatthew G. Knepley } 5047d9917b9dSMatthew G. Knepley 5048d9917b9dSMatthew G. Knepley #undef __FUNCT__ 50491a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 50501a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 50511a271a75SMatthew G. Knepley { 50521a271a75SMatthew G. Knepley PetscInt offset = 0, p; 50531a271a75SMatthew G. Knepley PetscErrorCode ierr; 50541a271a75SMatthew G. Knepley 50551a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5056fe02ba77SJed Brown *size = 0; 50571a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50581a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50591a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50601a271a75SMatthew G. Knepley PetscInt dof, off, d; 50611a271a75SMatthew G. Knepley const PetscScalar *varr; 50621a271a75SMatthew G. Knepley 50631a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50641a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50651a271a75SMatthew G. Knepley varr = &vArray[off]; 50661a271a75SMatthew G. Knepley if (o >= 0) { 50671a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 50681a271a75SMatthew G. Knepley } else { 50691a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 50701a271a75SMatthew G. Knepley } 50711a271a75SMatthew G. Knepley } 50721a271a75SMatthew G. Knepley *size = offset; 50731a271a75SMatthew G. Knepley PetscFunctionReturn(0); 50741a271a75SMatthew G. Knepley } 50751a271a75SMatthew G. Knepley 50761a271a75SMatthew G. Knepley #undef __FUNCT__ 50771a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 50781a271a75SMatthew 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[]) 50791a271a75SMatthew G. Knepley { 50801a271a75SMatthew G. Knepley PetscInt offset = 0, f; 50811a271a75SMatthew G. Knepley PetscErrorCode ierr; 50821a271a75SMatthew G. Knepley 50831a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5084fe02ba77SJed Brown *size = 0; 50851a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 50861a271a75SMatthew G. Knepley PetscInt fcomp, p; 50871a271a75SMatthew G. Knepley 50881a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 50891a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50901a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50911a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50921a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 50931a271a75SMatthew G. Knepley const PetscScalar *varr; 50941a271a75SMatthew G. Knepley 50951a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 50961a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 50971a271a75SMatthew G. Knepley varr = &vArray[foff]; 50981a271a75SMatthew G. Knepley if (o >= 0) { 50991a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 51001a271a75SMatthew G. Knepley } else { 51011a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 51021a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 51031a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 51041a271a75SMatthew G. Knepley } 51051a271a75SMatthew G. Knepley } 51061a271a75SMatthew G. Knepley } 51071a271a75SMatthew G. Knepley } 51081a271a75SMatthew G. Knepley } 51091a271a75SMatthew G. Knepley *size = offset; 51101a271a75SMatthew G. Knepley PetscFunctionReturn(0); 51111a271a75SMatthew G. Knepley } 51121a271a75SMatthew G. Knepley 51131a271a75SMatthew G. Knepley #undef __FUNCT__ 5114552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 5115552f7358SJed Brown /*@C 5116552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 5117552f7358SJed Brown 5118552f7358SJed Brown Not collective 5119552f7358SJed Brown 5120552f7358SJed Brown Input Parameters: 5121552f7358SJed Brown + dm - The DM 5122552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5123552f7358SJed Brown . v - The local vector 5124552f7358SJed Brown - point - The sieve point in the DM 5125552f7358SJed Brown 5126552f7358SJed Brown Output Parameters: 5127552f7358SJed Brown + csize - The number of values in the closure, or NULL 5128552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5129552f7358SJed Brown 5130552f7358SJed Brown Fortran Notes: 5131552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 5132552f7358SJed Brown include petsc.h90 in your code. 5133552f7358SJed Brown 5134552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 5135552f7358SJed Brown 5136552f7358SJed Brown Level: intermediate 5137552f7358SJed Brown 5138552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5139552f7358SJed Brown @*/ 5140552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5141552f7358SJed Brown { 5142552f7358SJed Brown PetscSection clSection; 5143d9917b9dSMatthew G. Knepley IS clPoints; 5144552f7358SJed Brown PetscScalar *array, *vArray; 5145552f7358SJed Brown PetscInt *points = NULL; 5146d9917b9dSMatthew G. Knepley const PetscInt *clp; 51471a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 5148552f7358SJed Brown PetscErrorCode ierr; 5149552f7358SJed Brown 5150d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 5151552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5152552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 51531a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 51541a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5155552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5156552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5157552f7358SJed Brown if (depth == 1 && numFields < 2) { 51581a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 5159552f7358SJed Brown PetscFunctionReturn(0); 5160552f7358SJed Brown } 51611a271a75SMatthew G. Knepley /* Get points */ 5162d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5163d9917b9dSMatthew G. Knepley if (!clPoints) { 51641a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 5165552f7358SJed Brown 51661a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5167552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5168552f7358SJed Brown /* Compress out points not in the section */ 5169552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5170552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5171552f7358SJed Brown points[q*2] = points[p]; 5172552f7358SJed Brown points[q*2+1] = points[p+1]; 5173552f7358SJed Brown ++q; 5174552f7358SJed Brown } 5175552f7358SJed Brown } 5176552f7358SJed Brown numPoints = q; 5177d9917b9dSMatthew G. Knepley } else { 5178d9917b9dSMatthew G. Knepley PetscInt dof, off; 5179552f7358SJed Brown 5180d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5181d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5182d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 51831a271a75SMatthew G. Knepley numPoints = dof/2; 5184d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5185552f7358SJed Brown } 51861a271a75SMatthew G. Knepley /* Get array */ 5187552f7358SJed Brown if (!values || !*values) { 51881a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 5189552f7358SJed Brown 51901a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5191552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 51921a271a75SMatthew G. Knepley asize += dof; 5193552f7358SJed Brown } 5194bd6c0d32SMatthew G. Knepley if (!values) { 5195d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 51961a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 51971a271a75SMatthew G. Knepley if (csize) *csize = asize; 5198bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 5199bd6c0d32SMatthew G. Knepley } 52001a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 5201d0f6b257SMatthew G. Knepley } else { 5202d0f6b257SMatthew G. Knepley array = *values; 5203d0f6b257SMatthew G. Knepley } 5204552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 52051a271a75SMatthew G. Knepley /* Get values */ 52061a271a75SMatthew G. Knepley if (numFields > 1) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 52071a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 52081a271a75SMatthew G. Knepley /* Cleanup points */ 52091a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 52101a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 52111a271a75SMatthew G. Knepley /* Cleanup array */ 5212552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 5213d0f6b257SMatthew G. Knepley if (!*values) { 5214552f7358SJed Brown if (csize) *csize = size; 5215552f7358SJed Brown *values = array; 5216d0f6b257SMatthew G. Knepley } else { 5217d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 5218d0f6b257SMatthew G. Knepley *csize = size; 5219d0f6b257SMatthew G. Knepley } 5220552f7358SJed Brown PetscFunctionReturn(0); 5221552f7358SJed Brown } 5222552f7358SJed Brown 5223552f7358SJed Brown #undef __FUNCT__ 5224552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 5225552f7358SJed Brown /*@C 5226552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 5227552f7358SJed Brown 5228552f7358SJed Brown Not collective 5229552f7358SJed Brown 5230552f7358SJed Brown Input Parameters: 5231552f7358SJed Brown + dm - The DM 52320298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 5233552f7358SJed Brown . v - The local vector 5234552f7358SJed Brown . point - The sieve point in the DM 52350298fd71SBarry Smith . csize - The number of values in the closure, or NULL 5236552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5237552f7358SJed Brown 52383813dfbdSMatthew G Knepley Fortran Notes: 52393813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 52403813dfbdSMatthew G Knepley include petsc.h90 in your code. 52413813dfbdSMatthew G Knepley 52423813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 52433813dfbdSMatthew G Knepley 5244552f7358SJed Brown Level: intermediate 5245552f7358SJed Brown 5246552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5247552f7358SJed Brown @*/ 52487c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5249a6dfd86eSKarl Rupp { 5250552f7358SJed Brown PetscInt size = 0; 5251552f7358SJed Brown PetscErrorCode ierr; 5252552f7358SJed Brown 5253552f7358SJed Brown PetscFunctionBegin; 5254552f7358SJed Brown /* Should work without recalculating size */ 5255552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 5256552f7358SJed Brown PetscFunctionReturn(0); 5257552f7358SJed Brown } 5258552f7358SJed Brown 5259552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 5260552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 5261552f7358SJed Brown 5262552f7358SJed Brown #undef __FUNCT__ 5263552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 52641a271a75SMatthew 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[]) 5265552f7358SJed Brown { 5266552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5267552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5268552f7358SJed Brown PetscScalar *a; 5269552f7358SJed Brown PetscInt off, cind = 0, k; 5270552f7358SJed Brown PetscErrorCode ierr; 5271552f7358SJed Brown 5272552f7358SJed Brown PetscFunctionBegin; 5273552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5274552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5275552f7358SJed Brown a = &array[off]; 5276552f7358SJed Brown if (!cdof || setBC) { 5277552f7358SJed Brown if (orientation >= 0) { 5278552f7358SJed Brown for (k = 0; k < dof; ++k) { 5279552f7358SJed Brown fuse(&a[k], values[k]); 5280552f7358SJed Brown } 5281552f7358SJed Brown } else { 5282552f7358SJed Brown for (k = 0; k < dof; ++k) { 5283552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5284552f7358SJed Brown } 5285552f7358SJed Brown } 5286552f7358SJed Brown } else { 5287552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5288552f7358SJed Brown if (orientation >= 0) { 5289552f7358SJed Brown for (k = 0; k < dof; ++k) { 5290552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5291552f7358SJed Brown fuse(&a[k], values[k]); 5292552f7358SJed Brown } 5293552f7358SJed Brown } else { 5294552f7358SJed Brown for (k = 0; k < dof; ++k) { 5295552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5296552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5297552f7358SJed Brown } 5298552f7358SJed Brown } 5299552f7358SJed Brown } 5300552f7358SJed Brown PetscFunctionReturn(0); 5301552f7358SJed Brown } 5302552f7358SJed Brown 5303552f7358SJed Brown #undef __FUNCT__ 5304a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 53051a271a75SMatthew 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[]) 5306a5e93ea8SMatthew G. Knepley { 5307a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 5308a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5309a5e93ea8SMatthew G. Knepley PetscScalar *a; 5310a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 5311a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5312a5e93ea8SMatthew G. Knepley 5313a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5314a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5315a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5316a5e93ea8SMatthew G. Knepley a = &array[off]; 5317a5e93ea8SMatthew G. Knepley if (cdof) { 5318a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5319a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 5320a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5321a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5322a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 5323a5e93ea8SMatthew G. Knepley ++cind; 5324a5e93ea8SMatthew G. Knepley } 5325a5e93ea8SMatthew G. Knepley } 5326a5e93ea8SMatthew G. Knepley } else { 5327a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5328a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5329a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 5330a5e93ea8SMatthew G. Knepley ++cind; 5331a5e93ea8SMatthew G. Knepley } 5332a5e93ea8SMatthew G. Knepley } 5333a5e93ea8SMatthew G. Knepley } 5334a5e93ea8SMatthew G. Knepley } 5335a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5336a5e93ea8SMatthew G. Knepley } 5337a5e93ea8SMatthew G. Knepley 5338a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 5339552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 53401a271a75SMatthew 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[]) 5341a6dfd86eSKarl Rupp { 5342552f7358SJed Brown PetscScalar *a; 53431a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 53441a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 53451a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5346552f7358SJed Brown PetscErrorCode ierr; 5347552f7358SJed Brown 5348552f7358SJed Brown PetscFunctionBegin; 5349552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5350552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 53511a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 53521a271a75SMatthew G. Knepley a = &array[foff]; 5353552f7358SJed Brown if (!fcdof || setBC) { 53541a271a75SMatthew G. Knepley if (o >= 0) { 53551a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 5356552f7358SJed Brown } else { 5357552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5358552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 53591a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5360552f7358SJed Brown } 5361552f7358SJed Brown } 5362552f7358SJed Brown } 5363552f7358SJed Brown } else { 5364552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 53651a271a75SMatthew G. Knepley if (o >= 0) { 5366552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5367552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 53681a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5369552f7358SJed Brown } 5370552f7358SJed Brown } else { 5371552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5372552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5373552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 53741a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5375552f7358SJed Brown } 5376552f7358SJed Brown } 5377552f7358SJed Brown } 5378552f7358SJed Brown } 53791a271a75SMatthew G. Knepley *offset += fdof; 5380552f7358SJed Brown PetscFunctionReturn(0); 5381552f7358SJed Brown } 5382552f7358SJed Brown 5383552f7358SJed Brown #undef __FUNCT__ 5384a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 53851a271a75SMatthew 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[]) 5386a5e93ea8SMatthew G. Knepley { 5387a5e93ea8SMatthew G. Knepley PetscScalar *a; 53881a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 53891a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 53901a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5391a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5392a5e93ea8SMatthew G. Knepley 5393a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5394a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5395a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 53961a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 53971a271a75SMatthew G. Knepley a = &array[foff]; 5398a5e93ea8SMatthew G. Knepley if (fcdof) { 5399a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 54001a271a75SMatthew G. Knepley if (o >= 0) { 5401a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 5402a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 54031a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5404a5e93ea8SMatthew G. Knepley ++cind; 5405a5e93ea8SMatthew G. Knepley } 5406a5e93ea8SMatthew G. Knepley } 5407a5e93ea8SMatthew G. Knepley } else { 5408a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 5409a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 5410a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 54111a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5412a5e93ea8SMatthew G. Knepley ++cind; 5413a5e93ea8SMatthew G. Knepley } 5414a5e93ea8SMatthew G. Knepley } 5415a5e93ea8SMatthew G. Knepley } 5416a5e93ea8SMatthew G. Knepley } 5417a5e93ea8SMatthew G. Knepley } 54181a271a75SMatthew G. Knepley *offset += fdof; 5419a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5420a5e93ea8SMatthew G. Knepley } 5421a5e93ea8SMatthew G. Knepley 5422a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 54231b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 54241a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 5425a6dfd86eSKarl Rupp { 5426552f7358SJed Brown PetscScalar *array; 54271b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 54281b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 5429552f7358SJed Brown PetscErrorCode ierr; 5430552f7358SJed Brown 54311b406b76SMatthew G. Knepley PetscFunctionBeginHot; 5432b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5433b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 5434b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 5435b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 5436b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5437b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 5438b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 5439b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 5440b6ebb6e6SMatthew G. Knepley 5441b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 5442b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 5443b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 5444b6ebb6e6SMatthew G. Knepley { 5445b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5446b6ebb6e6SMatthew G. Knepley PetscScalar *a; 5447b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 5448b6ebb6e6SMatthew G. Knepley 5449b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 5450b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 5451b6ebb6e6SMatthew G. Knepley a = &array[coff]; 5452b6ebb6e6SMatthew G. Knepley if (!cdof) { 5453b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5454b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5455b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5456b6ebb6e6SMatthew G. Knepley } 5457b6ebb6e6SMatthew G. Knepley } else { 5458b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5459b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5460b6ebb6e6SMatthew G. Knepley } 5461b6ebb6e6SMatthew G. Knepley } 5462b6ebb6e6SMatthew G. Knepley } else { 5463b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 5464b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5465b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5466b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5467b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5468b6ebb6e6SMatthew G. Knepley } 5469b6ebb6e6SMatthew G. Knepley } else { 5470b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5471b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5472b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5473b6ebb6e6SMatthew G. Knepley } 5474b6ebb6e6SMatthew G. Knepley } 5475b6ebb6e6SMatthew G. Knepley } 5476b6ebb6e6SMatthew G. Knepley } 5477b6ebb6e6SMatthew G. Knepley } 5478b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5479b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 5480b6ebb6e6SMatthew G. Knepley } 54811b406b76SMatthew G. Knepley 54821b406b76SMatthew G. Knepley #undef __FUNCT__ 54831b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 54841b406b76SMatthew G. Knepley /*@C 54851b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 54861b406b76SMatthew G. Knepley 54871b406b76SMatthew G. Knepley Not collective 54881b406b76SMatthew G. Knepley 54891b406b76SMatthew G. Knepley Input Parameters: 54901b406b76SMatthew G. Knepley + dm - The DM 54911b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 54921b406b76SMatthew G. Knepley . v - The local vector 54931b406b76SMatthew G. Knepley . point - The sieve point in the DM 54941b406b76SMatthew G. Knepley . values - The array of values 54951b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 54961b406b76SMatthew G. Knepley 54971b406b76SMatthew G. Knepley Fortran Notes: 54981b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 54991b406b76SMatthew G. Knepley 55001b406b76SMatthew G. Knepley Level: intermediate 55011b406b76SMatthew G. Knepley 55021b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 55031b406b76SMatthew G. Knepley @*/ 55041b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 55051b406b76SMatthew G. Knepley { 55061b406b76SMatthew G. Knepley PetscSection clSection; 55071b406b76SMatthew G. Knepley IS clPoints; 55081b406b76SMatthew G. Knepley PetscScalar *array; 55091b406b76SMatthew G. Knepley PetscInt *points = NULL; 55101b406b76SMatthew G. Knepley const PetscInt *clp; 55111a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 55121b406b76SMatthew G. Knepley PetscErrorCode ierr; 55131b406b76SMatthew G. Knepley 55141a271a75SMatthew G. Knepley PetscFunctionBeginHot; 55151b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 55161b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 55171a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 55181a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 55191b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 55201b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 55211b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 55221a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 55231b406b76SMatthew G. Knepley PetscFunctionReturn(0); 55241b406b76SMatthew G. Knepley } 55251a271a75SMatthew G. Knepley /* Get points */ 55261b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 55271b406b76SMatthew G. Knepley if (!clPoints) { 55281a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 55291a271a75SMatthew G. Knepley 55301a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5531552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5532552f7358SJed Brown /* Compress out points not in the section */ 5533552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5534552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5535552f7358SJed Brown points[q*2] = points[p]; 5536552f7358SJed Brown points[q*2+1] = points[p+1]; 5537552f7358SJed Brown ++q; 5538552f7358SJed Brown } 5539552f7358SJed Brown } 5540552f7358SJed Brown numPoints = q; 55411b406b76SMatthew G. Knepley } else { 55421b406b76SMatthew G. Knepley PetscInt dof, off; 5543552f7358SJed Brown 55441b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 55451b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 55461b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 55471a271a75SMatthew G. Knepley numPoints = dof/2; 55481b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 5549552f7358SJed Brown } 55501a271a75SMatthew G. Knepley /* Get array */ 5551552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 55521a271a75SMatthew G. Knepley /* Get values */ 5553f723297eSMatthew G. Knepley if (numFields > 1) { 55541a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5555552f7358SJed Brown for (f = 0; f < numFields; ++f) { 55561a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5557552f7358SJed Brown switch (mode) { 5558552f7358SJed Brown case INSERT_VALUES: 5559552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55601a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55611a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55621a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5563552f7358SJed Brown } break; 5564552f7358SJed Brown case INSERT_ALL_VALUES: 5565552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55661a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55671a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55681a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5569552f7358SJed Brown } break; 5570a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5571a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 55721a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55731a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55741a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5575a5e93ea8SMatthew G. Knepley } break; 5576552f7358SJed Brown case ADD_VALUES: 5577552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55781a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55791a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55801a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5581552f7358SJed Brown } break; 5582552f7358SJed Brown case ADD_ALL_VALUES: 5583552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55841a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55851a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55861a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5587552f7358SJed Brown } break; 5588552f7358SJed Brown default: 558982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5590552f7358SJed Brown } 55911a271a75SMatthew G. Knepley } 5592552f7358SJed Brown } else { 55931a271a75SMatthew G. Knepley PetscInt dof, off; 55941a271a75SMatthew G. Knepley 5595552f7358SJed Brown switch (mode) { 5596552f7358SJed Brown case INSERT_VALUES: 5597552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5598552f7358SJed Brown PetscInt o = points[p+1]; 5599552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5600552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5601552f7358SJed Brown } break; 5602552f7358SJed Brown case INSERT_ALL_VALUES: 5603552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5604552f7358SJed Brown PetscInt o = points[p+1]; 5605552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5606552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5607552f7358SJed Brown } break; 5608a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5609a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5610a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5611a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5612a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5613a5e93ea8SMatthew G. Knepley } break; 5614552f7358SJed Brown case ADD_VALUES: 5615552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5616552f7358SJed Brown PetscInt o = points[p+1]; 5617552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5618552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5619552f7358SJed Brown } break; 5620552f7358SJed Brown case ADD_ALL_VALUES: 5621552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5622552f7358SJed Brown PetscInt o = points[p+1]; 5623552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5624552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5625552f7358SJed Brown } break; 5626552f7358SJed Brown default: 562782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5628552f7358SJed Brown } 5629552f7358SJed Brown } 56301a271a75SMatthew G. Knepley /* Cleanup points */ 56311a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 56321a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 56331a271a75SMatthew G. Knepley /* Cleanup array */ 5634552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5635552f7358SJed Brown PetscFunctionReturn(0); 5636552f7358SJed Brown } 5637552f7358SJed Brown 5638552f7358SJed Brown #undef __FUNCT__ 5639552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 56407c1f9639SMatthew G Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numIndices, const PetscInt indices[], const PetscScalar values[]) 5641552f7358SJed Brown { 5642552f7358SJed Brown PetscMPIInt rank; 5643552f7358SJed Brown PetscInt i, j; 5644552f7358SJed Brown PetscErrorCode ierr; 5645552f7358SJed Brown 5646552f7358SJed Brown PetscFunctionBegin; 564782f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 564877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5649552f7358SJed Brown for (i = 0; i < numIndices; i++) { 565077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat indices[%D] = %D\n", rank, i, indices[i]);CHKERRQ(ierr); 5651552f7358SJed Brown } 5652552f7358SJed Brown for (i = 0; i < numIndices; i++) { 565377a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5654552f7358SJed Brown for (j = 0; j < numIndices; j++) { 5655519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 565657622a8eSBarry Smith ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numIndices+j]), (double)PetscImaginaryPart(values[i*numIndices+j]));CHKERRQ(ierr); 5657552f7358SJed Brown #else 565857622a8eSBarry Smith ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numIndices+j]);CHKERRQ(ierr); 5659552f7358SJed Brown #endif 5660552f7358SJed Brown } 566177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5662552f7358SJed Brown } 5663552f7358SJed Brown PetscFunctionReturn(0); 5664552f7358SJed Brown } 5665552f7358SJed Brown 5666552f7358SJed Brown #undef __FUNCT__ 5667552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5668552f7358SJed Brown /* . off - The global offset of this point */ 5669e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5670a6dfd86eSKarl Rupp { 5671e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5672552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5673552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5674552f7358SJed Brown PetscInt cind = 0, k; 5675552f7358SJed Brown PetscErrorCode ierr; 5676552f7358SJed Brown 5677552f7358SJed Brown PetscFunctionBegin; 5678552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5679552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5680552f7358SJed Brown if (!cdof || setBC) { 5681552f7358SJed Brown if (orientation >= 0) { 5682e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5683552f7358SJed Brown } else { 5684e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5685552f7358SJed Brown } 5686552f7358SJed Brown } else { 5687552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5688552f7358SJed Brown if (orientation >= 0) { 5689552f7358SJed Brown for (k = 0; k < dof; ++k) { 5690552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5691552f7358SJed Brown /* Insert check for returning constrained indices */ 5692e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5693552f7358SJed Brown ++cind; 5694552f7358SJed Brown } else { 5695e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5696552f7358SJed Brown } 5697552f7358SJed Brown } 5698552f7358SJed Brown } else { 5699552f7358SJed Brown for (k = 0; k < dof; ++k) { 5700552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5701552f7358SJed Brown /* Insert check for returning constrained indices */ 5702e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5703552f7358SJed Brown ++cind; 5704552f7358SJed Brown } else { 5705e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5706552f7358SJed Brown } 5707552f7358SJed Brown } 5708552f7358SJed Brown } 5709552f7358SJed Brown } 5710e6ccafaeSMatthew G Knepley *loff += dof; 5711552f7358SJed Brown PetscFunctionReturn(0); 5712552f7358SJed Brown } 5713552f7358SJed Brown 5714552f7358SJed Brown #undef __FUNCT__ 5715552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5716552f7358SJed Brown /* . off - The global offset of this point */ 5717a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5718a6dfd86eSKarl Rupp { 5719552f7358SJed Brown PetscInt numFields, foff, f; 5720552f7358SJed Brown PetscErrorCode ierr; 5721552f7358SJed Brown 5722552f7358SJed Brown PetscFunctionBegin; 5723552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5724552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5725552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5726552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5727552f7358SJed Brown PetscInt cind = 0, k, c; 5728552f7358SJed Brown 5729552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5730552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5731552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5732552f7358SJed Brown if (!cfdof || setBC) { 5733552f7358SJed Brown if (orientation >= 0) { 57340d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5735552f7358SJed Brown } else { 5736552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5737552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5738552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5739552f7358SJed Brown } 5740552f7358SJed Brown } 5741552f7358SJed Brown } 5742552f7358SJed Brown } else { 5743552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5744552f7358SJed Brown if (orientation >= 0) { 5745552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5746552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5747552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5748552f7358SJed Brown ++cind; 5749552f7358SJed Brown } else { 5750552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5751552f7358SJed Brown } 5752552f7358SJed Brown } 5753552f7358SJed Brown } else { 5754552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5755552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5756552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5757552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5758552f7358SJed Brown ++cind; 5759552f7358SJed Brown } else { 5760552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5761552f7358SJed Brown } 5762552f7358SJed Brown } 5763552f7358SJed Brown } 5764552f7358SJed Brown } 5765552f7358SJed Brown } 5766552f7358SJed Brown foff += fdof - cfdof; 5767552f7358SJed Brown foffs[f] += fdof; 5768552f7358SJed Brown } 5769552f7358SJed Brown PetscFunctionReturn(0); 5770552f7358SJed Brown } 5771552f7358SJed Brown 5772552f7358SJed Brown #undef __FUNCT__ 5773552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 57747f5d1fdeSMatthew G. Knepley /*@C 57757f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 57767f5d1fdeSMatthew G. Knepley 57777f5d1fdeSMatthew G. Knepley Not collective 57787f5d1fdeSMatthew G. Knepley 57797f5d1fdeSMatthew G. Knepley Input Parameters: 57807f5d1fdeSMatthew G. Knepley + dm - The DM 5781ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5782ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 57837f5d1fdeSMatthew G. Knepley . A - The matrix 57847f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 57857f5d1fdeSMatthew G. Knepley . values - The array of values 57867f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 57877f5d1fdeSMatthew G. Knepley 57887f5d1fdeSMatthew G. Knepley Fortran Notes: 57897f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 57907f5d1fdeSMatthew G. Knepley 57917f5d1fdeSMatthew G. Knepley Level: intermediate 57927f5d1fdeSMatthew G. Knepley 57937f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 57947f5d1fdeSMatthew G. Knepley @*/ 57957c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5796552f7358SJed Brown { 5797552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 57981b406b76SMatthew G. Knepley PetscSection clSection; 57991b406b76SMatthew G. Knepley IS clPoints; 58000298fd71SBarry Smith PetscInt *points = NULL; 58011b406b76SMatthew G. Knepley const PetscInt *clp; 5802552f7358SJed Brown PetscInt *indices; 5803552f7358SJed Brown PetscInt offsets[32]; 5804552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5805552f7358SJed Brown PetscErrorCode ierr; 5806552f7358SJed Brown 5807552f7358SJed Brown PetscFunctionBegin; 5808552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5809ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 58103dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5811ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 58123dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58133dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5814552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 581582f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5816552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 58171b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 58181b406b76SMatthew G. Knepley if (!clPoints) { 5819552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5820552f7358SJed Brown /* Compress out points not in the section */ 5821552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5822552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5823552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5824552f7358SJed Brown points[q*2] = points[p]; 5825552f7358SJed Brown points[q*2+1] = points[p+1]; 5826552f7358SJed Brown ++q; 5827552f7358SJed Brown } 5828552f7358SJed Brown } 5829552f7358SJed Brown numPoints = q; 58301b406b76SMatthew G. Knepley } else { 58311b406b76SMatthew G. Knepley PetscInt dof, off; 58321b406b76SMatthew G. Knepley 58331b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 58341b406b76SMatthew G. Knepley numPoints = dof/2; 58351b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 58361b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 58371b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 58381b406b76SMatthew G. Knepley } 5839552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5840552f7358SJed Brown PetscInt fdof; 5841552f7358SJed Brown 5842552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5843552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5844552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5845552f7358SJed Brown offsets[f+1] += fdof; 5846552f7358SJed Brown } 5847552f7358SJed Brown numIndices += dof; 5848552f7358SJed Brown } 58490d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58500d644c17SKarl Rupp 585182f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5852552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5853552f7358SJed Brown if (numFields) { 5854552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5855552f7358SJed Brown PetscInt o = points[p+1]; 5856552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5857552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5858552f7358SJed Brown } 5859552f7358SJed Brown } else { 5860e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5861552f7358SJed Brown PetscInt o = points[p+1]; 5862552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5863e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5864552f7358SJed Brown } 5865552f7358SJed Brown } 586677a6746dSMatthew G Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr);} 5867552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5868552f7358SJed Brown if (ierr) { 5869552f7358SJed Brown PetscMPIInt rank; 5870552f7358SJed Brown PetscErrorCode ierr2; 5871552f7358SJed Brown 587282f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 587377a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 587477a6746dSMatthew G Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr2); 58756a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5876552f7358SJed Brown CHKERRQ(ierr); 5877552f7358SJed Brown } 58781b406b76SMatthew G. Knepley if (!clPoints) { 5879552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 58801b406b76SMatthew G. Knepley } else { 58811b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 58821b406b76SMatthew G. Knepley } 5883552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5884552f7358SJed Brown PetscFunctionReturn(0); 5885552f7358SJed Brown } 5886552f7358SJed Brown 5887552f7358SJed Brown #undef __FUNCT__ 5888770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5889f96281f8SMatthew G. Knepley /*@ 5890f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5891f96281f8SMatthew G. Knepley 5892f96281f8SMatthew G. Knepley Input Parameter: 5893f96281f8SMatthew G. Knepley . dm - The DMPlex object 5894f96281f8SMatthew G. Knepley 5895f96281f8SMatthew G. Knepley Output Parameters: 5896f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5897f96281f8SMatthew G. Knepley . cMax - The first hybrid face 5898f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 5899f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 5900f96281f8SMatthew G. Knepley 5901f96281f8SMatthew G. Knepley Level: developer 5902f96281f8SMatthew G. Knepley 5903f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 5904f96281f8SMatthew G. Knepley @*/ 5905770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5906552f7358SJed Brown { 5907552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5908770b213bSMatthew G Knepley PetscInt dim; 5909770b213bSMatthew G Knepley PetscErrorCode ierr; 5910552f7358SJed Brown 5911552f7358SJed Brown PetscFunctionBegin; 5912552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5913770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5914770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5915770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5916770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5917770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5918552f7358SJed Brown PetscFunctionReturn(0); 5919552f7358SJed Brown } 5920552f7358SJed Brown 5921552f7358SJed Brown #undef __FUNCT__ 5922770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5923770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5924552f7358SJed Brown { 5925552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5926770b213bSMatthew G Knepley PetscInt dim; 5927770b213bSMatthew G Knepley PetscErrorCode ierr; 5928552f7358SJed Brown 5929552f7358SJed Brown PetscFunctionBegin; 5930552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5931770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5932770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5933770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5934770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5935770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5936552f7358SJed Brown PetscFunctionReturn(0); 5937552f7358SJed Brown } 5938552f7358SJed Brown 5939552f7358SJed Brown #undef __FUNCT__ 5940552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5941552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5942552f7358SJed Brown { 5943552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5944552f7358SJed Brown 5945552f7358SJed Brown PetscFunctionBegin; 5946552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5947552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5948552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5949552f7358SJed Brown PetscFunctionReturn(0); 5950552f7358SJed Brown } 5951552f7358SJed Brown 5952552f7358SJed Brown #undef __FUNCT__ 5953552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5954552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5955552f7358SJed Brown { 5956552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5957552f7358SJed Brown 5958552f7358SJed Brown PetscFunctionBegin; 5959552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5960552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5961552f7358SJed Brown PetscFunctionReturn(0); 5962552f7358SJed Brown } 5963552f7358SJed Brown 5964552f7358SJed Brown #undef __FUNCT__ 5965552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5966552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5967552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 5968552f7358SJed Brown { 5969552f7358SJed Brown PetscSection section, globalSection; 5970552f7358SJed Brown PetscInt *numbers, p; 5971552f7358SJed Brown PetscErrorCode ierr; 5972552f7358SJed Brown 5973552f7358SJed Brown PetscFunctionBegin; 597482f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5975552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5976552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5977552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5978552f7358SJed Brown } 5979552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5980552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5981785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5982552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5983552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5984552f7358SJed Brown } 598582f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5986552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5987552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5988552f7358SJed Brown PetscFunctionReturn(0); 5989552f7358SJed Brown } 5990552f7358SJed Brown 5991552f7358SJed Brown #undef __FUNCT__ 5992552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5993552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5994552f7358SJed Brown { 5995552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5996552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5997552f7358SJed Brown PetscErrorCode ierr; 5998552f7358SJed Brown 5999552f7358SJed Brown PetscFunctionBegin; 6000552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6001552f7358SJed Brown if (!mesh->globalCellNumbers) { 6002552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6003552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 60040298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 60050d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6006552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6007552f7358SJed Brown } 6008552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6009552f7358SJed Brown PetscFunctionReturn(0); 6010552f7358SJed Brown } 6011552f7358SJed Brown 6012552f7358SJed Brown #undef __FUNCT__ 6013552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6014552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6015552f7358SJed Brown { 6016552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6017552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6018552f7358SJed Brown PetscErrorCode ierr; 6019552f7358SJed Brown 6020552f7358SJed Brown PetscFunctionBegin; 6021552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6022552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6023552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 60240298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 60250d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6026552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6027552f7358SJed Brown } 6028552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6029552f7358SJed Brown PetscFunctionReturn(0); 6030552f7358SJed Brown } 6031552f7358SJed Brown 6032552f7358SJed Brown 6033552f7358SJed Brown #undef __FUNCT__ 6034552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6035552f7358SJed Brown /*@C 6036552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6037552f7358SJed Brown the local section and an SF describing the section point overlap. 6038552f7358SJed Brown 6039552f7358SJed Brown Input Parameters: 6040552f7358SJed Brown + s - The PetscSection for the local field layout 6041552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6042552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6043552f7358SJed Brown . label - The label specifying the points 6044552f7358SJed Brown - labelValue - The label stratum specifying the points 6045552f7358SJed Brown 6046552f7358SJed Brown Output Parameter: 6047552f7358SJed Brown . gsection - The PetscSection for the global field layout 6048552f7358SJed Brown 6049552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6050552f7358SJed Brown 6051552f7358SJed Brown Level: developer 6052552f7358SJed Brown 6053552f7358SJed Brown .seealso: PetscSectionCreate() 6054552f7358SJed Brown @*/ 6055552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6056552f7358SJed Brown { 60577ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6058552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6059552f7358SJed Brown PetscErrorCode ierr; 6060552f7358SJed Brown 6061552f7358SJed Brown PetscFunctionBegin; 6062552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 6063552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6064552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 60657ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 60667ec39499SMatthew G. Knepley if (nroots >= 0) { 60677ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 60681795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 60697ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 60701795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 60717ec39499SMatthew G. Knepley } else { 60727ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 60737ec39499SMatthew G. Knepley } 60747ec39499SMatthew G. Knepley } 6075552f7358SJed Brown /* Mark ghost points with negative dof */ 6076552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6077552f7358SJed Brown PetscInt value; 6078552f7358SJed Brown 6079552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6080552f7358SJed Brown if (value != labelValue) continue; 6081552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6082552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6083552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6084552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 60857ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6086552f7358SJed Brown } 6087552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6088552f7358SJed Brown if (nroots >= 0) { 60897ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 60907ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6091552f7358SJed Brown if (nroots > pEnd-pStart) { 60927ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6093552f7358SJed Brown } 6094552f7358SJed Brown } 6095552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6096552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6097552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6098552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6099552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6100552f7358SJed Brown } 6101552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 6102552f7358SJed Brown globalOff -= off; 6103552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6104552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 61057ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6106552f7358SJed Brown } 6107552f7358SJed Brown /* Put in negative offsets for ghost points */ 6108552f7358SJed Brown if (nroots >= 0) { 61097ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 61107ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6111552f7358SJed Brown if (nroots > pEnd-pStart) { 61127ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6113552f7358SJed Brown } 6114552f7358SJed Brown } 61157ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6116552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6117552f7358SJed Brown PetscFunctionReturn(0); 6118552f7358SJed Brown } 6119ca8062c8SMatthew G. Knepley 6120ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6121ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6122ca8062c8SMatthew G. Knepley /*@ 6123ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6124ca8062c8SMatthew G. Knepley 6125ca8062c8SMatthew G. Knepley Input Parameters: 6126ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6127ca8062c8SMatthew G. Knepley 6128ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6129ca8062c8SMatthew G. Knepley 6130ca8062c8SMatthew G. Knepley Level: developer 6131ca8062c8SMatthew G. Knepley 61329bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6133ca8062c8SMatthew G. Knepley @*/ 6134ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6135ca8062c8SMatthew G. Knepley { 6136ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6137ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6138ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6139ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6140ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6141ca8062c8SMatthew G. Knepley 6142ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6143ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6144ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6145ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6146ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6147ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6148ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6149ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6150ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6151ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6152ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6153ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6154ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6155ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6156ca8062c8SMatthew G. Knepley } 6157ca8062c8SMatthew G. Knepley if (s >= supportSize) { 6158ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6159ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6160ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6161ca8062c8SMatthew G. Knepley } 6162ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6163ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6164ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6165ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6166ca8062c8SMatthew G. Knepley } 6167ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6168ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6169ca8062c8SMatthew G. Knepley } 6170ca8062c8SMatthew G. Knepley } 6171ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6172ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6173ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6174ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6175ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6176ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6177ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6178ca8062c8SMatthew G. Knepley } 6179ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6180ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6181ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6182ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6183ca8062c8SMatthew G. Knepley } 6184ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6185ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6186ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6187ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6188ca8062c8SMatthew G. Knepley } 6189ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6190ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6191ca8062c8SMatthew G. Knepley } 6192ca8062c8SMatthew G. Knepley } 6193ca8062c8SMatthew G. Knepley } 6194ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6195ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6196ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6197ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6198ca8062c8SMatthew G. Knepley } 6199ca8062c8SMatthew G. Knepley 6200ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6201ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6202ca8062c8SMatthew G. Knepley /*@ 6203ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6204ca8062c8SMatthew G. Knepley 6205ca8062c8SMatthew G. Knepley Input Parameters: 6206ca8062c8SMatthew G. Knepley + dm - The DMPlex object 620758723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 620858723a97SMatthew G. Knepley - cellHeight - Normally 0 6209ca8062c8SMatthew G. Knepley 6210ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6211ca8062c8SMatthew G. Knepley 6212ca8062c8SMatthew G. Knepley Level: developer 6213ca8062c8SMatthew G. Knepley 62149bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6215ca8062c8SMatthew G. Knepley @*/ 621658723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6217ca8062c8SMatthew G. Knepley { 621842363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6219ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6220ca8062c8SMatthew G. Knepley 6221ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6222ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6223ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6224ca8062c8SMatthew G. Knepley switch (dim) { 622542363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 622642363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 622742363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6228ca8062c8SMatthew G. Knepley default: 6229ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6230ca8062c8SMatthew G. Knepley } 623158723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 623258723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6233ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6234ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6235ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 623658723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 623758723a97SMatthew G. Knepley 623858723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 623958723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 624058723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 624158723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 624258723a97SMatthew G. Knepley } 624358723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6244ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6245ca8062c8SMatthew G. Knepley } 624642363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 624742363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 624842363296SMatthew G. Knepley 624942363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 625042363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 625142363296SMatthew G. Knepley const PetscInt p = closure[cl]; 625242363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 625342363296SMatthew G. Knepley } 625442363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 625542363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 625642363296SMatthew G. Knepley } 6257ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6258ca8062c8SMatthew G. Knepley } 62599bf0dad6SMatthew G. Knepley 62609bf0dad6SMatthew G. Knepley #undef __FUNCT__ 62619bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 62629bf0dad6SMatthew G. Knepley /*@ 62639bf0dad6SMatthew 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 62649bf0dad6SMatthew G. Knepley 62659bf0dad6SMatthew G. Knepley Input Parameters: 62669bf0dad6SMatthew G. Knepley + dm - The DMPlex object 62679bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 62689bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 62699bf0dad6SMatthew G. Knepley 62709bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 62719bf0dad6SMatthew G. Knepley 62729bf0dad6SMatthew G. Knepley Level: developer 62739bf0dad6SMatthew G. Knepley 62749bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 62759bf0dad6SMatthew G. Knepley @*/ 62769bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 62779bf0dad6SMatthew G. Knepley { 62783554e41dSMatthew G. Knepley PetscInt pMax[4]; 62793554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 62809bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 62819bf0dad6SMatthew G. Knepley 62829bf0dad6SMatthew G. Knepley PetscFunctionBegin; 62839bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 62849bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 62859bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 628625abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 62873554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 62883554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 62893554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 62909bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 62919bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 62929bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 62939bf0dad6SMatthew G. Knepley 629425abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 62959bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 62969bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 62979bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 62989bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 62999bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 63009bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 63019bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 63029bf0dad6SMatthew G. Knepley } 63033554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 63049bf0dad6SMatthew 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); 63059bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 63069bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 63079bf0dad6SMatthew G. Knepley 63089bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 63099bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 63109bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 63119bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 63129bf0dad6SMatthew G. Knepley } 6313e003ed69SMatthew 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); 63149bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6315e003ed69SMatthew 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]); 63169bf0dad6SMatthew G. Knepley } 63179bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 63189bf0dad6SMatthew G. Knepley } 63199bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 63209bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 63219bf0dad6SMatthew G. Knepley } 63223554e41dSMatthew G. Knepley } 6323552f7358SJed Brown PetscFunctionReturn(0); 6324552f7358SJed Brown } 63253913d7c8SMatthew G. Knepley 63263913d7c8SMatthew G. Knepley #undef __FUNCT__ 6327*bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6328*bceba477SMatthew G. Knepley /* Pointwise interpolation 6329*bceba477SMatthew G. Knepley Just code FEM for now 6330*bceba477SMatthew G. Knepley u^f = I u^c 6331*bceba477SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6332*bceba477SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6333*bceba477SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6334*bceba477SMatthew G. Knepley */ 6335*bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6336*bceba477SMatthew G. Knepley { 6337*bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6338*bceba477SMatthew G. Knepley PetscInt m, n; 6339*bceba477SMatthew G. Knepley PetscErrorCode ierr; 6340*bceba477SMatthew G. Knepley 6341*bceba477SMatthew G. Knepley PetscFunctionBegin; 6342*bceba477SMatthew G. Knepley /* 6343*bceba477SMatthew G. Knepley Loop over coarse cells 6344*bceba477SMatthew G. Knepley Loop over coarse basis functions 6345*bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6346*bceba477SMatthew G. Knepley Loop over fine dual basis functions 6347*bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6348*bceba477SMatthew G. Knepley Sum 6349*bceba477SMatthew G. Knepley Update local element matrix 6350*bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6351*bceba477SMatthew G. Knepley 6352*bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6353*bceba477SMatthew G. Knepley */ 6354*bceba477SMatthew G. Knepley *scaling = NULL; 6355*bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6356*bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6357*bceba477SMatthew G. Knepley /* TODO: The coarse DM needs to have the section defined */ 6358*bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6359*bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 6360*bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6361*bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6362*bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6363*bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6364*bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 6365*bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 6366*bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 6367*bceba477SMatthew G. Knepley 6368*bceba477SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, NULL);CHKERRQ(ierr); 6369*bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6370*bceba477SMatthew G. Knepley } 6371*bceba477SMatthew G. Knepley 6372*bceba477SMatthew G. Knepley #undef __FUNCT__ 6373*bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6374*bceba477SMatthew G. Knepley /* Pointwise restriction: 6375*bceba477SMatthew G. Knepley Give up on anything beyond P_0 and P_1 for now 6376*bceba477SMatthew G. Knepley */ 6377*bceba477SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6378*bceba477SMatthew G. Knepley { 6379*bceba477SMatthew G. Knepley PetscFunctionBegin; 6380*bceba477SMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dmCoarse), PETSC_ERR_SUP, "Working as fast as I can"); 6381*bceba477SMatthew G. Knepley /* 6382*bceba477SMatthew G. Knepley Loop over coarse vertices 6383*bceba477SMatthew G. Knepley Lookup associated fine vertex 6384*bceba477SMatthew G. Knepley map coarse dofs to fine dofs 6385*bceba477SMatthew G. Knepley Loop over coarse cells 6386*bceba477SMatthew G. Knepley Lookup associated fine cells 6387*bceba477SMatthew G. Knepley map coarse dofs to fine dofs 6388*bceba477SMatthew G. Knepley */ 6389*bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6390*bceba477SMatthew G. Knepley } 6391*bceba477SMatthew G. Knepley 6392*bceba477SMatthew G. Knepley #undef __FUNCT__ 63933913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 63943913d7c8SMatthew G. Knepley /*@ 63953913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 63963913d7c8SMatthew G. Knepley 63973913d7c8SMatthew G. Knepley Input Parameter: 63983913d7c8SMatthew G. Knepley . dm - The DMPlex object 63993913d7c8SMatthew G. Knepley 64003913d7c8SMatthew G. Knepley Output Parameter: 64013913d7c8SMatthew G. Knepley . cdm - The coarse DM 64023913d7c8SMatthew G. Knepley 64033913d7c8SMatthew G. Knepley Level: intermediate 64043913d7c8SMatthew G. Knepley 64053913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 64063913d7c8SMatthew G. Knepley @*/ 64073913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 64083913d7c8SMatthew G. Knepley { 64093913d7c8SMatthew G. Knepley PetscFunctionBegin; 64103913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 64113913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 64123913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 64133913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 64143913d7c8SMatthew G. Knepley } 64153913d7c8SMatthew G. Knepley 64163913d7c8SMatthew G. Knepley #undef __FUNCT__ 64173913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 64183913d7c8SMatthew G. Knepley /*@ 64193913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 64203913d7c8SMatthew G. Knepley 64213913d7c8SMatthew G. Knepley Input Parameters: 64223913d7c8SMatthew G. Knepley + dm - The DMPlex object 64233913d7c8SMatthew G. Knepley - cdm - The coarse DM 64243913d7c8SMatthew G. Knepley 64253913d7c8SMatthew G. Knepley Level: intermediate 64263913d7c8SMatthew G. Knepley 64273913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 64283913d7c8SMatthew G. Knepley @*/ 64293913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 64303913d7c8SMatthew G. Knepley { 64313913d7c8SMatthew G. Knepley DM_Plex *mesh; 64323913d7c8SMatthew G. Knepley PetscErrorCode ierr; 64333913d7c8SMatthew G. Knepley 64343913d7c8SMatthew G. Knepley PetscFunctionBegin; 64353913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 64363913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 64373913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 64383913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 64393913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 64403913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 64413913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 64423913d7c8SMatthew G. Knepley } 6443