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 */ 7b96afcd5SMatthew G. Knepley PetscLogEvent DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_Stratify, 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);} 222552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%G", 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);} 246552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%G", 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); 294834065abSMatthew G. Knepley ierr = PetscMalloc2(size,PetscInt,&sizes,size,PetscInt,&hybsizes);CHKERRQ(ierr); 295552f7358SJed Brown if (depth == 1) { 296552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 297552f7358SJed Brown pEnd = pEnd - pStart; 298552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 299552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 300552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 301552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 302552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 303552f7358SJed Brown pEnd = pEnd - pStart; 304552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 305552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 306552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 307552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 308552f7358SJed Brown } else { 309552f7358SJed Brown for (d = 0; d <= dim; d++) { 310552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 311834065abSMatthew G. Knepley pEnd -= pStart; 312834065abSMatthew G. Knepley pMax[d] -= pStart; 313552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 314834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 315552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 316834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 317834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 318834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 319834065abSMatthew G. Knepley } 320552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 321552f7358SJed Brown } 322552f7358SJed Brown } 323834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 324a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 325a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 326a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 327a57dd577SMatthew G Knepley DMLabel label; 328a57dd577SMatthew G Knepley const char *name; 329a57dd577SMatthew G Knepley IS valueIS; 330a57dd577SMatthew G Knepley const PetscInt *values; 331a57dd577SMatthew G Knepley PetscInt numValues, v; 332a57dd577SMatthew G Knepley 333a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 334a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 335a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 336a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 337a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 338a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 339a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 340a57dd577SMatthew G Knepley PetscInt size; 341a57dd577SMatthew G Knepley 342a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 343a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 344a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 345a57dd577SMatthew G Knepley } 346a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 347a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 3484d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 349a57dd577SMatthew G Knepley } 350552f7358SJed Brown } 351552f7358SJed Brown PetscFunctionReturn(0); 352552f7358SJed Brown } 353552f7358SJed Brown 354552f7358SJed Brown #undef __FUNCT__ 355552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 356552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 357552f7358SJed Brown { 358552f7358SJed Brown PetscBool iascii, isbinary; 359552f7358SJed Brown PetscErrorCode ierr; 360552f7358SJed Brown 361552f7358SJed Brown PetscFunctionBegin; 362552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 363552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 364552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 365552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 366552f7358SJed Brown if (iascii) { 367552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 368552f7358SJed Brown #if 0 369552f7358SJed Brown } else if (isbinary) { 370552f7358SJed Brown ierr = DMPlexView_Binary(dm, viewer);CHKERRQ(ierr); 371552f7358SJed Brown #endif 37211aeaf0aSBarry Smith } 373552f7358SJed Brown PetscFunctionReturn(0); 374552f7358SJed Brown } 375552f7358SJed Brown 376552f7358SJed Brown #undef __FUNCT__ 377552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 378552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 379552f7358SJed Brown { 380552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 381552f7358SJed Brown DMLabel next = mesh->labels; 382552f7358SJed Brown PetscErrorCode ierr; 383552f7358SJed Brown 384552f7358SJed Brown PetscFunctionBegin; 3850d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 386552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 387552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 388552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 389552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 390552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 391552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 392552f7358SJed Brown while (next) { 393552f7358SJed Brown DMLabel tmp = next->next; 394552f7358SJed Brown 395552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 396552f7358SJed Brown next = tmp; 397552f7358SJed Brown } 398a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 399552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 400552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 401552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 402552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 403552f7358SJed Brown PetscFunctionReturn(0); 404552f7358SJed Brown } 405552f7358SJed Brown 406552f7358SJed Brown #undef __FUNCT__ 407552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 408b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 409552f7358SJed Brown { 410552f7358SJed Brown PetscSection section, sectionGlobal; 411552f7358SJed Brown PetscInt bs = -1; 412552f7358SJed Brown PetscInt localSize; 41389545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 414552f7358SJed Brown PetscErrorCode ierr; 415b412c318SBarry Smith MatType mtype; 416552f7358SJed Brown 417552f7358SJed Brown PetscFunctionBegin; 418607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 419b412c318SBarry Smith mtype = dm->mattype; 420552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 421552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 422552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 423552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 42482f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 425552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 426552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 427552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 428552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 429552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 430552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 431552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 432552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 433552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 434552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 435552f7358SJed Brown if (!isShell) { 436552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 4372a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 438552f7358SJed Brown 439552f7358SJed Brown if (bs < 0) { 440552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 441fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 442552f7358SJed Brown 443552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 444552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 445552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 446fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 447fad22124SMatthew G Knepley if (dof-cdof) { 4482a28c762SMatthew G Knepley if (bs < 0) { 449fad22124SMatthew G Knepley bs = dof-cdof; 450fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 4512a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 4522a28c762SMatthew G Knepley bs = 1; 453552f7358SJed Brown break; 454552f7358SJed Brown } 455552f7358SJed Brown } 4562a28c762SMatthew G Knepley } 4572a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 4582a28c762SMatthew G Knepley bsLocal = bs; 45982f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4602a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 46182f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4622a28c762SMatthew G Knepley if (bsMin != bsMax) { 4632a28c762SMatthew G Knepley bs = 1; 4642a28c762SMatthew G Knepley } else { 4652a28c762SMatthew G Knepley bs = bsMax; 4662a28c762SMatthew G Knepley } 467552f7358SJed Brown } else { 468552f7358SJed Brown bs = 1; 469552f7358SJed Brown } 470552f7358SJed Brown } 471552f7358SJed Brown ierr = PetscMalloc4(localSize/bs, PetscInt, &dnz, localSize/bs, PetscInt, &onz, localSize/bs, PetscInt, &dnzu, localSize/bs, PetscInt, &onzu);CHKERRQ(ierr); 472552f7358SJed Brown ierr = PetscMemzero(dnz, localSize/bs * sizeof(PetscInt));CHKERRQ(ierr); 473552f7358SJed Brown ierr = PetscMemzero(onz, localSize/bs * sizeof(PetscInt));CHKERRQ(ierr); 474552f7358SJed Brown ierr = PetscMemzero(dnzu, localSize/bs * sizeof(PetscInt));CHKERRQ(ierr); 475552f7358SJed Brown ierr = PetscMemzero(onzu, localSize/bs * sizeof(PetscInt));CHKERRQ(ierr); 476552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 477552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 478552f7358SJed Brown } 479552f7358SJed Brown PetscFunctionReturn(0); 480552f7358SJed Brown } 481552f7358SJed Brown 482552f7358SJed Brown #undef __FUNCT__ 483552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 484552f7358SJed Brown /*@ 485552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 486552f7358SJed Brown 487552f7358SJed Brown Not collective 488552f7358SJed Brown 489552f7358SJed Brown Input Parameter: 490552f7358SJed Brown . mesh - The DMPlex 491552f7358SJed Brown 492552f7358SJed Brown Output Parameter: 493552f7358SJed Brown . dim - The topological mesh dimension 494552f7358SJed Brown 495552f7358SJed Brown Level: beginner 496552f7358SJed Brown 497552f7358SJed Brown .seealso: DMPlexCreate() 498552f7358SJed Brown @*/ 499552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 500552f7358SJed Brown { 501552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 502552f7358SJed Brown 503552f7358SJed Brown PetscFunctionBegin; 504552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 505552f7358SJed Brown PetscValidPointer(dim, 2); 506552f7358SJed Brown *dim = mesh->dim; 507552f7358SJed Brown PetscFunctionReturn(0); 508552f7358SJed Brown } 509552f7358SJed Brown 510552f7358SJed Brown #undef __FUNCT__ 511552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 512552f7358SJed Brown /*@ 513552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 514552f7358SJed Brown 515552f7358SJed Brown Collective on mesh 516552f7358SJed Brown 517552f7358SJed Brown Input Parameters: 518552f7358SJed Brown + mesh - The DMPlex 519552f7358SJed Brown - dim - The topological mesh dimension 520552f7358SJed Brown 521552f7358SJed Brown Level: beginner 522552f7358SJed Brown 523552f7358SJed Brown .seealso: DMPlexCreate() 524552f7358SJed Brown @*/ 525552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 526552f7358SJed Brown { 527552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 528552f7358SJed Brown 529552f7358SJed Brown PetscFunctionBegin; 530552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 531552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 532552f7358SJed Brown mesh->dim = dim; 533552f7358SJed Brown mesh->preallocCenterDim = dim; 534552f7358SJed Brown PetscFunctionReturn(0); 535552f7358SJed Brown } 536552f7358SJed Brown 537552f7358SJed Brown #undef __FUNCT__ 538552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 539552f7358SJed Brown /*@ 540552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 541552f7358SJed Brown 542552f7358SJed Brown Not collective 543552f7358SJed Brown 544552f7358SJed Brown Input Parameter: 545552f7358SJed Brown . mesh - The DMPlex 546552f7358SJed Brown 547552f7358SJed Brown Output Parameters: 548552f7358SJed Brown + pStart - The first mesh point 549552f7358SJed Brown - pEnd - The upper bound for mesh points 550552f7358SJed Brown 551552f7358SJed Brown Level: beginner 552552f7358SJed Brown 553552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 554552f7358SJed Brown @*/ 555552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 556552f7358SJed Brown { 557552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 558552f7358SJed Brown PetscErrorCode ierr; 559552f7358SJed Brown 560552f7358SJed Brown PetscFunctionBegin; 561552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 562552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 563552f7358SJed Brown PetscFunctionReturn(0); 564552f7358SJed Brown } 565552f7358SJed Brown 566552f7358SJed Brown #undef __FUNCT__ 567552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 568552f7358SJed Brown /*@ 569552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 570552f7358SJed Brown 571552f7358SJed Brown Not collective 572552f7358SJed Brown 573552f7358SJed Brown Input Parameters: 574552f7358SJed Brown + mesh - The DMPlex 575552f7358SJed Brown . pStart - The first mesh point 576552f7358SJed Brown - pEnd - The upper bound for mesh points 577552f7358SJed Brown 578552f7358SJed Brown Output Parameters: 579552f7358SJed Brown 580552f7358SJed Brown Level: beginner 581552f7358SJed Brown 582552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 583552f7358SJed Brown @*/ 584552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 585552f7358SJed Brown { 586552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 587552f7358SJed Brown PetscErrorCode ierr; 588552f7358SJed Brown 589552f7358SJed Brown PetscFunctionBegin; 590552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 591552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 592552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 593552f7358SJed Brown PetscFunctionReturn(0); 594552f7358SJed Brown } 595552f7358SJed Brown 596552f7358SJed Brown #undef __FUNCT__ 597552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 598552f7358SJed Brown /*@ 599552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 600552f7358SJed Brown 601552f7358SJed Brown Not collective 602552f7358SJed Brown 603552f7358SJed Brown Input Parameters: 604552f7358SJed Brown + mesh - The DMPlex 605552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 606552f7358SJed Brown 607552f7358SJed Brown Output Parameter: 608552f7358SJed Brown . size - The cone size for point p 609552f7358SJed Brown 610552f7358SJed Brown Level: beginner 611552f7358SJed Brown 612552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 613552f7358SJed Brown @*/ 614552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 615552f7358SJed Brown { 616552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 617552f7358SJed Brown PetscErrorCode ierr; 618552f7358SJed Brown 619552f7358SJed Brown PetscFunctionBegin; 620552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 621552f7358SJed Brown PetscValidPointer(size, 3); 622552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 623552f7358SJed Brown PetscFunctionReturn(0); 624552f7358SJed Brown } 625552f7358SJed Brown 626552f7358SJed Brown #undef __FUNCT__ 627552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 628552f7358SJed Brown /*@ 629552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 630552f7358SJed Brown 631552f7358SJed Brown Not collective 632552f7358SJed Brown 633552f7358SJed Brown Input Parameters: 634552f7358SJed Brown + mesh - The DMPlex 635552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 636552f7358SJed Brown - size - The cone size for point p 637552f7358SJed Brown 638552f7358SJed Brown Output Parameter: 639552f7358SJed Brown 640552f7358SJed Brown Note: 641552f7358SJed Brown This should be called after DMPlexSetChart(). 642552f7358SJed Brown 643552f7358SJed Brown Level: beginner 644552f7358SJed Brown 645552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 646552f7358SJed Brown @*/ 647552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 648552f7358SJed Brown { 649552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 650552f7358SJed Brown PetscErrorCode ierr; 651552f7358SJed Brown 652552f7358SJed Brown PetscFunctionBegin; 653552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 654552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 6550d644c17SKarl Rupp 656552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 657552f7358SJed Brown PetscFunctionReturn(0); 658552f7358SJed Brown } 659552f7358SJed Brown 660552f7358SJed Brown #undef __FUNCT__ 661552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 662552f7358SJed Brown /*@C 663552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 664552f7358SJed Brown 665552f7358SJed Brown Not collective 666552f7358SJed Brown 667552f7358SJed Brown Input Parameters: 668552f7358SJed Brown + mesh - The DMPlex 669552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 670552f7358SJed Brown 671552f7358SJed Brown Output Parameter: 672552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 673552f7358SJed Brown 674552f7358SJed Brown Level: beginner 675552f7358SJed Brown 6763813dfbdSMatthew G Knepley Fortran Notes: 6773813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 6783813dfbdSMatthew G Knepley include petsc.h90 in your code. 6793813dfbdSMatthew G Knepley 6803813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 681552f7358SJed Brown 682552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 683552f7358SJed Brown @*/ 684552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 685552f7358SJed Brown { 686552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 687552f7358SJed Brown PetscInt off; 688552f7358SJed Brown PetscErrorCode ierr; 689552f7358SJed Brown 690552f7358SJed Brown PetscFunctionBegin; 691552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 692552f7358SJed Brown PetscValidPointer(cone, 3); 693552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 694552f7358SJed Brown *cone = &mesh->cones[off]; 695552f7358SJed Brown PetscFunctionReturn(0); 696552f7358SJed Brown } 697552f7358SJed Brown 698552f7358SJed Brown #undef __FUNCT__ 699552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 700552f7358SJed Brown /*@ 701552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 702552f7358SJed Brown 703552f7358SJed Brown Not collective 704552f7358SJed Brown 705552f7358SJed Brown Input Parameters: 706552f7358SJed Brown + mesh - The DMPlex 707552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 708552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 709552f7358SJed Brown 710552f7358SJed Brown Output Parameter: 711552f7358SJed Brown 712552f7358SJed Brown Note: 713552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 714552f7358SJed Brown 715552f7358SJed Brown Level: beginner 716552f7358SJed Brown 717552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 718552f7358SJed Brown @*/ 719552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 720552f7358SJed Brown { 721552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 722552f7358SJed Brown PetscInt pStart, pEnd; 723552f7358SJed Brown PetscInt dof, off, c; 724552f7358SJed Brown PetscErrorCode ierr; 725552f7358SJed Brown 726552f7358SJed Brown PetscFunctionBegin; 727552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 728552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 729552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 730552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 731552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 73282f516ccSBarry 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); 733552f7358SJed Brown for (c = 0; c < dof; ++c) { 73482f516ccSBarry 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); 735552f7358SJed Brown mesh->cones[off+c] = cone[c]; 736552f7358SJed Brown } 737552f7358SJed Brown PetscFunctionReturn(0); 738552f7358SJed Brown } 739552f7358SJed Brown 740552f7358SJed Brown #undef __FUNCT__ 741552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 742552f7358SJed Brown /*@C 743552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 744552f7358SJed Brown 745552f7358SJed Brown Not collective 746552f7358SJed Brown 747552f7358SJed Brown Input Parameters: 748552f7358SJed Brown + mesh - The DMPlex 749552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 750552f7358SJed Brown 751552f7358SJed Brown Output Parameter: 752552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 753552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 754552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 755552f7358SJed Brown the index of the cone point on which to start. 756552f7358SJed Brown 757552f7358SJed Brown Level: beginner 758552f7358SJed Brown 7593813dfbdSMatthew G Knepley Fortran Notes: 7603813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7613813dfbdSMatthew G Knepley include petsc.h90 in your code. 7623813dfbdSMatthew G Knepley 7633813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 764552f7358SJed Brown 765552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 766552f7358SJed Brown @*/ 767552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 768552f7358SJed Brown { 769552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 770552f7358SJed Brown PetscInt off; 771552f7358SJed Brown PetscErrorCode ierr; 772552f7358SJed Brown 773552f7358SJed Brown PetscFunctionBegin; 774552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 775552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 776552f7358SJed Brown { 777552f7358SJed Brown PetscInt dof; 778552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 779552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 780552f7358SJed Brown } 781552f7358SJed Brown #endif 782552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 7830d644c17SKarl Rupp 784552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 785552f7358SJed Brown PetscFunctionReturn(0); 786552f7358SJed Brown } 787552f7358SJed Brown 788552f7358SJed Brown #undef __FUNCT__ 789552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 790552f7358SJed Brown /*@ 791552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 792552f7358SJed Brown 793552f7358SJed Brown Not collective 794552f7358SJed Brown 795552f7358SJed Brown Input Parameters: 796552f7358SJed Brown + mesh - The DMPlex 797552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 798552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 799552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 800552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 801552f7358SJed Brown the index of the cone point on which to start. 802552f7358SJed Brown 803552f7358SJed Brown Output Parameter: 804552f7358SJed Brown 805552f7358SJed Brown Note: 806552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 807552f7358SJed Brown 808552f7358SJed Brown Level: beginner 809552f7358SJed Brown 810552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 811552f7358SJed Brown @*/ 812552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 813552f7358SJed Brown { 814552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 815552f7358SJed Brown PetscInt pStart, pEnd; 816552f7358SJed Brown PetscInt dof, off, c; 817552f7358SJed Brown PetscErrorCode ierr; 818552f7358SJed Brown 819552f7358SJed Brown PetscFunctionBegin; 820552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 821552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 822552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 823552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 824552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 82582f516ccSBarry 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); 826552f7358SJed Brown for (c = 0; c < dof; ++c) { 827552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 828552f7358SJed Brown 829552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 83082f516ccSBarry 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); 831552f7358SJed Brown mesh->coneOrientations[off+c] = o; 832552f7358SJed Brown } 833552f7358SJed Brown PetscFunctionReturn(0); 834552f7358SJed Brown } 835552f7358SJed Brown 836552f7358SJed Brown #undef __FUNCT__ 837552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 838552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 839552f7358SJed Brown { 840552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 841552f7358SJed Brown PetscInt pStart, pEnd; 842552f7358SJed Brown PetscInt dof, off; 843552f7358SJed Brown PetscErrorCode ierr; 844552f7358SJed Brown 845552f7358SJed Brown PetscFunctionBegin; 846552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 847552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 84882f516ccSBarry 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); 84982f516ccSBarry 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); 85077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 85177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 85277c88f5bSMatthew 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); 853552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 854552f7358SJed Brown PetscFunctionReturn(0); 855552f7358SJed Brown } 856552f7358SJed Brown 857552f7358SJed Brown #undef __FUNCT__ 85877c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 85977c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 86077c88f5bSMatthew G Knepley { 86177c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 86277c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 86377c88f5bSMatthew G Knepley PetscInt dof, off; 86477c88f5bSMatthew G Knepley PetscErrorCode ierr; 86577c88f5bSMatthew G Knepley 86677c88f5bSMatthew G Knepley PetscFunctionBegin; 86777c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 86877c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 86977c88f5bSMatthew 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); 87077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 87177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 87277c88f5bSMatthew 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); 87377c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 87477c88f5bSMatthew G Knepley PetscFunctionReturn(0); 87577c88f5bSMatthew G Knepley } 87677c88f5bSMatthew G Knepley 87777c88f5bSMatthew G Knepley #undef __FUNCT__ 878552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 879552f7358SJed Brown /*@ 880552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 881552f7358SJed Brown 882552f7358SJed Brown Not collective 883552f7358SJed Brown 884552f7358SJed Brown Input Parameters: 885552f7358SJed Brown + mesh - The DMPlex 886552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 887552f7358SJed Brown 888552f7358SJed Brown Output Parameter: 889552f7358SJed Brown . size - The support size for point p 890552f7358SJed Brown 891552f7358SJed Brown Level: beginner 892552f7358SJed Brown 893552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 894552f7358SJed Brown @*/ 895552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 896552f7358SJed Brown { 897552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 898552f7358SJed Brown PetscErrorCode ierr; 899552f7358SJed Brown 900552f7358SJed Brown PetscFunctionBegin; 901552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 902552f7358SJed Brown PetscValidPointer(size, 3); 903552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 904552f7358SJed Brown PetscFunctionReturn(0); 905552f7358SJed Brown } 906552f7358SJed Brown 907552f7358SJed Brown #undef __FUNCT__ 908552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 909552f7358SJed Brown /*@ 910552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 911552f7358SJed Brown 912552f7358SJed Brown Not collective 913552f7358SJed Brown 914552f7358SJed Brown Input Parameters: 915552f7358SJed Brown + mesh - The DMPlex 916552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 917552f7358SJed Brown - size - The support size for point p 918552f7358SJed Brown 919552f7358SJed Brown Output Parameter: 920552f7358SJed Brown 921552f7358SJed Brown Note: 922552f7358SJed Brown This should be called after DMPlexSetChart(). 923552f7358SJed Brown 924552f7358SJed Brown Level: beginner 925552f7358SJed Brown 926552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 927552f7358SJed Brown @*/ 928552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 929552f7358SJed Brown { 930552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 931552f7358SJed Brown PetscErrorCode ierr; 932552f7358SJed Brown 933552f7358SJed Brown PetscFunctionBegin; 934552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 935552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 9360d644c17SKarl Rupp 937552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 938552f7358SJed Brown PetscFunctionReturn(0); 939552f7358SJed Brown } 940552f7358SJed Brown 941552f7358SJed Brown #undef __FUNCT__ 942552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 943552f7358SJed Brown /*@C 944552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 945552f7358SJed Brown 946552f7358SJed Brown Not collective 947552f7358SJed Brown 948552f7358SJed Brown Input Parameters: 949552f7358SJed Brown + mesh - The DMPlex 950552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 951552f7358SJed Brown 952552f7358SJed Brown Output Parameter: 953552f7358SJed Brown . support - An array of points which are on the out-edges for point p 954552f7358SJed Brown 955552f7358SJed Brown Level: beginner 956552f7358SJed Brown 9573813dfbdSMatthew G Knepley Fortran Notes: 9583813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9593813dfbdSMatthew G Knepley include petsc.h90 in your code. 9603813dfbdSMatthew G Knepley 9613813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 9623813dfbdSMatthew G Knepley 963552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 964552f7358SJed Brown @*/ 965552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 966552f7358SJed Brown { 967552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 968552f7358SJed Brown PetscInt off; 969552f7358SJed Brown PetscErrorCode ierr; 970552f7358SJed Brown 971552f7358SJed Brown PetscFunctionBegin; 972552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 973552f7358SJed Brown PetscValidPointer(support, 3); 974552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 975552f7358SJed Brown *support = &mesh->supports[off]; 976552f7358SJed Brown PetscFunctionReturn(0); 977552f7358SJed Brown } 978552f7358SJed Brown 979552f7358SJed Brown #undef __FUNCT__ 980552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 981552f7358SJed Brown /*@ 982552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 983552f7358SJed Brown 984552f7358SJed Brown Not collective 985552f7358SJed Brown 986552f7358SJed Brown Input Parameters: 987552f7358SJed Brown + mesh - The DMPlex 988552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 989552f7358SJed Brown - support - An array of points which are on the in-edges for point p 990552f7358SJed Brown 991552f7358SJed Brown Output Parameter: 992552f7358SJed Brown 993552f7358SJed Brown Note: 994552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 995552f7358SJed Brown 996552f7358SJed Brown Level: beginner 997552f7358SJed Brown 998552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 999552f7358SJed Brown @*/ 1000552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1001552f7358SJed Brown { 1002552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1003552f7358SJed Brown PetscInt pStart, pEnd; 1004552f7358SJed Brown PetscInt dof, off, c; 1005552f7358SJed Brown PetscErrorCode ierr; 1006552f7358SJed Brown 1007552f7358SJed Brown PetscFunctionBegin; 1008552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1009552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1010552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1011552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1012552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 101382f516ccSBarry 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); 1014552f7358SJed Brown for (c = 0; c < dof; ++c) { 101582f516ccSBarry 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); 1016552f7358SJed Brown mesh->supports[off+c] = support[c]; 1017552f7358SJed Brown } 1018552f7358SJed Brown PetscFunctionReturn(0); 1019552f7358SJed Brown } 1020552f7358SJed Brown 1021552f7358SJed Brown #undef __FUNCT__ 1022552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1023552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1024552f7358SJed Brown { 1025552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1026552f7358SJed Brown PetscInt pStart, pEnd; 1027552f7358SJed Brown PetscInt dof, off; 1028552f7358SJed Brown PetscErrorCode ierr; 1029552f7358SJed Brown 1030552f7358SJed Brown PetscFunctionBegin; 1031552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1032552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1033552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1034552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 103582f516ccSBarry 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); 103682f516ccSBarry 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); 103782f516ccSBarry 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); 1038552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1039552f7358SJed Brown PetscFunctionReturn(0); 1040552f7358SJed Brown } 1041552f7358SJed Brown 1042552f7358SJed Brown #undef __FUNCT__ 1043552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1044552f7358SJed Brown /*@C 1045552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1046552f7358SJed Brown 1047552f7358SJed Brown Not collective 1048552f7358SJed Brown 1049552f7358SJed Brown Input Parameters: 1050552f7358SJed Brown + mesh - The DMPlex 1051552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1052552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 10530298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1054552f7358SJed Brown 1055552f7358SJed Brown Output Parameters: 1056552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1057552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1058552f7358SJed Brown 1059552f7358SJed Brown Note: 10600298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1061552f7358SJed Brown 10623813dfbdSMatthew G Knepley Fortran Notes: 10633813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10643813dfbdSMatthew G Knepley include petsc.h90 in your code. 10653813dfbdSMatthew G Knepley 10663813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 10673813dfbdSMatthew G Knepley 1068552f7358SJed Brown Level: beginner 1069552f7358SJed Brown 1070552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1071552f7358SJed Brown @*/ 1072552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1073552f7358SJed Brown { 1074552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1075552f7358SJed Brown PetscInt *closure, *fifo; 10760298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1077552f7358SJed Brown PetscInt tmpSize, t; 1078552f7358SJed Brown PetscInt depth = 0, maxSize; 1079552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1080552f7358SJed Brown PetscErrorCode ierr; 1081552f7358SJed Brown 1082552f7358SJed Brown PetscFunctionBegin; 1083552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1084552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1085552f7358SJed Brown /* This is only 1-level */ 1086552f7358SJed Brown if (useCone) { 1087552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1088552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1089552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1090552f7358SJed Brown } else { 1091552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1092552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1093552f7358SJed Brown } 1094bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1095bfbcdd7aSMatthew G. Knepley if (*points) { 1096bfbcdd7aSMatthew G. Knepley closure = *points; 1097bfbcdd7aSMatthew G. Knepley } else { 1098bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1099bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1100bfbcdd7aSMatthew G. Knepley } 1101bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1102bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1103bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1104bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1105bfbcdd7aSMatthew G. Knepley } 1106bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1107bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1108bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1109bfbcdd7aSMatthew G. Knepley } 1110bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1111bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1112bfbcdd7aSMatthew G. Knepley if (*points) { 1113bfbcdd7aSMatthew G. Knepley closure = *points; 1114bfbcdd7aSMatthew G. Knepley } else { 1115bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1116bfbcdd7aSMatthew G. Knepley } 1117bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1118552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1119552f7358SJed Brown const PetscInt cp = tmp[t]; 1120552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1121552f7358SJed Brown 1122552f7358SJed Brown closure[closureSize] = cp; 1123552f7358SJed Brown closure[closureSize+1] = co; 1124552f7358SJed Brown fifo[fifoSize] = cp; 1125552f7358SJed Brown fifo[fifoSize+1] = co; 1126552f7358SJed Brown } 1127bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1128552f7358SJed Brown while (fifoSize - fifoStart) { 1129552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1130552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1131552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1132552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1133552f7358SJed Brown 1134552f7358SJed Brown if (useCone) { 1135552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1136552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1137552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1138552f7358SJed Brown } else { 1139552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1140552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 11410298fd71SBarry Smith tmpO = NULL; 1142552f7358SJed Brown } 1143552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1144552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1145552f7358SJed Brown const PetscInt cp = tmp[i]; 11462e1b13c2SMatthew 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. */ 11472e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 11482e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 11492e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1150552f7358SJed Brown PetscInt c; 1151552f7358SJed Brown 11522e1b13c2SMatthew G. Knepley if (rev) { 11532e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 11542e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 11552e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 11562e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 11572e1b13c2SMatthew G. Knepley } 1158552f7358SJed Brown /* Check for duplicate */ 1159552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1160552f7358SJed Brown if (closure[c] == cp) break; 1161552f7358SJed Brown } 1162552f7358SJed Brown if (c == closureSize) { 1163552f7358SJed Brown closure[closureSize] = cp; 1164552f7358SJed Brown closure[closureSize+1] = co; 1165552f7358SJed Brown fifo[fifoSize] = cp; 1166552f7358SJed Brown fifo[fifoSize+1] = co; 1167552f7358SJed Brown closureSize += 2; 1168552f7358SJed Brown fifoSize += 2; 1169552f7358SJed Brown } 1170552f7358SJed Brown } 1171552f7358SJed Brown fifoStart += 2; 1172552f7358SJed Brown } 1173552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1174552f7358SJed Brown if (points) *points = closure; 1175552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1176552f7358SJed Brown PetscFunctionReturn(0); 1177552f7358SJed Brown } 1178552f7358SJed Brown 1179552f7358SJed Brown #undef __FUNCT__ 1180552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1181552f7358SJed Brown /*@C 1182552f7358SJed 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 1183552f7358SJed Brown 1184552f7358SJed Brown Not collective 1185552f7358SJed Brown 1186552f7358SJed Brown Input Parameters: 1187552f7358SJed Brown + mesh - The DMPlex 1188552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1189552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1190e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1191e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1192552f7358SJed Brown 1193552f7358SJed Brown Note: 11940298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1195552f7358SJed Brown 11963813dfbdSMatthew G Knepley Fortran Notes: 11973813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11983813dfbdSMatthew G Knepley include petsc.h90 in your code. 11993813dfbdSMatthew G Knepley 12003813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12013813dfbdSMatthew G Knepley 1202552f7358SJed Brown Level: beginner 1203552f7358SJed Brown 1204552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1205552f7358SJed Brown @*/ 1206552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1207552f7358SJed Brown { 1208552f7358SJed Brown PetscErrorCode ierr; 1209552f7358SJed Brown 1210552f7358SJed Brown PetscFunctionBegin; 1211552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1212e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1213e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1214552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 12154ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1216552f7358SJed Brown PetscFunctionReturn(0); 1217552f7358SJed Brown } 1218552f7358SJed Brown 1219552f7358SJed Brown #undef __FUNCT__ 1220552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1221552f7358SJed Brown /*@ 1222552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1223552f7358SJed Brown 1224552f7358SJed Brown Not collective 1225552f7358SJed Brown 1226552f7358SJed Brown Input Parameter: 1227552f7358SJed Brown . mesh - The DMPlex 1228552f7358SJed Brown 1229552f7358SJed Brown Output Parameters: 1230552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1231552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1232552f7358SJed Brown 1233552f7358SJed Brown Level: beginner 1234552f7358SJed Brown 1235552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1236552f7358SJed Brown @*/ 1237552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1238552f7358SJed Brown { 1239552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1240552f7358SJed Brown 1241552f7358SJed Brown PetscFunctionBegin; 1242552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1243552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1244552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1245552f7358SJed Brown PetscFunctionReturn(0); 1246552f7358SJed Brown } 1247552f7358SJed Brown 1248552f7358SJed Brown #undef __FUNCT__ 1249552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1250552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1251552f7358SJed Brown { 1252552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1253552f7358SJed Brown PetscInt size; 1254552f7358SJed Brown PetscErrorCode ierr; 1255552f7358SJed Brown 1256552f7358SJed Brown PetscFunctionBegin; 1257552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1258552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1259552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 1260552f7358SJed Brown ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->cones);CHKERRQ(ierr); 1261552f7358SJed Brown ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->coneOrientations);CHKERRQ(ierr); 1262552f7358SJed Brown ierr = PetscMemzero(mesh->coneOrientations, size * sizeof(PetscInt));CHKERRQ(ierr); 1263552f7358SJed Brown if (mesh->maxSupportSize) { 1264552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1265552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 1266552f7358SJed Brown ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->supports);CHKERRQ(ierr); 1267552f7358SJed Brown } 1268552f7358SJed Brown PetscFunctionReturn(0); 1269552f7358SJed Brown } 1270552f7358SJed Brown 1271552f7358SJed Brown #undef __FUNCT__ 1272552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1273552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1274552f7358SJed Brown { 1275552f7358SJed Brown PetscErrorCode ierr; 1276552f7358SJed Brown 1277552f7358SJed Brown PetscFunctionBegin; 12784d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 12794d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1280552f7358SJed Brown PetscFunctionReturn(0); 1281552f7358SJed Brown } 1282552f7358SJed Brown 1283552f7358SJed Brown #undef __FUNCT__ 1284552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1285552f7358SJed Brown /*@ 1286552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1287552f7358SJed Brown 1288552f7358SJed Brown Not collective 1289552f7358SJed Brown 1290552f7358SJed Brown Input Parameter: 1291552f7358SJed Brown . mesh - The DMPlex 1292552f7358SJed Brown 1293552f7358SJed Brown Output Parameter: 1294552f7358SJed Brown 1295552f7358SJed Brown Note: 1296552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1297552f7358SJed Brown 1298552f7358SJed Brown Level: beginner 1299552f7358SJed Brown 1300552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1301552f7358SJed Brown @*/ 1302552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1303552f7358SJed Brown { 1304552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1305552f7358SJed Brown PetscInt *offsets; 1306552f7358SJed Brown PetscInt supportSize; 1307552f7358SJed Brown PetscInt pStart, pEnd, p; 1308552f7358SJed Brown PetscErrorCode ierr; 1309552f7358SJed Brown 1310552f7358SJed Brown PetscFunctionBegin; 1311552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 131282f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1313552f7358SJed Brown /* Calculate support sizes */ 1314552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1315552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1316552f7358SJed Brown PetscInt dof, off, c; 1317552f7358SJed Brown 1318552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1319552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1320552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1321552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1322552f7358SJed Brown } 1323552f7358SJed Brown } 1324552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1325552f7358SJed Brown PetscInt dof; 1326552f7358SJed Brown 1327552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 13280d644c17SKarl Rupp 1329552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1330552f7358SJed Brown } 1331552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1332552f7358SJed Brown /* Calculate supports */ 1333552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 1334552f7358SJed Brown ierr = PetscMalloc(supportSize * sizeof(PetscInt), &mesh->supports);CHKERRQ(ierr); 1335552f7358SJed Brown ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt), &offsets);CHKERRQ(ierr); 1336552f7358SJed Brown ierr = PetscMemzero(offsets, (pEnd - pStart) * sizeof(PetscInt));CHKERRQ(ierr); 1337552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1338552f7358SJed Brown PetscInt dof, off, c; 1339552f7358SJed Brown 1340552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1341552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1342552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1343552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1344552f7358SJed Brown PetscInt offS; 1345552f7358SJed Brown 1346552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 13470d644c17SKarl Rupp 1348552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1349552f7358SJed Brown ++offsets[q]; 1350552f7358SJed Brown } 1351552f7358SJed Brown } 1352552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1353552f7358SJed Brown PetscFunctionReturn(0); 1354552f7358SJed Brown } 1355552f7358SJed Brown 1356552f7358SJed Brown #undef __FUNCT__ 1357552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1358552f7358SJed Brown /*@ 1359552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1360552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1361552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1362552f7358SJed Brown the DAG. 1363552f7358SJed Brown 1364552f7358SJed Brown Not collective 1365552f7358SJed Brown 1366552f7358SJed Brown Input Parameter: 1367552f7358SJed Brown . mesh - The DMPlex 1368552f7358SJed Brown 1369552f7358SJed Brown Output Parameter: 1370552f7358SJed Brown 1371552f7358SJed Brown Notes: 1372552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1373552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1374552f7358SJed Brown 1375552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1376552f7358SJed Brown 1377552f7358SJed Brown Level: beginner 1378552f7358SJed Brown 1379552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1380552f7358SJed Brown @*/ 1381552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1382552f7358SJed Brown { 1383aa50250dSMatthew G. Knepley DMLabel label; 1384552f7358SJed Brown PetscInt pStart, pEnd, p; 1385552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1386552f7358SJed Brown PetscErrorCode ierr; 1387552f7358SJed Brown 1388552f7358SJed Brown PetscFunctionBegin; 1389552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1390552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1391552f7358SJed Brown /* Calculate depth */ 1392aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1393aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1394aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1395552f7358SJed Brown /* Initialize roots and count leaves */ 1396552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1397552f7358SJed Brown PetscInt coneSize, supportSize; 1398552f7358SJed Brown 1399552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1400552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1401552f7358SJed Brown if (!coneSize && supportSize) { 1402552f7358SJed Brown ++numRoots; 1403aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1404552f7358SJed Brown } else if (!supportSize && coneSize) { 1405552f7358SJed Brown ++numLeaves; 1406552f7358SJed Brown } else if (!supportSize && !coneSize) { 1407552f7358SJed Brown /* Isolated points */ 1408aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1409552f7358SJed Brown } 1410552f7358SJed Brown } 1411552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1412552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1413552f7358SJed Brown PetscInt coneSize, supportSize; 1414552f7358SJed Brown 1415552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1416552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1417552f7358SJed Brown if (!supportSize && coneSize) { 1418aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1419552f7358SJed Brown } 1420552f7358SJed Brown } 1421552f7358SJed Brown } else { 142274ef644bSMatthew G. Knepley IS pointIS; 142374ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1424552f7358SJed Brown 142574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 142674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 142774ef644bSMatthew G. Knepley while (numPoints) { 142874ef644bSMatthew G. Knepley const PetscInt *points; 142974ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 143074ef644bSMatthew G. Knepley 143174ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 143274ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 143374ef644bSMatthew G. Knepley const PetscInt point = points[p]; 143474ef644bSMatthew G. Knepley const PetscInt *support; 143574ef644bSMatthew G. Knepley PetscInt supportSize, s; 143674ef644bSMatthew G. Knepley 143774ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 143874ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 143974ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 144074ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1441552f7358SJed Brown } 1442552f7358SJed Brown } 144374ef644bSMatthew G. Knepley ++level; 144474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 144574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 144674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 144774ef644bSMatthew G. Knepley else {numPoints = 0;} 144874ef644bSMatthew G. Knepley } 144974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 145074ef644bSMatthew G. Knepley } 1451552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1452552f7358SJed Brown PetscFunctionReturn(0); 1453552f7358SJed Brown } 1454552f7358SJed Brown 1455552f7358SJed Brown #undef __FUNCT__ 1456552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1457552f7358SJed Brown /*@C 1458552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1459552f7358SJed Brown 1460552f7358SJed Brown Not Collective 1461552f7358SJed Brown 1462552f7358SJed Brown Input Parameters: 1463552f7358SJed Brown + dm - The DMPlex object 1464552f7358SJed Brown . numPoints - The number of input points for the join 1465552f7358SJed Brown - points - The input points 1466552f7358SJed Brown 1467552f7358SJed Brown Output Parameters: 1468552f7358SJed Brown + numCoveredPoints - The number of points in the join 1469552f7358SJed Brown - coveredPoints - The points in the join 1470552f7358SJed Brown 1471552f7358SJed Brown Level: intermediate 1472552f7358SJed Brown 1473552f7358SJed Brown Note: Currently, this is restricted to a single level join 1474552f7358SJed Brown 14753813dfbdSMatthew G Knepley Fortran Notes: 14763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14773813dfbdSMatthew G Knepley include petsc.h90 in your code. 14783813dfbdSMatthew G Knepley 14793813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14803813dfbdSMatthew G Knepley 1481552f7358SJed Brown .keywords: mesh 1482552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1483552f7358SJed Brown @*/ 1484552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1485552f7358SJed Brown { 1486552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1487552f7358SJed Brown PetscInt *join[2]; 1488552f7358SJed Brown PetscInt joinSize, i = 0; 1489552f7358SJed Brown PetscInt dof, off, p, c, m; 1490552f7358SJed Brown PetscErrorCode ierr; 1491552f7358SJed Brown 1492552f7358SJed Brown PetscFunctionBegin; 1493552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1494552f7358SJed Brown PetscValidPointer(points, 2); 1495552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1496552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1497552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1498552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1499552f7358SJed Brown /* Copy in support of first point */ 1500552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1501552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1502552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1503552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1504552f7358SJed Brown } 1505552f7358SJed Brown /* Check each successive support */ 1506552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1507552f7358SJed Brown PetscInt newJoinSize = 0; 1508552f7358SJed Brown 1509552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1510552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1511552f7358SJed Brown for (c = 0; c < dof; ++c) { 1512552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1513552f7358SJed Brown 1514552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1515552f7358SJed Brown if (point == join[i][m]) { 1516552f7358SJed Brown join[1-i][newJoinSize++] = point; 1517552f7358SJed Brown break; 1518552f7358SJed Brown } 1519552f7358SJed Brown } 1520552f7358SJed Brown } 1521552f7358SJed Brown joinSize = newJoinSize; 1522552f7358SJed Brown i = 1-i; 1523552f7358SJed Brown } 1524552f7358SJed Brown *numCoveredPoints = joinSize; 1525552f7358SJed Brown *coveredPoints = join[i]; 1526552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1527552f7358SJed Brown PetscFunctionReturn(0); 1528552f7358SJed Brown } 1529552f7358SJed Brown 1530552f7358SJed Brown #undef __FUNCT__ 1531552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1532552f7358SJed Brown /*@C 1533552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1534552f7358SJed Brown 1535552f7358SJed Brown Not Collective 1536552f7358SJed Brown 1537552f7358SJed Brown Input Parameters: 1538552f7358SJed Brown + dm - The DMPlex object 1539552f7358SJed Brown . numPoints - The number of input points for the join 1540552f7358SJed Brown - points - The input points 1541552f7358SJed Brown 1542552f7358SJed Brown Output Parameters: 1543552f7358SJed Brown + numCoveredPoints - The number of points in the join 1544552f7358SJed Brown - coveredPoints - The points in the join 1545552f7358SJed Brown 15463813dfbdSMatthew G Knepley Fortran Notes: 15473813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 15483813dfbdSMatthew G Knepley include petsc.h90 in your code. 15493813dfbdSMatthew G Knepley 15503813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 15513813dfbdSMatthew G Knepley 1552552f7358SJed Brown Level: intermediate 1553552f7358SJed Brown 1554552f7358SJed Brown .keywords: mesh 1555552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1556552f7358SJed Brown @*/ 1557552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1558552f7358SJed Brown { 1559552f7358SJed Brown PetscErrorCode ierr; 1560552f7358SJed Brown 1561552f7358SJed Brown PetscFunctionBegin; 1562552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1563d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1564d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1565d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1566552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1567d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1568552f7358SJed Brown PetscFunctionReturn(0); 1569552f7358SJed Brown } 1570552f7358SJed Brown 1571552f7358SJed Brown #undef __FUNCT__ 1572552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1573552f7358SJed Brown /*@C 1574552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1575552f7358SJed Brown 1576552f7358SJed Brown Not Collective 1577552f7358SJed Brown 1578552f7358SJed Brown Input Parameters: 1579552f7358SJed Brown + dm - The DMPlex object 1580552f7358SJed Brown . numPoints - The number of input points for the join 1581552f7358SJed Brown - points - The input points 1582552f7358SJed Brown 1583552f7358SJed Brown Output Parameters: 1584552f7358SJed Brown + numCoveredPoints - The number of points in the join 1585552f7358SJed Brown - coveredPoints - The points in the join 1586552f7358SJed Brown 15873813dfbdSMatthew G Knepley Fortran Notes: 15883813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 15893813dfbdSMatthew G Knepley include petsc.h90 in your code. 15903813dfbdSMatthew G Knepley 15913813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 15923813dfbdSMatthew G Knepley 1593552f7358SJed Brown Level: intermediate 1594552f7358SJed Brown 1595552f7358SJed Brown .keywords: mesh 1596552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1597552f7358SJed Brown @*/ 1598552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1599552f7358SJed Brown { 1600552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1601552f7358SJed Brown PetscInt *offsets, **closures; 1602552f7358SJed Brown PetscInt *join[2]; 1603552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1604552f7358SJed Brown PetscInt p, d, c, m; 1605552f7358SJed Brown PetscErrorCode ierr; 1606552f7358SJed Brown 1607552f7358SJed Brown PetscFunctionBegin; 1608552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1609552f7358SJed Brown PetscValidPointer(points, 2); 1610552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1611552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1612552f7358SJed Brown 1613552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1614552f7358SJed Brown ierr = PetscMalloc(numPoints * sizeof(PetscInt*), &closures);CHKERRQ(ierr); 1615552f7358SJed Brown ierr = PetscMemzero(closures,numPoints*sizeof(PetscInt*));CHKERRQ(ierr); 1616552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1617e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1618552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1619552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1620552f7358SJed Brown 1621552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1622552f7358SJed Brown PetscInt closureSize; 1623552f7358SJed Brown 1624552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 16250d644c17SKarl Rupp 1626552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1627552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1628552f7358SJed Brown PetscInt pStart, pEnd, i; 1629552f7358SJed Brown 1630552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1631552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1632552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1633552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1634552f7358SJed Brown break; 1635552f7358SJed Brown } 1636552f7358SJed Brown } 1637552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1638552f7358SJed Brown } 163982f516ccSBarry 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); 1640552f7358SJed Brown } 1641552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1642552f7358SJed Brown PetscInt dof; 1643552f7358SJed Brown 1644552f7358SJed Brown /* Copy in support of first point */ 1645552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1646552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1647552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1648552f7358SJed Brown } 1649552f7358SJed Brown /* Check each successive cone */ 1650552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1651552f7358SJed Brown PetscInt newJoinSize = 0; 1652552f7358SJed Brown 1653552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1654552f7358SJed Brown for (c = 0; c < dof; ++c) { 1655552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1656552f7358SJed Brown 1657552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1658552f7358SJed Brown if (point == join[i][m]) { 1659552f7358SJed Brown join[1-i][newJoinSize++] = point; 1660552f7358SJed Brown break; 1661552f7358SJed Brown } 1662552f7358SJed Brown } 1663552f7358SJed Brown } 1664552f7358SJed Brown joinSize = newJoinSize; 1665552f7358SJed Brown i = 1-i; 1666552f7358SJed Brown } 1667552f7358SJed Brown if (joinSize) break; 1668552f7358SJed Brown } 1669552f7358SJed Brown *numCoveredPoints = joinSize; 1670552f7358SJed Brown *coveredPoints = join[i]; 1671552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 16720298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1673552f7358SJed Brown } 1674552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1675552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1676552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1677552f7358SJed Brown PetscFunctionReturn(0); 1678552f7358SJed Brown } 1679552f7358SJed Brown 1680552f7358SJed Brown #undef __FUNCT__ 1681552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1682552f7358SJed Brown /*@C 1683552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1684552f7358SJed Brown 1685552f7358SJed Brown Not Collective 1686552f7358SJed Brown 1687552f7358SJed Brown Input Parameters: 1688552f7358SJed Brown + dm - The DMPlex object 1689552f7358SJed Brown . numPoints - The number of input points for the meet 1690552f7358SJed Brown - points - The input points 1691552f7358SJed Brown 1692552f7358SJed Brown Output Parameters: 1693552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1694552f7358SJed Brown - coveredPoints - The points in the meet 1695552f7358SJed Brown 1696552f7358SJed Brown Level: intermediate 1697552f7358SJed Brown 1698552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1699552f7358SJed Brown 17003813dfbdSMatthew G Knepley Fortran Notes: 17013813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17023813dfbdSMatthew G Knepley include petsc.h90 in your code. 17033813dfbdSMatthew G Knepley 17043813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17053813dfbdSMatthew G Knepley 1706552f7358SJed Brown .keywords: mesh 1707552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1708552f7358SJed Brown @*/ 1709552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1710552f7358SJed Brown { 1711552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1712552f7358SJed Brown PetscInt *meet[2]; 1713552f7358SJed Brown PetscInt meetSize, i = 0; 1714552f7358SJed Brown PetscInt dof, off, p, c, m; 1715552f7358SJed Brown PetscErrorCode ierr; 1716552f7358SJed Brown 1717552f7358SJed Brown PetscFunctionBegin; 1718552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1719552f7358SJed Brown PetscValidPointer(points, 2); 1720552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1721552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1722552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1723552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1724552f7358SJed Brown /* Copy in cone of first point */ 1725552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1726552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1727552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1728552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1729552f7358SJed Brown } 1730552f7358SJed Brown /* Check each successive cone */ 1731552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1732552f7358SJed Brown PetscInt newMeetSize = 0; 1733552f7358SJed Brown 1734552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1735552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1736552f7358SJed Brown for (c = 0; c < dof; ++c) { 1737552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1738552f7358SJed Brown 1739552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1740552f7358SJed Brown if (point == meet[i][m]) { 1741552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1742552f7358SJed Brown break; 1743552f7358SJed Brown } 1744552f7358SJed Brown } 1745552f7358SJed Brown } 1746552f7358SJed Brown meetSize = newMeetSize; 1747552f7358SJed Brown i = 1-i; 1748552f7358SJed Brown } 1749552f7358SJed Brown *numCoveringPoints = meetSize; 1750552f7358SJed Brown *coveringPoints = meet[i]; 1751552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 1752552f7358SJed Brown PetscFunctionReturn(0); 1753552f7358SJed Brown } 1754552f7358SJed Brown 1755552f7358SJed Brown #undef __FUNCT__ 1756552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 1757552f7358SJed Brown /*@C 1758552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 1759552f7358SJed Brown 1760552f7358SJed Brown Not Collective 1761552f7358SJed Brown 1762552f7358SJed Brown Input Parameters: 1763552f7358SJed Brown + dm - The DMPlex object 1764552f7358SJed Brown . numPoints - The number of input points for the meet 1765552f7358SJed Brown - points - The input points 1766552f7358SJed Brown 1767552f7358SJed Brown Output Parameters: 1768552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1769552f7358SJed Brown - coveredPoints - The points in the meet 1770552f7358SJed Brown 1771552f7358SJed Brown Level: intermediate 1772552f7358SJed Brown 17733813dfbdSMatthew G Knepley Fortran Notes: 17743813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17753813dfbdSMatthew G Knepley include petsc.h90 in your code. 17763813dfbdSMatthew G Knepley 17773813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17783813dfbdSMatthew G Knepley 1779552f7358SJed Brown .keywords: mesh 1780552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 1781552f7358SJed Brown @*/ 1782552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1783552f7358SJed Brown { 1784552f7358SJed Brown PetscErrorCode ierr; 1785552f7358SJed Brown 1786552f7358SJed Brown PetscFunctionBegin; 1787552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1788d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1789d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1790d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 1791552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1792d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1793552f7358SJed Brown PetscFunctionReturn(0); 1794552f7358SJed Brown } 1795552f7358SJed Brown 1796552f7358SJed Brown #undef __FUNCT__ 1797552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 1798552f7358SJed Brown /*@C 1799552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 1800552f7358SJed Brown 1801552f7358SJed Brown Not Collective 1802552f7358SJed Brown 1803552f7358SJed Brown Input Parameters: 1804552f7358SJed Brown + dm - The DMPlex object 1805552f7358SJed Brown . numPoints - The number of input points for the meet 1806552f7358SJed Brown - points - The input points 1807552f7358SJed Brown 1808552f7358SJed Brown Output Parameters: 1809552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1810552f7358SJed Brown - coveredPoints - The points in the meet 1811552f7358SJed Brown 1812552f7358SJed Brown Level: intermediate 1813552f7358SJed Brown 18143813dfbdSMatthew G Knepley Fortran Notes: 18153813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18163813dfbdSMatthew G Knepley include petsc.h90 in your code. 18173813dfbdSMatthew G Knepley 18183813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18193813dfbdSMatthew G Knepley 1820552f7358SJed Brown .keywords: mesh 1821552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 1822552f7358SJed Brown @*/ 1823552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1824552f7358SJed Brown { 1825552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1826552f7358SJed Brown PetscInt *offsets, **closures; 1827552f7358SJed Brown PetscInt *meet[2]; 1828552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 1829552f7358SJed Brown PetscInt p, h, c, m; 1830552f7358SJed Brown PetscErrorCode ierr; 1831552f7358SJed Brown 1832552f7358SJed Brown PetscFunctionBegin; 1833552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1834552f7358SJed Brown PetscValidPointer(points, 2); 1835552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1836552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1837552f7358SJed Brown 1838552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 1839552f7358SJed Brown ierr = PetscMalloc(numPoints * sizeof(PetscInt*), &closures);CHKERRQ(ierr); 1840552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1841e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 1842552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1843552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1844552f7358SJed Brown 1845552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1846552f7358SJed Brown PetscInt closureSize; 1847552f7358SJed Brown 1848552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 18490d644c17SKarl Rupp 1850552f7358SJed Brown offsets[p*(height+2)+0] = 0; 1851552f7358SJed Brown for (h = 0; h < height+1; ++h) { 1852552f7358SJed Brown PetscInt pStart, pEnd, i; 1853552f7358SJed Brown 1854552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 1855552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 1856552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1857552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 1858552f7358SJed Brown break; 1859552f7358SJed Brown } 1860552f7358SJed Brown } 1861552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 1862552f7358SJed Brown } 186382f516ccSBarry 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); 1864552f7358SJed Brown } 1865552f7358SJed Brown for (h = 0; h < height+1; ++h) { 1866552f7358SJed Brown PetscInt dof; 1867552f7358SJed Brown 1868552f7358SJed Brown /* Copy in cone of first point */ 1869552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 1870552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1871552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 1872552f7358SJed Brown } 1873552f7358SJed Brown /* Check each successive cone */ 1874552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 1875552f7358SJed Brown PetscInt newMeetSize = 0; 1876552f7358SJed Brown 1877552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 1878552f7358SJed Brown for (c = 0; c < dof; ++c) { 1879552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 1880552f7358SJed Brown 1881552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1882552f7358SJed Brown if (point == meet[i][m]) { 1883552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1884552f7358SJed Brown break; 1885552f7358SJed Brown } 1886552f7358SJed Brown } 1887552f7358SJed Brown } 1888552f7358SJed Brown meetSize = newMeetSize; 1889552f7358SJed Brown i = 1-i; 1890552f7358SJed Brown } 1891552f7358SJed Brown if (meetSize) break; 1892552f7358SJed Brown } 1893552f7358SJed Brown *numCoveredPoints = meetSize; 1894552f7358SJed Brown *coveredPoints = meet[i]; 1895552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 18960298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 1897552f7358SJed Brown } 1898552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1899552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1900552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 1901552f7358SJed Brown PetscFunctionReturn(0); 1902552f7358SJed Brown } 1903552f7358SJed Brown 1904552f7358SJed Brown #undef __FUNCT__ 19054e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 19064e3744c5SMatthew G. Knepley /*@C 19074e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 19084e3744c5SMatthew G. Knepley 19094e3744c5SMatthew G. Knepley Not Collective 19104e3744c5SMatthew G. Knepley 19114e3744c5SMatthew G. Knepley Input Parameters: 19124e3744c5SMatthew G. Knepley + dmA - A DMPlex object 19134e3744c5SMatthew G. Knepley - dmB - A DMPlex object 19144e3744c5SMatthew G. Knepley 19154e3744c5SMatthew G. Knepley Output Parameters: 19164e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 19174e3744c5SMatthew G. Knepley 19184e3744c5SMatthew G. Knepley Level: intermediate 19194e3744c5SMatthew G. Knepley 19204e3744c5SMatthew G. Knepley Notes: 19214e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 19224e3744c5SMatthew G. Knepley 19234e3744c5SMatthew G. Knepley .keywords: mesh 19244e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 19254e3744c5SMatthew G. Knepley @*/ 19264e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 19274e3744c5SMatthew G. Knepley { 19284e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 19294e3744c5SMatthew G. Knepley PetscErrorCode ierr; 19304e3744c5SMatthew G. Knepley 19314e3744c5SMatthew G. Knepley PetscFunctionBegin; 19324e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 19334e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 19344e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 19354e3744c5SMatthew G. Knepley 19364e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 19374e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 19384e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 19394e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 19404e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 19414e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 19424e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 19434e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 19444e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 19454e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 19464e3744c5SMatthew G. Knepley 19474e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 19484e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 19494e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 19504e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 19514e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 19524e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 19534e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 19544e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 19554e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 19564e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 19574e3744c5SMatthew G. Knepley } 19584e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 19594e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 19604e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 19614e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 19624e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 19634e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 19644e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 19654e3744c5SMatthew G. Knepley } 19664e3744c5SMatthew G. Knepley } 19674e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 19684e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 19694e3744c5SMatthew G. Knepley } 19704e3744c5SMatthew G. Knepley 19714e3744c5SMatthew G. Knepley #undef __FUNCT__ 197218ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 197318ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 1974a6dfd86eSKarl Rupp { 197582f516ccSBarry Smith MPI_Comm comm; 1976552f7358SJed Brown PetscErrorCode ierr; 1977552f7358SJed Brown 1978552f7358SJed Brown PetscFunctionBegin; 197982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 1980552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 1981552f7358SJed Brown switch (cellDim) { 1982552f7358SJed Brown case 0: 1983552f7358SJed Brown *numFaceVertices = 0; 1984552f7358SJed Brown break; 1985552f7358SJed Brown case 1: 1986552f7358SJed Brown *numFaceVertices = 1; 1987552f7358SJed Brown break; 1988552f7358SJed Brown case 2: 1989552f7358SJed Brown switch (numCorners) { 199019436ca2SJed Brown case 3: /* triangle */ 199119436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 1992552f7358SJed Brown break; 199319436ca2SJed Brown case 4: /* quadrilateral */ 199419436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 1995552f7358SJed Brown break; 199619436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 199719436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 1998552f7358SJed Brown break; 199919436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 200019436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2001552f7358SJed Brown break; 2002552f7358SJed Brown default: 2003552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2004552f7358SJed Brown } 2005552f7358SJed Brown break; 2006552f7358SJed Brown case 3: 2007552f7358SJed Brown switch (numCorners) { 200819436ca2SJed Brown case 4: /* tetradehdron */ 200919436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2010552f7358SJed Brown break; 201119436ca2SJed Brown case 6: /* tet cohesive cells */ 201219436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2013552f7358SJed Brown break; 201419436ca2SJed Brown case 8: /* hexahedron */ 201519436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2016552f7358SJed Brown break; 201719436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 201819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2019552f7358SJed Brown break; 202019436ca2SJed Brown case 10: /* quadratic tetrahedron */ 202119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2022552f7358SJed Brown break; 202319436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 202419436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2025552f7358SJed Brown break; 202619436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 202719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2028552f7358SJed Brown break; 202919436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 203019436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2031552f7358SJed Brown break; 2032552f7358SJed Brown default: 2033552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2034552f7358SJed Brown } 2035552f7358SJed Brown break; 2036552f7358SJed Brown default: 2037552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2038552f7358SJed Brown } 2039552f7358SJed Brown PetscFunctionReturn(0); 2040552f7358SJed Brown } 2041552f7358SJed Brown 2042552f7358SJed Brown #undef __FUNCT__ 2043d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2044d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2045d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2046d27a0f52SMatthew G. Knepley { 2047a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2048a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2049a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2050d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2051d27a0f52SMatthew G. Knepley 2052d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2053d27a0f52SMatthew G. Knepley /* Truth Table 2054d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2055d27a0f52SMatthew G. Knepley F 0 flips no F F F 2056d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2057d27a0f52SMatthew G. Knepley F 2 flips no T F T 2058d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2059d27a0f52SMatthew G. Knepley T 1 flip no 2060d27a0f52SMatthew G. Knepley T 2 flips yes 2061d27a0f52SMatthew G. Knepley */ 2062a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2063d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2064a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2065d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2066a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2067a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2068a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2069a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2070a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2071a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2072a1b4d4a2SMatthew G. Knepley ierr = PetscMalloc((fEnd - fStart) * sizeof(PetscInt), &faceFIFO);CHKERRQ(ierr); 2073a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2074a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2075defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2076a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2077a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2078a1b4d4a2SMatthew G. Knepley 2079a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2080a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2081a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2082a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2083a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2084a1b4d4a2SMatthew G. Knepley } 2085a1b4d4a2SMatthew G. Knepley } 2086a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2087a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2088d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2089a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2090d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2091d27a0f52SMatthew G. Knepley 2092a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2093a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2094a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2095d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2096d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2097a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 209886cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2099a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 210086cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2101d27a0f52SMatthew G. Knepley 2102d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2103d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2104d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2105d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2106d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2107d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2108a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2109a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2110a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2111a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2112a1b4d4a2SMatthew G. Knepley } 2113a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2114a1b4d4a2SMatthew 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); 2115a1b4d4a2SMatthew G. Knepley } 2116a1b4d4a2SMatthew 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]); 2117a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2118a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2119a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2120a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2121a1b4d4a2SMatthew G. Knepley } 2122a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2123a1b4d4a2SMatthew 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); 2124a1b4d4a2SMatthew G. Knepley } 2125a1b4d4a2SMatthew 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]); 2126d27a0f52SMatthew G. Knepley 2127d27a0f52SMatthew G. Knepley if (dim == 1) { 2128d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2129d27a0f52SMatthew G. Knepley } else { 2130d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2131d27a0f52SMatthew G. Knepley } 2132d27a0f52SMatthew G. Knepley 2133d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2134d27a0f52SMatthew 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]); 2135d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2136a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2137d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2138a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2139d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 214086cff514SMatthew 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"); 2141a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2142a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2143d27a0f52SMatthew G. Knepley } 2144a1b4d4a2SMatthew G. Knepley 2145d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2146d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2147d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2148a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2149f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2150f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2151d27a0f52SMatthew G. Knepley 2152a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2153a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2154a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2155a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2156a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2157a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2158a1b4d4a2SMatthew G. Knepley 2159a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2160a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2161a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2162d27a0f52SMatthew G. Knepley } 2163a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2164a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2165f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2166f4e909fcSMatthew G. Knepley faceSize = coneSize; 2167f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2168f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2169f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2170f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2171f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2172f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2173f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2174f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2175f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2176f4e909fcSMatthew G. Knepley } 2177f4e909fcSMatthew G. Knepley } 2178d27a0f52SMatthew G. Knepley } 2179d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2180d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2181d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2182a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2183a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2184a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2185d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2186d27a0f52SMatthew G. Knepley } 2187d27a0f52SMatthew G. Knepley 2188d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2189cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal" 2190cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[]) 2191cb1e1211SMatthew G Knepley { 2192cb1e1211SMatthew G Knepley const PetscInt *support = NULL; 2193cb1e1211SMatthew G Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, supportSize, s; 2194cb1e1211SMatthew G Knepley PetscErrorCode ierr; 2195cb1e1211SMatthew G Knepley 2196cb1e1211SMatthew G Knepley PetscFunctionBegin; 2197cb1e1211SMatthew G Knepley if (useClosure) { 2198cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr); 2199cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr); 2200cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2201cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2202cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2203cb1e1211SMatthew G Knepley 2204cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2205cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr); 2206cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2207cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2208cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2209cb1e1211SMatthew G Knepley } 2210cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2211cb1e1211SMatthew G Knepley } 2212cb1e1211SMatthew G Knepley } 2213cb1e1211SMatthew G Knepley } else { 2214cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 2215cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 2216cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2217cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2218cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2219cb1e1211SMatthew G Knepley 2220cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2221cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2222cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2223cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2224cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2225cb1e1211SMatthew G Knepley } 2226cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2227cb1e1211SMatthew G Knepley } 2228cb1e1211SMatthew G Knepley } 2229cb1e1211SMatthew G Knepley } 2230cb1e1211SMatthew G Knepley *adjSize = numAdj; 2231cb1e1211SMatthew G Knepley PetscFunctionReturn(0); 2232cb1e1211SMatthew G Knepley } 2233cb1e1211SMatthew G Knepley 2234cb1e1211SMatthew G Knepley #undef __FUNCT__ 2235552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR" 223677c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency) 22370adebc6cSBarry Smith { 2238552f7358SJed Brown const PetscInt maxFaceCases = 30; 2239552f7358SJed Brown PetscInt numFaceCases = 0; 2240552f7358SJed Brown PetscInt numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */ 2241552f7358SJed Brown PetscInt *off, *adj; 2242552f7358SJed Brown PetscInt *neighborCells, *tmpClosure; 2243552f7358SJed Brown PetscInt maxConeSize, maxSupportSize, maxClosure, maxNeighbors; 224477c88f5bSMatthew G Knepley PetscInt dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell; 2245552f7358SJed Brown PetscErrorCode ierr; 2246552f7358SJed Brown 2247552f7358SJed Brown PetscFunctionBegin; 2248552f7358SJed Brown /* For parallel partitioning, I think you have to communicate supports */ 2249552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 225077c88f5bSMatthew G Knepley cellDim = dim - cellHeight; 2251552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 225277c88f5bSMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 2253552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 2254552f7358SJed Brown if (cEnd - cStart == 0) { 2255552f7358SJed Brown if (numVertices) *numVertices = 0; 22560298fd71SBarry Smith if (offsets) *offsets = NULL; 22570298fd71SBarry Smith if (adjacency) *adjacency = NULL; 2258552f7358SJed Brown PetscFunctionReturn(0); 2259552f7358SJed Brown } 2260552f7358SJed Brown numCells = cEnd - cStart; 226177c88f5bSMatthew G Knepley faceDepth = depth - cellHeight; 2262552f7358SJed Brown /* Setup face recognition */ 226377c88f5bSMatthew G Knepley if (faceDepth == 1) { 2264552f7358SJed 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 */ 2265552f7358SJed Brown 2266552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2267552f7358SJed Brown PetscInt corners; 2268552f7358SJed Brown 2269552f7358SJed Brown ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr); 2270552f7358SJed Brown if (!cornersSeen[corners]) { 2271552f7358SJed Brown PetscInt nFV; 2272552f7358SJed Brown 227382f516ccSBarry Smith if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases"); 2274552f7358SJed Brown cornersSeen[corners] = 1; 22750d644c17SKarl Rupp 227618ad9376SMatthew G. Knepley ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr); 22770d644c17SKarl Rupp 2278552f7358SJed Brown numFaceVertices[numFaceCases++] = nFV; 2279552f7358SJed Brown } 2280552f7358SJed Brown } 2281552f7358SJed Brown } 2282e7b80042SMatthew G. Knepley maxClosure = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1)); 2283e7b80042SMatthew G. Knepley maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1); 2284552f7358SJed Brown ierr = PetscMalloc2(maxNeighbors,PetscInt,&neighborCells,maxClosure,PetscInt,&tmpClosure);CHKERRQ(ierr); 2285552f7358SJed Brown ierr = PetscMalloc((numCells+1) * sizeof(PetscInt), &off);CHKERRQ(ierr); 2286552f7358SJed Brown ierr = PetscMemzero(off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr); 2287552f7358SJed Brown /* Count neighboring cells */ 2288552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2289552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2290552f7358SJed Brown 2291cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2292552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2293552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 22944d25b1e8SKarl Rupp PetscInt cellPair[2]; 229577c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2296552f7358SJed Brown PetscInt meetSize = 0; 22970298fd71SBarry Smith const PetscInt *meet = NULL; 2298552f7358SJed Brown 22994d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2300552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2301552f7358SJed Brown if (!found) { 2302552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2303552f7358SJed Brown if (meetSize) { 2304552f7358SJed Brown PetscInt f; 2305552f7358SJed Brown 2306552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2307552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2308552f7358SJed Brown found = PETSC_TRUE; 2309552f7358SJed Brown break; 2310552f7358SJed Brown } 2311552f7358SJed Brown } 2312552f7358SJed Brown } 2313552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2314552f7358SJed Brown } 23150d644c17SKarl Rupp if (found) ++off[cell-cStart+1]; 2316552f7358SJed Brown } 2317552f7358SJed Brown } 2318552f7358SJed Brown /* Prefix sum */ 23190d644c17SKarl Rupp for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1]; 23200d644c17SKarl Rupp 2321552f7358SJed Brown if (adjacency) { 2322552f7358SJed Brown ierr = PetscMalloc(off[numCells] * sizeof(PetscInt), &adj);CHKERRQ(ierr); 2323552f7358SJed Brown /* Get neighboring cells */ 2324552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2325552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2326552f7358SJed Brown PetscInt cellOffset = 0; 2327552f7358SJed Brown 2328cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2329552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2330552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 23314d25b1e8SKarl Rupp PetscInt cellPair[2]; 233277c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2333552f7358SJed Brown PetscInt meetSize = 0; 23340298fd71SBarry Smith const PetscInt *meet = NULL; 2335552f7358SJed Brown 23364d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2337552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2338552f7358SJed Brown if (!found) { 2339552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2340552f7358SJed Brown if (meetSize) { 2341552f7358SJed Brown PetscInt f; 2342552f7358SJed Brown 2343552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2344552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2345552f7358SJed Brown found = PETSC_TRUE; 2346552f7358SJed Brown break; 2347552f7358SJed Brown } 2348552f7358SJed Brown } 2349552f7358SJed Brown } 2350552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2351552f7358SJed Brown } 2352552f7358SJed Brown if (found) { 2353552f7358SJed Brown adj[off[cell-cStart]+cellOffset] = neighborCells[n]; 2354552f7358SJed Brown ++cellOffset; 2355552f7358SJed Brown } 2356552f7358SJed Brown } 2357552f7358SJed Brown } 2358552f7358SJed Brown } 2359552f7358SJed Brown ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr); 2360552f7358SJed Brown if (numVertices) *numVertices = numCells; 2361552f7358SJed Brown if (offsets) *offsets = off; 2362552f7358SJed Brown if (adjacency) *adjacency = adj; 2363552f7358SJed Brown PetscFunctionReturn(0); 2364552f7358SJed Brown } 2365552f7358SJed Brown 2366519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2367519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2368552f7358SJed Brown #include <unistd.h> 2369552f7358SJed Brown #endif 2370552f7358SJed Brown /* Chaco does not have an include file */ 237139d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts, 2372552f7358SJed Brown float *ewgts, float *x, float *y, float *z, char *outassignname, 2373552f7358SJed Brown char *outfilename, short *assignment, int architecture, int ndims_tot, 2374552f7358SJed Brown int mesh_dims[3], double *goal, int global_method, int local_method, 2375552f7358SJed Brown int rqi_flag, int vmax, int ndims, double eigtol, long seed); 2376552f7358SJed Brown 2377552f7358SJed Brown extern int FREE_GRAPH; 2378552f7358SJed Brown 2379552f7358SJed Brown #undef __FUNCT__ 2380552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco" 2381552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2382552f7358SJed Brown { 2383552f7358SJed Brown enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3}; 238482f516ccSBarry Smith MPI_Comm comm; 2385552f7358SJed Brown int nvtxs = numVertices; /* number of vertices in full graph */ 2386552f7358SJed Brown int *vwgts = NULL; /* weights for all vertices */ 2387552f7358SJed Brown float *ewgts = NULL; /* weights for all edges */ 2388552f7358SJed Brown float *x = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */ 2389552f7358SJed Brown char *outassignname = NULL; /* name of assignment output file */ 2390552f7358SJed Brown char *outfilename = NULL; /* output file name */ 2391552f7358SJed Brown int architecture = 1; /* 0 => hypercube, d => d-dimensional mesh */ 2392552f7358SJed Brown int ndims_tot = 0; /* total number of cube dimensions to divide */ 2393552f7358SJed Brown int mesh_dims[3]; /* dimensions of mesh of processors */ 2394552f7358SJed Brown double *goal = NULL; /* desired set sizes for each set */ 2395552f7358SJed Brown int global_method = 1; /* global partitioning algorithm */ 2396552f7358SJed Brown int local_method = 1; /* local partitioning algorithm */ 2397552f7358SJed Brown int rqi_flag = 0; /* should I use RQI/Symmlq eigensolver? */ 2398552f7358SJed Brown int vmax = 200; /* how many vertices to coarsen down to? */ 2399552f7358SJed Brown int ndims = 1; /* number of eigenvectors (2^d sets) */ 2400552f7358SJed Brown double eigtol = 0.001; /* tolerance on eigenvectors */ 2401552f7358SJed Brown long seed = 123636512; /* for random graph mutations */ 2402552f7358SJed Brown short int *assignment; /* Output partition */ 2403552f7358SJed Brown int fd_stdout, fd_pipe[2]; 2404552f7358SJed Brown PetscInt *points; 2405552f7358SJed Brown PetscMPIInt commSize; 2406552f7358SJed Brown int i, v, p; 2407552f7358SJed Brown PetscErrorCode ierr; 2408552f7358SJed Brown 2409552f7358SJed Brown PetscFunctionBegin; 241082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2411552f7358SJed Brown ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 2412552f7358SJed Brown if (!numVertices) { 2413552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2414552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2415552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 24160298fd71SBarry Smith ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2417552f7358SJed Brown PetscFunctionReturn(0); 2418552f7358SJed Brown } 2419552f7358SJed Brown FREE_GRAPH = 0; /* Do not let Chaco free my memory */ 24200d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) ++adjacency[i]; 24210d644c17SKarl Rupp 2422552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2423552f7358SJed Brown /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */ 2424552f7358SJed Brown SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported"); 2425552f7358SJed Brown } 2426552f7358SJed Brown mesh_dims[0] = commSize; 2427552f7358SJed Brown mesh_dims[1] = 1; 2428552f7358SJed Brown mesh_dims[2] = 1; 2429552f7358SJed Brown ierr = PetscMalloc(nvtxs * sizeof(short int), &assignment);CHKERRQ(ierr); 2430552f7358SJed Brown /* Chaco outputs to stdout. We redirect this to a buffer. */ 2431552f7358SJed Brown /* TODO: check error codes for UNIX calls */ 2432519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2433552f7358SJed Brown { 24347995c745SJed Brown int piperet; 24357995c745SJed Brown piperet = pipe(fd_pipe); 24367995c745SJed Brown if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe"); 2437552f7358SJed Brown fd_stdout = dup(1); 2438552f7358SJed Brown close(1); 2439552f7358SJed Brown dup2(fd_pipe[1], 1); 2440552f7358SJed Brown } 2441552f7358SJed Brown #endif 2442552f7358SJed Brown ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename, 2443552f7358SJed Brown assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag, 2444552f7358SJed Brown vmax, ndims, eigtol, seed); 2445519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2446552f7358SJed Brown { 2447552f7358SJed Brown char msgLog[10000]; 2448552f7358SJed Brown int count; 2449552f7358SJed Brown 2450552f7358SJed Brown fflush(stdout); 2451552f7358SJed Brown count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char)); 2452552f7358SJed Brown if (count < 0) count = 0; 2453552f7358SJed Brown msgLog[count] = 0; 2454552f7358SJed Brown close(1); 2455552f7358SJed Brown dup2(fd_stdout, 1); 2456552f7358SJed Brown close(fd_stdout); 2457552f7358SJed Brown close(fd_pipe[0]); 2458552f7358SJed Brown close(fd_pipe[1]); 2459552f7358SJed Brown if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog); 2460552f7358SJed Brown } 2461552f7358SJed Brown #endif 2462552f7358SJed Brown /* Convert to PetscSection+IS */ 2463552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2464552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2465552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2466552f7358SJed Brown ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 2467552f7358SJed Brown } 2468552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2469552f7358SJed Brown ierr = PetscMalloc(nvtxs * sizeof(PetscInt), &points);CHKERRQ(ierr); 2470552f7358SJed Brown for (p = 0, i = 0; p < commSize; ++p) { 2471552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2472552f7358SJed Brown if (assignment[v] == p) points[i++] = v; 2473552f7358SJed Brown } 2474552f7358SJed Brown } 2475552f7358SJed Brown if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 2476552f7358SJed Brown ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2477552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2478552f7358SJed Brown /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */ 2479552f7358SJed Brown } 2480552f7358SJed Brown ierr = PetscFree(assignment);CHKERRQ(ierr); 24810d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) --adjacency[i]; 2482552f7358SJed Brown PetscFunctionReturn(0); 2483552f7358SJed Brown } 2484552f7358SJed Brown #endif 2485552f7358SJed Brown 2486519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 248725cda350SMatthew G. Knepley #include <parmetis.h> 248825cda350SMatthew G. Knepley 2489552f7358SJed Brown #undef __FUNCT__ 2490552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis" 2491552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2492552f7358SJed Brown { 249325cda350SMatthew G. Knepley MPI_Comm comm; 249425cda350SMatthew G. Knepley PetscInt nvtxs = numVertices; // The number of vertices in full graph 249525cda350SMatthew G. Knepley PetscInt *vtxdist; // Distribution of vertices across processes 249625cda350SMatthew G. Knepley PetscInt *xadj = start; // Start of edge list for each vertex 249725cda350SMatthew G. Knepley PetscInt *adjncy = adjacency; // Edge lists for all vertices 249825cda350SMatthew G. Knepley PetscInt *vwgt = NULL; // Vertex weights 249925cda350SMatthew G. Knepley PetscInt *adjwgt = NULL; // Edge weights 250025cda350SMatthew G. Knepley PetscInt wgtflag = 0; // Indicates which weights are present 250125cda350SMatthew G. Knepley PetscInt numflag = 0; // Indicates initial offset (0 or 1) 250225cda350SMatthew G. Knepley PetscInt ncon = 1; // The number of weights per vertex 250325cda350SMatthew G. Knepley PetscInt nparts; // The number of partitions 250425cda350SMatthew G. Knepley PetscReal *tpwgts; // The fraction of vertex weights assigned to each partition 250525cda350SMatthew G. Knepley PetscReal *ubvec; // The balance intolerance for vertex weights 250625cda350SMatthew G. Knepley PetscInt options[5]; // Options 250725cda350SMatthew G. Knepley // Outputs 250825cda350SMatthew G. Knepley PetscInt edgeCut; // The number of edges cut by the partition 250925cda350SMatthew G. Knepley PetscInt *assignment, *points; 251025cda350SMatthew G. Knepley PetscMPIInt commSize, rank, p, v, i; 251125cda350SMatthew G. Knepley PetscErrorCode ierr; 251225cda350SMatthew G. Knepley 2513552f7358SJed Brown PetscFunctionBegin; 251425cda350SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr); 251525cda350SMatthew G. Knepley ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 251625cda350SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 251725cda350SMatthew G. Knepley nparts = commSize; 251825cda350SMatthew G. Knepley options[0] = 0; /* Use all defaults */ 251925cda350SMatthew G. Knepley /* Calculate vertex distribution */ 252025cda350SMatthew G. Knepley ierr = PetscMalloc4(nparts+1,PetscInt,&vtxdist,nparts*ncon,PetscReal,&tpwgts,ncon,PetscReal,&ubvec,nvtxs,PetscInt,&assignment);CHKERRQ(ierr); 252125cda350SMatthew G. Knepley vtxdist[0] = 0; 252225cda350SMatthew G. Knepley ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr); 252325cda350SMatthew G. Knepley for (p = 2; p <= nparts; ++p) { 252425cda350SMatthew G. Knepley vtxdist[p] += vtxdist[p-1]; 252525cda350SMatthew G. Knepley } 252625cda350SMatthew G. Knepley /* Calculate weights */ 252725cda350SMatthew G. Knepley for (p = 0; p < nparts; ++p) { 252825cda350SMatthew G. Knepley tpwgts[p] = 1.0/nparts; 252925cda350SMatthew G. Knepley } 253025cda350SMatthew G. Knepley ubvec[0] = 1.05; 253125cda350SMatthew G. Knepley 253225cda350SMatthew G. Knepley if (nparts == 1) { 253325cda350SMatthew G. Knepley ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt)); 253425cda350SMatthew G. Knepley } else { 253525cda350SMatthew G. Knepley if (vtxdist[1] == vtxdist[nparts]) { 253625cda350SMatthew G. Knepley if (!rank) { 2537e7ee2502SMatthew G. Knepley PetscStackPush("METIS_PartGraphKway"); 2538e7ee2502SMatthew G. Knepley ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment); 2539e7ee2502SMatthew G. Knepley PetscStackPop; 2540e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()"); 254125cda350SMatthew G. Knepley } 254225cda350SMatthew G. Knepley } else { 2543e7ee2502SMatthew G. Knepley PetscStackPush("ParMETIS_V3_PartKway"); 2544e7ee2502SMatthew G. Knepley ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm); 2545e7ee2502SMatthew G. Knepley PetscStackPop; 2546e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()"); 254725cda350SMatthew G. Knepley } 254825cda350SMatthew G. Knepley } 254925cda350SMatthew G. Knepley /* Convert to PetscSection+IS */ 255025cda350SMatthew G. Knepley ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 255125cda350SMatthew G. Knepley ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 255225cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 255325cda350SMatthew G. Knepley ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 255425cda350SMatthew G. Knepley } 255525cda350SMatthew G. Knepley ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 255625cda350SMatthew G. Knepley ierr = PetscMalloc(nvtxs * sizeof(PetscInt), &points);CHKERRQ(ierr); 255725cda350SMatthew G. Knepley for (p = 0, i = 0; p < commSize; ++p) { 255825cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 255925cda350SMatthew G. Knepley if (assignment[v] == p) points[i++] = v; 256025cda350SMatthew G. Knepley } 256125cda350SMatthew G. Knepley } 256225cda350SMatthew G. Knepley if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 256325cda350SMatthew G. Knepley ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 256425cda350SMatthew G. Knepley ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr); 2565552f7358SJed Brown PetscFunctionReturn(0); 2566552f7358SJed Brown } 2567552f7358SJed Brown #endif 2568552f7358SJed Brown 2569552f7358SJed Brown #undef __FUNCT__ 2570552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition" 2571552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */ 2572a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition) 2573a6dfd86eSKarl Rupp { 2574552f7358SJed Brown PetscHashI h; 2575552f7358SJed Brown const PetscInt *points; 2576552f7358SJed Brown PetscInt **tmpPoints, *newPoints, totPoints = 0; 2577552f7358SJed Brown PetscInt pStart, pEnd, part, q; 2578552f7358SJed Brown PetscErrorCode ierr; 2579552f7358SJed Brown 2580552f7358SJed Brown PetscFunctionBegin; 2581552f7358SJed Brown PetscHashICreate(h); 258282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2583552f7358SJed Brown ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr); 2584552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr); 2585552f7358SJed Brown ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr); 2586552f7358SJed Brown ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt*), &tmpPoints);CHKERRQ(ierr); 2587552f7358SJed Brown for (part = pStart; part < pEnd; ++part) { 2588552f7358SJed Brown PetscInt numPoints, nP, numNewPoints, off, p, n = 0; 2589552f7358SJed Brown 2590552f7358SJed Brown PetscHashIClear(h); 2591552f7358SJed Brown ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr); 2592552f7358SJed Brown ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr); 2593552f7358SJed Brown /* Add all existing points to h */ 2594552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2595552f7358SJed Brown const PetscInt point = points[off+p]; 2596552f7358SJed Brown PetscHashIAdd(h, point, 1); 2597552f7358SJed Brown } 2598552f7358SJed Brown PetscHashISize(h, nP); 259982f516ccSBarry Smith if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP); 2600552f7358SJed Brown /* Add all points in next BFS level */ 2601552f7358SJed Brown /* TODO We are brute forcing here, but could check the adjacency size to find the boundary */ 2602552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2603552f7358SJed Brown const PetscInt point = points[off+p]; 2604552f7358SJed Brown PetscInt s = start[point], e = start[point+1], a; 2605552f7358SJed Brown 26060d644c17SKarl Rupp for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1); 2607552f7358SJed Brown } 2608552f7358SJed Brown PetscHashISize(h, numNewPoints); 2609552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr); 2610552f7358SJed Brown ierr = PetscMalloc(numNewPoints * sizeof(PetscInt), &tmpPoints[part]);CHKERRQ(ierr); 26110d644c17SKarl Rupp if (numNewPoints) PetscHashIGetKeys(h, n, tmpPoints[part]); /* Should not need this conditional */ 2612552f7358SJed Brown totPoints += numNewPoints; 2613552f7358SJed Brown } 2614552f7358SJed Brown ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr); 2615552f7358SJed Brown PetscHashIDestroy(h); 2616552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2617552f7358SJed Brown ierr = PetscMalloc(totPoints * sizeof(PetscInt), &newPoints);CHKERRQ(ierr); 2618552f7358SJed Brown for (part = pStart, q = 0; part < pEnd; ++part) { 2619552f7358SJed Brown PetscInt numPoints, p; 2620552f7358SJed Brown 2621552f7358SJed Brown ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr); 26220d644c17SKarl Rupp for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p]; 2623552f7358SJed Brown ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr); 2624552f7358SJed Brown } 2625552f7358SJed Brown ierr = PetscFree(tmpPoints);CHKERRQ(ierr); 262682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2627552f7358SJed Brown PetscFunctionReturn(0); 2628552f7358SJed Brown } 2629552f7358SJed Brown 2630552f7358SJed Brown #undef __FUNCT__ 2631552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition" 2632552f7358SJed Brown /* 2633552f7358SJed Brown DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height 2634552f7358SJed Brown 2635552f7358SJed Brown Collective on DM 2636552f7358SJed Brown 2637552f7358SJed Brown Input Parameters: 2638552f7358SJed Brown + dm - The DM 2639552f7358SJed Brown . height - The height for points in the partition 2640552f7358SJed Brown - enlarge - Expand each partition with neighbors 2641552f7358SJed Brown 2642552f7358SJed Brown Output Parameters: 2643552f7358SJed Brown + partSection - The PetscSection giving the division of points by partition 2644552f7358SJed Brown . partition - The list of points by partition 26450298fd71SBarry Smith . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL 26460298fd71SBarry Smith - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL 2647552f7358SJed Brown 2648552f7358SJed Brown Level: developer 2649552f7358SJed Brown 2650552f7358SJed Brown .seealso DMPlexDistribute() 2651552f7358SJed Brown */ 2652ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition) 26530adebc6cSBarry Smith { 2654ac17c9edSMatthew G. Knepley char partname[1024]; 2655ac17c9edSMatthew G. Knepley PetscBool isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg; 2656552f7358SJed Brown PetscMPIInt size; 2657552f7358SJed Brown PetscErrorCode ierr; 2658552f7358SJed Brown 2659552f7358SJed Brown PetscFunctionBegin; 266082f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 26610d644c17SKarl Rupp 26620298fd71SBarry Smith *origPartSection = NULL; 26630298fd71SBarry Smith *origPartition = NULL; 2664552f7358SJed Brown if (size == 1) { 2665552f7358SJed Brown PetscInt *points; 2666552f7358SJed Brown PetscInt cStart, cEnd, c; 2667552f7358SJed Brown 2668552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 266982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2670552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr); 2671552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr); 2672552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2673552f7358SJed Brown ierr = PetscMalloc((cEnd - cStart) * sizeof(PetscInt), &points);CHKERRQ(ierr); 26740d644c17SKarl Rupp for (c = cStart; c < cEnd; ++c) points[c] = c; 267582f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2676552f7358SJed Brown PetscFunctionReturn(0); 2677552f7358SJed Brown } 2678ac17c9edSMatthew G. Knepley ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr); 2679ac17c9edSMatthew G. Knepley if (flg) name = partname; 2680ac17c9edSMatthew G. Knepley if (name) { 2681ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr); 2682ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr); 2683ac17c9edSMatthew G. Knepley } 2684552f7358SJed Brown if (height == 0) { 2685552f7358SJed Brown PetscInt numVertices; 26860298fd71SBarry Smith PetscInt *start = NULL; 26870298fd71SBarry Smith PetscInt *adjacency = NULL; 2688552f7358SJed Brown 268977c88f5bSMatthew G Knepley ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr); 2690ac17c9edSMatthew G. Knepley if (!name || isChaco) { 2691519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2692552f7358SJed Brown ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2693ac17c9edSMatthew G. Knepley #else 2694ac17c9edSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco."); 2695552f7358SJed Brown #endif 2696ac17c9edSMatthew G. Knepley } else if (isMetis) { 2697519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 2698552f7358SJed Brown ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2699552f7358SJed Brown #endif 2700ac17c9edSMatthew G. Knepley } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name); 2701552f7358SJed Brown if (enlarge) { 2702552f7358SJed Brown *origPartSection = *partSection; 2703552f7358SJed Brown *origPartition = *partition; 27040d644c17SKarl Rupp 2705552f7358SJed Brown ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr); 2706552f7358SJed Brown } 2707552f7358SJed Brown ierr = PetscFree(start);CHKERRQ(ierr); 2708552f7358SJed Brown ierr = PetscFree(adjacency);CHKERRQ(ierr); 2709552f7358SJed Brown # if 0 2710552f7358SJed Brown } else if (height == 1) { 2711552f7358SJed Brown /* Build the dual graph for faces and partition the hypergraph */ 2712552f7358SJed Brown PetscInt numEdges; 2713552f7358SJed Brown 2714552f7358SJed Brown buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase()); 2715552f7358SJed Brown GraphPartitioner().partition(numEdges, start, adjacency, partition, manager); 2716552f7358SJed Brown destroyCSR(numEdges, start, adjacency); 2717552f7358SJed Brown #endif 271882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height); 2719552f7358SJed Brown PetscFunctionReturn(0); 2720552f7358SJed Brown } 2721552f7358SJed Brown 2722552f7358SJed Brown #undef __FUNCT__ 2723552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure" 27240adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition) 27250adebc6cSBarry Smith { 2726552f7358SJed Brown /* const PetscInt height = 0; */ 2727552f7358SJed Brown const PetscInt *partArray; 2728cb3cb6d9SJed Brown PetscInt *allPoints, *packPoints; 2729cb3cb6d9SJed Brown PetscInt rStart, rEnd, rank, pStart, pEnd, newSize; 2730552f7358SJed Brown PetscErrorCode ierr; 2731cb3cb6d9SJed Brown PetscBT bt; 2732cb3cb6d9SJed Brown PetscSegBuffer segpack,segpart; 2733552f7358SJed Brown 2734552f7358SJed Brown PetscFunctionBegin; 2735552f7358SJed Brown ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr); 2736552f7358SJed Brown ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr); 273782f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2738552f7358SJed Brown ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr); 2739cb3cb6d9SJed Brown ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr); 2740cb3cb6d9SJed Brown ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr); 2741cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr); 2742cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr); 2743552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2744471ecdacSJed Brown PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints; 2745552f7358SJed Brown 2746552f7358SJed Brown ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr); 2747552f7358SJed Brown ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr); 2748552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2749552f7358SJed Brown PetscInt point = partArray[offset+p], closureSize, c; 27500298fd71SBarry Smith PetscInt *closure = NULL; 2751552f7358SJed Brown 2752552f7358SJed Brown /* TODO Include support for height > 0 case */ 2753552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2754cb3cb6d9SJed Brown for (c=0; c<closureSize; c++) { 2755cb3cb6d9SJed Brown PetscInt cpoint = closure[c*2]; 2756cb3cb6d9SJed Brown if (!PetscBTLookupSet(bt,cpoint-pStart)) { 2757471ecdacSJed Brown PetscInt *PETSC_RESTRICT pt; 2758cb3cb6d9SJed Brown partSize++; 2759471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr); 2760cb3cb6d9SJed Brown *pt = cpoint; 2761552f7358SJed Brown } 2762cb3cb6d9SJed Brown } 2763552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2764552f7358SJed Brown } 2765552f7358SJed Brown ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr); 2766471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr); 2767471ecdacSJed Brown ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr); 2768471ecdacSJed Brown ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr); 2769471ecdacSJed Brown for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);} 2770552f7358SJed Brown } 2771cb3cb6d9SJed Brown ierr = PetscBTDestroy(&bt);CHKERRQ(ierr); 2772cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr); 2773cb3cb6d9SJed Brown 2774552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 2775552f7358SJed Brown ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr); 2776552f7358SJed Brown ierr = PetscMalloc(newSize * sizeof(PetscInt), &allPoints);CHKERRQ(ierr); 2777552f7358SJed Brown 2778137cf7b6SJed Brown ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr); 2779552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2780cb3cb6d9SJed Brown PetscInt numPoints, offset; 2781552f7358SJed Brown 2782cb3cb6d9SJed Brown ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr); 2783cb3cb6d9SJed Brown ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr); 2784cb3cb6d9SJed Brown ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr); 2785cb3cb6d9SJed Brown packPoints += numPoints; 2786552f7358SJed Brown } 2787cb3cb6d9SJed Brown 2788cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr); 2789552f7358SJed Brown ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr); 279082f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2791552f7358SJed Brown PetscFunctionReturn(0); 2792552f7358SJed Brown } 2793552f7358SJed Brown 2794552f7358SJed Brown #undef __FUNCT__ 2795552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField" 27961858a729SMatthew G. Knepley /*@ 27971858a729SMatthew G. Knepley DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 27981858a729SMatthew G. Knepley 27991858a729SMatthew G. Knepley Collective on DM 28001858a729SMatthew G. Knepley 2801552f7358SJed Brown Input Parameters: 28021858a729SMatthew G. Knepley + dm - The DMPlex object 28031858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 28041858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 28051858a729SMatthew G. Knepley - originalVec - The existing data 2806552f7358SJed Brown 2807552f7358SJed Brown Output Parameters: 28081858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 28091858a729SMatthew G. Knepley - newVec - The new data 28101858a729SMatthew G. Knepley 28111858a729SMatthew G. Knepley Level: developer 28121858a729SMatthew G. Knepley 28131858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData() 28141858a729SMatthew G. Knepley @*/ 2815552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec) 2816552f7358SJed Brown { 2817552f7358SJed Brown PetscSF fieldSF; 2818552f7358SJed Brown PetscInt *remoteOffsets, fieldSize; 2819552f7358SJed Brown PetscScalar *originalValues, *newValues; 2820552f7358SJed Brown PetscErrorCode ierr; 2821552f7358SJed Brown 2822552f7358SJed Brown PetscFunctionBegin; 2823552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 2824552f7358SJed Brown 2825552f7358SJed Brown ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 2826552f7358SJed Brown ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr); 2827c0dedaeaSBarry Smith ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr); 2828552f7358SJed Brown 2829552f7358SJed Brown ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr); 2830552f7358SJed Brown ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr); 2831552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 2832552f7358SJed Brown ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 2833552f7358SJed Brown ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 2834552f7358SJed Brown ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 2835552f7358SJed Brown ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr); 2836552f7358SJed Brown ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr); 2837552f7358SJed Brown PetscFunctionReturn(0); 2838552f7358SJed Brown } 2839552f7358SJed Brown 2840552f7358SJed Brown #undef __FUNCT__ 28411858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData" 28421858a729SMatthew G. Knepley /*@ 28431858a729SMatthew G. Knepley DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 28441858a729SMatthew G. Knepley 28451858a729SMatthew G. Knepley Collective on DM 28461858a729SMatthew G. Knepley 28471858a729SMatthew G. Knepley Input Parameters: 28481858a729SMatthew G. Knepley + dm - The DMPlex object 28491858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 28501858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 28511858a729SMatthew G. Knepley . datatype - The type of data 28521858a729SMatthew G. Knepley - originalData - The existing data 28531858a729SMatthew G. Knepley 28541858a729SMatthew G. Knepley Output Parameters: 28551858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 28561858a729SMatthew G. Knepley - newData - The new data 28571858a729SMatthew G. Knepley 28581858a729SMatthew G. Knepley Level: developer 28591858a729SMatthew G. Knepley 28601858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField() 28611858a729SMatthew G. Knepley @*/ 28621858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData) 28631858a729SMatthew G. Knepley { 28641858a729SMatthew G. Knepley PetscSF fieldSF; 28651858a729SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 28661858a729SMatthew G. Knepley PetscMPIInt dataSize; 28671858a729SMatthew G. Knepley PetscErrorCode ierr; 28681858a729SMatthew G. Knepley 28691858a729SMatthew G. Knepley PetscFunctionBegin; 28701858a729SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 28711858a729SMatthew G. Knepley 28721858a729SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 28731858a729SMatthew G. Knepley ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr); 28741858a729SMatthew G. Knepley ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr); 28751858a729SMatthew G. Knepley 28761858a729SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 28771858a729SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 28781858a729SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 28791858a729SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 28801858a729SMatthew G. Knepley PetscFunctionReturn(0); 28811858a729SMatthew G. Knepley } 28821858a729SMatthew G. Knepley 28831858a729SMatthew G. Knepley #undef __FUNCT__ 2884552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute" 2885552f7358SJed Brown /*@C 2886552f7358SJed Brown DMPlexDistribute - Distributes the mesh and any associated sections. 2887552f7358SJed Brown 2888552f7358SJed Brown Not Collective 2889552f7358SJed Brown 2890552f7358SJed Brown Input Parameter: 2891552f7358SJed Brown + dm - The original DMPlex object 2892552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default 2893552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default 2894552f7358SJed Brown 2895552f7358SJed Brown Output Parameter: 2896e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution 2897e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL 2898552f7358SJed Brown 28990298fd71SBarry Smith Note: If the mesh was not distributed, the return value is NULL 2900552f7358SJed Brown 2901552f7358SJed Brown Level: intermediate 2902552f7358SJed Brown 2903552f7358SJed Brown .keywords: mesh, elements 2904552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace() 2905552f7358SJed Brown @*/ 2906e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel) 2907552f7358SJed Brown { 2908552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data, *pmesh; 290982f516ccSBarry Smith MPI_Comm comm; 2910552f7358SJed Brown const PetscInt height = 0; 2911552f7358SJed Brown PetscInt dim, numRemoteRanks; 2912552f7358SJed Brown IS origCellPart, cellPart, part; 2913552f7358SJed Brown PetscSection origCellPartSection, cellPartSection, partSection; 2914552f7358SJed Brown PetscSFNode *remoteRanks; 2915552f7358SJed Brown PetscSF partSF, pointSF, coneSF; 2916552f7358SJed Brown ISLocalToGlobalMapping renumbering; 2917552f7358SJed Brown PetscSection originalConeSection, newConeSection; 2918552f7358SJed Brown PetscInt *remoteOffsets; 2919552f7358SJed Brown PetscInt *cones, *newCones, newConesSize; 2920552f7358SJed Brown PetscBool flg; 2921552f7358SJed Brown PetscMPIInt rank, numProcs, p; 2922552f7358SJed Brown PetscErrorCode ierr; 2923552f7358SJed Brown 2924552f7358SJed Brown PetscFunctionBegin; 2925552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2926e7ba9e7aSMatthew G. Knepley if (sf) PetscValidPointer(sf,4); 2927e7ba9e7aSMatthew G. Knepley PetscValidPointer(dmParallel,5); 29280d644c17SKarl Rupp 2929552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 293082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2931552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2932552f7358SJed Brown ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr); 29330d644c17SKarl Rupp 29340298fd71SBarry Smith *dmParallel = NULL; 2935552f7358SJed Brown if (numProcs == 1) PetscFunctionReturn(0); 2936552f7358SJed Brown 2937552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2938552f7358SJed Brown /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */ 2939b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 294082f516ccSBarry Smith if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented"); 2941ac17c9edSMatthew G. Knepley ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr); 2942552f7358SJed Brown /* Create SF assuming a serial partition for all processes: Could check for IS length here */ 29430d644c17SKarl Rupp if (!rank) numRemoteRanks = numProcs; 29440d644c17SKarl Rupp else numRemoteRanks = 0; 2945552f7358SJed Brown ierr = PetscMalloc(numRemoteRanks * sizeof(PetscSFNode), &remoteRanks);CHKERRQ(ierr); 2946552f7358SJed Brown for (p = 0; p < numRemoteRanks; ++p) { 2947552f7358SJed Brown remoteRanks[p].rank = p; 2948552f7358SJed Brown remoteRanks[p].index = 0; 2949552f7358SJed Brown } 2950552f7358SJed Brown ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr); 29510298fd71SBarry Smith ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr); 2952552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr); 2953552f7358SJed Brown if (flg) { 2954552f7358SJed Brown ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr); 2955552f7358SJed Brown ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 29560298fd71SBarry Smith ierr = ISView(cellPart, NULL);CHKERRQ(ierr); 2957552f7358SJed Brown if (origCellPart) { 2958552f7358SJed Brown ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr); 2959552f7358SJed Brown ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 29600298fd71SBarry Smith ierr = ISView(origCellPart, NULL);CHKERRQ(ierr); 2961552f7358SJed Brown } 29620298fd71SBarry Smith ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr); 2963552f7358SJed Brown } 2964552f7358SJed Brown /* Close the partition over the mesh */ 2965552f7358SJed Brown ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr); 2966552f7358SJed Brown ierr = ISDestroy(&cellPart);CHKERRQ(ierr); 2967552f7358SJed Brown ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr); 2968552f7358SJed Brown /* Create new mesh */ 2969552f7358SJed Brown ierr = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr); 2970552f7358SJed Brown ierr = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr); 2971552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr); 2972552f7358SJed Brown pmesh = (DM_Plex*) (*dmParallel)->data; 2973552f7358SJed Brown /* Distribute sieve points and the global point numbering (replaces creating remote bases) */ 2974552f7358SJed Brown ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr); 2975552f7358SJed Brown if (flg) { 2976552f7358SJed Brown ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr); 2977552f7358SJed Brown ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 29780298fd71SBarry Smith ierr = ISView(part, NULL);CHKERRQ(ierr); 29790298fd71SBarry Smith ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr); 2980552f7358SJed Brown ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr); 29810298fd71SBarry Smith ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr); 2982552f7358SJed Brown } 2983b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 2984552f7358SJed Brown /* Distribute cone section */ 2985552f7358SJed Brown ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr); 2986552f7358SJed Brown ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr); 2987552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr); 2988552f7358SJed Brown ierr = DMSetUp(*dmParallel);CHKERRQ(ierr); 2989552f7358SJed Brown { 2990552f7358SJed Brown PetscInt pStart, pEnd, p; 2991552f7358SJed Brown 2992552f7358SJed Brown ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr); 2993552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 2994552f7358SJed Brown PetscInt coneSize; 2995552f7358SJed Brown ierr = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr); 2996552f7358SJed Brown pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize); 2997552f7358SJed Brown } 2998552f7358SJed Brown } 2999552f7358SJed Brown /* Communicate and renumber cones */ 3000552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr); 3001552f7358SJed Brown ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr); 3002552f7358SJed Brown ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr); 3003552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3004552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3005552f7358SJed Brown ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr); 30060298fd71SBarry Smith ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr); 3007552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr); 3008552f7358SJed Brown if (flg) { 3009552f7358SJed Brown ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr); 3010552f7358SJed Brown ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 3011552f7358SJed Brown ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr); 3012552f7358SJed Brown ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 30130298fd71SBarry Smith ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr); 3014552f7358SJed Brown } 3015552f7358SJed Brown ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr); 3016552f7358SJed Brown ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr); 3017552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3018552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3019552f7358SJed Brown ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr); 3020552f7358SJed Brown /* Create supports and stratify sieve */ 3021552f7358SJed Brown { 3022552f7358SJed Brown PetscInt pStart, pEnd; 3023552f7358SJed Brown 3024552f7358SJed Brown ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 3025552f7358SJed Brown ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 3026552f7358SJed Brown } 3027552f7358SJed Brown ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr); 3028552f7358SJed Brown ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr); 3029552f7358SJed Brown /* Distribute Coordinates */ 3030552f7358SJed Brown { 3031552f7358SJed Brown PetscSection originalCoordSection, newCoordSection; 3032552f7358SJed Brown Vec originalCoordinates, newCoordinates; 3033552f7358SJed Brown const char *name; 3034552f7358SJed Brown 3035552f7358SJed Brown ierr = DMPlexGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr); 3036552f7358SJed Brown ierr = DMPlexGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr); 3037552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr); 3038552f7358SJed Brown ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr); 3039552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr); 3040552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr); 3041552f7358SJed Brown 3042552f7358SJed Brown ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr); 3043552f7358SJed Brown ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr); 3044552f7358SJed Brown ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 3045552f7358SJed Brown } 3046552f7358SJed Brown /* Distribute labels */ 3047b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 3048552f7358SJed Brown { 3049552f7358SJed Brown DMLabel next = mesh->labels, newNext = pmesh->labels; 3050552f7358SJed Brown PetscInt numLabels = 0, l; 3051552f7358SJed Brown 3052552f7358SJed Brown /* Bcast number of labels */ 30530d644c17SKarl Rupp while (next) { 30540d644c17SKarl Rupp ++numLabels; next = next->next; 30550d644c17SKarl Rupp } 3056552f7358SJed Brown ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3057552f7358SJed Brown next = mesh->labels; 3058552f7358SJed Brown for (l = 0; l < numLabels; ++l) { 3059552f7358SJed Brown DMLabel newLabel; 3060552f7358SJed Brown const PetscInt *partArray; 3061552f7358SJed Brown char *name; 30620298fd71SBarry Smith PetscInt *stratumSizes = NULL, *points = NULL; 30630298fd71SBarry Smith PetscMPIInt *sendcnts = NULL, *offsets = NULL, *displs = NULL; 30640447884eSMatthew G. Knepley PetscInt nameSize, s, p, proc; 3065552f7358SJed Brown PetscBool isdepth; 3066552f7358SJed Brown size_t len = 0; 3067552f7358SJed Brown 3068552f7358SJed Brown /* Bcast name (could filter for no points) */ 3069552f7358SJed Brown if (!rank) {ierr = PetscStrlen(next->name, &len);CHKERRQ(ierr);} 3070552f7358SJed Brown nameSize = len; 3071552f7358SJed Brown ierr = MPI_Bcast(&nameSize, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3072552f7358SJed Brown ierr = PetscMalloc(nameSize+1, &name);CHKERRQ(ierr); 3073552f7358SJed Brown if (!rank) {ierr = PetscMemcpy(name, next->name, nameSize+1);CHKERRQ(ierr);} 3074552f7358SJed Brown ierr = MPI_Bcast(name, nameSize+1, MPI_CHAR, 0, comm);CHKERRQ(ierr); 3075552f7358SJed Brown ierr = PetscStrcmp(name, "depth", &isdepth);CHKERRQ(ierr); 307622566864SJed Brown if (isdepth) { /* skip because "depth" is not distributed */ 307722566864SJed Brown ierr = PetscFree(name);CHKERRQ(ierr); 307822566864SJed Brown if (!rank) next = next->next; 307922566864SJed Brown continue; 308022566864SJed Brown } 3081552f7358SJed Brown ierr = PetscNew(struct _n_DMLabel, &newLabel);CHKERRQ(ierr); 3082552f7358SJed Brown newLabel->name = name; 3083552f7358SJed Brown /* Bcast numStrata (could filter for no points in stratum) */ 30840d644c17SKarl Rupp if (!rank) newLabel->numStrata = next->numStrata; 3085552f7358SJed Brown ierr = MPI_Bcast(&newLabel->numStrata, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3086552f7358SJed Brown ierr = PetscMalloc3(newLabel->numStrata,PetscInt,&newLabel->stratumValues, 3087552f7358SJed Brown newLabel->numStrata,PetscInt,&newLabel->stratumSizes, 3088552f7358SJed Brown newLabel->numStrata+1,PetscInt,&newLabel->stratumOffsets);CHKERRQ(ierr); 3089552f7358SJed Brown /* Bcast stratumValues (could filter for no points in stratum) */ 3090552f7358SJed Brown if (!rank) {ierr = PetscMemcpy(newLabel->stratumValues, next->stratumValues, next->numStrata * sizeof(PetscInt));CHKERRQ(ierr);} 3091552f7358SJed Brown ierr = MPI_Bcast(newLabel->stratumValues, newLabel->numStrata, MPIU_INT, 0, comm);CHKERRQ(ierr); 30920447884eSMatthew G. Knepley /* Find size on each process and Scatter 30930447884eSMatthew G. Knepley we use the fact that both the stratum points and partArray are sorted */ 3094552f7358SJed Brown if (!rank) { 3095552f7358SJed Brown ierr = ISGetIndices(part, &partArray);CHKERRQ(ierr); 3096552f7358SJed Brown ierr = PetscMalloc(numProcs*next->numStrata * sizeof(PetscInt), &stratumSizes);CHKERRQ(ierr); 3097552f7358SJed Brown ierr = PetscMemzero(stratumSizes, numProcs*next->numStrata * sizeof(PetscInt));CHKERRQ(ierr); 30980447884eSMatthew G. Knepley /* TODO We should switch to using binary search if the label is a lot smaller than partitions */ 3099552f7358SJed Brown for (proc = 0; proc < numProcs; ++proc) { 31000447884eSMatthew G. Knepley PetscInt dof, off; 3101552f7358SJed Brown 3102552f7358SJed Brown ierr = PetscSectionGetDof(partSection, proc, &dof);CHKERRQ(ierr); 3103552f7358SJed Brown ierr = PetscSectionGetOffset(partSection, proc, &off);CHKERRQ(ierr); 31040447884eSMatthew G. Knepley for (s = 0; s < next->numStrata; ++s) { 31050447884eSMatthew G. Knepley PetscInt lStart = next->stratumOffsets[s], lEnd = next->stratumOffsets[s]+next->stratumSizes[s]; 31060447884eSMatthew G. Knepley PetscInt pStart = off, pEnd = off+dof; 31070447884eSMatthew G. Knepley 31080447884eSMatthew G. Knepley while (pStart < pEnd && lStart < lEnd) { 31090447884eSMatthew G. Knepley if (partArray[pStart] > next->points[lStart]) { 31100447884eSMatthew G. Knepley ++lStart; 31110447884eSMatthew G. Knepley } else if (next->points[lStart] > partArray[pStart]) { 31120447884eSMatthew G. Knepley ++pStart; 31130447884eSMatthew G. Knepley } else { 3114552f7358SJed Brown ++stratumSizes[proc*next->numStrata+s]; 31150447884eSMatthew G. Knepley ++pStart; ++lStart; 3116552f7358SJed Brown } 3117552f7358SJed Brown } 3118552f7358SJed Brown } 3119552f7358SJed Brown } 3120552f7358SJed Brown ierr = ISRestoreIndices(part, &partArray);CHKERRQ(ierr); 3121552f7358SJed Brown } 3122552f7358SJed Brown ierr = MPI_Scatter(stratumSizes, newLabel->numStrata, MPIU_INT, newLabel->stratumSizes, newLabel->numStrata, MPIU_INT, 0, comm);CHKERRQ(ierr); 3123552f7358SJed Brown /* Calculate stratumOffsets */ 3124552f7358SJed Brown newLabel->stratumOffsets[0] = 0; 3125552f7358SJed Brown for (s = 0; s < newLabel->numStrata; ++s) { 3126552f7358SJed Brown newLabel->stratumOffsets[s+1] = newLabel->stratumSizes[s] + newLabel->stratumOffsets[s]; 3127552f7358SJed Brown } 3128552f7358SJed Brown /* Pack points and Scatter */ 3129552f7358SJed Brown if (!rank) { 3130552f7358SJed Brown ierr = PetscMalloc3(numProcs,PetscMPIInt,&sendcnts,numProcs,PetscMPIInt,&offsets,numProcs+1,PetscMPIInt,&displs);CHKERRQ(ierr); 3131552f7358SJed Brown displs[0] = 0; 3132552f7358SJed Brown for (p = 0; p < numProcs; ++p) { 3133552f7358SJed Brown sendcnts[p] = 0; 3134552f7358SJed Brown for (s = 0; s < next->numStrata; ++s) { 3135552f7358SJed Brown sendcnts[p] += stratumSizes[p*next->numStrata+s]; 3136552f7358SJed Brown } 3137552f7358SJed Brown offsets[p] = displs[p]; 3138552f7358SJed Brown displs[p+1] = displs[p] + sendcnts[p]; 3139552f7358SJed Brown } 3140552f7358SJed Brown ierr = PetscMalloc(displs[numProcs] * sizeof(PetscInt), &points);CHKERRQ(ierr); 31410447884eSMatthew G. Knepley /* TODO We should switch to using binary search if the label is a lot smaller than partitions */ 3142552f7358SJed Brown for (proc = 0; proc < numProcs; ++proc) { 31430447884eSMatthew G. Knepley PetscInt dof, off; 3144552f7358SJed Brown 3145552f7358SJed Brown ierr = PetscSectionGetDof(partSection, proc, &dof);CHKERRQ(ierr); 3146552f7358SJed Brown ierr = PetscSectionGetOffset(partSection, proc, &off);CHKERRQ(ierr); 31470447884eSMatthew G. Knepley for (s = 0; s < next->numStrata; ++s) { 31480447884eSMatthew G. Knepley PetscInt lStart = next->stratumOffsets[s], lEnd = next->stratumOffsets[s]+next->stratumSizes[s]; 31490447884eSMatthew G. Knepley PetscInt pStart = off, pEnd = off+dof; 31500447884eSMatthew G. Knepley 31510447884eSMatthew G. Knepley while (pStart < pEnd && lStart < lEnd) { 31520447884eSMatthew G. Knepley if (partArray[pStart] > next->points[lStart]) { 31530447884eSMatthew G. Knepley ++lStart; 31540447884eSMatthew G. Knepley } else if (next->points[lStart] > partArray[pStart]) { 31550447884eSMatthew G. Knepley ++pStart; 31560447884eSMatthew G. Knepley } else { 31570447884eSMatthew G. Knepley points[offsets[proc]++] = next->points[lStart]; 31580447884eSMatthew G. Knepley ++pStart; ++lStart; 3159552f7358SJed Brown } 3160552f7358SJed Brown } 3161552f7358SJed Brown } 3162552f7358SJed Brown } 3163552f7358SJed Brown } 3164552f7358SJed Brown ierr = PetscMalloc(newLabel->stratumOffsets[newLabel->numStrata] * sizeof(PetscInt), &newLabel->points);CHKERRQ(ierr); 3165552f7358SJed Brown ierr = MPI_Scatterv(points, sendcnts, displs, MPIU_INT, newLabel->points, newLabel->stratumOffsets[newLabel->numStrata], MPIU_INT, 0, comm);CHKERRQ(ierr); 3166552f7358SJed Brown ierr = PetscFree(points);CHKERRQ(ierr); 3167552f7358SJed Brown ierr = PetscFree3(sendcnts,offsets,displs);CHKERRQ(ierr); 3168552f7358SJed Brown ierr = PetscFree(stratumSizes);CHKERRQ(ierr); 3169552f7358SJed Brown /* Renumber points */ 31700298fd71SBarry Smith ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newLabel->stratumOffsets[newLabel->numStrata], newLabel->points, NULL, newLabel->points);CHKERRQ(ierr); 3171552f7358SJed Brown /* Sort points */ 3172552f7358SJed Brown for (s = 0; s < newLabel->numStrata; ++s) { 3173552f7358SJed Brown ierr = PetscSortInt(newLabel->stratumSizes[s], &newLabel->points[newLabel->stratumOffsets[s]]);CHKERRQ(ierr); 3174552f7358SJed Brown } 3175552f7358SJed Brown /* Insert into list */ 31760d644c17SKarl Rupp if (newNext) newNext->next = newLabel; 31770d644c17SKarl Rupp else pmesh->labels = newLabel; 3178552f7358SJed Brown newNext = newLabel; 31790d644c17SKarl Rupp if (!rank) next = next->next; 3180552f7358SJed Brown } 3181552f7358SJed Brown } 3182b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 31835a9d0af9SMatthew G. Knepley /* Setup hybrid structure */ 31845a9d0af9SMatthew G. Knepley { 31855a9d0af9SMatthew G. Knepley const PetscInt *gpoints; 31865a9d0af9SMatthew G. Knepley PetscInt depth, n, d; 31875a9d0af9SMatthew G. Knepley 31885a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];} 31895a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr); 31905a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr); 31915a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr); 31925a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 31935a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 31945a9d0af9SMatthew G. Knepley PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p; 31955a9d0af9SMatthew G. Knepley 31965a9d0af9SMatthew G. Knepley if (pmax < 0) continue; 31975a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr); 31986dfbe1fcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr); 31995a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr); 32005a9d0af9SMatthew G. Knepley for (p = 0; p < n; ++p) { 32015a9d0af9SMatthew G. Knepley const PetscInt point = gpoints[p]; 32025a9d0af9SMatthew G. Knepley 32035a9d0af9SMatthew G. Knepley if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax; 32045a9d0af9SMatthew G. Knepley } 32055a9d0af9SMatthew G. Knepley if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax; 32065a9d0af9SMatthew G. Knepley else pmesh->hybridPointMax[d] = -1; 32075a9d0af9SMatthew G. Knepley } 32085a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr); 32095a9d0af9SMatthew G. Knepley } 3210552f7358SJed Brown /* Cleanup Partition */ 3211552f7358SJed Brown ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr); 3212552f7358SJed Brown ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr); 3213552f7358SJed Brown ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr); 3214552f7358SJed Brown ierr = ISDestroy(&part);CHKERRQ(ierr); 3215552f7358SJed Brown /* Create point SF for parallel mesh */ 3216b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3217552f7358SJed Brown { 3218552f7358SJed Brown const PetscInt *leaves; 3219552f7358SJed Brown PetscSFNode *remotePoints, *rowners, *lowners; 3220552f7358SJed Brown PetscInt numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints; 3221552f7358SJed Brown PetscInt pStart, pEnd; 3222552f7358SJed Brown 3223552f7358SJed Brown ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr); 32240298fd71SBarry Smith ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr); 3225552f7358SJed Brown ierr = PetscMalloc2(numRoots,PetscSFNode,&rowners,numLeaves,PetscSFNode,&lowners);CHKERRQ(ierr); 3226552f7358SJed Brown for (p=0; p<numRoots; p++) { 3227552f7358SJed Brown rowners[p].rank = -1; 3228552f7358SJed Brown rowners[p].index = -1; 3229552f7358SJed Brown } 3230552f7358SJed Brown if (origCellPart) { 3231552f7358SJed Brown /* Make sure cells in the original partition are not assigned to other procs */ 3232552f7358SJed Brown const PetscInt *origCells; 3233552f7358SJed Brown 3234552f7358SJed Brown ierr = ISGetIndices(origCellPart, &origCells);CHKERRQ(ierr); 3235552f7358SJed Brown for (p = 0; p < numProcs; ++p) { 3236552f7358SJed Brown PetscInt dof, off, d; 3237552f7358SJed Brown 3238552f7358SJed Brown ierr = PetscSectionGetDof(origCellPartSection, p, &dof);CHKERRQ(ierr); 3239552f7358SJed Brown ierr = PetscSectionGetOffset(origCellPartSection, p, &off);CHKERRQ(ierr); 3240552f7358SJed Brown for (d = off; d < off+dof; ++d) { 3241552f7358SJed Brown rowners[origCells[d]].rank = p; 3242552f7358SJed Brown } 3243552f7358SJed Brown } 3244552f7358SJed Brown ierr = ISRestoreIndices(origCellPart, &origCells);CHKERRQ(ierr); 3245552f7358SJed Brown } 3246552f7358SJed Brown ierr = ISDestroy(&origCellPart);CHKERRQ(ierr); 3247552f7358SJed Brown ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr); 3248552f7358SJed Brown 3249552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3250552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3251552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3252552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */ 3253552f7358SJed Brown lowners[p].rank = rank; 3254552f7358SJed Brown lowners[p].index = leaves ? leaves[p] : p; 3255552f7358SJed Brown } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */ 3256552f7358SJed Brown lowners[p].rank = -2; 3257552f7358SJed Brown lowners[p].index = -2; 3258552f7358SJed Brown } 3259552f7358SJed Brown } 3260552f7358SJed Brown for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */ 3261552f7358SJed Brown rowners[p].rank = -3; 3262552f7358SJed Brown rowners[p].index = -3; 3263552f7358SJed Brown } 3264552f7358SJed Brown ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3265552f7358SJed Brown ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3266552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3267552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3268552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3269552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed"); 3270552f7358SJed Brown if (lowners[p].rank != rank) ++numGhostPoints; 3271552f7358SJed Brown } 3272552f7358SJed Brown ierr = PetscMalloc(numGhostPoints * sizeof(PetscInt), &ghostPoints);CHKERRQ(ierr); 3273552f7358SJed Brown ierr = PetscMalloc(numGhostPoints * sizeof(PetscSFNode), &remotePoints);CHKERRQ(ierr); 3274552f7358SJed Brown for (p = 0, gp = 0; p < numLeaves; ++p) { 3275552f7358SJed Brown if (lowners[p].rank != rank) { 3276552f7358SJed Brown ghostPoints[gp] = leaves ? leaves[p] : p; 3277552f7358SJed Brown remotePoints[gp].rank = lowners[p].rank; 3278552f7358SJed Brown remotePoints[gp].index = lowners[p].index; 3279552f7358SJed Brown ++gp; 3280552f7358SJed Brown } 3281552f7358SJed Brown } 3282552f7358SJed Brown ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr); 3283552f7358SJed Brown ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3284552f7358SJed Brown ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr); 3285552f7358SJed Brown } 3286b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3287552f7358SJed Brown /* Cleanup */ 3288e7ba9e7aSMatthew G. Knepley if (sf) {*sf = pointSF;} 3289e7ba9e7aSMatthew G. Knepley else {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);} 3290552f7358SJed Brown ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr); 3291552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 3292552f7358SJed Brown PetscFunctionReturn(0); 3293552f7358SJed Brown } 3294552f7358SJed Brown 32952e1b13c2SMatthew G. Knepley #undef __FUNCT__ 32969db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 32979db3b87dSMatthew G. Knepley /*@C 32989db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 32999db3b87dSMatthew G. Knepley 33009db3b87dSMatthew G. Knepley Input Parameters: 33019db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 33029db3b87dSMatthew G. Knepley - cone - The incoming cone 33039db3b87dSMatthew G. Knepley 33049db3b87dSMatthew G. Knepley Output Parameter: 33059db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 33069db3b87dSMatthew G. Knepley 33079db3b87dSMatthew G. Knepley Level: developer 33089db3b87dSMatthew G. Knepley 33099db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 33109db3b87dSMatthew G. Knepley @*/ 33119db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 33122e1b13c2SMatthew G. Knepley { 33139db3b87dSMatthew G. Knepley int tmpc; 33142e1b13c2SMatthew G. Knepley 33152e1b13c2SMatthew G. Knepley PetscFunctionBegin; 33169db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 33179db3b87dSMatthew G. Knepley switch (numCorners) { 33189db3b87dSMatthew G. Knepley case 4: 33191885f254SMatthew G. Knepley tmpc = cone[0]; 33201885f254SMatthew G. Knepley cone[0] = cone[1]; 33211885f254SMatthew G. Knepley cone[1] = tmpc; 33229db3b87dSMatthew G. Knepley break; 33239db3b87dSMatthew G. Knepley case 8: 33249db3b87dSMatthew G. Knepley tmpc = cone[1]; 33259db3b87dSMatthew G. Knepley cone[1] = cone[3]; 33269db3b87dSMatthew G. Knepley cone[3] = tmpc; 33279db3b87dSMatthew G. Knepley break; 33289db3b87dSMatthew G. Knepley default: break; 33299db3b87dSMatthew G. Knepley } 33309db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 33319db3b87dSMatthew G. Knepley } 33329db3b87dSMatthew G. Knepley 33339db3b87dSMatthew G. Knepley #undef __FUNCT__ 33349db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 33359db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 33369db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 33379db3b87dSMatthew G. Knepley { 33389db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 33399db3b87dSMatthew G. Knepley PetscErrorCode ierr; 33409db3b87dSMatthew G. Knepley 33419db3b87dSMatthew G. Knepley PetscFunctionBegin; 33429db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 33439db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 33442e1b13c2SMatthew G. Knepley } 33452e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 33462e1b13c2SMatthew G. Knepley } 33472e1b13c2SMatthew G. Knepley 3348519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3349552f7358SJed Brown #include <triangle.h> 3350552f7358SJed Brown 3351552f7358SJed Brown #undef __FUNCT__ 3352552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 33530adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 33540adebc6cSBarry Smith { 3355552f7358SJed Brown PetscFunctionBegin; 3356552f7358SJed Brown inputCtx->numberofpoints = 0; 3357552f7358SJed Brown inputCtx->numberofpointattributes = 0; 33580298fd71SBarry Smith inputCtx->pointlist = NULL; 33590298fd71SBarry Smith inputCtx->pointattributelist = NULL; 33600298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 3361552f7358SJed Brown inputCtx->numberofsegments = 0; 33620298fd71SBarry Smith inputCtx->segmentlist = NULL; 33630298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 3364552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 33650298fd71SBarry Smith inputCtx->trianglelist = NULL; 3366552f7358SJed Brown inputCtx->numberofholes = 0; 33670298fd71SBarry Smith inputCtx->holelist = NULL; 3368552f7358SJed Brown inputCtx->numberofregions = 0; 33690298fd71SBarry Smith inputCtx->regionlist = NULL; 3370552f7358SJed Brown PetscFunctionReturn(0); 3371552f7358SJed Brown } 3372552f7358SJed Brown 3373552f7358SJed Brown #undef __FUNCT__ 3374552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 33750adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 33760adebc6cSBarry Smith { 3377552f7358SJed Brown PetscFunctionBegin; 3378552f7358SJed Brown outputCtx->numberofpoints = 0; 33790298fd71SBarry Smith outputCtx->pointlist = NULL; 33800298fd71SBarry Smith outputCtx->pointattributelist = NULL; 33810298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 3382552f7358SJed Brown outputCtx->numberoftriangles = 0; 33830298fd71SBarry Smith outputCtx->trianglelist = NULL; 33840298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 33850298fd71SBarry Smith outputCtx->neighborlist = NULL; 33860298fd71SBarry Smith outputCtx->segmentlist = NULL; 33870298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 3388552f7358SJed Brown outputCtx->numberofedges = 0; 33890298fd71SBarry Smith outputCtx->edgelist = NULL; 33900298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 3391552f7358SJed Brown PetscFunctionReturn(0); 3392552f7358SJed Brown } 3393552f7358SJed Brown 3394552f7358SJed Brown #undef __FUNCT__ 3395552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 33960adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 33970adebc6cSBarry Smith { 3398552f7358SJed Brown PetscFunctionBegin; 3399552f7358SJed Brown free(outputCtx->pointmarkerlist); 3400552f7358SJed Brown free(outputCtx->edgelist); 3401552f7358SJed Brown free(outputCtx->edgemarkerlist); 3402552f7358SJed Brown free(outputCtx->trianglelist); 3403552f7358SJed Brown free(outputCtx->neighborlist); 3404552f7358SJed Brown PetscFunctionReturn(0); 3405552f7358SJed Brown } 3406552f7358SJed Brown 3407552f7358SJed Brown #undef __FUNCT__ 3408552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 3409552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 3410552f7358SJed Brown { 341182f516ccSBarry Smith MPI_Comm comm; 3412552f7358SJed Brown PetscInt dim = 2; 3413552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 3414552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 3415552f7358SJed Brown struct triangulateio in; 3416552f7358SJed Brown struct triangulateio out; 3417552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 3418552f7358SJed Brown PetscMPIInt rank; 3419552f7358SJed Brown PetscErrorCode ierr; 3420552f7358SJed Brown 3421552f7358SJed Brown PetscFunctionBegin; 342282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3423552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3424552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3425552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3426552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 34270d644c17SKarl Rupp 3428552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3429552f7358SJed Brown if (in.numberofpoints > 0) { 3430552f7358SJed Brown PetscSection coordSection; 3431552f7358SJed Brown Vec coordinates; 3432552f7358SJed Brown PetscScalar *array; 3433552f7358SJed Brown 3434552f7358SJed Brown ierr = PetscMalloc(in.numberofpoints*dim * sizeof(double), &in.pointlist);CHKERRQ(ierr); 3435552f7358SJed Brown ierr = PetscMalloc(in.numberofpoints * sizeof(int), &in.pointmarkerlist);CHKERRQ(ierr); 3436552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 3437552f7358SJed Brown ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3438552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3439552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3440552f7358SJed Brown const PetscInt idx = v - vStart; 3441552f7358SJed Brown PetscInt off, d; 3442552f7358SJed Brown 3443552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3444552f7358SJed Brown for (d = 0; d < dim; ++d) { 3445552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3446552f7358SJed Brown } 3447552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3448552f7358SJed Brown } 3449552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3450552f7358SJed Brown } 3451552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 3452552f7358SJed Brown in.numberofsegments = eEnd - eStart; 3453552f7358SJed Brown if (in.numberofsegments > 0) { 3454552f7358SJed Brown ierr = PetscMalloc(in.numberofsegments*2 * sizeof(int), &in.segmentlist);CHKERRQ(ierr); 3455552f7358SJed Brown ierr = PetscMalloc(in.numberofsegments * sizeof(int), &in.segmentmarkerlist);CHKERRQ(ierr); 3456552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 3457552f7358SJed Brown const PetscInt idx = e - eStart; 3458552f7358SJed Brown const PetscInt *cone; 3459552f7358SJed Brown 3460552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 34610d644c17SKarl Rupp 3462552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 3463552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 34640d644c17SKarl Rupp 3465552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 3466552f7358SJed Brown } 3467552f7358SJed Brown } 3468552f7358SJed Brown #if 0 /* Do not currently support holes */ 3469552f7358SJed Brown PetscReal *holeCoords; 3470552f7358SJed Brown PetscInt h, d; 3471552f7358SJed Brown 3472552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3473552f7358SJed Brown if (in.numberofholes > 0) { 3474552f7358SJed Brown ierr = PetscMalloc(in.numberofholes*dim * sizeof(double), &in.holelist);CHKERRQ(ierr); 3475552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3476552f7358SJed Brown for (d = 0; d < dim; ++d) { 3477552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3478552f7358SJed Brown } 3479552f7358SJed Brown } 3480552f7358SJed Brown } 3481552f7358SJed Brown #endif 3482552f7358SJed Brown if (!rank) { 3483552f7358SJed Brown char args[32]; 3484552f7358SJed Brown 3485552f7358SJed Brown /* Take away 'Q' for verbose output */ 3486552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3487552f7358SJed Brown if (createConvexHull) { 3488552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 3489552f7358SJed Brown } 3490552f7358SJed Brown if (constrained) { 3491552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 3492552f7358SJed Brown } 34930298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3494552f7358SJed Brown } 3495552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3496552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3497552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3498552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3499552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 3500552f7358SJed Brown 3501552f7358SJed Brown { 3502552f7358SJed Brown const PetscInt numCorners = 3; 3503552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3504552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3505552f7358SJed Brown const int *cells = out.trianglelist; 3506552f7358SJed Brown const double *meshCoords = out.pointlist; 3507552f7358SJed Brown 35080fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3509552f7358SJed Brown /* Set labels */ 3510552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3511552f7358SJed Brown if (out.pointmarkerlist[v]) { 3512552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3513552f7358SJed Brown } 3514552f7358SJed Brown } 3515552f7358SJed Brown if (interpolate) { 3516552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3517552f7358SJed Brown if (out.edgemarkerlist[e]) { 3518552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3519552f7358SJed Brown const PetscInt *edges; 3520552f7358SJed Brown PetscInt numEdges; 3521552f7358SJed Brown 3522552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3523552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3524552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3525552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3526552f7358SJed Brown } 3527552f7358SJed Brown } 3528552f7358SJed Brown } 3529552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3530552f7358SJed Brown } 3531552f7358SJed Brown #if 0 /* Do not currently support holes */ 3532552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3533552f7358SJed Brown #endif 3534552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3535552f7358SJed Brown PetscFunctionReturn(0); 3536552f7358SJed Brown } 3537552f7358SJed Brown 3538552f7358SJed Brown #undef __FUNCT__ 3539552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 3540552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 3541552f7358SJed Brown { 354282f516ccSBarry Smith MPI_Comm comm; 3543552f7358SJed Brown PetscInt dim = 2; 3544552f7358SJed Brown struct triangulateio in; 3545552f7358SJed Brown struct triangulateio out; 3546552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3547552f7358SJed Brown PetscMPIInt rank; 3548552f7358SJed Brown PetscErrorCode ierr; 3549552f7358SJed Brown 3550552f7358SJed Brown PetscFunctionBegin; 355182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3552552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3553552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3554552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3555552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3556552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3557552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 35580d644c17SKarl Rupp 3559552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3560552f7358SJed Brown if (in.numberofpoints > 0) { 3561552f7358SJed Brown PetscSection coordSection; 3562552f7358SJed Brown Vec coordinates; 3563552f7358SJed Brown PetscScalar *array; 3564552f7358SJed Brown 3565552f7358SJed Brown ierr = PetscMalloc(in.numberofpoints*dim * sizeof(double), &in.pointlist);CHKERRQ(ierr); 3566552f7358SJed Brown ierr = PetscMalloc(in.numberofpoints * sizeof(int), &in.pointmarkerlist);CHKERRQ(ierr); 3567552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3568552f7358SJed Brown ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3569552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3570552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3571552f7358SJed Brown const PetscInt idx = v - vStart; 3572552f7358SJed Brown PetscInt off, d; 3573552f7358SJed Brown 3574552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3575552f7358SJed Brown for (d = 0; d < dim; ++d) { 3576552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3577552f7358SJed Brown } 3578552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3579552f7358SJed Brown } 3580552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3581552f7358SJed Brown } 3582552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 35830d644c17SKarl Rupp 3584552f7358SJed Brown in.numberofcorners = 3; 3585552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 35860d644c17SKarl Rupp 3587552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 3588552f7358SJed Brown if (in.numberoftriangles > 0) { 3589552f7358SJed Brown ierr = PetscMalloc(in.numberoftriangles*in.numberofcorners * sizeof(int), &in.trianglelist);CHKERRQ(ierr); 3590552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3591552f7358SJed Brown const PetscInt idx = c - cStart; 35920298fd71SBarry Smith PetscInt *closure = NULL; 3593552f7358SJed Brown PetscInt closureSize; 3594552f7358SJed Brown 3595552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3596552f7358SJed 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); 3597552f7358SJed Brown for (v = 0; v < 3; ++v) { 3598552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 3599552f7358SJed Brown } 3600552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3601552f7358SJed Brown } 3602552f7358SJed Brown } 3603552f7358SJed Brown /* TODO: Segment markers are missing on input */ 3604552f7358SJed Brown #if 0 /* Do not currently support holes */ 3605552f7358SJed Brown PetscReal *holeCoords; 3606552f7358SJed Brown PetscInt h, d; 3607552f7358SJed Brown 3608552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3609552f7358SJed Brown if (in.numberofholes > 0) { 3610552f7358SJed Brown ierr = PetscMalloc(in.numberofholes*dim * sizeof(double), &in.holelist);CHKERRQ(ierr); 3611552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3612552f7358SJed Brown for (d = 0; d < dim; ++d) { 3613552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3614552f7358SJed Brown } 3615552f7358SJed Brown } 3616552f7358SJed Brown } 3617552f7358SJed Brown #endif 3618552f7358SJed Brown if (!rank) { 3619552f7358SJed Brown char args[32]; 3620552f7358SJed Brown 3621552f7358SJed Brown /* Take away 'Q' for verbose output */ 3622552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 36230298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3624552f7358SJed Brown } 3625552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3626552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3627552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3628552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3629552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3630552f7358SJed Brown 3631552f7358SJed Brown { 3632552f7358SJed Brown const PetscInt numCorners = 3; 3633552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3634552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3635552f7358SJed Brown const int *cells = out.trianglelist; 3636552f7358SJed Brown const double *meshCoords = out.pointlist; 3637552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3638552f7358SJed Brown 36390fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3640552f7358SJed Brown /* Set labels */ 3641552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3642552f7358SJed Brown if (out.pointmarkerlist[v]) { 3643552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3644552f7358SJed Brown } 3645552f7358SJed Brown } 3646552f7358SJed Brown if (interpolate) { 3647552f7358SJed Brown PetscInt e; 3648552f7358SJed Brown 3649552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3650552f7358SJed Brown if (out.edgemarkerlist[e]) { 3651552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3652552f7358SJed Brown const PetscInt *edges; 3653552f7358SJed Brown PetscInt numEdges; 3654552f7358SJed Brown 3655552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3656552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3657552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3658552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3659552f7358SJed Brown } 3660552f7358SJed Brown } 3661552f7358SJed Brown } 3662552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3663552f7358SJed Brown } 3664552f7358SJed Brown #if 0 /* Do not currently support holes */ 3665552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3666552f7358SJed Brown #endif 3667552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3668552f7358SJed Brown PetscFunctionReturn(0); 3669552f7358SJed Brown } 3670552f7358SJed Brown #endif 3671552f7358SJed Brown 3672519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3673552f7358SJed Brown #include <tetgen.h> 3674552f7358SJed Brown #undef __FUNCT__ 3675552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3676552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3677552f7358SJed Brown { 367882f516ccSBarry Smith MPI_Comm comm; 3679552f7358SJed Brown const PetscInt dim = 3; 3680552f7358SJed Brown ::tetgenio in; 3681552f7358SJed Brown ::tetgenio out; 3682552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3683552f7358SJed Brown PetscMPIInt rank; 3684552f7358SJed Brown PetscErrorCode ierr; 3685552f7358SJed Brown 3686552f7358SJed Brown PetscFunctionBegin; 368782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3688552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3689552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3690552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3691552f7358SJed Brown if (in.numberofpoints > 0) { 3692552f7358SJed Brown PetscSection coordSection; 3693552f7358SJed Brown Vec coordinates; 3694552f7358SJed Brown PetscScalar *array; 3695552f7358SJed Brown 3696552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3697552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 36980d644c17SKarl Rupp 3699552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 3700552f7358SJed Brown ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3701552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3702552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3703552f7358SJed Brown const PetscInt idx = v - vStart; 3704552f7358SJed Brown PetscInt off, d; 3705552f7358SJed Brown 3706552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 37070d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3708552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3709552f7358SJed Brown } 3710552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3711552f7358SJed Brown } 3712552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 37130d644c17SKarl Rupp 3714552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3715552f7358SJed Brown if (in.numberoffacets > 0) { 3716552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3717552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3718552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3719552f7358SJed Brown const PetscInt idx = f - fStart; 37200298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3721552f7358SJed Brown 3722552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3723552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3724552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3725552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3726552f7358SJed Brown 3727552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3728552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3729552f7358SJed Brown const PetscInt point = points[p]; 37300d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3731552f7358SJed Brown } 3732552f7358SJed Brown 3733552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3734552f7358SJed Brown poly->numberofvertices = numVertices; 3735552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3736552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3737552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3738552f7358SJed Brown poly->vertexlist[v] = vIdx; 3739552f7358SJed Brown } 3740552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3741552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3742552f7358SJed Brown } 3743552f7358SJed Brown } 3744552f7358SJed Brown if (!rank) { 3745552f7358SJed Brown char args[32]; 3746552f7358SJed Brown 3747552f7358SJed Brown /* Take away 'Q' for verbose output */ 3748552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3749552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3750552f7358SJed Brown } 3751552f7358SJed Brown { 3752552f7358SJed Brown const PetscInt numCorners = 4; 3753552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3754552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3755552f7358SJed Brown const double *meshCoords = out.pointlist; 37561d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3757552f7358SJed Brown 37589db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 37590fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3760552f7358SJed Brown /* Set labels */ 3761552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3762552f7358SJed Brown if (out.pointmarkerlist[v]) { 3763552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3764552f7358SJed Brown } 3765552f7358SJed Brown } 3766552f7358SJed Brown if (interpolate) { 3767552f7358SJed Brown PetscInt e; 3768552f7358SJed Brown 3769552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3770552f7358SJed Brown if (out.edgemarkerlist[e]) { 3771552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3772552f7358SJed Brown const PetscInt *edges; 3773552f7358SJed Brown PetscInt numEdges; 3774552f7358SJed Brown 3775552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3776552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3777552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3778552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3779552f7358SJed Brown } 3780552f7358SJed Brown } 3781552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3782552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3783552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3784552f7358SJed Brown const PetscInt *faces; 3785552f7358SJed Brown PetscInt numFaces; 3786552f7358SJed Brown 3787552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3788552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3789552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3790552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3791552f7358SJed Brown } 3792552f7358SJed Brown } 3793552f7358SJed Brown } 3794552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3795552f7358SJed Brown } 3796552f7358SJed Brown PetscFunctionReturn(0); 3797552f7358SJed Brown } 3798552f7358SJed Brown 3799552f7358SJed Brown #undef __FUNCT__ 3800552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3801552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3802552f7358SJed Brown { 380382f516ccSBarry Smith MPI_Comm comm; 3804552f7358SJed Brown const PetscInt dim = 3; 3805552f7358SJed Brown ::tetgenio in; 3806552f7358SJed Brown ::tetgenio out; 3807552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3808552f7358SJed Brown PetscMPIInt rank; 3809552f7358SJed Brown PetscErrorCode ierr; 3810552f7358SJed Brown 3811552f7358SJed Brown PetscFunctionBegin; 381282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3813552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3814552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3815552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3816552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 38170d644c17SKarl Rupp 3818552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3819552f7358SJed Brown if (in.numberofpoints > 0) { 3820552f7358SJed Brown PetscSection coordSection; 3821552f7358SJed Brown Vec coordinates; 3822552f7358SJed Brown PetscScalar *array; 3823552f7358SJed Brown 3824552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3825552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 38260d644c17SKarl Rupp 3827552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 3828552f7358SJed Brown ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3829552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3830552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3831552f7358SJed Brown const PetscInt idx = v - vStart; 3832552f7358SJed Brown PetscInt off, d; 3833552f7358SJed Brown 3834552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 38350d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3836552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3837552f7358SJed Brown } 3838552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3839552f7358SJed Brown } 3840552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 38410d644c17SKarl Rupp 3842552f7358SJed Brown in.numberofcorners = 4; 3843552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3844552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3845552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3846552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3847552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3848552f7358SJed Brown const PetscInt idx = c - cStart; 38490298fd71SBarry Smith PetscInt *closure = NULL; 3850552f7358SJed Brown PetscInt closureSize; 3851552f7358SJed Brown 3852552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3853552f7358SJed Brown if ((closureSize != 5) && (closureSize != 15)) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Mesh has cell which is not a tetrahedron, %D vertices in closure", closureSize); 3854552f7358SJed Brown for (v = 0; v < 4; ++v) { 3855552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3856552f7358SJed Brown } 3857552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3858552f7358SJed Brown } 3859552f7358SJed Brown } 386019436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3861552f7358SJed Brown if (!rank) { 3862552f7358SJed Brown char args[32]; 3863552f7358SJed Brown 3864552f7358SJed Brown /* Take away 'Q' for verbose output */ 386519436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3866552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3867552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3868552f7358SJed Brown } 3869552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3870552f7358SJed Brown 3871552f7358SJed Brown { 3872552f7358SJed Brown const PetscInt numCorners = 4; 3873552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3874552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3875552f7358SJed Brown const double *meshCoords = out.pointlist; 38761d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 38771d4b4d7bSJed Brown 3878552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3879552f7358SJed Brown 38809db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 38810fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3882552f7358SJed Brown /* Set labels */ 3883552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3884552f7358SJed Brown if (out.pointmarkerlist[v]) { 3885552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3886552f7358SJed Brown } 3887552f7358SJed Brown } 3888552f7358SJed Brown if (interpolate) { 3889552f7358SJed Brown PetscInt e, f; 3890552f7358SJed Brown 3891552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3892552f7358SJed Brown if (out.edgemarkerlist[e]) { 3893552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3894552f7358SJed Brown const PetscInt *edges; 3895552f7358SJed Brown PetscInt numEdges; 3896552f7358SJed Brown 3897552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3898552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3899552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3900552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3901552f7358SJed Brown } 3902552f7358SJed Brown } 3903552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3904552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3905552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3906552f7358SJed Brown const PetscInt *faces; 3907552f7358SJed Brown PetscInt numFaces; 3908552f7358SJed Brown 3909552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3910552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3911552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3912552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3913552f7358SJed Brown } 3914552f7358SJed Brown } 3915552f7358SJed Brown } 3916552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3917552f7358SJed Brown } 3918552f7358SJed Brown PetscFunctionReturn(0); 3919552f7358SJed Brown } 3920552f7358SJed Brown #endif 3921552f7358SJed Brown 3922519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3923552f7358SJed Brown #include "ctetgen.h" 3924552f7358SJed Brown 3925552f7358SJed Brown #undef __FUNCT__ 3926552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3927552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3928552f7358SJed Brown { 392982f516ccSBarry Smith MPI_Comm comm; 3930552f7358SJed Brown const PetscInt dim = 3; 3931552f7358SJed Brown PLC *in, *out; 3932552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3933552f7358SJed Brown PetscMPIInt rank; 3934552f7358SJed Brown PetscErrorCode ierr; 3935552f7358SJed Brown 3936552f7358SJed Brown PetscFunctionBegin; 393782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 39380298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3939552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3940552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3941552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3942552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 39430d644c17SKarl Rupp 3944552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3945552f7358SJed Brown if (in->numberofpoints > 0) { 3946552f7358SJed Brown PetscSection coordSection; 3947552f7358SJed Brown Vec coordinates; 3948552f7358SJed Brown PetscScalar *array; 3949552f7358SJed Brown 3950552f7358SJed Brown ierr = PetscMalloc(in->numberofpoints*dim * sizeof(PetscReal), &in->pointlist);CHKERRQ(ierr); 3951552f7358SJed Brown ierr = PetscMalloc(in->numberofpoints * sizeof(int), &in->pointmarkerlist);CHKERRQ(ierr); 3952552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 3953552f7358SJed Brown ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3954552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3955552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3956552f7358SJed Brown const PetscInt idx = v - vStart; 3957552f7358SJed Brown PetscInt off, d, m; 3958552f7358SJed Brown 3959552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3960552f7358SJed Brown for (d = 0; d < dim; ++d) { 3961552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3962552f7358SJed Brown } 3963552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 39640d644c17SKarl Rupp 3965552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3966552f7358SJed Brown } 3967552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3968552f7358SJed Brown } 3969552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 39700d644c17SKarl Rupp 3971552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3972552f7358SJed Brown if (in->numberoffacets > 0) { 3973552f7358SJed Brown ierr = PetscMalloc(in->numberoffacets * sizeof(facet), &in->facetlist);CHKERRQ(ierr); 3974552f7358SJed Brown ierr = PetscMalloc(in->numberoffacets * sizeof(int), &in->facetmarkerlist);CHKERRQ(ierr); 3975552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3976552f7358SJed Brown const PetscInt idx = f - fStart; 39770298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3978552f7358SJed Brown polygon *poly; 3979552f7358SJed Brown 3980552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 39810d644c17SKarl Rupp 3982552f7358SJed Brown ierr = PetscMalloc(in->facetlist[idx].numberofpolygons * sizeof(polygon), &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 39830d644c17SKarl Rupp 3984552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 39850298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3986552f7358SJed Brown 3987552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3988552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3989552f7358SJed Brown const PetscInt point = points[p]; 39900d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3991552f7358SJed Brown } 3992552f7358SJed Brown 3993552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3994552f7358SJed Brown poly->numberofvertices = numVertices; 3995552f7358SJed Brown ierr = PetscMalloc(poly->numberofvertices * sizeof(int), &poly->vertexlist);CHKERRQ(ierr); 3996552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3997552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3998552f7358SJed Brown poly->vertexlist[v] = vIdx; 3999552f7358SJed Brown } 4000552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 4001552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 4002552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4003552f7358SJed Brown } 4004552f7358SJed Brown } 4005552f7358SJed Brown if (!rank) { 4006552f7358SJed Brown TetGenOpts t; 4007552f7358SJed Brown 4008552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 4009552f7358SJed Brown t.in = boundary; /* Should go away */ 4010552f7358SJed Brown t.plc = 1; 4011552f7358SJed Brown t.quality = 1; 4012552f7358SJed Brown t.edgesout = 1; 4013552f7358SJed Brown t.zeroindex = 1; 4014552f7358SJed Brown t.quiet = 1; 4015552f7358SJed Brown t.verbose = verbose; 4016552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4017552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4018552f7358SJed Brown } 4019552f7358SJed Brown { 4020552f7358SJed Brown const PetscInt numCorners = 4; 4021552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4022552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4023552f7358SJed Brown const double *meshCoords = out->pointlist; 40241d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4025552f7358SJed Brown 40269db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 40270fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 4028552f7358SJed Brown /* Set labels */ 4029552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4030552f7358SJed Brown if (out->pointmarkerlist[v]) { 4031552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4032552f7358SJed Brown } 4033552f7358SJed Brown } 4034552f7358SJed Brown if (interpolate) { 4035552f7358SJed Brown PetscInt e; 4036552f7358SJed Brown 4037552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4038552f7358SJed Brown if (out->edgemarkerlist[e]) { 4039552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4040552f7358SJed Brown const PetscInt *edges; 4041552f7358SJed Brown PetscInt numEdges; 4042552f7358SJed Brown 4043552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4044552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4045552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4046552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4047552f7358SJed Brown } 4048552f7358SJed Brown } 4049552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4050552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4051552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4052552f7358SJed Brown const PetscInt *faces; 4053552f7358SJed Brown PetscInt numFaces; 4054552f7358SJed Brown 4055552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4056552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4057552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4058552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4059552f7358SJed Brown } 4060552f7358SJed Brown } 4061552f7358SJed Brown } 4062552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 4063552f7358SJed Brown } 4064552f7358SJed Brown 4065552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4066552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4067552f7358SJed Brown PetscFunctionReturn(0); 4068552f7358SJed Brown } 4069552f7358SJed Brown 4070552f7358SJed Brown #undef __FUNCT__ 4071552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 4072552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 4073552f7358SJed Brown { 407482f516ccSBarry Smith MPI_Comm comm; 4075552f7358SJed Brown const PetscInt dim = 3; 4076552f7358SJed Brown PLC *in, *out; 4077552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 4078552f7358SJed Brown PetscMPIInt rank; 4079552f7358SJed Brown PetscErrorCode ierr; 4080552f7358SJed Brown 4081552f7358SJed Brown PetscFunctionBegin; 408282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 40830298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4084552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4085552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4086552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 4087552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 4088552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4089552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 40900d644c17SKarl Rupp 4091552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4092552f7358SJed Brown if (in->numberofpoints > 0) { 4093552f7358SJed Brown PetscSection coordSection; 4094552f7358SJed Brown Vec coordinates; 4095552f7358SJed Brown PetscScalar *array; 4096552f7358SJed Brown 4097552f7358SJed Brown ierr = PetscMalloc(in->numberofpoints*dim * sizeof(PetscReal), &in->pointlist);CHKERRQ(ierr); 4098552f7358SJed Brown ierr = PetscMalloc(in->numberofpoints * sizeof(int), &in->pointmarkerlist);CHKERRQ(ierr); 4099552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 4100552f7358SJed Brown ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 4101552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4102552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4103552f7358SJed Brown const PetscInt idx = v - vStart; 4104552f7358SJed Brown PetscInt off, d, m; 4105552f7358SJed Brown 4106552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4107552f7358SJed Brown for (d = 0; d < dim; ++d) { 4108552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4109552f7358SJed Brown } 4110552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 41110d644c17SKarl Rupp 4112552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4113552f7358SJed Brown } 4114552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4115552f7358SJed Brown } 4116552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 41170d644c17SKarl Rupp 4118552f7358SJed Brown in->numberofcorners = 4; 4119552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 4120552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 4121552f7358SJed Brown if (in->numberoftetrahedra > 0) { 4122552f7358SJed Brown ierr = PetscMalloc(in->numberoftetrahedra*in->numberofcorners * sizeof(int), &in->tetrahedronlist);CHKERRQ(ierr); 4123552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4124552f7358SJed Brown const PetscInt idx = c - cStart; 41250298fd71SBarry Smith PetscInt *closure = NULL; 4126552f7358SJed Brown PetscInt closureSize; 4127552f7358SJed Brown 4128552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4129552f7358SJed 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); 4130552f7358SJed Brown for (v = 0; v < 4; ++v) { 4131552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4132552f7358SJed Brown } 4133552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4134552f7358SJed Brown } 4135552f7358SJed Brown } 4136552f7358SJed Brown if (!rank) { 4137552f7358SJed Brown TetGenOpts t; 4138552f7358SJed Brown 4139552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 41400d644c17SKarl Rupp 4141552f7358SJed Brown t.in = dm; /* Should go away */ 4142552f7358SJed Brown t.refine = 1; 4143552f7358SJed Brown t.varvolume = 1; 4144552f7358SJed Brown t.quality = 1; 4145552f7358SJed Brown t.edgesout = 1; 4146552f7358SJed Brown t.zeroindex = 1; 4147552f7358SJed Brown t.quiet = 1; 4148552f7358SJed Brown t.verbose = verbose; /* Change this */ 41490d644c17SKarl Rupp 4150552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4151552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4152552f7358SJed Brown } 4153552f7358SJed Brown { 4154552f7358SJed Brown const PetscInt numCorners = 4; 4155552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4156552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4157552f7358SJed Brown const double *meshCoords = out->pointlist; 41581d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4159552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4160552f7358SJed Brown 41619db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 41620fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4163552f7358SJed Brown /* Set labels */ 4164552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4165552f7358SJed Brown if (out->pointmarkerlist[v]) { 4166552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4167552f7358SJed Brown } 4168552f7358SJed Brown } 4169552f7358SJed Brown if (interpolate) { 4170552f7358SJed Brown PetscInt e, f; 4171552f7358SJed Brown 4172552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4173552f7358SJed Brown if (out->edgemarkerlist[e]) { 4174552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4175552f7358SJed Brown const PetscInt *edges; 4176552f7358SJed Brown PetscInt numEdges; 4177552f7358SJed Brown 4178552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4179552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4180552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4181552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4182552f7358SJed Brown } 4183552f7358SJed Brown } 4184552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4185552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4186552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4187552f7358SJed Brown const PetscInt *faces; 4188552f7358SJed Brown PetscInt numFaces; 4189552f7358SJed Brown 4190552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4191552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4192552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4193552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4194552f7358SJed Brown } 4195552f7358SJed Brown } 4196552f7358SJed Brown } 4197552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4198552f7358SJed Brown } 4199552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4200552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4201552f7358SJed Brown PetscFunctionReturn(0); 4202552f7358SJed Brown } 4203552f7358SJed Brown #endif 4204552f7358SJed Brown 4205552f7358SJed Brown #undef __FUNCT__ 4206552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 4207552f7358SJed Brown /*@C 4208552f7358SJed Brown DMPlexGenerate - Generates a mesh. 4209552f7358SJed Brown 4210552f7358SJed Brown Not Collective 4211552f7358SJed Brown 4212552f7358SJed Brown Input Parameters: 4213552f7358SJed Brown + boundary - The DMPlex boundary object 4214552f7358SJed Brown . name - The mesh generation package name 4215552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 4216552f7358SJed Brown 4217552f7358SJed Brown Output Parameter: 4218552f7358SJed Brown . mesh - The DMPlex object 4219552f7358SJed Brown 4220552f7358SJed Brown Level: intermediate 4221552f7358SJed Brown 4222552f7358SJed Brown .keywords: mesh, elements 4223552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 4224552f7358SJed Brown @*/ 4225552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 4226552f7358SJed Brown { 4227552f7358SJed Brown PetscInt dim; 4228552f7358SJed Brown char genname[1024]; 4229552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4230552f7358SJed Brown PetscErrorCode ierr; 4231552f7358SJed Brown 4232552f7358SJed Brown PetscFunctionBegin; 4233552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 4234552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 4235552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 4236552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 42370d644c17SKarl Rupp if (flg) name = genname; 4238552f7358SJed Brown if (name) { 4239552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4240552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4241552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4242552f7358SJed Brown } 4243552f7358SJed Brown switch (dim) { 4244552f7358SJed Brown case 1: 4245552f7358SJed Brown if (!name || isTriangle) { 4246519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4247552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 4248552f7358SJed Brown #else 424982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 4250552f7358SJed Brown #endif 425182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4252552f7358SJed Brown break; 4253552f7358SJed Brown case 2: 4254552f7358SJed Brown if (!name || isCTetgen) { 4255519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4256552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4257552f7358SJed Brown #else 425882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4259552f7358SJed Brown #endif 4260552f7358SJed Brown } else if (isTetgen) { 4261519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4262552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4263552f7358SJed Brown #else 426482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4265552f7358SJed Brown #endif 426682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4267552f7358SJed Brown break; 4268552f7358SJed Brown default: 426982f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 4270552f7358SJed Brown } 4271552f7358SJed Brown PetscFunctionReturn(0); 4272552f7358SJed Brown } 4273552f7358SJed Brown 4274552f7358SJed Brown #undef __FUNCT__ 4275552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 4276552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 4277552f7358SJed Brown { 4278552f7358SJed Brown PetscReal refinementLimit; 4279552f7358SJed Brown PetscInt dim, cStart, cEnd; 42800298fd71SBarry Smith char genname[1024], *name = NULL; 4281552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4282552f7358SJed Brown PetscErrorCode ierr; 4283552f7358SJed Brown 4284552f7358SJed Brown PetscFunctionBegin; 4285552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 4286552f7358SJed Brown if (isUniform) { 4287552f7358SJed Brown CellRefiner cellRefiner; 4288552f7358SJed Brown 4289509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 4290509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 4291552f7358SJed Brown PetscFunctionReturn(0); 4292552f7358SJed Brown } 4293552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 4294552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 4295552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 4296552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 4297552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 42980d644c17SKarl Rupp if (flg) name = genname; 4299552f7358SJed Brown if (name) { 4300552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4301552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4302552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4303552f7358SJed Brown } 4304552f7358SJed Brown switch (dim) { 4305552f7358SJed Brown case 2: 4306552f7358SJed Brown if (!name || isTriangle) { 4307519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4308552f7358SJed Brown double *maxVolumes; 4309552f7358SJed Brown PetscInt c; 4310552f7358SJed Brown 4311552f7358SJed Brown ierr = PetscMalloc((cEnd - cStart) * sizeof(double), &maxVolumes);CHKERRQ(ierr); 43120d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4313552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 43146b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 4315552f7358SJed Brown #else 431682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 4317552f7358SJed Brown #endif 431882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4319552f7358SJed Brown break; 4320552f7358SJed Brown case 3: 4321552f7358SJed Brown if (!name || isCTetgen) { 4322519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4323552f7358SJed Brown PetscReal *maxVolumes; 4324552f7358SJed Brown PetscInt c; 4325552f7358SJed Brown 4326552f7358SJed Brown ierr = PetscMalloc((cEnd - cStart) * sizeof(PetscReal), &maxVolumes);CHKERRQ(ierr); 43270d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4328552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4329552f7358SJed Brown #else 433082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4331552f7358SJed Brown #endif 4332552f7358SJed Brown } else if (isTetgen) { 4333519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4334552f7358SJed Brown double *maxVolumes; 4335552f7358SJed Brown PetscInt c; 4336552f7358SJed Brown 4337552f7358SJed Brown ierr = PetscMalloc((cEnd - cStart) * sizeof(double), &maxVolumes);CHKERRQ(ierr); 43380d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4339552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4340552f7358SJed Brown #else 434182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4342552f7358SJed Brown #endif 434382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4344552f7358SJed Brown break; 4345552f7358SJed Brown default: 434682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 4347552f7358SJed Brown } 4348552f7358SJed Brown PetscFunctionReturn(0); 4349552f7358SJed Brown } 4350552f7358SJed Brown 4351552f7358SJed Brown #undef __FUNCT__ 4352aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 4353552f7358SJed Brown /*@ 4354aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 4355552f7358SJed Brown 4356552f7358SJed Brown Not Collective 4357552f7358SJed Brown 4358aa50250dSMatthew G. Knepley Input Parameter: 4359552f7358SJed Brown . dm - The DMPlex object 4360552f7358SJed Brown 4361aa50250dSMatthew G. Knepley Output Parameter: 4362aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 4363552f7358SJed Brown 4364552f7358SJed Brown Level: developer 4365552f7358SJed Brown 4366aa50250dSMatthew G. Knepley .keywords: mesh, points 4367aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4368aa50250dSMatthew G. Knepley @*/ 4369aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 4370aa50250dSMatthew G. Knepley { 4371aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4372aa50250dSMatthew G. Knepley PetscErrorCode ierr; 4373aa50250dSMatthew G. Knepley 4374aa50250dSMatthew G. Knepley PetscFunctionBegin; 4375aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4376aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 4377aa50250dSMatthew G. Knepley if (!mesh->depthLabel) { 4378aa50250dSMatthew G. Knepley ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr); 4379aa50250dSMatthew G. Knepley } 4380aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 4381aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 4382aa50250dSMatthew G. Knepley } 4383aa50250dSMatthew G. Knepley 4384aa50250dSMatthew G. Knepley #undef __FUNCT__ 4385aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 4386aa50250dSMatthew G. Knepley /*@ 4387aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 4388aa50250dSMatthew G. Knepley 4389aa50250dSMatthew G. Knepley Not Collective 4390aa50250dSMatthew G. Knepley 4391aa50250dSMatthew G. Knepley Input Parameter: 4392aa50250dSMatthew G. Knepley . dm - The DMPlex object 4393aa50250dSMatthew G. Knepley 4394aa50250dSMatthew G. Knepley Output Parameter: 4395aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 4396aa50250dSMatthew G. Knepley 4397aa50250dSMatthew G. Knepley Level: developer 4398552f7358SJed Brown 4399552f7358SJed Brown .keywords: mesh, points 4400aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4401552f7358SJed Brown @*/ 4402552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 4403552f7358SJed Brown { 4404aa50250dSMatthew G. Knepley DMLabel label; 4405aa50250dSMatthew G. Knepley PetscInt d = 0; 4406552f7358SJed Brown PetscErrorCode ierr; 4407552f7358SJed Brown 4408552f7358SJed Brown PetscFunctionBegin; 4409552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4410552f7358SJed Brown PetscValidPointer(depth, 2); 4411aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4412aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 4413552f7358SJed Brown *depth = d-1; 4414552f7358SJed Brown PetscFunctionReturn(0); 4415552f7358SJed Brown } 4416552f7358SJed Brown 4417552f7358SJed Brown #undef __FUNCT__ 4418552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 4419552f7358SJed Brown /*@ 4420552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 4421552f7358SJed Brown 4422552f7358SJed Brown Not Collective 4423552f7358SJed Brown 4424552f7358SJed Brown Input Parameters: 4425552f7358SJed Brown + dm - The DMPlex object 4426552f7358SJed Brown - stratumValue - The requested depth 4427552f7358SJed Brown 4428552f7358SJed Brown Output Parameters: 4429552f7358SJed Brown + start - The first point at this depth 4430552f7358SJed Brown - end - One beyond the last point at this depth 4431552f7358SJed Brown 4432552f7358SJed Brown Level: developer 4433552f7358SJed Brown 4434552f7358SJed Brown .keywords: mesh, points 4435552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 4436552f7358SJed Brown @*/ 44370adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 44380adebc6cSBarry Smith { 4439aa50250dSMatthew G. Knepley DMLabel label; 4440552f7358SJed Brown PetscInt depth; 4441552f7358SJed Brown PetscErrorCode ierr; 4442552f7358SJed Brown 4443552f7358SJed Brown PetscFunctionBegin; 4444552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4445552f7358SJed Brown if (stratumValue < 0) { 4446552f7358SJed Brown ierr = DMPlexGetChart(dm, start, end);CHKERRQ(ierr); 4447552f7358SJed Brown PetscFunctionReturn(0); 4448552f7358SJed Brown } else { 4449552f7358SJed Brown PetscInt pStart, pEnd; 4450552f7358SJed Brown 44510d644c17SKarl Rupp if (start) *start = 0; 44520d644c17SKarl Rupp if (end) *end = 0; 4453552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 44540d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 4455552f7358SJed Brown } 4456aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4457aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 4458552f7358SJed Brown /* Strata are sorted and contiguous -- In addition, depth/height is either full or 1-level */ 4459552f7358SJed Brown depth = stratumValue; 4460aa50250dSMatthew G. Knepley if ((depth < 0) || (depth >= label->numStrata)) { 44610d644c17SKarl Rupp if (start) *start = 0; 44620d644c17SKarl Rupp if (end) *end = 0; 4463552f7358SJed Brown } else { 4464aa50250dSMatthew G. Knepley if (start) *start = label->points[label->stratumOffsets[depth]]; 4465aa50250dSMatthew G. Knepley if (end) *end = label->points[label->stratumOffsets[depth]+label->stratumSizes[depth]-1]+1; 4466552f7358SJed Brown } 4467552f7358SJed Brown PetscFunctionReturn(0); 4468552f7358SJed Brown } 4469552f7358SJed Brown 4470552f7358SJed Brown #undef __FUNCT__ 4471552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4472552f7358SJed Brown /*@ 4473552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4474552f7358SJed Brown 4475552f7358SJed Brown Not Collective 4476552f7358SJed Brown 4477552f7358SJed Brown Input Parameters: 4478552f7358SJed Brown + dm - The DMPlex object 4479552f7358SJed Brown - stratumValue - The requested height 4480552f7358SJed Brown 4481552f7358SJed Brown Output Parameters: 4482552f7358SJed Brown + start - The first point at this height 4483552f7358SJed Brown - end - One beyond the last point at this height 4484552f7358SJed Brown 4485552f7358SJed Brown Level: developer 4486552f7358SJed Brown 4487552f7358SJed Brown .keywords: mesh, points 4488552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4489552f7358SJed Brown @*/ 44900adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 44910adebc6cSBarry Smith { 4492aa50250dSMatthew G. Knepley DMLabel label; 4493552f7358SJed Brown PetscInt depth; 4494552f7358SJed Brown PetscErrorCode ierr; 4495552f7358SJed Brown 4496552f7358SJed Brown PetscFunctionBegin; 4497552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4498552f7358SJed Brown if (stratumValue < 0) { 4499552f7358SJed Brown ierr = DMPlexGetChart(dm, start, end);CHKERRQ(ierr); 4500552f7358SJed Brown } else { 4501552f7358SJed Brown PetscInt pStart, pEnd; 4502552f7358SJed Brown 45030d644c17SKarl Rupp if (start) *start = 0; 45040d644c17SKarl Rupp if (end) *end = 0; 4505552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 45060d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 4507552f7358SJed Brown } 4508aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4509aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 4510552f7358SJed Brown /* Strata are sorted and contiguous -- In addition, depth/height is either full or 1-level */ 4511aa50250dSMatthew G. Knepley depth = label->stratumValues[label->numStrata-1] - stratumValue; 4512aa50250dSMatthew G. Knepley if ((depth < 0) || (depth >= label->numStrata)) { 45130d644c17SKarl Rupp if (start) *start = 0; 45140d644c17SKarl Rupp if (end) *end = 0; 4515552f7358SJed Brown } else { 4516aa50250dSMatthew G. Knepley if (start) *start = label->points[label->stratumOffsets[depth]]; 4517aa50250dSMatthew G. Knepley if (end) *end = label->points[label->stratumOffsets[depth]+label->stratumSizes[depth]-1]+1; 4518552f7358SJed Brown } 4519552f7358SJed Brown PetscFunctionReturn(0); 4520552f7358SJed Brown } 4521552f7358SJed Brown 4522552f7358SJed Brown #undef __FUNCT__ 4523552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4524552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4525a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4526a6dfd86eSKarl Rupp { 4527552f7358SJed Brown PetscInt *numDofTot; 4528*916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4529*916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4530552f7358SJed Brown PetscErrorCode ierr; 4531552f7358SJed Brown 4532552f7358SJed Brown PetscFunctionBegin; 4533552f7358SJed Brown ierr = PetscMalloc((dim+1) * sizeof(PetscInt), &numDofTot);CHKERRQ(ierr); 4534552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4535552f7358SJed Brown numDofTot[d] = 0; 45360d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4537552f7358SJed Brown } 453882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4539552f7358SJed Brown if (numFields > 0) { 4540552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4541552f7358SJed Brown if (numComp) { 4542552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4543552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4544552f7358SJed Brown } 4545552f7358SJed Brown } 4546552f7358SJed Brown } 4547552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4548552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4549*916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4550*916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4551*916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4552*916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4553552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4554552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4555552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4556552f7358SJed Brown } 4557552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4558552f7358SJed Brown } 4559552f7358SJed Brown } 4560552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4561552f7358SJed Brown PetscFunctionReturn(0); 4562552f7358SJed Brown } 4563552f7358SJed Brown 4564552f7358SJed Brown #undef __FUNCT__ 4565552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4566552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4567552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4568552f7358SJed Brown */ 4569a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4570a6dfd86eSKarl Rupp { 4571552f7358SJed Brown PetscInt numFields; 4572552f7358SJed Brown PetscInt bc; 4573552f7358SJed Brown PetscErrorCode ierr; 4574552f7358SJed Brown 4575552f7358SJed Brown PetscFunctionBegin; 4576552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4577552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4578552f7358SJed Brown PetscInt field = 0; 4579552f7358SJed Brown const PetscInt *idx; 4580552f7358SJed Brown PetscInt n, i; 4581552f7358SJed Brown 45820d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4583552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4584552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4585552f7358SJed Brown for (i = 0; i < n; ++i) { 4586552f7358SJed Brown const PetscInt p = idx[i]; 4587552f7358SJed Brown PetscInt numConst = constDof; 4588552f7358SJed Brown 4589552f7358SJed Brown /* Constrain every dof on the point */ 4590552f7358SJed Brown if (numConst < 0) { 4591552f7358SJed Brown if (numFields) { 4592552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4593552f7358SJed Brown } else { 4594552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4595552f7358SJed Brown } 4596552f7358SJed Brown } 4597552f7358SJed Brown if (numFields) { 4598552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4599552f7358SJed Brown } 4600552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4601552f7358SJed Brown } 4602552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4603552f7358SJed Brown } 4604552f7358SJed Brown PetscFunctionReturn(0); 4605552f7358SJed Brown } 4606552f7358SJed Brown 4607552f7358SJed Brown #undef __FUNCT__ 4608552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4609552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 46100adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 46110adebc6cSBarry Smith { 4612552f7358SJed Brown PetscInt *maxConstraints; 4613552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4614552f7358SJed Brown PetscErrorCode ierr; 4615552f7358SJed Brown 4616552f7358SJed Brown PetscFunctionBegin; 4617552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4618552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4619552f7358SJed Brown ierr = PetscMalloc((numFields+1) * sizeof(PetscInt), &maxConstraints);CHKERRQ(ierr); 46200d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4621552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4622552f7358SJed Brown PetscInt cdof; 4623552f7358SJed Brown 4624552f7358SJed Brown if (numFields) { 4625552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4626552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4627552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4628552f7358SJed Brown } 4629552f7358SJed Brown } else { 4630552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4631552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4632552f7358SJed Brown } 4633552f7358SJed Brown } 4634552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4635552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4636552f7358SJed Brown } 4637552f7358SJed Brown if (maxConstraints[numFields]) { 4638552f7358SJed Brown PetscInt *indices; 4639552f7358SJed Brown 4640552f7358SJed Brown ierr = PetscMalloc(maxConstraints[numFields] * sizeof(PetscInt), &indices);CHKERRQ(ierr); 4641552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4642552f7358SJed Brown PetscInt cdof, d; 4643552f7358SJed Brown 4644552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4645552f7358SJed Brown if (cdof) { 4646552f7358SJed 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]); 4647552f7358SJed Brown if (numFields) { 4648552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4649552f7358SJed Brown 4650552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4651552f7358SJed Brown PetscInt cfdof, fdof; 4652552f7358SJed Brown 4653552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4654552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4655552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 46560d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4657552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 46580d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4659552f7358SJed Brown numConst += cfdof; 4660552f7358SJed Brown foff += fdof; 4661552f7358SJed Brown } 4662552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4663552f7358SJed Brown } else { 46640d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4665552f7358SJed Brown } 4666552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4667552f7358SJed Brown } 4668552f7358SJed Brown } 4669552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4670552f7358SJed Brown } 4671552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4672552f7358SJed Brown PetscFunctionReturn(0); 4673552f7358SJed Brown } 4674552f7358SJed Brown 4675552f7358SJed Brown #undef __FUNCT__ 4676552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4677552f7358SJed Brown /* Set the constrained field indices on each point */ 46780adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 46790adebc6cSBarry Smith { 4680552f7358SJed Brown const PetscInt *points, *indices; 4681552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4682552f7358SJed Brown PetscErrorCode ierr; 4683552f7358SJed Brown 4684552f7358SJed Brown PetscFunctionBegin; 4685552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4686552f7358SJed 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); 4687552f7358SJed Brown 4688552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4689552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4690552f7358SJed Brown if (!constraintIndices) { 4691552f7358SJed Brown PetscInt *idx, i; 4692552f7358SJed Brown 4693552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4694552f7358SJed Brown ierr = PetscMalloc(maxDof * sizeof(PetscInt), &idx);CHKERRQ(ierr); 46950d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4696552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4697552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4698552f7358SJed Brown } 4699552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4700552f7358SJed Brown } else { 4701552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4702552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4703552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4704552f7358SJed Brown PetscInt fcdof; 4705552f7358SJed Brown 4706552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 470782f516ccSBarry 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); 4708552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4709552f7358SJed Brown } 4710552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4711552f7358SJed Brown } 4712552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4713552f7358SJed Brown PetscFunctionReturn(0); 4714552f7358SJed Brown } 4715552f7358SJed Brown 4716552f7358SJed Brown #undef __FUNCT__ 4717552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4718552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 47190adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 47200adebc6cSBarry Smith { 4721552f7358SJed Brown PetscInt *indices; 4722552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4723552f7358SJed Brown PetscErrorCode ierr; 4724552f7358SJed Brown 4725552f7358SJed Brown PetscFunctionBegin; 4726552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4727552f7358SJed Brown ierr = PetscMalloc(maxDof * sizeof(PetscInt), &indices);CHKERRQ(ierr); 4728552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 472982f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4730552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4731552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4732552f7358SJed Brown PetscInt cdof, d; 4733552f7358SJed Brown 4734552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4735552f7358SJed Brown if (cdof) { 4736552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4737552f7358SJed Brown 4738552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4739552f7358SJed Brown const PetscInt *fcind; 4740552f7358SJed Brown PetscInt fdof, fcdof; 4741552f7358SJed Brown 4742552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4743552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4744552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4745552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 47460d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4747552f7358SJed Brown foff += fdof; 4748552f7358SJed Brown numConst += fcdof; 4749552f7358SJed Brown } 475082f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4751552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4752552f7358SJed Brown } 4753552f7358SJed Brown } 4754552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4755552f7358SJed Brown PetscFunctionReturn(0); 4756552f7358SJed Brown } 4757552f7358SJed Brown 4758552f7358SJed Brown #undef __FUNCT__ 4759552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4760552f7358SJed Brown /*@C 4761552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4762552f7358SJed Brown 4763552f7358SJed Brown Not Collective 4764552f7358SJed Brown 4765552f7358SJed Brown Input Parameters: 4766552f7358SJed Brown + dm - The DMPlex object 4767552f7358SJed Brown . dim - The spatial dimension of the problem 4768552f7358SJed Brown . numFields - The number of fields in the problem 4769552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4770552f7358SJed 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 4771552f7358SJed Brown . numBC - The number of boundary conditions 4772552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4773552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4774552f7358SJed Brown 4775552f7358SJed Brown Output Parameter: 4776552f7358SJed Brown . section - The PetscSection object 4777552f7358SJed Brown 4778552f7358SJed 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 4779552f7358SJed Brown nubmer of dof for field 0 on each edge. 4780552f7358SJed Brown 4781552f7358SJed Brown Level: developer 4782552f7358SJed Brown 47833813dfbdSMatthew G Knepley Fortran Notes: 47843813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 47853813dfbdSMatthew G Knepley 4786552f7358SJed Brown .keywords: mesh, elements 4787552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4788552f7358SJed Brown @*/ 4789a6dfd86eSKarl 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) 4790a6dfd86eSKarl Rupp { 4791552f7358SJed Brown PetscErrorCode ierr; 4792552f7358SJed Brown 4793552f7358SJed Brown PetscFunctionBegin; 4794552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4795552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4796552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4797552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4798552f7358SJed Brown { 4799552f7358SJed Brown PetscBool view = PETSC_FALSE; 4800552f7358SJed Brown 4801552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-section_view", &view);CHKERRQ(ierr); 4802552f7358SJed Brown if (view) {ierr = PetscSectionView(*section, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);} 4803552f7358SJed Brown } 4804552f7358SJed Brown PetscFunctionReturn(0); 4805552f7358SJed Brown } 4806552f7358SJed Brown 4807552f7358SJed Brown #undef __FUNCT__ 4808552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 48090adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 48100adebc6cSBarry Smith { 4811552f7358SJed Brown PetscSection section; 4812552f7358SJed Brown PetscErrorCode ierr; 4813552f7358SJed Brown 4814552f7358SJed Brown PetscFunctionBegin; 481538221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 481682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4817552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 48181d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4819552f7358SJed Brown PetscFunctionReturn(0); 4820552f7358SJed Brown } 4821552f7358SJed Brown 4822552f7358SJed Brown #undef __FUNCT__ 4823552f7358SJed Brown #define __FUNCT__ "DMPlexGetCoordinateSection" 4824552f7358SJed Brown /*@ 4825552f7358SJed Brown DMPlexGetCoordinateSection - Retrieve the layout of coordinate values over the mesh. 4826552f7358SJed Brown 4827552f7358SJed Brown Not Collective 4828552f7358SJed Brown 4829552f7358SJed Brown Input Parameter: 4830552f7358SJed Brown . dm - The DMPlex object 4831552f7358SJed Brown 4832552f7358SJed Brown Output Parameter: 4833552f7358SJed Brown . section - The PetscSection object 4834552f7358SJed Brown 4835552f7358SJed Brown Level: intermediate 4836552f7358SJed Brown 4837552f7358SJed Brown .keywords: mesh, coordinates 4838552f7358SJed Brown .seealso: DMGetCoordinateDM(), DMPlexGetDefaultSection(), DMPlexSetDefaultSection() 4839552f7358SJed Brown @*/ 48400adebc6cSBarry Smith PetscErrorCode DMPlexGetCoordinateSection(DM dm, PetscSection *section) 48410adebc6cSBarry Smith { 4842552f7358SJed Brown DM cdm; 4843552f7358SJed Brown PetscErrorCode ierr; 4844552f7358SJed Brown 4845552f7358SJed Brown PetscFunctionBegin; 4846552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4847552f7358SJed Brown PetscValidPointer(section, 2); 4848552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 4849552f7358SJed Brown ierr = DMGetDefaultSection(cdm, section);CHKERRQ(ierr); 4850552f7358SJed Brown PetscFunctionReturn(0); 4851552f7358SJed Brown } 4852552f7358SJed Brown 4853552f7358SJed Brown #undef __FUNCT__ 4854552f7358SJed Brown #define __FUNCT__ "DMPlexSetCoordinateSection" 4855552f7358SJed Brown /*@ 4856552f7358SJed Brown DMPlexSetCoordinateSection - Set the layout of coordinate values over the mesh. 4857552f7358SJed Brown 4858552f7358SJed Brown Not Collective 4859552f7358SJed Brown 4860552f7358SJed Brown Input Parameters: 4861552f7358SJed Brown + dm - The DMPlex object 4862552f7358SJed Brown - section - The PetscSection object 4863552f7358SJed Brown 4864552f7358SJed Brown Level: intermediate 4865552f7358SJed Brown 4866552f7358SJed Brown .keywords: mesh, coordinates 4867552f7358SJed Brown .seealso: DMPlexGetCoordinateSection(), DMPlexGetDefaultSection(), DMPlexSetDefaultSection() 4868552f7358SJed Brown @*/ 48690adebc6cSBarry Smith PetscErrorCode DMPlexSetCoordinateSection(DM dm, PetscSection section) 48700adebc6cSBarry Smith { 4871552f7358SJed Brown DM cdm; 4872552f7358SJed Brown PetscErrorCode ierr; 4873552f7358SJed Brown 4874552f7358SJed Brown PetscFunctionBegin; 4875552f7358SJed Brown PetscValidHeaderSpecific(dm,DM_CLASSID,1); 48761d799100SJed Brown PetscValidHeaderSpecific(section,PETSC_SECTION_CLASSID,2); 4877552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 4878552f7358SJed Brown ierr = DMSetDefaultSection(cdm, section);CHKERRQ(ierr); 4879552f7358SJed Brown PetscFunctionReturn(0); 4880552f7358SJed Brown } 4881552f7358SJed Brown 4882552f7358SJed Brown #undef __FUNCT__ 4883552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 48840adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 48850adebc6cSBarry Smith { 4886552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4887552f7358SJed Brown 4888552f7358SJed Brown PetscFunctionBegin; 4889552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4890552f7358SJed Brown if (section) *section = mesh->coneSection; 4891552f7358SJed Brown PetscFunctionReturn(0); 4892552f7358SJed Brown } 4893552f7358SJed Brown 4894552f7358SJed Brown #undef __FUNCT__ 48958cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 48968cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 48978cb4d582SMatthew G. Knepley { 48988cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 48998cb4d582SMatthew G. Knepley 49008cb4d582SMatthew G. Knepley PetscFunctionBegin; 49018cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49028cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 49038cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 49048cb4d582SMatthew G. Knepley } 49058cb4d582SMatthew G. Knepley 49068cb4d582SMatthew G. Knepley #undef __FUNCT__ 4907552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4908a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4909a6dfd86eSKarl Rupp { 4910552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4911552f7358SJed Brown 4912552f7358SJed Brown PetscFunctionBegin; 4913552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4914552f7358SJed Brown if (cones) *cones = mesh->cones; 4915552f7358SJed Brown PetscFunctionReturn(0); 4916552f7358SJed Brown } 4917552f7358SJed Brown 4918552f7358SJed Brown #undef __FUNCT__ 4919552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4920a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4921a6dfd86eSKarl Rupp { 4922552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4923552f7358SJed Brown 4924552f7358SJed Brown PetscFunctionBegin; 4925552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4926552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4927552f7358SJed Brown PetscFunctionReturn(0); 4928552f7358SJed Brown } 4929552f7358SJed Brown 4930552f7358SJed Brown /******************************** FEM Support **********************************/ 4931552f7358SJed Brown 4932552f7358SJed Brown #undef __FUNCT__ 4933552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4934552f7358SJed Brown /*@C 4935552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4936552f7358SJed Brown 4937552f7358SJed Brown Not collective 4938552f7358SJed Brown 4939552f7358SJed Brown Input Parameters: 4940552f7358SJed Brown + dm - The DM 49410298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4942552f7358SJed Brown . v - The local vector 4943552f7358SJed Brown - point - The sieve point in the DM 4944552f7358SJed Brown 4945552f7358SJed Brown Output Parameters: 49460298fd71SBarry Smith + csize - The number of values in the closure, or NULL 4947552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4948552f7358SJed Brown 49493813dfbdSMatthew G Knepley Fortran Notes: 49503813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 49513813dfbdSMatthew G Knepley include petsc.h90 in your code. 49523813dfbdSMatthew G Knepley 49533813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 49543813dfbdSMatthew G Knepley 4955552f7358SJed Brown Level: intermediate 4956552f7358SJed Brown 4957552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4958552f7358SJed Brown @*/ 49597c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4960a6dfd86eSKarl Rupp { 496152744b75SMatthew G. Knepley PetscSection clSection; 496252744b75SMatthew G. Knepley IS clIndices; 4963552f7358SJed Brown PetscScalar *array, *vArray; 49640298fd71SBarry Smith PetscInt *points = NULL; 4965552f7358SJed Brown PetscInt offsets[32]; 49669df71ca4SMatthew G. Knepley PetscInt depth, numFields, size = 0, numPoints, pStart, pEnd, p, q, f; 4967552f7358SJed Brown PetscErrorCode ierr; 4968552f7358SJed Brown 4969552f7358SJed Brown PetscFunctionBegin; 4970552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4971552f7358SJed Brown PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 497252744b75SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 497352744b75SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clIndices);CHKERRQ(ierr); 497452744b75SMatthew G. Knepley if (clSection) { 497552744b75SMatthew G. Knepley const PetscInt *idx; 497652744b75SMatthew G. Knepley PetscInt dof, off; 497752744b75SMatthew G. Knepley 497852744b75SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 497952744b75SMatthew G. Knepley if (csize) *csize = dof; 498052744b75SMatthew G. Knepley if (values) { 498152744b75SMatthew G. Knepley if (!*values) { 498252744b75SMatthew G. Knepley ierr = DMGetWorkArray(dm, dof, PETSC_SCALAR, &array);CHKERRQ(ierr); 498352744b75SMatthew G. Knepley *values = array; 498452744b75SMatthew G. Knepley } else { 498552744b75SMatthew G. Knepley array = *values; 498652744b75SMatthew G. Knepley } 498752744b75SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 498852744b75SMatthew G. Knepley ierr = ISGetIndices(clIndices, &idx);CHKERRQ(ierr); 498952744b75SMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 499052744b75SMatthew G. Knepley for (p = 0; p < dof; ++p) array[p] = vArray[idx[off+p]]; 499152744b75SMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 499252744b75SMatthew G. Knepley ierr = ISRestoreIndices(clIndices, &idx);CHKERRQ(ierr); 499352744b75SMatthew G. Knepley } 499452744b75SMatthew G. Knepley PetscFunctionReturn(0); 4995552f7358SJed Brown } 49965a1bb5cfSMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4997552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 49982a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 499982f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5000552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 50015a1bb5cfSMatthew G. Knepley if (depth == 1 && numFields < 2) { 50025a1bb5cfSMatthew G. Knepley const PetscInt *cone, *coneO; 50035a1bb5cfSMatthew G. Knepley 50045a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 50055a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 50065a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 50073f7cbbe7SMatthew G. Knepley if (!values || !*values) { 50089df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50099df71ca4SMatthew G. Knepley PetscInt dof; 50109df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50119df71ca4SMatthew G. Knepley size += dof; 50129df71ca4SMatthew G. Knepley } 50139df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50149df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50152a3aaacfSMatthew G. Knepley PetscInt dof; 50165a1bb5cfSMatthew G. Knepley 50175a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50182a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50195a1bb5cfSMatthew G. Knepley size += dof; 50205a1bb5cfSMatthew G. Knepley } 50213f7cbbe7SMatthew G. Knepley if (!values) { 50223f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 50233f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 50243f7cbbe7SMatthew G. Knepley } 50255a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 5026982e9ed1SMatthew G. Knepley } else { 5027982e9ed1SMatthew G. Knepley array = *values; 5028982e9ed1SMatthew G. Knepley } 50299df71ca4SMatthew G. Knepley size = 0; 50305a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 50319df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50329df71ca4SMatthew G. Knepley PetscInt dof, off, d; 50339df71ca4SMatthew G. Knepley PetscScalar *varr; 50349df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50359df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50369df71ca4SMatthew G. Knepley varr = &vArray[off]; 50379df71ca4SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offsets[0]) { 50389df71ca4SMatthew G. Knepley array[offsets[0]] = varr[d]; 50399df71ca4SMatthew G. Knepley } 50409df71ca4SMatthew G. Knepley size += dof; 50419df71ca4SMatthew G. Knepley } 50429df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50439df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50449df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 50455a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 50465a1bb5cfSMatthew G. Knepley PetscScalar *varr; 50475a1bb5cfSMatthew G. Knepley 504852ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50495a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50505a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 50515a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 50525a1bb5cfSMatthew G. Knepley if (o >= 0) { 50535a1bb5cfSMatthew G. Knepley for (d = 0; d < dof; ++d, ++offsets[0]) { 50545a1bb5cfSMatthew G. Knepley array[offsets[0]] = varr[d]; 50555a1bb5cfSMatthew G. Knepley } 50565a1bb5cfSMatthew G. Knepley } else { 50575a1bb5cfSMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offsets[0]) { 50585a1bb5cfSMatthew G. Knepley array[offsets[0]] = varr[d]; 50595a1bb5cfSMatthew G. Knepley } 50605a1bb5cfSMatthew G. Knepley } 50619df71ca4SMatthew G. Knepley size += dof; 50625a1bb5cfSMatthew G. Knepley } 50635a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 50649df71ca4SMatthew G. Knepley if (!*values) { 50655a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 50665a1bb5cfSMatthew G. Knepley *values = array; 50679df71ca4SMatthew G. Knepley } else { 50689df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 50698c312ff3SMatthew G. Knepley *csize = size; 50709df71ca4SMatthew G. Knepley } 50715a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 50725a1bb5cfSMatthew G. Knepley } 5073552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5074552f7358SJed Brown /* Compress out points not in the section */ 5075552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5076552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5077552f7358SJed Brown points[q*2] = points[p]; 5078552f7358SJed Brown points[q*2+1] = points[p+1]; 5079552f7358SJed Brown ++q; 5080552f7358SJed Brown } 5081552f7358SJed Brown } 5082552f7358SJed Brown numPoints = q; 5083bd6c0d32SMatthew G. Knepley if (!values || !*values) { 5084552f7358SJed Brown for (p = 0, size = 0; p < numPoints*2; p += 2) { 5085552f7358SJed Brown PetscInt dof, fdof; 5086552f7358SJed Brown 5087552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5088552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5089552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5090552f7358SJed Brown offsets[f+1] += fdof; 5091552f7358SJed Brown } 5092552f7358SJed Brown size += dof; 5093552f7358SJed Brown } 5094bd6c0d32SMatthew G. Knepley if (!values) { 5095648a61deSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5096bd6c0d32SMatthew G. Knepley if (csize) *csize = size; 5097bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 5098bd6c0d32SMatthew G. Knepley } 5099d0f6b257SMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 5100d0f6b257SMatthew G. Knepley } else { 5101d0f6b257SMatthew G. Knepley array = *values; 5102d0f6b257SMatthew G. Knepley } 51030d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 510482f516ccSBarry Smith if (numFields && offsets[numFields] != size) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], size); 5105552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 5106552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5107552f7358SJed Brown PetscInt o = points[p+1]; 5108552f7358SJed Brown PetscInt dof, off, d; 5109552f7358SJed Brown PetscScalar *varr; 5110552f7358SJed Brown 5111552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5112552f7358SJed Brown ierr = PetscSectionGetOffset(section, points[p], &off);CHKERRQ(ierr); 5113552f7358SJed Brown varr = &vArray[off]; 5114552f7358SJed Brown if (numFields) { 5115552f7358SJed Brown PetscInt fdof, foff, fcomp, f, c; 5116552f7358SJed Brown 5117552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5118552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5119552f7358SJed Brown if (o >= 0) { 5120552f7358SJed Brown for (d = 0; d < fdof; ++d, ++offsets[f]) { 5121552f7358SJed Brown array[offsets[f]] = varr[foff+d]; 5122552f7358SJed Brown } 5123552f7358SJed Brown } else { 5124552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5125552f7358SJed Brown for (d = fdof/fcomp-1; d >= 0; --d) { 5126552f7358SJed Brown for (c = 0; c < fcomp; ++c, ++offsets[f]) { 5127552f7358SJed Brown array[offsets[f]] = varr[foff+d*fcomp+c]; 5128552f7358SJed Brown } 5129552f7358SJed Brown } 5130552f7358SJed Brown } 5131552f7358SJed Brown foff += fdof; 5132552f7358SJed Brown } 5133552f7358SJed Brown } else { 5134552f7358SJed Brown if (o >= 0) { 5135552f7358SJed Brown for (d = 0; d < dof; ++d, ++offsets[0]) { 5136552f7358SJed Brown array[offsets[0]] = varr[d]; 5137552f7358SJed Brown } 5138552f7358SJed Brown } else { 5139552f7358SJed Brown for (d = dof-1; d >= 0; --d, ++offsets[0]) { 5140552f7358SJed Brown array[offsets[0]] = varr[d]; 5141552f7358SJed Brown } 5142552f7358SJed Brown } 5143552f7358SJed Brown } 5144552f7358SJed Brown } 5145552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5146552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 5147d0f6b257SMatthew G. Knepley if (!*values) { 5148552f7358SJed Brown if (csize) *csize = size; 5149552f7358SJed Brown *values = array; 5150d0f6b257SMatthew G. Knepley } else { 5151d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 5152d0f6b257SMatthew G. Knepley *csize = size; 5153d0f6b257SMatthew G. Knepley } 5154552f7358SJed Brown PetscFunctionReturn(0); 5155552f7358SJed Brown } 5156552f7358SJed Brown 5157552f7358SJed Brown #undef __FUNCT__ 5158552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 5159552f7358SJed Brown /*@C 5160552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 5161552f7358SJed Brown 5162552f7358SJed Brown Not collective 5163552f7358SJed Brown 5164552f7358SJed Brown Input Parameters: 5165552f7358SJed Brown + dm - The DM 51660298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 5167552f7358SJed Brown . v - The local vector 5168552f7358SJed Brown . point - The sieve point in the DM 51690298fd71SBarry Smith . csize - The number of values in the closure, or NULL 5170552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5171552f7358SJed Brown 51723813dfbdSMatthew G Knepley Fortran Notes: 51733813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 51743813dfbdSMatthew G Knepley include petsc.h90 in your code. 51753813dfbdSMatthew G Knepley 51763813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 51773813dfbdSMatthew G Knepley 5178552f7358SJed Brown Level: intermediate 5179552f7358SJed Brown 5180552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5181552f7358SJed Brown @*/ 51827c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5183a6dfd86eSKarl Rupp { 5184552f7358SJed Brown PetscInt size = 0; 5185552f7358SJed Brown PetscErrorCode ierr; 5186552f7358SJed Brown 5187552f7358SJed Brown PetscFunctionBegin; 5188552f7358SJed Brown /* Should work without recalculating size */ 5189552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 5190552f7358SJed Brown PetscFunctionReturn(0); 5191552f7358SJed Brown } 5192552f7358SJed Brown 5193552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 5194552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 5195552f7358SJed Brown 5196552f7358SJed Brown #undef __FUNCT__ 5197552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 5198552f7358SJed Brown PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 5199552f7358SJed Brown { 5200552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5201552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5202552f7358SJed Brown PetscScalar *a; 5203552f7358SJed Brown PetscInt off, cind = 0, k; 5204552f7358SJed Brown PetscErrorCode ierr; 5205552f7358SJed Brown 5206552f7358SJed Brown PetscFunctionBegin; 5207552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5208552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5209552f7358SJed Brown a = &array[off]; 5210552f7358SJed Brown if (!cdof || setBC) { 5211552f7358SJed Brown if (orientation >= 0) { 5212552f7358SJed Brown for (k = 0; k < dof; ++k) { 5213552f7358SJed Brown fuse(&a[k], values[k]); 5214552f7358SJed Brown } 5215552f7358SJed Brown } else { 5216552f7358SJed Brown for (k = 0; k < dof; ++k) { 5217552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5218552f7358SJed Brown } 5219552f7358SJed Brown } 5220552f7358SJed Brown } else { 5221552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5222552f7358SJed Brown if (orientation >= 0) { 5223552f7358SJed Brown for (k = 0; k < dof; ++k) { 5224552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5225552f7358SJed Brown fuse(&a[k], values[k]); 5226552f7358SJed Brown } 5227552f7358SJed Brown } else { 5228552f7358SJed Brown for (k = 0; k < dof; ++k) { 5229552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5230552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5231552f7358SJed Brown } 5232552f7358SJed Brown } 5233552f7358SJed Brown } 5234552f7358SJed Brown PetscFunctionReturn(0); 5235552f7358SJed Brown } 5236552f7358SJed Brown 5237552f7358SJed Brown #undef __FUNCT__ 5238a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 5239a5e93ea8SMatthew G. Knepley PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 5240a5e93ea8SMatthew G. Knepley { 5241a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 5242a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5243a5e93ea8SMatthew G. Knepley PetscScalar *a; 5244a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 5245a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5246a5e93ea8SMatthew G. Knepley 5247a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5248a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5249a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5250a5e93ea8SMatthew G. Knepley a = &array[off]; 5251a5e93ea8SMatthew G. Knepley if (cdof) { 5252a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5253a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 5254a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5255a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5256a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 5257a5e93ea8SMatthew G. Knepley ++cind; 5258a5e93ea8SMatthew G. Knepley } 5259a5e93ea8SMatthew G. Knepley } 5260a5e93ea8SMatthew G. Knepley } else { 5261a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5262a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5263a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 5264a5e93ea8SMatthew G. Knepley ++cind; 5265a5e93ea8SMatthew G. Knepley } 5266a5e93ea8SMatthew G. Knepley } 5267a5e93ea8SMatthew G. Knepley } 5268a5e93ea8SMatthew G. Knepley } 5269a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5270a5e93ea8SMatthew G. Knepley } 5271a5e93ea8SMatthew G. Knepley 5272a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 5273552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 5274a6dfd86eSKarl Rupp PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt foffs[], void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 5275a6dfd86eSKarl Rupp { 5276552f7358SJed Brown PetscScalar *a; 5277552f7358SJed Brown PetscInt numFields, off, foff, f; 5278552f7358SJed Brown PetscErrorCode ierr; 5279552f7358SJed Brown 5280552f7358SJed Brown PetscFunctionBegin; 5281552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5282552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5283552f7358SJed Brown a = &array[off]; 5284552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5285552f7358SJed Brown PetscInt fdof, fcomp, fcdof; 5286552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5287552f7358SJed Brown PetscInt cind = 0, k, c; 5288552f7358SJed Brown 5289552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5290552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5291552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 5292552f7358SJed Brown if (!fcdof || setBC) { 5293552f7358SJed Brown if (orientation >= 0) { 5294552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5295552f7358SJed Brown fuse(&a[foff+k], values[foffs[f]+k]); 5296552f7358SJed Brown } 5297552f7358SJed Brown } else { 5298552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5299552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5300552f7358SJed Brown fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]); 5301552f7358SJed Brown } 5302552f7358SJed Brown } 5303552f7358SJed Brown } 5304552f7358SJed Brown } else { 5305552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5306552f7358SJed Brown if (orientation >= 0) { 5307552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5308552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 5309552f7358SJed Brown fuse(&a[foff+k], values[foffs[f]+k]); 5310552f7358SJed Brown } 5311552f7358SJed Brown } else { 5312552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5313552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5314552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 5315552f7358SJed Brown fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]); 5316552f7358SJed Brown } 5317552f7358SJed Brown } 5318552f7358SJed Brown } 5319552f7358SJed Brown } 5320552f7358SJed Brown foff += fdof; 5321552f7358SJed Brown foffs[f] += fdof; 5322552f7358SJed Brown } 5323552f7358SJed Brown PetscFunctionReturn(0); 5324552f7358SJed Brown } 5325552f7358SJed Brown 5326552f7358SJed Brown #undef __FUNCT__ 5327a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 5328a5e93ea8SMatthew G. Knepley PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt foffs[], void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 5329a5e93ea8SMatthew G. Knepley { 5330a5e93ea8SMatthew G. Knepley PetscScalar *a; 5331a5e93ea8SMatthew G. Knepley PetscInt numFields, off, foff, f; 5332a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5333a5e93ea8SMatthew G. Knepley 5334a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5335a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5336a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5337a5e93ea8SMatthew G. Knepley a = &array[off]; 5338a5e93ea8SMatthew G. Knepley for (f = 0, foff = 0; f < numFields; ++f) { 5339a5e93ea8SMatthew G. Knepley PetscInt fdof, fcomp, fcdof; 5340a5e93ea8SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5341a5e93ea8SMatthew G. Knepley PetscInt cind = 0, k, c; 5342a5e93ea8SMatthew G. Knepley 5343a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5344a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5345a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 5346a5e93ea8SMatthew G. Knepley if (fcdof) { 5347a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5348a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 5349a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 5350a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 5351a5e93ea8SMatthew G. Knepley fuse(&a[foff+k], values[foffs[f]+k]); 5352a5e93ea8SMatthew G. Knepley ++cind; 5353a5e93ea8SMatthew G. Knepley } 5354a5e93ea8SMatthew G. Knepley } 5355a5e93ea8SMatthew G. Knepley } else { 5356a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 5357a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 5358a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 5359a5e93ea8SMatthew G. Knepley fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]); 5360a5e93ea8SMatthew G. Knepley ++cind; 5361a5e93ea8SMatthew G. Knepley } 5362a5e93ea8SMatthew G. Knepley } 5363a5e93ea8SMatthew G. Knepley } 5364a5e93ea8SMatthew G. Knepley } 5365a5e93ea8SMatthew G. Knepley } 5366a5e93ea8SMatthew G. Knepley foff += fdof; 5367a5e93ea8SMatthew G. Knepley foffs[f] += fdof; 5368a5e93ea8SMatthew G. Knepley } 5369a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5370a5e93ea8SMatthew G. Knepley } 5371a5e93ea8SMatthew G. Knepley 5372a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 5373552f7358SJed Brown #define __FUNCT__ "DMPlexVecSetClosure" 5374552f7358SJed Brown /*@C 5375552f7358SJed Brown DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 5376552f7358SJed Brown 5377552f7358SJed Brown Not collective 5378552f7358SJed Brown 5379552f7358SJed Brown Input Parameters: 5380552f7358SJed Brown + dm - The DM 53817f5d1fdeSMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 5382552f7358SJed Brown . v - The local vector 5383552f7358SJed Brown . point - The sieve point in the DM 53847f5d1fdeSMatthew G. Knepley . values - The array of values 5385552f7358SJed Brown - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 5386552f7358SJed Brown 53873813dfbdSMatthew G Knepley Fortran Notes: 53887f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 53893813dfbdSMatthew G Knepley 5390552f7358SJed Brown Level: intermediate 5391552f7358SJed Brown 5392552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 5393552f7358SJed Brown @*/ 5394a6dfd86eSKarl Rupp PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 5395a6dfd86eSKarl Rupp { 5396552f7358SJed Brown PetscScalar *array; 53970298fd71SBarry Smith PetscInt *points = NULL; 5398552f7358SJed Brown PetscInt offsets[32]; 5399b6ebb6e6SMatthew G. Knepley PetscInt depth, numFields, numPoints, off, dof, pStart, pEnd, p, q, f; 5400552f7358SJed Brown PetscErrorCode ierr; 5401552f7358SJed Brown 5402552f7358SJed Brown PetscFunctionBegin; 5403552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5404552f7358SJed Brown PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5405552f7358SJed Brown if (!section) { 5406552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 5407552f7358SJed Brown } 5408b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5409552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5410b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 541182f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5412552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5413b6ebb6e6SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 5414b6ebb6e6SMatthew G. Knepley const PetscInt *cone, *coneO; 5415b6ebb6e6SMatthew G. Knepley 5416b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 5417b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 5418b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 5419b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5420b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 5421b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 5422b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 5423b6ebb6e6SMatthew G. Knepley 5424b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 5425b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 5426b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 5427b6ebb6e6SMatthew G. Knepley { 5428b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5429b6ebb6e6SMatthew G. Knepley PetscScalar *a; 5430b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 5431b6ebb6e6SMatthew G. Knepley 5432b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 5433b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 5434b6ebb6e6SMatthew G. Knepley a = &array[coff]; 5435b6ebb6e6SMatthew G. Knepley if (!cdof) { 5436b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5437b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5438b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5439b6ebb6e6SMatthew G. Knepley } 5440b6ebb6e6SMatthew G. Knepley } else { 5441b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5442b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5443b6ebb6e6SMatthew G. Knepley } 5444b6ebb6e6SMatthew G. Knepley } 5445b6ebb6e6SMatthew G. Knepley } else { 5446b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 5447b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5448b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5449b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5450b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5451b6ebb6e6SMatthew G. Knepley } 5452b6ebb6e6SMatthew G. Knepley } else { 5453b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5454b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5455b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5456b6ebb6e6SMatthew G. Knepley } 5457b6ebb6e6SMatthew G. Knepley } 5458b6ebb6e6SMatthew G. Knepley } 5459b6ebb6e6SMatthew G. Knepley } 5460b6ebb6e6SMatthew G. Knepley } 5461b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5462b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 5463b6ebb6e6SMatthew G. Knepley } 5464552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5465552f7358SJed Brown /* Compress out points not in the section */ 5466552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5467552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5468552f7358SJed Brown points[q*2] = points[p]; 5469552f7358SJed Brown points[q*2+1] = points[p+1]; 5470552f7358SJed Brown ++q; 5471552f7358SJed Brown } 5472552f7358SJed Brown } 5473552f7358SJed Brown numPoints = q; 5474552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5475552f7358SJed Brown PetscInt fdof; 5476552f7358SJed Brown 5477552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5478552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5479552f7358SJed Brown offsets[f+1] += fdof; 5480552f7358SJed Brown } 5481552f7358SJed Brown } 54820d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 5483552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5484552f7358SJed Brown if (numFields) { 5485552f7358SJed Brown switch (mode) { 5486552f7358SJed Brown case INSERT_VALUES: 5487552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5488552f7358SJed Brown PetscInt o = points[p+1]; 5489552f7358SJed Brown updatePointFields_private(section, points[p], offsets, insert, PETSC_FALSE, o, values, array); 5490552f7358SJed Brown } break; 5491552f7358SJed Brown case INSERT_ALL_VALUES: 5492552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5493552f7358SJed Brown PetscInt o = points[p+1]; 5494552f7358SJed Brown updatePointFields_private(section, points[p], offsets, insert, PETSC_TRUE, o, values, array); 5495552f7358SJed Brown } break; 5496a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5497a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5498a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5499a5e93ea8SMatthew G. Knepley updatePointFieldsBC_private(section, points[p], offsets, insert, o, values, array); 5500a5e93ea8SMatthew G. Knepley } break; 5501552f7358SJed Brown case ADD_VALUES: 5502552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5503552f7358SJed Brown PetscInt o = points[p+1]; 5504552f7358SJed Brown updatePointFields_private(section, points[p], offsets, add, PETSC_FALSE, o, values, array); 5505552f7358SJed Brown } break; 5506552f7358SJed Brown case ADD_ALL_VALUES: 5507552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5508552f7358SJed Brown PetscInt o = points[p+1]; 5509552f7358SJed Brown updatePointFields_private(section, points[p], offsets, add, PETSC_TRUE, o, values, array); 5510552f7358SJed Brown } break; 5511552f7358SJed Brown default: 551282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5513552f7358SJed Brown } 5514552f7358SJed Brown } else { 5515552f7358SJed Brown switch (mode) { 5516552f7358SJed Brown case INSERT_VALUES: 5517552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5518552f7358SJed Brown PetscInt o = points[p+1]; 5519552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5520552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5521552f7358SJed Brown } break; 5522552f7358SJed Brown case INSERT_ALL_VALUES: 5523552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5524552f7358SJed Brown PetscInt o = points[p+1]; 5525552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5526552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5527552f7358SJed Brown } break; 5528a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5529a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5530a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5531a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5532a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5533a5e93ea8SMatthew G. Knepley } break; 5534552f7358SJed Brown case ADD_VALUES: 5535552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5536552f7358SJed Brown PetscInt o = points[p+1]; 5537552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5538552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5539552f7358SJed Brown } break; 5540552f7358SJed Brown case ADD_ALL_VALUES: 5541552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5542552f7358SJed Brown PetscInt o = points[p+1]; 5543552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5544552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5545552f7358SJed Brown } break; 5546552f7358SJed Brown default: 554782f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5548552f7358SJed Brown } 5549552f7358SJed Brown } 5550552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5551552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5552552f7358SJed Brown PetscFunctionReturn(0); 5553552f7358SJed Brown } 5554552f7358SJed Brown 5555552f7358SJed Brown #undef __FUNCT__ 5556e159ff95SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateClosureIndex" 5557e159ff95SMatthew G. Knepley /*@ 5558e159ff95SMatthew G. Knepley DMPlexCreateClosureIndex - Calculate an index for the given PetscSection for the closure operation on the DM 5559e159ff95SMatthew G. Knepley 5560e159ff95SMatthew G. Knepley Not collective 5561e159ff95SMatthew G. Knepley 5562e159ff95SMatthew G. Knepley Input Parameters: 5563e159ff95SMatthew G. Knepley + dm - The DM 5564e159ff95SMatthew G. Knepley - section - The section describing the layout in v, or NULL to use the default section 5565e159ff95SMatthew G. Knepley 5566e159ff95SMatthew G. Knepley Note: 5567e159ff95SMatthew G. Knepley This should greatly improve the performance of the closure operations, at the cost of additional memory. 5568e159ff95SMatthew G. Knepley 5569e159ff95SMatthew G. Knepley Level: intermediate 5570e159ff95SMatthew G. Knepley 5571e159ff95SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5572e159ff95SMatthew G. Knepley @*/ 5573e159ff95SMatthew G. Knepley PetscErrorCode DMPlexCreateClosureIndex(DM dm, PetscSection section) 5574e159ff95SMatthew G. Knepley { 5575e159ff95SMatthew G. Knepley PetscSection closureSection; 5576e159ff95SMatthew G. Knepley IS closureIS; 5577e159ff95SMatthew G. Knepley PetscInt offsets[32], *clIndices; 5578e159ff95SMatthew G. Knepley PetscInt depth, numFields, pStart, pEnd, point, clSize; 5579e159ff95SMatthew G. Knepley PetscErrorCode ierr; 5580e159ff95SMatthew G. Knepley 5581e159ff95SMatthew G. Knepley PetscFunctionBegin; 5582e159ff95SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5583e159ff95SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 5584e159ff95SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5585e159ff95SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5586e159ff95SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5587e159ff95SMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5588e159ff95SMatthew G. Knepley ierr = PetscSectionCreate(PetscObjectComm((PetscObject) section), &closureSection);CHKERRQ(ierr); 5589e159ff95SMatthew G. Knepley ierr = PetscSectionSetChart(closureSection, pStart, pEnd);CHKERRQ(ierr); 5590e159ff95SMatthew G. Knepley for (point = pStart; point < pEnd; ++point) { 5591e159ff95SMatthew G. Knepley PetscInt *points = NULL, numPoints, p, dof, cldof = 0; 5592e159ff95SMatthew G. Knepley 5593e159ff95SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5594e159ff95SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5595e159ff95SMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5596e159ff95SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5597e159ff95SMatthew G. Knepley cldof += dof; 5598e159ff95SMatthew G. Knepley } 5599e159ff95SMatthew G. Knepley } 5600e159ff95SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5601e159ff95SMatthew G. Knepley ierr = PetscSectionSetDof(closureSection, point, cldof);CHKERRQ(ierr); 5602e159ff95SMatthew G. Knepley } 5603e159ff95SMatthew G. Knepley ierr = PetscSectionSetUp(closureSection);CHKERRQ(ierr); 5604e159ff95SMatthew G. Knepley ierr = PetscSectionGetStorageSize(closureSection, &clSize);CHKERRQ(ierr); 5605e159ff95SMatthew G. Knepley ierr = PetscMalloc(clSize * sizeof(PetscInt), &clIndices);CHKERRQ(ierr); 5606e159ff95SMatthew G. Knepley for (point = pStart; point < pEnd; ++point) { 5607e159ff95SMatthew G. Knepley PetscInt *points = NULL, numPoints, p, q, cldof, cloff, fdof, f; 5608e159ff95SMatthew G. Knepley 5609e159ff95SMatthew G. Knepley ierr = PetscSectionGetDof(closureSection, point, &cldof);CHKERRQ(ierr); 5610e159ff95SMatthew G. Knepley ierr = PetscSectionGetOffset(closureSection, point, &cloff);CHKERRQ(ierr); 5611e159ff95SMatthew G. Knepley ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5612e159ff95SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5613e159ff95SMatthew G. Knepley /* Compress out points not in the section, and create field offsets */ 5614e159ff95SMatthew G. Knepley for (p = 0, q = 0; p < numPoints*2; p += 2) { 5615e159ff95SMatthew G. Knepley if ((points[p] >= pStart) && (points[p] < pEnd)) { 5616e159ff95SMatthew G. Knepley points[q*2] = points[p]; 5617e159ff95SMatthew G. Knepley points[q*2+1] = points[p+1]; 5618e159ff95SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5619e159ff95SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5620e159ff95SMatthew G. Knepley offsets[f+1] += fdof; 5621e159ff95SMatthew G. Knepley } 5622e159ff95SMatthew G. Knepley ++q; 5623e159ff95SMatthew G. Knepley } 5624e159ff95SMatthew G. Knepley } 5625e159ff95SMatthew G. Knepley numPoints = q; 5626e159ff95SMatthew G. Knepley for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 5627e159ff95SMatthew G. Knepley if (numFields && offsets[numFields] != cldof) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], cldof); 5628e159ff95SMatthew G. Knepley /* Create indices */ 5629e159ff95SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5630e159ff95SMatthew G. Knepley PetscInt o = points[p+1], dof, off, d; 5631e159ff95SMatthew G. Knepley 5632e159ff95SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5633e159ff95SMatthew G. Knepley ierr = PetscSectionGetOffset(section, points[p], &off);CHKERRQ(ierr); 5634e159ff95SMatthew G. Knepley if (numFields) { 5635e159ff95SMatthew G. Knepley PetscInt fdof, foff, fcomp, f, c; 5636e159ff95SMatthew G. Knepley 5637e159ff95SMatthew G. Knepley for (f = 0, foff = 0; f < numFields; ++f) { 5638e159ff95SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5639e159ff95SMatthew G. Knepley if (o >= 0) { 5640e159ff95SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offsets[f]) clIndices[cloff+offsets[f]] = off+foff+d; 5641e159ff95SMatthew G. Knepley } else { 5642e159ff95SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5643e159ff95SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 5644e159ff95SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offsets[f]) clIndices[cloff+offsets[f]] = off+foff+d*fcomp+c; 5645e159ff95SMatthew G. Knepley } 5646e159ff95SMatthew G. Knepley } 5647e159ff95SMatthew G. Knepley foff += fdof; 5648e159ff95SMatthew G. Knepley } 5649e159ff95SMatthew G. Knepley } else { 5650e159ff95SMatthew G. Knepley if (o >= 0) for (d = 0; d < dof; ++d) clIndices[cloff+d] = off+d; 5651e159ff95SMatthew G. Knepley else for (d = dof-1; d >= 0; --d) clIndices[cloff+d] = off+d; 5652e159ff95SMatthew G. Knepley } 5653e159ff95SMatthew G. Knepley } 5654e159ff95SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5655e159ff95SMatthew G. Knepley } 5656e159ff95SMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, clSize, clIndices, PETSC_OWN_POINTER, &closureIS);CHKERRQ(ierr); 5657e159ff95SMatthew G. Knepley ierr = PetscSectionSetClosureIndex(section, (PetscObject) dm, closureSection, closureIS); 5658e159ff95SMatthew G. Knepley PetscFunctionReturn(0); 5659e159ff95SMatthew G. Knepley } 5660e159ff95SMatthew G. Knepley 5661e159ff95SMatthew G. Knepley #undef __FUNCT__ 5662552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 56637c1f9639SMatthew G Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numIndices, const PetscInt indices[], const PetscScalar values[]) 5664552f7358SJed Brown { 5665552f7358SJed Brown PetscMPIInt rank; 5666552f7358SJed Brown PetscInt i, j; 5667552f7358SJed Brown PetscErrorCode ierr; 5668552f7358SJed Brown 5669552f7358SJed Brown PetscFunctionBegin; 567082f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 567177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 5672552f7358SJed Brown for (i = 0; i < numIndices; i++) { 567377a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat indices[%D] = %D\n", rank, i, indices[i]);CHKERRQ(ierr); 5674552f7358SJed Brown } 5675552f7358SJed Brown for (i = 0; i < numIndices; i++) { 567677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5677552f7358SJed Brown for (j = 0; j < numIndices; j++) { 5678519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 567977a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%G,%G)", PetscRealPart(values[i*numIndices+j]), PetscImaginaryPart(values[i*numIndices+j]));CHKERRQ(ierr); 5680552f7358SJed Brown #else 568177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %G", values[i*numIndices+j]);CHKERRQ(ierr); 5682552f7358SJed Brown #endif 5683552f7358SJed Brown } 568477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 5685552f7358SJed Brown } 5686552f7358SJed Brown PetscFunctionReturn(0); 5687552f7358SJed Brown } 5688552f7358SJed Brown 5689552f7358SJed Brown #undef __FUNCT__ 5690552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 5691552f7358SJed Brown /* . off - The global offset of this point */ 5692e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5693a6dfd86eSKarl Rupp { 5694e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 5695552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5696552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5697552f7358SJed Brown PetscInt cind = 0, k; 5698552f7358SJed Brown PetscErrorCode ierr; 5699552f7358SJed Brown 5700552f7358SJed Brown PetscFunctionBegin; 5701552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 5702552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5703552f7358SJed Brown if (!cdof || setBC) { 5704552f7358SJed Brown if (orientation >= 0) { 5705e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 5706552f7358SJed Brown } else { 5707e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 5708552f7358SJed Brown } 5709552f7358SJed Brown } else { 5710552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5711552f7358SJed Brown if (orientation >= 0) { 5712552f7358SJed Brown for (k = 0; k < dof; ++k) { 5713552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5714552f7358SJed Brown /* Insert check for returning constrained indices */ 5715e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 5716552f7358SJed Brown ++cind; 5717552f7358SJed Brown } else { 5718e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 5719552f7358SJed Brown } 5720552f7358SJed Brown } 5721552f7358SJed Brown } else { 5722552f7358SJed Brown for (k = 0; k < dof; ++k) { 5723552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 5724552f7358SJed Brown /* Insert check for returning constrained indices */ 5725e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 5726552f7358SJed Brown ++cind; 5727552f7358SJed Brown } else { 5728e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 5729552f7358SJed Brown } 5730552f7358SJed Brown } 5731552f7358SJed Brown } 5732552f7358SJed Brown } 5733e6ccafaeSMatthew G Knepley *loff += dof; 5734552f7358SJed Brown PetscFunctionReturn(0); 5735552f7358SJed Brown } 5736552f7358SJed Brown 5737552f7358SJed Brown #undef __FUNCT__ 5738552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 5739552f7358SJed Brown /* . off - The global offset of this point */ 5740a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 5741a6dfd86eSKarl Rupp { 5742552f7358SJed Brown PetscInt numFields, foff, f; 5743552f7358SJed Brown PetscErrorCode ierr; 5744552f7358SJed Brown 5745552f7358SJed Brown PetscFunctionBegin; 5746552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5747552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 5748552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 5749552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 5750552f7358SJed Brown PetscInt cind = 0, k, c; 5751552f7358SJed Brown 5752552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5753552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5754552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 5755552f7358SJed Brown if (!cfdof || setBC) { 5756552f7358SJed Brown if (orientation >= 0) { 57570d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 5758552f7358SJed Brown } else { 5759552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5760552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5761552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 5762552f7358SJed Brown } 5763552f7358SJed Brown } 5764552f7358SJed Brown } 5765552f7358SJed Brown } else { 5766552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 5767552f7358SJed Brown if (orientation >= 0) { 5768552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5769552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 5770552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 5771552f7358SJed Brown ++cind; 5772552f7358SJed Brown } else { 5773552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 5774552f7358SJed Brown } 5775552f7358SJed Brown } 5776552f7358SJed Brown } else { 5777552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5778552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5779552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5780552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5781552f7358SJed Brown ++cind; 5782552f7358SJed Brown } else { 5783552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5784552f7358SJed Brown } 5785552f7358SJed Brown } 5786552f7358SJed Brown } 5787552f7358SJed Brown } 5788552f7358SJed Brown } 5789552f7358SJed Brown foff += fdof - cfdof; 5790552f7358SJed Brown foffs[f] += fdof; 5791552f7358SJed Brown } 5792552f7358SJed Brown PetscFunctionReturn(0); 5793552f7358SJed Brown } 5794552f7358SJed Brown 5795552f7358SJed Brown #undef __FUNCT__ 5796552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 57977f5d1fdeSMatthew G. Knepley /*@C 57987f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 57997f5d1fdeSMatthew G. Knepley 58007f5d1fdeSMatthew G. Knepley Not collective 58017f5d1fdeSMatthew G. Knepley 58027f5d1fdeSMatthew G. Knepley Input Parameters: 58037f5d1fdeSMatthew G. Knepley + dm - The DM 58043dc93601SMatthew G. Knepley . section - The section describing the layout in v 58053dc93601SMatthew G. Knepley . globalSection - The section describing the layout in v 58067f5d1fdeSMatthew G. Knepley . A - The matrix 58077f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 58087f5d1fdeSMatthew G. Knepley . values - The array of values 58097f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 58107f5d1fdeSMatthew G. Knepley 58117f5d1fdeSMatthew G. Knepley Fortran Notes: 58127f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 58137f5d1fdeSMatthew G. Knepley 58147f5d1fdeSMatthew G. Knepley Level: intermediate 58157f5d1fdeSMatthew G. Knepley 58167f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 58177f5d1fdeSMatthew G. Knepley @*/ 58187c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5819552f7358SJed Brown { 5820552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 58210298fd71SBarry Smith PetscInt *points = NULL; 5822552f7358SJed Brown PetscInt *indices; 5823552f7358SJed Brown PetscInt offsets[32]; 5824552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5825552f7358SJed Brown PetscErrorCode ierr; 5826552f7358SJed Brown 5827552f7358SJed Brown PetscFunctionBegin; 5828552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 58293dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 58303dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58313dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5832552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 583382f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5834552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5835552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5836552f7358SJed Brown /* Compress out points not in the section */ 5837552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5838552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5839552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5840552f7358SJed Brown points[q*2] = points[p]; 5841552f7358SJed Brown points[q*2+1] = points[p+1]; 5842552f7358SJed Brown ++q; 5843552f7358SJed Brown } 5844552f7358SJed Brown } 5845552f7358SJed Brown numPoints = q; 5846552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5847552f7358SJed Brown PetscInt fdof; 5848552f7358SJed Brown 5849552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5850552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5851552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5852552f7358SJed Brown offsets[f+1] += fdof; 5853552f7358SJed Brown } 5854552f7358SJed Brown numIndices += dof; 5855552f7358SJed Brown } 58560d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58570d644c17SKarl Rupp 585882f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5859552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5860552f7358SJed Brown if (numFields) { 5861552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5862552f7358SJed Brown PetscInt o = points[p+1]; 5863552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5864552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5865552f7358SJed Brown } 5866552f7358SJed Brown } else { 5867e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5868552f7358SJed Brown PetscInt o = points[p+1]; 5869552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5870e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5871552f7358SJed Brown } 5872552f7358SJed Brown } 587377a6746dSMatthew G Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr);} 5874552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5875552f7358SJed Brown if (ierr) { 5876552f7358SJed Brown PetscMPIInt rank; 5877552f7358SJed Brown PetscErrorCode ierr2; 5878552f7358SJed Brown 587982f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 588077a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 588177a6746dSMatthew G Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr2); 58826a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5883552f7358SJed Brown CHKERRQ(ierr); 5884552f7358SJed Brown } 5885552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5886552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5887552f7358SJed Brown PetscFunctionReturn(0); 5888552f7358SJed Brown } 5889552f7358SJed Brown 5890552f7358SJed Brown #undef __FUNCT__ 5891770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5892770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5893552f7358SJed Brown { 5894552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5895770b213bSMatthew G Knepley PetscInt dim; 5896770b213bSMatthew G Knepley PetscErrorCode ierr; 5897552f7358SJed Brown 5898552f7358SJed Brown PetscFunctionBegin; 5899552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5900770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5901770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5902770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5903770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5904770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5905552f7358SJed Brown PetscFunctionReturn(0); 5906552f7358SJed Brown } 5907552f7358SJed Brown 5908552f7358SJed Brown #undef __FUNCT__ 5909770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5910770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5911552f7358SJed Brown { 5912552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5913770b213bSMatthew G Knepley PetscInt dim; 5914770b213bSMatthew G Knepley PetscErrorCode ierr; 5915552f7358SJed Brown 5916552f7358SJed Brown PetscFunctionBegin; 5917552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5918770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5919770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5920770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5921770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5922770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5923552f7358SJed Brown PetscFunctionReturn(0); 5924552f7358SJed Brown } 5925552f7358SJed Brown 5926552f7358SJed Brown #undef __FUNCT__ 5927552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5928552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5929552f7358SJed Brown { 5930552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5931552f7358SJed Brown 5932552f7358SJed Brown PetscFunctionBegin; 5933552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5934552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5935552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5936552f7358SJed Brown PetscFunctionReturn(0); 5937552f7358SJed Brown } 5938552f7358SJed Brown 5939552f7358SJed Brown #undef __FUNCT__ 5940552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5941552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(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 mesh->vtkCellHeight = cellHeight; 5948552f7358SJed Brown PetscFunctionReturn(0); 5949552f7358SJed Brown } 5950552f7358SJed Brown 5951552f7358SJed Brown #undef __FUNCT__ 5952552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5953552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5954552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 5955552f7358SJed Brown { 5956552f7358SJed Brown PetscSection section, globalSection; 5957552f7358SJed Brown PetscInt *numbers, p; 5958552f7358SJed Brown PetscErrorCode ierr; 5959552f7358SJed Brown 5960552f7358SJed Brown PetscFunctionBegin; 596182f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5962552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5963552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5964552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5965552f7358SJed Brown } 5966552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5967552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5968552f7358SJed Brown ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt), &numbers);CHKERRQ(ierr); 5969552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5970552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5971552f7358SJed Brown } 597282f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5973552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5974552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5975552f7358SJed Brown PetscFunctionReturn(0); 5976552f7358SJed Brown } 5977552f7358SJed Brown 5978552f7358SJed Brown #undef __FUNCT__ 5979552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5980552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5981552f7358SJed Brown { 5982552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5983552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5984552f7358SJed Brown PetscErrorCode ierr; 5985552f7358SJed Brown 5986552f7358SJed Brown PetscFunctionBegin; 5987552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5988552f7358SJed Brown if (!mesh->globalCellNumbers) { 5989552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5990552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 59910298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 59920d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5993552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5994552f7358SJed Brown } 5995552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5996552f7358SJed Brown PetscFunctionReturn(0); 5997552f7358SJed Brown } 5998552f7358SJed Brown 5999552f7358SJed Brown #undef __FUNCT__ 6000552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6001552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6002552f7358SJed Brown { 6003552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6004552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6005552f7358SJed Brown PetscErrorCode ierr; 6006552f7358SJed Brown 6007552f7358SJed Brown PetscFunctionBegin; 6008552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6009552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6010552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 60110298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 60120d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6013552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6014552f7358SJed Brown } 6015552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6016552f7358SJed Brown PetscFunctionReturn(0); 6017552f7358SJed Brown } 6018552f7358SJed Brown 6019552f7358SJed Brown 6020552f7358SJed Brown #undef __FUNCT__ 6021552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6022552f7358SJed Brown /*@C 6023552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6024552f7358SJed Brown the local section and an SF describing the section point overlap. 6025552f7358SJed Brown 6026552f7358SJed Brown Input Parameters: 6027552f7358SJed Brown + s - The PetscSection for the local field layout 6028552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6029552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6030552f7358SJed Brown . label - The label specifying the points 6031552f7358SJed Brown - labelValue - The label stratum specifying the points 6032552f7358SJed Brown 6033552f7358SJed Brown Output Parameter: 6034552f7358SJed Brown . gsection - The PetscSection for the global field layout 6035552f7358SJed Brown 6036552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6037552f7358SJed Brown 6038552f7358SJed Brown Level: developer 6039552f7358SJed Brown 6040552f7358SJed Brown .seealso: PetscSectionCreate() 6041552f7358SJed Brown @*/ 6042552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6043552f7358SJed Brown { 60447ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6045552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6046552f7358SJed Brown PetscErrorCode ierr; 6047552f7358SJed Brown 6048552f7358SJed Brown PetscFunctionBegin; 6049552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 6050552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6051552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 60527ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 60537ec39499SMatthew G. Knepley if (nroots >= 0) { 60547ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 60557ec39499SMatthew G. Knepley ierr = PetscMalloc(nroots * sizeof(PetscInt), &neg);CHKERRQ(ierr); 60567ec39499SMatthew G. Knepley ierr = PetscMemzero(neg, nroots * sizeof(PetscInt));CHKERRQ(ierr); 60577ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 60587ec39499SMatthew G. Knepley ierr = PetscMalloc(nroots * sizeof(PetscInt), &tmpOff);CHKERRQ(ierr); 60597ec39499SMatthew G. Knepley ierr = PetscMemzero(tmpOff, nroots * sizeof(PetscInt));CHKERRQ(ierr); 60607ec39499SMatthew G. Knepley } else { 60617ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 60627ec39499SMatthew G. Knepley } 60637ec39499SMatthew G. Knepley } 6064552f7358SJed Brown /* Mark ghost points with negative dof */ 6065552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6066552f7358SJed Brown PetscInt value; 6067552f7358SJed Brown 6068552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6069552f7358SJed Brown if (value != labelValue) continue; 6070552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6071552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6072552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6073552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 60747ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6075552f7358SJed Brown } 6076552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6077552f7358SJed Brown if (nroots >= 0) { 60787ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 60797ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6080552f7358SJed Brown if (nroots > pEnd-pStart) { 60817ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6082552f7358SJed Brown } 6083552f7358SJed Brown } 6084552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6085552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6086552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6087552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6088552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6089552f7358SJed Brown } 6090552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 6091552f7358SJed Brown globalOff -= off; 6092552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6093552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 60947ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6095552f7358SJed Brown } 6096552f7358SJed Brown /* Put in negative offsets for ghost points */ 6097552f7358SJed Brown if (nroots >= 0) { 60987ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 60997ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6100552f7358SJed Brown if (nroots > pEnd-pStart) { 61017ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6102552f7358SJed Brown } 6103552f7358SJed Brown } 61047ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6105552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6106552f7358SJed Brown PetscFunctionReturn(0); 6107552f7358SJed Brown } 6108ca8062c8SMatthew G. Knepley 6109ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6110ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6111ca8062c8SMatthew G. Knepley /*@ 6112ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6113ca8062c8SMatthew G. Knepley 6114ca8062c8SMatthew G. Knepley Input Parameters: 6115ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6116ca8062c8SMatthew G. Knepley 6117ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6118ca8062c8SMatthew G. Knepley 6119ca8062c8SMatthew G. Knepley Level: developer 6120ca8062c8SMatthew G. Knepley 6121ca8062c8SMatthew G. Knepley .seealso: DMCreate() 6122ca8062c8SMatthew G. Knepley @*/ 6123ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6124ca8062c8SMatthew G. Knepley { 6125ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6126ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6127ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6128ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6129ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6130ca8062c8SMatthew G. Knepley 6131ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6132ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6133ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6134ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6135ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6136ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6137ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6138ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6139ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6140ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6141ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6142ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6143ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6144ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6145ca8062c8SMatthew G. Knepley } 6146ca8062c8SMatthew G. Knepley if (s >= supportSize) { 6147ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6148ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6149ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6150ca8062c8SMatthew G. Knepley } 6151ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6152ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6153ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6154ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6155ca8062c8SMatthew G. Knepley } 6156ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6157ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6158ca8062c8SMatthew G. Knepley } 6159ca8062c8SMatthew G. Knepley } 6160ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6161ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6162ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6163ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6164ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6165ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6166ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6167ca8062c8SMatthew G. Knepley } 6168ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6169ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6170ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6171ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6172ca8062c8SMatthew G. Knepley } 6173ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6174ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6175ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6176ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6177ca8062c8SMatthew G. Knepley } 6178ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6179ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6180ca8062c8SMatthew G. Knepley } 6181ca8062c8SMatthew G. Knepley } 6182ca8062c8SMatthew G. Knepley } 6183ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6184ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6185ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6186ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6187ca8062c8SMatthew G. Knepley } 6188ca8062c8SMatthew G. Knepley 6189ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6190ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6191ca8062c8SMatthew G. Knepley /*@ 6192ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6193ca8062c8SMatthew G. Knepley 6194ca8062c8SMatthew G. Knepley Input Parameters: 6195ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6196ca8062c8SMatthew G. Knepley 6197ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6198ca8062c8SMatthew G. Knepley 6199ca8062c8SMatthew G. Knepley Level: developer 6200ca8062c8SMatthew G. Knepley 6201ca8062c8SMatthew G. Knepley .seealso: DMCreate() 6202ca8062c8SMatthew G. Knepley @*/ 6203ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex) 6204ca8062c8SMatthew G. Knepley { 6205ca8062c8SMatthew G. Knepley DM udm; 6206ca8062c8SMatthew G. Knepley PetscInt dim, numCorners, coneSize, cStart, cEnd, cMax, c; 6207ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6208ca8062c8SMatthew G. Knepley 6209ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6210ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6211ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6212ca8062c8SMatthew G. Knepley switch (dim) { 6213ca8062c8SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; break; 6214ca8062c8SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; break; 6215ca8062c8SMatthew G. Knepley default: 6216ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6217ca8062c8SMatthew G. Knepley } 6218ca8062c8SMatthew G. Knepley ierr = DMPlexUninterpolate(dm, &udm);CHKERRQ(ierr); 6219ca8062c8SMatthew G. Knepley ierr = PetscObjectSetOptionsPrefix((PetscObject) udm, "un_");CHKERRQ(ierr); 6220ca8062c8SMatthew G. Knepley ierr = DMSetFromOptions(udm);CHKERRQ(ierr); 6221ca8062c8SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 6222ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6223ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6224ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 6225ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(udm, c, &coneSize);CHKERRQ(ierr); 6226ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6227ca8062c8SMatthew G. Knepley } 6228ca8062c8SMatthew G. Knepley ierr = DMDestroy(&udm);CHKERRQ(ierr); 6229ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6230ca8062c8SMatthew G. Knepley } 6231