134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h> /*I "petscdmplex.h" I*/ 2552f7358SJed Brown #include <../src/sys/utils/hash.h> 3d53a3d6fSBarry Smith #include <petsc-private/isimpl.h> 40c312b8eSJed Brown #include <petscsf.h> 5552f7358SJed Brown 6552f7358SJed Brown /* Logging support */ 71337e6e5SMatthew G. Knepley PetscLogEvent DMPLEX_Interpolate, DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM; 8552f7358SJed Brown 95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 11552f7358SJed Brown 12552f7358SJed Brown #undef __FUNCT__ 13552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 14552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 15552f7358SJed Brown { 16552f7358SJed Brown DM dm; 17552f7358SJed Brown PetscBool isvtk; 18552f7358SJed Brown PetscErrorCode ierr; 19552f7358SJed Brown 20552f7358SJed Brown PetscFunctionBegin; 21552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 2282f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 23552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 24552f7358SJed Brown if (isvtk) { 25552f7358SJed Brown PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD; 26552f7358SJed Brown PetscSection section; 27552f7358SJed Brown PetscInt dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0; 28552f7358SJed Brown 29552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 30552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 310298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 320298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 1, &fStart, NULL);CHKERRQ(ierr); 330298fd71SBarry Smith ierr = DMPlexGetDepthStratum(dm, 0, &vStart, NULL);CHKERRQ(ierr); 34552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 35552f7358SJed Brown /* Assumes that numer of dofs per point of each stratum is constant, natural for VTK */ 36552f7358SJed Brown if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 37552f7358SJed Brown if ((fStart >= pStart) && (fStart < pEnd)) {ierr = PetscSectionGetDof(section, fStart, &fdof);CHKERRQ(ierr);} 38552f7358SJed Brown if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 39552f7358SJed Brown if (cdof && fdof && vdof) { /* Actually Q2 or some such, but visualize as Q1 */ 40552f7358SJed Brown ft = (cdof == dim) ? PETSC_VTK_POINT_VECTOR_FIELD : PETSC_VTK_POINT_FIELD; 41552f7358SJed Brown } else if (cdof && vdof) { 42ce94432eSBarry Smith SETERRQ(PetscObjectComm((PetscObject)viewer),PETSC_ERR_SUP,"No support for viewing mixed space with dofs at both vertices and cells"); 43552f7358SJed Brown } else if (cdof) { 44552f7358SJed Brown /* TODO: This assumption should be removed when there is a way of identifying whether a space is conceptually a 45552f7358SJed Brown * vector or just happens to have the same number of dofs as the dimension. */ 46552f7358SJed Brown if (cdof == dim) { 47552f7358SJed Brown ft = PETSC_VTK_CELL_VECTOR_FIELD; 48552f7358SJed Brown } else { 49552f7358SJed Brown ft = PETSC_VTK_CELL_FIELD; 50552f7358SJed Brown } 51552f7358SJed Brown } else if (vdof) { 52552f7358SJed Brown if (vdof == dim) { 53552f7358SJed Brown ft = PETSC_VTK_POINT_VECTOR_FIELD; 54552f7358SJed Brown } else { 55552f7358SJed Brown ft = PETSC_VTK_POINT_FIELD; 56552f7358SJed Brown } 5782f516ccSBarry Smith } else SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 58552f7358SJed Brown 59552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 60552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 61552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 62552f7358SJed Brown } else { 63552f7358SJed Brown PetscBool isseq; 64552f7358SJed Brown 65552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 66552f7358SJed Brown if (isseq) { 67552f7358SJed Brown ierr = VecView_Seq(v, viewer);CHKERRQ(ierr); 68552f7358SJed Brown } else { 69552f7358SJed Brown ierr = VecView_MPI(v, viewer);CHKERRQ(ierr); 70552f7358SJed Brown } 71552f7358SJed Brown } 72552f7358SJed Brown PetscFunctionReturn(0); 73552f7358SJed Brown } 74552f7358SJed Brown 75552f7358SJed Brown #undef __FUNCT__ 76552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 77552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 78552f7358SJed Brown { 79552f7358SJed Brown DM dm; 80552f7358SJed Brown PetscBool isvtk; 81552f7358SJed Brown PetscErrorCode ierr; 82552f7358SJed Brown 83552f7358SJed Brown PetscFunctionBegin; 84552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 8582f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 86552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 87552f7358SJed Brown if (isvtk) { 88552f7358SJed Brown Vec locv; 89552f7358SJed Brown const char *name; 90552f7358SJed Brown 91552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 92552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 93552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 94552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 95552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 96552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 97552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 98552f7358SJed Brown } else { 99552f7358SJed Brown PetscBool isseq; 100552f7358SJed Brown 101552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 102552f7358SJed Brown if (isseq) { 103552f7358SJed Brown ierr = VecView_Seq(v, viewer);CHKERRQ(ierr); 104552f7358SJed Brown } else { 105552f7358SJed Brown ierr = VecView_MPI(v, viewer);CHKERRQ(ierr); 106552f7358SJed Brown } 107552f7358SJed Brown } 108552f7358SJed Brown PetscFunctionReturn(0); 109552f7358SJed Brown } 110552f7358SJed Brown 111552f7358SJed Brown #undef __FUNCT__ 112552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 113552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 114552f7358SJed Brown { 115552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 116552f7358SJed Brown DM cdm; 117552f7358SJed Brown DMLabel markers; 118552f7358SJed Brown PetscSection coordSection; 119552f7358SJed Brown Vec coordinates; 120552f7358SJed Brown PetscViewerFormat format; 121552f7358SJed Brown PetscErrorCode ierr; 122552f7358SJed Brown 123552f7358SJed Brown PetscFunctionBegin; 124552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 125552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 126552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 127552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 128552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 129552f7358SJed Brown const char *name; 130552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 131552f7358SJed Brown PetscInt pStart, pEnd, p; 132552f7358SJed Brown PetscMPIInt rank, size; 133552f7358SJed Brown 13482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 13582f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 136552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 137552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 138552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 139552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 140552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 141552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 142552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 143552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 144552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 145552f7358SJed Brown PetscInt dof, off, s; 146552f7358SJed Brown 147552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 148552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 149552f7358SJed Brown for (s = off; s < off+dof; ++s) { 150552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 151552f7358SJed Brown } 152552f7358SJed Brown } 153552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 154552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 155552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 156552f7358SJed Brown PetscInt dof, off, c; 157552f7358SJed Brown 158552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 159552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 160552f7358SJed Brown for (c = off; c < off+dof; ++c) { 161552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 162552f7358SJed Brown } 163552f7358SJed Brown } 164552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 1650298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 166552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 167552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 168552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 169552f7358SJed Brown if (size > 1) { 170552f7358SJed Brown PetscSF sf; 171552f7358SJed Brown 172552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 173552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 174552f7358SJed Brown } 175552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 176552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 177552f7358SJed Brown const char *name; 178552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 179552f7358SJed Brown const int numColors = 3; 180552f7358SJed Brown PetscReal scale = 2.0; 181552f7358SJed Brown PetscScalar *coords; 182552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 183552f7358SJed Brown PetscMPIInt rank, size; 184552f7358SJed Brown 185552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18682f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 18782f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 188552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 189552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 190770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 191770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 192552f7358SJed Brown \\usepackage{tikz}\n\ 193552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 194552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 195552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 196552f7358SJed Brown \\begin{document}\n\ 197552f7358SJed Brown \\section{%s}\n\ 198770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 199770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 200770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 201770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 202770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 203770b213bSMatthew G Knepley } else if (p > 0) { 204770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 205770b213bSMatthew G Knepley } 206770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 207770b213bSMatthew G Knepley } 208770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 209770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 210552f7358SJed Brown /* Plot vertices */ 211552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 212552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 213552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 214552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 215552f7358SJed Brown PetscInt off, dof, d; 216552f7358SJed Brown 217552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 218552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 220552f7358SJed Brown for (d = 0; d < dof; ++d) { 221552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2226712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 223552f7358SJed Brown } 224552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 225552f7358SJed Brown } 226552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 227552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 228552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 229552f7358SJed Brown /* Plot edges */ 230552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 231552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 232552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 233552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 234552f7358SJed Brown const PetscInt *cone; 235552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 236552f7358SJed Brown 237552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 23882f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 239552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 240552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 241552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 242552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 243552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 244552f7358SJed Brown for (d = 0; d < dof; ++d) { 245552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2466712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 247552f7358SJed Brown } 248552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 249552f7358SJed Brown } 250552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 251552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 253552f7358SJed Brown /* Plot cells */ 254552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 255552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2560298fd71SBarry Smith PetscInt *closure = NULL; 257552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 258552f7358SJed Brown 259552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 260552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 261552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 262552f7358SJed Brown const PetscInt point = closure[p]; 263552f7358SJed Brown 264552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 265552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 266552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 267552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 268552f7358SJed Brown } 269552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 270552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 271552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 272552f7358SJed Brown } 273552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 274552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 275770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 276552f7358SJed Brown } else { 27782f516ccSBarry Smith MPI_Comm comm; 278834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 279834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 280552f7358SJed Brown PetscInt pStart, pEnd, p; 281a57dd577SMatthew G Knepley PetscInt numLabels, l; 2821143a3c0SMatthew G. Knepley const char *name; 283552f7358SJed Brown PetscMPIInt size; 284552f7358SJed Brown 28582f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 286552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 287552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2885f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 2891143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 2901143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 291552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 292552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 293834065abSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 294dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 295552f7358SJed Brown if (depth == 1) { 296552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 297552f7358SJed Brown pEnd = pEnd - pStart; 298552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 299552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 300552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 301552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 302552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 303552f7358SJed Brown pEnd = pEnd - pStart; 304552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 305552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 306552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 307552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 308552f7358SJed Brown } else { 309552f7358SJed Brown for (d = 0; d <= dim; d++) { 310552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 311834065abSMatthew G. Knepley pEnd -= pStart; 312834065abSMatthew G. Knepley pMax[d] -= pStart; 313552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 314834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 315552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 316834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 317834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 318834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 319834065abSMatthew G. Knepley } 320552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 321552f7358SJed Brown } 322552f7358SJed Brown } 323834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 324a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 325a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 326a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 327a57dd577SMatthew G Knepley DMLabel label; 328a57dd577SMatthew G Knepley const char *name; 329a57dd577SMatthew G Knepley IS valueIS; 330a57dd577SMatthew G Knepley const PetscInt *values; 331a57dd577SMatthew G Knepley PetscInt numValues, v; 332a57dd577SMatthew G Knepley 333a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 334a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 335a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 336a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 337a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 338a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 339a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 340a57dd577SMatthew G Knepley PetscInt size; 341a57dd577SMatthew G Knepley 342a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 343a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 344a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 345a57dd577SMatthew G Knepley } 346a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 347a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 3484d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 349a57dd577SMatthew G Knepley } 350552f7358SJed Brown } 351552f7358SJed Brown PetscFunctionReturn(0); 352552f7358SJed Brown } 353552f7358SJed Brown 354552f7358SJed Brown #undef __FUNCT__ 355552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 356552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 357552f7358SJed Brown { 358552f7358SJed Brown PetscBool iascii, isbinary; 359552f7358SJed Brown PetscErrorCode ierr; 360552f7358SJed Brown 361552f7358SJed Brown PetscFunctionBegin; 362552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 363552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 364552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 365552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr); 366552f7358SJed Brown if (iascii) { 367552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 368552f7358SJed Brown #if 0 369552f7358SJed Brown } else if (isbinary) { 370552f7358SJed Brown ierr = DMPlexView_Binary(dm, viewer);CHKERRQ(ierr); 371552f7358SJed Brown #endif 37211aeaf0aSBarry Smith } 373552f7358SJed Brown PetscFunctionReturn(0); 374552f7358SJed Brown } 375552f7358SJed Brown 376552f7358SJed Brown #undef __FUNCT__ 3776c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 3786c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 3796c73c22cSMatthew G. Knepley { 3806c73c22cSMatthew G. Knepley DMBoundary b, next; 3816c73c22cSMatthew G. Knepley PetscErrorCode ierr; 3826c73c22cSMatthew G. Knepley 3836c73c22cSMatthew G. Knepley PetscFunctionBeginUser; 3846c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 3856c73c22cSMatthew G. Knepley b = *boundary; 3866c73c22cSMatthew G. Knepley *boundary = NULL; 3876c73c22cSMatthew G. Knepley for (; b; b = next) { 3886c73c22cSMatthew G. Knepley next = b->next; 3896c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 3906c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 3916c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 3926c73c22cSMatthew G. Knepley } 3936c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 3946c73c22cSMatthew G. Knepley } 3956c73c22cSMatthew G. Knepley 3966c73c22cSMatthew G. Knepley #undef __FUNCT__ 397552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 398552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 399552f7358SJed Brown { 400552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 401552f7358SJed Brown DMLabel next = mesh->labels; 402552f7358SJed Brown PetscErrorCode ierr; 403552f7358SJed Brown 404552f7358SJed Brown PetscFunctionBegin; 4050d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 406552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 407552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 408552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 409552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 410552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 411552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 412552f7358SJed Brown while (next) { 413552f7358SJed Brown DMLabel tmp = next->next; 414552f7358SJed Brown 415552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 416552f7358SJed Brown next = tmp; 417552f7358SJed Brown } 4183913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 419a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 420552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 421552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 4226c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 423552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 424552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 425552f7358SJed Brown PetscFunctionReturn(0); 426552f7358SJed Brown } 427552f7358SJed Brown 428552f7358SJed Brown #undef __FUNCT__ 429552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 430b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 431552f7358SJed Brown { 432552f7358SJed Brown PetscSection section, sectionGlobal; 433552f7358SJed Brown PetscInt bs = -1; 434552f7358SJed Brown PetscInt localSize; 43589545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 436552f7358SJed Brown PetscErrorCode ierr; 437b412c318SBarry Smith MatType mtype; 438552f7358SJed Brown 439552f7358SJed Brown PetscFunctionBegin; 440607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 441b412c318SBarry Smith mtype = dm->mattype; 442552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 443552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 444552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 445552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 44682f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 447552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 448552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 449552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 450552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 451552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 452552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 453552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 454552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 455552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 456552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 457552f7358SJed Brown if (!isShell) { 458552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 4592a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 460552f7358SJed Brown 461552f7358SJed Brown if (bs < 0) { 462552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 463fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 464552f7358SJed Brown 465552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 466552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 467552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 468fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 469fad22124SMatthew G Knepley if (dof-cdof) { 4702a28c762SMatthew G Knepley if (bs < 0) { 471fad22124SMatthew G Knepley bs = dof-cdof; 472fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 4732a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 4742a28c762SMatthew G Knepley bs = 1; 475552f7358SJed Brown break; 476552f7358SJed Brown } 477552f7358SJed Brown } 4782a28c762SMatthew G Knepley } 4792a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 4802a28c762SMatthew G Knepley bsLocal = bs; 48182f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4822a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 48382f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 4842a28c762SMatthew G Knepley if (bsMin != bsMax) { 4852a28c762SMatthew G Knepley bs = 1; 4862a28c762SMatthew G Knepley } else { 4872a28c762SMatthew G Knepley bs = bsMax; 4882a28c762SMatthew G Knepley } 489552f7358SJed Brown } else { 490552f7358SJed Brown bs = 1; 491552f7358SJed Brown } 492552f7358SJed Brown } 4931795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 494552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 495552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 496552f7358SJed Brown } 497552f7358SJed Brown PetscFunctionReturn(0); 498552f7358SJed Brown } 499552f7358SJed Brown 500552f7358SJed Brown #undef __FUNCT__ 501552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 502552f7358SJed Brown /*@ 503552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 504552f7358SJed Brown 505552f7358SJed Brown Not collective 506552f7358SJed Brown 507552f7358SJed Brown Input Parameter: 508552f7358SJed Brown . mesh - The DMPlex 509552f7358SJed Brown 510552f7358SJed Brown Output Parameter: 511552f7358SJed Brown . dim - The topological mesh dimension 512552f7358SJed Brown 513552f7358SJed Brown Level: beginner 514552f7358SJed Brown 515552f7358SJed Brown .seealso: DMPlexCreate() 516552f7358SJed Brown @*/ 517552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 518552f7358SJed Brown { 519552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 520552f7358SJed Brown 521552f7358SJed Brown PetscFunctionBegin; 522552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 523552f7358SJed Brown PetscValidPointer(dim, 2); 524552f7358SJed Brown *dim = mesh->dim; 525552f7358SJed Brown PetscFunctionReturn(0); 526552f7358SJed Brown } 527552f7358SJed Brown 528552f7358SJed Brown #undef __FUNCT__ 529552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 530552f7358SJed Brown /*@ 531552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 532552f7358SJed Brown 533552f7358SJed Brown Collective on mesh 534552f7358SJed Brown 535552f7358SJed Brown Input Parameters: 536552f7358SJed Brown + mesh - The DMPlex 537552f7358SJed Brown - dim - The topological mesh dimension 538552f7358SJed Brown 539552f7358SJed Brown Level: beginner 540552f7358SJed Brown 541552f7358SJed Brown .seealso: DMPlexCreate() 542552f7358SJed Brown @*/ 543552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 544552f7358SJed Brown { 545552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 546552f7358SJed Brown 547552f7358SJed Brown PetscFunctionBegin; 548552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 549552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 550552f7358SJed Brown mesh->dim = dim; 551552f7358SJed Brown mesh->preallocCenterDim = dim; 552552f7358SJed Brown PetscFunctionReturn(0); 553552f7358SJed Brown } 554552f7358SJed Brown 555552f7358SJed Brown #undef __FUNCT__ 556552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 557552f7358SJed Brown /*@ 558552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 559552f7358SJed Brown 560552f7358SJed Brown Not collective 561552f7358SJed Brown 562552f7358SJed Brown Input Parameter: 563552f7358SJed Brown . mesh - The DMPlex 564552f7358SJed Brown 565552f7358SJed Brown Output Parameters: 566552f7358SJed Brown + pStart - The first mesh point 567552f7358SJed Brown - pEnd - The upper bound for mesh points 568552f7358SJed Brown 569552f7358SJed Brown Level: beginner 570552f7358SJed Brown 571552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 572552f7358SJed Brown @*/ 573552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 574552f7358SJed Brown { 575552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 576552f7358SJed Brown PetscErrorCode ierr; 577552f7358SJed Brown 578552f7358SJed Brown PetscFunctionBegin; 579552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 580552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 581552f7358SJed Brown PetscFunctionReturn(0); 582552f7358SJed Brown } 583552f7358SJed Brown 584552f7358SJed Brown #undef __FUNCT__ 585552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 586552f7358SJed Brown /*@ 587552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 588552f7358SJed Brown 589552f7358SJed Brown Not collective 590552f7358SJed Brown 591552f7358SJed Brown Input Parameters: 592552f7358SJed Brown + mesh - The DMPlex 593552f7358SJed Brown . pStart - The first mesh point 594552f7358SJed Brown - pEnd - The upper bound for mesh points 595552f7358SJed Brown 596552f7358SJed Brown Output Parameters: 597552f7358SJed Brown 598552f7358SJed Brown Level: beginner 599552f7358SJed Brown 600552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 601552f7358SJed Brown @*/ 602552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 603552f7358SJed Brown { 604552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 605552f7358SJed Brown PetscErrorCode ierr; 606552f7358SJed Brown 607552f7358SJed Brown PetscFunctionBegin; 608552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 609552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 610552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 611552f7358SJed Brown PetscFunctionReturn(0); 612552f7358SJed Brown } 613552f7358SJed Brown 614552f7358SJed Brown #undef __FUNCT__ 615552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 616552f7358SJed Brown /*@ 617552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 618552f7358SJed Brown 619552f7358SJed Brown Not collective 620552f7358SJed Brown 621552f7358SJed Brown Input Parameters: 622552f7358SJed Brown + mesh - The DMPlex 623552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 624552f7358SJed Brown 625552f7358SJed Brown Output Parameter: 626552f7358SJed Brown . size - The cone size for point p 627552f7358SJed Brown 628552f7358SJed Brown Level: beginner 629552f7358SJed Brown 630552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 631552f7358SJed Brown @*/ 632552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 633552f7358SJed Brown { 634552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 635552f7358SJed Brown PetscErrorCode ierr; 636552f7358SJed Brown 637552f7358SJed Brown PetscFunctionBegin; 638552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 639552f7358SJed Brown PetscValidPointer(size, 3); 640552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 641552f7358SJed Brown PetscFunctionReturn(0); 642552f7358SJed Brown } 643552f7358SJed Brown 644552f7358SJed Brown #undef __FUNCT__ 645552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 646552f7358SJed Brown /*@ 647552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 648552f7358SJed Brown 649552f7358SJed Brown Not collective 650552f7358SJed Brown 651552f7358SJed Brown Input Parameters: 652552f7358SJed Brown + mesh - The DMPlex 653552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 654552f7358SJed Brown - size - The cone size for point p 655552f7358SJed Brown 656552f7358SJed Brown Output Parameter: 657552f7358SJed Brown 658552f7358SJed Brown Note: 659552f7358SJed Brown This should be called after DMPlexSetChart(). 660552f7358SJed Brown 661552f7358SJed Brown Level: beginner 662552f7358SJed Brown 663552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 664552f7358SJed Brown @*/ 665552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 666552f7358SJed Brown { 667552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 668552f7358SJed Brown PetscErrorCode ierr; 669552f7358SJed Brown 670552f7358SJed Brown PetscFunctionBegin; 671552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 672552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 6730d644c17SKarl Rupp 674552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 675552f7358SJed Brown PetscFunctionReturn(0); 676552f7358SJed Brown } 677552f7358SJed Brown 678552f7358SJed Brown #undef __FUNCT__ 679552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 680552f7358SJed Brown /*@C 681552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 682552f7358SJed Brown 683552f7358SJed Brown Not collective 684552f7358SJed Brown 685552f7358SJed Brown Input Parameters: 686552f7358SJed Brown + mesh - The DMPlex 687552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 688552f7358SJed Brown 689552f7358SJed Brown Output Parameter: 690552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 691552f7358SJed Brown 692552f7358SJed Brown Level: beginner 693552f7358SJed Brown 6943813dfbdSMatthew G Knepley Fortran Notes: 6953813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 6963813dfbdSMatthew G Knepley include petsc.h90 in your code. 6973813dfbdSMatthew G Knepley 6983813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 699552f7358SJed Brown 700552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 701552f7358SJed Brown @*/ 702552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 703552f7358SJed Brown { 704552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 705552f7358SJed Brown PetscInt off; 706552f7358SJed Brown PetscErrorCode ierr; 707552f7358SJed Brown 708552f7358SJed Brown PetscFunctionBegin; 709552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 710552f7358SJed Brown PetscValidPointer(cone, 3); 711552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 712552f7358SJed Brown *cone = &mesh->cones[off]; 713552f7358SJed Brown PetscFunctionReturn(0); 714552f7358SJed Brown } 715552f7358SJed Brown 716552f7358SJed Brown #undef __FUNCT__ 717552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 718552f7358SJed Brown /*@ 719552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 720552f7358SJed Brown 721552f7358SJed Brown Not collective 722552f7358SJed Brown 723552f7358SJed Brown Input Parameters: 724552f7358SJed Brown + mesh - The DMPlex 725552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 726552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 727552f7358SJed Brown 728552f7358SJed Brown Output Parameter: 729552f7358SJed Brown 730552f7358SJed Brown Note: 731552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 732552f7358SJed Brown 733552f7358SJed Brown Level: beginner 734552f7358SJed Brown 735552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 736552f7358SJed Brown @*/ 737552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 738552f7358SJed Brown { 739552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 740552f7358SJed Brown PetscInt pStart, pEnd; 741552f7358SJed Brown PetscInt dof, off, c; 742552f7358SJed Brown PetscErrorCode ierr; 743552f7358SJed Brown 744552f7358SJed Brown PetscFunctionBegin; 745552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 746552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 747552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 748552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 749552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 75082f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 751552f7358SJed Brown for (c = 0; c < dof; ++c) { 75282f516ccSBarry Smith if ((cone[c] < pStart) || (cone[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", cone[c], pStart, pEnd); 753552f7358SJed Brown mesh->cones[off+c] = cone[c]; 754552f7358SJed Brown } 755552f7358SJed Brown PetscFunctionReturn(0); 756552f7358SJed Brown } 757552f7358SJed Brown 758552f7358SJed Brown #undef __FUNCT__ 759552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 760552f7358SJed Brown /*@C 761552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 762552f7358SJed Brown 763552f7358SJed Brown Not collective 764552f7358SJed Brown 765552f7358SJed Brown Input Parameters: 766552f7358SJed Brown + mesh - The DMPlex 767552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 768552f7358SJed Brown 769552f7358SJed Brown Output Parameter: 770552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 771552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 772552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 773552f7358SJed Brown the index of the cone point on which to start. 774552f7358SJed Brown 775552f7358SJed Brown Level: beginner 776552f7358SJed Brown 7773813dfbdSMatthew G Knepley Fortran Notes: 7783813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 7793813dfbdSMatthew G Knepley include petsc.h90 in your code. 7803813dfbdSMatthew G Knepley 7813813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 782552f7358SJed Brown 783552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 784552f7358SJed Brown @*/ 785552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 786552f7358SJed Brown { 787552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 788552f7358SJed Brown PetscInt off; 789552f7358SJed Brown PetscErrorCode ierr; 790552f7358SJed Brown 791552f7358SJed Brown PetscFunctionBegin; 792552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 793552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 794552f7358SJed Brown { 795552f7358SJed Brown PetscInt dof; 796552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 797552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 798552f7358SJed Brown } 799552f7358SJed Brown #endif 800552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 8010d644c17SKarl Rupp 802552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 803552f7358SJed Brown PetscFunctionReturn(0); 804552f7358SJed Brown } 805552f7358SJed Brown 806552f7358SJed Brown #undef __FUNCT__ 807552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 808552f7358SJed Brown /*@ 809552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 810552f7358SJed Brown 811552f7358SJed Brown Not collective 812552f7358SJed Brown 813552f7358SJed Brown Input Parameters: 814552f7358SJed Brown + mesh - The DMPlex 815552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 816552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 817552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 818552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 819552f7358SJed Brown the index of the cone point on which to start. 820552f7358SJed Brown 821552f7358SJed Brown Output Parameter: 822552f7358SJed Brown 823552f7358SJed Brown Note: 824552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 825552f7358SJed Brown 826552f7358SJed Brown Level: beginner 827552f7358SJed Brown 828552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 829552f7358SJed Brown @*/ 830552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 831552f7358SJed Brown { 832552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 833552f7358SJed Brown PetscInt pStart, pEnd; 834552f7358SJed Brown PetscInt dof, off, c; 835552f7358SJed Brown PetscErrorCode ierr; 836552f7358SJed Brown 837552f7358SJed Brown PetscFunctionBegin; 838552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 839552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 840552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 841552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 842552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 84382f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 844552f7358SJed Brown for (c = 0; c < dof; ++c) { 845552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 846552f7358SJed Brown 847552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 84882f516ccSBarry Smith if (o && ((o < -(cdof+1)) || (o >= cdof))) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone orientation %D is not in the valid range [%D. %D)", o, -(cdof+1), cdof); 849552f7358SJed Brown mesh->coneOrientations[off+c] = o; 850552f7358SJed Brown } 851552f7358SJed Brown PetscFunctionReturn(0); 852552f7358SJed Brown } 853552f7358SJed Brown 854552f7358SJed Brown #undef __FUNCT__ 855552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 856552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 857552f7358SJed Brown { 858552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 859552f7358SJed Brown PetscInt pStart, pEnd; 860552f7358SJed Brown PetscInt dof, off; 861552f7358SJed Brown PetscErrorCode ierr; 862552f7358SJed Brown 863552f7358SJed Brown PetscFunctionBegin; 864552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 865552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 86682f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 86782f516ccSBarry Smith if ((conePoint < pStart) || (conePoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", conePoint, pStart, pEnd); 86877c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 86977c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 87077c88f5bSMatthew G Knepley if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof); 871552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 872552f7358SJed Brown PetscFunctionReturn(0); 873552f7358SJed Brown } 874552f7358SJed Brown 875552f7358SJed Brown #undef __FUNCT__ 87677c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 87777c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 87877c88f5bSMatthew G Knepley { 87977c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 88077c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 88177c88f5bSMatthew G Knepley PetscInt dof, off; 88277c88f5bSMatthew G Knepley PetscErrorCode ierr; 88377c88f5bSMatthew G Knepley 88477c88f5bSMatthew G Knepley PetscFunctionBegin; 88577c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 88677c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 88777c88f5bSMatthew G Knepley if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 88877c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 88977c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 89077c88f5bSMatthew G Knepley if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof); 89177c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 89277c88f5bSMatthew G Knepley PetscFunctionReturn(0); 89377c88f5bSMatthew G Knepley } 89477c88f5bSMatthew G Knepley 89577c88f5bSMatthew G Knepley #undef __FUNCT__ 896552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 897552f7358SJed Brown /*@ 898552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 899552f7358SJed Brown 900552f7358SJed Brown Not collective 901552f7358SJed Brown 902552f7358SJed Brown Input Parameters: 903552f7358SJed Brown + mesh - The DMPlex 904552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 905552f7358SJed Brown 906552f7358SJed Brown Output Parameter: 907552f7358SJed Brown . size - The support size for point p 908552f7358SJed Brown 909552f7358SJed Brown Level: beginner 910552f7358SJed Brown 911552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 912552f7358SJed Brown @*/ 913552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 914552f7358SJed Brown { 915552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 916552f7358SJed Brown PetscErrorCode ierr; 917552f7358SJed Brown 918552f7358SJed Brown PetscFunctionBegin; 919552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 920552f7358SJed Brown PetscValidPointer(size, 3); 921552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 922552f7358SJed Brown PetscFunctionReturn(0); 923552f7358SJed Brown } 924552f7358SJed Brown 925552f7358SJed Brown #undef __FUNCT__ 926552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 927552f7358SJed Brown /*@ 928552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 929552f7358SJed Brown 930552f7358SJed Brown Not collective 931552f7358SJed Brown 932552f7358SJed Brown Input Parameters: 933552f7358SJed Brown + mesh - The DMPlex 934552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 935552f7358SJed Brown - size - The support size for point p 936552f7358SJed Brown 937552f7358SJed Brown Output Parameter: 938552f7358SJed Brown 939552f7358SJed Brown Note: 940552f7358SJed Brown This should be called after DMPlexSetChart(). 941552f7358SJed Brown 942552f7358SJed Brown Level: beginner 943552f7358SJed Brown 944552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 945552f7358SJed Brown @*/ 946552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 947552f7358SJed Brown { 948552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 949552f7358SJed Brown PetscErrorCode ierr; 950552f7358SJed Brown 951552f7358SJed Brown PetscFunctionBegin; 952552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 953552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 9540d644c17SKarl Rupp 955552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 956552f7358SJed Brown PetscFunctionReturn(0); 957552f7358SJed Brown } 958552f7358SJed Brown 959552f7358SJed Brown #undef __FUNCT__ 960552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 961552f7358SJed Brown /*@C 962552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 963552f7358SJed Brown 964552f7358SJed Brown Not collective 965552f7358SJed Brown 966552f7358SJed Brown Input Parameters: 967552f7358SJed Brown + mesh - The DMPlex 968552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 969552f7358SJed Brown 970552f7358SJed Brown Output Parameter: 971552f7358SJed Brown . support - An array of points which are on the out-edges for point p 972552f7358SJed Brown 973552f7358SJed Brown Level: beginner 974552f7358SJed Brown 9753813dfbdSMatthew G Knepley Fortran Notes: 9763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 9773813dfbdSMatthew G Knepley include petsc.h90 in your code. 9783813dfbdSMatthew G Knepley 9793813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 9803813dfbdSMatthew G Knepley 981552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 982552f7358SJed Brown @*/ 983552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 984552f7358SJed Brown { 985552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 986552f7358SJed Brown PetscInt off; 987552f7358SJed Brown PetscErrorCode ierr; 988552f7358SJed Brown 989552f7358SJed Brown PetscFunctionBegin; 990552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 991552f7358SJed Brown PetscValidPointer(support, 3); 992552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 993552f7358SJed Brown *support = &mesh->supports[off]; 994552f7358SJed Brown PetscFunctionReturn(0); 995552f7358SJed Brown } 996552f7358SJed Brown 997552f7358SJed Brown #undef __FUNCT__ 998552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 999552f7358SJed Brown /*@ 1000552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1001552f7358SJed Brown 1002552f7358SJed Brown Not collective 1003552f7358SJed Brown 1004552f7358SJed Brown Input Parameters: 1005552f7358SJed Brown + mesh - The DMPlex 1006552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1007552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1008552f7358SJed Brown 1009552f7358SJed Brown Output Parameter: 1010552f7358SJed Brown 1011552f7358SJed Brown Note: 1012552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1013552f7358SJed Brown 1014552f7358SJed Brown Level: beginner 1015552f7358SJed Brown 1016552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1017552f7358SJed Brown @*/ 1018552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1019552f7358SJed Brown { 1020552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1021552f7358SJed Brown PetscInt pStart, pEnd; 1022552f7358SJed Brown PetscInt dof, off, c; 1023552f7358SJed Brown PetscErrorCode ierr; 1024552f7358SJed Brown 1025552f7358SJed Brown PetscFunctionBegin; 1026552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1027552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1028552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1029552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1030552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 103182f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 1032552f7358SJed Brown for (c = 0; c < dof; ++c) { 103382f516ccSBarry Smith if ((support[c] < pStart) || (support[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", support[c], pStart, pEnd); 1034552f7358SJed Brown mesh->supports[off+c] = support[c]; 1035552f7358SJed Brown } 1036552f7358SJed Brown PetscFunctionReturn(0); 1037552f7358SJed Brown } 1038552f7358SJed Brown 1039552f7358SJed Brown #undef __FUNCT__ 1040552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1041552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1042552f7358SJed Brown { 1043552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1044552f7358SJed Brown PetscInt pStart, pEnd; 1045552f7358SJed Brown PetscInt dof, off; 1046552f7358SJed Brown PetscErrorCode ierr; 1047552f7358SJed Brown 1048552f7358SJed Brown PetscFunctionBegin; 1049552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1050552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1051552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1052552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 105382f516ccSBarry Smith if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd); 105482f516ccSBarry Smith if ((supportPoint < pStart) || (supportPoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", supportPoint, pStart, pEnd); 105582f516ccSBarry Smith if (supportPos >= dof) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support position %D of point %D is not in the valid range [0, %D)", supportPos, p, dof); 1056552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1057552f7358SJed Brown PetscFunctionReturn(0); 1058552f7358SJed Brown } 1059552f7358SJed Brown 1060552f7358SJed Brown #undef __FUNCT__ 1061552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1062552f7358SJed Brown /*@C 1063552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1064552f7358SJed Brown 1065552f7358SJed Brown Not collective 1066552f7358SJed Brown 1067552f7358SJed Brown Input Parameters: 1068552f7358SJed Brown + mesh - The DMPlex 1069552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1070552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 10710298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1072552f7358SJed Brown 1073552f7358SJed Brown Output Parameters: 1074552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1075552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1076552f7358SJed Brown 1077552f7358SJed Brown Note: 10780298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1079552f7358SJed Brown 10803813dfbdSMatthew G Knepley Fortran Notes: 10813813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10823813dfbdSMatthew G Knepley include petsc.h90 in your code. 10833813dfbdSMatthew G Knepley 10843813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 10853813dfbdSMatthew G Knepley 1086552f7358SJed Brown Level: beginner 1087552f7358SJed Brown 1088552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1089552f7358SJed Brown @*/ 1090552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1091552f7358SJed Brown { 1092552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1093552f7358SJed Brown PetscInt *closure, *fifo; 10940298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1095552f7358SJed Brown PetscInt tmpSize, t; 1096552f7358SJed Brown PetscInt depth = 0, maxSize; 1097552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1098552f7358SJed Brown PetscErrorCode ierr; 1099552f7358SJed Brown 1100552f7358SJed Brown PetscFunctionBegin; 1101552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1102552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1103552f7358SJed Brown /* This is only 1-level */ 1104552f7358SJed Brown if (useCone) { 1105552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1106552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1107552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1108552f7358SJed Brown } else { 1109552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1110552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1111552f7358SJed Brown } 1112bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1113bfbcdd7aSMatthew G. Knepley if (*points) { 1114bfbcdd7aSMatthew G. Knepley closure = *points; 1115bfbcdd7aSMatthew G. Knepley } else { 1116bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1117bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1118bfbcdd7aSMatthew G. Knepley } 1119bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1120bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1121bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1122bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1123bfbcdd7aSMatthew G. Knepley } 1124bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1125bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1126bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1127bfbcdd7aSMatthew G. Knepley } 1128bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1129bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1130bfbcdd7aSMatthew G. Knepley if (*points) { 1131bfbcdd7aSMatthew G. Knepley closure = *points; 1132bfbcdd7aSMatthew G. Knepley } else { 1133bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1134bfbcdd7aSMatthew G. Knepley } 1135bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1136552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1137552f7358SJed Brown const PetscInt cp = tmp[t]; 1138552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1139552f7358SJed Brown 1140552f7358SJed Brown closure[closureSize] = cp; 1141552f7358SJed Brown closure[closureSize+1] = co; 1142552f7358SJed Brown fifo[fifoSize] = cp; 1143552f7358SJed Brown fifo[fifoSize+1] = co; 1144552f7358SJed Brown } 1145bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1146552f7358SJed Brown while (fifoSize - fifoStart) { 1147552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1148552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1149552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1150552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1151552f7358SJed Brown 1152552f7358SJed Brown if (useCone) { 1153552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1154552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1155552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1156552f7358SJed Brown } else { 1157552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1158552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 11590298fd71SBarry Smith tmpO = NULL; 1160552f7358SJed Brown } 1161552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1162552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1163552f7358SJed Brown const PetscInt cp = tmp[i]; 11642e1b13c2SMatthew G. Knepley /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */ 11652e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 11662e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 11672e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1168552f7358SJed Brown PetscInt c; 1169552f7358SJed Brown 11702e1b13c2SMatthew G. Knepley if (rev) { 11712e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 11722e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 11732e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 11742e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 11752e1b13c2SMatthew G. Knepley } 1176552f7358SJed Brown /* Check for duplicate */ 1177552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1178552f7358SJed Brown if (closure[c] == cp) break; 1179552f7358SJed Brown } 1180552f7358SJed Brown if (c == closureSize) { 1181552f7358SJed Brown closure[closureSize] = cp; 1182552f7358SJed Brown closure[closureSize+1] = co; 1183552f7358SJed Brown fifo[fifoSize] = cp; 1184552f7358SJed Brown fifo[fifoSize+1] = co; 1185552f7358SJed Brown closureSize += 2; 1186552f7358SJed Brown fifoSize += 2; 1187552f7358SJed Brown } 1188552f7358SJed Brown } 1189552f7358SJed Brown fifoStart += 2; 1190552f7358SJed Brown } 1191552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1192552f7358SJed Brown if (points) *points = closure; 1193552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1194552f7358SJed Brown PetscFunctionReturn(0); 1195552f7358SJed Brown } 1196552f7358SJed Brown 1197552f7358SJed Brown #undef __FUNCT__ 11989bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 11999bf0dad6SMatthew G. Knepley /*@C 12009bf0dad6SMatthew G. Knepley DMPlexGetTransitiveClosure_Internal - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG with a specified initial orientation 12019bf0dad6SMatthew G. Knepley 12029bf0dad6SMatthew G. Knepley Not collective 12039bf0dad6SMatthew G. Knepley 12049bf0dad6SMatthew G. Knepley Input Parameters: 12059bf0dad6SMatthew G. Knepley + mesh - The DMPlex 12069bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 12079bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 12089bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 12099bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 12109bf0dad6SMatthew G. Knepley 12119bf0dad6SMatthew G. Knepley Output Parameters: 12129bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 12139bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 12149bf0dad6SMatthew G. Knepley 12159bf0dad6SMatthew G. Knepley Note: 12169bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 12179bf0dad6SMatthew G. Knepley 12189bf0dad6SMatthew G. Knepley Fortran Notes: 12199bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12209bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 12219bf0dad6SMatthew G. Knepley 12229bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12239bf0dad6SMatthew G. Knepley 12249bf0dad6SMatthew G. Knepley Level: beginner 12259bf0dad6SMatthew G. Knepley 12269bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 12279bf0dad6SMatthew G. Knepley @*/ 12289bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 12299bf0dad6SMatthew G. Knepley { 12309bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 12319bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 12329bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 12339bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 12349bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 12359bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 12369bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 12379bf0dad6SMatthew G. Knepley 12389bf0dad6SMatthew G. Knepley PetscFunctionBegin; 12399bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 12409bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 12419bf0dad6SMatthew G. Knepley /* This is only 1-level */ 12429bf0dad6SMatthew G. Knepley if (useCone) { 12439bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 12449bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 12459bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 12469bf0dad6SMatthew G. Knepley } else { 12479bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 12489bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 12499bf0dad6SMatthew G. Knepley } 12509bf0dad6SMatthew G. Knepley if (depth == 1) { 12519bf0dad6SMatthew G. Knepley if (*points) { 12529bf0dad6SMatthew G. Knepley closure = *points; 12539bf0dad6SMatthew G. Knepley } else { 12549bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 12559bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12569bf0dad6SMatthew G. Knepley } 12579bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12589bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 12599bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12609bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 12619bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 12629bf0dad6SMatthew G. Knepley } 12639bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 12649bf0dad6SMatthew G. Knepley if (points) *points = closure; 12659bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 12669bf0dad6SMatthew G. Knepley } 12679bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 12689bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 12699bf0dad6SMatthew G. Knepley if (*points) { 12709bf0dad6SMatthew G. Knepley closure = *points; 12719bf0dad6SMatthew G. Knepley } else { 12729bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 12739bf0dad6SMatthew G. Knepley } 12749bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 12759bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 12769bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 12779bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 12789bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 12799bf0dad6SMatthew G. Knepley 12809bf0dad6SMatthew G. Knepley if (ornt < 0) { 12819bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 12829bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12839bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12849bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12859bf0dad6SMatthew G. Knepley } 12869bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 12879bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 12889bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 12899bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 12909bf0dad6SMatthew G. Knepley } 12919bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 12929bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 12939bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 12949bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 12959bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 12969bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 12979bf0dad6SMatthew G. Knepley 12989bf0dad6SMatthew G. Knepley if (useCone) { 12999bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 13009bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 13019bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 13029bf0dad6SMatthew G. Knepley } else { 13039bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 13049bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 13059bf0dad6SMatthew G. Knepley tmpO = NULL; 13069bf0dad6SMatthew G. Knepley } 13079bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 13089bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 13099bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13109bf0dad6SMatthew G. Knepley /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */ 13119bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 13129bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 13139bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13149bf0dad6SMatthew G. Knepley PetscInt c; 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley if (rev) { 13179bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13189bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13199bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13209bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13219bf0dad6SMatthew G. Knepley } 13229bf0dad6SMatthew G. Knepley /* Check for duplicate */ 13239bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 13249bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 13259bf0dad6SMatthew G. Knepley } 13269bf0dad6SMatthew G. Knepley if (c == closureSize) { 13279bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13289bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 13299bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 13309bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 13319bf0dad6SMatthew G. Knepley closureSize += 2; 13329bf0dad6SMatthew G. Knepley fifoSize += 2; 13339bf0dad6SMatthew G. Knepley } 13349bf0dad6SMatthew G. Knepley } 13359bf0dad6SMatthew G. Knepley fifoStart += 2; 13369bf0dad6SMatthew G. Knepley } 13379bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13389bf0dad6SMatthew G. Knepley if (points) *points = closure; 13399bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13409bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13419bf0dad6SMatthew G. Knepley } 13429bf0dad6SMatthew G. Knepley 13439bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1344552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1345552f7358SJed Brown /*@C 1346552f7358SJed Brown DMPlexRestoreTransitiveClosure - Restore the array of points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1347552f7358SJed Brown 1348552f7358SJed Brown Not collective 1349552f7358SJed Brown 1350552f7358SJed Brown Input Parameters: 1351552f7358SJed Brown + mesh - The DMPlex 1352552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1353552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1354e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1355e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1356552f7358SJed Brown 1357552f7358SJed Brown Note: 13580298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1359552f7358SJed Brown 13603813dfbdSMatthew G Knepley Fortran Notes: 13613813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13623813dfbdSMatthew G Knepley include petsc.h90 in your code. 13633813dfbdSMatthew G Knepley 13643813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13653813dfbdSMatthew G Knepley 1366552f7358SJed Brown Level: beginner 1367552f7358SJed Brown 1368552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1369552f7358SJed Brown @*/ 1370552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1371552f7358SJed Brown { 1372552f7358SJed Brown PetscErrorCode ierr; 1373552f7358SJed Brown 1374552f7358SJed Brown PetscFunctionBegin; 1375552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1376e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1377e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1378552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 13794ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1380552f7358SJed Brown PetscFunctionReturn(0); 1381552f7358SJed Brown } 1382552f7358SJed Brown 1383552f7358SJed Brown #undef __FUNCT__ 1384552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1385552f7358SJed Brown /*@ 1386552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1387552f7358SJed Brown 1388552f7358SJed Brown Not collective 1389552f7358SJed Brown 1390552f7358SJed Brown Input Parameter: 1391552f7358SJed Brown . mesh - The DMPlex 1392552f7358SJed Brown 1393552f7358SJed Brown Output Parameters: 1394552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1395552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1396552f7358SJed Brown 1397552f7358SJed Brown Level: beginner 1398552f7358SJed Brown 1399552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1400552f7358SJed Brown @*/ 1401552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1402552f7358SJed Brown { 1403552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1404552f7358SJed Brown 1405552f7358SJed Brown PetscFunctionBegin; 1406552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1407552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1408552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1409552f7358SJed Brown PetscFunctionReturn(0); 1410552f7358SJed Brown } 1411552f7358SJed Brown 1412552f7358SJed Brown #undef __FUNCT__ 1413552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1414552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1415552f7358SJed Brown { 1416552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1417552f7358SJed Brown PetscInt size; 1418552f7358SJed Brown PetscErrorCode ierr; 1419552f7358SJed Brown 1420552f7358SJed Brown PetscFunctionBegin; 1421552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1422552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1423552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 14241795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 14251795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1426552f7358SJed Brown if (mesh->maxSupportSize) { 1427552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1428552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 14291795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1430552f7358SJed Brown } 1431552f7358SJed Brown PetscFunctionReturn(0); 1432552f7358SJed Brown } 1433552f7358SJed Brown 1434552f7358SJed Brown #undef __FUNCT__ 1435552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1436552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1437552f7358SJed Brown { 1438552f7358SJed Brown PetscErrorCode ierr; 1439552f7358SJed Brown 1440552f7358SJed Brown PetscFunctionBegin; 14414d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 14424d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1443552f7358SJed Brown PetscFunctionReturn(0); 1444552f7358SJed Brown } 1445552f7358SJed Brown 1446552f7358SJed Brown #undef __FUNCT__ 1447552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1448552f7358SJed Brown /*@ 1449552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1450552f7358SJed Brown 1451552f7358SJed Brown Not collective 1452552f7358SJed Brown 1453552f7358SJed Brown Input Parameter: 1454552f7358SJed Brown . mesh - The DMPlex 1455552f7358SJed Brown 1456552f7358SJed Brown Output Parameter: 1457552f7358SJed Brown 1458552f7358SJed Brown Note: 1459552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1460552f7358SJed Brown 1461552f7358SJed Brown Level: beginner 1462552f7358SJed Brown 1463552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1464552f7358SJed Brown @*/ 1465552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1466552f7358SJed Brown { 1467552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1468552f7358SJed Brown PetscInt *offsets; 1469552f7358SJed Brown PetscInt supportSize; 1470552f7358SJed Brown PetscInt pStart, pEnd, p; 1471552f7358SJed Brown PetscErrorCode ierr; 1472552f7358SJed Brown 1473552f7358SJed Brown PetscFunctionBegin; 1474552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 147582f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1476552f7358SJed Brown /* Calculate support sizes */ 1477552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1478552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1479552f7358SJed Brown PetscInt dof, off, c; 1480552f7358SJed Brown 1481552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1482552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1483552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1484552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1485552f7358SJed Brown } 1486552f7358SJed Brown } 1487552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1488552f7358SJed Brown PetscInt dof; 1489552f7358SJed Brown 1490552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 14910d644c17SKarl Rupp 1492552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1493552f7358SJed Brown } 1494552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1495552f7358SJed Brown /* Calculate supports */ 1496552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 14971795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 14981795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1499552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1500552f7358SJed Brown PetscInt dof, off, c; 1501552f7358SJed Brown 1502552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1503552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1504552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1505552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1506552f7358SJed Brown PetscInt offS; 1507552f7358SJed Brown 1508552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 15090d644c17SKarl Rupp 1510552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1511552f7358SJed Brown ++offsets[q]; 1512552f7358SJed Brown } 1513552f7358SJed Brown } 1514552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1515552f7358SJed Brown PetscFunctionReturn(0); 1516552f7358SJed Brown } 1517552f7358SJed Brown 1518552f7358SJed Brown #undef __FUNCT__ 1519552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1520552f7358SJed Brown /*@ 1521552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1522552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1523552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1524552f7358SJed Brown the DAG. 1525552f7358SJed Brown 1526552f7358SJed Brown Not collective 1527552f7358SJed Brown 1528552f7358SJed Brown Input Parameter: 1529552f7358SJed Brown . mesh - The DMPlex 1530552f7358SJed Brown 1531552f7358SJed Brown Output Parameter: 1532552f7358SJed Brown 1533552f7358SJed Brown Notes: 1534552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1535552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1536552f7358SJed Brown 1537552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1538552f7358SJed Brown 1539552f7358SJed Brown Level: beginner 1540552f7358SJed Brown 1541552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1542552f7358SJed Brown @*/ 1543552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1544552f7358SJed Brown { 1545aa50250dSMatthew G. Knepley DMLabel label; 1546552f7358SJed Brown PetscInt pStart, pEnd, p; 1547552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1548552f7358SJed Brown PetscErrorCode ierr; 1549552f7358SJed Brown 1550552f7358SJed Brown PetscFunctionBegin; 1551552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1552552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1553552f7358SJed Brown /* Calculate depth */ 1554aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1555aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1556aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1557552f7358SJed Brown /* Initialize roots and count leaves */ 1558552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1559552f7358SJed Brown PetscInt coneSize, supportSize; 1560552f7358SJed Brown 1561552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1562552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1563552f7358SJed Brown if (!coneSize && supportSize) { 1564552f7358SJed Brown ++numRoots; 1565aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1566552f7358SJed Brown } else if (!supportSize && coneSize) { 1567552f7358SJed Brown ++numLeaves; 1568552f7358SJed Brown } else if (!supportSize && !coneSize) { 1569552f7358SJed Brown /* Isolated points */ 1570aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1571552f7358SJed Brown } 1572552f7358SJed Brown } 1573552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1574552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1575552f7358SJed Brown PetscInt coneSize, supportSize; 1576552f7358SJed Brown 1577552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1578552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1579552f7358SJed Brown if (!supportSize && coneSize) { 1580aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1581552f7358SJed Brown } 1582552f7358SJed Brown } 1583552f7358SJed Brown } else { 158474ef644bSMatthew G. Knepley IS pointIS; 158574ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1586552f7358SJed Brown 158774ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 158874ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 158974ef644bSMatthew G. Knepley while (numPoints) { 159074ef644bSMatthew G. Knepley const PetscInt *points; 159174ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 159274ef644bSMatthew G. Knepley 159374ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 159474ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 159574ef644bSMatthew G. Knepley const PetscInt point = points[p]; 159674ef644bSMatthew G. Knepley const PetscInt *support; 159774ef644bSMatthew G. Knepley PetscInt supportSize, s; 159874ef644bSMatthew G. Knepley 159974ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 160074ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 160174ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 160274ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1603552f7358SJed Brown } 1604552f7358SJed Brown } 16055edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 160674ef644bSMatthew G. Knepley ++level; 160774ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 160874ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 160974ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 161074ef644bSMatthew G. Knepley else {numPoints = 0;} 161174ef644bSMatthew G. Knepley } 161274ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 161374ef644bSMatthew G. Knepley } 1614552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1615552f7358SJed Brown PetscFunctionReturn(0); 1616552f7358SJed Brown } 1617552f7358SJed Brown 1618552f7358SJed Brown #undef __FUNCT__ 1619552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1620552f7358SJed Brown /*@C 1621552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1622552f7358SJed Brown 1623552f7358SJed Brown Not Collective 1624552f7358SJed Brown 1625552f7358SJed Brown Input Parameters: 1626552f7358SJed Brown + dm - The DMPlex object 1627552f7358SJed Brown . numPoints - The number of input points for the join 1628552f7358SJed Brown - points - The input points 1629552f7358SJed Brown 1630552f7358SJed Brown Output Parameters: 1631552f7358SJed Brown + numCoveredPoints - The number of points in the join 1632552f7358SJed Brown - coveredPoints - The points in the join 1633552f7358SJed Brown 1634552f7358SJed Brown Level: intermediate 1635552f7358SJed Brown 1636552f7358SJed Brown Note: Currently, this is restricted to a single level join 1637552f7358SJed Brown 16383813dfbdSMatthew G Knepley Fortran Notes: 16393813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 16403813dfbdSMatthew G Knepley include petsc.h90 in your code. 16413813dfbdSMatthew G Knepley 16423813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 16433813dfbdSMatthew G Knepley 1644552f7358SJed Brown .keywords: mesh 1645552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1646552f7358SJed Brown @*/ 1647552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1648552f7358SJed Brown { 1649552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1650552f7358SJed Brown PetscInt *join[2]; 1651552f7358SJed Brown PetscInt joinSize, i = 0; 1652552f7358SJed Brown PetscInt dof, off, p, c, m; 1653552f7358SJed Brown PetscErrorCode ierr; 1654552f7358SJed Brown 1655552f7358SJed Brown PetscFunctionBegin; 1656552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1657552f7358SJed Brown PetscValidPointer(points, 2); 1658552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1659552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1660552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1661552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1662552f7358SJed Brown /* Copy in support of first point */ 1663552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1664552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1665552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1666552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1667552f7358SJed Brown } 1668552f7358SJed Brown /* Check each successive support */ 1669552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1670552f7358SJed Brown PetscInt newJoinSize = 0; 1671552f7358SJed Brown 1672552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1673552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1674552f7358SJed Brown for (c = 0; c < dof; ++c) { 1675552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1676552f7358SJed Brown 1677552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1678552f7358SJed Brown if (point == join[i][m]) { 1679552f7358SJed Brown join[1-i][newJoinSize++] = point; 1680552f7358SJed Brown break; 1681552f7358SJed Brown } 1682552f7358SJed Brown } 1683552f7358SJed Brown } 1684552f7358SJed Brown joinSize = newJoinSize; 1685552f7358SJed Brown i = 1-i; 1686552f7358SJed Brown } 1687552f7358SJed Brown *numCoveredPoints = joinSize; 1688552f7358SJed Brown *coveredPoints = join[i]; 1689552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1690552f7358SJed Brown PetscFunctionReturn(0); 1691552f7358SJed Brown } 1692552f7358SJed Brown 1693552f7358SJed Brown #undef __FUNCT__ 1694552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1695552f7358SJed Brown /*@C 1696552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1697552f7358SJed Brown 1698552f7358SJed Brown Not Collective 1699552f7358SJed Brown 1700552f7358SJed Brown Input Parameters: 1701552f7358SJed Brown + dm - The DMPlex object 1702552f7358SJed Brown . numPoints - The number of input points for the join 1703552f7358SJed Brown - points - The input points 1704552f7358SJed Brown 1705552f7358SJed Brown Output Parameters: 1706552f7358SJed Brown + numCoveredPoints - The number of points in the join 1707552f7358SJed Brown - coveredPoints - The points in the join 1708552f7358SJed Brown 17093813dfbdSMatthew G Knepley Fortran Notes: 17103813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17113813dfbdSMatthew G Knepley include petsc.h90 in your code. 17123813dfbdSMatthew G Knepley 17133813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17143813dfbdSMatthew G Knepley 1715552f7358SJed Brown Level: intermediate 1716552f7358SJed Brown 1717552f7358SJed Brown .keywords: mesh 1718552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1719552f7358SJed Brown @*/ 1720552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1721552f7358SJed Brown { 1722552f7358SJed Brown PetscErrorCode ierr; 1723552f7358SJed Brown 1724552f7358SJed Brown PetscFunctionBegin; 1725552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1726d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1727d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1728d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1729552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1730d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1731552f7358SJed Brown PetscFunctionReturn(0); 1732552f7358SJed Brown } 1733552f7358SJed Brown 1734552f7358SJed Brown #undef __FUNCT__ 1735552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1736552f7358SJed Brown /*@C 1737552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1738552f7358SJed Brown 1739552f7358SJed Brown Not Collective 1740552f7358SJed Brown 1741552f7358SJed Brown Input Parameters: 1742552f7358SJed Brown + dm - The DMPlex object 1743552f7358SJed Brown . numPoints - The number of input points for the join 1744552f7358SJed Brown - points - The input points 1745552f7358SJed Brown 1746552f7358SJed Brown Output Parameters: 1747552f7358SJed Brown + numCoveredPoints - The number of points in the join 1748552f7358SJed Brown - coveredPoints - The points in the join 1749552f7358SJed Brown 17503813dfbdSMatthew G Knepley Fortran Notes: 17513813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17523813dfbdSMatthew G Knepley include petsc.h90 in your code. 17533813dfbdSMatthew G Knepley 17543813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17553813dfbdSMatthew G Knepley 1756552f7358SJed Brown Level: intermediate 1757552f7358SJed Brown 1758552f7358SJed Brown .keywords: mesh 1759552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1760552f7358SJed Brown @*/ 1761552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1762552f7358SJed Brown { 1763552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1764552f7358SJed Brown PetscInt *offsets, **closures; 1765552f7358SJed Brown PetscInt *join[2]; 1766552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1767552f7358SJed Brown PetscInt p, d, c, m; 1768552f7358SJed Brown PetscErrorCode ierr; 1769552f7358SJed Brown 1770552f7358SJed Brown PetscFunctionBegin; 1771552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1772552f7358SJed Brown PetscValidPointer(points, 2); 1773552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1774552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1775552f7358SJed Brown 1776552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 17771795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1778552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1779e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1780552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1781552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1782552f7358SJed Brown 1783552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1784552f7358SJed Brown PetscInt closureSize; 1785552f7358SJed Brown 1786552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 17870d644c17SKarl Rupp 1788552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1789552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1790552f7358SJed Brown PetscInt pStart, pEnd, i; 1791552f7358SJed Brown 1792552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1793552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1794552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1795552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1796552f7358SJed Brown break; 1797552f7358SJed Brown } 1798552f7358SJed Brown } 1799552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1800552f7358SJed Brown } 180182f516ccSBarry Smith if (offsets[p*(depth+2)+depth+1] != closureSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Total size of closure %D should be %D", offsets[p*(depth+2)+depth+1], closureSize); 1802552f7358SJed Brown } 1803552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1804552f7358SJed Brown PetscInt dof; 1805552f7358SJed Brown 1806552f7358SJed Brown /* Copy in support of first point */ 1807552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1808552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1809552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1810552f7358SJed Brown } 1811552f7358SJed Brown /* Check each successive cone */ 1812552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1813552f7358SJed Brown PetscInt newJoinSize = 0; 1814552f7358SJed Brown 1815552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1816552f7358SJed Brown for (c = 0; c < dof; ++c) { 1817552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1818552f7358SJed Brown 1819552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1820552f7358SJed Brown if (point == join[i][m]) { 1821552f7358SJed Brown join[1-i][newJoinSize++] = point; 1822552f7358SJed Brown break; 1823552f7358SJed Brown } 1824552f7358SJed Brown } 1825552f7358SJed Brown } 1826552f7358SJed Brown joinSize = newJoinSize; 1827552f7358SJed Brown i = 1-i; 1828552f7358SJed Brown } 1829552f7358SJed Brown if (joinSize) break; 1830552f7358SJed Brown } 1831552f7358SJed Brown *numCoveredPoints = joinSize; 1832552f7358SJed Brown *coveredPoints = join[i]; 1833552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 18340298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1835552f7358SJed Brown } 1836552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1837552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1838552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1839552f7358SJed Brown PetscFunctionReturn(0); 1840552f7358SJed Brown } 1841552f7358SJed Brown 1842552f7358SJed Brown #undef __FUNCT__ 1843552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1844552f7358SJed Brown /*@C 1845552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1846552f7358SJed Brown 1847552f7358SJed Brown Not Collective 1848552f7358SJed Brown 1849552f7358SJed Brown Input Parameters: 1850552f7358SJed Brown + dm - The DMPlex object 1851552f7358SJed Brown . numPoints - The number of input points for the meet 1852552f7358SJed Brown - points - The input points 1853552f7358SJed Brown 1854552f7358SJed Brown Output Parameters: 1855552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1856552f7358SJed Brown - coveredPoints - The points in the meet 1857552f7358SJed Brown 1858552f7358SJed Brown Level: intermediate 1859552f7358SJed Brown 1860552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1861552f7358SJed Brown 18623813dfbdSMatthew G Knepley Fortran Notes: 18633813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18643813dfbdSMatthew G Knepley include petsc.h90 in your code. 18653813dfbdSMatthew G Knepley 18663813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18673813dfbdSMatthew G Knepley 1868552f7358SJed Brown .keywords: mesh 1869552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1870552f7358SJed Brown @*/ 1871552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1872552f7358SJed Brown { 1873552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1874552f7358SJed Brown PetscInt *meet[2]; 1875552f7358SJed Brown PetscInt meetSize, i = 0; 1876552f7358SJed Brown PetscInt dof, off, p, c, m; 1877552f7358SJed Brown PetscErrorCode ierr; 1878552f7358SJed Brown 1879552f7358SJed Brown PetscFunctionBegin; 1880552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1881552f7358SJed Brown PetscValidPointer(points, 2); 1882552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1883552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1884552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1885552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1886552f7358SJed Brown /* Copy in cone of first point */ 1887552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 1888552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 1889552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 1890552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 1891552f7358SJed Brown } 1892552f7358SJed Brown /* Check each successive cone */ 1893552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1894552f7358SJed Brown PetscInt newMeetSize = 0; 1895552f7358SJed Brown 1896552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 1897552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 1898552f7358SJed Brown for (c = 0; c < dof; ++c) { 1899552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 1900552f7358SJed Brown 1901552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 1902552f7358SJed Brown if (point == meet[i][m]) { 1903552f7358SJed Brown meet[1-i][newMeetSize++] = point; 1904552f7358SJed Brown break; 1905552f7358SJed Brown } 1906552f7358SJed Brown } 1907552f7358SJed Brown } 1908552f7358SJed Brown meetSize = newMeetSize; 1909552f7358SJed Brown i = 1-i; 1910552f7358SJed Brown } 1911552f7358SJed Brown *numCoveringPoints = meetSize; 1912552f7358SJed Brown *coveringPoints = meet[i]; 1913552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 1914552f7358SJed Brown PetscFunctionReturn(0); 1915552f7358SJed Brown } 1916552f7358SJed Brown 1917552f7358SJed Brown #undef __FUNCT__ 1918552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 1919552f7358SJed Brown /*@C 1920552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 1921552f7358SJed Brown 1922552f7358SJed Brown Not Collective 1923552f7358SJed Brown 1924552f7358SJed Brown Input Parameters: 1925552f7358SJed Brown + dm - The DMPlex object 1926552f7358SJed Brown . numPoints - The number of input points for the meet 1927552f7358SJed Brown - points - The input points 1928552f7358SJed Brown 1929552f7358SJed Brown Output Parameters: 1930552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1931552f7358SJed Brown - coveredPoints - The points in the meet 1932552f7358SJed Brown 1933552f7358SJed Brown Level: intermediate 1934552f7358SJed Brown 19353813dfbdSMatthew G Knepley Fortran Notes: 19363813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19373813dfbdSMatthew G Knepley include petsc.h90 in your code. 19383813dfbdSMatthew G Knepley 19393813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19403813dfbdSMatthew G Knepley 1941552f7358SJed Brown .keywords: mesh 1942552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 1943552f7358SJed Brown @*/ 1944552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1945552f7358SJed Brown { 1946552f7358SJed Brown PetscErrorCode ierr; 1947552f7358SJed Brown 1948552f7358SJed Brown PetscFunctionBegin; 1949552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1950d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1951d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1952d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 1953552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1954d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1955552f7358SJed Brown PetscFunctionReturn(0); 1956552f7358SJed Brown } 1957552f7358SJed Brown 1958552f7358SJed Brown #undef __FUNCT__ 1959552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 1960552f7358SJed Brown /*@C 1961552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 1962552f7358SJed Brown 1963552f7358SJed Brown Not Collective 1964552f7358SJed Brown 1965552f7358SJed Brown Input Parameters: 1966552f7358SJed Brown + dm - The DMPlex object 1967552f7358SJed Brown . numPoints - The number of input points for the meet 1968552f7358SJed Brown - points - The input points 1969552f7358SJed Brown 1970552f7358SJed Brown Output Parameters: 1971552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1972552f7358SJed Brown - coveredPoints - The points in the meet 1973552f7358SJed Brown 1974552f7358SJed Brown Level: intermediate 1975552f7358SJed Brown 19763813dfbdSMatthew G Knepley Fortran Notes: 19773813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19783813dfbdSMatthew G Knepley include petsc.h90 in your code. 19793813dfbdSMatthew G Knepley 19803813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19813813dfbdSMatthew G Knepley 1982552f7358SJed Brown .keywords: mesh 1983552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 1984552f7358SJed Brown @*/ 1985552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1986552f7358SJed Brown { 1987552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1988552f7358SJed Brown PetscInt *offsets, **closures; 1989552f7358SJed Brown PetscInt *meet[2]; 1990552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 1991552f7358SJed Brown PetscInt p, h, c, m; 1992552f7358SJed Brown PetscErrorCode ierr; 1993552f7358SJed Brown 1994552f7358SJed Brown PetscFunctionBegin; 1995552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1996552f7358SJed Brown PetscValidPointer(points, 2); 1997552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1998552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1999552f7358SJed Brown 2000552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2001785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2002552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2003e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2004552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2005552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2006552f7358SJed Brown 2007552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2008552f7358SJed Brown PetscInt closureSize; 2009552f7358SJed Brown 2010552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 20110d644c17SKarl Rupp 2012552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2013552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2014552f7358SJed Brown PetscInt pStart, pEnd, i; 2015552f7358SJed Brown 2016552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2017552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2018552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2019552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2020552f7358SJed Brown break; 2021552f7358SJed Brown } 2022552f7358SJed Brown } 2023552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2024552f7358SJed Brown } 202582f516ccSBarry Smith if (offsets[p*(height+2)+height+1] != closureSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Total size of closure %D should be %D", offsets[p*(height+2)+height+1], closureSize); 2026552f7358SJed Brown } 2027552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2028552f7358SJed Brown PetscInt dof; 2029552f7358SJed Brown 2030552f7358SJed Brown /* Copy in cone of first point */ 2031552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2032552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2033552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2034552f7358SJed Brown } 2035552f7358SJed Brown /* Check each successive cone */ 2036552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2037552f7358SJed Brown PetscInt newMeetSize = 0; 2038552f7358SJed Brown 2039552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2040552f7358SJed Brown for (c = 0; c < dof; ++c) { 2041552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2042552f7358SJed Brown 2043552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2044552f7358SJed Brown if (point == meet[i][m]) { 2045552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2046552f7358SJed Brown break; 2047552f7358SJed Brown } 2048552f7358SJed Brown } 2049552f7358SJed Brown } 2050552f7358SJed Brown meetSize = newMeetSize; 2051552f7358SJed Brown i = 1-i; 2052552f7358SJed Brown } 2053552f7358SJed Brown if (meetSize) break; 2054552f7358SJed Brown } 2055552f7358SJed Brown *numCoveredPoints = meetSize; 2056552f7358SJed Brown *coveredPoints = meet[i]; 2057552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 20580298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2059552f7358SJed Brown } 2060552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2061552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2062552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2063552f7358SJed Brown PetscFunctionReturn(0); 2064552f7358SJed Brown } 2065552f7358SJed Brown 2066552f7358SJed Brown #undef __FUNCT__ 20674e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 20684e3744c5SMatthew G. Knepley /*@C 20694e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 20704e3744c5SMatthew G. Knepley 20714e3744c5SMatthew G. Knepley Not Collective 20724e3744c5SMatthew G. Knepley 20734e3744c5SMatthew G. Knepley Input Parameters: 20744e3744c5SMatthew G. Knepley + dmA - A DMPlex object 20754e3744c5SMatthew G. Knepley - dmB - A DMPlex object 20764e3744c5SMatthew G. Knepley 20774e3744c5SMatthew G. Knepley Output Parameters: 20784e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 20794e3744c5SMatthew G. Knepley 20804e3744c5SMatthew G. Knepley Level: intermediate 20814e3744c5SMatthew G. Knepley 20824e3744c5SMatthew G. Knepley Notes: 20834e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 20844e3744c5SMatthew G. Knepley 20854e3744c5SMatthew G. Knepley .keywords: mesh 20864e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 20874e3744c5SMatthew G. Knepley @*/ 20884e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 20894e3744c5SMatthew G. Knepley { 20904e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 20914e3744c5SMatthew G. Knepley PetscErrorCode ierr; 20924e3744c5SMatthew G. Knepley 20934e3744c5SMatthew G. Knepley PetscFunctionBegin; 20944e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 20954e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 20964e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 20974e3744c5SMatthew G. Knepley 20984e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 20994e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 21004e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 21014e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 21024e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 21034e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 21044e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 21054e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 21064e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 21074e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 21084e3744c5SMatthew G. Knepley 21094e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 21104e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 21114e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 21124e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 21134e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 21144e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 21154e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 21164e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 21174e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 21184e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 21194e3744c5SMatthew G. Knepley } 21204e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 21214e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 21224e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 21234e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 21244e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 21254e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 21264e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 21274e3744c5SMatthew G. Knepley } 21284e3744c5SMatthew G. Knepley } 21294e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 21304e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 21314e3744c5SMatthew G. Knepley } 21324e3744c5SMatthew G. Knepley 21334e3744c5SMatthew G. Knepley #undef __FUNCT__ 213418ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 213518ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2136a6dfd86eSKarl Rupp { 213782f516ccSBarry Smith MPI_Comm comm; 2138552f7358SJed Brown PetscErrorCode ierr; 2139552f7358SJed Brown 2140552f7358SJed Brown PetscFunctionBegin; 214182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2142552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2143552f7358SJed Brown switch (cellDim) { 2144552f7358SJed Brown case 0: 2145552f7358SJed Brown *numFaceVertices = 0; 2146552f7358SJed Brown break; 2147552f7358SJed Brown case 1: 2148552f7358SJed Brown *numFaceVertices = 1; 2149552f7358SJed Brown break; 2150552f7358SJed Brown case 2: 2151552f7358SJed Brown switch (numCorners) { 215219436ca2SJed Brown case 3: /* triangle */ 215319436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2154552f7358SJed Brown break; 215519436ca2SJed Brown case 4: /* quadrilateral */ 215619436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2157552f7358SJed Brown break; 215819436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 215919436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2160552f7358SJed Brown break; 216119436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 216219436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2163552f7358SJed Brown break; 2164552f7358SJed Brown default: 2165552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2166552f7358SJed Brown } 2167552f7358SJed Brown break; 2168552f7358SJed Brown case 3: 2169552f7358SJed Brown switch (numCorners) { 217019436ca2SJed Brown case 4: /* tetradehdron */ 217119436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2172552f7358SJed Brown break; 217319436ca2SJed Brown case 6: /* tet cohesive cells */ 217419436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2175552f7358SJed Brown break; 217619436ca2SJed Brown case 8: /* hexahedron */ 217719436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2178552f7358SJed Brown break; 217919436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 218019436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2181552f7358SJed Brown break; 218219436ca2SJed Brown case 10: /* quadratic tetrahedron */ 218319436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2184552f7358SJed Brown break; 218519436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 218619436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2187552f7358SJed Brown break; 218819436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 218919436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2190552f7358SJed Brown break; 219119436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 219219436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2193552f7358SJed Brown break; 2194552f7358SJed Brown default: 2195552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2196552f7358SJed Brown } 2197552f7358SJed Brown break; 2198552f7358SJed Brown default: 2199552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2200552f7358SJed Brown } 2201552f7358SJed Brown PetscFunctionReturn(0); 2202552f7358SJed Brown } 2203552f7358SJed Brown 2204552f7358SJed Brown #undef __FUNCT__ 2205d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2206d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2207d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2208d27a0f52SMatthew G. Knepley { 2209a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2210a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2211a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2212d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2213d27a0f52SMatthew G. Knepley 2214d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2215d27a0f52SMatthew G. Knepley /* Truth Table 2216d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2217d27a0f52SMatthew G. Knepley F 0 flips no F F F 2218d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2219d27a0f52SMatthew G. Knepley F 2 flips no T F T 2220d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2221d27a0f52SMatthew G. Knepley T 1 flip no 2222d27a0f52SMatthew G. Knepley T 2 flips yes 2223d27a0f52SMatthew G. Knepley */ 2224a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2225d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2226a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2227d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2228a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2229a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2230a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2231a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2232a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2233a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2234785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2235a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2236a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2237defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2238a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2239a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2240a1b4d4a2SMatthew G. Knepley 2241a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2242a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2243a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2244a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2245a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2246a1b4d4a2SMatthew G. Knepley } 2247a1b4d4a2SMatthew G. Knepley } 2248a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2249a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2250d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2251a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2252d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2253d27a0f52SMatthew G. Knepley 2254a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2255a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2256a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2257d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2258d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2259a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 226086cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2261a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 226286cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2263d27a0f52SMatthew G. Knepley 2264d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2265d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2266d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2267d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2268d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2269d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2270a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2271a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2272a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2273a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2274a1b4d4a2SMatthew G. Knepley } 2275a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2276a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2277a1b4d4a2SMatthew G. Knepley } 2278a1b4d4a2SMatthew G. Knepley if (posA < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[0]); 2279a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2280a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2281a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2282a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2283a1b4d4a2SMatthew G. Knepley } 2284a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2285a1b4d4a2SMatthew G. Knepley if (fBottom > fEnd-fStart) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Face %d was pushed exceeding capacity %d > %d", coneA[c], fBottom, fEnd-fStart); 2286a1b4d4a2SMatthew G. Knepley } 2287a1b4d4a2SMatthew G. Knepley if (posB < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d could not be located in cell %d", face, support[1]); 2288d27a0f52SMatthew G. Knepley 2289d27a0f52SMatthew G. Knepley if (dim == 1) { 2290d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2291d27a0f52SMatthew G. Knepley } else { 2292d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2293d27a0f52SMatthew G. Knepley } 2294d27a0f52SMatthew G. Knepley 2295d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2296d27a0f52SMatthew G. Knepley if (seenA && seenB) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen cells %d and %d do not match: Fault mesh is non-orientable", support[0], support[1]); 2297d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2298a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2299d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2300a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2301d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 230286cff514SMatthew G. Knepley } else if (mismatch && flippedA && flippedB) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Attempt to flip already flipped cell: Fault mesh is non-orientable"); 2303a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2304a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2305d27a0f52SMatthew G. Knepley } 2306a1b4d4a2SMatthew G. Knepley 2307d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2308d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2309d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2310a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2311f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2312f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2313d27a0f52SMatthew G. Knepley 2314a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2315a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2316a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2317a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2318a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2319a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2320a1b4d4a2SMatthew G. Knepley 2321a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2322a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2323a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2324d27a0f52SMatthew G. Knepley } 2325a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2326a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2327f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2328f4e909fcSMatthew G. Knepley faceSize = coneSize; 2329f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2330f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2331f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2332f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2333f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2334f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2335f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2336f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2337f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2338f4e909fcSMatthew G. Knepley } 2339f4e909fcSMatthew G. Knepley } 2340d27a0f52SMatthew G. Knepley } 2341d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2342d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2343d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2344a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2346a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2347d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2348d27a0f52SMatthew G. Knepley } 2349d27a0f52SMatthew G. Knepley 2350d27a0f52SMatthew G. Knepley #undef __FUNCT__ 2351cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal" 2352cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[]) 2353cb1e1211SMatthew G Knepley { 2354cb1e1211SMatthew G Knepley const PetscInt *support = NULL; 2355cb1e1211SMatthew G Knepley PetscInt numAdj = 0, maxAdjSize = *adjSize, supportSize, s; 2356cb1e1211SMatthew G Knepley PetscErrorCode ierr; 2357cb1e1211SMatthew G Knepley 2358cb1e1211SMatthew G Knepley PetscFunctionBegin; 2359cb1e1211SMatthew G Knepley if (useClosure) { 2360cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr); 2361cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr); 2362cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2363cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2364cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2365cb1e1211SMatthew G Knepley 2366cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2367cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr); 2368cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2369cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2370cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2371cb1e1211SMatthew G Knepley } 2372cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2373cb1e1211SMatthew G Knepley } 2374cb1e1211SMatthew G Knepley } 2375cb1e1211SMatthew G Knepley } else { 2376cb1e1211SMatthew G Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 2377cb1e1211SMatthew G Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 2378cb1e1211SMatthew G Knepley for (s = 0; s < supportSize; ++s) { 2379cb1e1211SMatthew G Knepley const PetscInt *cone = NULL; 2380cb1e1211SMatthew G Knepley PetscInt coneSize, c, q; 2381cb1e1211SMatthew G Knepley 2382cb1e1211SMatthew G Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 2383cb1e1211SMatthew G Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 2384cb1e1211SMatthew G Knepley for (c = 0; c < coneSize; ++c) { 2385cb1e1211SMatthew G Knepley for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) { 2386cb1e1211SMatthew G Knepley if (cone[c] == adj[q]) break; 2387cb1e1211SMatthew G Knepley } 2388cb1e1211SMatthew G Knepley if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize); 2389cb1e1211SMatthew G Knepley } 2390cb1e1211SMatthew G Knepley } 2391cb1e1211SMatthew G Knepley } 2392cb1e1211SMatthew G Knepley *adjSize = numAdj; 2393cb1e1211SMatthew G Knepley PetscFunctionReturn(0); 2394cb1e1211SMatthew G Knepley } 2395cb1e1211SMatthew G Knepley 2396cb1e1211SMatthew G Knepley #undef __FUNCT__ 2397552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR" 239877c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency) 23990adebc6cSBarry Smith { 2400552f7358SJed Brown const PetscInt maxFaceCases = 30; 2401552f7358SJed Brown PetscInt numFaceCases = 0; 2402552f7358SJed Brown PetscInt numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */ 2403552f7358SJed Brown PetscInt *off, *adj; 2404552f7358SJed Brown PetscInt *neighborCells, *tmpClosure; 2405552f7358SJed Brown PetscInt maxConeSize, maxSupportSize, maxClosure, maxNeighbors; 240677c88f5bSMatthew G Knepley PetscInt dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell; 2407552f7358SJed Brown PetscErrorCode ierr; 2408552f7358SJed Brown 2409552f7358SJed Brown PetscFunctionBegin; 2410552f7358SJed Brown /* For parallel partitioning, I think you have to communicate supports */ 2411552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 241277c88f5bSMatthew G Knepley cellDim = dim - cellHeight; 2413552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 241477c88f5bSMatthew G Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 2415552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 2416552f7358SJed Brown if (cEnd - cStart == 0) { 2417552f7358SJed Brown if (numVertices) *numVertices = 0; 24180298fd71SBarry Smith if (offsets) *offsets = NULL; 24190298fd71SBarry Smith if (adjacency) *adjacency = NULL; 2420552f7358SJed Brown PetscFunctionReturn(0); 2421552f7358SJed Brown } 2422552f7358SJed Brown numCells = cEnd - cStart; 242377c88f5bSMatthew G Knepley faceDepth = depth - cellHeight; 24240d957afbSMatthew G. Knepley if (dim == depth) { 2425e430e843SMatthew G. Knepley PetscInt f, fStart, fEnd; 2426e430e843SMatthew G. Knepley 24271795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2428e430e843SMatthew G. Knepley /* Count neighboring cells */ 2429e430e843SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr); 2430e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2431e430e843SMatthew G. Knepley const PetscInt *support; 2432e430e843SMatthew G. Knepley PetscInt supportSize; 2433e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2434e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2435e430e843SMatthew G. Knepley if (supportSize == 2) { 2436e430e843SMatthew G. Knepley ++off[support[0]-cStart+1]; 2437e430e843SMatthew G. Knepley ++off[support[1]-cStart+1]; 2438e430e843SMatthew G. Knepley } 2439e430e843SMatthew G. Knepley } 2440e430e843SMatthew G. Knepley /* Prefix sum */ 2441e430e843SMatthew G. Knepley for (c = 1; c <= numCells; ++c) off[c] += off[c-1]; 2442e430e843SMatthew G. Knepley if (adjacency) { 2443e430e843SMatthew G. Knepley PetscInt *tmp; 2444e430e843SMatthew G. Knepley 2445785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2446785e854fSJed Brown ierr = PetscMalloc1((numCells+1), &tmp);CHKERRQ(ierr); 2447e430e843SMatthew G. Knepley ierr = PetscMemcpy(tmp, off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr); 2448e430e843SMatthew G. Knepley /* Get neighboring cells */ 2449e430e843SMatthew G. Knepley for (f = fStart; f < fEnd; ++f) { 2450e430e843SMatthew G. Knepley const PetscInt *support; 2451e430e843SMatthew G. Knepley PetscInt supportSize; 2452e430e843SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr); 2453e430e843SMatthew G. Knepley ierr = DMPlexGetSupport(dm, f, &support);CHKERRQ(ierr); 2454e430e843SMatthew G. Knepley if (supportSize == 2) { 2455e430e843SMatthew G. Knepley adj[tmp[support[0]-cStart]++] = support[1]; 2456e430e843SMatthew G. Knepley adj[tmp[support[1]-cStart]++] = support[0]; 2457e430e843SMatthew G. Knepley } 2458e430e843SMatthew G. Knepley } 2459e430e843SMatthew G. Knepley #if defined(PETSC_USE_DEBUG) 24600d957afbSMatthew G. Knepley for (c = 0; c < cEnd-cStart; ++c) if (tmp[c] != off[c+1]) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Offset %d != %d for cell %d", tmp[c], off[c], c+cStart); 2461e430e843SMatthew G. Knepley #endif 2462e430e843SMatthew G. Knepley ierr = PetscFree(tmp);CHKERRQ(ierr); 2463e430e843SMatthew G. Knepley } 2464e430e843SMatthew G. Knepley if (numVertices) *numVertices = numCells; 2465e430e843SMatthew G. Knepley if (offsets) *offsets = off; 2466e430e843SMatthew G. Knepley if (adjacency) *adjacency = adj; 2467e430e843SMatthew G. Knepley PetscFunctionReturn(0); 2468e430e843SMatthew G. Knepley } 2469552f7358SJed Brown /* Setup face recognition */ 247077c88f5bSMatthew G Knepley if (faceDepth == 1) { 2471552f7358SJed 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 */ 2472552f7358SJed Brown 2473552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2474552f7358SJed Brown PetscInt corners; 2475552f7358SJed Brown 2476552f7358SJed Brown ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr); 2477552f7358SJed Brown if (!cornersSeen[corners]) { 2478552f7358SJed Brown PetscInt nFV; 2479552f7358SJed Brown 248082f516ccSBarry Smith if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases"); 2481552f7358SJed Brown cornersSeen[corners] = 1; 24820d644c17SKarl Rupp 248318ad9376SMatthew G. Knepley ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr); 24840d644c17SKarl Rupp 2485552f7358SJed Brown numFaceVertices[numFaceCases++] = nFV; 2486552f7358SJed Brown } 2487552f7358SJed Brown } 2488552f7358SJed Brown } 2489e7b80042SMatthew G. Knepley maxClosure = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1)); 2490e7b80042SMatthew G. Knepley maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1); 2491dcca6d9dSJed Brown ierr = PetscMalloc2(maxNeighbors,&neighborCells,maxClosure,&tmpClosure);CHKERRQ(ierr); 24921795a4d1SJed Brown ierr = PetscCalloc1(numCells+1, &off);CHKERRQ(ierr); 2493552f7358SJed Brown /* Count neighboring cells */ 2494552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2495552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2496552f7358SJed Brown 2497cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2498552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2499552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 25004d25b1e8SKarl Rupp PetscInt cellPair[2]; 250177c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2502552f7358SJed Brown PetscInt meetSize = 0; 25030298fd71SBarry Smith const PetscInt *meet = NULL; 2504552f7358SJed Brown 25054d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2506552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2507552f7358SJed Brown if (!found) { 2508552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2509552f7358SJed Brown if (meetSize) { 2510552f7358SJed Brown PetscInt f; 2511552f7358SJed Brown 2512552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2513552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2514552f7358SJed Brown found = PETSC_TRUE; 2515552f7358SJed Brown break; 2516552f7358SJed Brown } 2517552f7358SJed Brown } 2518552f7358SJed Brown } 2519552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2520552f7358SJed Brown } 25210d644c17SKarl Rupp if (found) ++off[cell-cStart+1]; 2522552f7358SJed Brown } 2523552f7358SJed Brown } 2524552f7358SJed Brown /* Prefix sum */ 25250d644c17SKarl Rupp for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1]; 25260d644c17SKarl Rupp 2527552f7358SJed Brown if (adjacency) { 2528785e854fSJed Brown ierr = PetscMalloc1(off[numCells], &adj);CHKERRQ(ierr); 2529552f7358SJed Brown /* Get neighboring cells */ 2530552f7358SJed Brown for (cell = cStart; cell < cEnd; ++cell) { 2531552f7358SJed Brown PetscInt numNeighbors = maxNeighbors, n; 2532552f7358SJed Brown PetscInt cellOffset = 0; 2533552f7358SJed Brown 2534cb1e1211SMatthew G Knepley ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr); 2535552f7358SJed Brown /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */ 2536552f7358SJed Brown for (n = 0; n < numNeighbors; ++n) { 25374d25b1e8SKarl Rupp PetscInt cellPair[2]; 253877c88f5bSMatthew G Knepley PetscBool found = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE; 2539552f7358SJed Brown PetscInt meetSize = 0; 25400298fd71SBarry Smith const PetscInt *meet = NULL; 2541552f7358SJed Brown 25424d25b1e8SKarl Rupp cellPair[0] = cell; cellPair[1] = neighborCells[n]; 2543552f7358SJed Brown if (cellPair[0] == cellPair[1]) continue; 2544552f7358SJed Brown if (!found) { 2545552f7358SJed Brown ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2546552f7358SJed Brown if (meetSize) { 2547552f7358SJed Brown PetscInt f; 2548552f7358SJed Brown 2549552f7358SJed Brown for (f = 0; f < numFaceCases; ++f) { 2550552f7358SJed Brown if (numFaceVertices[f] == meetSize) { 2551552f7358SJed Brown found = PETSC_TRUE; 2552552f7358SJed Brown break; 2553552f7358SJed Brown } 2554552f7358SJed Brown } 2555552f7358SJed Brown } 2556552f7358SJed Brown ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr); 2557552f7358SJed Brown } 2558552f7358SJed Brown if (found) { 2559552f7358SJed Brown adj[off[cell-cStart]+cellOffset] = neighborCells[n]; 2560552f7358SJed Brown ++cellOffset; 2561552f7358SJed Brown } 2562552f7358SJed Brown } 2563552f7358SJed Brown } 2564552f7358SJed Brown } 2565552f7358SJed Brown ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr); 2566552f7358SJed Brown if (numVertices) *numVertices = numCells; 2567552f7358SJed Brown if (offsets) *offsets = off; 2568552f7358SJed Brown if (adjacency) *adjacency = adj; 2569552f7358SJed Brown PetscFunctionReturn(0); 2570552f7358SJed Brown } 2571552f7358SJed Brown 2572519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2573519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2574552f7358SJed Brown #include <unistd.h> 2575552f7358SJed Brown #endif 2576552f7358SJed Brown /* Chaco does not have an include file */ 257739d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts, 2578552f7358SJed Brown float *ewgts, float *x, float *y, float *z, char *outassignname, 2579552f7358SJed Brown char *outfilename, short *assignment, int architecture, int ndims_tot, 2580552f7358SJed Brown int mesh_dims[3], double *goal, int global_method, int local_method, 2581552f7358SJed Brown int rqi_flag, int vmax, int ndims, double eigtol, long seed); 2582552f7358SJed Brown 2583552f7358SJed Brown extern int FREE_GRAPH; 2584552f7358SJed Brown 2585552f7358SJed Brown #undef __FUNCT__ 2586552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco" 2587552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2588552f7358SJed Brown { 2589552f7358SJed Brown enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3}; 259082f516ccSBarry Smith MPI_Comm comm; 2591552f7358SJed Brown int nvtxs = numVertices; /* number of vertices in full graph */ 2592552f7358SJed Brown int *vwgts = NULL; /* weights for all vertices */ 2593552f7358SJed Brown float *ewgts = NULL; /* weights for all edges */ 2594552f7358SJed Brown float *x = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */ 2595552f7358SJed Brown char *outassignname = NULL; /* name of assignment output file */ 2596552f7358SJed Brown char *outfilename = NULL; /* output file name */ 2597552f7358SJed Brown int architecture = 1; /* 0 => hypercube, d => d-dimensional mesh */ 2598552f7358SJed Brown int ndims_tot = 0; /* total number of cube dimensions to divide */ 2599552f7358SJed Brown int mesh_dims[3]; /* dimensions of mesh of processors */ 2600552f7358SJed Brown double *goal = NULL; /* desired set sizes for each set */ 2601552f7358SJed Brown int global_method = 1; /* global partitioning algorithm */ 2602552f7358SJed Brown int local_method = 1; /* local partitioning algorithm */ 2603552f7358SJed Brown int rqi_flag = 0; /* should I use RQI/Symmlq eigensolver? */ 2604552f7358SJed Brown int vmax = 200; /* how many vertices to coarsen down to? */ 2605552f7358SJed Brown int ndims = 1; /* number of eigenvectors (2^d sets) */ 2606552f7358SJed Brown double eigtol = 0.001; /* tolerance on eigenvectors */ 2607552f7358SJed Brown long seed = 123636512; /* for random graph mutations */ 2608552f7358SJed Brown short int *assignment; /* Output partition */ 2609552f7358SJed Brown int fd_stdout, fd_pipe[2]; 2610552f7358SJed Brown PetscInt *points; 2611552f7358SJed Brown PetscMPIInt commSize; 2612552f7358SJed Brown int i, v, p; 2613552f7358SJed Brown PetscErrorCode ierr; 2614552f7358SJed Brown 2615552f7358SJed Brown PetscFunctionBegin; 261682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2617552f7358SJed Brown ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 2618552f7358SJed Brown if (!numVertices) { 2619552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2620552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2621552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 26220298fd71SBarry Smith ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2623552f7358SJed Brown PetscFunctionReturn(0); 2624552f7358SJed Brown } 2625552f7358SJed Brown FREE_GRAPH = 0; /* Do not let Chaco free my memory */ 26260d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) ++adjacency[i]; 26270d644c17SKarl Rupp 2628552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2629552f7358SJed Brown /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */ 2630552f7358SJed Brown SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported"); 2631552f7358SJed Brown } 2632552f7358SJed Brown mesh_dims[0] = commSize; 2633552f7358SJed Brown mesh_dims[1] = 1; 2634552f7358SJed Brown mesh_dims[2] = 1; 2635785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &assignment);CHKERRQ(ierr); 2636552f7358SJed Brown /* Chaco outputs to stdout. We redirect this to a buffer. */ 2637552f7358SJed Brown /* TODO: check error codes for UNIX calls */ 2638519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2639552f7358SJed Brown { 26407995c745SJed Brown int piperet; 26417995c745SJed Brown piperet = pipe(fd_pipe); 26427995c745SJed Brown if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe"); 2643552f7358SJed Brown fd_stdout = dup(1); 2644552f7358SJed Brown close(1); 2645552f7358SJed Brown dup2(fd_pipe[1], 1); 2646552f7358SJed Brown } 2647552f7358SJed Brown #endif 2648552f7358SJed Brown ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename, 2649552f7358SJed Brown assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag, 2650552f7358SJed Brown vmax, ndims, eigtol, seed); 2651519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H) 2652552f7358SJed Brown { 2653552f7358SJed Brown char msgLog[10000]; 2654552f7358SJed Brown int count; 2655552f7358SJed Brown 2656552f7358SJed Brown fflush(stdout); 2657552f7358SJed Brown count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char)); 2658552f7358SJed Brown if (count < 0) count = 0; 2659552f7358SJed Brown msgLog[count] = 0; 2660552f7358SJed Brown close(1); 2661552f7358SJed Brown dup2(fd_stdout, 1); 2662552f7358SJed Brown close(fd_stdout); 2663552f7358SJed Brown close(fd_pipe[0]); 2664552f7358SJed Brown close(fd_pipe[1]); 2665552f7358SJed Brown if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog); 2666552f7358SJed Brown } 2667552f7358SJed Brown #endif 2668552f7358SJed Brown /* Convert to PetscSection+IS */ 2669552f7358SJed Brown ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 2670552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 2671552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2672552f7358SJed Brown ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 2673552f7358SJed Brown } 2674552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2675785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 2676552f7358SJed Brown for (p = 0, i = 0; p < commSize; ++p) { 2677552f7358SJed Brown for (v = 0; v < nvtxs; ++v) { 2678552f7358SJed Brown if (assignment[v] == p) points[i++] = v; 2679552f7358SJed Brown } 2680552f7358SJed Brown } 2681552f7358SJed Brown if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 2682552f7358SJed Brown ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2683552f7358SJed Brown if (global_method == INERTIAL_METHOD) { 2684552f7358SJed Brown /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */ 2685552f7358SJed Brown } 2686552f7358SJed Brown ierr = PetscFree(assignment);CHKERRQ(ierr); 26870d644c17SKarl Rupp for (i = 0; i < start[numVertices]; ++i) --adjacency[i]; 2688552f7358SJed Brown PetscFunctionReturn(0); 2689552f7358SJed Brown } 2690552f7358SJed Brown #endif 2691552f7358SJed Brown 2692519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 269325cda350SMatthew G. Knepley #include <parmetis.h> 269425cda350SMatthew G. Knepley 2695552f7358SJed Brown #undef __FUNCT__ 2696552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis" 2697552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition) 2698552f7358SJed Brown { 269925cda350SMatthew G. Knepley MPI_Comm comm; 270054695375SMatthew G. Knepley PetscInt nvtxs = numVertices; /* The number of vertices in full graph */ 270154695375SMatthew G. Knepley PetscInt *vtxdist; /* Distribution of vertices across processes */ 270254695375SMatthew G. Knepley PetscInt *xadj = start; /* Start of edge list for each vertex */ 270354695375SMatthew G. Knepley PetscInt *adjncy = adjacency; /* Edge lists for all vertices */ 270454695375SMatthew G. Knepley PetscInt *vwgt = NULL; /* Vertex weights */ 270554695375SMatthew G. Knepley PetscInt *adjwgt = NULL; /* Edge weights */ 270654695375SMatthew G. Knepley PetscInt wgtflag = 0; /* Indicates which weights are present */ 270754695375SMatthew G. Knepley PetscInt numflag = 0; /* Indicates initial offset (0 or 1) */ 270854695375SMatthew G. Knepley PetscInt ncon = 1; /* The number of weights per vertex */ 270954695375SMatthew G. Knepley PetscInt nparts; /* The number of partitions */ 271054695375SMatthew G. Knepley PetscReal *tpwgts; /* The fraction of vertex weights assigned to each partition */ 271154695375SMatthew G. Knepley PetscReal *ubvec; /* The balance intolerance for vertex weights */ 271254695375SMatthew G. Knepley PetscInt options[5]; /* Options */ 271354695375SMatthew G. Knepley /* Outputs */ 271454695375SMatthew G. Knepley PetscInt edgeCut; /* The number of edges cut by the partition */ 271525cda350SMatthew G. Knepley PetscInt *assignment, *points; 271625cda350SMatthew G. Knepley PetscMPIInt commSize, rank, p, v, i; 271725cda350SMatthew G. Knepley PetscErrorCode ierr; 271825cda350SMatthew G. Knepley 2719552f7358SJed Brown PetscFunctionBegin; 272025cda350SMatthew G. Knepley ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr); 272125cda350SMatthew G. Knepley ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr); 272225cda350SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 272325cda350SMatthew G. Knepley nparts = commSize; 272425cda350SMatthew G. Knepley options[0] = 0; /* Use all defaults */ 272525cda350SMatthew G. Knepley /* Calculate vertex distribution */ 2726dcca6d9dSJed Brown ierr = PetscMalloc4(nparts+1,&vtxdist,nparts*ncon,&tpwgts,ncon,&ubvec,nvtxs,&assignment);CHKERRQ(ierr); 272725cda350SMatthew G. Knepley vtxdist[0] = 0; 272825cda350SMatthew G. Knepley ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr); 272925cda350SMatthew G. Knepley for (p = 2; p <= nparts; ++p) { 273025cda350SMatthew G. Knepley vtxdist[p] += vtxdist[p-1]; 273125cda350SMatthew G. Knepley } 273225cda350SMatthew G. Knepley /* Calculate weights */ 273325cda350SMatthew G. Knepley for (p = 0; p < nparts; ++p) { 273425cda350SMatthew G. Knepley tpwgts[p] = 1.0/nparts; 273525cda350SMatthew G. Knepley } 273625cda350SMatthew G. Knepley ubvec[0] = 1.05; 273725cda350SMatthew G. Knepley 273825cda350SMatthew G. Knepley if (nparts == 1) { 273925cda350SMatthew G. Knepley ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt)); 274025cda350SMatthew G. Knepley } else { 274125cda350SMatthew G. Knepley if (vtxdist[1] == vtxdist[nparts]) { 274225cda350SMatthew G. Knepley if (!rank) { 2743e7ee2502SMatthew G. Knepley PetscStackPush("METIS_PartGraphKway"); 2744e7ee2502SMatthew G. Knepley ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment); 2745e7ee2502SMatthew G. Knepley PetscStackPop; 2746e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()"); 274725cda350SMatthew G. Knepley } 274825cda350SMatthew G. Knepley } else { 2749e7ee2502SMatthew G. Knepley PetscStackPush("ParMETIS_V3_PartKway"); 2750e7ee2502SMatthew G. Knepley ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm); 2751e7ee2502SMatthew G. Knepley PetscStackPop; 2752e7ee2502SMatthew G. Knepley if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()"); 275325cda350SMatthew G. Knepley } 275425cda350SMatthew G. Knepley } 275525cda350SMatthew G. Knepley /* Convert to PetscSection+IS */ 275625cda350SMatthew G. Knepley ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr); 275725cda350SMatthew G. Knepley ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr); 275825cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 275925cda350SMatthew G. Knepley ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr); 276025cda350SMatthew G. Knepley } 276125cda350SMatthew G. Knepley ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2762785e854fSJed Brown ierr = PetscMalloc1(nvtxs, &points);CHKERRQ(ierr); 276325cda350SMatthew G. Knepley for (p = 0, i = 0; p < commSize; ++p) { 276425cda350SMatthew G. Knepley for (v = 0; v < nvtxs; ++v) { 276525cda350SMatthew G. Knepley if (assignment[v] == p) points[i++] = v; 276625cda350SMatthew G. Knepley } 276725cda350SMatthew G. Knepley } 276825cda350SMatthew G. Knepley if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs); 276925cda350SMatthew G. Knepley ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 277025cda350SMatthew G. Knepley ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr); 2771552f7358SJed Brown PetscFunctionReturn(0); 2772552f7358SJed Brown } 2773552f7358SJed Brown #endif 2774552f7358SJed Brown 2775552f7358SJed Brown #undef __FUNCT__ 2776552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition" 2777552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */ 2778a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition) 2779a6dfd86eSKarl Rupp { 2780552f7358SJed Brown PetscHashI h; 2781552f7358SJed Brown const PetscInt *points; 2782552f7358SJed Brown PetscInt **tmpPoints, *newPoints, totPoints = 0; 2783552f7358SJed Brown PetscInt pStart, pEnd, part, q; 2784552f7358SJed Brown PetscErrorCode ierr; 2785552f7358SJed Brown 2786552f7358SJed Brown PetscFunctionBegin; 2787552f7358SJed Brown PetscHashICreate(h); 278882f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2789552f7358SJed Brown ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr); 2790552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr); 2791552f7358SJed Brown ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr); 2792785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &tmpPoints);CHKERRQ(ierr); 2793552f7358SJed Brown for (part = pStart; part < pEnd; ++part) { 2794552f7358SJed Brown PetscInt numPoints, nP, numNewPoints, off, p, n = 0; 2795552f7358SJed Brown 2796552f7358SJed Brown PetscHashIClear(h); 2797552f7358SJed Brown ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr); 2798552f7358SJed Brown ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr); 2799552f7358SJed Brown /* Add all existing points to h */ 2800552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2801552f7358SJed Brown const PetscInt point = points[off+p]; 2802552f7358SJed Brown PetscHashIAdd(h, point, 1); 2803552f7358SJed Brown } 2804552f7358SJed Brown PetscHashISize(h, nP); 280582f516ccSBarry Smith if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP); 2806552f7358SJed Brown /* Add all points in next BFS level */ 2807552f7358SJed Brown /* TODO We are brute forcing here, but could check the adjacency size to find the boundary */ 2808552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2809552f7358SJed Brown const PetscInt point = points[off+p]; 2810552f7358SJed Brown PetscInt s = start[point], e = start[point+1], a; 2811552f7358SJed Brown 28120d644c17SKarl Rupp for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1); 2813552f7358SJed Brown } 2814552f7358SJed Brown PetscHashISize(h, numNewPoints); 2815552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr); 2816785e854fSJed Brown ierr = PetscMalloc1(numNewPoints, &tmpPoints[part]);CHKERRQ(ierr); 2817c9fc7396SMatthew G. Knepley ierr = PetscHashIGetKeys(h, &n, tmpPoints[part]);CHKERRQ(ierr); 2818552f7358SJed Brown totPoints += numNewPoints; 2819552f7358SJed Brown } 2820552f7358SJed Brown ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr); 2821552f7358SJed Brown PetscHashIDestroy(h); 2822552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2823785e854fSJed Brown ierr = PetscMalloc1(totPoints, &newPoints);CHKERRQ(ierr); 2824552f7358SJed Brown for (part = pStart, q = 0; part < pEnd; ++part) { 2825552f7358SJed Brown PetscInt numPoints, p; 2826552f7358SJed Brown 2827552f7358SJed Brown ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr); 28280d644c17SKarl Rupp for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p]; 2829552f7358SJed Brown ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr); 2830552f7358SJed Brown } 2831552f7358SJed Brown ierr = PetscFree(tmpPoints);CHKERRQ(ierr); 283282f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2833552f7358SJed Brown PetscFunctionReturn(0); 2834552f7358SJed Brown } 2835552f7358SJed Brown 2836552f7358SJed Brown #undef __FUNCT__ 2837552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition" 2838552f7358SJed Brown /* 2839552f7358SJed Brown DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height 2840552f7358SJed Brown 2841552f7358SJed Brown Collective on DM 2842552f7358SJed Brown 2843552f7358SJed Brown Input Parameters: 2844552f7358SJed Brown + dm - The DM 2845552f7358SJed Brown . height - The height for points in the partition 2846552f7358SJed Brown - enlarge - Expand each partition with neighbors 2847552f7358SJed Brown 2848552f7358SJed Brown Output Parameters: 2849552f7358SJed Brown + partSection - The PetscSection giving the division of points by partition 2850552f7358SJed Brown . partition - The list of points by partition 28510298fd71SBarry Smith . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL 28520298fd71SBarry Smith - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL 2853552f7358SJed Brown 2854552f7358SJed Brown Level: developer 2855552f7358SJed Brown 2856552f7358SJed Brown .seealso DMPlexDistribute() 2857552f7358SJed Brown */ 2858ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition) 28590adebc6cSBarry Smith { 2860ac17c9edSMatthew G. Knepley char partname[1024]; 2861ac17c9edSMatthew G. Knepley PetscBool isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg; 2862552f7358SJed Brown PetscMPIInt size; 2863552f7358SJed Brown PetscErrorCode ierr; 2864552f7358SJed Brown 2865552f7358SJed Brown PetscFunctionBegin; 286682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 28670d644c17SKarl Rupp 28680298fd71SBarry Smith *origPartSection = NULL; 28690298fd71SBarry Smith *origPartition = NULL; 2870552f7358SJed Brown if (size == 1) { 2871552f7358SJed Brown PetscInt *points; 2872552f7358SJed Brown PetscInt cStart, cEnd, c; 2873552f7358SJed Brown 2874552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 287582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr); 2876552f7358SJed Brown ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr); 2877552f7358SJed Brown ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr); 2878552f7358SJed Brown ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr); 2879785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &points);CHKERRQ(ierr); 28800d644c17SKarl Rupp for (c = cStart; c < cEnd; ++c) points[c] = c; 288182f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2882552f7358SJed Brown PetscFunctionReturn(0); 2883552f7358SJed Brown } 2884ac17c9edSMatthew G. Knepley ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr); 2885ac17c9edSMatthew G. Knepley if (flg) name = partname; 2886ac17c9edSMatthew G. Knepley if (name) { 2887ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr); 2888ac17c9edSMatthew G. Knepley ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr); 2889ac17c9edSMatthew G. Knepley } 2890552f7358SJed Brown if (height == 0) { 2891552f7358SJed Brown PetscInt numVertices; 28920298fd71SBarry Smith PetscInt *start = NULL; 28930298fd71SBarry Smith PetscInt *adjacency = NULL; 2894552f7358SJed Brown 289577c88f5bSMatthew G Knepley ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr); 2896ac17c9edSMatthew G. Knepley if (!name || isChaco) { 2897519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO) 2898552f7358SJed Brown ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2899ac17c9edSMatthew G. Knepley #else 2900ac17c9edSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco."); 2901552f7358SJed Brown #endif 2902ac17c9edSMatthew G. Knepley } else if (isMetis) { 2903519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS) 2904552f7358SJed Brown ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr); 2905552f7358SJed Brown #endif 2906ac17c9edSMatthew G. Knepley } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name); 2907552f7358SJed Brown if (enlarge) { 2908552f7358SJed Brown *origPartSection = *partSection; 2909552f7358SJed Brown *origPartition = *partition; 29100d644c17SKarl Rupp 2911552f7358SJed Brown ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr); 2912552f7358SJed Brown } 2913552f7358SJed Brown ierr = PetscFree(start);CHKERRQ(ierr); 2914552f7358SJed Brown ierr = PetscFree(adjacency);CHKERRQ(ierr); 2915552f7358SJed Brown # if 0 2916552f7358SJed Brown } else if (height == 1) { 2917552f7358SJed Brown /* Build the dual graph for faces and partition the hypergraph */ 2918552f7358SJed Brown PetscInt numEdges; 2919552f7358SJed Brown 2920552f7358SJed Brown buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase()); 2921552f7358SJed Brown GraphPartitioner().partition(numEdges, start, adjacency, partition, manager); 2922552f7358SJed Brown destroyCSR(numEdges, start, adjacency); 2923552f7358SJed Brown #endif 292482f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height); 2925552f7358SJed Brown PetscFunctionReturn(0); 2926552f7358SJed Brown } 2927552f7358SJed Brown 2928552f7358SJed Brown #undef __FUNCT__ 2929552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure" 29300adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition) 29310adebc6cSBarry Smith { 2932552f7358SJed Brown /* const PetscInt height = 0; */ 2933552f7358SJed Brown const PetscInt *partArray; 2934cb3cb6d9SJed Brown PetscInt *allPoints, *packPoints; 2935cb3cb6d9SJed Brown PetscInt rStart, rEnd, rank, pStart, pEnd, newSize; 2936552f7358SJed Brown PetscErrorCode ierr; 2937cb3cb6d9SJed Brown PetscBT bt; 2938cb3cb6d9SJed Brown PetscSegBuffer segpack,segpart; 2939552f7358SJed Brown 2940552f7358SJed Brown PetscFunctionBegin; 2941552f7358SJed Brown ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr); 2942552f7358SJed Brown ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr); 294382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 2944552f7358SJed Brown ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr); 2945cb3cb6d9SJed Brown ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr); 2946cb3cb6d9SJed Brown ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr); 2947cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr); 2948cb3cb6d9SJed Brown ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr); 2949552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2950471ecdacSJed Brown PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints; 2951552f7358SJed Brown 2952552f7358SJed Brown ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr); 2953552f7358SJed Brown ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr); 2954552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2955552f7358SJed Brown PetscInt point = partArray[offset+p], closureSize, c; 29560298fd71SBarry Smith PetscInt *closure = NULL; 2957552f7358SJed Brown 2958552f7358SJed Brown /* TODO Include support for height > 0 case */ 2959552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2960cb3cb6d9SJed Brown for (c=0; c<closureSize; c++) { 2961cb3cb6d9SJed Brown PetscInt cpoint = closure[c*2]; 2962cb3cb6d9SJed Brown if (!PetscBTLookupSet(bt,cpoint-pStart)) { 2963471ecdacSJed Brown PetscInt *PETSC_RESTRICT pt; 2964cb3cb6d9SJed Brown partSize++; 2965471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr); 2966cb3cb6d9SJed Brown *pt = cpoint; 2967552f7358SJed Brown } 2968cb3cb6d9SJed Brown } 2969552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2970552f7358SJed Brown } 2971552f7358SJed Brown ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr); 2972471ecdacSJed Brown ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr); 2973471ecdacSJed Brown ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr); 2974471ecdacSJed Brown ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr); 2975471ecdacSJed Brown for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);} 2976552f7358SJed Brown } 2977cb3cb6d9SJed Brown ierr = PetscBTDestroy(&bt);CHKERRQ(ierr); 2978cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr); 2979cb3cb6d9SJed Brown 2980552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 2981552f7358SJed Brown ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr); 2982785e854fSJed Brown ierr = PetscMalloc1(newSize, &allPoints);CHKERRQ(ierr); 2983552f7358SJed Brown 2984137cf7b6SJed Brown ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr); 2985552f7358SJed Brown for (rank = rStart; rank < rEnd; ++rank) { 2986cb3cb6d9SJed Brown PetscInt numPoints, offset; 2987552f7358SJed Brown 2988cb3cb6d9SJed Brown ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr); 2989cb3cb6d9SJed Brown ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr); 2990cb3cb6d9SJed Brown ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr); 2991cb3cb6d9SJed Brown packPoints += numPoints; 2992552f7358SJed Brown } 2993cb3cb6d9SJed Brown 2994cb3cb6d9SJed Brown ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr); 2995552f7358SJed Brown ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr); 299682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr); 2997552f7358SJed Brown PetscFunctionReturn(0); 2998552f7358SJed Brown } 2999552f7358SJed Brown 3000552f7358SJed Brown #undef __FUNCT__ 3001552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField" 30021858a729SMatthew G. Knepley /*@ 30031858a729SMatthew G. Knepley DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 30041858a729SMatthew G. Knepley 30051858a729SMatthew G. Knepley Collective on DM 30061858a729SMatthew G. Knepley 3007552f7358SJed Brown Input Parameters: 30081858a729SMatthew G. Knepley + dm - The DMPlex object 30091858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 30101858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 30111858a729SMatthew G. Knepley - originalVec - The existing data 3012552f7358SJed Brown 3013552f7358SJed Brown Output Parameters: 30141858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 30151858a729SMatthew G. Knepley - newVec - The new data 30161858a729SMatthew G. Knepley 30171858a729SMatthew G. Knepley Level: developer 30181858a729SMatthew G. Knepley 30191858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData() 30201858a729SMatthew G. Knepley @*/ 3021552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec) 3022552f7358SJed Brown { 3023552f7358SJed Brown PetscSF fieldSF; 3024552f7358SJed Brown PetscInt *remoteOffsets, fieldSize; 3025552f7358SJed Brown PetscScalar *originalValues, *newValues; 3026552f7358SJed Brown PetscErrorCode ierr; 3027552f7358SJed Brown 3028552f7358SJed Brown PetscFunctionBegin; 30291337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3030552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 3031552f7358SJed Brown 3032552f7358SJed Brown ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 3033552f7358SJed Brown ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr); 3034c0dedaeaSBarry Smith ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr); 3035552f7358SJed Brown 3036552f7358SJed Brown ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr); 3037552f7358SJed Brown ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr); 3038552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 3039552f7358SJed Brown ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3040552f7358SJed Brown ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr); 3041552f7358SJed Brown ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 3042552f7358SJed Brown ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr); 3043552f7358SJed Brown ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr); 30441337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeField,dm,0,0,0);CHKERRQ(ierr); 3045552f7358SJed Brown PetscFunctionReturn(0); 3046552f7358SJed Brown } 3047552f7358SJed Brown 3048552f7358SJed Brown #undef __FUNCT__ 30491858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData" 30501858a729SMatthew G. Knepley /*@ 30511858a729SMatthew G. Knepley DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution 30521858a729SMatthew G. Knepley 30531858a729SMatthew G. Knepley Collective on DM 30541858a729SMatthew G. Knepley 30551858a729SMatthew G. Knepley Input Parameters: 30561858a729SMatthew G. Knepley + dm - The DMPlex object 30571858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern 30581858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout 30591858a729SMatthew G. Knepley . datatype - The type of data 30601858a729SMatthew G. Knepley - originalData - The existing data 30611858a729SMatthew G. Knepley 30621858a729SMatthew G. Knepley Output Parameters: 30631858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout 30641858a729SMatthew G. Knepley - newData - The new data 30651858a729SMatthew G. Knepley 30661858a729SMatthew G. Knepley Level: developer 30671858a729SMatthew G. Knepley 30681858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField() 30691858a729SMatthew G. Knepley @*/ 30701858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData) 30711858a729SMatthew G. Knepley { 30721858a729SMatthew G. Knepley PetscSF fieldSF; 30731858a729SMatthew G. Knepley PetscInt *remoteOffsets, fieldSize; 30741858a729SMatthew G. Knepley PetscMPIInt dataSize; 30751858a729SMatthew G. Knepley PetscErrorCode ierr; 30761858a729SMatthew G. Knepley 30771858a729SMatthew G. Knepley PetscFunctionBegin; 30781337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 30791858a729SMatthew G. Knepley ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr); 30801858a729SMatthew G. Knepley 30811858a729SMatthew G. Knepley ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr); 30821858a729SMatthew G. Knepley ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr); 30831858a729SMatthew G. Knepley ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr); 30841858a729SMatthew G. Knepley 30851858a729SMatthew G. Knepley ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr); 30861858a729SMatthew G. Knepley ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 30871858a729SMatthew G. Knepley ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr); 30881858a729SMatthew G. Knepley ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr); 30891337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeData,dm,0,0,0);CHKERRQ(ierr); 30901858a729SMatthew G. Knepley PetscFunctionReturn(0); 30911858a729SMatthew G. Knepley } 30921858a729SMatthew G. Knepley 30931858a729SMatthew G. Knepley #undef __FUNCT__ 3094552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute" 3095552f7358SJed Brown /*@C 3096552f7358SJed Brown DMPlexDistribute - Distributes the mesh and any associated sections. 3097552f7358SJed Brown 3098552f7358SJed Brown Not Collective 3099552f7358SJed Brown 3100552f7358SJed Brown Input Parameter: 3101552f7358SJed Brown + dm - The original DMPlex object 3102552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default 3103552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default 3104552f7358SJed Brown 3105552f7358SJed Brown Output Parameter: 3106e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution 3107e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL 3108552f7358SJed Brown 31090298fd71SBarry Smith Note: If the mesh was not distributed, the return value is NULL 3110552f7358SJed Brown 3111552f7358SJed Brown Level: intermediate 3112552f7358SJed Brown 3113552f7358SJed Brown .keywords: mesh, elements 3114552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace() 3115552f7358SJed Brown @*/ 3116e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel) 3117552f7358SJed Brown { 3118552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data, *pmesh; 311982f516ccSBarry Smith MPI_Comm comm; 3120552f7358SJed Brown const PetscInt height = 0; 3121552f7358SJed Brown PetscInt dim, numRemoteRanks; 3122057e8d19SMichael Lange IS origCellPart, origPart, cellPart, part; 3123057e8d19SMichael Lange PetscSection origCellPartSection, origPartSection, cellPartSection, partSection; 3124552f7358SJed Brown PetscSFNode *remoteRanks; 3125552f7358SJed Brown PetscSF partSF, pointSF, coneSF; 3126552f7358SJed Brown ISLocalToGlobalMapping renumbering; 3127552f7358SJed Brown PetscSection originalConeSection, newConeSection; 3128552f7358SJed Brown PetscInt *remoteOffsets; 3129552f7358SJed Brown PetscInt *cones, *newCones, newConesSize; 3130552f7358SJed Brown PetscBool flg; 3131552f7358SJed Brown PetscMPIInt rank, numProcs, p; 3132552f7358SJed Brown PetscErrorCode ierr; 3133552f7358SJed Brown 3134552f7358SJed Brown PetscFunctionBegin; 3135552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3136e7ba9e7aSMatthew G. Knepley if (sf) PetscValidPointer(sf,4); 3137e7ba9e7aSMatthew G. Knepley PetscValidPointer(dmParallel,5); 31380d644c17SKarl Rupp 3139552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 314082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3141552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3142552f7358SJed Brown ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr); 31430d644c17SKarl Rupp 31440298fd71SBarry Smith *dmParallel = NULL; 3145552f7358SJed Brown if (numProcs == 1) PetscFunctionReturn(0); 3146552f7358SJed Brown 3147552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3148552f7358SJed Brown /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */ 3149b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 315082f516ccSBarry Smith if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented"); 3151ac17c9edSMatthew G. Knepley ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr); 3152552f7358SJed Brown /* Create SF assuming a serial partition for all processes: Could check for IS length here */ 31530d644c17SKarl Rupp if (!rank) numRemoteRanks = numProcs; 31540d644c17SKarl Rupp else numRemoteRanks = 0; 3155785e854fSJed Brown ierr = PetscMalloc1(numRemoteRanks, &remoteRanks);CHKERRQ(ierr); 3156552f7358SJed Brown for (p = 0; p < numRemoteRanks; ++p) { 3157552f7358SJed Brown remoteRanks[p].rank = p; 3158552f7358SJed Brown remoteRanks[p].index = 0; 3159552f7358SJed Brown } 3160552f7358SJed Brown ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr); 31610298fd71SBarry Smith ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr); 3162552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr); 3163552f7358SJed Brown if (flg) { 3164552f7358SJed Brown ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr); 3165552f7358SJed Brown ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 31660298fd71SBarry Smith ierr = ISView(cellPart, NULL);CHKERRQ(ierr); 3167552f7358SJed Brown if (origCellPart) { 3168552f7358SJed Brown ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr); 3169552f7358SJed Brown ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 31700298fd71SBarry Smith ierr = ISView(origCellPart, NULL);CHKERRQ(ierr); 3171552f7358SJed Brown } 31720298fd71SBarry Smith ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr); 3173552f7358SJed Brown } 3174552f7358SJed Brown /* Close the partition over the mesh */ 3175552f7358SJed Brown ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr); 3176552f7358SJed Brown ierr = ISDestroy(&cellPart);CHKERRQ(ierr); 3177552f7358SJed Brown ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr); 3178552f7358SJed Brown /* Create new mesh */ 3179552f7358SJed Brown ierr = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr); 3180552f7358SJed Brown ierr = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr); 3181552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr); 3182552f7358SJed Brown pmesh = (DM_Plex*) (*dmParallel)->data; 3183552f7358SJed Brown /* Distribute sieve points and the global point numbering (replaces creating remote bases) */ 3184552f7358SJed Brown ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr); 3185552f7358SJed Brown if (flg) { 3186552f7358SJed Brown ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr); 3187552f7358SJed Brown ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 31880298fd71SBarry Smith ierr = ISView(part, NULL);CHKERRQ(ierr); 31890298fd71SBarry Smith ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr); 3190552f7358SJed Brown ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr); 31910298fd71SBarry Smith ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr); 3192552f7358SJed Brown } 3193b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr); 31941337e6e5SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3195552f7358SJed Brown /* Distribute cone section */ 3196552f7358SJed Brown ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr); 3197552f7358SJed Brown ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr); 3198552f7358SJed Brown ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr); 3199552f7358SJed Brown ierr = DMSetUp(*dmParallel);CHKERRQ(ierr); 3200552f7358SJed Brown { 3201552f7358SJed Brown PetscInt pStart, pEnd, p; 3202552f7358SJed Brown 3203552f7358SJed Brown ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr); 3204552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3205552f7358SJed Brown PetscInt coneSize; 3206552f7358SJed Brown ierr = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr); 3207552f7358SJed Brown pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize); 3208552f7358SJed Brown } 3209552f7358SJed Brown } 3210552f7358SJed Brown /* Communicate and renumber cones */ 3211552f7358SJed Brown ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr); 3212552f7358SJed Brown ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr); 3213552f7358SJed Brown ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr); 3214552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3215552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3216552f7358SJed Brown ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr); 32170298fd71SBarry Smith ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr); 3218552f7358SJed Brown ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr); 3219552f7358SJed Brown if (flg) { 3220552f7358SJed Brown ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr); 3221552f7358SJed Brown ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 3222552f7358SJed Brown ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr); 3223552f7358SJed Brown ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 32240298fd71SBarry Smith ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr); 3225552f7358SJed Brown } 3226552f7358SJed Brown ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr); 3227552f7358SJed Brown ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr); 3228552f7358SJed Brown ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3229552f7358SJed Brown ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr); 3230552f7358SJed Brown ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr); 32311337e6e5SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeCones,dm,0,0,0);CHKERRQ(ierr); 3232552f7358SJed Brown /* Create supports and stratify sieve */ 3233552f7358SJed Brown { 3234552f7358SJed Brown PetscInt pStart, pEnd; 3235552f7358SJed Brown 3236552f7358SJed Brown ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 3237552f7358SJed Brown ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 3238552f7358SJed Brown } 3239552f7358SJed Brown ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr); 3240552f7358SJed Brown ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr); 3241552f7358SJed Brown /* Distribute Coordinates */ 3242552f7358SJed Brown { 3243552f7358SJed Brown PetscSection originalCoordSection, newCoordSection; 3244552f7358SJed Brown Vec originalCoordinates, newCoordinates; 3245552f7358SJed Brown const char *name; 3246552f7358SJed Brown 324769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr); 324869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr); 3249552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr); 3250552f7358SJed Brown ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr); 3251552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr); 3252552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr); 3253552f7358SJed Brown 3254552f7358SJed Brown ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr); 3255552f7358SJed Brown ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr); 3256552f7358SJed Brown ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr); 3257552f7358SJed Brown } 3258552f7358SJed Brown /* Distribute labels */ 3259b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 3260552f7358SJed Brown { 3261552f7358SJed Brown DMLabel next = mesh->labels, newNext = pmesh->labels; 3262552f7358SJed Brown PetscInt numLabels = 0, l; 3263552f7358SJed Brown 3264552f7358SJed Brown /* Bcast number of labels */ 326520cb08bdSMatthew G. Knepley while (next) {++numLabels; next = next->next;} 3266552f7358SJed Brown ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 3267552f7358SJed Brown next = mesh->labels; 3268552f7358SJed Brown for (l = 0; l < numLabels; ++l) { 326920cb08bdSMatthew G. Knepley DMLabel labelNew; 3270552f7358SJed Brown PetscBool isdepth; 3271552f7358SJed Brown 327220cb08bdSMatthew G. Knepley /* Skip "depth" because it is recreated */ 327320cb08bdSMatthew G. Knepley if (!rank) {ierr = PetscStrcmp(next->name, "depth", &isdepth);CHKERRQ(ierr);} 327420cb08bdSMatthew G. Knepley ierr = MPI_Bcast(&isdepth, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 327520cb08bdSMatthew G. Knepley if (isdepth) {if (!rank) next = next->next; continue;} 327620cb08bdSMatthew G. Knepley ierr = DMLabelDistribute(next, partSection, part, renumbering, &labelNew);CHKERRQ(ierr); 3277552f7358SJed Brown /* Insert into list */ 327820cb08bdSMatthew G. Knepley if (newNext) newNext->next = labelNew; 327920cb08bdSMatthew G. Knepley else pmesh->labels = labelNew; 328020cb08bdSMatthew G. Knepley newNext = labelNew; 32810d644c17SKarl Rupp if (!rank) next = next->next; 3282552f7358SJed Brown } 3283552f7358SJed Brown } 3284b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr); 32855a9d0af9SMatthew G. Knepley /* Setup hybrid structure */ 32865a9d0af9SMatthew G. Knepley { 32875a9d0af9SMatthew G. Knepley const PetscInt *gpoints; 32885a9d0af9SMatthew G. Knepley PetscInt depth, n, d; 32895a9d0af9SMatthew G. Knepley 32905a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];} 32915a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr); 32925a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr); 32935a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr); 32945a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 32955a9d0af9SMatthew G. Knepley for (d = 0; d <= dim; ++d) { 32965a9d0af9SMatthew G. Knepley PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p; 32975a9d0af9SMatthew G. Knepley 32985a9d0af9SMatthew G. Knepley if (pmax < 0) continue; 32995a9d0af9SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr); 33006dfbe1fcSMatthew G. Knepley ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr); 33015a9d0af9SMatthew G. Knepley ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr); 33025a9d0af9SMatthew G. Knepley for (p = 0; p < n; ++p) { 33035a9d0af9SMatthew G. Knepley const PetscInt point = gpoints[p]; 33045a9d0af9SMatthew G. Knepley 33055a9d0af9SMatthew G. Knepley if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax; 33065a9d0af9SMatthew G. Knepley } 33075a9d0af9SMatthew G. Knepley if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax; 33085a9d0af9SMatthew G. Knepley else pmesh->hybridPointMax[d] = -1; 33095a9d0af9SMatthew G. Knepley } 33105a9d0af9SMatthew G. Knepley ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr); 33115a9d0af9SMatthew G. Knepley } 3312552f7358SJed Brown /* Cleanup Partition */ 3313552f7358SJed Brown ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr); 3314552f7358SJed Brown ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr); 3315552f7358SJed Brown ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr); 3316552f7358SJed Brown ierr = ISDestroy(&part);CHKERRQ(ierr); 3317552f7358SJed Brown /* Create point SF for parallel mesh */ 3318b96ba592SMatthew G. Knepley ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3319552f7358SJed Brown { 3320552f7358SJed Brown const PetscInt *leaves; 3321552f7358SJed Brown PetscSFNode *remotePoints, *rowners, *lowners; 3322552f7358SJed Brown PetscInt numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints; 3323552f7358SJed Brown PetscInt pStart, pEnd; 3324552f7358SJed Brown 3325552f7358SJed Brown ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr); 33260298fd71SBarry Smith ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr); 3327dcca6d9dSJed Brown ierr = PetscMalloc2(numRoots,&rowners,numLeaves,&lowners);CHKERRQ(ierr); 3328552f7358SJed Brown for (p=0; p<numRoots; p++) { 3329552f7358SJed Brown rowners[p].rank = -1; 3330552f7358SJed Brown rowners[p].index = -1; 3331552f7358SJed Brown } 3332552f7358SJed Brown if (origCellPart) { 3333057e8d19SMichael Lange /* Make sure points in the original partition are not assigned to other procs */ 3334057e8d19SMichael Lange const PetscInt *origPoints; 3335552f7358SJed Brown 3336057e8d19SMichael Lange ierr = DMPlexCreatePartitionClosure(dm, origCellPartSection, origCellPart, &origPartSection, &origPart);CHKERRQ(ierr); 3337057e8d19SMichael Lange ierr = ISGetIndices(origPart, &origPoints);CHKERRQ(ierr); 3338552f7358SJed Brown for (p = 0; p < numProcs; ++p) { 3339552f7358SJed Brown PetscInt dof, off, d; 3340552f7358SJed Brown 3341057e8d19SMichael Lange ierr = PetscSectionGetDof(origPartSection, p, &dof);CHKERRQ(ierr); 3342057e8d19SMichael Lange ierr = PetscSectionGetOffset(origPartSection, p, &off);CHKERRQ(ierr); 3343552f7358SJed Brown for (d = off; d < off+dof; ++d) { 3344057e8d19SMichael Lange rowners[origPoints[d]].rank = p; 3345552f7358SJed Brown } 3346552f7358SJed Brown } 3347057e8d19SMichael Lange ierr = ISRestoreIndices(origPart, &origPoints);CHKERRQ(ierr); 3348057e8d19SMichael Lange ierr = ISDestroy(&origPart);CHKERRQ(ierr); 3349057e8d19SMichael Lange ierr = PetscSectionDestroy(&origPartSection);CHKERRQ(ierr); 3350552f7358SJed Brown } 3351552f7358SJed Brown ierr = ISDestroy(&origCellPart);CHKERRQ(ierr); 3352552f7358SJed Brown ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr); 3353552f7358SJed Brown 3354552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3355552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3356552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3357552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */ 3358552f7358SJed Brown lowners[p].rank = rank; 3359552f7358SJed Brown lowners[p].index = leaves ? leaves[p] : p; 3360552f7358SJed Brown } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */ 3361552f7358SJed Brown lowners[p].rank = -2; 3362552f7358SJed Brown lowners[p].index = -2; 3363552f7358SJed Brown } 3364552f7358SJed Brown } 3365552f7358SJed Brown for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */ 3366552f7358SJed Brown rowners[p].rank = -3; 3367552f7358SJed Brown rowners[p].index = -3; 3368552f7358SJed Brown } 3369552f7358SJed Brown ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3370552f7358SJed Brown ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr); 3371552f7358SJed Brown ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3372552f7358SJed Brown ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr); 3373552f7358SJed Brown for (p = 0; p < numLeaves; ++p) { 3374552f7358SJed Brown if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed"); 3375552f7358SJed Brown if (lowners[p].rank != rank) ++numGhostPoints; 3376552f7358SJed Brown } 3377785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &ghostPoints);CHKERRQ(ierr); 3378785e854fSJed Brown ierr = PetscMalloc1(numGhostPoints, &remotePoints);CHKERRQ(ierr); 3379552f7358SJed Brown for (p = 0, gp = 0; p < numLeaves; ++p) { 3380552f7358SJed Brown if (lowners[p].rank != rank) { 3381552f7358SJed Brown ghostPoints[gp] = leaves ? leaves[p] : p; 3382552f7358SJed Brown remotePoints[gp].rank = lowners[p].rank; 3383552f7358SJed Brown remotePoints[gp].index = lowners[p].index; 3384552f7358SJed Brown ++gp; 3385552f7358SJed Brown } 3386552f7358SJed Brown } 3387552f7358SJed Brown ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr); 3388552f7358SJed Brown ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr); 3389552f7358SJed Brown ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr); 3390552f7358SJed Brown } 3391b96ba592SMatthew G. Knepley ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr); 3392552f7358SJed Brown /* Cleanup */ 3393e7ba9e7aSMatthew G. Knepley if (sf) {*sf = pointSF;} 3394e7ba9e7aSMatthew G. Knepley else {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);} 3395552f7358SJed Brown ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr); 3396552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr); 3397552f7358SJed Brown PetscFunctionReturn(0); 3398552f7358SJed Brown } 3399552f7358SJed Brown 34002e1b13c2SMatthew G. Knepley #undef __FUNCT__ 34019db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 34029db3b87dSMatthew G. Knepley /*@C 34039db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 34049db3b87dSMatthew G. Knepley 34059db3b87dSMatthew G. Knepley Input Parameters: 34069db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 34079db3b87dSMatthew G. Knepley - cone - The incoming cone 34089db3b87dSMatthew G. Knepley 34099db3b87dSMatthew G. Knepley Output Parameter: 34109db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 34119db3b87dSMatthew G. Knepley 34129db3b87dSMatthew G. Knepley Level: developer 34139db3b87dSMatthew G. Knepley 34149db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 34159db3b87dSMatthew G. Knepley @*/ 34169db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 34172e1b13c2SMatthew G. Knepley { 34189db3b87dSMatthew G. Knepley int tmpc; 34192e1b13c2SMatthew G. Knepley 34202e1b13c2SMatthew G. Knepley PetscFunctionBegin; 34219db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 34229db3b87dSMatthew G. Knepley switch (numCorners) { 34239db3b87dSMatthew G. Knepley case 4: 34241885f254SMatthew G. Knepley tmpc = cone[0]; 34251885f254SMatthew G. Knepley cone[0] = cone[1]; 34261885f254SMatthew G. Knepley cone[1] = tmpc; 34279db3b87dSMatthew G. Knepley break; 34289db3b87dSMatthew G. Knepley case 8: 34299db3b87dSMatthew G. Knepley tmpc = cone[1]; 34309db3b87dSMatthew G. Knepley cone[1] = cone[3]; 34319db3b87dSMatthew G. Knepley cone[3] = tmpc; 34329db3b87dSMatthew G. Knepley break; 34339db3b87dSMatthew G. Knepley default: break; 34349db3b87dSMatthew G. Knepley } 34359db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 34369db3b87dSMatthew G. Knepley } 34379db3b87dSMatthew G. Knepley 34389db3b87dSMatthew G. Knepley #undef __FUNCT__ 34399db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 34409db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 34419db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 34429db3b87dSMatthew G. Knepley { 34439db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 34449db3b87dSMatthew G. Knepley PetscErrorCode ierr; 34459db3b87dSMatthew G. Knepley 34469db3b87dSMatthew G. Knepley PetscFunctionBegin; 34479db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 34489db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 34492e1b13c2SMatthew G. Knepley } 34502e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 34512e1b13c2SMatthew G. Knepley } 34522e1b13c2SMatthew G. Knepley 3453519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3454552f7358SJed Brown #include <triangle.h> 3455552f7358SJed Brown 3456552f7358SJed Brown #undef __FUNCT__ 3457552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 34580adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 34590adebc6cSBarry Smith { 3460552f7358SJed Brown PetscFunctionBegin; 3461552f7358SJed Brown inputCtx->numberofpoints = 0; 3462552f7358SJed Brown inputCtx->numberofpointattributes = 0; 34630298fd71SBarry Smith inputCtx->pointlist = NULL; 34640298fd71SBarry Smith inputCtx->pointattributelist = NULL; 34650298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 3466552f7358SJed Brown inputCtx->numberofsegments = 0; 34670298fd71SBarry Smith inputCtx->segmentlist = NULL; 34680298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 3469552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 34700298fd71SBarry Smith inputCtx->trianglelist = NULL; 3471552f7358SJed Brown inputCtx->numberofholes = 0; 34720298fd71SBarry Smith inputCtx->holelist = NULL; 3473552f7358SJed Brown inputCtx->numberofregions = 0; 34740298fd71SBarry Smith inputCtx->regionlist = NULL; 3475552f7358SJed Brown PetscFunctionReturn(0); 3476552f7358SJed Brown } 3477552f7358SJed Brown 3478552f7358SJed Brown #undef __FUNCT__ 3479552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 34800adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 34810adebc6cSBarry Smith { 3482552f7358SJed Brown PetscFunctionBegin; 3483552f7358SJed Brown outputCtx->numberofpoints = 0; 34840298fd71SBarry Smith outputCtx->pointlist = NULL; 34850298fd71SBarry Smith outputCtx->pointattributelist = NULL; 34860298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 3487552f7358SJed Brown outputCtx->numberoftriangles = 0; 34880298fd71SBarry Smith outputCtx->trianglelist = NULL; 34890298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 34900298fd71SBarry Smith outputCtx->neighborlist = NULL; 34910298fd71SBarry Smith outputCtx->segmentlist = NULL; 34920298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 3493552f7358SJed Brown outputCtx->numberofedges = 0; 34940298fd71SBarry Smith outputCtx->edgelist = NULL; 34950298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 3496552f7358SJed Brown PetscFunctionReturn(0); 3497552f7358SJed Brown } 3498552f7358SJed Brown 3499552f7358SJed Brown #undef __FUNCT__ 3500552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 35010adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 35020adebc6cSBarry Smith { 3503552f7358SJed Brown PetscFunctionBegin; 3504552f7358SJed Brown free(outputCtx->pointmarkerlist); 3505552f7358SJed Brown free(outputCtx->edgelist); 3506552f7358SJed Brown free(outputCtx->edgemarkerlist); 3507552f7358SJed Brown free(outputCtx->trianglelist); 3508552f7358SJed Brown free(outputCtx->neighborlist); 3509552f7358SJed Brown PetscFunctionReturn(0); 3510552f7358SJed Brown } 3511552f7358SJed Brown 3512552f7358SJed Brown #undef __FUNCT__ 3513552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 3514552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 3515552f7358SJed Brown { 351682f516ccSBarry Smith MPI_Comm comm; 3517552f7358SJed Brown PetscInt dim = 2; 3518552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 3519552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 3520552f7358SJed Brown struct triangulateio in; 3521552f7358SJed Brown struct triangulateio out; 3522552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 3523552f7358SJed Brown PetscMPIInt rank; 3524552f7358SJed Brown PetscErrorCode ierr; 3525552f7358SJed Brown 3526552f7358SJed Brown PetscFunctionBegin; 352782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3528552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3529552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3530552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3531552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 35320d644c17SKarl Rupp 3533552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3534552f7358SJed Brown if (in.numberofpoints > 0) { 3535552f7358SJed Brown PetscSection coordSection; 3536552f7358SJed Brown Vec coordinates; 3537552f7358SJed Brown PetscScalar *array; 3538552f7358SJed Brown 3539785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3540785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3541552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 354269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3543552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3544552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3545552f7358SJed Brown const PetscInt idx = v - vStart; 3546552f7358SJed Brown PetscInt off, d; 3547552f7358SJed Brown 3548552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3549552f7358SJed Brown for (d = 0; d < dim; ++d) { 3550552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3551552f7358SJed Brown } 3552552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3553552f7358SJed Brown } 3554552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3555552f7358SJed Brown } 3556552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 3557552f7358SJed Brown in.numberofsegments = eEnd - eStart; 3558552f7358SJed Brown if (in.numberofsegments > 0) { 3559785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 3560785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 3561552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 3562552f7358SJed Brown const PetscInt idx = e - eStart; 3563552f7358SJed Brown const PetscInt *cone; 3564552f7358SJed Brown 3565552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 35660d644c17SKarl Rupp 3567552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 3568552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 35690d644c17SKarl Rupp 3570552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 3571552f7358SJed Brown } 3572552f7358SJed Brown } 3573552f7358SJed Brown #if 0 /* Do not currently support holes */ 3574552f7358SJed Brown PetscReal *holeCoords; 3575552f7358SJed Brown PetscInt h, d; 3576552f7358SJed Brown 3577552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3578552f7358SJed Brown if (in.numberofholes > 0) { 3579785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3580552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3581552f7358SJed Brown for (d = 0; d < dim; ++d) { 3582552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3583552f7358SJed Brown } 3584552f7358SJed Brown } 3585552f7358SJed Brown } 3586552f7358SJed Brown #endif 3587552f7358SJed Brown if (!rank) { 3588552f7358SJed Brown char args[32]; 3589552f7358SJed Brown 3590552f7358SJed Brown /* Take away 'Q' for verbose output */ 3591552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3592552f7358SJed Brown if (createConvexHull) { 3593552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 3594552f7358SJed Brown } 3595552f7358SJed Brown if (constrained) { 3596552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 3597552f7358SJed Brown } 35980298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3599552f7358SJed Brown } 3600552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3601552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3602552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3603552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3604552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 3605552f7358SJed Brown 3606552f7358SJed Brown { 3607552f7358SJed Brown const PetscInt numCorners = 3; 3608552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3609552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3610552f7358SJed Brown const int *cells = out.trianglelist; 3611552f7358SJed Brown const double *meshCoords = out.pointlist; 3612552f7358SJed Brown 36130fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3614552f7358SJed Brown /* Set labels */ 3615552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3616552f7358SJed Brown if (out.pointmarkerlist[v]) { 3617552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3618552f7358SJed Brown } 3619552f7358SJed Brown } 3620552f7358SJed Brown if (interpolate) { 3621552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3622552f7358SJed Brown if (out.edgemarkerlist[e]) { 3623552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3624552f7358SJed Brown const PetscInt *edges; 3625552f7358SJed Brown PetscInt numEdges; 3626552f7358SJed Brown 3627552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3628552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3629552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3630552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3631552f7358SJed Brown } 3632552f7358SJed Brown } 3633552f7358SJed Brown } 3634552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3635552f7358SJed Brown } 3636552f7358SJed Brown #if 0 /* Do not currently support holes */ 3637552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3638552f7358SJed Brown #endif 3639552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3640552f7358SJed Brown PetscFunctionReturn(0); 3641552f7358SJed Brown } 3642552f7358SJed Brown 3643552f7358SJed Brown #undef __FUNCT__ 3644552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 3645552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 3646552f7358SJed Brown { 364782f516ccSBarry Smith MPI_Comm comm; 3648552f7358SJed Brown PetscInt dim = 2; 3649552f7358SJed Brown struct triangulateio in; 3650552f7358SJed Brown struct triangulateio out; 3651552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3652552f7358SJed Brown PetscMPIInt rank; 3653552f7358SJed Brown PetscErrorCode ierr; 3654552f7358SJed Brown 3655552f7358SJed Brown PetscFunctionBegin; 365682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3657552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3658552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 3659552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 3660552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3661552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3662552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 36630d644c17SKarl Rupp 3664552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3665552f7358SJed Brown if (in.numberofpoints > 0) { 3666552f7358SJed Brown PetscSection coordSection; 3667552f7358SJed Brown Vec coordinates; 3668552f7358SJed Brown PetscScalar *array; 3669552f7358SJed Brown 3670785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 3671785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 3672552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 367369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3674552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3675552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3676552f7358SJed Brown const PetscInt idx = v - vStart; 3677552f7358SJed Brown PetscInt off, d; 3678552f7358SJed Brown 3679552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3680552f7358SJed Brown for (d = 0; d < dim; ++d) { 3681552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3682552f7358SJed Brown } 3683552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3684552f7358SJed Brown } 3685552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3686552f7358SJed Brown } 3687552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 36880d644c17SKarl Rupp 3689552f7358SJed Brown in.numberofcorners = 3; 3690552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 36910d644c17SKarl Rupp 3692552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 3693552f7358SJed Brown if (in.numberoftriangles > 0) { 3694785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 3695552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3696552f7358SJed Brown const PetscInt idx = c - cStart; 36970298fd71SBarry Smith PetscInt *closure = NULL; 3698552f7358SJed Brown PetscInt closureSize; 3699552f7358SJed Brown 3700552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3701552f7358SJed 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); 3702552f7358SJed Brown for (v = 0; v < 3; ++v) { 3703552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 3704552f7358SJed Brown } 3705552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3706552f7358SJed Brown } 3707552f7358SJed Brown } 3708552f7358SJed Brown /* TODO: Segment markers are missing on input */ 3709552f7358SJed Brown #if 0 /* Do not currently support holes */ 3710552f7358SJed Brown PetscReal *holeCoords; 3711552f7358SJed Brown PetscInt h, d; 3712552f7358SJed Brown 3713552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 3714552f7358SJed Brown if (in.numberofholes > 0) { 3715785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 3716552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 3717552f7358SJed Brown for (d = 0; d < dim; ++d) { 3718552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 3719552f7358SJed Brown } 3720552f7358SJed Brown } 3721552f7358SJed Brown } 3722552f7358SJed Brown #endif 3723552f7358SJed Brown if (!rank) { 3724552f7358SJed Brown char args[32]; 3725552f7358SJed Brown 3726552f7358SJed Brown /* Take away 'Q' for verbose output */ 3727552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 37280298fd71SBarry Smith triangulate(args, &in, &out, NULL); 3729552f7358SJed Brown } 3730552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 3731552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 3732552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 3733552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 3734552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 3735552f7358SJed Brown 3736552f7358SJed Brown { 3737552f7358SJed Brown const PetscInt numCorners = 3; 3738552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 3739552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3740552f7358SJed Brown const int *cells = out.trianglelist; 3741552f7358SJed Brown const double *meshCoords = out.pointlist; 3742552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3743552f7358SJed Brown 37440fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3745552f7358SJed Brown /* Set labels */ 3746552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3747552f7358SJed Brown if (out.pointmarkerlist[v]) { 3748552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3749552f7358SJed Brown } 3750552f7358SJed Brown } 3751552f7358SJed Brown if (interpolate) { 3752552f7358SJed Brown PetscInt e; 3753552f7358SJed Brown 3754552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3755552f7358SJed Brown if (out.edgemarkerlist[e]) { 3756552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3757552f7358SJed Brown const PetscInt *edges; 3758552f7358SJed Brown PetscInt numEdges; 3759552f7358SJed Brown 3760552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3761552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3762552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3763552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3764552f7358SJed Brown } 3765552f7358SJed Brown } 3766552f7358SJed Brown } 3767552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3768552f7358SJed Brown } 3769552f7358SJed Brown #if 0 /* Do not currently support holes */ 3770552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 3771552f7358SJed Brown #endif 3772552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 3773552f7358SJed Brown PetscFunctionReturn(0); 3774552f7358SJed Brown } 3775552f7358SJed Brown #endif 3776552f7358SJed Brown 3777519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3778552f7358SJed Brown #include <tetgen.h> 3779552f7358SJed Brown #undef __FUNCT__ 3780552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3781552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3782552f7358SJed Brown { 378382f516ccSBarry Smith MPI_Comm comm; 3784552f7358SJed Brown const PetscInt dim = 3; 3785552f7358SJed Brown ::tetgenio in; 3786552f7358SJed Brown ::tetgenio out; 3787552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3788552f7358SJed Brown PetscMPIInt rank; 3789552f7358SJed Brown PetscErrorCode ierr; 3790552f7358SJed Brown 3791552f7358SJed Brown PetscFunctionBegin; 379282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3793552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3794552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3795552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3796552f7358SJed Brown if (in.numberofpoints > 0) { 3797552f7358SJed Brown PetscSection coordSection; 3798552f7358SJed Brown Vec coordinates; 3799552f7358SJed Brown PetscScalar *array; 3800552f7358SJed Brown 3801552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3802552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 38030d644c17SKarl Rupp 3804552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 380569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3806552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3807552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3808552f7358SJed Brown const PetscInt idx = v - vStart; 3809552f7358SJed Brown PetscInt off, d; 3810552f7358SJed Brown 3811552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 38120d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3813552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3814552f7358SJed Brown } 3815552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3816552f7358SJed Brown } 3817552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 38180d644c17SKarl Rupp 3819552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3820552f7358SJed Brown if (in.numberoffacets > 0) { 3821552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3822552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3823552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3824552f7358SJed Brown const PetscInt idx = f - fStart; 38250298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3826552f7358SJed Brown 3827552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3828552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3829552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3830552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3831552f7358SJed Brown 3832552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3833552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3834552f7358SJed Brown const PetscInt point = points[p]; 38350d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3836552f7358SJed Brown } 3837552f7358SJed Brown 3838552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3839552f7358SJed Brown poly->numberofvertices = numVertices; 3840552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3841552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3842552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3843552f7358SJed Brown poly->vertexlist[v] = vIdx; 3844552f7358SJed Brown } 3845552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3846552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3847552f7358SJed Brown } 3848552f7358SJed Brown } 3849552f7358SJed Brown if (!rank) { 3850552f7358SJed Brown char args[32]; 3851552f7358SJed Brown 3852552f7358SJed Brown /* Take away 'Q' for verbose output */ 3853552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3854552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3855552f7358SJed Brown } 3856552f7358SJed Brown { 3857552f7358SJed Brown const PetscInt numCorners = 4; 3858552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3859552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3860552f7358SJed Brown const double *meshCoords = out.pointlist; 38611d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3862552f7358SJed Brown 38639db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 38640fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3865552f7358SJed Brown /* Set labels */ 3866552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3867552f7358SJed Brown if (out.pointmarkerlist[v]) { 3868552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3869552f7358SJed Brown } 3870552f7358SJed Brown } 3871552f7358SJed Brown if (interpolate) { 3872552f7358SJed Brown PetscInt e; 3873552f7358SJed Brown 3874552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3875552f7358SJed Brown if (out.edgemarkerlist[e]) { 3876552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3877552f7358SJed Brown const PetscInt *edges; 3878552f7358SJed Brown PetscInt numEdges; 3879552f7358SJed Brown 3880552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3881552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3882552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3883552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3884552f7358SJed Brown } 3885552f7358SJed Brown } 3886552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3887552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3888552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3889552f7358SJed Brown const PetscInt *faces; 3890552f7358SJed Brown PetscInt numFaces; 3891552f7358SJed Brown 3892552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3893552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3894552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3895552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3896552f7358SJed Brown } 3897552f7358SJed Brown } 3898552f7358SJed Brown } 3899552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3900552f7358SJed Brown } 3901552f7358SJed Brown PetscFunctionReturn(0); 3902552f7358SJed Brown } 3903552f7358SJed Brown 3904552f7358SJed Brown #undef __FUNCT__ 3905552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3906552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3907552f7358SJed Brown { 390882f516ccSBarry Smith MPI_Comm comm; 3909552f7358SJed Brown const PetscInt dim = 3; 3910552f7358SJed Brown ::tetgenio in; 3911552f7358SJed Brown ::tetgenio out; 3912552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3913552f7358SJed Brown PetscMPIInt rank; 3914552f7358SJed Brown PetscErrorCode ierr; 3915552f7358SJed Brown 3916552f7358SJed Brown PetscFunctionBegin; 391782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3918552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3919552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3920552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3921552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 39220d644c17SKarl Rupp 3923552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3924552f7358SJed Brown if (in.numberofpoints > 0) { 3925552f7358SJed Brown PetscSection coordSection; 3926552f7358SJed Brown Vec coordinates; 3927552f7358SJed Brown PetscScalar *array; 3928552f7358SJed Brown 3929552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3930552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 39310d644c17SKarl Rupp 3932552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 393369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3934552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3935552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3936552f7358SJed Brown const PetscInt idx = v - vStart; 3937552f7358SJed Brown PetscInt off, d; 3938552f7358SJed Brown 3939552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 39400d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3941552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3942552f7358SJed Brown } 3943552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3944552f7358SJed Brown } 3945552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 39460d644c17SKarl Rupp 3947552f7358SJed Brown in.numberofcorners = 4; 3948552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3949552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3950552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3951552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3952552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3953552f7358SJed Brown const PetscInt idx = c - cStart; 39540298fd71SBarry Smith PetscInt *closure = NULL; 3955552f7358SJed Brown PetscInt closureSize; 3956552f7358SJed Brown 3957552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3958552f7358SJed 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); 3959552f7358SJed Brown for (v = 0; v < 4; ++v) { 3960552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3961552f7358SJed Brown } 3962552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3963552f7358SJed Brown } 3964552f7358SJed Brown } 396519436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3966552f7358SJed Brown if (!rank) { 3967552f7358SJed Brown char args[32]; 3968552f7358SJed Brown 3969552f7358SJed Brown /* Take away 'Q' for verbose output */ 397019436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3971552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3972552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3973552f7358SJed Brown } 3974552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3975552f7358SJed Brown 3976552f7358SJed Brown { 3977552f7358SJed Brown const PetscInt numCorners = 4; 3978552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3979552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3980552f7358SJed Brown const double *meshCoords = out.pointlist; 39811d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 39821d4b4d7bSJed Brown 3983552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3984552f7358SJed Brown 39859db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 39860fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3987552f7358SJed Brown /* Set labels */ 3988552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3989552f7358SJed Brown if (out.pointmarkerlist[v]) { 3990552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3991552f7358SJed Brown } 3992552f7358SJed Brown } 3993552f7358SJed Brown if (interpolate) { 3994552f7358SJed Brown PetscInt e, f; 3995552f7358SJed Brown 3996552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3997552f7358SJed Brown if (out.edgemarkerlist[e]) { 3998552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3999552f7358SJed Brown const PetscInt *edges; 4000552f7358SJed Brown PetscInt numEdges; 4001552f7358SJed Brown 4002552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4003552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4004552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 4005552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4006552f7358SJed Brown } 4007552f7358SJed Brown } 4008552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 4009552f7358SJed Brown if (out.trifacemarkerlist[f]) { 4010552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 4011552f7358SJed Brown const PetscInt *faces; 4012552f7358SJed Brown PetscInt numFaces; 4013552f7358SJed Brown 4014552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4015552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4016552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 4017552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4018552f7358SJed Brown } 4019552f7358SJed Brown } 4020552f7358SJed Brown } 4021552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4022552f7358SJed Brown } 4023552f7358SJed Brown PetscFunctionReturn(0); 4024552f7358SJed Brown } 4025552f7358SJed Brown #endif 4026552f7358SJed Brown 4027519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4028aaa7dc30SBarry Smith #include <ctetgen.h> 4029552f7358SJed Brown 4030552f7358SJed Brown #undef __FUNCT__ 4031552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 4032552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 4033552f7358SJed Brown { 403482f516ccSBarry Smith MPI_Comm comm; 4035552f7358SJed Brown const PetscInt dim = 3; 4036552f7358SJed Brown PLC *in, *out; 4037552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 4038552f7358SJed Brown PetscMPIInt rank; 4039552f7358SJed Brown PetscErrorCode ierr; 4040552f7358SJed Brown 4041552f7358SJed Brown PetscFunctionBegin; 404282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 40430298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4044552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4045552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 4046552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4047552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 40480d644c17SKarl Rupp 4049552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4050552f7358SJed Brown if (in->numberofpoints > 0) { 4051552f7358SJed Brown PetscSection coordSection; 4052552f7358SJed Brown Vec coordinates; 4053552f7358SJed Brown PetscScalar *array; 4054552f7358SJed Brown 4055785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4056785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4057552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 405869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 4059552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4060552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4061552f7358SJed Brown const PetscInt idx = v - vStart; 4062552f7358SJed Brown PetscInt off, d, m; 4063552f7358SJed Brown 4064552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4065552f7358SJed Brown for (d = 0; d < dim; ++d) { 4066552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4067552f7358SJed Brown } 4068552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 40690d644c17SKarl Rupp 4070552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4071552f7358SJed Brown } 4072552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4073552f7358SJed Brown } 4074552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 40750d644c17SKarl Rupp 4076552f7358SJed Brown in->numberoffacets = fEnd - fStart; 4077552f7358SJed Brown if (in->numberoffacets > 0) { 4078785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 4079785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 4080552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 4081552f7358SJed Brown const PetscInt idx = f - fStart; 40820298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 4083552f7358SJed Brown polygon *poly; 4084552f7358SJed Brown 4085552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 40860d644c17SKarl Rupp 4087785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 40880d644c17SKarl Rupp 4089552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 40900298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 4091552f7358SJed Brown 4092552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4093552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 4094552f7358SJed Brown const PetscInt point = points[p]; 40950d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 4096552f7358SJed Brown } 4097552f7358SJed Brown 4098552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 4099552f7358SJed Brown poly->numberofvertices = numVertices; 4100785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 4101552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4102552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 4103552f7358SJed Brown poly->vertexlist[v] = vIdx; 4104552f7358SJed Brown } 4105552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 4106552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 4107552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4108552f7358SJed Brown } 4109552f7358SJed Brown } 4110552f7358SJed Brown if (!rank) { 4111552f7358SJed Brown TetGenOpts t; 4112552f7358SJed Brown 4113552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 4114552f7358SJed Brown t.in = boundary; /* Should go away */ 4115552f7358SJed Brown t.plc = 1; 4116552f7358SJed Brown t.quality = 1; 4117552f7358SJed Brown t.edgesout = 1; 4118552f7358SJed Brown t.zeroindex = 1; 4119552f7358SJed Brown t.quiet = 1; 4120552f7358SJed Brown t.verbose = verbose; 4121552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4122552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4123552f7358SJed Brown } 4124552f7358SJed Brown { 4125552f7358SJed Brown const PetscInt numCorners = 4; 4126552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4127552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4128552f7358SJed Brown const double *meshCoords = out->pointlist; 41291d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4130552f7358SJed Brown 41319db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 41320fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 4133552f7358SJed Brown /* Set labels */ 4134552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4135552f7358SJed Brown if (out->pointmarkerlist[v]) { 4136552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4137552f7358SJed Brown } 4138552f7358SJed Brown } 4139552f7358SJed Brown if (interpolate) { 4140552f7358SJed Brown PetscInt e; 4141552f7358SJed Brown 4142552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4143552f7358SJed Brown if (out->edgemarkerlist[e]) { 4144552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4145552f7358SJed Brown const PetscInt *edges; 4146552f7358SJed Brown PetscInt numEdges; 4147552f7358SJed Brown 4148552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4149552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4150552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4151552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4152552f7358SJed Brown } 4153552f7358SJed Brown } 4154552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4155552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4156552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4157552f7358SJed Brown const PetscInt *faces; 4158552f7358SJed Brown PetscInt numFaces; 4159552f7358SJed Brown 4160552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4161552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4162552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4163552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4164552f7358SJed Brown } 4165552f7358SJed Brown } 4166552f7358SJed Brown } 4167552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 4168552f7358SJed Brown } 4169552f7358SJed Brown 4170552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4171552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4172552f7358SJed Brown PetscFunctionReturn(0); 4173552f7358SJed Brown } 4174552f7358SJed Brown 4175552f7358SJed Brown #undef __FUNCT__ 4176552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 4177552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 4178552f7358SJed Brown { 417982f516ccSBarry Smith MPI_Comm comm; 4180552f7358SJed Brown const PetscInt dim = 3; 4181552f7358SJed Brown PLC *in, *out; 4182552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 4183552f7358SJed Brown PetscMPIInt rank; 4184552f7358SJed Brown PetscErrorCode ierr; 4185552f7358SJed Brown 4186552f7358SJed Brown PetscFunctionBegin; 418782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 41880298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 4189552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 4190552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4191552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 4192552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 4193552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 4194552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 41950d644c17SKarl Rupp 4196552f7358SJed Brown in->numberofpoints = vEnd - vStart; 4197552f7358SJed Brown if (in->numberofpoints > 0) { 4198552f7358SJed Brown PetscSection coordSection; 4199552f7358SJed Brown Vec coordinates; 4200552f7358SJed Brown PetscScalar *array; 4201552f7358SJed Brown 4202785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 4203785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 4204552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 420569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 4206552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 4207552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 4208552f7358SJed Brown const PetscInt idx = v - vStart; 4209552f7358SJed Brown PetscInt off, d, m; 4210552f7358SJed Brown 4211552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 4212552f7358SJed Brown for (d = 0; d < dim; ++d) { 4213552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 4214552f7358SJed Brown } 4215552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 42160d644c17SKarl Rupp 4217552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 4218552f7358SJed Brown } 4219552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 4220552f7358SJed Brown } 4221552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 42220d644c17SKarl Rupp 4223552f7358SJed Brown in->numberofcorners = 4; 4224552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 4225552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 4226552f7358SJed Brown if (in->numberoftetrahedra > 0) { 4227785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 4228552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 4229552f7358SJed Brown const PetscInt idx = c - cStart; 42300298fd71SBarry Smith PetscInt *closure = NULL; 4231552f7358SJed Brown PetscInt closureSize; 4232552f7358SJed Brown 4233552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4234552f7358SJed 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); 4235552f7358SJed Brown for (v = 0; v < 4; ++v) { 4236552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 4237552f7358SJed Brown } 4238552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 4239552f7358SJed Brown } 4240552f7358SJed Brown } 4241552f7358SJed Brown if (!rank) { 4242552f7358SJed Brown TetGenOpts t; 4243552f7358SJed Brown 4244552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 42450d644c17SKarl Rupp 4246552f7358SJed Brown t.in = dm; /* Should go away */ 4247552f7358SJed Brown t.refine = 1; 4248552f7358SJed Brown t.varvolume = 1; 4249552f7358SJed Brown t.quality = 1; 4250552f7358SJed Brown t.edgesout = 1; 4251552f7358SJed Brown t.zeroindex = 1; 4252552f7358SJed Brown t.quiet = 1; 4253552f7358SJed Brown t.verbose = verbose; /* Change this */ 42540d644c17SKarl Rupp 4255552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 4256552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 4257552f7358SJed Brown } 4258552f7358SJed Brown { 4259552f7358SJed Brown const PetscInt numCorners = 4; 4260552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 4261552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 4262552f7358SJed Brown const double *meshCoords = out->pointlist; 42631d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 4264552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 4265552f7358SJed Brown 42669db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 42670fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 4268552f7358SJed Brown /* Set labels */ 4269552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 4270552f7358SJed Brown if (out->pointmarkerlist[v]) { 4271552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 4272552f7358SJed Brown } 4273552f7358SJed Brown } 4274552f7358SJed Brown if (interpolate) { 4275552f7358SJed Brown PetscInt e, f; 4276552f7358SJed Brown 4277552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 4278552f7358SJed Brown if (out->edgemarkerlist[e]) { 4279552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 4280552f7358SJed Brown const PetscInt *edges; 4281552f7358SJed Brown PetscInt numEdges; 4282552f7358SJed Brown 4283552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4284552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 4285552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 4286552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 4287552f7358SJed Brown } 4288552f7358SJed Brown } 4289552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 4290552f7358SJed Brown if (out->trifacemarkerlist[f]) { 4291552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 4292552f7358SJed Brown const PetscInt *faces; 4293552f7358SJed Brown PetscInt numFaces; 4294552f7358SJed Brown 4295552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4296552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 4297552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 4298552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 4299552f7358SJed Brown } 4300552f7358SJed Brown } 4301552f7358SJed Brown } 4302552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 4303552f7358SJed Brown } 4304552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 4305552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 4306552f7358SJed Brown PetscFunctionReturn(0); 4307552f7358SJed Brown } 4308552f7358SJed Brown #endif 4309552f7358SJed Brown 4310552f7358SJed Brown #undef __FUNCT__ 4311552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 4312552f7358SJed Brown /*@C 4313552f7358SJed Brown DMPlexGenerate - Generates a mesh. 4314552f7358SJed Brown 4315552f7358SJed Brown Not Collective 4316552f7358SJed Brown 4317552f7358SJed Brown Input Parameters: 4318552f7358SJed Brown + boundary - The DMPlex boundary object 4319552f7358SJed Brown . name - The mesh generation package name 4320552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 4321552f7358SJed Brown 4322552f7358SJed Brown Output Parameter: 4323552f7358SJed Brown . mesh - The DMPlex object 4324552f7358SJed Brown 4325552f7358SJed Brown Level: intermediate 4326552f7358SJed Brown 4327552f7358SJed Brown .keywords: mesh, elements 4328552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 4329552f7358SJed Brown @*/ 4330552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 4331552f7358SJed Brown { 4332552f7358SJed Brown PetscInt dim; 4333552f7358SJed Brown char genname[1024]; 4334552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4335552f7358SJed Brown PetscErrorCode ierr; 4336552f7358SJed Brown 4337552f7358SJed Brown PetscFunctionBegin; 4338552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 4339552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 4340552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 4341552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 43420d644c17SKarl Rupp if (flg) name = genname; 4343552f7358SJed Brown if (name) { 4344552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4345552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4346552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4347552f7358SJed Brown } 4348552f7358SJed Brown switch (dim) { 4349552f7358SJed Brown case 1: 4350552f7358SJed Brown if (!name || isTriangle) { 4351519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4352552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 4353552f7358SJed Brown #else 435482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 4355552f7358SJed Brown #endif 435682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4357552f7358SJed Brown break; 4358552f7358SJed Brown case 2: 4359552f7358SJed Brown if (!name || isCTetgen) { 4360519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4361552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4362552f7358SJed Brown #else 436382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4364552f7358SJed Brown #endif 4365552f7358SJed Brown } else if (isTetgen) { 4366519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4367552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 4368552f7358SJed Brown #else 436982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4370552f7358SJed Brown #endif 437182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4372552f7358SJed Brown break; 4373552f7358SJed Brown default: 437482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 4375552f7358SJed Brown } 4376552f7358SJed Brown PetscFunctionReturn(0); 4377552f7358SJed Brown } 4378552f7358SJed Brown 4379552f7358SJed Brown #undef __FUNCT__ 4380552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 4381552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 4382552f7358SJed Brown { 4383552f7358SJed Brown PetscReal refinementLimit; 4384552f7358SJed Brown PetscInt dim, cStart, cEnd; 43850298fd71SBarry Smith char genname[1024], *name = NULL; 4386552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 4387552f7358SJed Brown PetscErrorCode ierr; 4388552f7358SJed Brown 4389552f7358SJed Brown PetscFunctionBegin; 4390552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 4391552f7358SJed Brown if (isUniform) { 4392552f7358SJed Brown CellRefiner cellRefiner; 4393552f7358SJed Brown 4394509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 4395509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 4396552f7358SJed Brown PetscFunctionReturn(0); 4397552f7358SJed Brown } 4398552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 4399552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 4400552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 4401552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 4402552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 44030d644c17SKarl Rupp if (flg) name = genname; 4404552f7358SJed Brown if (name) { 4405552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 4406552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 4407552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 4408552f7358SJed Brown } 4409552f7358SJed Brown switch (dim) { 4410552f7358SJed Brown case 2: 4411552f7358SJed Brown if (!name || isTriangle) { 4412519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 4413552f7358SJed Brown double *maxVolumes; 4414552f7358SJed Brown PetscInt c; 4415552f7358SJed Brown 4416785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44170d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4418552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 44196b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 4420552f7358SJed Brown #else 442182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 4422552f7358SJed Brown #endif 442382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 4424552f7358SJed Brown break; 4425552f7358SJed Brown case 3: 4426552f7358SJed Brown if (!name || isCTetgen) { 4427519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 4428552f7358SJed Brown PetscReal *maxVolumes; 4429552f7358SJed Brown PetscInt c; 4430552f7358SJed Brown 4431785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44320d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4433552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4434552f7358SJed Brown #else 443582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 4436552f7358SJed Brown #endif 4437552f7358SJed Brown } else if (isTetgen) { 4438519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 4439552f7358SJed Brown double *maxVolumes; 4440552f7358SJed Brown PetscInt c; 4441552f7358SJed Brown 4442785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 44430d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 4444552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 4445552f7358SJed Brown #else 444682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 4447552f7358SJed Brown #endif 444882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 4449552f7358SJed Brown break; 4450552f7358SJed Brown default: 445182f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 4452552f7358SJed Brown } 4453552f7358SJed Brown PetscFunctionReturn(0); 4454552f7358SJed Brown } 4455552f7358SJed Brown 4456552f7358SJed Brown #undef __FUNCT__ 44570a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 44580a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 44590a6ba040SMatthew G. Knepley { 44600a6ba040SMatthew G. Knepley DM cdm = dm; 44610a6ba040SMatthew G. Knepley PetscInt r; 44620a6ba040SMatthew G. Knepley PetscBool isUniform; 44630a6ba040SMatthew G. Knepley PetscErrorCode ierr; 44640a6ba040SMatthew G. Knepley 44650a6ba040SMatthew G. Knepley PetscFunctionBegin; 44660a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 44670a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 44680a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 44690a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 44700a6ba040SMatthew G. Knepley 44710a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 44720a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 44730a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 44740a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 44750a6ba040SMatthew G. Knepley } 44760a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 44770a6ba040SMatthew G. Knepley } 44780a6ba040SMatthew G. Knepley 44790a6ba040SMatthew G. Knepley #undef __FUNCT__ 44800a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 44810a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 44820a6ba040SMatthew G. Knepley { 44830a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4484*549a8adaSMatthew G. Knepley PetscErrorCode ierr; 44850a6ba040SMatthew G. Knepley 44860a6ba040SMatthew G. Knepley PetscFunctionBegin; 4487*549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 44880a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 44890a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 44900a6ba040SMatthew G. Knepley } 44910a6ba040SMatthew G. Knepley 44920a6ba040SMatthew G. Knepley #undef __FUNCT__ 4493aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 4494552f7358SJed Brown /*@ 4495aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 4496552f7358SJed Brown 4497552f7358SJed Brown Not Collective 4498552f7358SJed Brown 4499aa50250dSMatthew G. Knepley Input Parameter: 4500552f7358SJed Brown . dm - The DMPlex object 4501552f7358SJed Brown 4502aa50250dSMatthew G. Knepley Output Parameter: 4503aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 4504552f7358SJed Brown 4505552f7358SJed Brown Level: developer 4506552f7358SJed Brown 4507aa50250dSMatthew G. Knepley .keywords: mesh, points 4508aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4509aa50250dSMatthew G. Knepley @*/ 4510aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 4511aa50250dSMatthew G. Knepley { 4512aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 4513aa50250dSMatthew G. Knepley PetscErrorCode ierr; 4514aa50250dSMatthew G. Knepley 4515aa50250dSMatthew G. Knepley PetscFunctionBegin; 4516aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4517aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 451863d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 4519aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 4520aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 4521aa50250dSMatthew G. Knepley } 4522aa50250dSMatthew G. Knepley 4523aa50250dSMatthew G. Knepley #undef __FUNCT__ 4524aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 4525aa50250dSMatthew G. Knepley /*@ 4526aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 4527aa50250dSMatthew G. Knepley 4528aa50250dSMatthew G. Knepley Not Collective 4529aa50250dSMatthew G. Knepley 4530aa50250dSMatthew G. Knepley Input Parameter: 4531aa50250dSMatthew G. Knepley . dm - The DMPlex object 4532aa50250dSMatthew G. Knepley 4533aa50250dSMatthew G. Knepley Output Parameter: 4534aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 4535aa50250dSMatthew G. Knepley 4536aa50250dSMatthew G. Knepley Level: developer 4537552f7358SJed Brown 4538552f7358SJed Brown .keywords: mesh, points 4539aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 4540552f7358SJed Brown @*/ 4541552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 4542552f7358SJed Brown { 4543aa50250dSMatthew G. Knepley DMLabel label; 4544aa50250dSMatthew G. Knepley PetscInt d = 0; 4545552f7358SJed Brown PetscErrorCode ierr; 4546552f7358SJed Brown 4547552f7358SJed Brown PetscFunctionBegin; 4548552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4549552f7358SJed Brown PetscValidPointer(depth, 2); 4550aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4551aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 4552552f7358SJed Brown *depth = d-1; 4553552f7358SJed Brown PetscFunctionReturn(0); 4554552f7358SJed Brown } 4555552f7358SJed Brown 4556552f7358SJed Brown #undef __FUNCT__ 4557552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 4558552f7358SJed Brown /*@ 4559552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 4560552f7358SJed Brown 4561552f7358SJed Brown Not Collective 4562552f7358SJed Brown 4563552f7358SJed Brown Input Parameters: 4564552f7358SJed Brown + dm - The DMPlex object 4565552f7358SJed Brown - stratumValue - The requested depth 4566552f7358SJed Brown 4567552f7358SJed Brown Output Parameters: 4568552f7358SJed Brown + start - The first point at this depth 4569552f7358SJed Brown - end - One beyond the last point at this depth 4570552f7358SJed Brown 4571552f7358SJed Brown Level: developer 4572552f7358SJed Brown 4573552f7358SJed Brown .keywords: mesh, points 4574552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 4575552f7358SJed Brown @*/ 45760adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 45770adebc6cSBarry Smith { 4578aa50250dSMatthew G. Knepley DMLabel label; 457963d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 4580552f7358SJed Brown PetscErrorCode ierr; 4581552f7358SJed Brown 4582552f7358SJed Brown PetscFunctionBegin; 4583552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 458463d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 458563d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4586552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 45870d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 458863d1a920SMatthew G. Knepley if (stratumValue < 0) { 458963d1a920SMatthew G. Knepley if (start) *start = pStart; 459063d1a920SMatthew G. Knepley if (end) *end = pEnd; 459163d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4592552f7358SJed Brown } 4593aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 459463d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 459563d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 4596552f7358SJed Brown PetscFunctionReturn(0); 4597552f7358SJed Brown } 4598552f7358SJed Brown 4599552f7358SJed Brown #undef __FUNCT__ 4600552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 4601552f7358SJed Brown /*@ 4602552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 4603552f7358SJed Brown 4604552f7358SJed Brown Not Collective 4605552f7358SJed Brown 4606552f7358SJed Brown Input Parameters: 4607552f7358SJed Brown + dm - The DMPlex object 4608552f7358SJed Brown - stratumValue - The requested height 4609552f7358SJed Brown 4610552f7358SJed Brown Output Parameters: 4611552f7358SJed Brown + start - The first point at this height 4612552f7358SJed Brown - end - One beyond the last point at this height 4613552f7358SJed Brown 4614552f7358SJed Brown Level: developer 4615552f7358SJed Brown 4616552f7358SJed Brown .keywords: mesh, points 4617552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 4618552f7358SJed Brown @*/ 46190adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 46200adebc6cSBarry Smith { 4621aa50250dSMatthew G. Knepley DMLabel label; 462263d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 4623552f7358SJed Brown PetscErrorCode ierr; 4624552f7358SJed Brown 4625552f7358SJed Brown PetscFunctionBegin; 4626552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 462763d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 462863d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 4629552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 46300d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 463163d1a920SMatthew G. Knepley if (stratumValue < 0) { 463263d1a920SMatthew G. Knepley if (start) *start = pStart; 463363d1a920SMatthew G. Knepley if (end) *end = pEnd; 463463d1a920SMatthew G. Knepley PetscFunctionReturn(0); 4635552f7358SJed Brown } 4636aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 4637aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 463863d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 463963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 4640552f7358SJed Brown PetscFunctionReturn(0); 4641552f7358SJed Brown } 4642552f7358SJed Brown 4643552f7358SJed Brown #undef __FUNCT__ 4644552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 4645552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 4646a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 4647a6dfd86eSKarl Rupp { 4648552f7358SJed Brown PetscInt *numDofTot; 4649916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 4650916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 4651552f7358SJed Brown PetscErrorCode ierr; 4652552f7358SJed Brown 4653552f7358SJed Brown PetscFunctionBegin; 4654785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 4655552f7358SJed Brown for (d = 0; d <= dim; ++d) { 4656552f7358SJed Brown numDofTot[d] = 0; 46570d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 4658552f7358SJed Brown } 465982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 4660552f7358SJed Brown if (numFields > 0) { 4661552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 4662552f7358SJed Brown if (numComp) { 4663552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4664552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 4665552f7358SJed Brown } 4666552f7358SJed Brown } 4667552f7358SJed Brown } 4668552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 4669552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 4670916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4671916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 4672916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 4673916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 4674552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4675552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4676552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 4677552f7358SJed Brown } 4678552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 4679552f7358SJed Brown } 4680552f7358SJed Brown } 4681552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 4682552f7358SJed Brown PetscFunctionReturn(0); 4683552f7358SJed Brown } 4684552f7358SJed Brown 4685552f7358SJed Brown #undef __FUNCT__ 4686552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 4687552f7358SJed Brown /* Set the number of dof on each point and separate by fields 4688552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 4689552f7358SJed Brown */ 4690a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 4691a6dfd86eSKarl Rupp { 4692552f7358SJed Brown PetscInt numFields; 4693552f7358SJed Brown PetscInt bc; 4694552f7358SJed Brown PetscErrorCode ierr; 4695552f7358SJed Brown 4696552f7358SJed Brown PetscFunctionBegin; 4697552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4698552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 4699552f7358SJed Brown PetscInt field = 0; 4700552f7358SJed Brown const PetscInt *idx; 4701552f7358SJed Brown PetscInt n, i; 4702552f7358SJed Brown 47030d644c17SKarl Rupp if (numFields) field = bcField[bc]; 4704552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 4705552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4706552f7358SJed Brown for (i = 0; i < n; ++i) { 4707552f7358SJed Brown const PetscInt p = idx[i]; 4708552f7358SJed Brown PetscInt numConst = constDof; 4709552f7358SJed Brown 4710552f7358SJed Brown /* Constrain every dof on the point */ 4711552f7358SJed Brown if (numConst < 0) { 4712552f7358SJed Brown if (numFields) { 4713552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 4714552f7358SJed Brown } else { 4715552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 4716552f7358SJed Brown } 4717552f7358SJed Brown } 4718552f7358SJed Brown if (numFields) { 4719552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 4720552f7358SJed Brown } 4721552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 4722552f7358SJed Brown } 4723552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 4724552f7358SJed Brown } 4725552f7358SJed Brown PetscFunctionReturn(0); 4726552f7358SJed Brown } 4727552f7358SJed Brown 4728552f7358SJed Brown #undef __FUNCT__ 4729552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 4730552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 47310adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 47320adebc6cSBarry Smith { 4733552f7358SJed Brown PetscInt *maxConstraints; 4734552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 4735552f7358SJed Brown PetscErrorCode ierr; 4736552f7358SJed Brown 4737552f7358SJed Brown PetscFunctionBegin; 4738552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4739552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4740785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 47410d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 4742552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4743552f7358SJed Brown PetscInt cdof; 4744552f7358SJed Brown 4745552f7358SJed Brown if (numFields) { 4746552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4747552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 4748552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 4749552f7358SJed Brown } 4750552f7358SJed Brown } else { 4751552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4752552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 4753552f7358SJed Brown } 4754552f7358SJed Brown } 4755552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4756552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 4757552f7358SJed Brown } 4758552f7358SJed Brown if (maxConstraints[numFields]) { 4759552f7358SJed Brown PetscInt *indices; 4760552f7358SJed Brown 4761785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 4762552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4763552f7358SJed Brown PetscInt cdof, d; 4764552f7358SJed Brown 4765552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4766552f7358SJed Brown if (cdof) { 4767552f7358SJed 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]); 4768552f7358SJed Brown if (numFields) { 4769552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4770552f7358SJed Brown 4771552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4772552f7358SJed Brown PetscInt cfdof, fdof; 4773552f7358SJed Brown 4774552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4775552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 4776552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 47770d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 4778552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 47790d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4780552f7358SJed Brown numConst += cfdof; 4781552f7358SJed Brown foff += fdof; 4782552f7358SJed Brown } 4783552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4784552f7358SJed Brown } else { 47850d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4786552f7358SJed Brown } 4787552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4788552f7358SJed Brown } 4789552f7358SJed Brown } 4790552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4791552f7358SJed Brown } 4792552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4793552f7358SJed Brown PetscFunctionReturn(0); 4794552f7358SJed Brown } 4795552f7358SJed Brown 4796552f7358SJed Brown #undef __FUNCT__ 4797552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4798552f7358SJed Brown /* Set the constrained field indices on each point */ 47990adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 48000adebc6cSBarry Smith { 4801552f7358SJed Brown const PetscInt *points, *indices; 4802552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4803552f7358SJed Brown PetscErrorCode ierr; 4804552f7358SJed Brown 4805552f7358SJed Brown PetscFunctionBegin; 4806552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4807552f7358SJed 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); 4808552f7358SJed Brown 4809552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4810552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4811552f7358SJed Brown if (!constraintIndices) { 4812552f7358SJed Brown PetscInt *idx, i; 4813552f7358SJed Brown 4814552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4815785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 48160d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4817552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4818552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4819552f7358SJed Brown } 4820552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4821552f7358SJed Brown } else { 4822552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4823552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4824552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4825552f7358SJed Brown PetscInt fcdof; 4826552f7358SJed Brown 4827552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 482882f516ccSBarry 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); 4829552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4830552f7358SJed Brown } 4831552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4832552f7358SJed Brown } 4833552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4834552f7358SJed Brown PetscFunctionReturn(0); 4835552f7358SJed Brown } 4836552f7358SJed Brown 4837552f7358SJed Brown #undef __FUNCT__ 4838552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4839552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 48400adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 48410adebc6cSBarry Smith { 4842552f7358SJed Brown PetscInt *indices; 4843552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4844552f7358SJed Brown PetscErrorCode ierr; 4845552f7358SJed Brown 4846552f7358SJed Brown PetscFunctionBegin; 4847552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4848785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4849552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 485082f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4851552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4852552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4853552f7358SJed Brown PetscInt cdof, d; 4854552f7358SJed Brown 4855552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4856552f7358SJed Brown if (cdof) { 4857552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4858552f7358SJed Brown 4859552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4860552f7358SJed Brown const PetscInt *fcind; 4861552f7358SJed Brown PetscInt fdof, fcdof; 4862552f7358SJed Brown 4863552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4864552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4865552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4866552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 48670d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4868552f7358SJed Brown foff += fdof; 4869552f7358SJed Brown numConst += fcdof; 4870552f7358SJed Brown } 487182f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4872552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4873552f7358SJed Brown } 4874552f7358SJed Brown } 4875552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4876552f7358SJed Brown PetscFunctionReturn(0); 4877552f7358SJed Brown } 4878552f7358SJed Brown 4879552f7358SJed Brown #undef __FUNCT__ 4880552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4881552f7358SJed Brown /*@C 4882552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4883552f7358SJed Brown 4884552f7358SJed Brown Not Collective 4885552f7358SJed Brown 4886552f7358SJed Brown Input Parameters: 4887552f7358SJed Brown + dm - The DMPlex object 4888552f7358SJed Brown . dim - The spatial dimension of the problem 4889552f7358SJed Brown . numFields - The number of fields in the problem 4890552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4891552f7358SJed 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 4892552f7358SJed Brown . numBC - The number of boundary conditions 4893552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4894552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4895552f7358SJed Brown 4896552f7358SJed Brown Output Parameter: 4897552f7358SJed Brown . section - The PetscSection object 4898552f7358SJed Brown 4899552f7358SJed 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 4900552f7358SJed Brown nubmer of dof for field 0 on each edge. 4901552f7358SJed Brown 4902552f7358SJed Brown Level: developer 4903552f7358SJed Brown 49043813dfbdSMatthew G Knepley Fortran Notes: 49053813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 49063813dfbdSMatthew G Knepley 4907552f7358SJed Brown .keywords: mesh, elements 4908552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4909552f7358SJed Brown @*/ 4910a6dfd86eSKarl 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) 4911a6dfd86eSKarl Rupp { 4912552f7358SJed Brown PetscErrorCode ierr; 4913552f7358SJed Brown 4914552f7358SJed Brown PetscFunctionBegin; 4915552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4916552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4917552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4918552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4919ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4920552f7358SJed Brown PetscFunctionReturn(0); 4921552f7358SJed Brown } 4922552f7358SJed Brown 4923552f7358SJed Brown #undef __FUNCT__ 4924552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 49250adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 49260adebc6cSBarry Smith { 4927552f7358SJed Brown PetscSection section; 4928552f7358SJed Brown PetscErrorCode ierr; 4929552f7358SJed Brown 4930552f7358SJed Brown PetscFunctionBegin; 493138221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 493282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4933552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 49341d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4935552f7358SJed Brown PetscFunctionReturn(0); 4936552f7358SJed Brown } 4937552f7358SJed Brown 4938552f7358SJed Brown #undef __FUNCT__ 4939552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 49400adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 49410adebc6cSBarry Smith { 4942552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4943552f7358SJed Brown 4944552f7358SJed Brown PetscFunctionBegin; 4945552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4946552f7358SJed Brown if (section) *section = mesh->coneSection; 4947552f7358SJed Brown PetscFunctionReturn(0); 4948552f7358SJed Brown } 4949552f7358SJed Brown 4950552f7358SJed Brown #undef __FUNCT__ 49518cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 49528cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 49538cb4d582SMatthew G. Knepley { 49548cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 49558cb4d582SMatthew G. Knepley 49568cb4d582SMatthew G. Knepley PetscFunctionBegin; 49578cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 49588cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 49598cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 49608cb4d582SMatthew G. Knepley } 49618cb4d582SMatthew G. Knepley 49628cb4d582SMatthew G. Knepley #undef __FUNCT__ 4963552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4964a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4965a6dfd86eSKarl Rupp { 4966552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4967552f7358SJed Brown 4968552f7358SJed Brown PetscFunctionBegin; 4969552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4970552f7358SJed Brown if (cones) *cones = mesh->cones; 4971552f7358SJed Brown PetscFunctionReturn(0); 4972552f7358SJed Brown } 4973552f7358SJed Brown 4974552f7358SJed Brown #undef __FUNCT__ 4975552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4976a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4977a6dfd86eSKarl Rupp { 4978552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4979552f7358SJed Brown 4980552f7358SJed Brown PetscFunctionBegin; 4981552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4982552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4983552f7358SJed Brown PetscFunctionReturn(0); 4984552f7358SJed Brown } 4985552f7358SJed Brown 4986552f7358SJed Brown /******************************** FEM Support **********************************/ 4987552f7358SJed Brown 4988552f7358SJed Brown #undef __FUNCT__ 49891a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 49901a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4991a6dfd86eSKarl Rupp { 4992552f7358SJed Brown PetscScalar *array, *vArray; 4993d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 49941a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4995552f7358SJed Brown PetscErrorCode ierr; 4996552f7358SJed Brown 49971b406b76SMatthew G. Knepley PetscFunctionBeginHot; 49982a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 49995a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 50005a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 50015a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 50023f7cbbe7SMatthew G. Knepley if (!values || !*values) { 50039df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50049df71ca4SMatthew G. Knepley PetscInt dof; 5005d9917b9dSMatthew G. Knepley 50069df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50079df71ca4SMatthew G. Knepley size += dof; 50089df71ca4SMatthew G. Knepley } 50099df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50109df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50112a3aaacfSMatthew G. Knepley PetscInt dof; 50125a1bb5cfSMatthew G. Knepley 50135a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50142a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50155a1bb5cfSMatthew G. Knepley size += dof; 50165a1bb5cfSMatthew G. Knepley } 50173f7cbbe7SMatthew G. Knepley if (!values) { 50183f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 50193f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 50203f7cbbe7SMatthew G. Knepley } 50215a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 5022982e9ed1SMatthew G. Knepley } else { 5023982e9ed1SMatthew G. Knepley array = *values; 5024982e9ed1SMatthew G. Knepley } 50259df71ca4SMatthew G. Knepley size = 0; 50265a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 50279df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 50289df71ca4SMatthew G. Knepley PetscInt dof, off, d; 50299df71ca4SMatthew G. Knepley PetscScalar *varr; 5030d9917b9dSMatthew G. Knepley 50319df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50329df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50339df71ca4SMatthew G. Knepley varr = &vArray[off]; 50341a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 50351a271a75SMatthew G. Knepley array[offset] = varr[d]; 50369df71ca4SMatthew G. Knepley } 50379df71ca4SMatthew G. Knepley size += dof; 50389df71ca4SMatthew G. Knepley } 50399df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 50409df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 50419df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 50425a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 50435a1bb5cfSMatthew G. Knepley PetscScalar *varr; 50445a1bb5cfSMatthew G. Knepley 504552ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 50465a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 50475a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 50485a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 50495a1bb5cfSMatthew G. Knepley if (o >= 0) { 50501a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 50511a271a75SMatthew G. Knepley array[offset] = varr[d]; 50525a1bb5cfSMatthew G. Knepley } 50535a1bb5cfSMatthew G. Knepley } else { 50541a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 50551a271a75SMatthew G. Knepley array[offset] = varr[d]; 50565a1bb5cfSMatthew G. Knepley } 50575a1bb5cfSMatthew G. Knepley } 50589df71ca4SMatthew G. Knepley size += dof; 50595a1bb5cfSMatthew G. Knepley } 50605a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 50619df71ca4SMatthew G. Knepley if (!*values) { 50625a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 50635a1bb5cfSMatthew G. Knepley *values = array; 50649df71ca4SMatthew G. Knepley } else { 50659df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 50668c312ff3SMatthew G. Knepley *csize = size; 50679df71ca4SMatthew G. Knepley } 50685a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 50695a1bb5cfSMatthew G. Knepley } 5070d9917b9dSMatthew G. Knepley 5071d9917b9dSMatthew G. Knepley #undef __FUNCT__ 50721a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 50731a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 50741a271a75SMatthew G. Knepley { 50751a271a75SMatthew G. Knepley PetscInt offset = 0, p; 50761a271a75SMatthew G. Knepley PetscErrorCode ierr; 50771a271a75SMatthew G. Knepley 50781a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5079fe02ba77SJed Brown *size = 0; 50801a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 50811a271a75SMatthew G. Knepley const PetscInt point = points[p]; 50821a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 50831a271a75SMatthew G. Knepley PetscInt dof, off, d; 50841a271a75SMatthew G. Knepley const PetscScalar *varr; 50851a271a75SMatthew G. Knepley 50861a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 50871a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 50881a271a75SMatthew G. Knepley varr = &vArray[off]; 50891a271a75SMatthew G. Knepley if (o >= 0) { 50901a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 50911a271a75SMatthew G. Knepley } else { 50921a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 50931a271a75SMatthew G. Knepley } 50941a271a75SMatthew G. Knepley } 50951a271a75SMatthew G. Knepley *size = offset; 50961a271a75SMatthew G. Knepley PetscFunctionReturn(0); 50971a271a75SMatthew G. Knepley } 50981a271a75SMatthew G. Knepley 50991a271a75SMatthew G. Knepley #undef __FUNCT__ 51001a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 51011a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Fields_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], PetscInt numFields, const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 51021a271a75SMatthew G. Knepley { 51031a271a75SMatthew G. Knepley PetscInt offset = 0, f; 51041a271a75SMatthew G. Knepley PetscErrorCode ierr; 51051a271a75SMatthew G. Knepley 51061a271a75SMatthew G. Knepley PetscFunctionBeginHot; 5107fe02ba77SJed Brown *size = 0; 51081a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 51091a271a75SMatthew G. Knepley PetscInt fcomp, p; 51101a271a75SMatthew G. Knepley 51111a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 51121a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 51131a271a75SMatthew G. Knepley const PetscInt point = points[p]; 51141a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 51151a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 51161a271a75SMatthew G. Knepley const PetscScalar *varr; 51171a271a75SMatthew G. Knepley 51181a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 51191a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 51201a271a75SMatthew G. Knepley varr = &vArray[foff]; 51211a271a75SMatthew G. Knepley if (o >= 0) { 51221a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 51231a271a75SMatthew G. Knepley } else { 51241a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 51251a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 51261a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 51271a271a75SMatthew G. Knepley } 51281a271a75SMatthew G. Knepley } 51291a271a75SMatthew G. Knepley } 51301a271a75SMatthew G. Knepley } 51311a271a75SMatthew G. Knepley } 51321a271a75SMatthew G. Knepley *size = offset; 51331a271a75SMatthew G. Knepley PetscFunctionReturn(0); 51341a271a75SMatthew G. Knepley } 51351a271a75SMatthew G. Knepley 51361a271a75SMatthew G. Knepley #undef __FUNCT__ 5137552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 5138552f7358SJed Brown /*@C 5139552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 5140552f7358SJed Brown 5141552f7358SJed Brown Not collective 5142552f7358SJed Brown 5143552f7358SJed Brown Input Parameters: 5144552f7358SJed Brown + dm - The DM 5145552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5146552f7358SJed Brown . v - The local vector 5147552f7358SJed Brown - point - The sieve point in the DM 5148552f7358SJed Brown 5149552f7358SJed Brown Output Parameters: 5150552f7358SJed Brown + csize - The number of values in the closure, or NULL 5151552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5152552f7358SJed Brown 5153552f7358SJed Brown Fortran Notes: 5154552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 5155552f7358SJed Brown include petsc.h90 in your code. 5156552f7358SJed Brown 5157552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 5158552f7358SJed Brown 5159552f7358SJed Brown Level: intermediate 5160552f7358SJed Brown 5161552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5162552f7358SJed Brown @*/ 5163552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5164552f7358SJed Brown { 5165552f7358SJed Brown PetscSection clSection; 5166d9917b9dSMatthew G. Knepley IS clPoints; 5167552f7358SJed Brown PetscScalar *array, *vArray; 5168552f7358SJed Brown PetscInt *points = NULL; 5169d9917b9dSMatthew G. Knepley const PetscInt *clp; 51701a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 5171552f7358SJed Brown PetscErrorCode ierr; 5172552f7358SJed Brown 5173d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 5174552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5175552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 51761a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 51771a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 5178552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5179552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 5180552f7358SJed Brown if (depth == 1 && numFields < 2) { 51811a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 5182552f7358SJed Brown PetscFunctionReturn(0); 5183552f7358SJed Brown } 51841a271a75SMatthew G. Knepley /* Get points */ 5185d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 5186d9917b9dSMatthew G. Knepley if (!clPoints) { 51871a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 5188552f7358SJed Brown 51891a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5190552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5191552f7358SJed Brown /* Compress out points not in the section */ 5192552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5193552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5194552f7358SJed Brown points[q*2] = points[p]; 5195552f7358SJed Brown points[q*2+1] = points[p+1]; 5196552f7358SJed Brown ++q; 5197552f7358SJed Brown } 5198552f7358SJed Brown } 5199552f7358SJed Brown numPoints = q; 5200d9917b9dSMatthew G. Knepley } else { 5201d9917b9dSMatthew G. Knepley PetscInt dof, off; 5202552f7358SJed Brown 5203d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 5204d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 5205d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 52061a271a75SMatthew G. Knepley numPoints = dof/2; 5207d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 5208552f7358SJed Brown } 52091a271a75SMatthew G. Knepley /* Get array */ 5210552f7358SJed Brown if (!values || !*values) { 52111a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 5212552f7358SJed Brown 52131a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 5214552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 52151a271a75SMatthew G. Knepley asize += dof; 5216552f7358SJed Brown } 5217bd6c0d32SMatthew G. Knepley if (!values) { 5218d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 52191a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 52201a271a75SMatthew G. Knepley if (csize) *csize = asize; 5221bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 5222bd6c0d32SMatthew G. Knepley } 52231a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 5224d0f6b257SMatthew G. Knepley } else { 5225d0f6b257SMatthew G. Knepley array = *values; 5226d0f6b257SMatthew G. Knepley } 5227552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 52281a271a75SMatthew G. Knepley /* Get values */ 5229ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 52301a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 52311a271a75SMatthew G. Knepley /* Cleanup points */ 52321a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 52331a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 52341a271a75SMatthew G. Knepley /* Cleanup array */ 5235552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 5236d0f6b257SMatthew G. Knepley if (!*values) { 5237552f7358SJed Brown if (csize) *csize = size; 5238552f7358SJed Brown *values = array; 5239d0f6b257SMatthew G. Knepley } else { 5240d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 5241d0f6b257SMatthew G. Knepley *csize = size; 5242d0f6b257SMatthew G. Knepley } 5243552f7358SJed Brown PetscFunctionReturn(0); 5244552f7358SJed Brown } 5245552f7358SJed Brown 5246552f7358SJed Brown #undef __FUNCT__ 5247552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 5248552f7358SJed Brown /*@C 5249552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 5250552f7358SJed Brown 5251552f7358SJed Brown Not collective 5252552f7358SJed Brown 5253552f7358SJed Brown Input Parameters: 5254552f7358SJed Brown + dm - The DM 52550298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 5256552f7358SJed Brown . v - The local vector 5257552f7358SJed Brown . point - The sieve point in the DM 52580298fd71SBarry Smith . csize - The number of values in the closure, or NULL 5259552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 5260552f7358SJed Brown 52613813dfbdSMatthew G Knepley Fortran Notes: 52623813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 52633813dfbdSMatthew G Knepley include petsc.h90 in your code. 52643813dfbdSMatthew G Knepley 52653813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 52663813dfbdSMatthew G Knepley 5267552f7358SJed Brown Level: intermediate 5268552f7358SJed Brown 5269552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 5270552f7358SJed Brown @*/ 52717c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 5272a6dfd86eSKarl Rupp { 5273552f7358SJed Brown PetscInt size = 0; 5274552f7358SJed Brown PetscErrorCode ierr; 5275552f7358SJed Brown 5276552f7358SJed Brown PetscFunctionBegin; 5277552f7358SJed Brown /* Should work without recalculating size */ 5278552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 5279552f7358SJed Brown PetscFunctionReturn(0); 5280552f7358SJed Brown } 5281552f7358SJed Brown 5282552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 5283552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 5284552f7358SJed Brown 5285552f7358SJed Brown #undef __FUNCT__ 5286552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 52871a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 5288552f7358SJed Brown { 5289552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 5290552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5291552f7358SJed Brown PetscScalar *a; 5292552f7358SJed Brown PetscInt off, cind = 0, k; 5293552f7358SJed Brown PetscErrorCode ierr; 5294552f7358SJed Brown 5295552f7358SJed Brown PetscFunctionBegin; 5296552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5297552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5298552f7358SJed Brown a = &array[off]; 5299552f7358SJed Brown if (!cdof || setBC) { 5300552f7358SJed Brown if (orientation >= 0) { 5301552f7358SJed Brown for (k = 0; k < dof; ++k) { 5302552f7358SJed Brown fuse(&a[k], values[k]); 5303552f7358SJed Brown } 5304552f7358SJed Brown } else { 5305552f7358SJed Brown for (k = 0; k < dof; ++k) { 5306552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5307552f7358SJed Brown } 5308552f7358SJed Brown } 5309552f7358SJed Brown } else { 5310552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5311552f7358SJed Brown if (orientation >= 0) { 5312552f7358SJed Brown for (k = 0; k < dof; ++k) { 5313552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5314552f7358SJed Brown fuse(&a[k], values[k]); 5315552f7358SJed Brown } 5316552f7358SJed Brown } else { 5317552f7358SJed Brown for (k = 0; k < dof; ++k) { 5318552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5319552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 5320552f7358SJed Brown } 5321552f7358SJed Brown } 5322552f7358SJed Brown } 5323552f7358SJed Brown PetscFunctionReturn(0); 5324552f7358SJed Brown } 5325552f7358SJed Brown 5326552f7358SJed Brown #undef __FUNCT__ 5327a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 53281a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[]) 5329a5e93ea8SMatthew G. Knepley { 5330a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 5331a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5332a5e93ea8SMatthew G. Knepley PetscScalar *a; 5333a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 5334a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5335a5e93ea8SMatthew G. Knepley 5336a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5337a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 5338a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 5339a5e93ea8SMatthew G. Knepley a = &array[off]; 5340a5e93ea8SMatthew G. Knepley if (cdof) { 5341a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 5342a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 5343a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5344a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5345a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 5346a5e93ea8SMatthew G. Knepley ++cind; 5347a5e93ea8SMatthew G. Knepley } 5348a5e93ea8SMatthew G. Knepley } 5349a5e93ea8SMatthew G. Knepley } else { 5350a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5351a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 5352a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 5353a5e93ea8SMatthew G. Knepley ++cind; 5354a5e93ea8SMatthew G. Knepley } 5355a5e93ea8SMatthew G. Knepley } 5356a5e93ea8SMatthew G. Knepley } 5357a5e93ea8SMatthew G. Knepley } 5358a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5359a5e93ea8SMatthew G. Knepley } 5360a5e93ea8SMatthew G. Knepley 5361a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 5362552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 53631a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, const PetscScalar values[], PetscInt *offset, PetscScalar array[]) 5364a6dfd86eSKarl Rupp { 5365552f7358SJed Brown PetscScalar *a; 53661a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 53671a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 53681a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5369552f7358SJed Brown PetscErrorCode ierr; 5370552f7358SJed Brown 5371552f7358SJed Brown PetscFunctionBegin; 5372552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5373552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 53741a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 53751a271a75SMatthew G. Knepley a = &array[foff]; 5376552f7358SJed Brown if (!fcdof || setBC) { 53771a271a75SMatthew G. Knepley if (o >= 0) { 53781a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 5379552f7358SJed Brown } else { 5380552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5381552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 53821a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5383552f7358SJed Brown } 5384552f7358SJed Brown } 5385552f7358SJed Brown } 5386552f7358SJed Brown } else { 5387552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 53881a271a75SMatthew G. Knepley if (o >= 0) { 5389552f7358SJed Brown for (k = 0; k < fdof; ++k) { 5390552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 53911a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5392552f7358SJed Brown } 5393552f7358SJed Brown } else { 5394552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 5395552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 5396552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 53971a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5398552f7358SJed Brown } 5399552f7358SJed Brown } 5400552f7358SJed Brown } 5401552f7358SJed Brown } 54021a271a75SMatthew G. Knepley *offset += fdof; 5403552f7358SJed Brown PetscFunctionReturn(0); 5404552f7358SJed Brown } 5405552f7358SJed Brown 5406552f7358SJed Brown #undef __FUNCT__ 5407a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 54081a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), const PetscScalar values[], PetscInt *offset, PetscScalar array[]) 5409a5e93ea8SMatthew G. Knepley { 5410a5e93ea8SMatthew G. Knepley PetscScalar *a; 54111a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 54121a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 54131a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 5414a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 5415a5e93ea8SMatthew G. Knepley 5416a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 5417a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 5418a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 54191a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 54201a271a75SMatthew G. Knepley a = &array[foff]; 5421a5e93ea8SMatthew G. Knepley if (fcdof) { 5422a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 54231a271a75SMatthew G. Knepley if (o >= 0) { 5424a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 5425a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 54261a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 5427a5e93ea8SMatthew G. Knepley ++cind; 5428a5e93ea8SMatthew G. Knepley } 5429a5e93ea8SMatthew G. Knepley } 5430a5e93ea8SMatthew G. Knepley } else { 5431a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 5432a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 5433a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 54341a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 5435a5e93ea8SMatthew G. Knepley ++cind; 5436a5e93ea8SMatthew G. Knepley } 5437a5e93ea8SMatthew G. Knepley } 5438a5e93ea8SMatthew G. Knepley } 5439a5e93ea8SMatthew G. Knepley } 5440a5e93ea8SMatthew G. Knepley } 54411a271a75SMatthew G. Knepley *offset += fdof; 5442a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 5443a5e93ea8SMatthew G. Knepley } 5444a5e93ea8SMatthew G. Knepley 5445a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 54461b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 54471a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 5448a6dfd86eSKarl Rupp { 5449552f7358SJed Brown PetscScalar *array; 54501b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 54511b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 5452552f7358SJed Brown PetscErrorCode ierr; 5453552f7358SJed Brown 54541b406b76SMatthew G. Knepley PetscFunctionBeginHot; 5455b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5456b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 5457b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 5458b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 5459b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 5460b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 5461b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 5462b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 5463b6ebb6e6SMatthew G. Knepley 5464b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 5465b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 5466b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 5467b6ebb6e6SMatthew G. Knepley { 5468b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 5469b6ebb6e6SMatthew G. Knepley PetscScalar *a; 5470b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 5471b6ebb6e6SMatthew G. Knepley 5472b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 5473b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 5474b6ebb6e6SMatthew G. Knepley a = &array[coff]; 5475b6ebb6e6SMatthew G. Knepley if (!cdof) { 5476b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5477b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5478b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5479b6ebb6e6SMatthew G. Knepley } 5480b6ebb6e6SMatthew G. Knepley } else { 5481b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5482b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5483b6ebb6e6SMatthew G. Knepley } 5484b6ebb6e6SMatthew G. Knepley } 5485b6ebb6e6SMatthew G. Knepley } else { 5486b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 5487b6ebb6e6SMatthew G. Knepley if (o >= 0) { 5488b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5489b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5490b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 5491b6ebb6e6SMatthew G. Knepley } 5492b6ebb6e6SMatthew G. Knepley } else { 5493b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 5494b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 5495b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 5496b6ebb6e6SMatthew G. Knepley } 5497b6ebb6e6SMatthew G. Knepley } 5498b6ebb6e6SMatthew G. Knepley } 5499b6ebb6e6SMatthew G. Knepley } 5500b6ebb6e6SMatthew G. Knepley } 5501b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5502b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 5503b6ebb6e6SMatthew G. Knepley } 55041b406b76SMatthew G. Knepley 55051b406b76SMatthew G. Knepley #undef __FUNCT__ 55061b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 55071b406b76SMatthew G. Knepley /*@C 55081b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 55091b406b76SMatthew G. Knepley 55101b406b76SMatthew G. Knepley Not collective 55111b406b76SMatthew G. Knepley 55121b406b76SMatthew G. Knepley Input Parameters: 55131b406b76SMatthew G. Knepley + dm - The DM 55141b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 55151b406b76SMatthew G. Knepley . v - The local vector 55161b406b76SMatthew G. Knepley . point - The sieve point in the DM 55171b406b76SMatthew G. Knepley . values - The array of values 55181b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 55191b406b76SMatthew G. Knepley 55201b406b76SMatthew G. Knepley Fortran Notes: 55211b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 55221b406b76SMatthew G. Knepley 55231b406b76SMatthew G. Knepley Level: intermediate 55241b406b76SMatthew G. Knepley 55251b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 55261b406b76SMatthew G. Knepley @*/ 55271b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 55281b406b76SMatthew G. Knepley { 55291b406b76SMatthew G. Knepley PetscSection clSection; 55301b406b76SMatthew G. Knepley IS clPoints; 55311b406b76SMatthew G. Knepley PetscScalar *array; 55321b406b76SMatthew G. Knepley PetscInt *points = NULL; 55331b406b76SMatthew G. Knepley const PetscInt *clp; 55341a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 55351b406b76SMatthew G. Knepley PetscErrorCode ierr; 55361b406b76SMatthew G. Knepley 55371a271a75SMatthew G. Knepley PetscFunctionBeginHot; 55381b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 55391b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 55401a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 55411a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 55421b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 55431b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 55441b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 55451a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 55461b406b76SMatthew G. Knepley PetscFunctionReturn(0); 55471b406b76SMatthew G. Knepley } 55481a271a75SMatthew G. Knepley /* Get points */ 55491b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 55501b406b76SMatthew G. Knepley if (!clPoints) { 55511a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 55521a271a75SMatthew G. Knepley 55531a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5554552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5555552f7358SJed Brown /* Compress out points not in the section */ 5556552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5557552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5558552f7358SJed Brown points[q*2] = points[p]; 5559552f7358SJed Brown points[q*2+1] = points[p+1]; 5560552f7358SJed Brown ++q; 5561552f7358SJed Brown } 5562552f7358SJed Brown } 5563552f7358SJed Brown numPoints = q; 55641b406b76SMatthew G. Knepley } else { 55651b406b76SMatthew G. Knepley PetscInt dof, off; 5566552f7358SJed Brown 55671b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 55681b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 55691b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 55701a271a75SMatthew G. Knepley numPoints = dof/2; 55711b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 5572552f7358SJed Brown } 55731a271a75SMatthew G. Knepley /* Get array */ 5574552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 55751a271a75SMatthew G. Knepley /* Get values */ 5576ef90cfe2SMatthew G. Knepley if (numFields > 0) { 55771a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 5578552f7358SJed Brown for (f = 0; f < numFields; ++f) { 55791a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 5580552f7358SJed Brown switch (mode) { 5581552f7358SJed Brown case INSERT_VALUES: 5582552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55831a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55841a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55851a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 5586552f7358SJed Brown } break; 5587552f7358SJed Brown case INSERT_ALL_VALUES: 5588552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 55891a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55901a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55911a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 5592552f7358SJed Brown } break; 5593a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5594a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 55951a271a75SMatthew G. Knepley const PetscInt point = points[p]; 55961a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 55971a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 5598a5e93ea8SMatthew G. Knepley } break; 5599552f7358SJed Brown case ADD_VALUES: 5600552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 56011a271a75SMatthew G. Knepley const PetscInt point = points[p]; 56021a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 56031a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 5604552f7358SJed Brown } break; 5605552f7358SJed Brown case ADD_ALL_VALUES: 5606552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 56071a271a75SMatthew G. Knepley const PetscInt point = points[p]; 56081a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 56091a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 5610552f7358SJed Brown } break; 5611552f7358SJed Brown default: 561282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5613552f7358SJed Brown } 56141a271a75SMatthew G. Knepley } 5615552f7358SJed Brown } else { 56161a271a75SMatthew G. Knepley PetscInt dof, off; 56171a271a75SMatthew G. Knepley 5618552f7358SJed Brown switch (mode) { 5619552f7358SJed Brown case INSERT_VALUES: 5620552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5621552f7358SJed Brown PetscInt o = points[p+1]; 5622552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5623552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 5624552f7358SJed Brown } break; 5625552f7358SJed Brown case INSERT_ALL_VALUES: 5626552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5627552f7358SJed Brown PetscInt o = points[p+1]; 5628552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5629552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 5630552f7358SJed Brown } break; 5631a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 5632a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5633a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 5634a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5635a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 5636a5e93ea8SMatthew G. Knepley } break; 5637552f7358SJed Brown case ADD_VALUES: 5638552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5639552f7358SJed Brown PetscInt o = points[p+1]; 5640552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5641552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 5642552f7358SJed Brown } break; 5643552f7358SJed Brown case ADD_ALL_VALUES: 5644552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 5645552f7358SJed Brown PetscInt o = points[p+1]; 5646552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5647552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 5648552f7358SJed Brown } break; 5649552f7358SJed Brown default: 565082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 5651552f7358SJed Brown } 5652552f7358SJed Brown } 56531a271a75SMatthew G. Knepley /* Cleanup points */ 56541a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 56551a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 56561a271a75SMatthew G. Knepley /* Cleanup array */ 5657552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 5658552f7358SJed Brown PetscFunctionReturn(0); 5659552f7358SJed Brown } 5660552f7358SJed Brown 5661552f7358SJed Brown #undef __FUNCT__ 5662552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 5663b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], 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); 5672b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 5673b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 5674b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 5675b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 567677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 5677b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 5678519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 5679b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 5680552f7358SJed Brown #else 5681b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+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 5804ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5805ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 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; 58211b406b76SMatthew G. Knepley PetscSection clSection; 58221b406b76SMatthew G. Knepley IS clPoints; 58230298fd71SBarry Smith PetscInt *points = NULL; 58241b406b76SMatthew G. Knepley const PetscInt *clp; 5825552f7358SJed Brown PetscInt *indices; 5826552f7358SJed Brown PetscInt offsets[32]; 5827552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5828552f7358SJed Brown PetscErrorCode ierr; 5829552f7358SJed Brown 5830552f7358SJed Brown PetscFunctionBegin; 5831552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5832ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 58333dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5834ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 58353dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 58363dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5837552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 583882f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5839552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 58401b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 58411b406b76SMatthew G. Knepley if (!clPoints) { 5842552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5843552f7358SJed Brown /* Compress out points not in the section */ 5844552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5845552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5846552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5847552f7358SJed Brown points[q*2] = points[p]; 5848552f7358SJed Brown points[q*2+1] = points[p+1]; 5849552f7358SJed Brown ++q; 5850552f7358SJed Brown } 5851552f7358SJed Brown } 5852552f7358SJed Brown numPoints = q; 58531b406b76SMatthew G. Knepley } else { 58541b406b76SMatthew G. Knepley PetscInt dof, off; 58551b406b76SMatthew G. Knepley 58561b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 58571b406b76SMatthew G. Knepley numPoints = dof/2; 58581b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 58591b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 58601b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 58611b406b76SMatthew G. Knepley } 5862552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5863552f7358SJed Brown PetscInt fdof; 5864552f7358SJed Brown 5865552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5866552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5867552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5868552f7358SJed Brown offsets[f+1] += fdof; 5869552f7358SJed Brown } 5870552f7358SJed Brown numIndices += dof; 5871552f7358SJed Brown } 58720d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 58730d644c17SKarl Rupp 587482f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5875552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5876552f7358SJed Brown if (numFields) { 5877552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5878552f7358SJed Brown PetscInt o = points[p+1]; 5879552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5880552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5881552f7358SJed Brown } 5882552f7358SJed Brown } else { 5883e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5884552f7358SJed Brown PetscInt o = points[p+1]; 5885552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5886e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5887552f7358SJed Brown } 5888552f7358SJed Brown } 5889b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5890552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5891552f7358SJed Brown if (ierr) { 5892552f7358SJed Brown PetscMPIInt rank; 5893552f7358SJed Brown PetscErrorCode ierr2; 5894552f7358SJed Brown 589582f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 589677a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5897b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 58986a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5899552f7358SJed Brown CHKERRQ(ierr); 5900552f7358SJed Brown } 59011b406b76SMatthew G. Knepley if (!clPoints) { 5902552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 59031b406b76SMatthew G. Knepley } else { 59041b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 59051b406b76SMatthew G. Knepley } 5906552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5907552f7358SJed Brown PetscFunctionReturn(0); 5908552f7358SJed Brown } 5909552f7358SJed Brown 5910552f7358SJed Brown #undef __FUNCT__ 5911de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5912de41b84cSMatthew G. Knepley PetscErrorCode DMPlexMatSetClosureRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5913de41b84cSMatthew G. Knepley { 5914de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5915de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5916de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5917de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5918de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5919de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 59204ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5921de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5922de41b84cSMatthew G. Knepley 5923de41b84cSMatthew G. Knepley PetscFunctionBegin; 5924de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5925de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5926de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5927de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5928de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5929de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5930de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5931de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5932de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5933de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5934de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5935de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5936de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5937de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5938de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5939de41b84cSMatthew G. Knepley /* Column indices */ 5940de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 59414ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5942de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5943de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5944de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5945de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5946de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5947de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5948de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5949de41b84cSMatthew G. Knepley ++q; 5950de41b84cSMatthew G. Knepley } 5951de41b84cSMatthew G. Knepley } 5952de41b84cSMatthew G. Knepley numCPoints = q; 5953de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5954de41b84cSMatthew G. Knepley PetscInt fdof; 5955de41b84cSMatthew G. Knepley 5956de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 59574ca5e9f5SMatthew G. Knepley if (!dof) continue; 5958de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5959de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5960de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5961de41b84cSMatthew G. Knepley } 5962de41b84cSMatthew G. Knepley numCIndices += dof; 5963de41b84cSMatthew G. Knepley } 5964de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5965de41b84cSMatthew G. Knepley /* Row indices */ 5966de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5967de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 59684ca5e9f5SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5969de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5970de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5971de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5972de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5973de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5974de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5975de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 59764ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 59774ca5e9f5SMatthew G. Knepley if (!dof) continue; 59784ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 59794ca5e9f5SMatthew G. Knepley if (s < q) continue; 5980de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5981de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5982de41b84cSMatthew G. Knepley ++q; 5983de41b84cSMatthew G. Knepley } 5984de41b84cSMatthew G. Knepley } 5985de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5986de41b84cSMatthew G. Knepley } 5987de41b84cSMatthew G. Knepley numFPoints = q; 5988de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5989de41b84cSMatthew G. Knepley PetscInt fdof; 5990de41b84cSMatthew G. Knepley 5991de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 59924ca5e9f5SMatthew G. Knepley if (!dof) continue; 5993de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5994de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5995de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5996de41b84cSMatthew G. Knepley } 5997de41b84cSMatthew G. Knepley numFIndices += dof; 5998de41b84cSMatthew G. Knepley } 5999de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 6000de41b84cSMatthew G. Knepley 6001de41b84cSMatthew G. Knepley if (numFields && foffsets[numFields] != numFIndices) SETERRQ2(PetscObjectComm((PetscObject)dmf), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", foffsets[numFields], numFIndices); 6002de41b84cSMatthew G. Knepley if (numFields && coffsets[numFields] != numCIndices) SETERRQ2(PetscObjectComm((PetscObject)dmc), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", coffsets[numFields], numCIndices); 6003de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6004de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6005de41b84cSMatthew G. Knepley if (numFields) { 6006de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 6007de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6008de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6009de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 6010de41b84cSMatthew G. Knepley } 6011de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 6012de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6013de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6014de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 6015de41b84cSMatthew G. Knepley } 6016de41b84cSMatthew G. Knepley } else { 6017de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 6018de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 6019de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 6020de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 6021de41b84cSMatthew G. Knepley } 6022de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 6023de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 6024de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 6025de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 6026de41b84cSMatthew G. Knepley } 6027de41b84cSMatthew G. Knepley } 6028de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 6029de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 6030de41b84cSMatthew G. Knepley if (ierr) { 6031de41b84cSMatthew G. Knepley PetscMPIInt rank; 6032de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 6033de41b84cSMatthew G. Knepley 6034de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 6035de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 6036de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 6037de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 6038de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 6039de41b84cSMatthew G. Knepley CHKERRQ(ierr); 6040de41b84cSMatthew G. Knepley } 6041*549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 6042de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 6043de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 6044de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 6045de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 6046de41b84cSMatthew G. Knepley } 6047de41b84cSMatthew G. Knepley 6048de41b84cSMatthew G. Knepley #undef __FUNCT__ 6049770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 6050f96281f8SMatthew G. Knepley /*@ 6051f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 6052f96281f8SMatthew G. Knepley 6053f96281f8SMatthew G. Knepley Input Parameter: 6054f96281f8SMatthew G. Knepley . dm - The DMPlex object 6055f96281f8SMatthew G. Knepley 6056f96281f8SMatthew G. Knepley Output Parameters: 6057f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 6058f96281f8SMatthew G. Knepley . cMax - The first hybrid face 6059f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 6060f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 6061f96281f8SMatthew G. Knepley 6062f96281f8SMatthew G. Knepley Level: developer 6063f96281f8SMatthew G. Knepley 6064f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 6065f96281f8SMatthew G. Knepley @*/ 6066770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 6067552f7358SJed Brown { 6068552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6069770b213bSMatthew G Knepley PetscInt dim; 6070770b213bSMatthew G Knepley PetscErrorCode ierr; 6071552f7358SJed Brown 6072552f7358SJed Brown PetscFunctionBegin; 6073552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6074770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6075770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 6076770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 6077770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 6078770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 6079552f7358SJed Brown PetscFunctionReturn(0); 6080552f7358SJed Brown } 6081552f7358SJed Brown 6082552f7358SJed Brown #undef __FUNCT__ 6083770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 6084770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 6085552f7358SJed Brown { 6086552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6087770b213bSMatthew G Knepley PetscInt dim; 6088770b213bSMatthew G Knepley PetscErrorCode ierr; 6089552f7358SJed Brown 6090552f7358SJed Brown PetscFunctionBegin; 6091552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6092770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6093770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 6094770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 6095770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 6096770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 6097552f7358SJed Brown PetscFunctionReturn(0); 6098552f7358SJed Brown } 6099552f7358SJed Brown 6100552f7358SJed Brown #undef __FUNCT__ 6101552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 6102552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 6103552f7358SJed Brown { 6104552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6105552f7358SJed Brown 6106552f7358SJed Brown PetscFunctionBegin; 6107552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6108552f7358SJed Brown PetscValidPointer(cellHeight, 2); 6109552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 6110552f7358SJed Brown PetscFunctionReturn(0); 6111552f7358SJed Brown } 6112552f7358SJed Brown 6113552f7358SJed Brown #undef __FUNCT__ 6114552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 6115552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 6116552f7358SJed Brown { 6117552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6118552f7358SJed Brown 6119552f7358SJed Brown PetscFunctionBegin; 6120552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6121552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 6122552f7358SJed Brown PetscFunctionReturn(0); 6123552f7358SJed Brown } 6124552f7358SJed Brown 6125552f7358SJed Brown #undef __FUNCT__ 6126552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 6127552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 6128552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 6129552f7358SJed Brown { 6130552f7358SJed Brown PetscSection section, globalSection; 6131552f7358SJed Brown PetscInt *numbers, p; 6132552f7358SJed Brown PetscErrorCode ierr; 6133552f7358SJed Brown 6134552f7358SJed Brown PetscFunctionBegin; 613582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 6136552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 6137552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6138552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 6139552f7358SJed Brown } 6140552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 6141552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 6142785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 6143552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6144552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 6145552f7358SJed Brown } 614682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 6147552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6148552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 6149552f7358SJed Brown PetscFunctionReturn(0); 6150552f7358SJed Brown } 6151552f7358SJed Brown 6152552f7358SJed Brown #undef __FUNCT__ 6153552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 6154552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 6155552f7358SJed Brown { 6156552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6157552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 6158552f7358SJed Brown PetscErrorCode ierr; 6159552f7358SJed Brown 6160552f7358SJed Brown PetscFunctionBegin; 6161552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6162552f7358SJed Brown if (!mesh->globalCellNumbers) { 6163552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 6164552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 61650298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 61660d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 6167552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 6168552f7358SJed Brown } 6169552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 6170552f7358SJed Brown PetscFunctionReturn(0); 6171552f7358SJed Brown } 6172552f7358SJed Brown 6173552f7358SJed Brown #undef __FUNCT__ 6174552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 6175552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 6176552f7358SJed Brown { 6177552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 6178552f7358SJed Brown PetscInt vStart, vEnd, vMax; 6179552f7358SJed Brown PetscErrorCode ierr; 6180552f7358SJed Brown 6181552f7358SJed Brown PetscFunctionBegin; 6182552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6183552f7358SJed Brown if (!mesh->globalVertexNumbers) { 6184552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 61850298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 61860d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 6187552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 6188552f7358SJed Brown } 6189552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 6190552f7358SJed Brown PetscFunctionReturn(0); 6191552f7358SJed Brown } 6192552f7358SJed Brown 6193552f7358SJed Brown 6194552f7358SJed Brown #undef __FUNCT__ 6195552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 6196552f7358SJed Brown /*@C 6197552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 6198552f7358SJed Brown the local section and an SF describing the section point overlap. 6199552f7358SJed Brown 6200552f7358SJed Brown Input Parameters: 6201552f7358SJed Brown + s - The PetscSection for the local field layout 6202552f7358SJed Brown . sf - The SF describing parallel layout of the section points 6203552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 6204552f7358SJed Brown . label - The label specifying the points 6205552f7358SJed Brown - labelValue - The label stratum specifying the points 6206552f7358SJed Brown 6207552f7358SJed Brown Output Parameter: 6208552f7358SJed Brown . gsection - The PetscSection for the global field layout 6209552f7358SJed Brown 6210552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 6211552f7358SJed Brown 6212552f7358SJed Brown Level: developer 6213552f7358SJed Brown 6214552f7358SJed Brown .seealso: PetscSectionCreate() 6215552f7358SJed Brown @*/ 6216552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 6217552f7358SJed Brown { 62187ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 6219552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 6220552f7358SJed Brown PetscErrorCode ierr; 6221552f7358SJed Brown 6222552f7358SJed Brown PetscFunctionBegin; 6223552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 6224552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 6225552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 62267ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 62277ec39499SMatthew G. Knepley if (nroots >= 0) { 62287ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 62291795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 62307ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 62311795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 62327ec39499SMatthew G. Knepley } else { 62337ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 62347ec39499SMatthew G. Knepley } 62357ec39499SMatthew G. Knepley } 6236552f7358SJed Brown /* Mark ghost points with negative dof */ 6237552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 6238552f7358SJed Brown PetscInt value; 6239552f7358SJed Brown 6240552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 6241552f7358SJed Brown if (value != labelValue) continue; 6242552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 6243552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 6244552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 6245552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 62467ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 6247552f7358SJed Brown } 6248552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 6249552f7358SJed Brown if (nroots >= 0) { 62507ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 62517ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6252552f7358SJed Brown if (nroots > pEnd-pStart) { 62537ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 6254552f7358SJed Brown } 6255552f7358SJed Brown } 6256552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 6257552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6258552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 6259552f7358SJed Brown (*gsection)->atlasOff[p] = off; 6260552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 6261552f7358SJed Brown } 6262552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 6263552f7358SJed Brown globalOff -= off; 6264552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 6265552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 62667ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 6267552f7358SJed Brown } 6268552f7358SJed Brown /* Put in negative offsets for ghost points */ 6269552f7358SJed Brown if (nroots >= 0) { 62707ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 62717ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 6272552f7358SJed Brown if (nroots > pEnd-pStart) { 62737ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 6274552f7358SJed Brown } 6275552f7358SJed Brown } 62767ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 6277552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 6278552f7358SJed Brown PetscFunctionReturn(0); 6279552f7358SJed Brown } 6280ca8062c8SMatthew G. Knepley 6281ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6282ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 6283ca8062c8SMatthew G. Knepley /*@ 6284ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 6285ca8062c8SMatthew G. Knepley 6286ca8062c8SMatthew G. Knepley Input Parameters: 6287ca8062c8SMatthew G. Knepley + dm - The DMPlex object 6288ca8062c8SMatthew G. Knepley 6289ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6290ca8062c8SMatthew G. Knepley 6291ca8062c8SMatthew G. Knepley Level: developer 6292ca8062c8SMatthew G. Knepley 62939bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 6294ca8062c8SMatthew G. Knepley @*/ 6295ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 6296ca8062c8SMatthew G. Knepley { 6297ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 6298ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 6299ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 6300ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 6301ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6302ca8062c8SMatthew G. Knepley 6303ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6304ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6305ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 6306ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 6307ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 6308ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 6309ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 6310ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 6311ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 6312ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6313ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 6314ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 6315ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6316ca8062c8SMatthew G. Knepley if (support[s] == p) break; 6317ca8062c8SMatthew G. Knepley } 6318ca8062c8SMatthew G. Knepley if (s >= supportSize) { 6319ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 6320ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 6321ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 6322ca8062c8SMatthew G. Knepley } 6323ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6324ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 6325ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6326ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 6327ca8062c8SMatthew G. Knepley } 6328ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6329ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 6330ca8062c8SMatthew G. Knepley } 6331ca8062c8SMatthew G. Knepley } 6332ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 6333ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 6334ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 6335ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 6336ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 6337ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6338ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 6339ca8062c8SMatthew G. Knepley } 6340ca8062c8SMatthew G. Knepley if (c >= coneSize) { 6341ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 6342ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 6343ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 6344ca8062c8SMatthew G. Knepley } 6345ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6346ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 6347ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 6348ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 6349ca8062c8SMatthew G. Knepley } 6350ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 6351ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 6352ca8062c8SMatthew G. Knepley } 6353ca8062c8SMatthew G. Knepley } 6354ca8062c8SMatthew G. Knepley } 6355ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 6356ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 6357ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 6358ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6359ca8062c8SMatthew G. Knepley } 6360ca8062c8SMatthew G. Knepley 6361ca8062c8SMatthew G. Knepley #undef __FUNCT__ 6362ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 6363ca8062c8SMatthew G. Knepley /*@ 6364ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 6365ca8062c8SMatthew G. Knepley 6366ca8062c8SMatthew G. Knepley Input Parameters: 6367ca8062c8SMatthew G. Knepley + dm - The DMPlex object 636858723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 636958723a97SMatthew G. Knepley - cellHeight - Normally 0 6370ca8062c8SMatthew G. Knepley 6371ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 6372ca8062c8SMatthew G. Knepley 6373ca8062c8SMatthew G. Knepley Level: developer 6374ca8062c8SMatthew G. Knepley 63759bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 6376ca8062c8SMatthew G. Knepley @*/ 637758723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 6378ca8062c8SMatthew G. Knepley { 637942363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 6380ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 6381ca8062c8SMatthew G. Knepley 6382ca8062c8SMatthew G. Knepley PetscFunctionBegin; 6383ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 6384ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6385ca8062c8SMatthew G. Knepley switch (dim) { 638642363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 638742363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 638842363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 6389ca8062c8SMatthew G. Knepley default: 6390ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 6391ca8062c8SMatthew G. Knepley } 639258723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 639358723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 6394ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 6395ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 6396ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 639758723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 639858723a97SMatthew G. Knepley 639958723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 640058723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 640158723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 640258723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 640358723a97SMatthew G. Knepley } 640458723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 6405ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 6406ca8062c8SMatthew G. Knepley } 640742363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 640842363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 640942363296SMatthew G. Knepley 641042363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 641142363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 641242363296SMatthew G. Knepley const PetscInt p = closure[cl]; 641342363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 641442363296SMatthew G. Knepley } 641542363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 641642363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 641742363296SMatthew G. Knepley } 6418ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 6419ca8062c8SMatthew G. Knepley } 64209bf0dad6SMatthew G. Knepley 64219bf0dad6SMatthew G. Knepley #undef __FUNCT__ 64229bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 64239bf0dad6SMatthew G. Knepley /*@ 64249bf0dad6SMatthew G. Knepley DMPlexCheckFaces - Check that the faces of each cell give a vertex order this is consistent with what we expect from the cell type 64259bf0dad6SMatthew G. Knepley 64269bf0dad6SMatthew G. Knepley Input Parameters: 64279bf0dad6SMatthew G. Knepley + dm - The DMPlex object 64289bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 64299bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 64309bf0dad6SMatthew G. Knepley 64319bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 64329bf0dad6SMatthew G. Knepley 64339bf0dad6SMatthew G. Knepley Level: developer 64349bf0dad6SMatthew G. Knepley 64359bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 64369bf0dad6SMatthew G. Knepley @*/ 64379bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 64389bf0dad6SMatthew G. Knepley { 64393554e41dSMatthew G. Knepley PetscInt pMax[4]; 64403554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 64419bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 64429bf0dad6SMatthew G. Knepley 64439bf0dad6SMatthew G. Knepley PetscFunctionBegin; 64449bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 64459bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 64469bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 644725abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 64483554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 64493554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 64503554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 64519bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 64529bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 64539bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 64549bf0dad6SMatthew G. Knepley 645525abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 64569bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 64579bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 64589bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 64599bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 64609bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 64619bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 64629bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 64639bf0dad6SMatthew G. Knepley } 64643554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 64659bf0dad6SMatthew G. Knepley if (coneSize != numFaces) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d faces but should have %d", c, coneSize, numFaces); 64669bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 64679bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 64689bf0dad6SMatthew G. Knepley 64699bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 64709bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 64719bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 64729bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 64739bf0dad6SMatthew G. Knepley } 6474e003ed69SMatthew G. Knepley if (fnumCorners != faceSize) SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d has %d vertices but should have %d", cone[f], f, c, fnumCorners, faceSize); 64759bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 6476e003ed69SMatthew G. Knepley if (fclosure[v] != faces[f*faceSize+v]) SETERRQ6(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d vertex %d, %d != %d", cone[f], f, c, v, fclosure[v], faces[f*faceSize+v]); 64779bf0dad6SMatthew G. Knepley } 64789bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 64799bf0dad6SMatthew G. Knepley } 64809bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 64819bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 64829bf0dad6SMatthew G. Knepley } 64833554e41dSMatthew G. Knepley } 6484552f7358SJed Brown PetscFunctionReturn(0); 6485552f7358SJed Brown } 64863913d7c8SMatthew G. Knepley 64873913d7c8SMatthew G. Knepley #undef __FUNCT__ 6488bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 6489bceba477SMatthew G. Knepley /* Pointwise interpolation 6490bceba477SMatthew G. Knepley Just code FEM for now 6491bceba477SMatthew G. Knepley u^f = I u^c 64924ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 64934ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 64944ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 6495bceba477SMatthew G. Knepley */ 6496bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 6497bceba477SMatthew G. Knepley { 6498bceba477SMatthew G. Knepley PetscSection gsc, gsf; 6499bceba477SMatthew G. Knepley PetscInt m, n; 6500a063dac3SMatthew G. Knepley void *ctx; 6501bceba477SMatthew G. Knepley PetscErrorCode ierr; 6502bceba477SMatthew G. Knepley 6503bceba477SMatthew G. Knepley PetscFunctionBegin; 6504bceba477SMatthew G. Knepley /* 6505bceba477SMatthew G. Knepley Loop over coarse cells 6506bceba477SMatthew G. Knepley Loop over coarse basis functions 6507bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 6508bceba477SMatthew G. Knepley Loop over fine dual basis functions 6509bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 6510bceba477SMatthew G. Knepley Sum 6511bceba477SMatthew G. Knepley Update local element matrix 6512bceba477SMatthew G. Knepley Accumulate to interpolation matrix 6513bceba477SMatthew G. Knepley 6514bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 6515bceba477SMatthew G. Knepley */ 6516bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 6517bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 6518bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 6519bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 652089bb8d19SMatthew G. Knepley /* FAS fails without a scaling vector */ 652189bb8d19SMatthew G. Knepley ierr = DMCreateGlobalVector(dmCoarse, scaling);CHKERRQ(ierr); 652289bb8d19SMatthew G. Knepley ierr = VecSet(*scaling, 1.0);CHKERRQ(ierr); 6523bceba477SMatthew G. Knepley /* We need to preallocate properly */ 6524bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 6525bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 6526bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 6527bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 6528bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 6529bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 6530a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 6531a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 6532a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 6533a063dac3SMatthew G. Knepley } 6534bceba477SMatthew G. Knepley 6535a063dac3SMatthew G. Knepley #undef __FUNCT__ 6536a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 6537a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 6538a063dac3SMatthew G. Knepley { 653990748bafSMatthew G. Knepley Vec cv, fv; 654090748bafSMatthew G. Knepley IS cis, fis, fpointIS; 654190748bafSMatthew G. Knepley PetscSection sc, gsc, gsf; 654290748bafSMatthew G. Knepley const PetscInt *fpoints; 654390748bafSMatthew G. Knepley PetscInt *cindices, *findices; 654490748bafSMatthew G. Knepley PetscInt cpStart, cpEnd, m, off, cp; 654590748bafSMatthew G. Knepley PetscErrorCode ierr; 654690748bafSMatthew G. Knepley 6547a063dac3SMatthew G. Knepley PetscFunctionBegin; 654890748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 654990748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr); 655090748bafSMatthew G. Knepley ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr); 655190748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 655290748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 655390748bafSMatthew G. Knepley ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr); 655490748bafSMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr); 655590748bafSMatthew G. Knepley ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr); 655690748bafSMatthew G. Knepley ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr); 655790748bafSMatthew G. Knepley ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr); 655890748bafSMatthew G. Knepley for (cp = cpStart, off = 0; cp < cpEnd; ++cp) { 655990748bafSMatthew G. Knepley const PetscInt *cdofsC = NULL; 656090748bafSMatthew G. Knepley PetscInt fp = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e; 656190748bafSMatthew G. Knepley 656290748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr); 656390748bafSMatthew G. Knepley if (dofC <= 0) continue; 656490748bafSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr); 656590748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr); 656690748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr); 656790748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr); 656890748bafSMatthew G. Knepley if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);} 656990748bafSMatthew G. Knepley if (dofC != dofF) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has %d coarse dofs != %d fine dofs", cp, fp, dofC, dofF); 657090748bafSMatthew G. Knepley if (offC < 0 || offF < 0) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Coarse point %d has invalid offset %d (%d)", cp, offC, offF); 657190748bafSMatthew G. Knepley for (d = 0, e = 0; d < dofC; ++d) { 657290748bafSMatthew G. Knepley if (cdofsC && cdofsC[e] == d) {++e; continue;} 657390748bafSMatthew G. Knepley cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d; 657490748bafSMatthew G. Knepley } 657590748bafSMatthew G. Knepley if (e != cdofC) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has invalid number of constraints %d != %d", cp, fp, e, cdofC); 657690748bafSMatthew G. Knepley off += dofC-cdofC; 657790748bafSMatthew G. Knepley } 657890748bafSMatthew G. Knepley ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr); 657990748bafSMatthew G. Knepley if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m); 658090748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr); 658190748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr); 658290748bafSMatthew G. Knepley ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr); 658390748bafSMatthew G. Knepley ierr = ISDestroy(&cis);CHKERRQ(ierr); 658490748bafSMatthew G. Knepley ierr = ISDestroy(&fis);CHKERRQ(ierr); 658590748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr); 658690748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 658790748bafSMatthew G. Knepley ierr = ISDestroy(&fpointIS);CHKERRQ(ierr); 6588bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6589bceba477SMatthew G. Knepley } 6590bceba477SMatthew G. Knepley 6591bceba477SMatthew G. Knepley #undef __FUNCT__ 6592fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 6593fd59a867SMatthew G. Knepley /* Pointwise interpolation 6594fd59a867SMatthew G. Knepley Just code FEM for now 6595fd59a867SMatthew G. Knepley u^f = I u^c 6596fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 6597fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 6598fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 6599fd59a867SMatthew G. Knepley */ 6600fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 6601fd59a867SMatthew G. Knepley { 6602fd59a867SMatthew G. Knepley PetscSection section; 6603fd59a867SMatthew G. Knepley IS *bcPoints; 6604286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 6605286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 6606fd59a867SMatthew G. Knepley PetscErrorCode ierr; 6607fd59a867SMatthew G. Knepley 6608fd59a867SMatthew G. Knepley PetscFunctionBegin; 6609fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 6610286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 6611fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 6612fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 6613fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 6614fd59a867SMatthew G. Knepley PetscBool isEssential; 6615fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 6616fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 6617fd59a867SMatthew G. Knepley } 6618fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 6619fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 6620fd59a867SMatthew G. Knepley const char *bdLabel; 6621fd59a867SMatthew G. Knepley DMLabel label; 6622fd59a867SMatthew G. Knepley const PetscInt *values; 6623fd59a867SMatthew G. Knepley PetscInt field, numValues; 6624fd59a867SMatthew G. Knepley PetscBool isEssential, has; 6625fd59a867SMatthew G. Knepley 6626fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 6627fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 6628fd59a867SMatthew G. Knepley ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr); 6629fd59a867SMatthew G. Knepley if (!has) { 6630fd59a867SMatthew G. Knepley ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr); 6631fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6632fd59a867SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 6633fd59a867SMatthew G. Knepley } 6634fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 6635fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 6636fd59a867SMatthew G. Knepley if (isEssential) { 6637fd59a867SMatthew G. Knepley bcFields[bc] = field; 6638fd59a867SMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &bcPoints[bc++]);CHKERRQ(ierr); 6639fd59a867SMatthew G. Knepley } 6640fd59a867SMatthew G. Knepley } 6641fd59a867SMatthew G. Knepley /* Handle discretization */ 6642fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 6643286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 6644fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6645fd59a867SMatthew G. Knepley PetscFE fe; 6646286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 6647fd59a867SMatthew G. Knepley PetscInt d; 6648fd59a867SMatthew G. Knepley 664918abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6650fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 6651286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 6652286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 6653fd59a867SMatthew G. Knepley } 6654286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6655286d8613SMatthew G. Knepley PetscInt d; 6656286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 6657286d8613SMatthew G. Knepley if ((numDof[f*(dim+1)+d] > 0) && (depth < dim)) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Mesh must be interpolated when unknowns are specified on edges or faces."); 6658286d8613SMatthew G. Knepley } 6659286d8613SMatthew G. Knepley } 6660286d8613SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, §ion);CHKERRQ(ierr); 6661fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 6662fd59a867SMatthew G. Knepley PetscFE fe; 6663fd59a867SMatthew G. Knepley const char *name; 666418abd763SMatthew G. Knepley 666518abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 6666fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 6667fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 6668fd59a867SMatthew G. Knepley } 6669fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 6670fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 6671fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 6672fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 6673286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 6674bceba477SMatthew G. Knepley PetscFunctionReturn(0); 6675bceba477SMatthew G. Knepley } 6676bceba477SMatthew G. Knepley 6677bceba477SMatthew G. Knepley #undef __FUNCT__ 66783913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 66793913d7c8SMatthew G. Knepley /*@ 66803913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 66813913d7c8SMatthew G. Knepley 66823913d7c8SMatthew G. Knepley Input Parameter: 66833913d7c8SMatthew G. Knepley . dm - The DMPlex object 66843913d7c8SMatthew G. Knepley 66853913d7c8SMatthew G. Knepley Output Parameter: 66863913d7c8SMatthew G. Knepley . cdm - The coarse DM 66873913d7c8SMatthew G. Knepley 66883913d7c8SMatthew G. Knepley Level: intermediate 66893913d7c8SMatthew G. Knepley 66903913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 66913913d7c8SMatthew G. Knepley @*/ 66923913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 66933913d7c8SMatthew G. Knepley { 66943913d7c8SMatthew G. Knepley PetscFunctionBegin; 66953913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 66963913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 66973913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 66983913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 66993913d7c8SMatthew G. Knepley } 67003913d7c8SMatthew G. Knepley 67013913d7c8SMatthew G. Knepley #undef __FUNCT__ 67023913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 67033913d7c8SMatthew G. Knepley /*@ 67043913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 67053913d7c8SMatthew G. Knepley 67063913d7c8SMatthew G. Knepley Input Parameters: 67073913d7c8SMatthew G. Knepley + dm - The DMPlex object 67083913d7c8SMatthew G. Knepley - cdm - The coarse DM 67093913d7c8SMatthew G. Knepley 67103913d7c8SMatthew G. Knepley Level: intermediate 67113913d7c8SMatthew G. Knepley 67123913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 67133913d7c8SMatthew G. Knepley @*/ 67143913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 67153913d7c8SMatthew G. Knepley { 67163913d7c8SMatthew G. Knepley DM_Plex *mesh; 67173913d7c8SMatthew G. Knepley PetscErrorCode ierr; 67183913d7c8SMatthew G. Knepley 67193913d7c8SMatthew G. Knepley PetscFunctionBegin; 67203913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 67213913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 67223913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 67233913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 67243913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 67253913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 67263913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 67273913d7c8SMatthew G. Knepley } 6728