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> 5*c6ccd67eSMatthew G. Knepley #include <petscviewerhdf5.h> 6552f7358SJed Brown 7552f7358SJed Brown /* Logging support */ 81337e6e5SMatthew 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; 9552f7358SJed Brown 105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer); 115a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer); 12552f7358SJed Brown 13552f7358SJed Brown #undef __FUNCT__ 14552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local" 15552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer) 16552f7358SJed Brown { 17552f7358SJed Brown DM dm; 18552f7358SJed Brown PetscBool isvtk; 19552f7358SJed Brown PetscErrorCode ierr; 20552f7358SJed Brown 21552f7358SJed Brown PetscFunctionBegin; 22552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 2382f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 24552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 25552f7358SJed Brown if (isvtk) { 26552f7358SJed Brown PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD; 27552f7358SJed Brown PetscSection section; 28552f7358SJed Brown PetscInt dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0; 29552f7358SJed Brown 30552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 31552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 320298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 330298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 1, &fStart, NULL);CHKERRQ(ierr); 340298fd71SBarry Smith ierr = DMPlexGetDepthStratum(dm, 0, &vStart, NULL);CHKERRQ(ierr); 35552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 36552f7358SJed Brown /* Assumes that numer of dofs per point of each stratum is constant, natural for VTK */ 37552f7358SJed Brown if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 38552f7358SJed Brown if ((fStart >= pStart) && (fStart < pEnd)) {ierr = PetscSectionGetDof(section, fStart, &fdof);CHKERRQ(ierr);} 39552f7358SJed Brown if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 40552f7358SJed Brown if (cdof && fdof && vdof) { /* Actually Q2 or some such, but visualize as Q1 */ 41552f7358SJed Brown ft = (cdof == dim) ? PETSC_VTK_POINT_VECTOR_FIELD : PETSC_VTK_POINT_FIELD; 42552f7358SJed Brown } else if (cdof && vdof) { 43ce94432eSBarry Smith SETERRQ(PetscObjectComm((PetscObject)viewer),PETSC_ERR_SUP,"No support for viewing mixed space with dofs at both vertices and cells"); 44552f7358SJed Brown } else if (cdof) { 45552f7358SJed Brown /* TODO: This assumption should be removed when there is a way of identifying whether a space is conceptually a 46552f7358SJed Brown * vector or just happens to have the same number of dofs as the dimension. */ 47552f7358SJed Brown if (cdof == dim) { 48552f7358SJed Brown ft = PETSC_VTK_CELL_VECTOR_FIELD; 49552f7358SJed Brown } else { 50552f7358SJed Brown ft = PETSC_VTK_CELL_FIELD; 51552f7358SJed Brown } 52552f7358SJed Brown } else if (vdof) { 53552f7358SJed Brown if (vdof == dim) { 54552f7358SJed Brown ft = PETSC_VTK_POINT_VECTOR_FIELD; 55552f7358SJed Brown } else { 56552f7358SJed Brown ft = PETSC_VTK_POINT_FIELD; 57552f7358SJed Brown } 5882f516ccSBarry Smith } else SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 59552f7358SJed Brown 60552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 61552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 62552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 63552f7358SJed Brown } else { 64552f7358SJed Brown PetscBool isseq; 65552f7358SJed Brown 66552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 67552f7358SJed Brown if (isseq) { 68552f7358SJed Brown ierr = VecView_Seq(v, viewer);CHKERRQ(ierr); 69552f7358SJed Brown } else { 70552f7358SJed Brown ierr = VecView_MPI(v, viewer);CHKERRQ(ierr); 71552f7358SJed Brown } 72552f7358SJed Brown } 73552f7358SJed Brown PetscFunctionReturn(0); 74552f7358SJed Brown } 75552f7358SJed Brown 76552f7358SJed Brown #undef __FUNCT__ 77552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 78552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 79552f7358SJed Brown { 80552f7358SJed Brown DM dm; 81552f7358SJed Brown PetscBool isvtk; 82552f7358SJed Brown PetscErrorCode ierr; 83552f7358SJed Brown 84552f7358SJed Brown PetscFunctionBegin; 85552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 8682f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 87552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 88552f7358SJed Brown if (isvtk) { 89552f7358SJed Brown Vec locv; 90552f7358SJed Brown const char *name; 91552f7358SJed Brown 92552f7358SJed Brown ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr); 93552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr); 94552f7358SJed Brown ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr); 95552f7358SJed Brown ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 96552f7358SJed Brown ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr); 97552f7358SJed Brown ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr); 98552f7358SJed Brown ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr); 99552f7358SJed Brown } else { 100552f7358SJed Brown PetscBool isseq; 101552f7358SJed Brown 102552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 103552f7358SJed Brown if (isseq) { 104552f7358SJed Brown ierr = VecView_Seq(v, viewer);CHKERRQ(ierr); 105552f7358SJed Brown } else { 106552f7358SJed Brown ierr = VecView_MPI(v, viewer);CHKERRQ(ierr); 107552f7358SJed Brown } 108552f7358SJed Brown } 109552f7358SJed Brown PetscFunctionReturn(0); 110552f7358SJed Brown } 111552f7358SJed Brown 112552f7358SJed Brown #undef __FUNCT__ 113552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 114552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 115552f7358SJed Brown { 116552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 117552f7358SJed Brown DM cdm; 118552f7358SJed Brown DMLabel markers; 119552f7358SJed Brown PetscSection coordSection; 120552f7358SJed Brown Vec coordinates; 121552f7358SJed Brown PetscViewerFormat format; 122552f7358SJed Brown PetscErrorCode ierr; 123552f7358SJed Brown 124552f7358SJed Brown PetscFunctionBegin; 125552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 126552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 127552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 128552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 129552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 130552f7358SJed Brown const char *name; 131552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 132552f7358SJed Brown PetscInt pStart, pEnd, p; 133552f7358SJed Brown PetscMPIInt rank, size; 134552f7358SJed Brown 13582f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 13682f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 137552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 138552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 139552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 140552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 141552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 142552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 143552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 144552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 145552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 146552f7358SJed Brown PetscInt dof, off, s; 147552f7358SJed Brown 148552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 149552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 150552f7358SJed Brown for (s = off; s < off+dof; ++s) { 151552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 152552f7358SJed Brown } 153552f7358SJed Brown } 154552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 155552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 156552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 157552f7358SJed Brown PetscInt dof, off, c; 158552f7358SJed Brown 159552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 160552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 161552f7358SJed Brown for (c = off; c < off+dof; ++c) { 162552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 163552f7358SJed Brown } 164552f7358SJed Brown } 165552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 1660298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 167552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 168552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 169552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 170552f7358SJed Brown if (size > 1) { 171552f7358SJed Brown PetscSF sf; 172552f7358SJed Brown 173552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 174552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 175552f7358SJed Brown } 176552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 177552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 178552f7358SJed Brown const char *name; 179552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 180552f7358SJed Brown const int numColors = 3; 181552f7358SJed Brown PetscReal scale = 2.0; 182552f7358SJed Brown PetscScalar *coords; 183552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 184552f7358SJed Brown PetscMPIInt rank, size; 185552f7358SJed Brown 186552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18782f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 18882f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 189552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 190552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 191770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 192770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 193552f7358SJed Brown \\usepackage{tikz}\n\ 194552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 195552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 196552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 197552f7358SJed Brown \\begin{document}\n\ 198552f7358SJed Brown \\section{%s}\n\ 199770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 200770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 201770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 202770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 203770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 204770b213bSMatthew G Knepley } else if (p > 0) { 205770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 206770b213bSMatthew G Knepley } 207770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 208770b213bSMatthew G Knepley } 209770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 210770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 211552f7358SJed Brown /* Plot vertices */ 212552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 213552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 214552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 215552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 216552f7358SJed Brown PetscInt off, dof, d; 217552f7358SJed Brown 218552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 219552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 220552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 221552f7358SJed Brown for (d = 0; d < dof; ++d) { 222552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2236712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 224552f7358SJed Brown } 225552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 226552f7358SJed Brown } 227552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 228552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 229552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 230552f7358SJed Brown /* Plot edges */ 231552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 232552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 233552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 234552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 235552f7358SJed Brown const PetscInt *cone; 236552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 237552f7358SJed Brown 238552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 23982f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 240552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 241552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 242552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 243552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 244552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 245552f7358SJed Brown for (d = 0; d < dof; ++d) { 246552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2476712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 248552f7358SJed Brown } 249552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 250552f7358SJed Brown } 251552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 252552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 253552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 254552f7358SJed Brown /* Plot cells */ 255552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 256552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2570298fd71SBarry Smith PetscInt *closure = NULL; 258552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 259552f7358SJed Brown 260552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 261552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 262552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 263552f7358SJed Brown const PetscInt point = closure[p]; 264552f7358SJed Brown 265552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 266552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 267552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 268552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 269552f7358SJed Brown } 270552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 271552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 272552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 273552f7358SJed Brown } 274552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 275552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 276770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 277552f7358SJed Brown } else { 27882f516ccSBarry Smith MPI_Comm comm; 279834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 280834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 281552f7358SJed Brown PetscInt pStart, pEnd, p; 282a57dd577SMatthew G Knepley PetscInt numLabels, l; 2831143a3c0SMatthew G. Knepley const char *name; 284552f7358SJed Brown PetscMPIInt size; 285552f7358SJed Brown 28682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 287552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 288552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2895f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 2901143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 2911143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 292552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 293552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 294834065abSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 295dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 296552f7358SJed Brown if (depth == 1) { 297552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 298552f7358SJed Brown pEnd = pEnd - pStart; 299552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 300552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 301552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 302552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 303552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 304552f7358SJed Brown pEnd = pEnd - pStart; 305552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 306552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", dim);CHKERRQ(ierr); 307552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 308552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 309552f7358SJed Brown } else { 310552f7358SJed Brown for (d = 0; d <= dim; d++) { 311552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 312834065abSMatthew G. Knepley pEnd -= pStart; 313834065abSMatthew G. Knepley pMax[d] -= pStart; 314552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 315834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 316552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 317834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 318834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 319834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 320834065abSMatthew G. Knepley } 321552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 322552f7358SJed Brown } 323552f7358SJed Brown } 324834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 325a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 326a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 327a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 328a57dd577SMatthew G Knepley DMLabel label; 329a57dd577SMatthew G Knepley const char *name; 330a57dd577SMatthew G Knepley IS valueIS; 331a57dd577SMatthew G Knepley const PetscInt *values; 332a57dd577SMatthew G Knepley PetscInt numValues, v; 333a57dd577SMatthew G Knepley 334a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 335a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 336a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 337a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 338a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 339a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 340a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 341a57dd577SMatthew G Knepley PetscInt size; 342a57dd577SMatthew G Knepley 343a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 344a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 345a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 346a57dd577SMatthew G Knepley } 347a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 348a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 3494d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 350a57dd577SMatthew G Knepley } 351552f7358SJed Brown } 352552f7358SJed Brown PetscFunctionReturn(0); 353552f7358SJed Brown } 354552f7358SJed Brown 355*c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 356*c6ccd67eSMatthew G. Knepley #undef __FUNCT__ 357*c6ccd67eSMatthew G. Knepley #define __FUNCT__ "DMPlexView_HDF5" 358*c6ccd67eSMatthew G. Knepley /* We only write cells and vertices. Does this screw up parallel reading? */ 359*c6ccd67eSMatthew G. Knepley PetscErrorCode DMPlexView_HDF5(DM dm, PetscViewer viewer) 360*c6ccd67eSMatthew G. Knepley { 361*c6ccd67eSMatthew G. Knepley DM cdm; 362*c6ccd67eSMatthew G. Knepley Vec coordinates, newcoords; 363*c6ccd67eSMatthew G. Knepley Vec coneVec, cellVec; 364*c6ccd67eSMatthew G. Knepley IS globalVertexNumbers; 365*c6ccd67eSMatthew G. Knepley const PetscInt *gvertex; 366*c6ccd67eSMatthew G. Knepley PetscScalar *sizes, *vertices; 367*c6ccd67eSMatthew G. Knepley PetscReal lengthScale; 368*c6ccd67eSMatthew G. Knepley const char *label = NULL; 369*c6ccd67eSMatthew G. Knepley PetscInt labelId = 0, dim; 370*c6ccd67eSMatthew G. Knepley PetscInt vStart, vEnd, v, cellHeight, cStart, cEnd, cMax, cell, conesSize = 0, numCornersLocal = 0, numCorners; 371*c6ccd67eSMatthew G. Knepley PetscErrorCode ierr; 372*c6ccd67eSMatthew G. Knepley 373*c6ccd67eSMatthew G. Knepley PetscFunctionBegin; 374*c6ccd67eSMatthew G. Knepley /* Write coordinates */ 375*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 376*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetScale(dm, PETSC_UNIT_LENGTH, &lengthScale);CHKERRQ(ierr); 377*c6ccd67eSMatthew G. Knepley ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 378*c6ccd67eSMatthew G. Knepley ierr = DMGetCoordinates(dm, &coordinates);CHKERRQ(ierr); 379*c6ccd67eSMatthew G. Knepley ierr = VecDuplicate(coordinates, &newcoords);CHKERRQ(ierr); 380*c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) newcoords, "vertices");CHKERRQ(ierr); 381*c6ccd67eSMatthew G. Knepley ierr = VecCopy(coordinates, newcoords);CHKERRQ(ierr); 382*c6ccd67eSMatthew G. Knepley ierr = VecScale(newcoords, lengthScale);CHKERRQ(ierr); 383*c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/geometry");CHKERRQ(ierr); 384*c6ccd67eSMatthew G. Knepley ierr = VecView(newcoords, viewer);CHKERRQ(ierr); 385*c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 386*c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&newcoords);CHKERRQ(ierr); 387*c6ccd67eSMatthew G. Knepley /* Write toplogy */ 388*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 389*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 390*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 391*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, PETSC_NULL, PETSC_NULL, PETSC_NULL);CHKERRQ(ierr); 392*c6ccd67eSMatthew G. Knepley if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 393*c6ccd67eSMatthew G. Knepley 394*c6ccd67eSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &coneVec);CHKERRQ(ierr); 395*c6ccd67eSMatthew G. Knepley ierr = VecSetSizes(coneVec, cEnd-cStart, PETSC_DETERMINE);CHKERRQ(ierr); 396*c6ccd67eSMatthew G. Knepley ierr = VecSetBlockSize(coneVec, 1);CHKERRQ(ierr); 397*c6ccd67eSMatthew G. Knepley ierr = VecSetFromOptions(coneVec);CHKERRQ(ierr); 398*c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) coneVec, "coneSize");CHKERRQ(ierr); 399*c6ccd67eSMatthew G. Knepley ierr = VecGetArray(coneVec, &sizes);CHKERRQ(ierr); 400*c6ccd67eSMatthew G. Knepley for (cell = cStart; cell < cEnd; ++cell) { 401*c6ccd67eSMatthew G. Knepley PetscInt *closure = NULL; 402*c6ccd67eSMatthew G. Knepley PetscInt closureSize, v, Nc = 0; 403*c6ccd67eSMatthew G. Knepley 404*c6ccd67eSMatthew G. Knepley if (label) { 405*c6ccd67eSMatthew G. Knepley PetscInt value; 406*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, label, cell, &value);CHKERRQ(ierr); 407*c6ccd67eSMatthew G. Knepley if (value == labelId) continue; 408*c6ccd67eSMatthew G. Knepley } 409*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 410*c6ccd67eSMatthew G. Knepley for (v = 0; v < closureSize*2; v += 2) { 411*c6ccd67eSMatthew G. Knepley if ((closure[v] >= vStart) && (closure[v] < vEnd)) ++Nc; 412*c6ccd67eSMatthew G. Knepley } 413*c6ccd67eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 414*c6ccd67eSMatthew G. Knepley conesSize += Nc; 415*c6ccd67eSMatthew G. Knepley if (!numCornersLocal) numCornersLocal = Nc; 416*c6ccd67eSMatthew G. Knepley else if (numCornersLocal != Nc) numCornersLocal = 1; 417*c6ccd67eSMatthew G. Knepley } 418*c6ccd67eSMatthew G. Knepley ierr = VecRestoreArray(coneVec, &sizes);CHKERRQ(ierr); 419*c6ccd67eSMatthew G. Knepley ierr = MPI_Allreduce(&numCornersLocal, &numCorners, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject) dm));CHKERRQ(ierr); 420*c6ccd67eSMatthew G. Knepley if (numCornersLocal && numCornersLocal != numCorners) numCorners = 1; 421*c6ccd67eSMatthew G. Knepley 422*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetVertexNumbering(dm, &globalVertexNumbers);CHKERRQ(ierr); 423*c6ccd67eSMatthew G. Knepley ierr = ISGetIndices(globalVertexNumbers, &gvertex);CHKERRQ(ierr); 424*c6ccd67eSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cellVec);CHKERRQ(ierr); 425*c6ccd67eSMatthew G. Knepley ierr = VecSetSizes(cellVec, conesSize, PETSC_DETERMINE);CHKERRQ(ierr); 426*c6ccd67eSMatthew G. Knepley ierr = VecSetBlockSize(cellVec, numCorners);CHKERRQ(ierr); 427*c6ccd67eSMatthew G. Knepley ierr = VecSetFromOptions(cellVec);CHKERRQ(ierr); 428*c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) cellVec, "cells");CHKERRQ(ierr); 429*c6ccd67eSMatthew G. Knepley ierr = VecGetArray(cellVec, &vertices);CHKERRQ(ierr); 430*c6ccd67eSMatthew G. Knepley for (cell = cStart, v = 0; cell < cEnd; ++cell) { 431*c6ccd67eSMatthew G. Knepley PetscInt *closure = NULL; 432*c6ccd67eSMatthew G. Knepley PetscInt closureSize, Nc = 0, p; 433*c6ccd67eSMatthew G. Knepley 434*c6ccd67eSMatthew G. Knepley if (label) { 435*c6ccd67eSMatthew G. Knepley PetscInt value; 436*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, label, cell, &value);CHKERRQ(ierr); 437*c6ccd67eSMatthew G. Knepley if (value == labelId) continue; 438*c6ccd67eSMatthew G. Knepley } 439*c6ccd67eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 440*c6ccd67eSMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 441*c6ccd67eSMatthew G. Knepley if ((closure[p] >= vStart) && (closure[p] < vEnd)) { 442*c6ccd67eSMatthew G. Knepley closure[Nc++] = closure[p]; 443*c6ccd67eSMatthew G. Knepley } 444*c6ccd67eSMatthew G. Knepley } 445*c6ccd67eSMatthew G. Knepley ierr = DMPlexInvertCell(dim, Nc, closure);CHKERRQ(ierr); 446*c6ccd67eSMatthew G. Knepley for (p = 0; p < Nc; ++p) { 447*c6ccd67eSMatthew G. Knepley const PetscInt gv = gvertex[closure[p] - vStart]; 448*c6ccd67eSMatthew G. Knepley vertices[v++] = gv < 0 ? -(gv+1) : gv; 449*c6ccd67eSMatthew G. Knepley } 450*c6ccd67eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 451*c6ccd67eSMatthew G. Knepley } 452*c6ccd67eSMatthew G. Knepley if (v != conesSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of cell vertices %d != %d", v, conesSize); 453*c6ccd67eSMatthew G. Knepley ierr = VecRestoreArray(cellVec, &vertices);CHKERRQ(ierr); 454*c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/topology");CHKERRQ(ierr); 455*c6ccd67eSMatthew G. Knepley ierr = VecView(cellVec, viewer);CHKERRQ(ierr); 456*c6ccd67eSMatthew G. Knepley if (numCorners == 1) { 457*c6ccd67eSMatthew G. Knepley ierr = VecView(coneVec, viewer);CHKERRQ(ierr); 458*c6ccd67eSMatthew G. Knepley } else { 459*c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5WriteAttribute(viewer, "/topology/cells", "cell_corners", PETSC_INT, (void *) &numCorners);CHKERRQ(ierr); 460*c6ccd67eSMatthew G. Knepley } 461*c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 462*c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&cellVec);CHKERRQ(ierr); 463*c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&coneVec);CHKERRQ(ierr); 464*c6ccd67eSMatthew G. Knepley ierr = ISRestoreIndices(globalVertexNumbers, &gvertex);CHKERRQ(ierr); 465*c6ccd67eSMatthew G. Knepley 466*c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5WriteAttribute(viewer, "/topology/cells", "cell_dim", PETSC_INT, (void *) &dim);CHKERRQ(ierr); 467*c6ccd67eSMatthew G. Knepley PetscFunctionReturn(0); 468*c6ccd67eSMatthew G. Knepley } 469*c6ccd67eSMatthew G. Knepley #endif 470*c6ccd67eSMatthew G. Knepley 471552f7358SJed Brown #undef __FUNCT__ 472552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 473552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 474552f7358SJed Brown { 475*c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 476552f7358SJed Brown PetscErrorCode ierr; 477552f7358SJed Brown 478552f7358SJed Brown PetscFunctionBegin; 479552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 480552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 481552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 482*c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 483552f7358SJed Brown if (iascii) { 484552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 485*c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 486*c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 487*c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 488*c6ccd67eSMatthew G. Knepley #else 489*c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 490552f7358SJed Brown #endif 49111aeaf0aSBarry Smith } 492552f7358SJed Brown PetscFunctionReturn(0); 493552f7358SJed Brown } 494552f7358SJed Brown 495552f7358SJed Brown #undef __FUNCT__ 4966c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4976c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4986c73c22cSMatthew G. Knepley { 4996c73c22cSMatthew G. Knepley DMBoundary b, next; 5006c73c22cSMatthew G. Knepley PetscErrorCode ierr; 5016c73c22cSMatthew G. Knepley 5026c73c22cSMatthew G. Knepley PetscFunctionBeginUser; 5036c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 5046c73c22cSMatthew G. Knepley b = *boundary; 5056c73c22cSMatthew G. Knepley *boundary = NULL; 5066c73c22cSMatthew G. Knepley for (; b; b = next) { 5076c73c22cSMatthew G. Knepley next = b->next; 5086c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5096c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 5106c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5116c73c22cSMatthew G. Knepley } 5126c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5136c73c22cSMatthew G. Knepley } 5146c73c22cSMatthew G. Knepley 5156c73c22cSMatthew G. Knepley #undef __FUNCT__ 516552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 517552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 518552f7358SJed Brown { 519552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 520552f7358SJed Brown DMLabel next = mesh->labels; 521552f7358SJed Brown PetscErrorCode ierr; 522552f7358SJed Brown 523552f7358SJed Brown PetscFunctionBegin; 5240d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 525552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 526552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 527552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 528552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 529552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 530552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 531552f7358SJed Brown while (next) { 532552f7358SJed Brown DMLabel tmp = next->next; 533552f7358SJed Brown 534552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 535552f7358SJed Brown next = tmp; 536552f7358SJed Brown } 5373913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 538a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 539552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 540552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5416c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 542552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 543552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 544552f7358SJed Brown PetscFunctionReturn(0); 545552f7358SJed Brown } 546552f7358SJed Brown 547552f7358SJed Brown #undef __FUNCT__ 548552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 549b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 550552f7358SJed Brown { 551552f7358SJed Brown PetscSection section, sectionGlobal; 552552f7358SJed Brown PetscInt bs = -1; 553552f7358SJed Brown PetscInt localSize; 55489545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 555552f7358SJed Brown PetscErrorCode ierr; 556b412c318SBarry Smith MatType mtype; 557552f7358SJed Brown 558552f7358SJed Brown PetscFunctionBegin; 559607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 560b412c318SBarry Smith mtype = dm->mattype; 561552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 562552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 563552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 564552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 56582f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 566552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 567552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 568552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 569552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 570552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 571552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 572552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 573552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 574552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 575552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 576552f7358SJed Brown if (!isShell) { 577552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5782a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 579552f7358SJed Brown 580552f7358SJed Brown if (bs < 0) { 581552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 582fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 583552f7358SJed Brown 584552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 585552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 586552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 587fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 588fad22124SMatthew G Knepley if (dof-cdof) { 5892a28c762SMatthew G Knepley if (bs < 0) { 590fad22124SMatthew G Knepley bs = dof-cdof; 591fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5922a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5932a28c762SMatthew G Knepley bs = 1; 594552f7358SJed Brown break; 595552f7358SJed Brown } 596552f7358SJed Brown } 5972a28c762SMatthew G Knepley } 5982a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5992a28c762SMatthew G Knepley bsLocal = bs; 60082f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6012a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 60282f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 6032a28c762SMatthew G Knepley if (bsMin != bsMax) { 6042a28c762SMatthew G Knepley bs = 1; 6052a28c762SMatthew G Knepley } else { 6062a28c762SMatthew G Knepley bs = bsMax; 6072a28c762SMatthew G Knepley } 608552f7358SJed Brown } else { 609552f7358SJed Brown bs = 1; 610552f7358SJed Brown } 611552f7358SJed Brown } 6121795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 613552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 614552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 615552f7358SJed Brown } 616552f7358SJed Brown PetscFunctionReturn(0); 617552f7358SJed Brown } 618552f7358SJed Brown 619552f7358SJed Brown #undef __FUNCT__ 620552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 621552f7358SJed Brown /*@ 622552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 623552f7358SJed Brown 624552f7358SJed Brown Not collective 625552f7358SJed Brown 626552f7358SJed Brown Input Parameter: 627552f7358SJed Brown . mesh - The DMPlex 628552f7358SJed Brown 629552f7358SJed Brown Output Parameter: 630552f7358SJed Brown . dim - The topological mesh dimension 631552f7358SJed Brown 632552f7358SJed Brown Level: beginner 633552f7358SJed Brown 634552f7358SJed Brown .seealso: DMPlexCreate() 635552f7358SJed Brown @*/ 636552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 637552f7358SJed Brown { 638552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 639552f7358SJed Brown 640552f7358SJed Brown PetscFunctionBegin; 641552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 642552f7358SJed Brown PetscValidPointer(dim, 2); 643552f7358SJed Brown *dim = mesh->dim; 644552f7358SJed Brown PetscFunctionReturn(0); 645552f7358SJed Brown } 646552f7358SJed Brown 647552f7358SJed Brown #undef __FUNCT__ 648552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 649552f7358SJed Brown /*@ 650552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 651552f7358SJed Brown 652552f7358SJed Brown Collective on mesh 653552f7358SJed Brown 654552f7358SJed Brown Input Parameters: 655552f7358SJed Brown + mesh - The DMPlex 656552f7358SJed Brown - dim - The topological mesh dimension 657552f7358SJed Brown 658552f7358SJed Brown Level: beginner 659552f7358SJed Brown 660552f7358SJed Brown .seealso: DMPlexCreate() 661552f7358SJed Brown @*/ 662552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 663552f7358SJed Brown { 664552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 665552f7358SJed Brown 666552f7358SJed Brown PetscFunctionBegin; 667552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 668552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 669552f7358SJed Brown mesh->dim = dim; 670552f7358SJed Brown PetscFunctionReturn(0); 671552f7358SJed Brown } 672552f7358SJed Brown 673552f7358SJed Brown #undef __FUNCT__ 674552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 675552f7358SJed Brown /*@ 676552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 677552f7358SJed Brown 678552f7358SJed Brown Not collective 679552f7358SJed Brown 680552f7358SJed Brown Input Parameter: 681552f7358SJed Brown . mesh - The DMPlex 682552f7358SJed Brown 683552f7358SJed Brown Output Parameters: 684552f7358SJed Brown + pStart - The first mesh point 685552f7358SJed Brown - pEnd - The upper bound for mesh points 686552f7358SJed Brown 687552f7358SJed Brown Level: beginner 688552f7358SJed Brown 689552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 690552f7358SJed Brown @*/ 691552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 692552f7358SJed Brown { 693552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 694552f7358SJed Brown PetscErrorCode ierr; 695552f7358SJed Brown 696552f7358SJed Brown PetscFunctionBegin; 697552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 698552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 699552f7358SJed Brown PetscFunctionReturn(0); 700552f7358SJed Brown } 701552f7358SJed Brown 702552f7358SJed Brown #undef __FUNCT__ 703552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 704552f7358SJed Brown /*@ 705552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 706552f7358SJed Brown 707552f7358SJed Brown Not collective 708552f7358SJed Brown 709552f7358SJed Brown Input Parameters: 710552f7358SJed Brown + mesh - The DMPlex 711552f7358SJed Brown . pStart - The first mesh point 712552f7358SJed Brown - pEnd - The upper bound for mesh points 713552f7358SJed Brown 714552f7358SJed Brown Output Parameters: 715552f7358SJed Brown 716552f7358SJed Brown Level: beginner 717552f7358SJed Brown 718552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 719552f7358SJed Brown @*/ 720552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 721552f7358SJed Brown { 722552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 723552f7358SJed Brown PetscErrorCode ierr; 724552f7358SJed Brown 725552f7358SJed Brown PetscFunctionBegin; 726552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 727552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 728552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 729552f7358SJed Brown PetscFunctionReturn(0); 730552f7358SJed Brown } 731552f7358SJed Brown 732552f7358SJed Brown #undef __FUNCT__ 733552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 734552f7358SJed Brown /*@ 735552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 736552f7358SJed Brown 737552f7358SJed Brown Not collective 738552f7358SJed Brown 739552f7358SJed Brown Input Parameters: 740552f7358SJed Brown + mesh - The DMPlex 741552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 742552f7358SJed Brown 743552f7358SJed Brown Output Parameter: 744552f7358SJed Brown . size - The cone size for point p 745552f7358SJed Brown 746552f7358SJed Brown Level: beginner 747552f7358SJed Brown 748552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 749552f7358SJed Brown @*/ 750552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 751552f7358SJed Brown { 752552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 753552f7358SJed Brown PetscErrorCode ierr; 754552f7358SJed Brown 755552f7358SJed Brown PetscFunctionBegin; 756552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 757552f7358SJed Brown PetscValidPointer(size, 3); 758552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 759552f7358SJed Brown PetscFunctionReturn(0); 760552f7358SJed Brown } 761552f7358SJed Brown 762552f7358SJed Brown #undef __FUNCT__ 763552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 764552f7358SJed Brown /*@ 765552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 766552f7358SJed Brown 767552f7358SJed Brown Not collective 768552f7358SJed Brown 769552f7358SJed Brown Input Parameters: 770552f7358SJed Brown + mesh - The DMPlex 771552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 772552f7358SJed Brown - size - The cone size for point p 773552f7358SJed Brown 774552f7358SJed Brown Output Parameter: 775552f7358SJed Brown 776552f7358SJed Brown Note: 777552f7358SJed Brown This should be called after DMPlexSetChart(). 778552f7358SJed Brown 779552f7358SJed Brown Level: beginner 780552f7358SJed Brown 781552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 782552f7358SJed Brown @*/ 783552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 784552f7358SJed Brown { 785552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 786552f7358SJed Brown PetscErrorCode ierr; 787552f7358SJed Brown 788552f7358SJed Brown PetscFunctionBegin; 789552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 790552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7910d644c17SKarl Rupp 792552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 793552f7358SJed Brown PetscFunctionReturn(0); 794552f7358SJed Brown } 795552f7358SJed Brown 796552f7358SJed Brown #undef __FUNCT__ 797552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 798552f7358SJed Brown /*@C 799552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 800552f7358SJed Brown 801552f7358SJed Brown Not collective 802552f7358SJed Brown 803552f7358SJed Brown Input Parameters: 804552f7358SJed Brown + mesh - The DMPlex 805552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 806552f7358SJed Brown 807552f7358SJed Brown Output Parameter: 808552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 809552f7358SJed Brown 810552f7358SJed Brown Level: beginner 811552f7358SJed Brown 8123813dfbdSMatthew G Knepley Fortran Notes: 8133813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8143813dfbdSMatthew G Knepley include petsc.h90 in your code. 8153813dfbdSMatthew G Knepley 8163813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 817552f7358SJed Brown 818552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 819552f7358SJed Brown @*/ 820552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 821552f7358SJed Brown { 822552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 823552f7358SJed Brown PetscInt off; 824552f7358SJed Brown PetscErrorCode ierr; 825552f7358SJed Brown 826552f7358SJed Brown PetscFunctionBegin; 827552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 828552f7358SJed Brown PetscValidPointer(cone, 3); 829552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 830552f7358SJed Brown *cone = &mesh->cones[off]; 831552f7358SJed Brown PetscFunctionReturn(0); 832552f7358SJed Brown } 833552f7358SJed Brown 834552f7358SJed Brown #undef __FUNCT__ 835552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 836552f7358SJed Brown /*@ 837552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 838552f7358SJed Brown 839552f7358SJed Brown Not collective 840552f7358SJed Brown 841552f7358SJed Brown Input Parameters: 842552f7358SJed Brown + mesh - The DMPlex 843552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 844552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 845552f7358SJed Brown 846552f7358SJed Brown Output Parameter: 847552f7358SJed Brown 848552f7358SJed Brown Note: 849552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 850552f7358SJed Brown 851552f7358SJed Brown Level: beginner 852552f7358SJed Brown 853552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 854552f7358SJed Brown @*/ 855552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 856552f7358SJed Brown { 857552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 858552f7358SJed Brown PetscInt pStart, pEnd; 859552f7358SJed Brown PetscInt dof, off, c; 860552f7358SJed Brown PetscErrorCode ierr; 861552f7358SJed Brown 862552f7358SJed Brown PetscFunctionBegin; 863552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 864552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 865552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 866552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 867552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 86882f516ccSBarry 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); 869552f7358SJed Brown for (c = 0; c < dof; ++c) { 87082f516ccSBarry 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); 871552f7358SJed Brown mesh->cones[off+c] = cone[c]; 872552f7358SJed Brown } 873552f7358SJed Brown PetscFunctionReturn(0); 874552f7358SJed Brown } 875552f7358SJed Brown 876552f7358SJed Brown #undef __FUNCT__ 877552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 878552f7358SJed Brown /*@C 879552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 880552f7358SJed Brown 881552f7358SJed Brown Not collective 882552f7358SJed Brown 883552f7358SJed Brown Input Parameters: 884552f7358SJed Brown + mesh - The DMPlex 885552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 886552f7358SJed Brown 887552f7358SJed Brown Output Parameter: 888552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 889552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 890552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 891552f7358SJed Brown the index of the cone point on which to start. 892552f7358SJed Brown 893552f7358SJed Brown Level: beginner 894552f7358SJed Brown 8953813dfbdSMatthew G Knepley Fortran Notes: 8963813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8973813dfbdSMatthew G Knepley include petsc.h90 in your code. 8983813dfbdSMatthew G Knepley 8993813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 900552f7358SJed Brown 901552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 902552f7358SJed Brown @*/ 903552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 904552f7358SJed Brown { 905552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 906552f7358SJed Brown PetscInt off; 907552f7358SJed Brown PetscErrorCode ierr; 908552f7358SJed Brown 909552f7358SJed Brown PetscFunctionBegin; 910552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 911552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 912552f7358SJed Brown { 913552f7358SJed Brown PetscInt dof; 914552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 915552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 916552f7358SJed Brown } 917552f7358SJed Brown #endif 918552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9190d644c17SKarl Rupp 920552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 921552f7358SJed Brown PetscFunctionReturn(0); 922552f7358SJed Brown } 923552f7358SJed Brown 924552f7358SJed Brown #undef __FUNCT__ 925552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 926552f7358SJed Brown /*@ 927552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 928552f7358SJed Brown 929552f7358SJed Brown Not collective 930552f7358SJed Brown 931552f7358SJed Brown Input Parameters: 932552f7358SJed Brown + mesh - The DMPlex 933552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 934552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 935552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 936552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 937552f7358SJed Brown the index of the cone point on which to start. 938552f7358SJed Brown 939552f7358SJed Brown Output Parameter: 940552f7358SJed Brown 941552f7358SJed Brown Note: 942552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 943552f7358SJed Brown 944552f7358SJed Brown Level: beginner 945552f7358SJed Brown 946552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 947552f7358SJed Brown @*/ 948552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 949552f7358SJed Brown { 950552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 951552f7358SJed Brown PetscInt pStart, pEnd; 952552f7358SJed Brown PetscInt dof, off, c; 953552f7358SJed Brown PetscErrorCode ierr; 954552f7358SJed Brown 955552f7358SJed Brown PetscFunctionBegin; 956552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 957552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 958552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 959552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 960552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 96182f516ccSBarry 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); 962552f7358SJed Brown for (c = 0; c < dof; ++c) { 963552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 964552f7358SJed Brown 965552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 96682f516ccSBarry 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); 967552f7358SJed Brown mesh->coneOrientations[off+c] = o; 968552f7358SJed Brown } 969552f7358SJed Brown PetscFunctionReturn(0); 970552f7358SJed Brown } 971552f7358SJed Brown 972552f7358SJed Brown #undef __FUNCT__ 973552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 974552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 975552f7358SJed Brown { 976552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 977552f7358SJed Brown PetscInt pStart, pEnd; 978552f7358SJed Brown PetscInt dof, off; 979552f7358SJed Brown PetscErrorCode ierr; 980552f7358SJed Brown 981552f7358SJed Brown PetscFunctionBegin; 982552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 983552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 98482f516ccSBarry 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); 98582f516ccSBarry 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); 98677c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 98777c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98877c88f5bSMatthew 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); 989552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 990552f7358SJed Brown PetscFunctionReturn(0); 991552f7358SJed Brown } 992552f7358SJed Brown 993552f7358SJed Brown #undef __FUNCT__ 99477c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 99577c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 99677c88f5bSMatthew G Knepley { 99777c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 99877c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 99977c88f5bSMatthew G Knepley PetscInt dof, off; 100077c88f5bSMatthew G Knepley PetscErrorCode ierr; 100177c88f5bSMatthew G Knepley 100277c88f5bSMatthew G Knepley PetscFunctionBegin; 100377c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 100477c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 100577c88f5bSMatthew 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); 100677c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 100777c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 100877c88f5bSMatthew 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); 100977c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 101077c88f5bSMatthew G Knepley PetscFunctionReturn(0); 101177c88f5bSMatthew G Knepley } 101277c88f5bSMatthew G Knepley 101377c88f5bSMatthew G Knepley #undef __FUNCT__ 1014552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1015552f7358SJed Brown /*@ 1016552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1017552f7358SJed Brown 1018552f7358SJed Brown Not collective 1019552f7358SJed Brown 1020552f7358SJed Brown Input Parameters: 1021552f7358SJed Brown + mesh - The DMPlex 1022552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1023552f7358SJed Brown 1024552f7358SJed Brown Output Parameter: 1025552f7358SJed Brown . size - The support size for point p 1026552f7358SJed Brown 1027552f7358SJed Brown Level: beginner 1028552f7358SJed Brown 1029552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1030552f7358SJed Brown @*/ 1031552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1032552f7358SJed Brown { 1033552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1034552f7358SJed Brown PetscErrorCode ierr; 1035552f7358SJed Brown 1036552f7358SJed Brown PetscFunctionBegin; 1037552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1038552f7358SJed Brown PetscValidPointer(size, 3); 1039552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1040552f7358SJed Brown PetscFunctionReturn(0); 1041552f7358SJed Brown } 1042552f7358SJed Brown 1043552f7358SJed Brown #undef __FUNCT__ 1044552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1045552f7358SJed Brown /*@ 1046552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1047552f7358SJed Brown 1048552f7358SJed Brown Not collective 1049552f7358SJed Brown 1050552f7358SJed Brown Input Parameters: 1051552f7358SJed Brown + mesh - The DMPlex 1052552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1053552f7358SJed Brown - size - The support size for point p 1054552f7358SJed Brown 1055552f7358SJed Brown Output Parameter: 1056552f7358SJed Brown 1057552f7358SJed Brown Note: 1058552f7358SJed Brown This should be called after DMPlexSetChart(). 1059552f7358SJed Brown 1060552f7358SJed Brown Level: beginner 1061552f7358SJed Brown 1062552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1063552f7358SJed Brown @*/ 1064552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1065552f7358SJed Brown { 1066552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1067552f7358SJed Brown PetscErrorCode ierr; 1068552f7358SJed Brown 1069552f7358SJed Brown PetscFunctionBegin; 1070552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1071552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10720d644c17SKarl Rupp 1073552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1074552f7358SJed Brown PetscFunctionReturn(0); 1075552f7358SJed Brown } 1076552f7358SJed Brown 1077552f7358SJed Brown #undef __FUNCT__ 1078552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1079552f7358SJed Brown /*@C 1080552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1081552f7358SJed Brown 1082552f7358SJed Brown Not collective 1083552f7358SJed Brown 1084552f7358SJed Brown Input Parameters: 1085552f7358SJed Brown + mesh - The DMPlex 1086552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1087552f7358SJed Brown 1088552f7358SJed Brown Output Parameter: 1089552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1090552f7358SJed Brown 1091552f7358SJed Brown Level: beginner 1092552f7358SJed Brown 10933813dfbdSMatthew G Knepley Fortran Notes: 10943813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10953813dfbdSMatthew G Knepley include petsc.h90 in your code. 10963813dfbdSMatthew G Knepley 10973813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10983813dfbdSMatthew G Knepley 1099552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1100552f7358SJed Brown @*/ 1101552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1102552f7358SJed Brown { 1103552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1104552f7358SJed Brown PetscInt off; 1105552f7358SJed Brown PetscErrorCode ierr; 1106552f7358SJed Brown 1107552f7358SJed Brown PetscFunctionBegin; 1108552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1109552f7358SJed Brown PetscValidPointer(support, 3); 1110552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1111552f7358SJed Brown *support = &mesh->supports[off]; 1112552f7358SJed Brown PetscFunctionReturn(0); 1113552f7358SJed Brown } 1114552f7358SJed Brown 1115552f7358SJed Brown #undef __FUNCT__ 1116552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1117552f7358SJed Brown /*@ 1118552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1119552f7358SJed Brown 1120552f7358SJed Brown Not collective 1121552f7358SJed Brown 1122552f7358SJed Brown Input Parameters: 1123552f7358SJed Brown + mesh - The DMPlex 1124552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1125552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1126552f7358SJed Brown 1127552f7358SJed Brown Output Parameter: 1128552f7358SJed Brown 1129552f7358SJed Brown Note: 1130552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1131552f7358SJed Brown 1132552f7358SJed Brown Level: beginner 1133552f7358SJed Brown 1134552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1135552f7358SJed Brown @*/ 1136552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1137552f7358SJed Brown { 1138552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1139552f7358SJed Brown PetscInt pStart, pEnd; 1140552f7358SJed Brown PetscInt dof, off, c; 1141552f7358SJed Brown PetscErrorCode ierr; 1142552f7358SJed Brown 1143552f7358SJed Brown PetscFunctionBegin; 1144552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1145552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1146552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1147552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1148552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114982f516ccSBarry 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); 1150552f7358SJed Brown for (c = 0; c < dof; ++c) { 115182f516ccSBarry 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); 1152552f7358SJed Brown mesh->supports[off+c] = support[c]; 1153552f7358SJed Brown } 1154552f7358SJed Brown PetscFunctionReturn(0); 1155552f7358SJed Brown } 1156552f7358SJed Brown 1157552f7358SJed Brown #undef __FUNCT__ 1158552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1159552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1160552f7358SJed Brown { 1161552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1162552f7358SJed Brown PetscInt pStart, pEnd; 1163552f7358SJed Brown PetscInt dof, off; 1164552f7358SJed Brown PetscErrorCode ierr; 1165552f7358SJed Brown 1166552f7358SJed Brown PetscFunctionBegin; 1167552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1168552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1169552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1170552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 117182f516ccSBarry 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); 117282f516ccSBarry 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); 117382f516ccSBarry 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); 1174552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1175552f7358SJed Brown PetscFunctionReturn(0); 1176552f7358SJed Brown } 1177552f7358SJed Brown 1178552f7358SJed Brown #undef __FUNCT__ 1179552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1180552f7358SJed Brown /*@C 1181552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1182552f7358SJed Brown 1183552f7358SJed Brown Not collective 1184552f7358SJed Brown 1185552f7358SJed Brown Input Parameters: 1186552f7358SJed Brown + mesh - The DMPlex 1187552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1188552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11890298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1190552f7358SJed Brown 1191552f7358SJed Brown Output Parameters: 1192552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1193552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1194552f7358SJed Brown 1195552f7358SJed Brown Note: 11960298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1197552f7358SJed Brown 11983813dfbdSMatthew G Knepley Fortran Notes: 11993813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 12003813dfbdSMatthew G Knepley include petsc.h90 in your code. 12013813dfbdSMatthew G Knepley 12023813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 12033813dfbdSMatthew G Knepley 1204552f7358SJed Brown Level: beginner 1205552f7358SJed Brown 1206552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1207552f7358SJed Brown @*/ 1208552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1209552f7358SJed Brown { 1210552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1211552f7358SJed Brown PetscInt *closure, *fifo; 12120298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1213552f7358SJed Brown PetscInt tmpSize, t; 1214552f7358SJed Brown PetscInt depth = 0, maxSize; 1215552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1216552f7358SJed Brown PetscErrorCode ierr; 1217552f7358SJed Brown 1218552f7358SJed Brown PetscFunctionBegin; 1219552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1220552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1221552f7358SJed Brown /* This is only 1-level */ 1222552f7358SJed Brown if (useCone) { 1223552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1224552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1225552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1226552f7358SJed Brown } else { 1227552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1228552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1229552f7358SJed Brown } 1230bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1231bfbcdd7aSMatthew G. Knepley if (*points) { 1232bfbcdd7aSMatthew G. Knepley closure = *points; 1233bfbcdd7aSMatthew G. Knepley } else { 1234bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1235bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1236bfbcdd7aSMatthew G. Knepley } 1237bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1238bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1239bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1240bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1241bfbcdd7aSMatthew G. Knepley } 1242bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1243bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1244bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1245bfbcdd7aSMatthew G. Knepley } 1246bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1247bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1248bfbcdd7aSMatthew G. Knepley if (*points) { 1249bfbcdd7aSMatthew G. Knepley closure = *points; 1250bfbcdd7aSMatthew G. Knepley } else { 1251bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1252bfbcdd7aSMatthew G. Knepley } 1253bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1254552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1255552f7358SJed Brown const PetscInt cp = tmp[t]; 1256552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1257552f7358SJed Brown 1258552f7358SJed Brown closure[closureSize] = cp; 1259552f7358SJed Brown closure[closureSize+1] = co; 1260552f7358SJed Brown fifo[fifoSize] = cp; 1261552f7358SJed Brown fifo[fifoSize+1] = co; 1262552f7358SJed Brown } 1263bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1264552f7358SJed Brown while (fifoSize - fifoStart) { 1265552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1266552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1267552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1268552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1269552f7358SJed Brown 1270552f7358SJed Brown if (useCone) { 1271552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1272552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1273552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1274552f7358SJed Brown } else { 1275552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1276552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12770298fd71SBarry Smith tmpO = NULL; 1278552f7358SJed Brown } 1279552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1280552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1281552f7358SJed Brown const PetscInt cp = tmp[i]; 12822e1b13c2SMatthew 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. */ 12832e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12842e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12852e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1286552f7358SJed Brown PetscInt c; 1287552f7358SJed Brown 12882e1b13c2SMatthew G. Knepley if (rev) { 12892e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12902e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12912e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12922e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12932e1b13c2SMatthew G. Knepley } 1294552f7358SJed Brown /* Check for duplicate */ 1295552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1296552f7358SJed Brown if (closure[c] == cp) break; 1297552f7358SJed Brown } 1298552f7358SJed Brown if (c == closureSize) { 1299552f7358SJed Brown closure[closureSize] = cp; 1300552f7358SJed Brown closure[closureSize+1] = co; 1301552f7358SJed Brown fifo[fifoSize] = cp; 1302552f7358SJed Brown fifo[fifoSize+1] = co; 1303552f7358SJed Brown closureSize += 2; 1304552f7358SJed Brown fifoSize += 2; 1305552f7358SJed Brown } 1306552f7358SJed Brown } 1307552f7358SJed Brown fifoStart += 2; 1308552f7358SJed Brown } 1309552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1310552f7358SJed Brown if (points) *points = closure; 1311552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1312552f7358SJed Brown PetscFunctionReturn(0); 1313552f7358SJed Brown } 1314552f7358SJed Brown 1315552f7358SJed Brown #undef __FUNCT__ 13169bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13179bf0dad6SMatthew G. Knepley /*@C 13189bf0dad6SMatthew 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 13199bf0dad6SMatthew G. Knepley 13209bf0dad6SMatthew G. Knepley Not collective 13219bf0dad6SMatthew G. Knepley 13229bf0dad6SMatthew G. Knepley Input Parameters: 13239bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13249bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13259bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13269bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13279bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13289bf0dad6SMatthew G. Knepley 13299bf0dad6SMatthew G. Knepley Output Parameters: 13309bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13319bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13329bf0dad6SMatthew G. Knepley 13339bf0dad6SMatthew G. Knepley Note: 13349bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13359bf0dad6SMatthew G. Knepley 13369bf0dad6SMatthew G. Knepley Fortran Notes: 13379bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13389bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13399bf0dad6SMatthew G. Knepley 13409bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13419bf0dad6SMatthew G. Knepley 13429bf0dad6SMatthew G. Knepley Level: beginner 13439bf0dad6SMatthew G. Knepley 13449bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13459bf0dad6SMatthew G. Knepley @*/ 13469bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13479bf0dad6SMatthew G. Knepley { 13489bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13499bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13509bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13519bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13529bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13539bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13549bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13559bf0dad6SMatthew G. Knepley 13569bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13579bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13589bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13599bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13609bf0dad6SMatthew G. Knepley if (useCone) { 13619bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13629bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13639bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13649bf0dad6SMatthew G. Knepley } else { 13659bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13669bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13679bf0dad6SMatthew G. Knepley } 13689bf0dad6SMatthew G. Knepley if (depth == 1) { 13699bf0dad6SMatthew G. Knepley if (*points) { 13709bf0dad6SMatthew G. Knepley closure = *points; 13719bf0dad6SMatthew G. Knepley } else { 13729bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13739bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13749bf0dad6SMatthew G. Knepley } 13759bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13769bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13779bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13789bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13799bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13809bf0dad6SMatthew G. Knepley } 13819bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13829bf0dad6SMatthew G. Knepley if (points) *points = closure; 13839bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13849bf0dad6SMatthew G. Knepley } 13859bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13869bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13879bf0dad6SMatthew G. Knepley if (*points) { 13889bf0dad6SMatthew G. Knepley closure = *points; 13899bf0dad6SMatthew G. Knepley } else { 13909bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13919bf0dad6SMatthew G. Knepley } 13929bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13939bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13949bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13959bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13969bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13979bf0dad6SMatthew G. Knepley 13989bf0dad6SMatthew G. Knepley if (ornt < 0) { 13999bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14009bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14019bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14029bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14039bf0dad6SMatthew G. Knepley } 14049bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14059bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14069bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14079bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14089bf0dad6SMatthew G. Knepley } 14099bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14109bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14119bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14129bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14139bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14149bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14159bf0dad6SMatthew G. Knepley 14169bf0dad6SMatthew G. Knepley if (useCone) { 14179bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14189bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14199bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14209bf0dad6SMatthew G. Knepley } else { 14219bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14229bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14239bf0dad6SMatthew G. Knepley tmpO = NULL; 14249bf0dad6SMatthew G. Knepley } 14259bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14269bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14279bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14289bf0dad6SMatthew 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. */ 14299bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14309bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14319bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14329bf0dad6SMatthew G. Knepley PetscInt c; 14339bf0dad6SMatthew G. Knepley 14349bf0dad6SMatthew G. Knepley if (rev) { 14359bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14369bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14379bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14389bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14399bf0dad6SMatthew G. Knepley } 14409bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14419bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14429bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14439bf0dad6SMatthew G. Knepley } 14449bf0dad6SMatthew G. Knepley if (c == closureSize) { 14459bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14469bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14479bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14489bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14499bf0dad6SMatthew G. Knepley closureSize += 2; 14509bf0dad6SMatthew G. Knepley fifoSize += 2; 14519bf0dad6SMatthew G. Knepley } 14529bf0dad6SMatthew G. Knepley } 14539bf0dad6SMatthew G. Knepley fifoStart += 2; 14549bf0dad6SMatthew G. Knepley } 14559bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14569bf0dad6SMatthew G. Knepley if (points) *points = closure; 14579bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14589bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14599bf0dad6SMatthew G. Knepley } 14609bf0dad6SMatthew G. Knepley 14619bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1462552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1463552f7358SJed Brown /*@C 1464552f7358SJed 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 1465552f7358SJed Brown 1466552f7358SJed Brown Not collective 1467552f7358SJed Brown 1468552f7358SJed Brown Input Parameters: 1469552f7358SJed Brown + mesh - The DMPlex 1470552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1471552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1472e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1473e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1474552f7358SJed Brown 1475552f7358SJed Brown Note: 14760298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1477552f7358SJed Brown 14783813dfbdSMatthew G Knepley Fortran Notes: 14793813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14803813dfbdSMatthew G Knepley include petsc.h90 in your code. 14813813dfbdSMatthew G Knepley 14823813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14833813dfbdSMatthew G Knepley 1484552f7358SJed Brown Level: beginner 1485552f7358SJed Brown 1486552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1487552f7358SJed Brown @*/ 1488552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1489552f7358SJed Brown { 1490552f7358SJed Brown PetscErrorCode ierr; 1491552f7358SJed Brown 1492552f7358SJed Brown PetscFunctionBegin; 1493552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1494e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1495e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1496552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14974ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1498552f7358SJed Brown PetscFunctionReturn(0); 1499552f7358SJed Brown } 1500552f7358SJed Brown 1501552f7358SJed Brown #undef __FUNCT__ 1502552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1503552f7358SJed Brown /*@ 1504552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1505552f7358SJed Brown 1506552f7358SJed Brown Not collective 1507552f7358SJed Brown 1508552f7358SJed Brown Input Parameter: 1509552f7358SJed Brown . mesh - The DMPlex 1510552f7358SJed Brown 1511552f7358SJed Brown Output Parameters: 1512552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1513552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1514552f7358SJed Brown 1515552f7358SJed Brown Level: beginner 1516552f7358SJed Brown 1517552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1518552f7358SJed Brown @*/ 1519552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1520552f7358SJed Brown { 1521552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1522552f7358SJed Brown 1523552f7358SJed Brown PetscFunctionBegin; 1524552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1525552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1526552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1527552f7358SJed Brown PetscFunctionReturn(0); 1528552f7358SJed Brown } 1529552f7358SJed Brown 1530552f7358SJed Brown #undef __FUNCT__ 1531552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1532552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1533552f7358SJed Brown { 1534552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1535552f7358SJed Brown PetscInt size; 1536552f7358SJed Brown PetscErrorCode ierr; 1537552f7358SJed Brown 1538552f7358SJed Brown PetscFunctionBegin; 1539552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1540552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1541552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15421795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15431795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1544552f7358SJed Brown if (mesh->maxSupportSize) { 1545552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1546552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15471795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1548552f7358SJed Brown } 1549552f7358SJed Brown PetscFunctionReturn(0); 1550552f7358SJed Brown } 1551552f7358SJed Brown 1552552f7358SJed Brown #undef __FUNCT__ 1553552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1554552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1555552f7358SJed Brown { 1556552f7358SJed Brown PetscErrorCode ierr; 1557552f7358SJed Brown 1558552f7358SJed Brown PetscFunctionBegin; 15594d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15604d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1561552f7358SJed Brown PetscFunctionReturn(0); 1562552f7358SJed Brown } 1563552f7358SJed Brown 1564552f7358SJed Brown #undef __FUNCT__ 1565552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1566552f7358SJed Brown /*@ 1567552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1568552f7358SJed Brown 1569552f7358SJed Brown Not collective 1570552f7358SJed Brown 1571552f7358SJed Brown Input Parameter: 1572552f7358SJed Brown . mesh - The DMPlex 1573552f7358SJed Brown 1574552f7358SJed Brown Output Parameter: 1575552f7358SJed Brown 1576552f7358SJed Brown Note: 1577552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1578552f7358SJed Brown 1579552f7358SJed Brown Level: beginner 1580552f7358SJed Brown 1581552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1582552f7358SJed Brown @*/ 1583552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1584552f7358SJed Brown { 1585552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1586552f7358SJed Brown PetscInt *offsets; 1587552f7358SJed Brown PetscInt supportSize; 1588552f7358SJed Brown PetscInt pStart, pEnd, p; 1589552f7358SJed Brown PetscErrorCode ierr; 1590552f7358SJed Brown 1591552f7358SJed Brown PetscFunctionBegin; 1592552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 159382f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1594552f7358SJed Brown /* Calculate support sizes */ 1595552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1596552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1597552f7358SJed Brown PetscInt dof, off, c; 1598552f7358SJed Brown 1599552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1600552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1601552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1602552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1603552f7358SJed Brown } 1604552f7358SJed Brown } 1605552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1606552f7358SJed Brown PetscInt dof; 1607552f7358SJed Brown 1608552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16090d644c17SKarl Rupp 1610552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1611552f7358SJed Brown } 1612552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1613552f7358SJed Brown /* Calculate supports */ 1614552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16151795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16161795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1617552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1618552f7358SJed Brown PetscInt dof, off, c; 1619552f7358SJed Brown 1620552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1621552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1622552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1623552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1624552f7358SJed Brown PetscInt offS; 1625552f7358SJed Brown 1626552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16270d644c17SKarl Rupp 1628552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1629552f7358SJed Brown ++offsets[q]; 1630552f7358SJed Brown } 1631552f7358SJed Brown } 1632552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1633552f7358SJed Brown PetscFunctionReturn(0); 1634552f7358SJed Brown } 1635552f7358SJed Brown 1636552f7358SJed Brown #undef __FUNCT__ 1637552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1638552f7358SJed Brown /*@ 1639552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1640552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1641552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1642552f7358SJed Brown the DAG. 1643552f7358SJed Brown 1644552f7358SJed Brown Not collective 1645552f7358SJed Brown 1646552f7358SJed Brown Input Parameter: 1647552f7358SJed Brown . mesh - The DMPlex 1648552f7358SJed Brown 1649552f7358SJed Brown Output Parameter: 1650552f7358SJed Brown 1651552f7358SJed Brown Notes: 1652552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1653552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1654552f7358SJed Brown 1655552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1656552f7358SJed Brown 1657552f7358SJed Brown Level: beginner 1658552f7358SJed Brown 1659552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1660552f7358SJed Brown @*/ 1661552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1662552f7358SJed Brown { 1663aa50250dSMatthew G. Knepley DMLabel label; 1664552f7358SJed Brown PetscInt pStart, pEnd, p; 1665552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1666552f7358SJed Brown PetscErrorCode ierr; 1667552f7358SJed Brown 1668552f7358SJed Brown PetscFunctionBegin; 1669552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1670552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1671552f7358SJed Brown /* Calculate depth */ 1672aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1673aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1674aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1675552f7358SJed Brown /* Initialize roots and count leaves */ 1676552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1677552f7358SJed Brown PetscInt coneSize, supportSize; 1678552f7358SJed Brown 1679552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1680552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1681552f7358SJed Brown if (!coneSize && supportSize) { 1682552f7358SJed Brown ++numRoots; 1683aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1684552f7358SJed Brown } else if (!supportSize && coneSize) { 1685552f7358SJed Brown ++numLeaves; 1686552f7358SJed Brown } else if (!supportSize && !coneSize) { 1687552f7358SJed Brown /* Isolated points */ 1688aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1689552f7358SJed Brown } 1690552f7358SJed Brown } 1691552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1692552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1693552f7358SJed Brown PetscInt coneSize, supportSize; 1694552f7358SJed Brown 1695552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1696552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1697552f7358SJed Brown if (!supportSize && coneSize) { 1698aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1699552f7358SJed Brown } 1700552f7358SJed Brown } 1701552f7358SJed Brown } else { 170274ef644bSMatthew G. Knepley IS pointIS; 170374ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1704552f7358SJed Brown 170574ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170674ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170774ef644bSMatthew G. Knepley while (numPoints) { 170874ef644bSMatthew G. Knepley const PetscInt *points; 170974ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 171074ef644bSMatthew G. Knepley 171174ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 171274ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 171374ef644bSMatthew G. Knepley const PetscInt point = points[p]; 171474ef644bSMatthew G. Knepley const PetscInt *support; 171574ef644bSMatthew G. Knepley PetscInt supportSize, s; 171674ef644bSMatthew G. Knepley 171774ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 171874ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 171974ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 172074ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1721552f7358SJed Brown } 1722552f7358SJed Brown } 17235edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 172474ef644bSMatthew G. Knepley ++level; 172574ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172674ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 172774ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 172874ef644bSMatthew G. Knepley else {numPoints = 0;} 172974ef644bSMatthew G. Knepley } 173074ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 173174ef644bSMatthew G. Knepley } 1732552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1733552f7358SJed Brown PetscFunctionReturn(0); 1734552f7358SJed Brown } 1735552f7358SJed Brown 1736552f7358SJed Brown #undef __FUNCT__ 1737552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1738552f7358SJed Brown /*@C 1739552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1740552f7358SJed Brown 1741552f7358SJed Brown Not Collective 1742552f7358SJed Brown 1743552f7358SJed Brown Input Parameters: 1744552f7358SJed Brown + dm - The DMPlex object 1745552f7358SJed Brown . numPoints - The number of input points for the join 1746552f7358SJed Brown - points - The input points 1747552f7358SJed Brown 1748552f7358SJed Brown Output Parameters: 1749552f7358SJed Brown + numCoveredPoints - The number of points in the join 1750552f7358SJed Brown - coveredPoints - The points in the join 1751552f7358SJed Brown 1752552f7358SJed Brown Level: intermediate 1753552f7358SJed Brown 1754552f7358SJed Brown Note: Currently, this is restricted to a single level join 1755552f7358SJed Brown 17563813dfbdSMatthew G Knepley Fortran Notes: 17573813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17583813dfbdSMatthew G Knepley include petsc.h90 in your code. 17593813dfbdSMatthew G Knepley 17603813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17613813dfbdSMatthew G Knepley 1762552f7358SJed Brown .keywords: mesh 1763552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1764552f7358SJed Brown @*/ 1765552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1766552f7358SJed Brown { 1767552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1768552f7358SJed Brown PetscInt *join[2]; 1769552f7358SJed Brown PetscInt joinSize, i = 0; 1770552f7358SJed Brown PetscInt dof, off, p, c, m; 1771552f7358SJed Brown PetscErrorCode ierr; 1772552f7358SJed Brown 1773552f7358SJed Brown PetscFunctionBegin; 1774552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1775552f7358SJed Brown PetscValidPointer(points, 2); 1776552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1777552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1778552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1779552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1780552f7358SJed Brown /* Copy in support of first point */ 1781552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1782552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1783552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1784552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1785552f7358SJed Brown } 1786552f7358SJed Brown /* Check each successive support */ 1787552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1788552f7358SJed Brown PetscInt newJoinSize = 0; 1789552f7358SJed Brown 1790552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1791552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1792552f7358SJed Brown for (c = 0; c < dof; ++c) { 1793552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1794552f7358SJed Brown 1795552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1796552f7358SJed Brown if (point == join[i][m]) { 1797552f7358SJed Brown join[1-i][newJoinSize++] = point; 1798552f7358SJed Brown break; 1799552f7358SJed Brown } 1800552f7358SJed Brown } 1801552f7358SJed Brown } 1802552f7358SJed Brown joinSize = newJoinSize; 1803552f7358SJed Brown i = 1-i; 1804552f7358SJed Brown } 1805552f7358SJed Brown *numCoveredPoints = joinSize; 1806552f7358SJed Brown *coveredPoints = join[i]; 1807552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1808552f7358SJed Brown PetscFunctionReturn(0); 1809552f7358SJed Brown } 1810552f7358SJed Brown 1811552f7358SJed Brown #undef __FUNCT__ 1812552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1813552f7358SJed Brown /*@C 1814552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1815552f7358SJed Brown 1816552f7358SJed Brown Not Collective 1817552f7358SJed Brown 1818552f7358SJed Brown Input Parameters: 1819552f7358SJed Brown + dm - The DMPlex object 1820552f7358SJed Brown . numPoints - The number of input points for the join 1821552f7358SJed Brown - points - The input points 1822552f7358SJed Brown 1823552f7358SJed Brown Output Parameters: 1824552f7358SJed Brown + numCoveredPoints - The number of points in the join 1825552f7358SJed Brown - coveredPoints - The points in the join 1826552f7358SJed Brown 18273813dfbdSMatthew G Knepley Fortran Notes: 18283813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18293813dfbdSMatthew G Knepley include petsc.h90 in your code. 18303813dfbdSMatthew G Knepley 18313813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18323813dfbdSMatthew G Knepley 1833552f7358SJed Brown Level: intermediate 1834552f7358SJed Brown 1835552f7358SJed Brown .keywords: mesh 1836552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1837552f7358SJed Brown @*/ 1838552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1839552f7358SJed Brown { 1840552f7358SJed Brown PetscErrorCode ierr; 1841552f7358SJed Brown 1842552f7358SJed Brown PetscFunctionBegin; 1843552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1844d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1845d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1846d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1847552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1848d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1849552f7358SJed Brown PetscFunctionReturn(0); 1850552f7358SJed Brown } 1851552f7358SJed Brown 1852552f7358SJed Brown #undef __FUNCT__ 1853552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1854552f7358SJed Brown /*@C 1855552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1856552f7358SJed Brown 1857552f7358SJed Brown Not Collective 1858552f7358SJed Brown 1859552f7358SJed Brown Input Parameters: 1860552f7358SJed Brown + dm - The DMPlex object 1861552f7358SJed Brown . numPoints - The number of input points for the join 1862552f7358SJed Brown - points - The input points 1863552f7358SJed Brown 1864552f7358SJed Brown Output Parameters: 1865552f7358SJed Brown + numCoveredPoints - The number of points in the join 1866552f7358SJed Brown - coveredPoints - The points in the join 1867552f7358SJed Brown 18683813dfbdSMatthew G Knepley Fortran Notes: 18693813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18703813dfbdSMatthew G Knepley include petsc.h90 in your code. 18713813dfbdSMatthew G Knepley 18723813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18733813dfbdSMatthew G Knepley 1874552f7358SJed Brown Level: intermediate 1875552f7358SJed Brown 1876552f7358SJed Brown .keywords: mesh 1877552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1878552f7358SJed Brown @*/ 1879552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1880552f7358SJed Brown { 1881552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1882552f7358SJed Brown PetscInt *offsets, **closures; 1883552f7358SJed Brown PetscInt *join[2]; 1884552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1885552f7358SJed Brown PetscInt p, d, c, m; 1886552f7358SJed Brown PetscErrorCode ierr; 1887552f7358SJed Brown 1888552f7358SJed Brown PetscFunctionBegin; 1889552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1890552f7358SJed Brown PetscValidPointer(points, 2); 1891552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1892552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1893552f7358SJed Brown 1894552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18951795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1896552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1897e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1898552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1899552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1900552f7358SJed Brown 1901552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1902552f7358SJed Brown PetscInt closureSize; 1903552f7358SJed Brown 1904552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 19050d644c17SKarl Rupp 1906552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1907552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1908552f7358SJed Brown PetscInt pStart, pEnd, i; 1909552f7358SJed Brown 1910552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1911552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1912552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1913552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1914552f7358SJed Brown break; 1915552f7358SJed Brown } 1916552f7358SJed Brown } 1917552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1918552f7358SJed Brown } 191982f516ccSBarry 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); 1920552f7358SJed Brown } 1921552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1922552f7358SJed Brown PetscInt dof; 1923552f7358SJed Brown 1924552f7358SJed Brown /* Copy in support of first point */ 1925552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1926552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1927552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1928552f7358SJed Brown } 1929552f7358SJed Brown /* Check each successive cone */ 1930552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1931552f7358SJed Brown PetscInt newJoinSize = 0; 1932552f7358SJed Brown 1933552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1934552f7358SJed Brown for (c = 0; c < dof; ++c) { 1935552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1936552f7358SJed Brown 1937552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1938552f7358SJed Brown if (point == join[i][m]) { 1939552f7358SJed Brown join[1-i][newJoinSize++] = point; 1940552f7358SJed Brown break; 1941552f7358SJed Brown } 1942552f7358SJed Brown } 1943552f7358SJed Brown } 1944552f7358SJed Brown joinSize = newJoinSize; 1945552f7358SJed Brown i = 1-i; 1946552f7358SJed Brown } 1947552f7358SJed Brown if (joinSize) break; 1948552f7358SJed Brown } 1949552f7358SJed Brown *numCoveredPoints = joinSize; 1950552f7358SJed Brown *coveredPoints = join[i]; 1951552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19520298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1953552f7358SJed Brown } 1954552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1955552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1956552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1957552f7358SJed Brown PetscFunctionReturn(0); 1958552f7358SJed Brown } 1959552f7358SJed Brown 1960552f7358SJed Brown #undef __FUNCT__ 1961552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1962552f7358SJed Brown /*@C 1963552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1964552f7358SJed Brown 1965552f7358SJed Brown Not Collective 1966552f7358SJed Brown 1967552f7358SJed Brown Input Parameters: 1968552f7358SJed Brown + dm - The DMPlex object 1969552f7358SJed Brown . numPoints - The number of input points for the meet 1970552f7358SJed Brown - points - The input points 1971552f7358SJed Brown 1972552f7358SJed Brown Output Parameters: 1973552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1974552f7358SJed Brown - coveredPoints - The points in the meet 1975552f7358SJed Brown 1976552f7358SJed Brown Level: intermediate 1977552f7358SJed Brown 1978552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1979552f7358SJed Brown 19803813dfbdSMatthew G Knepley Fortran Notes: 19813813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19823813dfbdSMatthew G Knepley include petsc.h90 in your code. 19833813dfbdSMatthew G Knepley 19843813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19853813dfbdSMatthew G Knepley 1986552f7358SJed Brown .keywords: mesh 1987552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1988552f7358SJed Brown @*/ 1989552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1990552f7358SJed Brown { 1991552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1992552f7358SJed Brown PetscInt *meet[2]; 1993552f7358SJed Brown PetscInt meetSize, i = 0; 1994552f7358SJed Brown PetscInt dof, off, p, c, m; 1995552f7358SJed Brown PetscErrorCode ierr; 1996552f7358SJed Brown 1997552f7358SJed Brown PetscFunctionBegin; 1998552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1999552f7358SJed Brown PetscValidPointer(points, 2); 2000552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 2001552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 2002552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2003552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2004552f7358SJed Brown /* Copy in cone of first point */ 2005552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2006552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2007552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2008552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2009552f7358SJed Brown } 2010552f7358SJed Brown /* Check each successive cone */ 2011552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2012552f7358SJed Brown PetscInt newMeetSize = 0; 2013552f7358SJed Brown 2014552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2015552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2016552f7358SJed Brown for (c = 0; c < dof; ++c) { 2017552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2018552f7358SJed Brown 2019552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2020552f7358SJed Brown if (point == meet[i][m]) { 2021552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2022552f7358SJed Brown break; 2023552f7358SJed Brown } 2024552f7358SJed Brown } 2025552f7358SJed Brown } 2026552f7358SJed Brown meetSize = newMeetSize; 2027552f7358SJed Brown i = 1-i; 2028552f7358SJed Brown } 2029552f7358SJed Brown *numCoveringPoints = meetSize; 2030552f7358SJed Brown *coveringPoints = meet[i]; 2031552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2032552f7358SJed Brown PetscFunctionReturn(0); 2033552f7358SJed Brown } 2034552f7358SJed Brown 2035552f7358SJed Brown #undef __FUNCT__ 2036552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2037552f7358SJed Brown /*@C 2038552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2039552f7358SJed Brown 2040552f7358SJed Brown Not Collective 2041552f7358SJed Brown 2042552f7358SJed Brown Input Parameters: 2043552f7358SJed Brown + dm - The DMPlex object 2044552f7358SJed Brown . numPoints - The number of input points for the meet 2045552f7358SJed Brown - points - The input points 2046552f7358SJed Brown 2047552f7358SJed Brown Output Parameters: 2048552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2049552f7358SJed Brown - coveredPoints - The points in the meet 2050552f7358SJed Brown 2051552f7358SJed Brown Level: intermediate 2052552f7358SJed Brown 20533813dfbdSMatthew G Knepley Fortran Notes: 20543813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20553813dfbdSMatthew G Knepley include petsc.h90 in your code. 20563813dfbdSMatthew G Knepley 20573813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20583813dfbdSMatthew G Knepley 2059552f7358SJed Brown .keywords: mesh 2060552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2061552f7358SJed Brown @*/ 2062552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2063552f7358SJed Brown { 2064552f7358SJed Brown PetscErrorCode ierr; 2065552f7358SJed Brown 2066552f7358SJed Brown PetscFunctionBegin; 2067552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2068d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2069d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2070d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2071552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2072d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2073552f7358SJed Brown PetscFunctionReturn(0); 2074552f7358SJed Brown } 2075552f7358SJed Brown 2076552f7358SJed Brown #undef __FUNCT__ 2077552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2078552f7358SJed Brown /*@C 2079552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2080552f7358SJed Brown 2081552f7358SJed Brown Not Collective 2082552f7358SJed Brown 2083552f7358SJed Brown Input Parameters: 2084552f7358SJed Brown + dm - The DMPlex object 2085552f7358SJed Brown . numPoints - The number of input points for the meet 2086552f7358SJed Brown - points - The input points 2087552f7358SJed Brown 2088552f7358SJed Brown Output Parameters: 2089552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2090552f7358SJed Brown - coveredPoints - The points in the meet 2091552f7358SJed Brown 2092552f7358SJed Brown Level: intermediate 2093552f7358SJed Brown 20943813dfbdSMatthew G Knepley Fortran Notes: 20953813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20963813dfbdSMatthew G Knepley include petsc.h90 in your code. 20973813dfbdSMatthew G Knepley 20983813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20993813dfbdSMatthew G Knepley 2100552f7358SJed Brown .keywords: mesh 2101552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2102552f7358SJed Brown @*/ 2103552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2104552f7358SJed Brown { 2105552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2106552f7358SJed Brown PetscInt *offsets, **closures; 2107552f7358SJed Brown PetscInt *meet[2]; 2108552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2109552f7358SJed Brown PetscInt p, h, c, m; 2110552f7358SJed Brown PetscErrorCode ierr; 2111552f7358SJed Brown 2112552f7358SJed Brown PetscFunctionBegin; 2113552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2114552f7358SJed Brown PetscValidPointer(points, 2); 2115552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2116552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2117552f7358SJed Brown 2118552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2119785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2120552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2121e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2122552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2123552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2124552f7358SJed Brown 2125552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2126552f7358SJed Brown PetscInt closureSize; 2127552f7358SJed Brown 2128552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21290d644c17SKarl Rupp 2130552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2131552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2132552f7358SJed Brown PetscInt pStart, pEnd, i; 2133552f7358SJed Brown 2134552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2135552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2136552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2137552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2138552f7358SJed Brown break; 2139552f7358SJed Brown } 2140552f7358SJed Brown } 2141552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2142552f7358SJed Brown } 214382f516ccSBarry 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); 2144552f7358SJed Brown } 2145552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2146552f7358SJed Brown PetscInt dof; 2147552f7358SJed Brown 2148552f7358SJed Brown /* Copy in cone of first point */ 2149552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2150552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2151552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2152552f7358SJed Brown } 2153552f7358SJed Brown /* Check each successive cone */ 2154552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2155552f7358SJed Brown PetscInt newMeetSize = 0; 2156552f7358SJed Brown 2157552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2158552f7358SJed Brown for (c = 0; c < dof; ++c) { 2159552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2160552f7358SJed Brown 2161552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2162552f7358SJed Brown if (point == meet[i][m]) { 2163552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2164552f7358SJed Brown break; 2165552f7358SJed Brown } 2166552f7358SJed Brown } 2167552f7358SJed Brown } 2168552f7358SJed Brown meetSize = newMeetSize; 2169552f7358SJed Brown i = 1-i; 2170552f7358SJed Brown } 2171552f7358SJed Brown if (meetSize) break; 2172552f7358SJed Brown } 2173552f7358SJed Brown *numCoveredPoints = meetSize; 2174552f7358SJed Brown *coveredPoints = meet[i]; 2175552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21760298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2177552f7358SJed Brown } 2178552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2179552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2180552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2181552f7358SJed Brown PetscFunctionReturn(0); 2182552f7358SJed Brown } 2183552f7358SJed Brown 2184552f7358SJed Brown #undef __FUNCT__ 21854e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21864e3744c5SMatthew G. Knepley /*@C 21874e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21884e3744c5SMatthew G. Knepley 21894e3744c5SMatthew G. Knepley Not Collective 21904e3744c5SMatthew G. Knepley 21914e3744c5SMatthew G. Knepley Input Parameters: 21924e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21934e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21944e3744c5SMatthew G. Knepley 21954e3744c5SMatthew G. Knepley Output Parameters: 21964e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21974e3744c5SMatthew G. Knepley 21984e3744c5SMatthew G. Knepley Level: intermediate 21994e3744c5SMatthew G. Knepley 22004e3744c5SMatthew G. Knepley Notes: 22014e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 22024e3744c5SMatthew G. Knepley 22034e3744c5SMatthew G. Knepley .keywords: mesh 22044e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 22054e3744c5SMatthew G. Knepley @*/ 22064e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22074e3744c5SMatthew G. Knepley { 22084e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22094e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22104e3744c5SMatthew G. Knepley 22114e3744c5SMatthew G. Knepley PetscFunctionBegin; 22124e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22134e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22144e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22154e3744c5SMatthew G. Knepley 22164e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22174e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22184e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22194e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22204e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22214e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22224e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22234e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22244e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22254e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22264e3744c5SMatthew G. Knepley 22274e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22284e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22294e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22304e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22314e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22324e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22334e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22344e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22354e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22364e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22374e3744c5SMatthew G. Knepley } 22384e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22394e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22404e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22414e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22424e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22434e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22444e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22454e3744c5SMatthew G. Knepley } 22464e3744c5SMatthew G. Knepley } 22474e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22484e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22494e3744c5SMatthew G. Knepley } 22504e3744c5SMatthew G. Knepley 22514e3744c5SMatthew G. Knepley #undef __FUNCT__ 225218ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 225318ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2254a6dfd86eSKarl Rupp { 225582f516ccSBarry Smith MPI_Comm comm; 2256552f7358SJed Brown PetscErrorCode ierr; 2257552f7358SJed Brown 2258552f7358SJed Brown PetscFunctionBegin; 225982f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2260552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2261552f7358SJed Brown switch (cellDim) { 2262552f7358SJed Brown case 0: 2263552f7358SJed Brown *numFaceVertices = 0; 2264552f7358SJed Brown break; 2265552f7358SJed Brown case 1: 2266552f7358SJed Brown *numFaceVertices = 1; 2267552f7358SJed Brown break; 2268552f7358SJed Brown case 2: 2269552f7358SJed Brown switch (numCorners) { 227019436ca2SJed Brown case 3: /* triangle */ 227119436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2272552f7358SJed Brown break; 227319436ca2SJed Brown case 4: /* quadrilateral */ 227419436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2275552f7358SJed Brown break; 227619436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 227719436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2278552f7358SJed Brown break; 227919436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 228019436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2281552f7358SJed Brown break; 2282552f7358SJed Brown default: 2283552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2284552f7358SJed Brown } 2285552f7358SJed Brown break; 2286552f7358SJed Brown case 3: 2287552f7358SJed Brown switch (numCorners) { 228819436ca2SJed Brown case 4: /* tetradehdron */ 228919436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2290552f7358SJed Brown break; 229119436ca2SJed Brown case 6: /* tet cohesive cells */ 229219436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2293552f7358SJed Brown break; 229419436ca2SJed Brown case 8: /* hexahedron */ 229519436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2296552f7358SJed Brown break; 229719436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 229819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2299552f7358SJed Brown break; 230019436ca2SJed Brown case 10: /* quadratic tetrahedron */ 230119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2302552f7358SJed Brown break; 230319436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 230419436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2305552f7358SJed Brown break; 230619436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 230719436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2308552f7358SJed Brown break; 230919436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 231019436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2311552f7358SJed Brown break; 2312552f7358SJed Brown default: 2313552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2314552f7358SJed Brown } 2315552f7358SJed Brown break; 2316552f7358SJed Brown default: 2317552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2318552f7358SJed Brown } 2319552f7358SJed Brown PetscFunctionReturn(0); 2320552f7358SJed Brown } 2321552f7358SJed Brown 2322552f7358SJed Brown #undef __FUNCT__ 2323d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2324d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2325d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2326d27a0f52SMatthew G. Knepley { 2327a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2328a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2329a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2330d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2331d27a0f52SMatthew G. Knepley 2332d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2333d27a0f52SMatthew G. Knepley /* Truth Table 2334d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2335d27a0f52SMatthew G. Knepley F 0 flips no F F F 2336d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2337d27a0f52SMatthew G. Knepley F 2 flips no T F T 2338d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2339d27a0f52SMatthew G. Knepley T 1 flip no 2340d27a0f52SMatthew G. Knepley T 2 flips yes 2341d27a0f52SMatthew G. Knepley */ 2342a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2343d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2344a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2345d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2346a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2347a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2348a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2349a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2350a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2351a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2352785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2353a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2354a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2355defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2356a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2357a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2358a1b4d4a2SMatthew G. Knepley 2359a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2360a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2361a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2362a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2363a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2364a1b4d4a2SMatthew G. Knepley } 2365a1b4d4a2SMatthew G. Knepley } 2366a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2367a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2368d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2369a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2370d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2371d27a0f52SMatthew G. Knepley 2372a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2373a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2374a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2375d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2376d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2377a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 237886cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2379a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 238086cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2381d27a0f52SMatthew G. Knepley 2382d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2383d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2384d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2385d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2386d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2387d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2388a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2389a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2390a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2391a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2392a1b4d4a2SMatthew G. Knepley } 2393a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2394a1b4d4a2SMatthew 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); 2395a1b4d4a2SMatthew G. Knepley } 2396a1b4d4a2SMatthew 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]); 2397a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2398a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2399a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2400a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2401a1b4d4a2SMatthew G. Knepley } 2402a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2403a1b4d4a2SMatthew 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); 2404a1b4d4a2SMatthew G. Knepley } 2405a1b4d4a2SMatthew 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]); 2406d27a0f52SMatthew G. Knepley 2407d27a0f52SMatthew G. Knepley if (dim == 1) { 2408d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2409d27a0f52SMatthew G. Knepley } else { 2410d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2411d27a0f52SMatthew G. Knepley } 2412d27a0f52SMatthew G. Knepley 2413d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2414d27a0f52SMatthew 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]); 2415d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2416a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2417d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2418a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2419d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 242086cff514SMatthew 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"); 2421a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2422a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2423d27a0f52SMatthew G. Knepley } 2424fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2425fedde076SMatthew G. Knepley { 2426fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2427fedde076SMatthew G. Knepley PetscSF sf; 2428fedde076SMatthew G. Knepley const PetscInt *lpoints; 2429fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 243013048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2431fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2432a1b4d4a2SMatthew G. Knepley 2433fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2434fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2435fedde076SMatthew G. Knepley if (numLeaves >= 0) { 243662ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 243762ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 243862ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 243913048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 244062ad4a6aSMatthew G. Knepley 2441fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2442fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2443fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2444fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2445fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2446fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2447fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2448fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2449fedde076SMatthew G. Knepley PetscInt supportSize; 2450fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2451fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2452fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2453fedde076SMatthew G. Knepley } 2454fedde076SMatthew G. Knepley } 2455fedde076SMatthew G. Knepley } 245613048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2457fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2458fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2459fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2460fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2461fedde076SMatthew G. Knepley 2462fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 246362ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2464fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2465fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24665b7033fcSMatthew G. Knepley if (dim == 1) { 24675b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24685b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24695b7033fcSMatthew G. Knepley } else { 2470fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2471fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2472fedde076SMatthew G. Knepley } 24735b7033fcSMatthew G. Knepley } 2474fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2475fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2476fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2477fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2478fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2479fedde076SMatthew G. Knepley 248013048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 248113048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 248213048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2483fedde076SMatthew G. Knepley } 248413048561SMatthew G. Knepley /* Collect the graph on 0 */ 248513048561SMatthew G. Knepley { 248613048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 248713048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 248813048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 248913048561SMatthew G. Knepley PetscInt *adj = NULL; 249013048561SMatthew G. Knepley PetscBool *val = NULL; 249113048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 249213048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 249313048561SMatthew G. Knepley PetscInt debug = 0; 249413048561SMatthew G. Knepley 249513048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 249613048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 249713048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 249813048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 249913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250013048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 250113048561SMatthew G. Knepley } 250213048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 250313048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 250413048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 250513048561SMatthew G. Knepley if (debug) { 250613048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250713048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 250813048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 250913048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 251013048561SMatthew G. Knepley } 251113048561SMatthew G. Knepley } 251213048561SMatthew G. Knepley } 251313048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 251413048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 251513048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 251613048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 251713048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 251813048561SMatthew G. Knepley pTop = pBottom = 0; 251913048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 252013048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 252113048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 252213048561SMatthew G. Knepley procFIFO[pBottom++] = p; 252313048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 252413048561SMatthew G. Knepley /* Consider each proc in FIFO */ 252513048561SMatthew G. Knepley while (pTop < pBottom) { 252613048561SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch; 252713048561SMatthew G. Knepley 252813048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252913048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 253013048561SMatthew G. Knepley /* Loop over neighboring procs */ 253113048561SMatthew G. Knepley for (n = 0; n < recvcounts[proc]; ++n) { 253213048561SMatthew G. Knepley nproc = adj[displs[proc]+n]; 253313048561SMatthew G. Knepley mismatch = val[displs[proc]+n] ? 0 : 1; 253413048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 253513048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 253613048561SMatthew G. Knepley 253713048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253813048561SMatthew G. Knepley if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc); 253913048561SMatthew G. Knepley if (!flippedB) { 254013048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 254113048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 254213048561SMatthew 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"); 254313048561SMatthew G. Knepley if (!seen) { 254413048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 254513048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 254613048561SMatthew G. Knepley } 254713048561SMatthew G. Knepley } 254813048561SMatthew G. Knepley } 254913048561SMatthew G. Knepley } 255013048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 255113048561SMatthew G. Knepley 255213048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 255313048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 255413048561SMatthew G. Knepley { 255513048561SMatthew G. Knepley PetscBool *flips; 255613048561SMatthew G. Knepley 255713048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255813048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255913048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 256013048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 256113048561SMatthew G. Knepley } 256213048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 256313048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 256413048561SMatthew G. Knepley } 256513048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256613048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256713048561SMatthew G. Knepley } 256813048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2569fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 257013048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2571fedde076SMatthew G. Knepley } 2572fedde076SMatthew G. Knepley } 2573fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2574d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2575d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2576d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2577a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2578f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2579f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2580d27a0f52SMatthew G. Knepley 2581a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2582a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2583a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2584a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2585a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2586a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2587a1b4d4a2SMatthew G. Knepley 2588a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2589a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2590a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2591d27a0f52SMatthew G. Knepley } 2592a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2593a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2594f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2595f4e909fcSMatthew G. Knepley faceSize = coneSize; 2596f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2597f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2598f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2599f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2600f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2601f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2602f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2603f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2604f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2605f4e909fcSMatthew G. Knepley } 2606f4e909fcSMatthew G. Knepley } 2607d27a0f52SMatthew G. Knepley } 2608d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2609d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2610d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2611a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2612a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2613a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2614d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2615d27a0f52SMatthew G. Knepley } 2616d27a0f52SMatthew G. Knepley 2617d27a0f52SMatthew G. Knepley #undef __FUNCT__ 26189db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26199db3b87dSMatthew G. Knepley /*@C 26209db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26219db3b87dSMatthew G. Knepley 26229db3b87dSMatthew G. Knepley Input Parameters: 26239db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26249db3b87dSMatthew G. Knepley - cone - The incoming cone 26259db3b87dSMatthew G. Knepley 26269db3b87dSMatthew G. Knepley Output Parameter: 26279db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26289db3b87dSMatthew G. Knepley 26299db3b87dSMatthew G. Knepley Level: developer 26309db3b87dSMatthew G. Knepley 26319db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26329db3b87dSMatthew G. Knepley @*/ 26339db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26342e1b13c2SMatthew G. Knepley { 26359db3b87dSMatthew G. Knepley int tmpc; 26362e1b13c2SMatthew G. Knepley 26372e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26389db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26399db3b87dSMatthew G. Knepley switch (numCorners) { 26409db3b87dSMatthew G. Knepley case 4: 26411885f254SMatthew G. Knepley tmpc = cone[0]; 26421885f254SMatthew G. Knepley cone[0] = cone[1]; 26431885f254SMatthew G. Knepley cone[1] = tmpc; 26449db3b87dSMatthew G. Knepley break; 26459db3b87dSMatthew G. Knepley case 8: 26469db3b87dSMatthew G. Knepley tmpc = cone[1]; 26479db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26489db3b87dSMatthew G. Knepley cone[3] = tmpc; 26499db3b87dSMatthew G. Knepley break; 26509db3b87dSMatthew G. Knepley default: break; 26519db3b87dSMatthew G. Knepley } 26529db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26539db3b87dSMatthew G. Knepley } 26549db3b87dSMatthew G. Knepley 26559db3b87dSMatthew G. Knepley #undef __FUNCT__ 26569db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26579db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26589db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26599db3b87dSMatthew G. Knepley { 26609db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26619db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26629db3b87dSMatthew G. Knepley 26639db3b87dSMatthew G. Knepley PetscFunctionBegin; 26649db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26659db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26662e1b13c2SMatthew G. Knepley } 26672e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26682e1b13c2SMatthew G. Knepley } 26692e1b13c2SMatthew G. Knepley 2670519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2671552f7358SJed Brown #include <triangle.h> 2672552f7358SJed Brown 2673552f7358SJed Brown #undef __FUNCT__ 2674552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 26750adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 26760adebc6cSBarry Smith { 2677552f7358SJed Brown PetscFunctionBegin; 2678552f7358SJed Brown inputCtx->numberofpoints = 0; 2679552f7358SJed Brown inputCtx->numberofpointattributes = 0; 26800298fd71SBarry Smith inputCtx->pointlist = NULL; 26810298fd71SBarry Smith inputCtx->pointattributelist = NULL; 26820298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2683552f7358SJed Brown inputCtx->numberofsegments = 0; 26840298fd71SBarry Smith inputCtx->segmentlist = NULL; 26850298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2686552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 26870298fd71SBarry Smith inputCtx->trianglelist = NULL; 2688552f7358SJed Brown inputCtx->numberofholes = 0; 26890298fd71SBarry Smith inputCtx->holelist = NULL; 2690552f7358SJed Brown inputCtx->numberofregions = 0; 26910298fd71SBarry Smith inputCtx->regionlist = NULL; 2692552f7358SJed Brown PetscFunctionReturn(0); 2693552f7358SJed Brown } 2694552f7358SJed Brown 2695552f7358SJed Brown #undef __FUNCT__ 2696552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 26970adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 26980adebc6cSBarry Smith { 2699552f7358SJed Brown PetscFunctionBegin; 2700552f7358SJed Brown outputCtx->numberofpoints = 0; 27010298fd71SBarry Smith outputCtx->pointlist = NULL; 27020298fd71SBarry Smith outputCtx->pointattributelist = NULL; 27030298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2704552f7358SJed Brown outputCtx->numberoftriangles = 0; 27050298fd71SBarry Smith outputCtx->trianglelist = NULL; 27060298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27070298fd71SBarry Smith outputCtx->neighborlist = NULL; 27080298fd71SBarry Smith outputCtx->segmentlist = NULL; 27090298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2710552f7358SJed Brown outputCtx->numberofedges = 0; 27110298fd71SBarry Smith outputCtx->edgelist = NULL; 27120298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2713552f7358SJed Brown PetscFunctionReturn(0); 2714552f7358SJed Brown } 2715552f7358SJed Brown 2716552f7358SJed Brown #undef __FUNCT__ 2717552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27180adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27190adebc6cSBarry Smith { 2720552f7358SJed Brown PetscFunctionBegin; 272123b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2722552f7358SJed Brown free(outputCtx->pointmarkerlist); 272323b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 272423b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2725552f7358SJed Brown free(outputCtx->edgelist); 2726552f7358SJed Brown free(outputCtx->edgemarkerlist); 2727552f7358SJed Brown free(outputCtx->trianglelist); 2728552f7358SJed Brown free(outputCtx->neighborlist); 2729552f7358SJed Brown PetscFunctionReturn(0); 2730552f7358SJed Brown } 2731552f7358SJed Brown 2732552f7358SJed Brown #undef __FUNCT__ 2733552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2734552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2735552f7358SJed Brown { 273682f516ccSBarry Smith MPI_Comm comm; 2737552f7358SJed Brown PetscInt dim = 2; 2738552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2739552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2740552f7358SJed Brown struct triangulateio in; 2741552f7358SJed Brown struct triangulateio out; 2742552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2743552f7358SJed Brown PetscMPIInt rank; 2744552f7358SJed Brown PetscErrorCode ierr; 2745552f7358SJed Brown 2746552f7358SJed Brown PetscFunctionBegin; 274782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2748552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2749552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2750552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2751552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27520d644c17SKarl Rupp 2753552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2754552f7358SJed Brown if (in.numberofpoints > 0) { 2755552f7358SJed Brown PetscSection coordSection; 2756552f7358SJed Brown Vec coordinates; 2757552f7358SJed Brown PetscScalar *array; 2758552f7358SJed Brown 2759785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2760785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2761552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 276269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2763552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2764552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2765552f7358SJed Brown const PetscInt idx = v - vStart; 2766552f7358SJed Brown PetscInt off, d; 2767552f7358SJed Brown 2768552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2769552f7358SJed Brown for (d = 0; d < dim; ++d) { 2770552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2771552f7358SJed Brown } 2772552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2773552f7358SJed Brown } 2774552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2775552f7358SJed Brown } 2776552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2777552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2778552f7358SJed Brown if (in.numberofsegments > 0) { 2779785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2780785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2781552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2782552f7358SJed Brown const PetscInt idx = e - eStart; 2783552f7358SJed Brown const PetscInt *cone; 2784552f7358SJed Brown 2785552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 27860d644c17SKarl Rupp 2787552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2788552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 27890d644c17SKarl Rupp 2790552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2791552f7358SJed Brown } 2792552f7358SJed Brown } 2793552f7358SJed Brown #if 0 /* Do not currently support holes */ 2794552f7358SJed Brown PetscReal *holeCoords; 2795552f7358SJed Brown PetscInt h, d; 2796552f7358SJed Brown 2797552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2798552f7358SJed Brown if (in.numberofholes > 0) { 2799785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2800552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2801552f7358SJed Brown for (d = 0; d < dim; ++d) { 2802552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2803552f7358SJed Brown } 2804552f7358SJed Brown } 2805552f7358SJed Brown } 2806552f7358SJed Brown #endif 2807552f7358SJed Brown if (!rank) { 2808552f7358SJed Brown char args[32]; 2809552f7358SJed Brown 2810552f7358SJed Brown /* Take away 'Q' for verbose output */ 2811552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2812552f7358SJed Brown if (createConvexHull) { 2813552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2814552f7358SJed Brown } 2815552f7358SJed Brown if (constrained) { 2816552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2817552f7358SJed Brown } 28180298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2819552f7358SJed Brown } 2820552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2821552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2822552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2823552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2824552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2825552f7358SJed Brown 2826552f7358SJed Brown { 2827552f7358SJed Brown const PetscInt numCorners = 3; 2828552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2829552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2830552f7358SJed Brown const int *cells = out.trianglelist; 2831552f7358SJed Brown const double *meshCoords = out.pointlist; 2832552f7358SJed Brown 28330fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2834552f7358SJed Brown /* Set labels */ 2835552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2836552f7358SJed Brown if (out.pointmarkerlist[v]) { 2837552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2838552f7358SJed Brown } 2839552f7358SJed Brown } 2840552f7358SJed Brown if (interpolate) { 2841552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2842552f7358SJed Brown if (out.edgemarkerlist[e]) { 2843552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2844552f7358SJed Brown const PetscInt *edges; 2845552f7358SJed Brown PetscInt numEdges; 2846552f7358SJed Brown 2847552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2848552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2849552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2850552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2851552f7358SJed Brown } 2852552f7358SJed Brown } 2853552f7358SJed Brown } 2854552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2855552f7358SJed Brown } 2856552f7358SJed Brown #if 0 /* Do not currently support holes */ 2857552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2858552f7358SJed Brown #endif 2859552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2860552f7358SJed Brown PetscFunctionReturn(0); 2861552f7358SJed Brown } 2862552f7358SJed Brown 2863552f7358SJed Brown #undef __FUNCT__ 2864552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2865552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2866552f7358SJed Brown { 286782f516ccSBarry Smith MPI_Comm comm; 2868552f7358SJed Brown PetscInt dim = 2; 2869552f7358SJed Brown struct triangulateio in; 2870552f7358SJed Brown struct triangulateio out; 2871552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2872552f7358SJed Brown PetscMPIInt rank; 2873552f7358SJed Brown PetscErrorCode ierr; 2874552f7358SJed Brown 2875552f7358SJed Brown PetscFunctionBegin; 287682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2877552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2878552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2879552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2880552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2881552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2882552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 28830d644c17SKarl Rupp 2884552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2885552f7358SJed Brown if (in.numberofpoints > 0) { 2886552f7358SJed Brown PetscSection coordSection; 2887552f7358SJed Brown Vec coordinates; 2888552f7358SJed Brown PetscScalar *array; 2889552f7358SJed Brown 2890785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2891785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2892552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 289369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2894552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2895552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2896552f7358SJed Brown const PetscInt idx = v - vStart; 2897552f7358SJed Brown PetscInt off, d; 2898552f7358SJed Brown 2899552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2900552f7358SJed Brown for (d = 0; d < dim; ++d) { 2901552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2902552f7358SJed Brown } 2903552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2904552f7358SJed Brown } 2905552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2906552f7358SJed Brown } 2907552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29080d644c17SKarl Rupp 2909552f7358SJed Brown in.numberofcorners = 3; 2910552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29110d644c17SKarl Rupp 2912552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2913552f7358SJed Brown if (in.numberoftriangles > 0) { 2914785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2915552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2916552f7358SJed Brown const PetscInt idx = c - cStart; 29170298fd71SBarry Smith PetscInt *closure = NULL; 2918552f7358SJed Brown PetscInt closureSize; 2919552f7358SJed Brown 2920552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2921552f7358SJed 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); 2922552f7358SJed Brown for (v = 0; v < 3; ++v) { 2923552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2924552f7358SJed Brown } 2925552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2926552f7358SJed Brown } 2927552f7358SJed Brown } 2928552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2929552f7358SJed Brown #if 0 /* Do not currently support holes */ 2930552f7358SJed Brown PetscReal *holeCoords; 2931552f7358SJed Brown PetscInt h, d; 2932552f7358SJed Brown 2933552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2934552f7358SJed Brown if (in.numberofholes > 0) { 2935785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2936552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2937552f7358SJed Brown for (d = 0; d < dim; ++d) { 2938552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2939552f7358SJed Brown } 2940552f7358SJed Brown } 2941552f7358SJed Brown } 2942552f7358SJed Brown #endif 2943552f7358SJed Brown if (!rank) { 2944552f7358SJed Brown char args[32]; 2945552f7358SJed Brown 2946552f7358SJed Brown /* Take away 'Q' for verbose output */ 2947552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29480298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2949552f7358SJed Brown } 2950552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2951552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2952552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2953552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2954552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2955552f7358SJed Brown 2956552f7358SJed Brown { 2957552f7358SJed Brown const PetscInt numCorners = 3; 2958552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2959552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2960552f7358SJed Brown const int *cells = out.trianglelist; 2961552f7358SJed Brown const double *meshCoords = out.pointlist; 2962552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2963552f7358SJed Brown 29640fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2965552f7358SJed Brown /* Set labels */ 2966552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2967552f7358SJed Brown if (out.pointmarkerlist[v]) { 2968552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2969552f7358SJed Brown } 2970552f7358SJed Brown } 2971552f7358SJed Brown if (interpolate) { 2972552f7358SJed Brown PetscInt e; 2973552f7358SJed Brown 2974552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2975552f7358SJed Brown if (out.edgemarkerlist[e]) { 2976552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2977552f7358SJed Brown const PetscInt *edges; 2978552f7358SJed Brown PetscInt numEdges; 2979552f7358SJed Brown 2980552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2981552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2982552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2983552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2984552f7358SJed Brown } 2985552f7358SJed Brown } 2986552f7358SJed Brown } 2987552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 2988552f7358SJed Brown } 2989552f7358SJed Brown #if 0 /* Do not currently support holes */ 2990552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2991552f7358SJed Brown #endif 2992552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2993552f7358SJed Brown PetscFunctionReturn(0); 2994552f7358SJed Brown } 2995552f7358SJed Brown #endif 2996552f7358SJed Brown 2997519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 2998552f7358SJed Brown #include <tetgen.h> 2999552f7358SJed Brown #undef __FUNCT__ 3000552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 3001552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 3002552f7358SJed Brown { 300382f516ccSBarry Smith MPI_Comm comm; 3004552f7358SJed Brown const PetscInt dim = 3; 3005552f7358SJed Brown ::tetgenio in; 3006552f7358SJed Brown ::tetgenio out; 3007552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3008552f7358SJed Brown PetscMPIInt rank; 3009552f7358SJed Brown PetscErrorCode ierr; 3010552f7358SJed Brown 3011552f7358SJed Brown PetscFunctionBegin; 301282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3013552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3014552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3015552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3016552f7358SJed Brown if (in.numberofpoints > 0) { 3017552f7358SJed Brown PetscSection coordSection; 3018552f7358SJed Brown Vec coordinates; 3019552f7358SJed Brown PetscScalar *array; 3020552f7358SJed Brown 3021552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3022552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30230d644c17SKarl Rupp 3024552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 302569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3026552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3027552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3028552f7358SJed Brown const PetscInt idx = v - vStart; 3029552f7358SJed Brown PetscInt off, d; 3030552f7358SJed Brown 3031552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 30320d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3033552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3034552f7358SJed Brown } 3035552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3036552f7358SJed Brown } 3037552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30380d644c17SKarl Rupp 3039552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3040552f7358SJed Brown if (in.numberoffacets > 0) { 3041552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3042552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3043552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3044552f7358SJed Brown const PetscInt idx = f - fStart; 30450298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3046552f7358SJed Brown 3047552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3048552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3049552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3050552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3051552f7358SJed Brown 3052552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3053552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3054552f7358SJed Brown const PetscInt point = points[p]; 30550d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3056552f7358SJed Brown } 3057552f7358SJed Brown 3058552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3059552f7358SJed Brown poly->numberofvertices = numVertices; 3060552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3061552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3062552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3063552f7358SJed Brown poly->vertexlist[v] = vIdx; 3064552f7358SJed Brown } 3065552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3066552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3067552f7358SJed Brown } 3068552f7358SJed Brown } 3069552f7358SJed Brown if (!rank) { 3070552f7358SJed Brown char args[32]; 3071552f7358SJed Brown 3072552f7358SJed Brown /* Take away 'Q' for verbose output */ 3073552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3074552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3075552f7358SJed Brown } 3076552f7358SJed Brown { 3077552f7358SJed Brown const PetscInt numCorners = 4; 3078552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3079552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3080552f7358SJed Brown const double *meshCoords = out.pointlist; 30811d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3082552f7358SJed Brown 30839db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 30840fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3085552f7358SJed Brown /* Set labels */ 3086552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3087552f7358SJed Brown if (out.pointmarkerlist[v]) { 3088552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3089552f7358SJed Brown } 3090552f7358SJed Brown } 3091552f7358SJed Brown if (interpolate) { 3092552f7358SJed Brown PetscInt e; 3093552f7358SJed Brown 3094552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3095552f7358SJed Brown if (out.edgemarkerlist[e]) { 3096552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3097552f7358SJed Brown const PetscInt *edges; 3098552f7358SJed Brown PetscInt numEdges; 3099552f7358SJed Brown 3100552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3101552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3102552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3103552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3104552f7358SJed Brown } 3105552f7358SJed Brown } 3106552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3107552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3108552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3109552f7358SJed Brown const PetscInt *faces; 3110552f7358SJed Brown PetscInt numFaces; 3111552f7358SJed Brown 3112552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3113552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3114552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3115552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3116552f7358SJed Brown } 3117552f7358SJed Brown } 3118552f7358SJed Brown } 3119552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3120552f7358SJed Brown } 3121552f7358SJed Brown PetscFunctionReturn(0); 3122552f7358SJed Brown } 3123552f7358SJed Brown 3124552f7358SJed Brown #undef __FUNCT__ 3125552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3126552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3127552f7358SJed Brown { 312882f516ccSBarry Smith MPI_Comm comm; 3129552f7358SJed Brown const PetscInt dim = 3; 3130552f7358SJed Brown ::tetgenio in; 3131552f7358SJed Brown ::tetgenio out; 3132552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3133552f7358SJed Brown PetscMPIInt rank; 3134552f7358SJed Brown PetscErrorCode ierr; 3135552f7358SJed Brown 3136552f7358SJed Brown PetscFunctionBegin; 313782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3138552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3139552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3140552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3141552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31420d644c17SKarl Rupp 3143552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3144552f7358SJed Brown if (in.numberofpoints > 0) { 3145552f7358SJed Brown PetscSection coordSection; 3146552f7358SJed Brown Vec coordinates; 3147552f7358SJed Brown PetscScalar *array; 3148552f7358SJed Brown 3149552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3150552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31510d644c17SKarl Rupp 3152552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 315369d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3154552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3155552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3156552f7358SJed Brown const PetscInt idx = v - vStart; 3157552f7358SJed Brown PetscInt off, d; 3158552f7358SJed Brown 3159552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 31600d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3161552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3162552f7358SJed Brown } 3163552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3164552f7358SJed Brown } 3165552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31660d644c17SKarl Rupp 3167552f7358SJed Brown in.numberofcorners = 4; 3168552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3169552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3170552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3171552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3172552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3173552f7358SJed Brown const PetscInt idx = c - cStart; 31740298fd71SBarry Smith PetscInt *closure = NULL; 3175552f7358SJed Brown PetscInt closureSize; 3176552f7358SJed Brown 3177552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3178552f7358SJed 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); 3179552f7358SJed Brown for (v = 0; v < 4; ++v) { 3180552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3181552f7358SJed Brown } 3182552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3183552f7358SJed Brown } 3184552f7358SJed Brown } 318519436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3186552f7358SJed Brown if (!rank) { 3187552f7358SJed Brown char args[32]; 3188552f7358SJed Brown 3189552f7358SJed Brown /* Take away 'Q' for verbose output */ 319019436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3191552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3192552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3193552f7358SJed Brown } 3194552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3195552f7358SJed Brown 3196552f7358SJed Brown { 3197552f7358SJed Brown const PetscInt numCorners = 4; 3198552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3199552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3200552f7358SJed Brown const double *meshCoords = out.pointlist; 32011d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 32021d4b4d7bSJed Brown 3203552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3204552f7358SJed Brown 32059db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32060fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3207552f7358SJed Brown /* Set labels */ 3208552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3209552f7358SJed Brown if (out.pointmarkerlist[v]) { 3210552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3211552f7358SJed Brown } 3212552f7358SJed Brown } 3213552f7358SJed Brown if (interpolate) { 3214552f7358SJed Brown PetscInt e, f; 3215552f7358SJed Brown 3216552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3217552f7358SJed Brown if (out.edgemarkerlist[e]) { 3218552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3219552f7358SJed Brown const PetscInt *edges; 3220552f7358SJed Brown PetscInt numEdges; 3221552f7358SJed Brown 3222552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3223552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3224552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3225552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3226552f7358SJed Brown } 3227552f7358SJed Brown } 3228552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3229552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3230552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3231552f7358SJed Brown const PetscInt *faces; 3232552f7358SJed Brown PetscInt numFaces; 3233552f7358SJed Brown 3234552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3235552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3236552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3237552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3238552f7358SJed Brown } 3239552f7358SJed Brown } 3240552f7358SJed Brown } 3241552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3242552f7358SJed Brown } 3243552f7358SJed Brown PetscFunctionReturn(0); 3244552f7358SJed Brown } 3245552f7358SJed Brown #endif 3246552f7358SJed Brown 3247519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3248aaa7dc30SBarry Smith #include <ctetgen.h> 3249552f7358SJed Brown 3250552f7358SJed Brown #undef __FUNCT__ 3251552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3252552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3253552f7358SJed Brown { 325482f516ccSBarry Smith MPI_Comm comm; 3255552f7358SJed Brown const PetscInt dim = 3; 3256552f7358SJed Brown PLC *in, *out; 3257552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3258552f7358SJed Brown PetscMPIInt rank; 3259552f7358SJed Brown PetscErrorCode ierr; 3260552f7358SJed Brown 3261552f7358SJed Brown PetscFunctionBegin; 326282f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32630298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3264552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3265552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3266552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3267552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32680d644c17SKarl Rupp 3269552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3270552f7358SJed Brown if (in->numberofpoints > 0) { 3271552f7358SJed Brown PetscSection coordSection; 3272552f7358SJed Brown Vec coordinates; 3273552f7358SJed Brown PetscScalar *array; 3274552f7358SJed Brown 3275785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3276785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3277552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 327869d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3279552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3280552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3281552f7358SJed Brown const PetscInt idx = v - vStart; 3282552f7358SJed Brown PetscInt off, d, m; 3283552f7358SJed Brown 3284552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3285552f7358SJed Brown for (d = 0; d < dim; ++d) { 3286552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3287552f7358SJed Brown } 3288552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 32890d644c17SKarl Rupp 3290552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3291552f7358SJed Brown } 3292552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3293552f7358SJed Brown } 3294552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 32950d644c17SKarl Rupp 3296552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3297552f7358SJed Brown if (in->numberoffacets > 0) { 3298785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3299785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3300552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3301552f7358SJed Brown const PetscInt idx = f - fStart; 33020298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3303552f7358SJed Brown polygon *poly; 3304552f7358SJed Brown 3305552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33060d644c17SKarl Rupp 3307785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33080d644c17SKarl Rupp 3309552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33100298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3311552f7358SJed Brown 3312552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3313552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3314552f7358SJed Brown const PetscInt point = points[p]; 33150d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3316552f7358SJed Brown } 3317552f7358SJed Brown 3318552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3319552f7358SJed Brown poly->numberofvertices = numVertices; 3320785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3321552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3322552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3323552f7358SJed Brown poly->vertexlist[v] = vIdx; 3324552f7358SJed Brown } 3325552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3326552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3327552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3328552f7358SJed Brown } 3329552f7358SJed Brown } 3330552f7358SJed Brown if (!rank) { 3331552f7358SJed Brown TetGenOpts t; 3332552f7358SJed Brown 3333552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3334552f7358SJed Brown t.in = boundary; /* Should go away */ 3335552f7358SJed Brown t.plc = 1; 3336552f7358SJed Brown t.quality = 1; 3337552f7358SJed Brown t.edgesout = 1; 3338552f7358SJed Brown t.zeroindex = 1; 3339552f7358SJed Brown t.quiet = 1; 3340552f7358SJed Brown t.verbose = verbose; 3341552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3342552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3343552f7358SJed Brown } 3344552f7358SJed Brown { 3345552f7358SJed Brown const PetscInt numCorners = 4; 3346552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3347552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3348552f7358SJed Brown const double *meshCoords = out->pointlist; 33491d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3350552f7358SJed Brown 33519db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33520fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3353552f7358SJed Brown /* Set labels */ 3354552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3355552f7358SJed Brown if (out->pointmarkerlist[v]) { 3356552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3357552f7358SJed Brown } 3358552f7358SJed Brown } 3359552f7358SJed Brown if (interpolate) { 3360552f7358SJed Brown PetscInt e; 3361552f7358SJed Brown 3362552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3363552f7358SJed Brown if (out->edgemarkerlist[e]) { 3364552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3365552f7358SJed Brown const PetscInt *edges; 3366552f7358SJed Brown PetscInt numEdges; 3367552f7358SJed Brown 3368552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3369552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3370552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3371552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3372552f7358SJed Brown } 3373552f7358SJed Brown } 3374552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3375552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3376552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3377552f7358SJed Brown const PetscInt *faces; 3378552f7358SJed Brown PetscInt numFaces; 3379552f7358SJed Brown 3380552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3381552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3382552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3383552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3384552f7358SJed Brown } 3385552f7358SJed Brown } 3386552f7358SJed Brown } 3387552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3388552f7358SJed Brown } 3389552f7358SJed Brown 3390552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3391552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3392552f7358SJed Brown PetscFunctionReturn(0); 3393552f7358SJed Brown } 3394552f7358SJed Brown 3395552f7358SJed Brown #undef __FUNCT__ 3396552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3397552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3398552f7358SJed Brown { 339982f516ccSBarry Smith MPI_Comm comm; 3400552f7358SJed Brown const PetscInt dim = 3; 3401552f7358SJed Brown PLC *in, *out; 3402552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3403552f7358SJed Brown PetscMPIInt rank; 3404552f7358SJed Brown PetscErrorCode ierr; 3405552f7358SJed Brown 3406552f7358SJed Brown PetscFunctionBegin; 340782f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34080298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3409552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3410552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3411552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3412552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3413552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3414552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34150d644c17SKarl Rupp 3416552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3417552f7358SJed Brown if (in->numberofpoints > 0) { 3418552f7358SJed Brown PetscSection coordSection; 3419552f7358SJed Brown Vec coordinates; 3420552f7358SJed Brown PetscScalar *array; 3421552f7358SJed Brown 3422785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3423785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3424552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 342569d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3426552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3427552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3428552f7358SJed Brown const PetscInt idx = v - vStart; 3429552f7358SJed Brown PetscInt off, d, m; 3430552f7358SJed Brown 3431552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3432552f7358SJed Brown for (d = 0; d < dim; ++d) { 3433552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3434552f7358SJed Brown } 3435552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34360d644c17SKarl Rupp 3437552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3438552f7358SJed Brown } 3439552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3440552f7358SJed Brown } 3441552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34420d644c17SKarl Rupp 3443552f7358SJed Brown in->numberofcorners = 4; 3444552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3445552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3446552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3447785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3448552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3449552f7358SJed Brown const PetscInt idx = c - cStart; 34500298fd71SBarry Smith PetscInt *closure = NULL; 3451552f7358SJed Brown PetscInt closureSize; 3452552f7358SJed Brown 3453552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3454552f7358SJed 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); 3455552f7358SJed Brown for (v = 0; v < 4; ++v) { 3456552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3457552f7358SJed Brown } 3458552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3459552f7358SJed Brown } 3460552f7358SJed Brown } 3461552f7358SJed Brown if (!rank) { 3462552f7358SJed Brown TetGenOpts t; 3463552f7358SJed Brown 3464552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34650d644c17SKarl Rupp 3466552f7358SJed Brown t.in = dm; /* Should go away */ 3467552f7358SJed Brown t.refine = 1; 3468552f7358SJed Brown t.varvolume = 1; 3469552f7358SJed Brown t.quality = 1; 3470552f7358SJed Brown t.edgesout = 1; 3471552f7358SJed Brown t.zeroindex = 1; 3472552f7358SJed Brown t.quiet = 1; 3473552f7358SJed Brown t.verbose = verbose; /* Change this */ 34740d644c17SKarl Rupp 3475552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3476552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3477552f7358SJed Brown } 3478552f7358SJed Brown { 3479552f7358SJed Brown const PetscInt numCorners = 4; 3480552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3481552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3482552f7358SJed Brown const double *meshCoords = out->pointlist; 34831d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3484552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3485552f7358SJed Brown 34869db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 34870fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3488552f7358SJed Brown /* Set labels */ 3489552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3490552f7358SJed Brown if (out->pointmarkerlist[v]) { 3491552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3492552f7358SJed Brown } 3493552f7358SJed Brown } 3494552f7358SJed Brown if (interpolate) { 3495552f7358SJed Brown PetscInt e, f; 3496552f7358SJed Brown 3497552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3498552f7358SJed Brown if (out->edgemarkerlist[e]) { 3499552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3500552f7358SJed Brown const PetscInt *edges; 3501552f7358SJed Brown PetscInt numEdges; 3502552f7358SJed Brown 3503552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3504552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3505552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3506552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3507552f7358SJed Brown } 3508552f7358SJed Brown } 3509552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3510552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3511552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3512552f7358SJed Brown const PetscInt *faces; 3513552f7358SJed Brown PetscInt numFaces; 3514552f7358SJed Brown 3515552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3516552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3517552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3518552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3519552f7358SJed Brown } 3520552f7358SJed Brown } 3521552f7358SJed Brown } 3522552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3523552f7358SJed Brown } 3524552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3525552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3526552f7358SJed Brown PetscFunctionReturn(0); 3527552f7358SJed Brown } 3528552f7358SJed Brown #endif 3529552f7358SJed Brown 3530552f7358SJed Brown #undef __FUNCT__ 3531552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3532552f7358SJed Brown /*@C 3533552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3534552f7358SJed Brown 3535552f7358SJed Brown Not Collective 3536552f7358SJed Brown 3537552f7358SJed Brown Input Parameters: 3538552f7358SJed Brown + boundary - The DMPlex boundary object 3539552f7358SJed Brown . name - The mesh generation package name 3540552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3541552f7358SJed Brown 3542552f7358SJed Brown Output Parameter: 3543552f7358SJed Brown . mesh - The DMPlex object 3544552f7358SJed Brown 3545552f7358SJed Brown Level: intermediate 3546552f7358SJed Brown 3547552f7358SJed Brown .keywords: mesh, elements 3548552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3549552f7358SJed Brown @*/ 3550552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3551552f7358SJed Brown { 3552552f7358SJed Brown PetscInt dim; 3553552f7358SJed Brown char genname[1024]; 3554552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3555552f7358SJed Brown PetscErrorCode ierr; 3556552f7358SJed Brown 3557552f7358SJed Brown PetscFunctionBegin; 3558552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3559552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3560552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 3561552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35620d644c17SKarl Rupp if (flg) name = genname; 3563552f7358SJed Brown if (name) { 3564552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3565552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3566552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3567552f7358SJed Brown } 3568552f7358SJed Brown switch (dim) { 3569552f7358SJed Brown case 1: 3570552f7358SJed Brown if (!name || isTriangle) { 3571519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3572552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3573552f7358SJed Brown #else 357482f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3575552f7358SJed Brown #endif 357682f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3577552f7358SJed Brown break; 3578552f7358SJed Brown case 2: 3579552f7358SJed Brown if (!name || isCTetgen) { 3580519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3581552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3582552f7358SJed Brown #else 358382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3584552f7358SJed Brown #endif 3585552f7358SJed Brown } else if (isTetgen) { 3586519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3587552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3588552f7358SJed Brown #else 358982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3590552f7358SJed Brown #endif 359182f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3592552f7358SJed Brown break; 3593552f7358SJed Brown default: 359482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3595552f7358SJed Brown } 3596552f7358SJed Brown PetscFunctionReturn(0); 3597552f7358SJed Brown } 3598552f7358SJed Brown 3599552f7358SJed Brown #undef __FUNCT__ 3600552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3601552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3602552f7358SJed Brown { 3603552f7358SJed Brown PetscReal refinementLimit; 3604552f7358SJed Brown PetscInt dim, cStart, cEnd; 36050298fd71SBarry Smith char genname[1024], *name = NULL; 3606552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3607552f7358SJed Brown PetscErrorCode ierr; 3608552f7358SJed Brown 3609552f7358SJed Brown PetscFunctionBegin; 3610552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3611552f7358SJed Brown if (isUniform) { 3612552f7358SJed Brown CellRefiner cellRefiner; 3613552f7358SJed Brown 3614509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3615509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 3616552f7358SJed Brown PetscFunctionReturn(0); 3617552f7358SJed Brown } 3618552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3619552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3620552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3621552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3622552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36230d644c17SKarl Rupp if (flg) name = genname; 3624552f7358SJed Brown if (name) { 3625552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3626552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3627552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3628552f7358SJed Brown } 3629552f7358SJed Brown switch (dim) { 3630552f7358SJed Brown case 2: 3631552f7358SJed Brown if (!name || isTriangle) { 3632519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3633552f7358SJed Brown double *maxVolumes; 3634552f7358SJed Brown PetscInt c; 3635552f7358SJed Brown 3636785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36370d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3638552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36396b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3640552f7358SJed Brown #else 364182f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3642552f7358SJed Brown #endif 364382f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3644552f7358SJed Brown break; 3645552f7358SJed Brown case 3: 3646552f7358SJed Brown if (!name || isCTetgen) { 3647519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3648552f7358SJed Brown PetscReal *maxVolumes; 3649552f7358SJed Brown PetscInt c; 3650552f7358SJed Brown 3651785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36520d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3653552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3654552f7358SJed Brown #else 365582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3656552f7358SJed Brown #endif 3657552f7358SJed Brown } else if (isTetgen) { 3658519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3659552f7358SJed Brown double *maxVolumes; 3660552f7358SJed Brown PetscInt c; 3661552f7358SJed Brown 3662785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36630d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3664552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3665552f7358SJed Brown #else 366682f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3667552f7358SJed Brown #endif 366882f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3669552f7358SJed Brown break; 3670552f7358SJed Brown default: 367182f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3672552f7358SJed Brown } 3673552f7358SJed Brown PetscFunctionReturn(0); 3674552f7358SJed Brown } 3675552f7358SJed Brown 3676552f7358SJed Brown #undef __FUNCT__ 36770a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 36780a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 36790a6ba040SMatthew G. Knepley { 36800a6ba040SMatthew G. Knepley DM cdm = dm; 36810a6ba040SMatthew G. Knepley PetscInt r; 36820a6ba040SMatthew G. Knepley PetscBool isUniform; 36830a6ba040SMatthew G. Knepley PetscErrorCode ierr; 36840a6ba040SMatthew G. Knepley 36850a6ba040SMatthew G. Knepley PetscFunctionBegin; 36860a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 36870a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 36880a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 36890a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 36900a6ba040SMatthew G. Knepley 36910a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 36920a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 36930a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 36940a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 36950a6ba040SMatthew G. Knepley } 36960a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 36970a6ba040SMatthew G. Knepley } 36980a6ba040SMatthew G. Knepley 36990a6ba040SMatthew G. Knepley #undef __FUNCT__ 37000a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 37010a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 37020a6ba040SMatthew G. Knepley { 37030a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3704549a8adaSMatthew G. Knepley PetscErrorCode ierr; 37050a6ba040SMatthew G. Knepley 37060a6ba040SMatthew G. Knepley PetscFunctionBegin; 3707549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37080a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37090a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37100a6ba040SMatthew G. Knepley } 37110a6ba040SMatthew G. Knepley 37120a6ba040SMatthew G. Knepley #undef __FUNCT__ 3713aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3714552f7358SJed Brown /*@ 3715aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3716552f7358SJed Brown 3717552f7358SJed Brown Not Collective 3718552f7358SJed Brown 3719aa50250dSMatthew G. Knepley Input Parameter: 3720552f7358SJed Brown . dm - The DMPlex object 3721552f7358SJed Brown 3722aa50250dSMatthew G. Knepley Output Parameter: 3723aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3724552f7358SJed Brown 3725552f7358SJed Brown Level: developer 3726552f7358SJed Brown 3727aa50250dSMatthew G. Knepley .keywords: mesh, points 3728aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3729aa50250dSMatthew G. Knepley @*/ 3730aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3731aa50250dSMatthew G. Knepley { 3732aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3733aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3734aa50250dSMatthew G. Knepley 3735aa50250dSMatthew G. Knepley PetscFunctionBegin; 3736aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3737aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 373863d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3739aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3740aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3741aa50250dSMatthew G. Knepley } 3742aa50250dSMatthew G. Knepley 3743aa50250dSMatthew G. Knepley #undef __FUNCT__ 3744aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3745aa50250dSMatthew G. Knepley /*@ 3746aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3747aa50250dSMatthew G. Knepley 3748aa50250dSMatthew G. Knepley Not Collective 3749aa50250dSMatthew G. Knepley 3750aa50250dSMatthew G. Knepley Input Parameter: 3751aa50250dSMatthew G. Knepley . dm - The DMPlex object 3752aa50250dSMatthew G. Knepley 3753aa50250dSMatthew G. Knepley Output Parameter: 3754aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3755aa50250dSMatthew G. Knepley 3756aa50250dSMatthew G. Knepley Level: developer 3757552f7358SJed Brown 3758552f7358SJed Brown .keywords: mesh, points 3759aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3760552f7358SJed Brown @*/ 3761552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3762552f7358SJed Brown { 3763aa50250dSMatthew G. Knepley DMLabel label; 3764aa50250dSMatthew G. Knepley PetscInt d = 0; 3765552f7358SJed Brown PetscErrorCode ierr; 3766552f7358SJed Brown 3767552f7358SJed Brown PetscFunctionBegin; 3768552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3769552f7358SJed Brown PetscValidPointer(depth, 2); 3770aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3771aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3772552f7358SJed Brown *depth = d-1; 3773552f7358SJed Brown PetscFunctionReturn(0); 3774552f7358SJed Brown } 3775552f7358SJed Brown 3776552f7358SJed Brown #undef __FUNCT__ 3777552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3778552f7358SJed Brown /*@ 3779552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3780552f7358SJed Brown 3781552f7358SJed Brown Not Collective 3782552f7358SJed Brown 3783552f7358SJed Brown Input Parameters: 3784552f7358SJed Brown + dm - The DMPlex object 3785552f7358SJed Brown - stratumValue - The requested depth 3786552f7358SJed Brown 3787552f7358SJed Brown Output Parameters: 3788552f7358SJed Brown + start - The first point at this depth 3789552f7358SJed Brown - end - One beyond the last point at this depth 3790552f7358SJed Brown 3791552f7358SJed Brown Level: developer 3792552f7358SJed Brown 3793552f7358SJed Brown .keywords: mesh, points 3794552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3795552f7358SJed Brown @*/ 37960adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 37970adebc6cSBarry Smith { 3798aa50250dSMatthew G. Knepley DMLabel label; 379963d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3800552f7358SJed Brown PetscErrorCode ierr; 3801552f7358SJed Brown 3802552f7358SJed Brown PetscFunctionBegin; 3803552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 380463d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 380563d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3806552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 38070d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 380863d1a920SMatthew G. Knepley if (stratumValue < 0) { 380963d1a920SMatthew G. Knepley if (start) *start = pStart; 381063d1a920SMatthew G. Knepley if (end) *end = pEnd; 381163d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3812552f7358SJed Brown } 3813aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 381463d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 381563d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3816552f7358SJed Brown PetscFunctionReturn(0); 3817552f7358SJed Brown } 3818552f7358SJed Brown 3819552f7358SJed Brown #undef __FUNCT__ 3820552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3821552f7358SJed Brown /*@ 3822552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3823552f7358SJed Brown 3824552f7358SJed Brown Not Collective 3825552f7358SJed Brown 3826552f7358SJed Brown Input Parameters: 3827552f7358SJed Brown + dm - The DMPlex object 3828552f7358SJed Brown - stratumValue - The requested height 3829552f7358SJed Brown 3830552f7358SJed Brown Output Parameters: 3831552f7358SJed Brown + start - The first point at this height 3832552f7358SJed Brown - end - One beyond the last point at this height 3833552f7358SJed Brown 3834552f7358SJed Brown Level: developer 3835552f7358SJed Brown 3836552f7358SJed Brown .keywords: mesh, points 3837552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3838552f7358SJed Brown @*/ 38390adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 38400adebc6cSBarry Smith { 3841aa50250dSMatthew G. Knepley DMLabel label; 384263d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 3843552f7358SJed Brown PetscErrorCode ierr; 3844552f7358SJed Brown 3845552f7358SJed Brown PetscFunctionBegin; 3846552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 384763d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 384863d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3849552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 38500d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 385163d1a920SMatthew G. Knepley if (stratumValue < 0) { 385263d1a920SMatthew G. Knepley if (start) *start = pStart; 385363d1a920SMatthew G. Knepley if (end) *end = pEnd; 385463d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3855552f7358SJed Brown } 3856aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3857aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 385863d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 385963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3860552f7358SJed Brown PetscFunctionReturn(0); 3861552f7358SJed Brown } 3862552f7358SJed Brown 3863552f7358SJed Brown #undef __FUNCT__ 3864552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 3865552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 3866a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 3867a6dfd86eSKarl Rupp { 3868552f7358SJed Brown PetscInt *numDofTot; 3869916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 3870916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 3871552f7358SJed Brown PetscErrorCode ierr; 3872552f7358SJed Brown 3873552f7358SJed Brown PetscFunctionBegin; 3874785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 3875552f7358SJed Brown for (d = 0; d <= dim; ++d) { 3876552f7358SJed Brown numDofTot[d] = 0; 38770d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 3878552f7358SJed Brown } 387982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 3880552f7358SJed Brown if (numFields > 0) { 3881552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 3882552f7358SJed Brown if (numComp) { 3883552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3884552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 3885552f7358SJed Brown } 3886552f7358SJed Brown } 3887552f7358SJed Brown } 3888552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3889552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 3890916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3891916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 3892916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 3893916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 3894552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3895552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3896552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 3897552f7358SJed Brown } 3898552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 3899552f7358SJed Brown } 3900552f7358SJed Brown } 3901552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 3902552f7358SJed Brown PetscFunctionReturn(0); 3903552f7358SJed Brown } 3904552f7358SJed Brown 3905552f7358SJed Brown #undef __FUNCT__ 3906552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 3907552f7358SJed Brown /* Set the number of dof on each point and separate by fields 3908552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 3909552f7358SJed Brown */ 3910a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 3911a6dfd86eSKarl Rupp { 3912552f7358SJed Brown PetscInt numFields; 3913552f7358SJed Brown PetscInt bc; 3914552f7358SJed Brown PetscErrorCode ierr; 3915552f7358SJed Brown 3916552f7358SJed Brown PetscFunctionBegin; 3917552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3918552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 3919552f7358SJed Brown PetscInt field = 0; 3920552f7358SJed Brown const PetscInt *idx; 3921552f7358SJed Brown PetscInt n, i; 3922552f7358SJed Brown 39230d644c17SKarl Rupp if (numFields) field = bcField[bc]; 3924552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 3925552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 3926552f7358SJed Brown for (i = 0; i < n; ++i) { 3927552f7358SJed Brown const PetscInt p = idx[i]; 3928552f7358SJed Brown PetscInt numConst = constDof; 3929552f7358SJed Brown 3930552f7358SJed Brown /* Constrain every dof on the point */ 3931552f7358SJed Brown if (numConst < 0) { 3932552f7358SJed Brown if (numFields) { 3933552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 3934552f7358SJed Brown } else { 3935552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 3936552f7358SJed Brown } 3937552f7358SJed Brown } 3938552f7358SJed Brown if (numFields) { 3939552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 3940552f7358SJed Brown } 3941552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 3942552f7358SJed Brown } 3943552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 3944552f7358SJed Brown } 3945552f7358SJed Brown PetscFunctionReturn(0); 3946552f7358SJed Brown } 3947552f7358SJed Brown 3948552f7358SJed Brown #undef __FUNCT__ 3949552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 3950552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 39510adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 39520adebc6cSBarry Smith { 3953552f7358SJed Brown PetscInt *maxConstraints; 3954552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 3955552f7358SJed Brown PetscErrorCode ierr; 3956552f7358SJed Brown 3957552f7358SJed Brown PetscFunctionBegin; 3958552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3959552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3960785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 39610d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 3962552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3963552f7358SJed Brown PetscInt cdof; 3964552f7358SJed Brown 3965552f7358SJed Brown if (numFields) { 3966552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3967552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 3968552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 3969552f7358SJed Brown } 3970552f7358SJed Brown } else { 3971552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3972552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 3973552f7358SJed Brown } 3974552f7358SJed Brown } 3975552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3976552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 3977552f7358SJed Brown } 3978552f7358SJed Brown if (maxConstraints[numFields]) { 3979552f7358SJed Brown PetscInt *indices; 3980552f7358SJed Brown 3981785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 3982552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3983552f7358SJed Brown PetscInt cdof, d; 3984552f7358SJed Brown 3985552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3986552f7358SJed Brown if (cdof) { 3987552f7358SJed 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]); 3988552f7358SJed Brown if (numFields) { 3989552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3990552f7358SJed Brown 3991552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3992552f7358SJed Brown PetscInt cfdof, fdof; 3993552f7358SJed Brown 3994552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3995552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 3996552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 39970d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 3998552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 39990d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 4000552f7358SJed Brown numConst += cfdof; 4001552f7358SJed Brown foff += fdof; 4002552f7358SJed Brown } 4003552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4004552f7358SJed Brown } else { 40050d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4006552f7358SJed Brown } 4007552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4008552f7358SJed Brown } 4009552f7358SJed Brown } 4010552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4011552f7358SJed Brown } 4012552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4013552f7358SJed Brown PetscFunctionReturn(0); 4014552f7358SJed Brown } 4015552f7358SJed Brown 4016552f7358SJed Brown #undef __FUNCT__ 4017552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4018552f7358SJed Brown /* Set the constrained field indices on each point */ 40190adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 40200adebc6cSBarry Smith { 4021552f7358SJed Brown const PetscInt *points, *indices; 4022552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4023552f7358SJed Brown PetscErrorCode ierr; 4024552f7358SJed Brown 4025552f7358SJed Brown PetscFunctionBegin; 4026552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4027552f7358SJed 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); 4028552f7358SJed Brown 4029552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4030552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4031552f7358SJed Brown if (!constraintIndices) { 4032552f7358SJed Brown PetscInt *idx, i; 4033552f7358SJed Brown 4034552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4035785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 40360d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4037552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4038552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4039552f7358SJed Brown } 4040552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4041552f7358SJed Brown } else { 4042552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4043552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4044552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4045552f7358SJed Brown PetscInt fcdof; 4046552f7358SJed Brown 4047552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 404882f516ccSBarry 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); 4049552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4050552f7358SJed Brown } 4051552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4052552f7358SJed Brown } 4053552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4054552f7358SJed Brown PetscFunctionReturn(0); 4055552f7358SJed Brown } 4056552f7358SJed Brown 4057552f7358SJed Brown #undef __FUNCT__ 4058552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4059552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 40600adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 40610adebc6cSBarry Smith { 4062552f7358SJed Brown PetscInt *indices; 4063552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4064552f7358SJed Brown PetscErrorCode ierr; 4065552f7358SJed Brown 4066552f7358SJed Brown PetscFunctionBegin; 4067552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4068785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4069552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 407082f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4071552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4072552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4073552f7358SJed Brown PetscInt cdof, d; 4074552f7358SJed Brown 4075552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4076552f7358SJed Brown if (cdof) { 4077552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4078552f7358SJed Brown 4079552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4080552f7358SJed Brown const PetscInt *fcind; 4081552f7358SJed Brown PetscInt fdof, fcdof; 4082552f7358SJed Brown 4083552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4084552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4085552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4086552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 40870d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4088552f7358SJed Brown foff += fdof; 4089552f7358SJed Brown numConst += fcdof; 4090552f7358SJed Brown } 409182f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4092552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4093552f7358SJed Brown } 4094552f7358SJed Brown } 4095552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4096552f7358SJed Brown PetscFunctionReturn(0); 4097552f7358SJed Brown } 4098552f7358SJed Brown 4099552f7358SJed Brown #undef __FUNCT__ 4100552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4101552f7358SJed Brown /*@C 4102552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4103552f7358SJed Brown 4104552f7358SJed Brown Not Collective 4105552f7358SJed Brown 4106552f7358SJed Brown Input Parameters: 4107552f7358SJed Brown + dm - The DMPlex object 4108552f7358SJed Brown . dim - The spatial dimension of the problem 4109552f7358SJed Brown . numFields - The number of fields in the problem 4110552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4111552f7358SJed 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 4112552f7358SJed Brown . numBC - The number of boundary conditions 4113552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4114552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4115552f7358SJed Brown 4116552f7358SJed Brown Output Parameter: 4117552f7358SJed Brown . section - The PetscSection object 4118552f7358SJed Brown 4119552f7358SJed 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 4120552f7358SJed Brown nubmer of dof for field 0 on each edge. 4121552f7358SJed Brown 4122552f7358SJed Brown Level: developer 4123552f7358SJed Brown 41243813dfbdSMatthew G Knepley Fortran Notes: 41253813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 41263813dfbdSMatthew G Knepley 4127552f7358SJed Brown .keywords: mesh, elements 4128552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4129552f7358SJed Brown @*/ 4130a6dfd86eSKarl 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) 4131a6dfd86eSKarl Rupp { 4132552f7358SJed Brown PetscErrorCode ierr; 4133552f7358SJed Brown 4134552f7358SJed Brown PetscFunctionBegin; 4135552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4136552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4137552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4138552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4139ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4140552f7358SJed Brown PetscFunctionReturn(0); 4141552f7358SJed Brown } 4142552f7358SJed Brown 4143552f7358SJed Brown #undef __FUNCT__ 4144552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 41450adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 41460adebc6cSBarry Smith { 4147552f7358SJed Brown PetscSection section; 4148552f7358SJed Brown PetscErrorCode ierr; 4149552f7358SJed Brown 4150552f7358SJed Brown PetscFunctionBegin; 415138221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 415282f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4153552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 41541d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4155552f7358SJed Brown PetscFunctionReturn(0); 4156552f7358SJed Brown } 4157552f7358SJed Brown 4158552f7358SJed Brown #undef __FUNCT__ 4159552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 41600adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 41610adebc6cSBarry Smith { 4162552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4163552f7358SJed Brown 4164552f7358SJed Brown PetscFunctionBegin; 4165552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4166552f7358SJed Brown if (section) *section = mesh->coneSection; 4167552f7358SJed Brown PetscFunctionReturn(0); 4168552f7358SJed Brown } 4169552f7358SJed Brown 4170552f7358SJed Brown #undef __FUNCT__ 41718cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 41728cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 41738cb4d582SMatthew G. Knepley { 41748cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 41758cb4d582SMatthew G. Knepley 41768cb4d582SMatthew G. Knepley PetscFunctionBegin; 41778cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 41788cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 41798cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 41808cb4d582SMatthew G. Knepley } 41818cb4d582SMatthew G. Knepley 41828cb4d582SMatthew G. Knepley #undef __FUNCT__ 4183552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4184a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4185a6dfd86eSKarl Rupp { 4186552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4187552f7358SJed Brown 4188552f7358SJed Brown PetscFunctionBegin; 4189552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4190552f7358SJed Brown if (cones) *cones = mesh->cones; 4191552f7358SJed Brown PetscFunctionReturn(0); 4192552f7358SJed Brown } 4193552f7358SJed Brown 4194552f7358SJed Brown #undef __FUNCT__ 4195552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4196a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4197a6dfd86eSKarl Rupp { 4198552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4199552f7358SJed Brown 4200552f7358SJed Brown PetscFunctionBegin; 4201552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4202552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4203552f7358SJed Brown PetscFunctionReturn(0); 4204552f7358SJed Brown } 4205552f7358SJed Brown 4206552f7358SJed Brown /******************************** FEM Support **********************************/ 4207552f7358SJed Brown 4208552f7358SJed Brown #undef __FUNCT__ 42091a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 42101a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4211a6dfd86eSKarl Rupp { 4212552f7358SJed Brown PetscScalar *array, *vArray; 4213d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 42141a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4215552f7358SJed Brown PetscErrorCode ierr; 4216552f7358SJed Brown 42171b406b76SMatthew G. Knepley PetscFunctionBeginHot; 42182a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 42195a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 42205a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 42215a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 42223f7cbbe7SMatthew G. Knepley if (!values || !*values) { 42239df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 42249df71ca4SMatthew G. Knepley PetscInt dof; 4225d9917b9dSMatthew G. Knepley 42269df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 42279df71ca4SMatthew G. Knepley size += dof; 42289df71ca4SMatthew G. Knepley } 42299df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 42309df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 42312a3aaacfSMatthew G. Knepley PetscInt dof; 42325a1bb5cfSMatthew G. Knepley 42335a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 42342a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 42355a1bb5cfSMatthew G. Knepley size += dof; 42365a1bb5cfSMatthew G. Knepley } 42373f7cbbe7SMatthew G. Knepley if (!values) { 42383f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 42393f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 42403f7cbbe7SMatthew G. Knepley } 42415a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4242982e9ed1SMatthew G. Knepley } else { 4243982e9ed1SMatthew G. Knepley array = *values; 4244982e9ed1SMatthew G. Knepley } 42459df71ca4SMatthew G. Knepley size = 0; 42465a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 42479df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 42489df71ca4SMatthew G. Knepley PetscInt dof, off, d; 42499df71ca4SMatthew G. Knepley PetscScalar *varr; 4250d9917b9dSMatthew G. Knepley 42519df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 42529df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 42539df71ca4SMatthew G. Knepley varr = &vArray[off]; 42541a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 42551a271a75SMatthew G. Knepley array[offset] = varr[d]; 42569df71ca4SMatthew G. Knepley } 42579df71ca4SMatthew G. Knepley size += dof; 42589df71ca4SMatthew G. Knepley } 42599df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 42609df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 42619df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 42625a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 42635a1bb5cfSMatthew G. Knepley PetscScalar *varr; 42645a1bb5cfSMatthew G. Knepley 426552ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 42665a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 42675a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 42685a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 42695a1bb5cfSMatthew G. Knepley if (o >= 0) { 42701a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 42711a271a75SMatthew G. Knepley array[offset] = varr[d]; 42725a1bb5cfSMatthew G. Knepley } 42735a1bb5cfSMatthew G. Knepley } else { 42741a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 42751a271a75SMatthew G. Knepley array[offset] = varr[d]; 42765a1bb5cfSMatthew G. Knepley } 42775a1bb5cfSMatthew G. Knepley } 42789df71ca4SMatthew G. Knepley size += dof; 42795a1bb5cfSMatthew G. Knepley } 42805a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 42819df71ca4SMatthew G. Knepley if (!*values) { 42825a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 42835a1bb5cfSMatthew G. Knepley *values = array; 42849df71ca4SMatthew G. Knepley } else { 42859df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 42868c312ff3SMatthew G. Knepley *csize = size; 42879df71ca4SMatthew G. Knepley } 42885a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 42895a1bb5cfSMatthew G. Knepley } 4290d9917b9dSMatthew G. Knepley 4291d9917b9dSMatthew G. Knepley #undef __FUNCT__ 42921a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 42931a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 42941a271a75SMatthew G. Knepley { 42951a271a75SMatthew G. Knepley PetscInt offset = 0, p; 42961a271a75SMatthew G. Knepley PetscErrorCode ierr; 42971a271a75SMatthew G. Knepley 42981a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4299fe02ba77SJed Brown *size = 0; 43001a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 43011a271a75SMatthew G. Knepley const PetscInt point = points[p]; 43021a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 43031a271a75SMatthew G. Knepley PetscInt dof, off, d; 43041a271a75SMatthew G. Knepley const PetscScalar *varr; 43051a271a75SMatthew G. Knepley 43061a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43071a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 43081a271a75SMatthew G. Knepley varr = &vArray[off]; 43091a271a75SMatthew G. Knepley if (o >= 0) { 43101a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 43111a271a75SMatthew G. Knepley } else { 43121a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 43131a271a75SMatthew G. Knepley } 43141a271a75SMatthew G. Knepley } 43151a271a75SMatthew G. Knepley *size = offset; 43161a271a75SMatthew G. Knepley PetscFunctionReturn(0); 43171a271a75SMatthew G. Knepley } 43181a271a75SMatthew G. Knepley 43191a271a75SMatthew G. Knepley #undef __FUNCT__ 43201a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 43211a271a75SMatthew 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[]) 43221a271a75SMatthew G. Knepley { 43231a271a75SMatthew G. Knepley PetscInt offset = 0, f; 43241a271a75SMatthew G. Knepley PetscErrorCode ierr; 43251a271a75SMatthew G. Knepley 43261a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4327fe02ba77SJed Brown *size = 0; 43281a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 43291a271a75SMatthew G. Knepley PetscInt fcomp, p; 43301a271a75SMatthew G. Knepley 43311a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 43321a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 43331a271a75SMatthew G. Knepley const PetscInt point = points[p]; 43341a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 43351a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 43361a271a75SMatthew G. Knepley const PetscScalar *varr; 43371a271a75SMatthew G. Knepley 43381a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 43391a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 43401a271a75SMatthew G. Knepley varr = &vArray[foff]; 43411a271a75SMatthew G. Knepley if (o >= 0) { 43421a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 43431a271a75SMatthew G. Knepley } else { 43441a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 43451a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 43461a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 43471a271a75SMatthew G. Knepley } 43481a271a75SMatthew G. Knepley } 43491a271a75SMatthew G. Knepley } 43501a271a75SMatthew G. Knepley } 43511a271a75SMatthew G. Knepley } 43521a271a75SMatthew G. Knepley *size = offset; 43531a271a75SMatthew G. Knepley PetscFunctionReturn(0); 43541a271a75SMatthew G. Knepley } 43551a271a75SMatthew G. Knepley 43561a271a75SMatthew G. Knepley #undef __FUNCT__ 4357552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4358552f7358SJed Brown /*@C 4359552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4360552f7358SJed Brown 4361552f7358SJed Brown Not collective 4362552f7358SJed Brown 4363552f7358SJed Brown Input Parameters: 4364552f7358SJed Brown + dm - The DM 4365552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4366552f7358SJed Brown . v - The local vector 4367552f7358SJed Brown - point - The sieve point in the DM 4368552f7358SJed Brown 4369552f7358SJed Brown Output Parameters: 4370552f7358SJed Brown + csize - The number of values in the closure, or NULL 4371552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4372552f7358SJed Brown 4373552f7358SJed Brown Fortran Notes: 4374552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4375552f7358SJed Brown include petsc.h90 in your code. 4376552f7358SJed Brown 4377552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4378552f7358SJed Brown 4379552f7358SJed Brown Level: intermediate 4380552f7358SJed Brown 4381552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4382552f7358SJed Brown @*/ 4383552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4384552f7358SJed Brown { 4385552f7358SJed Brown PetscSection clSection; 4386d9917b9dSMatthew G. Knepley IS clPoints; 4387552f7358SJed Brown PetscScalar *array, *vArray; 4388552f7358SJed Brown PetscInt *points = NULL; 4389d9917b9dSMatthew G. Knepley const PetscInt *clp; 43901a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4391552f7358SJed Brown PetscErrorCode ierr; 4392552f7358SJed Brown 4393d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4394552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4395552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 43961a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 43971a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4398552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4399552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4400552f7358SJed Brown if (depth == 1 && numFields < 2) { 44011a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4402552f7358SJed Brown PetscFunctionReturn(0); 4403552f7358SJed Brown } 44041a271a75SMatthew G. Knepley /* Get points */ 4405d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4406d9917b9dSMatthew G. Knepley if (!clPoints) { 44071a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4408552f7358SJed Brown 44091a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4410552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4411552f7358SJed Brown /* Compress out points not in the section */ 4412552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4413552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4414552f7358SJed Brown points[q*2] = points[p]; 4415552f7358SJed Brown points[q*2+1] = points[p+1]; 4416552f7358SJed Brown ++q; 4417552f7358SJed Brown } 4418552f7358SJed Brown } 4419552f7358SJed Brown numPoints = q; 4420d9917b9dSMatthew G. Knepley } else { 4421d9917b9dSMatthew G. Knepley PetscInt dof, off; 4422552f7358SJed Brown 4423d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4424d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4425d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 44261a271a75SMatthew G. Knepley numPoints = dof/2; 4427d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4428552f7358SJed Brown } 44291a271a75SMatthew G. Knepley /* Get array */ 4430552f7358SJed Brown if (!values || !*values) { 44311a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4432552f7358SJed Brown 44331a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4434552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 44351a271a75SMatthew G. Knepley asize += dof; 4436552f7358SJed Brown } 4437bd6c0d32SMatthew G. Knepley if (!values) { 4438d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 44391a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 44401a271a75SMatthew G. Knepley if (csize) *csize = asize; 4441bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4442bd6c0d32SMatthew G. Knepley } 44431a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4444d0f6b257SMatthew G. Knepley } else { 4445d0f6b257SMatthew G. Knepley array = *values; 4446d0f6b257SMatthew G. Knepley } 4447552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44481a271a75SMatthew G. Knepley /* Get values */ 4449ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 44501a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 44511a271a75SMatthew G. Knepley /* Cleanup points */ 44521a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 44531a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 44541a271a75SMatthew G. Knepley /* Cleanup array */ 4455552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4456d0f6b257SMatthew G. Knepley if (!*values) { 4457552f7358SJed Brown if (csize) *csize = size; 4458552f7358SJed Brown *values = array; 4459d0f6b257SMatthew G. Knepley } else { 4460d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4461d0f6b257SMatthew G. Knepley *csize = size; 4462d0f6b257SMatthew G. Knepley } 4463552f7358SJed Brown PetscFunctionReturn(0); 4464552f7358SJed Brown } 4465552f7358SJed Brown 4466552f7358SJed Brown #undef __FUNCT__ 4467552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4468552f7358SJed Brown /*@C 4469552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4470552f7358SJed Brown 4471552f7358SJed Brown Not collective 4472552f7358SJed Brown 4473552f7358SJed Brown Input Parameters: 4474552f7358SJed Brown + dm - The DM 44750298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4476552f7358SJed Brown . v - The local vector 4477552f7358SJed Brown . point - The sieve point in the DM 44780298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4479552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4480552f7358SJed Brown 44813813dfbdSMatthew G Knepley Fortran Notes: 44823813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 44833813dfbdSMatthew G Knepley include petsc.h90 in your code. 44843813dfbdSMatthew G Knepley 44853813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 44863813dfbdSMatthew G Knepley 4487552f7358SJed Brown Level: intermediate 4488552f7358SJed Brown 4489552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4490552f7358SJed Brown @*/ 44917c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4492a6dfd86eSKarl Rupp { 4493552f7358SJed Brown PetscInt size = 0; 4494552f7358SJed Brown PetscErrorCode ierr; 4495552f7358SJed Brown 4496552f7358SJed Brown PetscFunctionBegin; 4497552f7358SJed Brown /* Should work without recalculating size */ 4498552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4499552f7358SJed Brown PetscFunctionReturn(0); 4500552f7358SJed Brown } 4501552f7358SJed Brown 4502552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4503552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4504552f7358SJed Brown 4505552f7358SJed Brown #undef __FUNCT__ 4506552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 45071a271a75SMatthew 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[]) 4508552f7358SJed Brown { 4509552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4510552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4511552f7358SJed Brown PetscScalar *a; 4512552f7358SJed Brown PetscInt off, cind = 0, k; 4513552f7358SJed Brown PetscErrorCode ierr; 4514552f7358SJed Brown 4515552f7358SJed Brown PetscFunctionBegin; 4516552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4517552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4518552f7358SJed Brown a = &array[off]; 4519552f7358SJed Brown if (!cdof || setBC) { 4520552f7358SJed Brown if (orientation >= 0) { 4521552f7358SJed Brown for (k = 0; k < dof; ++k) { 4522552f7358SJed Brown fuse(&a[k], values[k]); 4523552f7358SJed Brown } 4524552f7358SJed Brown } else { 4525552f7358SJed Brown for (k = 0; k < dof; ++k) { 4526552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4527552f7358SJed Brown } 4528552f7358SJed Brown } 4529552f7358SJed Brown } else { 4530552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4531552f7358SJed Brown if (orientation >= 0) { 4532552f7358SJed Brown for (k = 0; k < dof; ++k) { 4533552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4534552f7358SJed Brown fuse(&a[k], values[k]); 4535552f7358SJed Brown } 4536552f7358SJed Brown } else { 4537552f7358SJed Brown for (k = 0; k < dof; ++k) { 4538552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4539552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4540552f7358SJed Brown } 4541552f7358SJed Brown } 4542552f7358SJed Brown } 4543552f7358SJed Brown PetscFunctionReturn(0); 4544552f7358SJed Brown } 4545552f7358SJed Brown 4546552f7358SJed Brown #undef __FUNCT__ 4547a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 45481a271a75SMatthew 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[]) 4549a5e93ea8SMatthew G. Knepley { 4550a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4551a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4552a5e93ea8SMatthew G. Knepley PetscScalar *a; 4553a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4554a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4555a5e93ea8SMatthew G. Knepley 4556a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4557a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4558a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4559a5e93ea8SMatthew G. Knepley a = &array[off]; 4560a5e93ea8SMatthew G. Knepley if (cdof) { 4561a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4562a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4563a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4564a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4565a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4566a5e93ea8SMatthew G. Knepley ++cind; 4567a5e93ea8SMatthew G. Knepley } 4568a5e93ea8SMatthew G. Knepley } 4569a5e93ea8SMatthew G. Knepley } else { 4570a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4571a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4572a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4573a5e93ea8SMatthew G. Knepley ++cind; 4574a5e93ea8SMatthew G. Knepley } 4575a5e93ea8SMatthew G. Knepley } 4576a5e93ea8SMatthew G. Knepley } 4577a5e93ea8SMatthew G. Knepley } 4578a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4579a5e93ea8SMatthew G. Knepley } 4580a5e93ea8SMatthew G. Knepley 4581a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4582552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 45831a271a75SMatthew 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[]) 4584a6dfd86eSKarl Rupp { 4585552f7358SJed Brown PetscScalar *a; 45861a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 45871a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 45881a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4589552f7358SJed Brown PetscErrorCode ierr; 4590552f7358SJed Brown 4591552f7358SJed Brown PetscFunctionBegin; 4592552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4593552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 45941a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45951a271a75SMatthew G. Knepley a = &array[foff]; 4596552f7358SJed Brown if (!fcdof || setBC) { 45971a271a75SMatthew G. Knepley if (o >= 0) { 45981a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4599552f7358SJed Brown } else { 4600552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4601552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 46021a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4603552f7358SJed Brown } 4604552f7358SJed Brown } 4605552f7358SJed Brown } 4606552f7358SJed Brown } else { 4607552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 46081a271a75SMatthew G. Knepley if (o >= 0) { 4609552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4610552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 46111a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4612552f7358SJed Brown } 4613552f7358SJed Brown } else { 4614552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4615552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4616552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 46171a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4618552f7358SJed Brown } 4619552f7358SJed Brown } 4620552f7358SJed Brown } 4621552f7358SJed Brown } 46221a271a75SMatthew G. Knepley *offset += fdof; 4623552f7358SJed Brown PetscFunctionReturn(0); 4624552f7358SJed Brown } 4625552f7358SJed Brown 4626552f7358SJed Brown #undef __FUNCT__ 4627a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 46281a271a75SMatthew 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[]) 4629a5e93ea8SMatthew G. Knepley { 4630a5e93ea8SMatthew G. Knepley PetscScalar *a; 46311a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 46321a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 46331a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4634a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4635a5e93ea8SMatthew G. Knepley 4636a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4637a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4638a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 46391a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 46401a271a75SMatthew G. Knepley a = &array[foff]; 4641a5e93ea8SMatthew G. Knepley if (fcdof) { 4642a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 46431a271a75SMatthew G. Knepley if (o >= 0) { 4644a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4645a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 46461a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4647a5e93ea8SMatthew G. Knepley ++cind; 4648a5e93ea8SMatthew G. Knepley } 4649a5e93ea8SMatthew G. Knepley } 4650a5e93ea8SMatthew G. Knepley } else { 4651a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4652a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4653a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 46541a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4655a5e93ea8SMatthew G. Knepley ++cind; 4656a5e93ea8SMatthew G. Knepley } 4657a5e93ea8SMatthew G. Knepley } 4658a5e93ea8SMatthew G. Knepley } 4659a5e93ea8SMatthew G. Knepley } 4660a5e93ea8SMatthew G. Knepley } 46611a271a75SMatthew G. Knepley *offset += fdof; 4662a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4663a5e93ea8SMatthew G. Knepley } 4664a5e93ea8SMatthew G. Knepley 4665a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 46661b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 46671a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4668a6dfd86eSKarl Rupp { 4669552f7358SJed Brown PetscScalar *array; 46701b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 46711b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4672552f7358SJed Brown PetscErrorCode ierr; 4673552f7358SJed Brown 46741b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4675b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4676b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4677b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4678b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4679b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4680b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4681b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4682b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4683b6ebb6e6SMatthew G. Knepley 4684b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4685b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4686b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4687b6ebb6e6SMatthew G. Knepley { 4688b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4689b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4690b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4691b6ebb6e6SMatthew G. Knepley 4692b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4693b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4694b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4695b6ebb6e6SMatthew G. Knepley if (!cdof) { 4696b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4697b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4698b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4699b6ebb6e6SMatthew G. Knepley } 4700b6ebb6e6SMatthew G. Knepley } else { 4701b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4702b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4703b6ebb6e6SMatthew G. Knepley } 4704b6ebb6e6SMatthew G. Knepley } 4705b6ebb6e6SMatthew G. Knepley } else { 4706b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4707b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4708b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4709b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4710b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4711b6ebb6e6SMatthew G. Knepley } 4712b6ebb6e6SMatthew G. Knepley } else { 4713b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4714b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4715b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4716b6ebb6e6SMatthew G. Knepley } 4717b6ebb6e6SMatthew G. Knepley } 4718b6ebb6e6SMatthew G. Knepley } 4719b6ebb6e6SMatthew G. Knepley } 4720b6ebb6e6SMatthew G. Knepley } 4721b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4722b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4723b6ebb6e6SMatthew G. Knepley } 47241b406b76SMatthew G. Knepley 47251b406b76SMatthew G. Knepley #undef __FUNCT__ 47261b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 47271b406b76SMatthew G. Knepley /*@C 47281b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 47291b406b76SMatthew G. Knepley 47301b406b76SMatthew G. Knepley Not collective 47311b406b76SMatthew G. Knepley 47321b406b76SMatthew G. Knepley Input Parameters: 47331b406b76SMatthew G. Knepley + dm - The DM 47341b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 47351b406b76SMatthew G. Knepley . v - The local vector 47361b406b76SMatthew G. Knepley . point - The sieve point in the DM 47371b406b76SMatthew G. Knepley . values - The array of values 47381b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 47391b406b76SMatthew G. Knepley 47401b406b76SMatthew G. Knepley Fortran Notes: 47411b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 47421b406b76SMatthew G. Knepley 47431b406b76SMatthew G. Knepley Level: intermediate 47441b406b76SMatthew G. Knepley 47451b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 47461b406b76SMatthew G. Knepley @*/ 47471b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 47481b406b76SMatthew G. Knepley { 47491b406b76SMatthew G. Knepley PetscSection clSection; 47501b406b76SMatthew G. Knepley IS clPoints; 47511b406b76SMatthew G. Knepley PetscScalar *array; 47521b406b76SMatthew G. Knepley PetscInt *points = NULL; 47531b406b76SMatthew G. Knepley const PetscInt *clp; 47541a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 47551b406b76SMatthew G. Knepley PetscErrorCode ierr; 47561b406b76SMatthew G. Knepley 47571a271a75SMatthew G. Knepley PetscFunctionBeginHot; 47581b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 47591b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 47601a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 47611a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 47621b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 47631b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 47641b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 47651a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 47661b406b76SMatthew G. Knepley PetscFunctionReturn(0); 47671b406b76SMatthew G. Knepley } 47681a271a75SMatthew G. Knepley /* Get points */ 47691b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 47701b406b76SMatthew G. Knepley if (!clPoints) { 47711a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 47721a271a75SMatthew G. Knepley 47731a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4774552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4775552f7358SJed Brown /* Compress out points not in the section */ 4776552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4777552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4778552f7358SJed Brown points[q*2] = points[p]; 4779552f7358SJed Brown points[q*2+1] = points[p+1]; 4780552f7358SJed Brown ++q; 4781552f7358SJed Brown } 4782552f7358SJed Brown } 4783552f7358SJed Brown numPoints = q; 47841b406b76SMatthew G. Knepley } else { 47851b406b76SMatthew G. Knepley PetscInt dof, off; 4786552f7358SJed Brown 47871b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 47881b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 47891b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 47901a271a75SMatthew G. Knepley numPoints = dof/2; 47911b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4792552f7358SJed Brown } 47931a271a75SMatthew G. Knepley /* Get array */ 4794552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 47951a271a75SMatthew G. Knepley /* Get values */ 4796ef90cfe2SMatthew G. Knepley if (numFields > 0) { 47971a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4798552f7358SJed Brown for (f = 0; f < numFields; ++f) { 47991a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4800552f7358SJed Brown switch (mode) { 4801552f7358SJed Brown case INSERT_VALUES: 4802552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 48031a271a75SMatthew G. Knepley const PetscInt point = points[p]; 48041a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 48051a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4806552f7358SJed Brown } break; 4807552f7358SJed Brown case INSERT_ALL_VALUES: 4808552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 48091a271a75SMatthew G. Knepley const PetscInt point = points[p]; 48101a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 48111a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array); 4812552f7358SJed Brown } break; 4813a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4814a5e93ea8SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 48151a271a75SMatthew G. Knepley const PetscInt point = points[p]; 48161a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 48171a271a75SMatthew G. Knepley updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4818a5e93ea8SMatthew G. Knepley } break; 4819552f7358SJed Brown case ADD_VALUES: 4820552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 48211a271a75SMatthew G. Knepley const PetscInt point = points[p]; 48221a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 48231a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4824552f7358SJed Brown } break; 4825552f7358SJed Brown case ADD_ALL_VALUES: 4826552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 48271a271a75SMatthew G. Knepley const PetscInt point = points[p]; 48281a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 48291a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array); 4830552f7358SJed Brown } break; 4831552f7358SJed Brown default: 483282f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4833552f7358SJed Brown } 48341a271a75SMatthew G. Knepley } 4835552f7358SJed Brown } else { 48361a271a75SMatthew G. Knepley PetscInt dof, off; 48371a271a75SMatthew G. Knepley 4838552f7358SJed Brown switch (mode) { 4839552f7358SJed Brown case INSERT_VALUES: 4840552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4841552f7358SJed Brown PetscInt o = points[p+1]; 4842552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4843552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 4844552f7358SJed Brown } break; 4845552f7358SJed Brown case INSERT_ALL_VALUES: 4846552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4847552f7358SJed Brown PetscInt o = points[p+1]; 4848552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4849552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_TRUE, o, &values[off], array); 4850552f7358SJed Brown } break; 4851a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4852a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4853a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 4854a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4855a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 4856a5e93ea8SMatthew G. Knepley } break; 4857552f7358SJed Brown case ADD_VALUES: 4858552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4859552f7358SJed Brown PetscInt o = points[p+1]; 4860552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4861552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 4862552f7358SJed Brown } break; 4863552f7358SJed Brown case ADD_ALL_VALUES: 4864552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4865552f7358SJed Brown PetscInt o = points[p+1]; 4866552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4867552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_TRUE, o, &values[off], array); 4868552f7358SJed Brown } break; 4869552f7358SJed Brown default: 487082f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4871552f7358SJed Brown } 4872552f7358SJed Brown } 48731a271a75SMatthew G. Knepley /* Cleanup points */ 48741a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 48751a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 48761a271a75SMatthew G. Knepley /* Cleanup array */ 4877552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4878552f7358SJed Brown PetscFunctionReturn(0); 4879552f7358SJed Brown } 4880552f7358SJed Brown 4881552f7358SJed Brown #undef __FUNCT__ 4882552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 4883b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 4884552f7358SJed Brown { 4885552f7358SJed Brown PetscMPIInt rank; 4886552f7358SJed Brown PetscInt i, j; 4887552f7358SJed Brown PetscErrorCode ierr; 4888552f7358SJed Brown 4889552f7358SJed Brown PetscFunctionBegin; 489082f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 489177a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 4892b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 4893b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 4894b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 4895b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 489677a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 4897b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 4898519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 48997eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 4900552f7358SJed Brown #else 4901b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 4902552f7358SJed Brown #endif 4903552f7358SJed Brown } 490477a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 4905552f7358SJed Brown } 4906552f7358SJed Brown PetscFunctionReturn(0); 4907552f7358SJed Brown } 4908552f7358SJed Brown 4909552f7358SJed Brown #undef __FUNCT__ 4910552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 4911552f7358SJed Brown /* . off - The global offset of this point */ 4912e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4913a6dfd86eSKarl Rupp { 4914e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 4915552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4916552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4917552f7358SJed Brown PetscInt cind = 0, k; 4918552f7358SJed Brown PetscErrorCode ierr; 4919552f7358SJed Brown 4920552f7358SJed Brown PetscFunctionBegin; 4921552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 4922552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4923552f7358SJed Brown if (!cdof || setBC) { 4924552f7358SJed Brown if (orientation >= 0) { 4925e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 4926552f7358SJed Brown } else { 4927e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 4928552f7358SJed Brown } 4929552f7358SJed Brown } else { 4930552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4931552f7358SJed Brown if (orientation >= 0) { 4932552f7358SJed Brown for (k = 0; k < dof; ++k) { 4933552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4934552f7358SJed Brown /* Insert check for returning constrained indices */ 4935e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 4936552f7358SJed Brown ++cind; 4937552f7358SJed Brown } else { 4938e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 4939552f7358SJed Brown } 4940552f7358SJed Brown } 4941552f7358SJed Brown } else { 4942552f7358SJed Brown for (k = 0; k < dof; ++k) { 4943552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4944552f7358SJed Brown /* Insert check for returning constrained indices */ 4945e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 4946552f7358SJed Brown ++cind; 4947552f7358SJed Brown } else { 4948e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 4949552f7358SJed Brown } 4950552f7358SJed Brown } 4951552f7358SJed Brown } 4952552f7358SJed Brown } 4953e6ccafaeSMatthew G Knepley *loff += dof; 4954552f7358SJed Brown PetscFunctionReturn(0); 4955552f7358SJed Brown } 4956552f7358SJed Brown 4957552f7358SJed Brown #undef __FUNCT__ 4958552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 4959552f7358SJed Brown /* . off - The global offset of this point */ 4960a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4961a6dfd86eSKarl Rupp { 4962552f7358SJed Brown PetscInt numFields, foff, f; 4963552f7358SJed Brown PetscErrorCode ierr; 4964552f7358SJed Brown 4965552f7358SJed Brown PetscFunctionBegin; 4966552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4967552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 4968552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 4969552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 4970552f7358SJed Brown PetscInt cind = 0, k, c; 4971552f7358SJed Brown 4972552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4973552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4974552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 4975552f7358SJed Brown if (!cfdof || setBC) { 4976552f7358SJed Brown if (orientation >= 0) { 49770d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 4978552f7358SJed Brown } else { 4979552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4980552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4981552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 4982552f7358SJed Brown } 4983552f7358SJed Brown } 4984552f7358SJed Brown } 4985552f7358SJed Brown } else { 4986552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 4987552f7358SJed Brown if (orientation >= 0) { 4988552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4989552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 4990552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 4991552f7358SJed Brown ++cind; 4992552f7358SJed Brown } else { 4993552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 4994552f7358SJed Brown } 4995552f7358SJed Brown } 4996552f7358SJed Brown } else { 4997552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4998552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4999552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 5000552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 5001552f7358SJed Brown ++cind; 5002552f7358SJed Brown } else { 5003552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 5004552f7358SJed Brown } 5005552f7358SJed Brown } 5006552f7358SJed Brown } 5007552f7358SJed Brown } 5008552f7358SJed Brown } 5009552f7358SJed Brown foff += fdof - cfdof; 5010552f7358SJed Brown foffs[f] += fdof; 5011552f7358SJed Brown } 5012552f7358SJed Brown PetscFunctionReturn(0); 5013552f7358SJed Brown } 5014552f7358SJed Brown 5015552f7358SJed Brown #undef __FUNCT__ 5016552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 50177f5d1fdeSMatthew G. Knepley /*@C 50187f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 50197f5d1fdeSMatthew G. Knepley 50207f5d1fdeSMatthew G. Knepley Not collective 50217f5d1fdeSMatthew G. Knepley 50227f5d1fdeSMatthew G. Knepley Input Parameters: 50237f5d1fdeSMatthew G. Knepley + dm - The DM 5024ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5025ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 50267f5d1fdeSMatthew G. Knepley . A - The matrix 50277f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 50287f5d1fdeSMatthew G. Knepley . values - The array of values 50297f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 50307f5d1fdeSMatthew G. Knepley 50317f5d1fdeSMatthew G. Knepley Fortran Notes: 50327f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 50337f5d1fdeSMatthew G. Knepley 50347f5d1fdeSMatthew G. Knepley Level: intermediate 50357f5d1fdeSMatthew G. Knepley 50367f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 50377f5d1fdeSMatthew G. Knepley @*/ 50387c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5039552f7358SJed Brown { 5040552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 50411b406b76SMatthew G. Knepley PetscSection clSection; 50421b406b76SMatthew G. Knepley IS clPoints; 50430298fd71SBarry Smith PetscInt *points = NULL; 50441b406b76SMatthew G. Knepley const PetscInt *clp; 5045552f7358SJed Brown PetscInt *indices; 5046552f7358SJed Brown PetscInt offsets[32]; 5047552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5048552f7358SJed Brown PetscErrorCode ierr; 5049552f7358SJed Brown 5050552f7358SJed Brown PetscFunctionBegin; 5051552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5052ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 50533dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5054ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 50553dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 50563dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5057552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 505882f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5059552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 50601b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 50611b406b76SMatthew G. Knepley if (!clPoints) { 5062552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5063552f7358SJed Brown /* Compress out points not in the section */ 5064552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5065552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5066552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5067552f7358SJed Brown points[q*2] = points[p]; 5068552f7358SJed Brown points[q*2+1] = points[p+1]; 5069552f7358SJed Brown ++q; 5070552f7358SJed Brown } 5071552f7358SJed Brown } 5072552f7358SJed Brown numPoints = q; 50731b406b76SMatthew G. Knepley } else { 50741b406b76SMatthew G. Knepley PetscInt dof, off; 50751b406b76SMatthew G. Knepley 50761b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 50771b406b76SMatthew G. Knepley numPoints = dof/2; 50781b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 50791b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 50801b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 50811b406b76SMatthew G. Knepley } 5082552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5083552f7358SJed Brown PetscInt fdof; 5084552f7358SJed Brown 5085552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5086552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5087552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5088552f7358SJed Brown offsets[f+1] += fdof; 5089552f7358SJed Brown } 5090552f7358SJed Brown numIndices += dof; 5091552f7358SJed Brown } 50920d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 50930d644c17SKarl Rupp 509482f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5095552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5096552f7358SJed Brown if (numFields) { 5097552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5098552f7358SJed Brown PetscInt o = points[p+1]; 5099552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5100552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5101552f7358SJed Brown } 5102552f7358SJed Brown } else { 5103e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5104552f7358SJed Brown PetscInt o = points[p+1]; 5105552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5106e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5107552f7358SJed Brown } 5108552f7358SJed Brown } 5109b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5110552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5111552f7358SJed Brown if (ierr) { 5112552f7358SJed Brown PetscMPIInt rank; 5113552f7358SJed Brown PetscErrorCode ierr2; 5114552f7358SJed Brown 511582f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 511677a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5117b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 51186a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5119552f7358SJed Brown CHKERRQ(ierr); 5120552f7358SJed Brown } 51211b406b76SMatthew G. Knepley if (!clPoints) { 5122552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 51231b406b76SMatthew G. Knepley } else { 51241b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 51251b406b76SMatthew G. Knepley } 5126552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5127552f7358SJed Brown PetscFunctionReturn(0); 5128552f7358SJed Brown } 5129552f7358SJed Brown 5130552f7358SJed Brown #undef __FUNCT__ 5131de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5132de41b84cSMatthew 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) 5133de41b84cSMatthew G. Knepley { 5134de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5135de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5136de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5137de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5138de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5139de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 51404ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5141de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5142de41b84cSMatthew G. Knepley 5143de41b84cSMatthew G. Knepley PetscFunctionBegin; 5144de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5145de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5146de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5147de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5148de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5149de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5150de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5151de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5152de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5153de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5154de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5155de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5156de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5157de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5158de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5159de41b84cSMatthew G. Knepley /* Column indices */ 5160de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 51614ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5162de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5163de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5164de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5165de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5166de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5167de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5168de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5169de41b84cSMatthew G. Knepley ++q; 5170de41b84cSMatthew G. Knepley } 5171de41b84cSMatthew G. Knepley } 5172de41b84cSMatthew G. Knepley numCPoints = q; 5173de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5174de41b84cSMatthew G. Knepley PetscInt fdof; 5175de41b84cSMatthew G. Knepley 5176de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 51774ca5e9f5SMatthew G. Knepley if (!dof) continue; 5178de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5179de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5180de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5181de41b84cSMatthew G. Knepley } 5182de41b84cSMatthew G. Knepley numCIndices += dof; 5183de41b84cSMatthew G. Knepley } 5184de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5185de41b84cSMatthew G. Knepley /* Row indices */ 5186de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5187de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 51881ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5189de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5190de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5191de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5192de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5193de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5194de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5195de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 51964ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 51974ca5e9f5SMatthew G. Knepley if (!dof) continue; 51984ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 51994ca5e9f5SMatthew G. Knepley if (s < q) continue; 5200de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5201de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5202de41b84cSMatthew G. Knepley ++q; 5203de41b84cSMatthew G. Knepley } 5204de41b84cSMatthew G. Knepley } 5205de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5206de41b84cSMatthew G. Knepley } 5207de41b84cSMatthew G. Knepley numFPoints = q; 5208de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5209de41b84cSMatthew G. Knepley PetscInt fdof; 5210de41b84cSMatthew G. Knepley 5211de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 52124ca5e9f5SMatthew G. Knepley if (!dof) continue; 5213de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5214de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5215de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5216de41b84cSMatthew G. Knepley } 5217de41b84cSMatthew G. Knepley numFIndices += dof; 5218de41b84cSMatthew G. Knepley } 5219de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5220de41b84cSMatthew G. Knepley 5221de41b84cSMatthew 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); 5222de41b84cSMatthew 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); 5223de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5224de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5225de41b84cSMatthew G. Knepley if (numFields) { 5226de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5227de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5228de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5229de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5230de41b84cSMatthew G. Knepley } 5231de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5232de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5233de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5234de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5235de41b84cSMatthew G. Knepley } 5236de41b84cSMatthew G. Knepley } else { 5237de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5238de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5239de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5240de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5241de41b84cSMatthew G. Knepley } 5242de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5243de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5244de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5245de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5246de41b84cSMatthew G. Knepley } 5247de41b84cSMatthew G. Knepley } 5248de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5249de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5250de41b84cSMatthew G. Knepley if (ierr) { 5251de41b84cSMatthew G. Knepley PetscMPIInt rank; 5252de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5253de41b84cSMatthew G. Knepley 5254de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5255de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5256de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5257de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5258de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5259de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5260de41b84cSMatthew G. Knepley } 5261549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5262de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5263de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5264de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5265de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5266de41b84cSMatthew G. Knepley } 5267de41b84cSMatthew G. Knepley 5268de41b84cSMatthew G. Knepley #undef __FUNCT__ 5269770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5270f96281f8SMatthew G. Knepley /*@ 5271f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5272f96281f8SMatthew G. Knepley 5273f96281f8SMatthew G. Knepley Input Parameter: 5274f96281f8SMatthew G. Knepley . dm - The DMPlex object 5275f96281f8SMatthew G. Knepley 5276f96281f8SMatthew G. Knepley Output Parameters: 5277f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5278f96281f8SMatthew G. Knepley . cMax - The first hybrid face 5279f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 5280f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 5281f96281f8SMatthew G. Knepley 5282f96281f8SMatthew G. Knepley Level: developer 5283f96281f8SMatthew G. Knepley 5284f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 5285f96281f8SMatthew G. Knepley @*/ 5286770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5287552f7358SJed Brown { 5288552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5289770b213bSMatthew G Knepley PetscInt dim; 5290770b213bSMatthew G Knepley PetscErrorCode ierr; 5291552f7358SJed Brown 5292552f7358SJed Brown PetscFunctionBegin; 5293552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5294770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5295770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5296770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5297770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5298770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5299552f7358SJed Brown PetscFunctionReturn(0); 5300552f7358SJed Brown } 5301552f7358SJed Brown 5302552f7358SJed Brown #undef __FUNCT__ 5303770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5304770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5305552f7358SJed Brown { 5306552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5307770b213bSMatthew G Knepley PetscInt dim; 5308770b213bSMatthew G Knepley PetscErrorCode ierr; 5309552f7358SJed Brown 5310552f7358SJed Brown PetscFunctionBegin; 5311552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5312770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5313770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5314770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5315770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5316770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5317552f7358SJed Brown PetscFunctionReturn(0); 5318552f7358SJed Brown } 5319552f7358SJed Brown 5320552f7358SJed Brown #undef __FUNCT__ 5321552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5322552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5323552f7358SJed Brown { 5324552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5325552f7358SJed Brown 5326552f7358SJed Brown PetscFunctionBegin; 5327552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5328552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5329552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5330552f7358SJed Brown PetscFunctionReturn(0); 5331552f7358SJed Brown } 5332552f7358SJed Brown 5333552f7358SJed Brown #undef __FUNCT__ 5334552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5335552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5336552f7358SJed Brown { 5337552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5338552f7358SJed Brown 5339552f7358SJed Brown PetscFunctionBegin; 5340552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5341552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5342552f7358SJed Brown PetscFunctionReturn(0); 5343552f7358SJed Brown } 5344552f7358SJed Brown 5345552f7358SJed Brown #undef __FUNCT__ 5346552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5347552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5348552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 5349552f7358SJed Brown { 5350552f7358SJed Brown PetscSection section, globalSection; 5351552f7358SJed Brown PetscInt *numbers, p; 5352552f7358SJed Brown PetscErrorCode ierr; 5353552f7358SJed Brown 5354552f7358SJed Brown PetscFunctionBegin; 535582f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5356552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5357552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5358552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5359552f7358SJed Brown } 5360552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5361552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5362785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5363552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5364552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5365552f7358SJed Brown } 536682f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5367552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5368552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5369552f7358SJed Brown PetscFunctionReturn(0); 5370552f7358SJed Brown } 5371552f7358SJed Brown 5372552f7358SJed Brown #undef __FUNCT__ 5373552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5374552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5375552f7358SJed Brown { 5376552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5377552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5378552f7358SJed Brown PetscErrorCode ierr; 5379552f7358SJed Brown 5380552f7358SJed Brown PetscFunctionBegin; 5381552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5382552f7358SJed Brown if (!mesh->globalCellNumbers) { 5383552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5384552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 53850298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 53860d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5387552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5388552f7358SJed Brown } 5389552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5390552f7358SJed Brown PetscFunctionReturn(0); 5391552f7358SJed Brown } 5392552f7358SJed Brown 5393552f7358SJed Brown #undef __FUNCT__ 5394552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5395552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5396552f7358SJed Brown { 5397552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5398552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5399552f7358SJed Brown PetscErrorCode ierr; 5400552f7358SJed Brown 5401552f7358SJed Brown PetscFunctionBegin; 5402552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5403552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5404552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 54050298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 54060d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5407552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5408552f7358SJed Brown } 5409552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5410552f7358SJed Brown PetscFunctionReturn(0); 5411552f7358SJed Brown } 5412552f7358SJed Brown 5413552f7358SJed Brown 5414552f7358SJed Brown #undef __FUNCT__ 5415552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5416552f7358SJed Brown /*@C 5417552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5418552f7358SJed Brown the local section and an SF describing the section point overlap. 5419552f7358SJed Brown 5420552f7358SJed Brown Input Parameters: 5421552f7358SJed Brown + s - The PetscSection for the local field layout 5422552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5423552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5424552f7358SJed Brown . label - The label specifying the points 5425552f7358SJed Brown - labelValue - The label stratum specifying the points 5426552f7358SJed Brown 5427552f7358SJed Brown Output Parameter: 5428552f7358SJed Brown . gsection - The PetscSection for the global field layout 5429552f7358SJed Brown 5430552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5431552f7358SJed Brown 5432552f7358SJed Brown Level: developer 5433552f7358SJed Brown 5434552f7358SJed Brown .seealso: PetscSectionCreate() 5435552f7358SJed Brown @*/ 5436552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5437552f7358SJed Brown { 54387ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5439552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5440552f7358SJed Brown PetscErrorCode ierr; 5441552f7358SJed Brown 5442552f7358SJed Brown PetscFunctionBegin; 5443552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 5444552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5445552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 54467ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 54477ec39499SMatthew G. Knepley if (nroots >= 0) { 54487ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 54491795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 54507ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 54511795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 54527ec39499SMatthew G. Knepley } else { 54537ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 54547ec39499SMatthew G. Knepley } 54557ec39499SMatthew G. Knepley } 5456552f7358SJed Brown /* Mark ghost points with negative dof */ 5457552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5458552f7358SJed Brown PetscInt value; 5459552f7358SJed Brown 5460552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5461552f7358SJed Brown if (value != labelValue) continue; 5462552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5463552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5464552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5465552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 54667ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5467552f7358SJed Brown } 5468552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5469552f7358SJed Brown if (nroots >= 0) { 54707ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 54717ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5472552f7358SJed Brown if (nroots > pEnd-pStart) { 54737ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5474552f7358SJed Brown } 5475552f7358SJed Brown } 5476552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5477552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5478552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5479552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5480552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5481552f7358SJed Brown } 5482552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 5483552f7358SJed Brown globalOff -= off; 5484552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5485552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 54867ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5487552f7358SJed Brown } 5488552f7358SJed Brown /* Put in negative offsets for ghost points */ 5489552f7358SJed Brown if (nroots >= 0) { 54907ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 54917ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5492552f7358SJed Brown if (nroots > pEnd-pStart) { 54937ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5494552f7358SJed Brown } 5495552f7358SJed Brown } 54967ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5497552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5498552f7358SJed Brown PetscFunctionReturn(0); 5499552f7358SJed Brown } 5500ca8062c8SMatthew G. Knepley 5501ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5502ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5503ca8062c8SMatthew G. Knepley /*@ 5504ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5505ca8062c8SMatthew G. Knepley 5506ca8062c8SMatthew G. Knepley Input Parameters: 5507ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5508ca8062c8SMatthew G. Knepley 5509ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5510ca8062c8SMatthew G. Knepley 5511ca8062c8SMatthew G. Knepley Level: developer 5512ca8062c8SMatthew G. Knepley 55139bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5514ca8062c8SMatthew G. Knepley @*/ 5515ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5516ca8062c8SMatthew G. Knepley { 5517ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5518ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5519ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5520ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5521ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5522ca8062c8SMatthew G. Knepley 5523ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5524ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5525ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5526ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5527ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5528ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5529ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5530ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5531ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5532ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 553342e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 553442e66dfaSMatthew G. Knepley PetscInt d; 553542e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 553642e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 553742e66dfaSMatthew G. Knepley } 5538ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5539ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5540ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5541ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5542ca8062c8SMatthew G. Knepley } 554342e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5544ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5545ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5546ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5547ca8062c8SMatthew G. Knepley } 5548ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5549ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5550ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5551ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5552ca8062c8SMatthew G. Knepley } 5553ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 555442e66dfaSMatthew G. Knepley if (dup) { 555542e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 555642e66dfaSMatthew G. Knepley } else { 5557ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5558ca8062c8SMatthew G. Knepley } 5559ca8062c8SMatthew G. Knepley } 556042e66dfaSMatthew G. Knepley } 5561ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5562ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5563ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5564ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5565ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5566ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5567ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5568ca8062c8SMatthew G. Knepley } 5569ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5570ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5571ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5572ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5573ca8062c8SMatthew G. Knepley } 5574ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5575ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5576ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5577ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5578ca8062c8SMatthew G. Knepley } 5579ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5580ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5581ca8062c8SMatthew G. Knepley } 5582ca8062c8SMatthew G. Knepley } 5583ca8062c8SMatthew G. Knepley } 5584ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5585ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5586ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5587ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5588ca8062c8SMatthew G. Knepley } 5589ca8062c8SMatthew G. Knepley 5590ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5591ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5592ca8062c8SMatthew G. Knepley /*@ 5593ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5594ca8062c8SMatthew G. Knepley 5595ca8062c8SMatthew G. Knepley Input Parameters: 5596ca8062c8SMatthew G. Knepley + dm - The DMPlex object 559758723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 559858723a97SMatthew G. Knepley - cellHeight - Normally 0 5599ca8062c8SMatthew G. Knepley 5600ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5601ca8062c8SMatthew G. Knepley 5602ca8062c8SMatthew G. Knepley Level: developer 5603ca8062c8SMatthew G. Knepley 56049bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5605ca8062c8SMatthew G. Knepley @*/ 560658723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5607ca8062c8SMatthew G. Knepley { 560842363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5609ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5610ca8062c8SMatthew G. Knepley 5611ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5612ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5613ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5614ca8062c8SMatthew G. Knepley switch (dim) { 561542363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 561642363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 561742363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5618ca8062c8SMatthew G. Knepley default: 5619ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5620ca8062c8SMatthew G. Knepley } 562158723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 562258723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5623ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5624ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5625ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 562658723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 562758723a97SMatthew G. Knepley 562858723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 562958723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 563058723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 563158723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 563258723a97SMatthew G. Knepley } 563358723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5634ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5635ca8062c8SMatthew G. Knepley } 563642363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 563742363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 563842363296SMatthew G. Knepley 563942363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 564042363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 564142363296SMatthew G. Knepley const PetscInt p = closure[cl]; 564242363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 564342363296SMatthew G. Knepley } 564442363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 564542363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 564642363296SMatthew G. Knepley } 5647ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5648ca8062c8SMatthew G. Knepley } 56499bf0dad6SMatthew G. Knepley 56509bf0dad6SMatthew G. Knepley #undef __FUNCT__ 56519bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 56529bf0dad6SMatthew G. Knepley /*@ 56539bf0dad6SMatthew 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 56549bf0dad6SMatthew G. Knepley 56559bf0dad6SMatthew G. Knepley Input Parameters: 56569bf0dad6SMatthew G. Knepley + dm - The DMPlex object 56579bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 56589bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 56599bf0dad6SMatthew G. Knepley 56609bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 56619bf0dad6SMatthew G. Knepley 56629bf0dad6SMatthew G. Knepley Level: developer 56639bf0dad6SMatthew G. Knepley 56649bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 56659bf0dad6SMatthew G. Knepley @*/ 56669bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 56679bf0dad6SMatthew G. Knepley { 56683554e41dSMatthew G. Knepley PetscInt pMax[4]; 56693554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 56709bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 56719bf0dad6SMatthew G. Knepley 56729bf0dad6SMatthew G. Knepley PetscFunctionBegin; 56739bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 56749bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 56759bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 567625abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 56773554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 56783554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 56793554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 56809bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 56819bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 56829bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 56839bf0dad6SMatthew G. Knepley 568425abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 56859bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 56869bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 56879bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 56889bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 56899bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 56909bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 56919bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 56929bf0dad6SMatthew G. Knepley } 56933554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 56949bf0dad6SMatthew 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); 56959bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 56969bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 56979bf0dad6SMatthew G. Knepley 56989bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 56999bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 57009bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 57019bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 57029bf0dad6SMatthew G. Knepley } 5703e003ed69SMatthew 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); 57049bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5705e003ed69SMatthew 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]); 57069bf0dad6SMatthew G. Knepley } 57079bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 57089bf0dad6SMatthew G. Knepley } 57099bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 57109bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 57119bf0dad6SMatthew G. Knepley } 57123554e41dSMatthew G. Knepley } 5713552f7358SJed Brown PetscFunctionReturn(0); 5714552f7358SJed Brown } 57153913d7c8SMatthew G. Knepley 57163913d7c8SMatthew G. Knepley #undef __FUNCT__ 5717bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5718bceba477SMatthew G. Knepley /* Pointwise interpolation 5719bceba477SMatthew G. Knepley Just code FEM for now 5720bceba477SMatthew G. Knepley u^f = I u^c 57214ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 57224ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 57234ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5724bceba477SMatthew G. Knepley */ 5725bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5726bceba477SMatthew G. Knepley { 5727bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5728bceba477SMatthew G. Knepley PetscInt m, n; 5729a063dac3SMatthew G. Knepley void *ctx; 5730bceba477SMatthew G. Knepley PetscErrorCode ierr; 5731bceba477SMatthew G. Knepley 5732bceba477SMatthew G. Knepley PetscFunctionBegin; 5733bceba477SMatthew G. Knepley /* 5734bceba477SMatthew G. Knepley Loop over coarse cells 5735bceba477SMatthew G. Knepley Loop over coarse basis functions 5736bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5737bceba477SMatthew G. Knepley Loop over fine dual basis functions 5738bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5739bceba477SMatthew G. Knepley Sum 5740bceba477SMatthew G. Knepley Update local element matrix 5741bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5742bceba477SMatthew G. Knepley 5743bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5744bceba477SMatthew G. Knepley */ 5745bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5746bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5747bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5748bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5749bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5750bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5751bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5752bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5753bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 5754bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 5755bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 5756a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5757a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 57585d1c2e58SMatthew G. Knepley /* Use naive scaling */ 57595d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5760a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5761a063dac3SMatthew G. Knepley } 5762bceba477SMatthew G. Knepley 5763a063dac3SMatthew G. Knepley #undef __FUNCT__ 5764a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 5765a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 5766a063dac3SMatthew G. Knepley { 576790748bafSMatthew G. Knepley Vec cv, fv; 576890748bafSMatthew G. Knepley IS cis, fis, fpointIS; 576990748bafSMatthew G. Knepley PetscSection sc, gsc, gsf; 577090748bafSMatthew G. Knepley const PetscInt *fpoints; 577190748bafSMatthew G. Knepley PetscInt *cindices, *findices; 577290748bafSMatthew G. Knepley PetscInt cpStart, cpEnd, m, off, cp; 577390748bafSMatthew G. Knepley PetscErrorCode ierr; 577490748bafSMatthew G. Knepley 5775a063dac3SMatthew G. Knepley PetscFunctionBegin; 577690748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 577790748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr); 577890748bafSMatthew G. Knepley ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr); 577990748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 578090748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 578190748bafSMatthew G. Knepley ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr); 578290748bafSMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr); 578390748bafSMatthew G. Knepley ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr); 578490748bafSMatthew G. Knepley ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr); 578590748bafSMatthew G. Knepley ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr); 578690748bafSMatthew G. Knepley for (cp = cpStart, off = 0; cp < cpEnd; ++cp) { 578790748bafSMatthew G. Knepley const PetscInt *cdofsC = NULL; 578890748bafSMatthew G. Knepley PetscInt fp = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e; 578990748bafSMatthew G. Knepley 579090748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr); 579190748bafSMatthew G. Knepley if (dofC <= 0) continue; 579290748bafSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr); 579390748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr); 579490748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr); 579590748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr); 579690748bafSMatthew G. Knepley if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);} 579790748bafSMatthew 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); 579890748bafSMatthew 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); 579990748bafSMatthew G. Knepley for (d = 0, e = 0; d < dofC; ++d) { 580090748bafSMatthew G. Knepley if (cdofsC && cdofsC[e] == d) {++e; continue;} 580190748bafSMatthew G. Knepley cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d; 580290748bafSMatthew G. Knepley } 580390748bafSMatthew 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); 580490748bafSMatthew G. Knepley off += dofC-cdofC; 580590748bafSMatthew G. Knepley } 580690748bafSMatthew G. Knepley ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr); 580790748bafSMatthew G. Knepley if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m); 580890748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr); 580990748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr); 581090748bafSMatthew G. Knepley ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr); 581190748bafSMatthew G. Knepley ierr = ISDestroy(&cis);CHKERRQ(ierr); 581290748bafSMatthew G. Knepley ierr = ISDestroy(&fis);CHKERRQ(ierr); 581390748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr); 581490748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 581590748bafSMatthew G. Knepley ierr = ISDestroy(&fpointIS);CHKERRQ(ierr); 5816bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5817bceba477SMatthew G. Knepley } 5818bceba477SMatthew G. Knepley 5819bceba477SMatthew G. Knepley #undef __FUNCT__ 5820fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5821fd59a867SMatthew G. Knepley /* Pointwise interpolation 5822fd59a867SMatthew G. Knepley Just code FEM for now 5823fd59a867SMatthew G. Knepley u^f = I u^c 5824fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 5825fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 5826fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 5827fd59a867SMatthew G. Knepley */ 5828fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5829fd59a867SMatthew G. Knepley { 5830fd59a867SMatthew G. Knepley PetscSection section; 5831fd59a867SMatthew G. Knepley IS *bcPoints; 5832286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5833286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 5834fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5835fd59a867SMatthew G. Knepley 5836fd59a867SMatthew G. Knepley PetscFunctionBegin; 5837fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 5838286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5839fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5840fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5841fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5842fd59a867SMatthew G. Knepley PetscBool isEssential; 5843fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 5844fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 5845fd59a867SMatthew G. Knepley } 5846fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 5847fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 5848fd59a867SMatthew G. Knepley const char *bdLabel; 5849fd59a867SMatthew G. Knepley DMLabel label; 5850fd59a867SMatthew G. Knepley const PetscInt *values; 5851fd59a867SMatthew G. Knepley PetscInt field, numValues; 5852fd59a867SMatthew G. Knepley PetscBool isEssential, has; 5853fd59a867SMatthew G. Knepley 5854fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 5855fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 5856fd59a867SMatthew G. Knepley ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr); 5857fd59a867SMatthew G. Knepley if (!has) { 5858fd59a867SMatthew G. Knepley ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr); 5859fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5860fd59a867SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 5861fd59a867SMatthew G. Knepley } 5862fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5863fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 5864fd59a867SMatthew G. Knepley if (isEssential) { 5865fd59a867SMatthew G. Knepley bcFields[bc] = field; 5866fd59a867SMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &bcPoints[bc++]);CHKERRQ(ierr); 5867fd59a867SMatthew G. Knepley } 5868fd59a867SMatthew G. Knepley } 5869fd59a867SMatthew G. Knepley /* Handle discretization */ 5870fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5871286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5872fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5873fd59a867SMatthew G. Knepley PetscFE fe; 5874286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5875fd59a867SMatthew G. Knepley PetscInt d; 5876fd59a867SMatthew G. Knepley 587718abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5878fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5879286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5880286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5881fd59a867SMatthew G. Knepley } 5882286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5883286d8613SMatthew G. Knepley PetscInt d; 5884286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5885286d8613SMatthew 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."); 5886286d8613SMatthew G. Knepley } 5887286d8613SMatthew G. Knepley } 5888286d8613SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, §ion);CHKERRQ(ierr); 5889fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5890fd59a867SMatthew G. Knepley PetscFE fe; 5891fd59a867SMatthew G. Knepley const char *name; 589218abd763SMatthew G. Knepley 589318abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5894fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5895fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5896fd59a867SMatthew G. Knepley } 5897fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5898fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5899fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 5900fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 5901286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5902bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5903bceba477SMatthew G. Knepley } 5904bceba477SMatthew G. Knepley 5905bceba477SMatthew G. Knepley #undef __FUNCT__ 59063913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 59073913d7c8SMatthew G. Knepley /*@ 59083913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 59093913d7c8SMatthew G. Knepley 59103913d7c8SMatthew G. Knepley Input Parameter: 59113913d7c8SMatthew G. Knepley . dm - The DMPlex object 59123913d7c8SMatthew G. Knepley 59133913d7c8SMatthew G. Knepley Output Parameter: 59143913d7c8SMatthew G. Knepley . cdm - The coarse DM 59153913d7c8SMatthew G. Knepley 59163913d7c8SMatthew G. Knepley Level: intermediate 59173913d7c8SMatthew G. Knepley 59183913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 59193913d7c8SMatthew G. Knepley @*/ 59203913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 59213913d7c8SMatthew G. Knepley { 59223913d7c8SMatthew G. Knepley PetscFunctionBegin; 59233913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59243913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 59253913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 59263913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 59273913d7c8SMatthew G. Knepley } 59283913d7c8SMatthew G. Knepley 59293913d7c8SMatthew G. Knepley #undef __FUNCT__ 59303913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 59313913d7c8SMatthew G. Knepley /*@ 59323913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 59333913d7c8SMatthew G. Knepley 59343913d7c8SMatthew G. Knepley Input Parameters: 59353913d7c8SMatthew G. Knepley + dm - The DMPlex object 59363913d7c8SMatthew G. Knepley - cdm - The coarse DM 59373913d7c8SMatthew G. Knepley 59383913d7c8SMatthew G. Knepley Level: intermediate 59393913d7c8SMatthew G. Knepley 59403913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 59413913d7c8SMatthew G. Knepley @*/ 59423913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 59433913d7c8SMatthew G. Knepley { 59443913d7c8SMatthew G. Knepley DM_Plex *mesh; 59453913d7c8SMatthew G. Knepley PetscErrorCode ierr; 59463913d7c8SMatthew G. Knepley 59473913d7c8SMatthew G. Knepley PetscFunctionBegin; 59483913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59493913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 59503913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 59513913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 59523913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 59533913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 59543913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 59553913d7c8SMatthew G. Knepley } 5956