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> 5c6ccd67eSMatthew 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; 18*55f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 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); 2533c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 26*55f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 27*55f2e967SMatthew G. Knepley if (isvtk || ishdf5) {ierr = DMPlexInsertBoundaryValues(dm, v);CHKERRQ(ierr);} 28552f7358SJed Brown if (isvtk) { 29552f7358SJed Brown PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD; 30552f7358SJed Brown PetscSection section; 31552f7358SJed Brown PetscInt dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0; 32552f7358SJed Brown 33552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 34552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 350298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr); 360298fd71SBarry Smith ierr = DMPlexGetHeightStratum(dm, 1, &fStart, NULL);CHKERRQ(ierr); 370298fd71SBarry Smith ierr = DMPlexGetDepthStratum(dm, 0, &vStart, NULL);CHKERRQ(ierr); 38552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 39552f7358SJed Brown /* Assumes that numer of dofs per point of each stratum is constant, natural for VTK */ 40552f7358SJed Brown if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);} 41552f7358SJed Brown if ((fStart >= pStart) && (fStart < pEnd)) {ierr = PetscSectionGetDof(section, fStart, &fdof);CHKERRQ(ierr);} 42552f7358SJed Brown if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);} 43552f7358SJed Brown if (cdof && fdof && vdof) { /* Actually Q2 or some such, but visualize as Q1 */ 44552f7358SJed Brown ft = (cdof == dim) ? PETSC_VTK_POINT_VECTOR_FIELD : PETSC_VTK_POINT_FIELD; 45552f7358SJed Brown } else if (cdof && vdof) { 46ce94432eSBarry Smith SETERRQ(PetscObjectComm((PetscObject)viewer),PETSC_ERR_SUP,"No support for viewing mixed space with dofs at both vertices and cells"); 47552f7358SJed Brown } else if (cdof) { 48552f7358SJed Brown /* TODO: This assumption should be removed when there is a way of identifying whether a space is conceptually a 49552f7358SJed Brown * vector or just happens to have the same number of dofs as the dimension. */ 50552f7358SJed Brown if (cdof == dim) { 51552f7358SJed Brown ft = PETSC_VTK_CELL_VECTOR_FIELD; 52552f7358SJed Brown } else { 53552f7358SJed Brown ft = PETSC_VTK_CELL_FIELD; 54552f7358SJed Brown } 55552f7358SJed Brown } else if (vdof) { 56552f7358SJed Brown if (vdof == dim) { 57552f7358SJed Brown ft = PETSC_VTK_POINT_VECTOR_FIELD; 58552f7358SJed Brown } else { 59552f7358SJed Brown ft = PETSC_VTK_POINT_FIELD; 60552f7358SJed Brown } 6182f516ccSBarry Smith } else SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK"); 62552f7358SJed Brown 63552f7358SJed Brown ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */ 64552f7358SJed Brown ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr); /* viewer drops reference */ 65552f7358SJed Brown ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr); 66552f7358SJed Brown 67552f7358SJed Brown } else { 68*55f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 69*55f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 70552f7358SJed Brown } 71552f7358SJed Brown PetscFunctionReturn(0); 72552f7358SJed Brown } 73552f7358SJed Brown 74552f7358SJed Brown #undef __FUNCT__ 75552f7358SJed Brown #define __FUNCT__ "VecView_Plex" 76552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer) 77552f7358SJed Brown { 78552f7358SJed Brown DM dm; 79*55f2e967SMatthew G. Knepley PetscBool isvtk, ishdf5, isseq; 80552f7358SJed Brown PetscErrorCode ierr; 81552f7358SJed Brown 82552f7358SJed Brown PetscFunctionBegin; 83552f7358SJed Brown ierr = VecGetDM(v, &dm);CHKERRQ(ierr); 8482f516ccSBarry Smith if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM"); 85552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr); 8633c3e6b4SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 87*55f2e967SMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr); 8833c3e6b4SMatthew G. Knepley if (isvtk || ishdf5) { 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 { 100*55f2e967SMatthew G. Knepley if (isseq) {ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);} 101*55f2e967SMatthew G. Knepley else {ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);} 102552f7358SJed Brown } 103552f7358SJed Brown PetscFunctionReturn(0); 104552f7358SJed Brown } 105552f7358SJed Brown 106552f7358SJed Brown #undef __FUNCT__ 107552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii" 108552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer) 109552f7358SJed Brown { 110552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 111552f7358SJed Brown DM cdm; 112552f7358SJed Brown DMLabel markers; 113552f7358SJed Brown PetscSection coordSection; 114552f7358SJed Brown Vec coordinates; 115552f7358SJed Brown PetscViewerFormat format; 116552f7358SJed Brown PetscErrorCode ierr; 117552f7358SJed Brown 118552f7358SJed Brown PetscFunctionBegin; 119552f7358SJed Brown ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 120552f7358SJed Brown ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr); 121552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 122552f7358SJed Brown ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr); 123552f7358SJed Brown if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 124552f7358SJed Brown const char *name; 125552f7358SJed Brown PetscInt maxConeSize, maxSupportSize; 126552f7358SJed Brown PetscInt pStart, pEnd, p; 127552f7358SJed Brown PetscMPIInt rank, size; 128552f7358SJed Brown 12982f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 13082f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 131552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 132552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 133552f7358SJed Brown ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr); 134552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 135552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr); 136552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr); 137552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr); 138552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr); 139552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 140552f7358SJed Brown PetscInt dof, off, s; 141552f7358SJed Brown 142552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 143552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 144552f7358SJed Brown for (s = off; s < off+dof; ++s) { 145552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr); 146552f7358SJed Brown } 147552f7358SJed Brown } 148552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 149552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr); 150552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 151552f7358SJed Brown PetscInt dof, off, c; 152552f7358SJed Brown 153552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 154552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 155552f7358SJed Brown for (c = off; c < off+dof; ++c) { 156552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr); 157552f7358SJed Brown } 158552f7358SJed Brown } 159552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 1600298fd71SBarry Smith ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr); 161552f7358SJed Brown if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);} 162552f7358SJed Brown ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr); 163552f7358SJed Brown ierr = DMLabelView(markers,viewer);CHKERRQ(ierr); 164552f7358SJed Brown if (size > 1) { 165552f7358SJed Brown PetscSF sf; 166552f7358SJed Brown 167552f7358SJed Brown ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 168552f7358SJed Brown ierr = PetscSFView(sf, viewer);CHKERRQ(ierr); 169552f7358SJed Brown } 170552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 171552f7358SJed Brown } else if (format == PETSC_VIEWER_ASCII_LATEX) { 172552f7358SJed Brown const char *name; 173552f7358SJed Brown const char *colors[3] = {"red", "blue", "green"}; 174552f7358SJed Brown const int numColors = 3; 175552f7358SJed Brown PetscReal scale = 2.0; 176552f7358SJed Brown PetscScalar *coords; 177552f7358SJed Brown PetscInt depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p; 178552f7358SJed Brown PetscMPIInt rank, size; 179552f7358SJed Brown 180552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18182f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr); 18282f516ccSBarry Smith ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr); 183552f7358SJed Brown ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 184552f7358SJed Brown ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr); 185770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\ 186770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\ 187552f7358SJed Brown \\usepackage{tikz}\n\ 188552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\ 189552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\ 190552f7358SJed Brown \\usetikzlibrary{arrows}\n\ 191552f7358SJed Brown \\begin{document}\n\ 192552f7358SJed Brown \\section{%s}\n\ 193770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr); 194770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr); 195770b213bSMatthew G Knepley for (p = 0; p < size; ++p) { 196770b213bSMatthew G Knepley if (p > 0 && p == size-1) { 197770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr); 198770b213bSMatthew G Knepley } else if (p > 0) { 199770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr); 200770b213bSMatthew G Knepley } 201770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr); 202770b213bSMatthew G Knepley } 203770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\ 204770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr); 205552f7358SJed Brown /* Plot vertices */ 206552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 207552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 208552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 209552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 210552f7358SJed Brown PetscInt off, dof, d; 211552f7358SJed Brown 212552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr); 213552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 214552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 215552f7358SJed Brown for (d = 0; d < dof; ++d) { 216552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2176712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr); 218552f7358SJed Brown } 219552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr); 220552f7358SJed Brown } 221552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 222552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 223552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 224552f7358SJed Brown /* Plot edges */ 225552f7358SJed Brown ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr); 226552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr); 227552f7358SJed Brown if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);} 228552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 229552f7358SJed Brown const PetscInt *cone; 230552f7358SJed Brown PetscInt coneSize, offA, offB, dof, d; 231552f7358SJed Brown 232552f7358SJed Brown ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr); 23382f516ccSBarry Smith if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize); 234552f7358SJed Brown ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr); 235552f7358SJed Brown ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr); 236552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr); 237552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr); 238552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr); 239552f7358SJed Brown for (d = 0; d < dof; ++d) { 240552f7358SJed Brown if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);} 2416712e2f1SBarry Smith ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr); 242552f7358SJed Brown } 243552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr); 244552f7358SJed Brown } 245552f7358SJed Brown ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr); 246552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 247552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr); 248552f7358SJed Brown /* Plot cells */ 249552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 250552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2510298fd71SBarry Smith PetscInt *closure = NULL; 252552f7358SJed Brown PetscInt closureSize, firstPoint = -1; 253552f7358SJed Brown 254552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 255552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr); 256552f7358SJed Brown for (p = 0; p < closureSize*2; p += 2) { 257552f7358SJed Brown const PetscInt point = closure[p]; 258552f7358SJed Brown 259552f7358SJed Brown if ((point < vStart) || (point >= vEnd)) continue; 260552f7358SJed Brown if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);} 261552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr); 262552f7358SJed Brown if (firstPoint < 0) firstPoint = point; 263552f7358SJed Brown } 264552f7358SJed Brown /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */ 265552f7358SJed Brown ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr); 266552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 267552f7358SJed Brown } 268552f7358SJed Brown ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 269552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr); 270770b213bSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr); 271552f7358SJed Brown } else { 27282f516ccSBarry Smith MPI_Comm comm; 273834065abSMatthew G. Knepley PetscInt *sizes, *hybsizes; 274834065abSMatthew G. Knepley PetscInt locDepth, depth, dim, d, pMax[4]; 275552f7358SJed Brown PetscInt pStart, pEnd, p; 276a57dd577SMatthew G Knepley PetscInt numLabels, l; 2771143a3c0SMatthew G. Knepley const char *name; 278552f7358SJed Brown PetscMPIInt size; 279552f7358SJed Brown 28082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 281552f7358SJed Brown ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 282552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2835f64d76eSMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr); 2841143a3c0SMatthew G. Knepley if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);} 2851143a3c0SMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);} 286552f7358SJed Brown ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr); 287552f7358SJed Brown ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 288834065abSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 289dcca6d9dSJed Brown ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr); 290552f7358SJed Brown if (depth == 1) { 291552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr); 292552f7358SJed Brown pEnd = pEnd - pStart; 293552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 294552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", 0);CHKERRQ(ierr); 295552f7358SJed Brown for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 296552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 297552f7358SJed Brown ierr = DMPlexGetHeightStratum(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:", dim);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 } else { 304552f7358SJed Brown for (d = 0; d <= dim; d++) { 305552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 306834065abSMatthew G. Knepley pEnd -= pStart; 307834065abSMatthew G. Knepley pMax[d] -= pStart; 308552f7358SJed Brown ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 309834065abSMatthew G. Knepley ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr); 310552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, " %D-cells:", d);CHKERRQ(ierr); 311834065abSMatthew G. Knepley for (p = 0; p < size; ++p) { 312834065abSMatthew G. Knepley if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);} 313834065abSMatthew G. Knepley else {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);} 314834065abSMatthew G. Knepley } 315552f7358SJed Brown ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 316552f7358SJed Brown } 317552f7358SJed Brown } 318834065abSMatthew G. Knepley ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr); 319a57dd577SMatthew G Knepley ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr); 320a57dd577SMatthew G Knepley if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);} 321a57dd577SMatthew G Knepley for (l = 0; l < numLabels; ++l) { 322a57dd577SMatthew G Knepley DMLabel label; 323a57dd577SMatthew G Knepley const char *name; 324a57dd577SMatthew G Knepley IS valueIS; 325a57dd577SMatthew G Knepley const PetscInt *values; 326a57dd577SMatthew G Knepley PetscInt numValues, v; 327a57dd577SMatthew G Knepley 328a57dd577SMatthew G Knepley ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr); 329a57dd577SMatthew G Knepley ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr); 330a57dd577SMatthew G Knepley ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr); 331a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, " %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr); 332a57dd577SMatthew G Knepley ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr); 333a57dd577SMatthew G Knepley ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr); 334a57dd577SMatthew G Knepley for (v = 0; v < numValues; ++v) { 335a57dd577SMatthew G Knepley PetscInt size; 336a57dd577SMatthew G Knepley 337a57dd577SMatthew G Knepley ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr); 338a57dd577SMatthew G Knepley if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);} 339a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr); 340a57dd577SMatthew G Knepley } 341a57dd577SMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr); 342a57dd577SMatthew G Knepley ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr); 3434d41221fSMatthew G Knepley ierr = ISDestroy(&valueIS);CHKERRQ(ierr); 344a57dd577SMatthew G Knepley } 345552f7358SJed Brown } 346552f7358SJed Brown PetscFunctionReturn(0); 347552f7358SJed Brown } 348552f7358SJed Brown 349c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 350c6ccd67eSMatthew G. Knepley #undef __FUNCT__ 351c6ccd67eSMatthew G. Knepley #define __FUNCT__ "DMPlexView_HDF5" 352c6ccd67eSMatthew G. Knepley /* We only write cells and vertices. Does this screw up parallel reading? */ 353c6ccd67eSMatthew G. Knepley PetscErrorCode DMPlexView_HDF5(DM dm, PetscViewer viewer) 354c6ccd67eSMatthew G. Knepley { 355c6ccd67eSMatthew G. Knepley DM cdm; 356c6ccd67eSMatthew G. Knepley Vec coordinates, newcoords; 357c6ccd67eSMatthew G. Knepley Vec coneVec, cellVec; 358c6ccd67eSMatthew G. Knepley IS globalVertexNumbers; 359c6ccd67eSMatthew G. Knepley const PetscInt *gvertex; 360c6ccd67eSMatthew G. Knepley PetscScalar *sizes, *vertices; 361c6ccd67eSMatthew G. Knepley PetscReal lengthScale; 362c6ccd67eSMatthew G. Knepley const char *label = NULL; 363c6ccd67eSMatthew G. Knepley PetscInt labelId = 0, dim; 364c6ccd67eSMatthew G. Knepley PetscInt vStart, vEnd, v, cellHeight, cStart, cEnd, cMax, cell, conesSize = 0, numCornersLocal = 0, numCorners; 365c6ccd67eSMatthew G. Knepley PetscErrorCode ierr; 366c6ccd67eSMatthew G. Knepley 367c6ccd67eSMatthew G. Knepley PetscFunctionBegin; 368c6ccd67eSMatthew G. Knepley /* Write coordinates */ 369c6ccd67eSMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 370c6ccd67eSMatthew G. Knepley ierr = DMPlexGetScale(dm, PETSC_UNIT_LENGTH, &lengthScale);CHKERRQ(ierr); 371c6ccd67eSMatthew G. Knepley ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr); 372c6ccd67eSMatthew G. Knepley ierr = DMGetCoordinates(dm, &coordinates);CHKERRQ(ierr); 373c6ccd67eSMatthew G. Knepley ierr = VecDuplicate(coordinates, &newcoords);CHKERRQ(ierr); 374c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) newcoords, "vertices");CHKERRQ(ierr); 375c6ccd67eSMatthew G. Knepley ierr = VecCopy(coordinates, newcoords);CHKERRQ(ierr); 376c6ccd67eSMatthew G. Knepley ierr = VecScale(newcoords, lengthScale);CHKERRQ(ierr); 377c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/geometry");CHKERRQ(ierr); 378c6ccd67eSMatthew G. Knepley ierr = VecView(newcoords, viewer);CHKERRQ(ierr); 379c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 380c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&newcoords);CHKERRQ(ierr); 381c6ccd67eSMatthew G. Knepley /* Write toplogy */ 382c6ccd67eSMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 383c6ccd67eSMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 384c6ccd67eSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 385c6ccd67eSMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, PETSC_NULL, PETSC_NULL, PETSC_NULL);CHKERRQ(ierr); 386c6ccd67eSMatthew G. Knepley if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 387c6ccd67eSMatthew G. Knepley 388c6ccd67eSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &coneVec);CHKERRQ(ierr); 389c6ccd67eSMatthew G. Knepley ierr = VecSetSizes(coneVec, cEnd-cStart, PETSC_DETERMINE);CHKERRQ(ierr); 390c6ccd67eSMatthew G. Knepley ierr = VecSetBlockSize(coneVec, 1);CHKERRQ(ierr); 391c6ccd67eSMatthew G. Knepley ierr = VecSetFromOptions(coneVec);CHKERRQ(ierr); 392c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) coneVec, "coneSize");CHKERRQ(ierr); 393c6ccd67eSMatthew G. Knepley ierr = VecGetArray(coneVec, &sizes);CHKERRQ(ierr); 394c6ccd67eSMatthew G. Knepley for (cell = cStart; cell < cEnd; ++cell) { 395c6ccd67eSMatthew G. Knepley PetscInt *closure = NULL; 396c6ccd67eSMatthew G. Knepley PetscInt closureSize, v, Nc = 0; 397c6ccd67eSMatthew G. Knepley 398c6ccd67eSMatthew G. Knepley if (label) { 399c6ccd67eSMatthew G. Knepley PetscInt value; 400c6ccd67eSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, label, cell, &value);CHKERRQ(ierr); 401c6ccd67eSMatthew G. Knepley if (value == labelId) continue; 402c6ccd67eSMatthew G. Knepley } 403c6ccd67eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 404c6ccd67eSMatthew G. Knepley for (v = 0; v < closureSize*2; v += 2) { 405c6ccd67eSMatthew G. Knepley if ((closure[v] >= vStart) && (closure[v] < vEnd)) ++Nc; 406c6ccd67eSMatthew G. Knepley } 407c6ccd67eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 408c6ccd67eSMatthew G. Knepley conesSize += Nc; 409c6ccd67eSMatthew G. Knepley if (!numCornersLocal) numCornersLocal = Nc; 410c6ccd67eSMatthew G. Knepley else if (numCornersLocal != Nc) numCornersLocal = 1; 411c6ccd67eSMatthew G. Knepley } 412c6ccd67eSMatthew G. Knepley ierr = VecRestoreArray(coneVec, &sizes);CHKERRQ(ierr); 413c6ccd67eSMatthew G. Knepley ierr = MPI_Allreduce(&numCornersLocal, &numCorners, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject) dm));CHKERRQ(ierr); 414c6ccd67eSMatthew G. Knepley if (numCornersLocal && numCornersLocal != numCorners) numCorners = 1; 415c6ccd67eSMatthew G. Knepley 416c6ccd67eSMatthew G. Knepley ierr = DMPlexGetVertexNumbering(dm, &globalVertexNumbers);CHKERRQ(ierr); 417c6ccd67eSMatthew G. Knepley ierr = ISGetIndices(globalVertexNumbers, &gvertex);CHKERRQ(ierr); 418c6ccd67eSMatthew G. Knepley ierr = VecCreate(PetscObjectComm((PetscObject) dm), &cellVec);CHKERRQ(ierr); 419c6ccd67eSMatthew G. Knepley ierr = VecSetSizes(cellVec, conesSize, PETSC_DETERMINE);CHKERRQ(ierr); 420c6ccd67eSMatthew G. Knepley ierr = VecSetBlockSize(cellVec, numCorners);CHKERRQ(ierr); 421c6ccd67eSMatthew G. Knepley ierr = VecSetFromOptions(cellVec);CHKERRQ(ierr); 422c6ccd67eSMatthew G. Knepley ierr = PetscObjectSetName((PetscObject) cellVec, "cells");CHKERRQ(ierr); 423c6ccd67eSMatthew G. Knepley ierr = VecGetArray(cellVec, &vertices);CHKERRQ(ierr); 424c6ccd67eSMatthew G. Knepley for (cell = cStart, v = 0; cell < cEnd; ++cell) { 425c6ccd67eSMatthew G. Knepley PetscInt *closure = NULL; 426c6ccd67eSMatthew G. Knepley PetscInt closureSize, Nc = 0, p; 427c6ccd67eSMatthew G. Knepley 428c6ccd67eSMatthew G. Knepley if (label) { 429c6ccd67eSMatthew G. Knepley PetscInt value; 430c6ccd67eSMatthew G. Knepley ierr = DMPlexGetLabelValue(dm, label, cell, &value);CHKERRQ(ierr); 431c6ccd67eSMatthew G. Knepley if (value == labelId) continue; 432c6ccd67eSMatthew G. Knepley } 433c6ccd67eSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 434c6ccd67eSMatthew G. Knepley for (p = 0; p < closureSize*2; p += 2) { 435c6ccd67eSMatthew G. Knepley if ((closure[p] >= vStart) && (closure[p] < vEnd)) { 436c6ccd67eSMatthew G. Knepley closure[Nc++] = closure[p]; 437c6ccd67eSMatthew G. Knepley } 438c6ccd67eSMatthew G. Knepley } 439c6ccd67eSMatthew G. Knepley ierr = DMPlexInvertCell(dim, Nc, closure);CHKERRQ(ierr); 440c6ccd67eSMatthew G. Knepley for (p = 0; p < Nc; ++p) { 441c6ccd67eSMatthew G. Knepley const PetscInt gv = gvertex[closure[p] - vStart]; 442c6ccd67eSMatthew G. Knepley vertices[v++] = gv < 0 ? -(gv+1) : gv; 443c6ccd67eSMatthew G. Knepley } 444c6ccd67eSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 445c6ccd67eSMatthew G. Knepley } 446c6ccd67eSMatthew G. Knepley if (v != conesSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of cell vertices %d != %d", v, conesSize); 447c6ccd67eSMatthew G. Knepley ierr = VecRestoreArray(cellVec, &vertices);CHKERRQ(ierr); 448c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PushGroup(viewer, "/topology");CHKERRQ(ierr); 449c6ccd67eSMatthew G. Knepley ierr = VecView(cellVec, viewer);CHKERRQ(ierr); 450c6ccd67eSMatthew G. Knepley if (numCorners == 1) { 451c6ccd67eSMatthew G. Knepley ierr = VecView(coneVec, viewer);CHKERRQ(ierr); 452c6ccd67eSMatthew G. Knepley } else { 453c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5WriteAttribute(viewer, "/topology/cells", "cell_corners", PETSC_INT, (void *) &numCorners);CHKERRQ(ierr); 454c6ccd67eSMatthew G. Knepley } 455c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5PopGroup(viewer);CHKERRQ(ierr); 456c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&cellVec);CHKERRQ(ierr); 457c6ccd67eSMatthew G. Knepley ierr = VecDestroy(&coneVec);CHKERRQ(ierr); 458c6ccd67eSMatthew G. Knepley ierr = ISRestoreIndices(globalVertexNumbers, &gvertex);CHKERRQ(ierr); 459c6ccd67eSMatthew G. Knepley 460c6ccd67eSMatthew G. Knepley ierr = PetscViewerHDF5WriteAttribute(viewer, "/topology/cells", "cell_dim", PETSC_INT, (void *) &dim);CHKERRQ(ierr); 461c6ccd67eSMatthew G. Knepley PetscFunctionReturn(0); 462c6ccd67eSMatthew G. Knepley } 463c6ccd67eSMatthew G. Knepley #endif 464c6ccd67eSMatthew G. Knepley 465552f7358SJed Brown #undef __FUNCT__ 466552f7358SJed Brown #define __FUNCT__ "DMView_Plex" 467552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer) 468552f7358SJed Brown { 469c6ccd67eSMatthew G. Knepley PetscBool iascii, ishdf5; 470552f7358SJed Brown PetscErrorCode ierr; 471552f7358SJed Brown 472552f7358SJed Brown PetscFunctionBegin; 473552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 474552f7358SJed Brown PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2); 475552f7358SJed Brown ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr); 476c6ccd67eSMatthew G. Knepley ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERHDF5, &ishdf5);CHKERRQ(ierr); 477552f7358SJed Brown if (iascii) { 478552f7358SJed Brown ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr); 479c6ccd67eSMatthew G. Knepley } else if (ishdf5) { 480c6ccd67eSMatthew G. Knepley #if defined(PETSC_HAVE_HDF5) 481c6ccd67eSMatthew G. Knepley ierr = DMPlexView_HDF5(dm, viewer);CHKERRQ(ierr); 482c6ccd67eSMatthew G. Knepley #else 483c6ccd67eSMatthew G. Knepley SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "HDF5 not supported in this build.\nPlease reconfigure using --download-hdf5"); 484552f7358SJed Brown #endif 48511aeaf0aSBarry Smith } 486552f7358SJed Brown PetscFunctionReturn(0); 487552f7358SJed Brown } 488552f7358SJed Brown 489552f7358SJed Brown #undef __FUNCT__ 4906c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy" 4916c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary) 4926c73c22cSMatthew G. Knepley { 4936c73c22cSMatthew G. Knepley DMBoundary b, next; 4946c73c22cSMatthew G. Knepley PetscErrorCode ierr; 4956c73c22cSMatthew G. Knepley 4966c73c22cSMatthew G. Knepley PetscFunctionBeginUser; 4976c73c22cSMatthew G. Knepley if (!boundary) PetscFunctionReturn(0); 4986c73c22cSMatthew G. Knepley b = *boundary; 4996c73c22cSMatthew G. Knepley *boundary = NULL; 5006c73c22cSMatthew G. Knepley for (; b; b = next) { 5016c73c22cSMatthew G. Knepley next = b->next; 5026c73c22cSMatthew G. Knepley ierr = PetscFree(b->ids);CHKERRQ(ierr); 5036c73c22cSMatthew G. Knepley ierr = PetscFree(b->name);CHKERRQ(ierr); 5046c73c22cSMatthew G. Knepley ierr = PetscFree(b);CHKERRQ(ierr); 5056c73c22cSMatthew G. Knepley } 5066c73c22cSMatthew G. Knepley PetscFunctionReturn(0); 5076c73c22cSMatthew G. Knepley } 5086c73c22cSMatthew G. Knepley 5096c73c22cSMatthew G. Knepley #undef __FUNCT__ 510552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex" 511552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm) 512552f7358SJed Brown { 513552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 514552f7358SJed Brown DMLabel next = mesh->labels; 515552f7358SJed Brown PetscErrorCode ierr; 516552f7358SJed Brown 517552f7358SJed Brown PetscFunctionBegin; 5180d644c17SKarl Rupp if (--mesh->refct > 0) PetscFunctionReturn(0); 519552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr); 520552f7358SJed Brown ierr = PetscFree(mesh->cones);CHKERRQ(ierr); 521552f7358SJed Brown ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr); 522552f7358SJed Brown ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr); 523552f7358SJed Brown ierr = PetscFree(mesh->supports);CHKERRQ(ierr); 524552f7358SJed Brown ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr); 525552f7358SJed Brown while (next) { 526552f7358SJed Brown DMLabel tmp = next->next; 527552f7358SJed Brown 528552f7358SJed Brown ierr = DMLabelDestroy(&next);CHKERRQ(ierr); 529552f7358SJed Brown next = tmp; 530552f7358SJed Brown } 5313913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 532a89082eeSMatthew G Knepley ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr); 533552f7358SJed Brown ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr); 534552f7358SJed Brown ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr); 5356c73c22cSMatthew G. Knepley ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr); 536552f7358SJed Brown /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */ 537552f7358SJed Brown ierr = PetscFree(mesh);CHKERRQ(ierr); 538552f7358SJed Brown PetscFunctionReturn(0); 539552f7358SJed Brown } 540552f7358SJed Brown 541552f7358SJed Brown #undef __FUNCT__ 542552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex" 543b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J) 544552f7358SJed Brown { 545552f7358SJed Brown PetscSection section, sectionGlobal; 546552f7358SJed Brown PetscInt bs = -1; 547552f7358SJed Brown PetscInt localSize; 54889545effSMatthew G. Knepley PetscBool isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock; 549552f7358SJed Brown PetscErrorCode ierr; 550b412c318SBarry Smith MatType mtype; 551552f7358SJed Brown 552552f7358SJed Brown PetscFunctionBegin; 553607a6623SBarry Smith ierr = MatInitializePackage();CHKERRQ(ierr); 554b412c318SBarry Smith mtype = dm->mattype; 555552f7358SJed Brown ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr); 556552f7358SJed Brown ierr = DMGetDefaultGlobalSection(dm, §ionGlobal);CHKERRQ(ierr); 557552f7358SJed Brown /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */ 558552f7358SJed Brown ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); 55982f516ccSBarry Smith ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr); 560552f7358SJed Brown ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 561552f7358SJed Brown ierr = MatSetType(*J, mtype);CHKERRQ(ierr); 562552f7358SJed Brown ierr = MatSetFromOptions(*J);CHKERRQ(ierr); 563552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr); 564552f7358SJed Brown ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr); 565552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr); 566552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr); 567552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr); 568552f7358SJed Brown ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr); 569552f7358SJed Brown ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr); 570552f7358SJed Brown if (!isShell) { 571552f7358SJed Brown PetscBool fillMatrix = (PetscBool) !dm->prealloc_only; 5722a28c762SMatthew G Knepley PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin; 573552f7358SJed Brown 574552f7358SJed Brown if (bs < 0) { 575552f7358SJed Brown if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) { 576fad22124SMatthew G Knepley PetscInt pStart, pEnd, p, dof, cdof; 577552f7358SJed Brown 578552f7358SJed Brown ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr); 579552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 580552f7358SJed Brown ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr); 581fad22124SMatthew G Knepley ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr); 582fad22124SMatthew G Knepley if (dof-cdof) { 5832a28c762SMatthew G Knepley if (bs < 0) { 584fad22124SMatthew G Knepley bs = dof-cdof; 585fad22124SMatthew G Knepley } else if (bs != dof-cdof) { 5862a28c762SMatthew G Knepley /* Layout does not admit a pointwise block size */ 5872a28c762SMatthew G Knepley bs = 1; 588552f7358SJed Brown break; 589552f7358SJed Brown } 590552f7358SJed Brown } 5912a28c762SMatthew G Knepley } 5922a28c762SMatthew G Knepley /* Must have same blocksize on all procs (some might have no points) */ 5932a28c762SMatthew G Knepley bsLocal = bs; 59482f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5952a28c762SMatthew G Knepley bsLocal = bs < 0 ? bsMax : bs; 59682f516ccSBarry Smith ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr); 5972a28c762SMatthew G Knepley if (bsMin != bsMax) { 5982a28c762SMatthew G Knepley bs = 1; 5992a28c762SMatthew G Knepley } else { 6002a28c762SMatthew G Knepley bs = bsMax; 6012a28c762SMatthew G Knepley } 602552f7358SJed Brown } else { 603552f7358SJed Brown bs = 1; 604552f7358SJed Brown } 605552f7358SJed Brown } 6061795a4d1SJed Brown ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr); 607552f7358SJed Brown ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr); 608552f7358SJed Brown ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr); 609552f7358SJed Brown } 610552f7358SJed Brown PetscFunctionReturn(0); 611552f7358SJed Brown } 612552f7358SJed Brown 613552f7358SJed Brown #undef __FUNCT__ 614552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension" 615552f7358SJed Brown /*@ 616552f7358SJed Brown DMPlexGetDimension - Return the topological mesh dimension 617552f7358SJed Brown 618552f7358SJed Brown Not collective 619552f7358SJed Brown 620552f7358SJed Brown Input Parameter: 621552f7358SJed Brown . mesh - The DMPlex 622552f7358SJed Brown 623552f7358SJed Brown Output Parameter: 624552f7358SJed Brown . dim - The topological mesh dimension 625552f7358SJed Brown 626552f7358SJed Brown Level: beginner 627552f7358SJed Brown 628552f7358SJed Brown .seealso: DMPlexCreate() 629552f7358SJed Brown @*/ 630552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim) 631552f7358SJed Brown { 632552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 633552f7358SJed Brown 634552f7358SJed Brown PetscFunctionBegin; 635552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 636552f7358SJed Brown PetscValidPointer(dim, 2); 637552f7358SJed Brown *dim = mesh->dim; 638552f7358SJed Brown PetscFunctionReturn(0); 639552f7358SJed Brown } 640552f7358SJed Brown 641552f7358SJed Brown #undef __FUNCT__ 642552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension" 643552f7358SJed Brown /*@ 644552f7358SJed Brown DMPlexSetDimension - Set the topological mesh dimension 645552f7358SJed Brown 646552f7358SJed Brown Collective on mesh 647552f7358SJed Brown 648552f7358SJed Brown Input Parameters: 649552f7358SJed Brown + mesh - The DMPlex 650552f7358SJed Brown - dim - The topological mesh dimension 651552f7358SJed Brown 652552f7358SJed Brown Level: beginner 653552f7358SJed Brown 654552f7358SJed Brown .seealso: DMPlexCreate() 655552f7358SJed Brown @*/ 656552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim) 657552f7358SJed Brown { 658552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 659552f7358SJed Brown 660552f7358SJed Brown PetscFunctionBegin; 661552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 662552f7358SJed Brown PetscValidLogicalCollectiveInt(dm, dim, 2); 663552f7358SJed Brown mesh->dim = dim; 664552f7358SJed Brown PetscFunctionReturn(0); 665552f7358SJed Brown } 666552f7358SJed Brown 667552f7358SJed Brown #undef __FUNCT__ 668552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart" 669552f7358SJed Brown /*@ 670552f7358SJed Brown DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd) 671552f7358SJed Brown 672552f7358SJed Brown Not collective 673552f7358SJed Brown 674552f7358SJed Brown Input Parameter: 675552f7358SJed Brown . mesh - The DMPlex 676552f7358SJed Brown 677552f7358SJed Brown Output Parameters: 678552f7358SJed Brown + pStart - The first mesh point 679552f7358SJed Brown - pEnd - The upper bound for mesh points 680552f7358SJed Brown 681552f7358SJed Brown Level: beginner 682552f7358SJed Brown 683552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart() 684552f7358SJed Brown @*/ 685552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd) 686552f7358SJed Brown { 687552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 688552f7358SJed Brown PetscErrorCode ierr; 689552f7358SJed Brown 690552f7358SJed Brown PetscFunctionBegin; 691552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 692552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 693552f7358SJed Brown PetscFunctionReturn(0); 694552f7358SJed Brown } 695552f7358SJed Brown 696552f7358SJed Brown #undef __FUNCT__ 697552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart" 698552f7358SJed Brown /*@ 699552f7358SJed Brown DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd) 700552f7358SJed Brown 701552f7358SJed Brown Not collective 702552f7358SJed Brown 703552f7358SJed Brown Input Parameters: 704552f7358SJed Brown + mesh - The DMPlex 705552f7358SJed Brown . pStart - The first mesh point 706552f7358SJed Brown - pEnd - The upper bound for mesh points 707552f7358SJed Brown 708552f7358SJed Brown Output Parameters: 709552f7358SJed Brown 710552f7358SJed Brown Level: beginner 711552f7358SJed Brown 712552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart() 713552f7358SJed Brown @*/ 714552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd) 715552f7358SJed Brown { 716552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 717552f7358SJed Brown PetscErrorCode ierr; 718552f7358SJed Brown 719552f7358SJed Brown PetscFunctionBegin; 720552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 721552f7358SJed Brown ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr); 722552f7358SJed Brown ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr); 723552f7358SJed Brown PetscFunctionReturn(0); 724552f7358SJed Brown } 725552f7358SJed Brown 726552f7358SJed Brown #undef __FUNCT__ 727552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize" 728552f7358SJed Brown /*@ 729552f7358SJed Brown DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG 730552f7358SJed Brown 731552f7358SJed Brown Not collective 732552f7358SJed Brown 733552f7358SJed Brown Input Parameters: 734552f7358SJed Brown + mesh - The DMPlex 735552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 736552f7358SJed Brown 737552f7358SJed Brown Output Parameter: 738552f7358SJed Brown . size - The cone size for point p 739552f7358SJed Brown 740552f7358SJed Brown Level: beginner 741552f7358SJed Brown 742552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 743552f7358SJed Brown @*/ 744552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size) 745552f7358SJed Brown { 746552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 747552f7358SJed Brown PetscErrorCode ierr; 748552f7358SJed Brown 749552f7358SJed Brown PetscFunctionBegin; 750552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 751552f7358SJed Brown PetscValidPointer(size, 3); 752552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 753552f7358SJed Brown PetscFunctionReturn(0); 754552f7358SJed Brown } 755552f7358SJed Brown 756552f7358SJed Brown #undef __FUNCT__ 757552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize" 758552f7358SJed Brown /*@ 759552f7358SJed Brown DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG 760552f7358SJed Brown 761552f7358SJed Brown Not collective 762552f7358SJed Brown 763552f7358SJed Brown Input Parameters: 764552f7358SJed Brown + mesh - The DMPlex 765552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 766552f7358SJed Brown - size - The cone size for point p 767552f7358SJed Brown 768552f7358SJed Brown Output Parameter: 769552f7358SJed Brown 770552f7358SJed Brown Note: 771552f7358SJed Brown This should be called after DMPlexSetChart(). 772552f7358SJed Brown 773552f7358SJed Brown Level: beginner 774552f7358SJed Brown 775552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart() 776552f7358SJed Brown @*/ 777552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size) 778552f7358SJed Brown { 779552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 780552f7358SJed Brown PetscErrorCode ierr; 781552f7358SJed Brown 782552f7358SJed Brown PetscFunctionBegin; 783552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 784552f7358SJed Brown ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr); 7850d644c17SKarl Rupp 786552f7358SJed Brown mesh->maxConeSize = PetscMax(mesh->maxConeSize, size); 787552f7358SJed Brown PetscFunctionReturn(0); 788552f7358SJed Brown } 789552f7358SJed Brown 790552f7358SJed Brown #undef __FUNCT__ 791552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone" 792552f7358SJed Brown /*@C 793552f7358SJed Brown DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG 794552f7358SJed Brown 795552f7358SJed Brown Not collective 796552f7358SJed Brown 797552f7358SJed Brown Input Parameters: 798552f7358SJed Brown + mesh - The DMPlex 799552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 800552f7358SJed Brown 801552f7358SJed Brown Output Parameter: 802552f7358SJed Brown . cone - An array of points which are on the in-edges for point p 803552f7358SJed Brown 804552f7358SJed Brown Level: beginner 805552f7358SJed Brown 8063813dfbdSMatthew G Knepley Fortran Notes: 8073813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8083813dfbdSMatthew G Knepley include petsc.h90 in your code. 8093813dfbdSMatthew G Knepley 8103813dfbdSMatthew G Knepley You must also call DMPlexRestoreCone() after you finish using the returned array. 811552f7358SJed Brown 812552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart() 813552f7358SJed Brown @*/ 814552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[]) 815552f7358SJed Brown { 816552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 817552f7358SJed Brown PetscInt off; 818552f7358SJed Brown PetscErrorCode ierr; 819552f7358SJed Brown 820552f7358SJed Brown PetscFunctionBegin; 821552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 822552f7358SJed Brown PetscValidPointer(cone, 3); 823552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 824552f7358SJed Brown *cone = &mesh->cones[off]; 825552f7358SJed Brown PetscFunctionReturn(0); 826552f7358SJed Brown } 827552f7358SJed Brown 828552f7358SJed Brown #undef __FUNCT__ 829552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone" 830552f7358SJed Brown /*@ 831552f7358SJed Brown DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG 832552f7358SJed Brown 833552f7358SJed Brown Not collective 834552f7358SJed Brown 835552f7358SJed Brown Input Parameters: 836552f7358SJed Brown + mesh - The DMPlex 837552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 838552f7358SJed Brown - cone - An array of points which are on the in-edges for point p 839552f7358SJed Brown 840552f7358SJed Brown Output Parameter: 841552f7358SJed Brown 842552f7358SJed Brown Note: 843552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 844552f7358SJed Brown 845552f7358SJed Brown Level: beginner 846552f7358SJed Brown 847552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 848552f7358SJed Brown @*/ 849552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[]) 850552f7358SJed Brown { 851552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 852552f7358SJed Brown PetscInt pStart, pEnd; 853552f7358SJed Brown PetscInt dof, off, c; 854552f7358SJed Brown PetscErrorCode ierr; 855552f7358SJed Brown 856552f7358SJed Brown PetscFunctionBegin; 857552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 858552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 859552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 860552f7358SJed Brown if (dof) PetscValidPointer(cone, 3); 861552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 86282f516ccSBarry 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); 863552f7358SJed Brown for (c = 0; c < dof; ++c) { 86482f516ccSBarry 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); 865552f7358SJed Brown mesh->cones[off+c] = cone[c]; 866552f7358SJed Brown } 867552f7358SJed Brown PetscFunctionReturn(0); 868552f7358SJed Brown } 869552f7358SJed Brown 870552f7358SJed Brown #undef __FUNCT__ 871552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation" 872552f7358SJed Brown /*@C 873552f7358SJed Brown DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG 874552f7358SJed Brown 875552f7358SJed Brown Not collective 876552f7358SJed Brown 877552f7358SJed Brown Input Parameters: 878552f7358SJed Brown + mesh - The DMPlex 879552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 880552f7358SJed Brown 881552f7358SJed Brown Output Parameter: 882552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 883552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 884552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 885552f7358SJed Brown the index of the cone point on which to start. 886552f7358SJed Brown 887552f7358SJed Brown Level: beginner 888552f7358SJed Brown 8893813dfbdSMatthew G Knepley Fortran Notes: 8903813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 8913813dfbdSMatthew G Knepley include petsc.h90 in your code. 8923813dfbdSMatthew G Knepley 8933813dfbdSMatthew G Knepley You must also call DMPlexRestoreConeOrientation() after you finish using the returned array. 894552f7358SJed Brown 895552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart() 896552f7358SJed Brown @*/ 897552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[]) 898552f7358SJed Brown { 899552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 900552f7358SJed Brown PetscInt off; 901552f7358SJed Brown PetscErrorCode ierr; 902552f7358SJed Brown 903552f7358SJed Brown PetscFunctionBegin; 904552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 905552f7358SJed Brown #if defined(PETSC_USE_DEBUG) 906552f7358SJed Brown { 907552f7358SJed Brown PetscInt dof; 908552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 909552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 910552f7358SJed Brown } 911552f7358SJed Brown #endif 912552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 9130d644c17SKarl Rupp 914552f7358SJed Brown *coneOrientation = &mesh->coneOrientations[off]; 915552f7358SJed Brown PetscFunctionReturn(0); 916552f7358SJed Brown } 917552f7358SJed Brown 918552f7358SJed Brown #undef __FUNCT__ 919552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation" 920552f7358SJed Brown /*@ 921552f7358SJed Brown DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG 922552f7358SJed Brown 923552f7358SJed Brown Not collective 924552f7358SJed Brown 925552f7358SJed Brown Input Parameters: 926552f7358SJed Brown + mesh - The DMPlex 927552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 928552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an 929552f7358SJed Brown integer giving the prescription for cone traversal. If it is negative, the cone is 930552f7358SJed Brown traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives 931552f7358SJed Brown the index of the cone point on which to start. 932552f7358SJed Brown 933552f7358SJed Brown Output Parameter: 934552f7358SJed Brown 935552f7358SJed Brown Note: 936552f7358SJed Brown This should be called after all calls to DMPlexSetConeSize() and DMSetUp(). 937552f7358SJed Brown 938552f7358SJed Brown Level: beginner 939552f7358SJed Brown 940552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp() 941552f7358SJed Brown @*/ 942552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[]) 943552f7358SJed Brown { 944552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 945552f7358SJed Brown PetscInt pStart, pEnd; 946552f7358SJed Brown PetscInt dof, off, c; 947552f7358SJed Brown PetscErrorCode ierr; 948552f7358SJed Brown 949552f7358SJed Brown PetscFunctionBegin; 950552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 951552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 952552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 953552f7358SJed Brown if (dof) PetscValidPointer(coneOrientation, 3); 954552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 95582f516ccSBarry 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); 956552f7358SJed Brown for (c = 0; c < dof; ++c) { 957552f7358SJed Brown PetscInt cdof, o = coneOrientation[c]; 958552f7358SJed Brown 959552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr); 96082f516ccSBarry 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); 961552f7358SJed Brown mesh->coneOrientations[off+c] = o; 962552f7358SJed Brown } 963552f7358SJed Brown PetscFunctionReturn(0); 964552f7358SJed Brown } 965552f7358SJed Brown 966552f7358SJed Brown #undef __FUNCT__ 967552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone" 968552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint) 969552f7358SJed Brown { 970552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 971552f7358SJed Brown PetscInt pStart, pEnd; 972552f7358SJed Brown PetscInt dof, off; 973552f7358SJed Brown PetscErrorCode ierr; 974552f7358SJed Brown 975552f7358SJed Brown PetscFunctionBegin; 976552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 977552f7358SJed Brown ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 97882f516ccSBarry 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); 97982f516ccSBarry 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); 98077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 98177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 98277c88f5bSMatthew 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); 983552f7358SJed Brown mesh->cones[off+conePos] = conePoint; 984552f7358SJed Brown PetscFunctionReturn(0); 985552f7358SJed Brown } 986552f7358SJed Brown 987552f7358SJed Brown #undef __FUNCT__ 98877c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation" 98977c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation) 99077c88f5bSMatthew G Knepley { 99177c88f5bSMatthew G Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 99277c88f5bSMatthew G Knepley PetscInt pStart, pEnd; 99377c88f5bSMatthew G Knepley PetscInt dof, off; 99477c88f5bSMatthew G Knepley PetscErrorCode ierr; 99577c88f5bSMatthew G Knepley 99677c88f5bSMatthew G Knepley PetscFunctionBegin; 99777c88f5bSMatthew G Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 99877c88f5bSMatthew G Knepley ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr); 99977c88f5bSMatthew 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); 100077c88f5bSMatthew G Knepley ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 100177c88f5bSMatthew G Knepley ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 100277c88f5bSMatthew 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); 100377c88f5bSMatthew G Knepley mesh->coneOrientations[off+conePos] = coneOrientation; 100477c88f5bSMatthew G Knepley PetscFunctionReturn(0); 100577c88f5bSMatthew G Knepley } 100677c88f5bSMatthew G Knepley 100777c88f5bSMatthew G Knepley #undef __FUNCT__ 1008552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize" 1009552f7358SJed Brown /*@ 1010552f7358SJed Brown DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG 1011552f7358SJed Brown 1012552f7358SJed Brown Not collective 1013552f7358SJed Brown 1014552f7358SJed Brown Input Parameters: 1015552f7358SJed Brown + mesh - The DMPlex 1016552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1017552f7358SJed Brown 1018552f7358SJed Brown Output Parameter: 1019552f7358SJed Brown . size - The support size for point p 1020552f7358SJed Brown 1021552f7358SJed Brown Level: beginner 1022552f7358SJed Brown 1023552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize() 1024552f7358SJed Brown @*/ 1025552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size) 1026552f7358SJed Brown { 1027552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1028552f7358SJed Brown PetscErrorCode ierr; 1029552f7358SJed Brown 1030552f7358SJed Brown PetscFunctionBegin; 1031552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1032552f7358SJed Brown PetscValidPointer(size, 3); 1033552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 1034552f7358SJed Brown PetscFunctionReturn(0); 1035552f7358SJed Brown } 1036552f7358SJed Brown 1037552f7358SJed Brown #undef __FUNCT__ 1038552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize" 1039552f7358SJed Brown /*@ 1040552f7358SJed Brown DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG 1041552f7358SJed Brown 1042552f7358SJed Brown Not collective 1043552f7358SJed Brown 1044552f7358SJed Brown Input Parameters: 1045552f7358SJed Brown + mesh - The DMPlex 1046552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1047552f7358SJed Brown - size - The support size for point p 1048552f7358SJed Brown 1049552f7358SJed Brown Output Parameter: 1050552f7358SJed Brown 1051552f7358SJed Brown Note: 1052552f7358SJed Brown This should be called after DMPlexSetChart(). 1053552f7358SJed Brown 1054552f7358SJed Brown Level: beginner 1055552f7358SJed Brown 1056552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart() 1057552f7358SJed Brown @*/ 1058552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size) 1059552f7358SJed Brown { 1060552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1061552f7358SJed Brown PetscErrorCode ierr; 1062552f7358SJed Brown 1063552f7358SJed Brown PetscFunctionBegin; 1064552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1065552f7358SJed Brown ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr); 10660d644c17SKarl Rupp 1067552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size); 1068552f7358SJed Brown PetscFunctionReturn(0); 1069552f7358SJed Brown } 1070552f7358SJed Brown 1071552f7358SJed Brown #undef __FUNCT__ 1072552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport" 1073552f7358SJed Brown /*@C 1074552f7358SJed Brown DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG 1075552f7358SJed Brown 1076552f7358SJed Brown Not collective 1077552f7358SJed Brown 1078552f7358SJed Brown Input Parameters: 1079552f7358SJed Brown + mesh - The DMPlex 1080552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1081552f7358SJed Brown 1082552f7358SJed Brown Output Parameter: 1083552f7358SJed Brown . support - An array of points which are on the out-edges for point p 1084552f7358SJed Brown 1085552f7358SJed Brown Level: beginner 1086552f7358SJed Brown 10873813dfbdSMatthew G Knepley Fortran Notes: 10883813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 10893813dfbdSMatthew G Knepley include petsc.h90 in your code. 10903813dfbdSMatthew G Knepley 10913813dfbdSMatthew G Knepley You must also call DMPlexRestoreSupport() after you finish using the returned array. 10923813dfbdSMatthew G Knepley 1093552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1094552f7358SJed Brown @*/ 1095552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[]) 1096552f7358SJed Brown { 1097552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1098552f7358SJed Brown PetscInt off; 1099552f7358SJed Brown PetscErrorCode ierr; 1100552f7358SJed Brown 1101552f7358SJed Brown PetscFunctionBegin; 1102552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1103552f7358SJed Brown PetscValidPointer(support, 3); 1104552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 1105552f7358SJed Brown *support = &mesh->supports[off]; 1106552f7358SJed Brown PetscFunctionReturn(0); 1107552f7358SJed Brown } 1108552f7358SJed Brown 1109552f7358SJed Brown #undef __FUNCT__ 1110552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport" 1111552f7358SJed Brown /*@ 1112552f7358SJed Brown DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG 1113552f7358SJed Brown 1114552f7358SJed Brown Not collective 1115552f7358SJed Brown 1116552f7358SJed Brown Input Parameters: 1117552f7358SJed Brown + mesh - The DMPlex 1118552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1119552f7358SJed Brown - support - An array of points which are on the in-edges for point p 1120552f7358SJed Brown 1121552f7358SJed Brown Output Parameter: 1122552f7358SJed Brown 1123552f7358SJed Brown Note: 1124552f7358SJed Brown This should be called after all calls to DMPlexSetSupportSize() and DMSetUp(). 1125552f7358SJed Brown 1126552f7358SJed Brown Level: beginner 1127552f7358SJed Brown 1128552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp() 1129552f7358SJed Brown @*/ 1130552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[]) 1131552f7358SJed Brown { 1132552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1133552f7358SJed Brown PetscInt pStart, pEnd; 1134552f7358SJed Brown PetscInt dof, off, c; 1135552f7358SJed Brown PetscErrorCode ierr; 1136552f7358SJed Brown 1137552f7358SJed Brown PetscFunctionBegin; 1138552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1139552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1140552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1141552f7358SJed Brown if (dof) PetscValidPointer(support, 3); 1142552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 114382f516ccSBarry 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); 1144552f7358SJed Brown for (c = 0; c < dof; ++c) { 114582f516ccSBarry 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); 1146552f7358SJed Brown mesh->supports[off+c] = support[c]; 1147552f7358SJed Brown } 1148552f7358SJed Brown PetscFunctionReturn(0); 1149552f7358SJed Brown } 1150552f7358SJed Brown 1151552f7358SJed Brown #undef __FUNCT__ 1152552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport" 1153552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint) 1154552f7358SJed Brown { 1155552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1156552f7358SJed Brown PetscInt pStart, pEnd; 1157552f7358SJed Brown PetscInt dof, off; 1158552f7358SJed Brown PetscErrorCode ierr; 1159552f7358SJed Brown 1160552f7358SJed Brown PetscFunctionBegin; 1161552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1162552f7358SJed Brown ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr); 1163552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 1164552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr); 116582f516ccSBarry 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); 116682f516ccSBarry 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); 116782f516ccSBarry 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); 1168552f7358SJed Brown mesh->supports[off+supportPos] = supportPoint; 1169552f7358SJed Brown PetscFunctionReturn(0); 1170552f7358SJed Brown } 1171552f7358SJed Brown 1172552f7358SJed Brown #undef __FUNCT__ 1173552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure" 1174552f7358SJed Brown /*@C 1175552f7358SJed Brown DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG 1176552f7358SJed Brown 1177552f7358SJed Brown Not collective 1178552f7358SJed Brown 1179552f7358SJed Brown Input Parameters: 1180552f7358SJed Brown + mesh - The DMPlex 1181552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1182552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 11830298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 1184552f7358SJed Brown 1185552f7358SJed Brown Output Parameters: 1186552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 1187552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 1188552f7358SJed Brown 1189552f7358SJed Brown Note: 11900298fd71SBarry Smith If using internal storage (points is NULL on input), each call overwrites the last output. 1191552f7358SJed Brown 11923813dfbdSMatthew G Knepley Fortran Notes: 11933813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 11943813dfbdSMatthew G Knepley include petsc.h90 in your code. 11953813dfbdSMatthew G Knepley 11963813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 11973813dfbdSMatthew G Knepley 1198552f7358SJed Brown Level: beginner 1199552f7358SJed Brown 1200552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1201552f7358SJed Brown @*/ 1202552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1203552f7358SJed Brown { 1204552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1205552f7358SJed Brown PetscInt *closure, *fifo; 12060298fd71SBarry Smith const PetscInt *tmp = NULL, *tmpO = NULL; 1207552f7358SJed Brown PetscInt tmpSize, t; 1208552f7358SJed Brown PetscInt depth = 0, maxSize; 1209552f7358SJed Brown PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 1210552f7358SJed Brown PetscErrorCode ierr; 1211552f7358SJed Brown 1212552f7358SJed Brown PetscFunctionBegin; 1213552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1214552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 1215552f7358SJed Brown /* This is only 1-level */ 1216552f7358SJed Brown if (useCone) { 1217552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 1218552f7358SJed Brown ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 1219552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 1220552f7358SJed Brown } else { 1221552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 1222552f7358SJed Brown ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 1223552f7358SJed Brown } 1224bfbcdd7aSMatthew G. Knepley if (depth == 1) { 1225bfbcdd7aSMatthew G. Knepley if (*points) { 1226bfbcdd7aSMatthew G. Knepley closure = *points; 1227bfbcdd7aSMatthew G. Knepley } else { 1228bfbcdd7aSMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 1229bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1230bfbcdd7aSMatthew G. Knepley } 1231bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1232bfbcdd7aSMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 1233bfbcdd7aSMatthew G. Knepley closure[closureSize] = tmp[t]; 1234bfbcdd7aSMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[t] : 0; 1235bfbcdd7aSMatthew G. Knepley } 1236bfbcdd7aSMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 1237bfbcdd7aSMatthew G. Knepley if (points) *points = closure; 1238bfbcdd7aSMatthew G. Knepley PetscFunctionReturn(0); 1239bfbcdd7aSMatthew G. Knepley } 1240bfbcdd7aSMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 1241bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1242bfbcdd7aSMatthew G. Knepley if (*points) { 1243bfbcdd7aSMatthew G. Knepley closure = *points; 1244bfbcdd7aSMatthew G. Knepley } else { 1245bfbcdd7aSMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 1246bfbcdd7aSMatthew G. Knepley } 1247bfbcdd7aSMatthew G. Knepley closure[0] = p; closure[1] = 0; 1248552f7358SJed Brown for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 1249552f7358SJed Brown const PetscInt cp = tmp[t]; 1250552f7358SJed Brown const PetscInt co = tmpO ? tmpO[t] : 0; 1251552f7358SJed Brown 1252552f7358SJed Brown closure[closureSize] = cp; 1253552f7358SJed Brown closure[closureSize+1] = co; 1254552f7358SJed Brown fifo[fifoSize] = cp; 1255552f7358SJed Brown fifo[fifoSize+1] = co; 1256552f7358SJed Brown } 1257bfbcdd7aSMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 1258552f7358SJed Brown while (fifoSize - fifoStart) { 1259552f7358SJed Brown const PetscInt q = fifo[fifoStart]; 1260552f7358SJed Brown const PetscInt o = fifo[fifoStart+1]; 1261552f7358SJed Brown const PetscInt rev = o >= 0 ? 0 : 1; 1262552f7358SJed Brown const PetscInt off = rev ? -(o+1) : o; 1263552f7358SJed Brown 1264552f7358SJed Brown if (useCone) { 1265552f7358SJed Brown ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 1266552f7358SJed Brown ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 1267552f7358SJed Brown ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 1268552f7358SJed Brown } else { 1269552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 1270552f7358SJed Brown ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 12710298fd71SBarry Smith tmpO = NULL; 1272552f7358SJed Brown } 1273552f7358SJed Brown for (t = 0; t < tmpSize; ++t) { 1274552f7358SJed Brown const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 1275552f7358SJed Brown const PetscInt cp = tmp[i]; 12762e1b13c2SMatthew 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. */ 12772e1b13c2SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 12782e1b13c2SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 12792e1b13c2SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 1280552f7358SJed Brown PetscInt c; 1281552f7358SJed Brown 12822e1b13c2SMatthew G. Knepley if (rev) { 12832e1b13c2SMatthew G. Knepley PetscInt childSize, coff; 12842e1b13c2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 12852e1b13c2SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 12862e1b13c2SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 12872e1b13c2SMatthew G. Knepley } 1288552f7358SJed Brown /* Check for duplicate */ 1289552f7358SJed Brown for (c = 0; c < closureSize; c += 2) { 1290552f7358SJed Brown if (closure[c] == cp) break; 1291552f7358SJed Brown } 1292552f7358SJed Brown if (c == closureSize) { 1293552f7358SJed Brown closure[closureSize] = cp; 1294552f7358SJed Brown closure[closureSize+1] = co; 1295552f7358SJed Brown fifo[fifoSize] = cp; 1296552f7358SJed Brown fifo[fifoSize+1] = co; 1297552f7358SJed Brown closureSize += 2; 1298552f7358SJed Brown fifoSize += 2; 1299552f7358SJed Brown } 1300552f7358SJed Brown } 1301552f7358SJed Brown fifoStart += 2; 1302552f7358SJed Brown } 1303552f7358SJed Brown if (numPoints) *numPoints = closureSize/2; 1304552f7358SJed Brown if (points) *points = closure; 1305552f7358SJed Brown ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 1306552f7358SJed Brown PetscFunctionReturn(0); 1307552f7358SJed Brown } 1308552f7358SJed Brown 1309552f7358SJed Brown #undef __FUNCT__ 13109bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal" 13119bf0dad6SMatthew G. Knepley /*@C 13129bf0dad6SMatthew 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 13139bf0dad6SMatthew G. Knepley 13149bf0dad6SMatthew G. Knepley Not collective 13159bf0dad6SMatthew G. Knepley 13169bf0dad6SMatthew G. Knepley Input Parameters: 13179bf0dad6SMatthew G. Knepley + mesh - The DMPlex 13189bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 13199bf0dad6SMatthew G. Knepley . orientation - The orientation of the point 13209bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 13219bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used 13229bf0dad6SMatthew G. Knepley 13239bf0dad6SMatthew G. Knepley Output Parameters: 13249bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints 13259bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...] 13269bf0dad6SMatthew G. Knepley 13279bf0dad6SMatthew G. Knepley Note: 13289bf0dad6SMatthew G. Knepley If using internal storage (points is NULL on input), each call overwrites the last output. 13299bf0dad6SMatthew G. Knepley 13309bf0dad6SMatthew G. Knepley Fortran Notes: 13319bf0dad6SMatthew G. Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 13329bf0dad6SMatthew G. Knepley include petsc.h90 in your code. 13339bf0dad6SMatthew G. Knepley 13349bf0dad6SMatthew G. Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 13359bf0dad6SMatthew G. Knepley 13369bf0dad6SMatthew G. Knepley Level: beginner 13379bf0dad6SMatthew G. Knepley 13389bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 13399bf0dad6SMatthew G. Knepley @*/ 13409bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 13419bf0dad6SMatthew G. Knepley { 13429bf0dad6SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 13439bf0dad6SMatthew G. Knepley PetscInt *closure, *fifo; 13449bf0dad6SMatthew G. Knepley const PetscInt *tmp = NULL, *tmpO = NULL; 13459bf0dad6SMatthew G. Knepley PetscInt tmpSize, t; 13469bf0dad6SMatthew G. Knepley PetscInt depth = 0, maxSize; 13479bf0dad6SMatthew G. Knepley PetscInt closureSize = 2, fifoSize = 0, fifoStart = 0; 13489bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 13499bf0dad6SMatthew G. Knepley 13509bf0dad6SMatthew G. Knepley PetscFunctionBegin; 13519bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 13529bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 13539bf0dad6SMatthew G. Knepley /* This is only 1-level */ 13549bf0dad6SMatthew G. Knepley if (useCone) { 13559bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr); 13569bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr); 13579bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr); 13589bf0dad6SMatthew G. Knepley } else { 13599bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr); 13609bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr); 13619bf0dad6SMatthew G. Knepley } 13629bf0dad6SMatthew G. Knepley if (depth == 1) { 13639bf0dad6SMatthew G. Knepley if (*points) { 13649bf0dad6SMatthew G. Knepley closure = *points; 13659bf0dad6SMatthew G. Knepley } else { 13669bf0dad6SMatthew G. Knepley maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1); 13679bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13689bf0dad6SMatthew G. Knepley } 13699bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13709bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2) { 13719bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13729bf0dad6SMatthew G. Knepley closure[closureSize] = tmp[i]; 13739bf0dad6SMatthew G. Knepley closure[closureSize+1] = tmpO ? tmpO[i] : 0; 13749bf0dad6SMatthew G. Knepley } 13759bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 13769bf0dad6SMatthew G. Knepley if (points) *points = closure; 13779bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 13789bf0dad6SMatthew G. Knepley } 13799bf0dad6SMatthew G. Knepley maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1); 13809bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 13819bf0dad6SMatthew G. Knepley if (*points) { 13829bf0dad6SMatthew G. Knepley closure = *points; 13839bf0dad6SMatthew G. Knepley } else { 13849bf0dad6SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr); 13859bf0dad6SMatthew G. Knepley } 13869bf0dad6SMatthew G. Knepley closure[0] = p; closure[1] = ornt; 13879bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) { 13889bf0dad6SMatthew G. Knepley const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize; 13899bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 13909bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 13919bf0dad6SMatthew G. Knepley 13929bf0dad6SMatthew G. Knepley if (ornt < 0) { 13939bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 13949bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 13959bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 13969bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 13979bf0dad6SMatthew G. Knepley } 13989bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 13999bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14009bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14019bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14029bf0dad6SMatthew G. Knepley } 14039bf0dad6SMatthew G. Knepley /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */ 14049bf0dad6SMatthew G. Knepley while (fifoSize - fifoStart) { 14059bf0dad6SMatthew G. Knepley const PetscInt q = fifo[fifoStart]; 14069bf0dad6SMatthew G. Knepley const PetscInt o = fifo[fifoStart+1]; 14079bf0dad6SMatthew G. Knepley const PetscInt rev = o >= 0 ? 0 : 1; 14089bf0dad6SMatthew G. Knepley const PetscInt off = rev ? -(o+1) : o; 14099bf0dad6SMatthew G. Knepley 14109bf0dad6SMatthew G. Knepley if (useCone) { 14119bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr); 14129bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr); 14139bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr); 14149bf0dad6SMatthew G. Knepley } else { 14159bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr); 14169bf0dad6SMatthew G. Knepley ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr); 14179bf0dad6SMatthew G. Knepley tmpO = NULL; 14189bf0dad6SMatthew G. Knepley } 14199bf0dad6SMatthew G. Knepley for (t = 0; t < tmpSize; ++t) { 14209bf0dad6SMatthew G. Knepley const PetscInt i = ((rev ? tmpSize-t : t) + off)%tmpSize; 14219bf0dad6SMatthew G. Knepley const PetscInt cp = tmp[i]; 14229bf0dad6SMatthew 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. */ 14239bf0dad6SMatthew G. Knepley /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1) 14249bf0dad6SMatthew G. Knepley const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */ 14259bf0dad6SMatthew G. Knepley PetscInt co = tmpO ? tmpO[i] : 0; 14269bf0dad6SMatthew G. Knepley PetscInt c; 14279bf0dad6SMatthew G. Knepley 14289bf0dad6SMatthew G. Knepley if (rev) { 14299bf0dad6SMatthew G. Knepley PetscInt childSize, coff; 14309bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr); 14319bf0dad6SMatthew G. Knepley coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i]; 14329bf0dad6SMatthew G. Knepley co = childSize ? -(((coff+childSize-1)%childSize)+1) : 0; 14339bf0dad6SMatthew G. Knepley } 14349bf0dad6SMatthew G. Knepley /* Check for duplicate */ 14359bf0dad6SMatthew G. Knepley for (c = 0; c < closureSize; c += 2) { 14369bf0dad6SMatthew G. Knepley if (closure[c] == cp) break; 14379bf0dad6SMatthew G. Knepley } 14389bf0dad6SMatthew G. Knepley if (c == closureSize) { 14399bf0dad6SMatthew G. Knepley closure[closureSize] = cp; 14409bf0dad6SMatthew G. Knepley closure[closureSize+1] = co; 14419bf0dad6SMatthew G. Knepley fifo[fifoSize] = cp; 14429bf0dad6SMatthew G. Knepley fifo[fifoSize+1] = co; 14439bf0dad6SMatthew G. Knepley closureSize += 2; 14449bf0dad6SMatthew G. Knepley fifoSize += 2; 14459bf0dad6SMatthew G. Knepley } 14469bf0dad6SMatthew G. Knepley } 14479bf0dad6SMatthew G. Knepley fifoStart += 2; 14489bf0dad6SMatthew G. Knepley } 14499bf0dad6SMatthew G. Knepley if (numPoints) *numPoints = closureSize/2; 14509bf0dad6SMatthew G. Knepley if (points) *points = closure; 14519bf0dad6SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr); 14529bf0dad6SMatthew G. Knepley PetscFunctionReturn(0); 14539bf0dad6SMatthew G. Knepley } 14549bf0dad6SMatthew G. Knepley 14559bf0dad6SMatthew G. Knepley #undef __FUNCT__ 1456552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure" 1457552f7358SJed Brown /*@C 1458552f7358SJed 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 1459552f7358SJed Brown 1460552f7358SJed Brown Not collective 1461552f7358SJed Brown 1462552f7358SJed Brown Input Parameters: 1463552f7358SJed Brown + mesh - The DMPlex 1464552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart() 1465552f7358SJed Brown . useCone - PETSC_TRUE for in-edges, otherwise use out-edges 1466e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit 1467e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit 1468552f7358SJed Brown 1469552f7358SJed Brown Note: 14700298fd71SBarry Smith If not using internal storage (points is not NULL on input), this call is unnecessary 1471552f7358SJed Brown 14723813dfbdSMatthew G Knepley Fortran Notes: 14733813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 14743813dfbdSMatthew G Knepley include petsc.h90 in your code. 14753813dfbdSMatthew G Knepley 14763813dfbdSMatthew G Knepley The numPoints argument is not present in the Fortran 90 binding since it is internal to the array. 14773813dfbdSMatthew G Knepley 1478552f7358SJed Brown Level: beginner 1479552f7358SJed Brown 1480552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone() 1481552f7358SJed Brown @*/ 1482552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[]) 1483552f7358SJed Brown { 1484552f7358SJed Brown PetscErrorCode ierr; 1485552f7358SJed Brown 1486552f7358SJed Brown PetscFunctionBegin; 1487552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1488e5c84f05SJed Brown if (numPoints) PetscValidIntPointer(numPoints,4); 1489e5c84f05SJed Brown if (points) PetscValidPointer(points,5); 1490552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr); 14914ff43b2cSJed Brown if (numPoints) *numPoints = 0; 1492552f7358SJed Brown PetscFunctionReturn(0); 1493552f7358SJed Brown } 1494552f7358SJed Brown 1495552f7358SJed Brown #undef __FUNCT__ 1496552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes" 1497552f7358SJed Brown /*@ 1498552f7358SJed Brown DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG 1499552f7358SJed Brown 1500552f7358SJed Brown Not collective 1501552f7358SJed Brown 1502552f7358SJed Brown Input Parameter: 1503552f7358SJed Brown . mesh - The DMPlex 1504552f7358SJed Brown 1505552f7358SJed Brown Output Parameters: 1506552f7358SJed Brown + maxConeSize - The maximum number of in-edges 1507552f7358SJed Brown - maxSupportSize - The maximum number of out-edges 1508552f7358SJed Brown 1509552f7358SJed Brown Level: beginner 1510552f7358SJed Brown 1511552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart() 1512552f7358SJed Brown @*/ 1513552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize) 1514552f7358SJed Brown { 1515552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1516552f7358SJed Brown 1517552f7358SJed Brown PetscFunctionBegin; 1518552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1519552f7358SJed Brown if (maxConeSize) *maxConeSize = mesh->maxConeSize; 1520552f7358SJed Brown if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize; 1521552f7358SJed Brown PetscFunctionReturn(0); 1522552f7358SJed Brown } 1523552f7358SJed Brown 1524552f7358SJed Brown #undef __FUNCT__ 1525552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex" 1526552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm) 1527552f7358SJed Brown { 1528552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1529552f7358SJed Brown PetscInt size; 1530552f7358SJed Brown PetscErrorCode ierr; 1531552f7358SJed Brown 1532552f7358SJed Brown PetscFunctionBegin; 1533552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1534552f7358SJed Brown ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr); 1535552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr); 15361795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr); 15371795a4d1SJed Brown ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr); 1538552f7358SJed Brown if (mesh->maxSupportSize) { 1539552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1540552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr); 15411795a4d1SJed Brown ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr); 1542552f7358SJed Brown } 1543552f7358SJed Brown PetscFunctionReturn(0); 1544552f7358SJed Brown } 1545552f7358SJed Brown 1546552f7358SJed Brown #undef __FUNCT__ 1547552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex" 1548552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm) 1549552f7358SJed Brown { 1550552f7358SJed Brown PetscErrorCode ierr; 1551552f7358SJed Brown 1552552f7358SJed Brown PetscFunctionBegin; 15534d9407bcSMatthew G. Knepley if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);} 15544d9407bcSMatthew G. Knepley ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr); 1555552f7358SJed Brown PetscFunctionReturn(0); 1556552f7358SJed Brown } 1557552f7358SJed Brown 1558552f7358SJed Brown #undef __FUNCT__ 1559552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize" 1560552f7358SJed Brown /*@ 1561552f7358SJed Brown DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation 1562552f7358SJed Brown 1563552f7358SJed Brown Not collective 1564552f7358SJed Brown 1565552f7358SJed Brown Input Parameter: 1566552f7358SJed Brown . mesh - The DMPlex 1567552f7358SJed Brown 1568552f7358SJed Brown Output Parameter: 1569552f7358SJed Brown 1570552f7358SJed Brown Note: 1571552f7358SJed Brown This should be called after all calls to DMPlexSetCone() 1572552f7358SJed Brown 1573552f7358SJed Brown Level: beginner 1574552f7358SJed Brown 1575552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone() 1576552f7358SJed Brown @*/ 1577552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm) 1578552f7358SJed Brown { 1579552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1580552f7358SJed Brown PetscInt *offsets; 1581552f7358SJed Brown PetscInt supportSize; 1582552f7358SJed Brown PetscInt pStart, pEnd, p; 1583552f7358SJed Brown PetscErrorCode ierr; 1584552f7358SJed Brown 1585552f7358SJed Brown PetscFunctionBegin; 1586552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 158782f516ccSBarry Smith if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex"); 1588552f7358SJed Brown /* Calculate support sizes */ 1589552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1590552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1591552f7358SJed Brown PetscInt dof, off, c; 1592552f7358SJed Brown 1593552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1594552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1595552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1596552f7358SJed Brown ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr); 1597552f7358SJed Brown } 1598552f7358SJed Brown } 1599552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1600552f7358SJed Brown PetscInt dof; 1601552f7358SJed Brown 1602552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr); 16030d644c17SKarl Rupp 1604552f7358SJed Brown mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof); 1605552f7358SJed Brown } 1606552f7358SJed Brown ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr); 1607552f7358SJed Brown /* Calculate supports */ 1608552f7358SJed Brown ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr); 16091795a4d1SJed Brown ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr); 16101795a4d1SJed Brown ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr); 1611552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1612552f7358SJed Brown PetscInt dof, off, c; 1613552f7358SJed Brown 1614552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr); 1615552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr); 1616552f7358SJed Brown for (c = off; c < off+dof; ++c) { 1617552f7358SJed Brown const PetscInt q = mesh->cones[c]; 1618552f7358SJed Brown PetscInt offS; 1619552f7358SJed Brown 1620552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr); 16210d644c17SKarl Rupp 1622552f7358SJed Brown mesh->supports[offS+offsets[q]] = p; 1623552f7358SJed Brown ++offsets[q]; 1624552f7358SJed Brown } 1625552f7358SJed Brown } 1626552f7358SJed Brown ierr = PetscFree(offsets);CHKERRQ(ierr); 1627552f7358SJed Brown PetscFunctionReturn(0); 1628552f7358SJed Brown } 1629552f7358SJed Brown 1630552f7358SJed Brown #undef __FUNCT__ 1631552f7358SJed Brown #define __FUNCT__ "DMPlexStratify" 1632552f7358SJed Brown /*@ 1633552f7358SJed Brown DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and 1634552f7358SJed Brown can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the 1635552f7358SJed Brown same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in 1636552f7358SJed Brown the DAG. 1637552f7358SJed Brown 1638552f7358SJed Brown Not collective 1639552f7358SJed Brown 1640552f7358SJed Brown Input Parameter: 1641552f7358SJed Brown . mesh - The DMPlex 1642552f7358SJed Brown 1643552f7358SJed Brown Output Parameter: 1644552f7358SJed Brown 1645552f7358SJed Brown Notes: 1646552f7358SJed Brown The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would 1647552f7358SJed Brown have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1. 1648552f7358SJed Brown 1649552f7358SJed Brown This should be called after all calls to DMPlexSymmetrize() 1650552f7358SJed Brown 1651552f7358SJed Brown Level: beginner 1652552f7358SJed Brown 1653552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize() 1654552f7358SJed Brown @*/ 1655552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm) 1656552f7358SJed Brown { 1657aa50250dSMatthew G. Knepley DMLabel label; 1658552f7358SJed Brown PetscInt pStart, pEnd, p; 1659552f7358SJed Brown PetscInt numRoots = 0, numLeaves = 0; 1660552f7358SJed Brown PetscErrorCode ierr; 1661552f7358SJed Brown 1662552f7358SJed Brown PetscFunctionBegin; 1663552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1664552f7358SJed Brown ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1665552f7358SJed Brown /* Calculate depth */ 1666aa50250dSMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 1667aa50250dSMatthew G. Knepley ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr); 1668aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 1669552f7358SJed Brown /* Initialize roots and count leaves */ 1670552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1671552f7358SJed Brown PetscInt coneSize, supportSize; 1672552f7358SJed Brown 1673552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1674552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1675552f7358SJed Brown if (!coneSize && supportSize) { 1676552f7358SJed Brown ++numRoots; 1677aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1678552f7358SJed Brown } else if (!supportSize && coneSize) { 1679552f7358SJed Brown ++numLeaves; 1680552f7358SJed Brown } else if (!supportSize && !coneSize) { 1681552f7358SJed Brown /* Isolated points */ 1682aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr); 1683552f7358SJed Brown } 1684552f7358SJed Brown } 1685552f7358SJed Brown if (numRoots + numLeaves == (pEnd - pStart)) { 1686552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 1687552f7358SJed Brown PetscInt coneSize, supportSize; 1688552f7358SJed Brown 1689552f7358SJed Brown ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 1690552f7358SJed Brown ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 1691552f7358SJed Brown if (!supportSize && coneSize) { 1692aa50250dSMatthew G. Knepley ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr); 1693552f7358SJed Brown } 1694552f7358SJed Brown } 1695552f7358SJed Brown } else { 169674ef644bSMatthew G. Knepley IS pointIS; 169774ef644bSMatthew G. Knepley PetscInt numPoints = 0, level = 0; 1698552f7358SJed Brown 169974ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 170074ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 170174ef644bSMatthew G. Knepley while (numPoints) { 170274ef644bSMatthew G. Knepley const PetscInt *points; 170374ef644bSMatthew G. Knepley const PetscInt newLevel = level+1; 170474ef644bSMatthew G. Knepley 170574ef644bSMatthew G. Knepley ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr); 170674ef644bSMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 170774ef644bSMatthew G. Knepley const PetscInt point = points[p]; 170874ef644bSMatthew G. Knepley const PetscInt *support; 170974ef644bSMatthew G. Knepley PetscInt supportSize, s; 171074ef644bSMatthew G. Knepley 171174ef644bSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr); 171274ef644bSMatthew G. Knepley ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr); 171374ef644bSMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 171474ef644bSMatthew G. Knepley ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr); 1715552f7358SJed Brown } 1716552f7358SJed Brown } 17175edfc765SMatthew G. Knepley ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr); 171874ef644bSMatthew G. Knepley ++level; 171974ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172074ef644bSMatthew G. Knepley ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr); 172174ef644bSMatthew G. Knepley if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);} 172274ef644bSMatthew G. Knepley else {numPoints = 0;} 172374ef644bSMatthew G. Knepley } 172474ef644bSMatthew G. Knepley ierr = ISDestroy(&pointIS);CHKERRQ(ierr); 172574ef644bSMatthew G. Knepley } 1726552f7358SJed Brown ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr); 1727552f7358SJed Brown PetscFunctionReturn(0); 1728552f7358SJed Brown } 1729552f7358SJed Brown 1730552f7358SJed Brown #undef __FUNCT__ 1731552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin" 1732552f7358SJed Brown /*@C 1733552f7358SJed Brown DMPlexGetJoin - Get an array for the join of the set of points 1734552f7358SJed Brown 1735552f7358SJed Brown Not Collective 1736552f7358SJed Brown 1737552f7358SJed Brown Input Parameters: 1738552f7358SJed Brown + dm - The DMPlex object 1739552f7358SJed Brown . numPoints - The number of input points for the join 1740552f7358SJed Brown - points - The input points 1741552f7358SJed Brown 1742552f7358SJed Brown Output Parameters: 1743552f7358SJed Brown + numCoveredPoints - The number of points in the join 1744552f7358SJed Brown - coveredPoints - The points in the join 1745552f7358SJed Brown 1746552f7358SJed Brown Level: intermediate 1747552f7358SJed Brown 1748552f7358SJed Brown Note: Currently, this is restricted to a single level join 1749552f7358SJed Brown 17503813dfbdSMatthew G Knepley Fortran Notes: 17513813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 17523813dfbdSMatthew G Knepley include petsc.h90 in your code. 17533813dfbdSMatthew G Knepley 17543813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 17553813dfbdSMatthew G Knepley 1756552f7358SJed Brown .keywords: mesh 1757552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet() 1758552f7358SJed Brown @*/ 1759552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1760552f7358SJed Brown { 1761552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1762552f7358SJed Brown PetscInt *join[2]; 1763552f7358SJed Brown PetscInt joinSize, i = 0; 1764552f7358SJed Brown PetscInt dof, off, p, c, m; 1765552f7358SJed Brown PetscErrorCode ierr; 1766552f7358SJed Brown 1767552f7358SJed Brown PetscFunctionBegin; 1768552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1769552f7358SJed Brown PetscValidPointer(points, 2); 1770552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1771552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1772552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1773552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1774552f7358SJed Brown /* Copy in support of first point */ 1775552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr); 1776552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr); 1777552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1778552f7358SJed Brown join[i][joinSize] = mesh->supports[off+joinSize]; 1779552f7358SJed Brown } 1780552f7358SJed Brown /* Check each successive support */ 1781552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 1782552f7358SJed Brown PetscInt newJoinSize = 0; 1783552f7358SJed Brown 1784552f7358SJed Brown ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr); 1785552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr); 1786552f7358SJed Brown for (c = 0; c < dof; ++c) { 1787552f7358SJed Brown const PetscInt point = mesh->supports[off+c]; 1788552f7358SJed Brown 1789552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1790552f7358SJed Brown if (point == join[i][m]) { 1791552f7358SJed Brown join[1-i][newJoinSize++] = point; 1792552f7358SJed Brown break; 1793552f7358SJed Brown } 1794552f7358SJed Brown } 1795552f7358SJed Brown } 1796552f7358SJed Brown joinSize = newJoinSize; 1797552f7358SJed Brown i = 1-i; 1798552f7358SJed Brown } 1799552f7358SJed Brown *numCoveredPoints = joinSize; 1800552f7358SJed Brown *coveredPoints = join[i]; 1801552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1802552f7358SJed Brown PetscFunctionReturn(0); 1803552f7358SJed Brown } 1804552f7358SJed Brown 1805552f7358SJed Brown #undef __FUNCT__ 1806552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin" 1807552f7358SJed Brown /*@C 1808552f7358SJed Brown DMPlexRestoreJoin - Restore an array for the join of the set of points 1809552f7358SJed Brown 1810552f7358SJed Brown Not Collective 1811552f7358SJed Brown 1812552f7358SJed Brown Input Parameters: 1813552f7358SJed Brown + dm - The DMPlex object 1814552f7358SJed Brown . numPoints - The number of input points for the join 1815552f7358SJed Brown - points - The input points 1816552f7358SJed Brown 1817552f7358SJed Brown Output Parameters: 1818552f7358SJed Brown + numCoveredPoints - The number of points in the join 1819552f7358SJed Brown - coveredPoints - The points in the join 1820552f7358SJed Brown 18213813dfbdSMatthew G Knepley Fortran Notes: 18223813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18233813dfbdSMatthew G Knepley include petsc.h90 in your code. 18243813dfbdSMatthew G Knepley 18253813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18263813dfbdSMatthew G Knepley 1827552f7358SJed Brown Level: intermediate 1828552f7358SJed Brown 1829552f7358SJed Brown .keywords: mesh 1830552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet() 1831552f7358SJed Brown @*/ 1832552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1833552f7358SJed Brown { 1834552f7358SJed Brown PetscErrorCode ierr; 1835552f7358SJed Brown 1836552f7358SJed Brown PetscFunctionBegin; 1837552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1838d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 1839d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 1840d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints, 5); 1841552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 1842d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 1843552f7358SJed Brown PetscFunctionReturn(0); 1844552f7358SJed Brown } 1845552f7358SJed Brown 1846552f7358SJed Brown #undef __FUNCT__ 1847552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin" 1848552f7358SJed Brown /*@C 1849552f7358SJed Brown DMPlexGetFullJoin - Get an array for the join of the set of points 1850552f7358SJed Brown 1851552f7358SJed Brown Not Collective 1852552f7358SJed Brown 1853552f7358SJed Brown Input Parameters: 1854552f7358SJed Brown + dm - The DMPlex object 1855552f7358SJed Brown . numPoints - The number of input points for the join 1856552f7358SJed Brown - points - The input points 1857552f7358SJed Brown 1858552f7358SJed Brown Output Parameters: 1859552f7358SJed Brown + numCoveredPoints - The number of points in the join 1860552f7358SJed Brown - coveredPoints - The points in the join 1861552f7358SJed Brown 18623813dfbdSMatthew G Knepley Fortran Notes: 18633813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 18643813dfbdSMatthew G Knepley include petsc.h90 in your code. 18653813dfbdSMatthew G Knepley 18663813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 18673813dfbdSMatthew G Knepley 1868552f7358SJed Brown Level: intermediate 1869552f7358SJed Brown 1870552f7358SJed Brown .keywords: mesh 1871552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet() 1872552f7358SJed Brown @*/ 1873552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 1874552f7358SJed Brown { 1875552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1876552f7358SJed Brown PetscInt *offsets, **closures; 1877552f7358SJed Brown PetscInt *join[2]; 1878552f7358SJed Brown PetscInt depth = 0, maxSize, joinSize = 0, i = 0; 1879552f7358SJed Brown PetscInt p, d, c, m; 1880552f7358SJed Brown PetscErrorCode ierr; 1881552f7358SJed Brown 1882552f7358SJed Brown PetscFunctionBegin; 1883552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1884552f7358SJed Brown PetscValidPointer(points, 2); 1885552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 1886552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 1887552f7358SJed Brown 1888552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 18891795a4d1SJed Brown ierr = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr); 1890552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1891e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxSupportSize,depth+1); 1892552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr); 1893552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr); 1894552f7358SJed Brown 1895552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 1896552f7358SJed Brown PetscInt closureSize; 1897552f7358SJed Brown 1898552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr); 18990d644c17SKarl Rupp 1900552f7358SJed Brown offsets[p*(depth+2)+0] = 0; 1901552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1902552f7358SJed Brown PetscInt pStart, pEnd, i; 1903552f7358SJed Brown 1904552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr); 1905552f7358SJed Brown for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) { 1906552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 1907552f7358SJed Brown offsets[p*(depth+2)+d+1] = i; 1908552f7358SJed Brown break; 1909552f7358SJed Brown } 1910552f7358SJed Brown } 1911552f7358SJed Brown if (i == closureSize) offsets[p*(depth+2)+d+1] = i; 1912552f7358SJed Brown } 191382f516ccSBarry 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); 1914552f7358SJed Brown } 1915552f7358SJed Brown for (d = 0; d < depth+1; ++d) { 1916552f7358SJed Brown PetscInt dof; 1917552f7358SJed Brown 1918552f7358SJed Brown /* Copy in support of first point */ 1919552f7358SJed Brown dof = offsets[d+1] - offsets[d]; 1920552f7358SJed Brown for (joinSize = 0; joinSize < dof; ++joinSize) { 1921552f7358SJed Brown join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2]; 1922552f7358SJed Brown } 1923552f7358SJed Brown /* Check each successive cone */ 1924552f7358SJed Brown for (p = 1; p < numPoints && joinSize; ++p) { 1925552f7358SJed Brown PetscInt newJoinSize = 0; 1926552f7358SJed Brown 1927552f7358SJed Brown dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d]; 1928552f7358SJed Brown for (c = 0; c < dof; ++c) { 1929552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2]; 1930552f7358SJed Brown 1931552f7358SJed Brown for (m = 0; m < joinSize; ++m) { 1932552f7358SJed Brown if (point == join[i][m]) { 1933552f7358SJed Brown join[1-i][newJoinSize++] = point; 1934552f7358SJed Brown break; 1935552f7358SJed Brown } 1936552f7358SJed Brown } 1937552f7358SJed Brown } 1938552f7358SJed Brown joinSize = newJoinSize; 1939552f7358SJed Brown i = 1-i; 1940552f7358SJed Brown } 1941552f7358SJed Brown if (joinSize) break; 1942552f7358SJed Brown } 1943552f7358SJed Brown *numCoveredPoints = joinSize; 1944552f7358SJed Brown *coveredPoints = join[i]; 1945552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 19460298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr); 1947552f7358SJed Brown } 1948552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 1949552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr); 1950552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr); 1951552f7358SJed Brown PetscFunctionReturn(0); 1952552f7358SJed Brown } 1953552f7358SJed Brown 1954552f7358SJed Brown #undef __FUNCT__ 1955552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet" 1956552f7358SJed Brown /*@C 1957552f7358SJed Brown DMPlexGetMeet - Get an array for the meet of the set of points 1958552f7358SJed Brown 1959552f7358SJed Brown Not Collective 1960552f7358SJed Brown 1961552f7358SJed Brown Input Parameters: 1962552f7358SJed Brown + dm - The DMPlex object 1963552f7358SJed Brown . numPoints - The number of input points for the meet 1964552f7358SJed Brown - points - The input points 1965552f7358SJed Brown 1966552f7358SJed Brown Output Parameters: 1967552f7358SJed Brown + numCoveredPoints - The number of points in the meet 1968552f7358SJed Brown - coveredPoints - The points in the meet 1969552f7358SJed Brown 1970552f7358SJed Brown Level: intermediate 1971552f7358SJed Brown 1972552f7358SJed Brown Note: Currently, this is restricted to a single level meet 1973552f7358SJed Brown 19743813dfbdSMatthew G Knepley Fortran Notes: 19753813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 19763813dfbdSMatthew G Knepley include petsc.h90 in your code. 19773813dfbdSMatthew G Knepley 19783813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 19793813dfbdSMatthew G Knepley 1980552f7358SJed Brown .keywords: mesh 1981552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin() 1982552f7358SJed Brown @*/ 1983552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints) 1984552f7358SJed Brown { 1985552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 1986552f7358SJed Brown PetscInt *meet[2]; 1987552f7358SJed Brown PetscInt meetSize, i = 0; 1988552f7358SJed Brown PetscInt dof, off, p, c, m; 1989552f7358SJed Brown PetscErrorCode ierr; 1990552f7358SJed Brown 1991552f7358SJed Brown PetscFunctionBegin; 1992552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 1993552f7358SJed Brown PetscValidPointer(points, 2); 1994552f7358SJed Brown PetscValidPointer(numCoveringPoints, 3); 1995552f7358SJed Brown PetscValidPointer(coveringPoints, 4); 1996552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 1997552f7358SJed Brown ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 1998552f7358SJed Brown /* Copy in cone of first point */ 1999552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr); 2000552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr); 2001552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2002552f7358SJed Brown meet[i][meetSize] = mesh->cones[off+meetSize]; 2003552f7358SJed Brown } 2004552f7358SJed Brown /* Check each successive cone */ 2005552f7358SJed Brown for (p = 1; p < numPoints; ++p) { 2006552f7358SJed Brown PetscInt newMeetSize = 0; 2007552f7358SJed Brown 2008552f7358SJed Brown ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr); 2009552f7358SJed Brown ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr); 2010552f7358SJed Brown for (c = 0; c < dof; ++c) { 2011552f7358SJed Brown const PetscInt point = mesh->cones[off+c]; 2012552f7358SJed Brown 2013552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2014552f7358SJed Brown if (point == meet[i][m]) { 2015552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2016552f7358SJed Brown break; 2017552f7358SJed Brown } 2018552f7358SJed Brown } 2019552f7358SJed Brown } 2020552f7358SJed Brown meetSize = newMeetSize; 2021552f7358SJed Brown i = 1-i; 2022552f7358SJed Brown } 2023552f7358SJed Brown *numCoveringPoints = meetSize; 2024552f7358SJed Brown *coveringPoints = meet[i]; 2025552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2026552f7358SJed Brown PetscFunctionReturn(0); 2027552f7358SJed Brown } 2028552f7358SJed Brown 2029552f7358SJed Brown #undef __FUNCT__ 2030552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet" 2031552f7358SJed Brown /*@C 2032552f7358SJed Brown DMPlexRestoreMeet - Restore an array for the meet of the set of points 2033552f7358SJed Brown 2034552f7358SJed Brown Not Collective 2035552f7358SJed Brown 2036552f7358SJed Brown Input Parameters: 2037552f7358SJed Brown + dm - The DMPlex object 2038552f7358SJed Brown . numPoints - The number of input points for the meet 2039552f7358SJed Brown - points - The input points 2040552f7358SJed Brown 2041552f7358SJed Brown Output Parameters: 2042552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2043552f7358SJed Brown - coveredPoints - The points in the meet 2044552f7358SJed Brown 2045552f7358SJed Brown Level: intermediate 2046552f7358SJed Brown 20473813dfbdSMatthew G Knepley Fortran Notes: 20483813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20493813dfbdSMatthew G Knepley include petsc.h90 in your code. 20503813dfbdSMatthew G Knepley 20513813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20523813dfbdSMatthew G Knepley 2053552f7358SJed Brown .keywords: mesh 2054552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin() 2055552f7358SJed Brown @*/ 2056552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2057552f7358SJed Brown { 2058552f7358SJed Brown PetscErrorCode ierr; 2059552f7358SJed Brown 2060552f7358SJed Brown PetscFunctionBegin; 2061552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2062d7902bd2SMatthew G. Knepley if (points) PetscValidIntPointer(points,3); 2063d7902bd2SMatthew G. Knepley if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4); 2064d7902bd2SMatthew G. Knepley PetscValidPointer(coveredPoints,5); 2065552f7358SJed Brown ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr); 2066d7902bd2SMatthew G. Knepley if (numCoveredPoints) *numCoveredPoints = 0; 2067552f7358SJed Brown PetscFunctionReturn(0); 2068552f7358SJed Brown } 2069552f7358SJed Brown 2070552f7358SJed Brown #undef __FUNCT__ 2071552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet" 2072552f7358SJed Brown /*@C 2073552f7358SJed Brown DMPlexGetFullMeet - Get an array for the meet of the set of points 2074552f7358SJed Brown 2075552f7358SJed Brown Not Collective 2076552f7358SJed Brown 2077552f7358SJed Brown Input Parameters: 2078552f7358SJed Brown + dm - The DMPlex object 2079552f7358SJed Brown . numPoints - The number of input points for the meet 2080552f7358SJed Brown - points - The input points 2081552f7358SJed Brown 2082552f7358SJed Brown Output Parameters: 2083552f7358SJed Brown + numCoveredPoints - The number of points in the meet 2084552f7358SJed Brown - coveredPoints - The points in the meet 2085552f7358SJed Brown 2086552f7358SJed Brown Level: intermediate 2087552f7358SJed Brown 20883813dfbdSMatthew G Knepley Fortran Notes: 20893813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 20903813dfbdSMatthew G Knepley include petsc.h90 in your code. 20913813dfbdSMatthew G Knepley 20923813dfbdSMatthew G Knepley The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array. 20933813dfbdSMatthew G Knepley 2094552f7358SJed Brown .keywords: mesh 2095552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin() 2096552f7358SJed Brown @*/ 2097552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints) 2098552f7358SJed Brown { 2099552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 2100552f7358SJed Brown PetscInt *offsets, **closures; 2101552f7358SJed Brown PetscInt *meet[2]; 2102552f7358SJed Brown PetscInt height = 0, maxSize, meetSize = 0, i = 0; 2103552f7358SJed Brown PetscInt p, h, c, m; 2104552f7358SJed Brown PetscErrorCode ierr; 2105552f7358SJed Brown 2106552f7358SJed Brown PetscFunctionBegin; 2107552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 2108552f7358SJed Brown PetscValidPointer(points, 2); 2109552f7358SJed Brown PetscValidPointer(numCoveredPoints, 3); 2110552f7358SJed Brown PetscValidPointer(coveredPoints, 4); 2111552f7358SJed Brown 2112552f7358SJed Brown ierr = DMPlexGetDepth(dm, &height);CHKERRQ(ierr); 2113785e854fSJed Brown ierr = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr); 2114552f7358SJed Brown ierr = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2115e7b80042SMatthew G. Knepley maxSize = PetscPowInt(mesh->maxConeSize,height+1); 2116552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr); 2117552f7358SJed Brown ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr); 2118552f7358SJed Brown 2119552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 2120552f7358SJed Brown PetscInt closureSize; 2121552f7358SJed Brown 2122552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr); 21230d644c17SKarl Rupp 2124552f7358SJed Brown offsets[p*(height+2)+0] = 0; 2125552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2126552f7358SJed Brown PetscInt pStart, pEnd, i; 2127552f7358SJed Brown 2128552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr); 2129552f7358SJed Brown for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) { 2130552f7358SJed Brown if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) { 2131552f7358SJed Brown offsets[p*(height+2)+h+1] = i; 2132552f7358SJed Brown break; 2133552f7358SJed Brown } 2134552f7358SJed Brown } 2135552f7358SJed Brown if (i == closureSize) offsets[p*(height+2)+h+1] = i; 2136552f7358SJed Brown } 213782f516ccSBarry 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); 2138552f7358SJed Brown } 2139552f7358SJed Brown for (h = 0; h < height+1; ++h) { 2140552f7358SJed Brown PetscInt dof; 2141552f7358SJed Brown 2142552f7358SJed Brown /* Copy in cone of first point */ 2143552f7358SJed Brown dof = offsets[h+1] - offsets[h]; 2144552f7358SJed Brown for (meetSize = 0; meetSize < dof; ++meetSize) { 2145552f7358SJed Brown meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2]; 2146552f7358SJed Brown } 2147552f7358SJed Brown /* Check each successive cone */ 2148552f7358SJed Brown for (p = 1; p < numPoints && meetSize; ++p) { 2149552f7358SJed Brown PetscInt newMeetSize = 0; 2150552f7358SJed Brown 2151552f7358SJed Brown dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h]; 2152552f7358SJed Brown for (c = 0; c < dof; ++c) { 2153552f7358SJed Brown const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2]; 2154552f7358SJed Brown 2155552f7358SJed Brown for (m = 0; m < meetSize; ++m) { 2156552f7358SJed Brown if (point == meet[i][m]) { 2157552f7358SJed Brown meet[1-i][newMeetSize++] = point; 2158552f7358SJed Brown break; 2159552f7358SJed Brown } 2160552f7358SJed Brown } 2161552f7358SJed Brown } 2162552f7358SJed Brown meetSize = newMeetSize; 2163552f7358SJed Brown i = 1-i; 2164552f7358SJed Brown } 2165552f7358SJed Brown if (meetSize) break; 2166552f7358SJed Brown } 2167552f7358SJed Brown *numCoveredPoints = meetSize; 2168552f7358SJed Brown *coveredPoints = meet[i]; 2169552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 21700298fd71SBarry Smith ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr); 2171552f7358SJed Brown } 2172552f7358SJed Brown ierr = PetscFree(closures);CHKERRQ(ierr); 2173552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr); 2174552f7358SJed Brown ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr); 2175552f7358SJed Brown PetscFunctionReturn(0); 2176552f7358SJed Brown } 2177552f7358SJed Brown 2178552f7358SJed Brown #undef __FUNCT__ 21794e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual" 21804e3744c5SMatthew G. Knepley /*@C 21814e3744c5SMatthew G. Knepley DMPlexEqual - Determine if two DMs have the same topology 21824e3744c5SMatthew G. Knepley 21834e3744c5SMatthew G. Knepley Not Collective 21844e3744c5SMatthew G. Knepley 21854e3744c5SMatthew G. Knepley Input Parameters: 21864e3744c5SMatthew G. Knepley + dmA - A DMPlex object 21874e3744c5SMatthew G. Knepley - dmB - A DMPlex object 21884e3744c5SMatthew G. Knepley 21894e3744c5SMatthew G. Knepley Output Parameters: 21904e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical 21914e3744c5SMatthew G. Knepley 21924e3744c5SMatthew G. Knepley Level: intermediate 21934e3744c5SMatthew G. Knepley 21944e3744c5SMatthew G. Knepley Notes: 21954e3744c5SMatthew G. Knepley We are not solving graph isomorphism, so we do not permutation. 21964e3744c5SMatthew G. Knepley 21974e3744c5SMatthew G. Knepley .keywords: mesh 21984e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone() 21994e3744c5SMatthew G. Knepley @*/ 22004e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal) 22014e3744c5SMatthew G. Knepley { 22024e3744c5SMatthew G. Knepley PetscInt depth, depthB, pStart, pEnd, pStartB, pEndB, p; 22034e3744c5SMatthew G. Knepley PetscErrorCode ierr; 22044e3744c5SMatthew G. Knepley 22054e3744c5SMatthew G. Knepley PetscFunctionBegin; 22064e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmA, DM_CLASSID, 1); 22074e3744c5SMatthew G. Knepley PetscValidHeaderSpecific(dmB, DM_CLASSID, 2); 22084e3744c5SMatthew G. Knepley PetscValidPointer(equal, 3); 22094e3744c5SMatthew G. Knepley 22104e3744c5SMatthew G. Knepley *equal = PETSC_FALSE; 22114e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr); 22124e3744c5SMatthew G. Knepley ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr); 22134e3744c5SMatthew G. Knepley if (depth != depthB) PetscFunctionReturn(0); 22144e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmA, &pStart, &pEnd);CHKERRQ(ierr); 22154e3744c5SMatthew G. Knepley ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr); 22164e3744c5SMatthew G. Knepley if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0); 22174e3744c5SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 22184e3744c5SMatthew G. Knepley const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB; 22194e3744c5SMatthew G. Knepley PetscInt coneSize, coneSizeB, c, supportSize, supportSizeB, s; 22204e3744c5SMatthew G. Knepley 22214e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr); 22224e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr); 22234e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr); 22244e3744c5SMatthew G. Knepley ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr); 22254e3744c5SMatthew G. Knepley ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr); 22264e3744c5SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr); 22274e3744c5SMatthew G. Knepley if (coneSize != coneSizeB) PetscFunctionReturn(0); 22284e3744c5SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 22294e3744c5SMatthew G. Knepley if (cone[c] != coneB[c]) PetscFunctionReturn(0); 22304e3744c5SMatthew G. Knepley if (ornt[c] != orntB[c]) PetscFunctionReturn(0); 22314e3744c5SMatthew G. Knepley } 22324e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr); 22334e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr); 22344e3744c5SMatthew G. Knepley ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr); 22354e3744c5SMatthew G. Knepley ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr); 22364e3744c5SMatthew G. Knepley if (supportSize != supportSizeB) PetscFunctionReturn(0); 22374e3744c5SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 22384e3744c5SMatthew G. Knepley if (support[s] != supportB[s]) PetscFunctionReturn(0); 22394e3744c5SMatthew G. Knepley } 22404e3744c5SMatthew G. Knepley } 22414e3744c5SMatthew G. Knepley *equal = PETSC_TRUE; 22424e3744c5SMatthew G. Knepley PetscFunctionReturn(0); 22434e3744c5SMatthew G. Knepley } 22444e3744c5SMatthew G. Knepley 22454e3744c5SMatthew G. Knepley #undef __FUNCT__ 224618ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices" 224718ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices) 2248a6dfd86eSKarl Rupp { 224982f516ccSBarry Smith MPI_Comm comm; 2250552f7358SJed Brown PetscErrorCode ierr; 2251552f7358SJed Brown 2252552f7358SJed Brown PetscFunctionBegin; 225382f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2254552f7358SJed Brown PetscValidPointer(numFaceVertices,3); 2255552f7358SJed Brown switch (cellDim) { 2256552f7358SJed Brown case 0: 2257552f7358SJed Brown *numFaceVertices = 0; 2258552f7358SJed Brown break; 2259552f7358SJed Brown case 1: 2260552f7358SJed Brown *numFaceVertices = 1; 2261552f7358SJed Brown break; 2262552f7358SJed Brown case 2: 2263552f7358SJed Brown switch (numCorners) { 226419436ca2SJed Brown case 3: /* triangle */ 226519436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2266552f7358SJed Brown break; 226719436ca2SJed Brown case 4: /* quadrilateral */ 226819436ca2SJed Brown *numFaceVertices = 2; /* Edge has 2 vertices */ 2269552f7358SJed Brown break; 227019436ca2SJed Brown case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */ 227119436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2272552f7358SJed Brown break; 227319436ca2SJed Brown case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */ 227419436ca2SJed Brown *numFaceVertices = 3; /* Edge has 3 vertices */ 2275552f7358SJed Brown break; 2276552f7358SJed Brown default: 2277552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2278552f7358SJed Brown } 2279552f7358SJed Brown break; 2280552f7358SJed Brown case 3: 2281552f7358SJed Brown switch (numCorners) { 228219436ca2SJed Brown case 4: /* tetradehdron */ 228319436ca2SJed Brown *numFaceVertices = 3; /* Face has 3 vertices */ 2284552f7358SJed Brown break; 228519436ca2SJed Brown case 6: /* tet cohesive cells */ 228619436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2287552f7358SJed Brown break; 228819436ca2SJed Brown case 8: /* hexahedron */ 228919436ca2SJed Brown *numFaceVertices = 4; /* Face has 4 vertices */ 2290552f7358SJed Brown break; 229119436ca2SJed Brown case 9: /* tet cohesive Lagrange cells */ 229219436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2293552f7358SJed Brown break; 229419436ca2SJed Brown case 10: /* quadratic tetrahedron */ 229519436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2296552f7358SJed Brown break; 229719436ca2SJed Brown case 12: /* hex cohesive Lagrange cells */ 229819436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2299552f7358SJed Brown break; 230019436ca2SJed Brown case 18: /* quadratic tet cohesive Lagrange cells */ 230119436ca2SJed Brown *numFaceVertices = 6; /* Face has 6 vertices */ 2302552f7358SJed Brown break; 230319436ca2SJed Brown case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */ 230419436ca2SJed Brown *numFaceVertices = 9; /* Face has 9 vertices */ 2305552f7358SJed Brown break; 2306552f7358SJed Brown default: 2307552f7358SJed Brown SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim); 2308552f7358SJed Brown } 2309552f7358SJed Brown break; 2310552f7358SJed Brown default: 2311552f7358SJed Brown SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim); 2312552f7358SJed Brown } 2313552f7358SJed Brown PetscFunctionReturn(0); 2314552f7358SJed Brown } 2315552f7358SJed Brown 2316552f7358SJed Brown #undef __FUNCT__ 2317d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient" 2318d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */ 2319d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm) 2320d27a0f52SMatthew G. Knepley { 2321a1b4d4a2SMatthew G. Knepley PetscBT seenCells, flippedCells, seenFaces; 2322a1b4d4a2SMatthew G. Knepley PetscInt *faceFIFO, fTop, fBottom; 2323a1b4d4a2SMatthew G. Knepley PetscInt dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO; 2324d27a0f52SMatthew G. Knepley PetscErrorCode ierr; 2325d27a0f52SMatthew G. Knepley 2326d27a0f52SMatthew G. Knepley PetscFunctionBegin; 2327d27a0f52SMatthew G. Knepley /* Truth Table 2328d27a0f52SMatthew G. Knepley mismatch flips do action mismatch flipA ^ flipB action 2329d27a0f52SMatthew G. Knepley F 0 flips no F F F 2330d27a0f52SMatthew G. Knepley F 1 flip yes F T T 2331d27a0f52SMatthew G. Knepley F 2 flips no T F T 2332d27a0f52SMatthew G. Knepley T 0 flips yes T T F 2333d27a0f52SMatthew G. Knepley T 1 flip no 2334d27a0f52SMatthew G. Knepley T 2 flips yes 2335d27a0f52SMatthew G. Knepley */ 2336a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 2337d27a0f52SMatthew G. Knepley ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr); 2338a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 2339d27a0f52SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr); 2340a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr); 2341a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr); 2342a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr); 2343a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr); 2344a1b4d4a2SMatthew G. Knepley ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr); 2345a1b4d4a2SMatthew G. Knepley ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr); 2346785e854fSJed Brown ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr); 2347a1b4d4a2SMatthew G. Knepley fTop = fBottom = 0; 2348a1b4d4a2SMatthew G. Knepley /* Initialize FIFO with first cell */ 2349defeeaeaSMatthew G. Knepley if (cEnd > cStart) { 2350a1b4d4a2SMatthew G. Knepley const PetscInt *cone; 2351a1b4d4a2SMatthew G. Knepley PetscInt coneSize; 2352a1b4d4a2SMatthew G. Knepley 2353a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr); 2354a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr); 2355a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 2356a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = cone[c]; 2357a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr); 2358a1b4d4a2SMatthew G. Knepley } 2359a1b4d4a2SMatthew G. Knepley } 2360a1b4d4a2SMatthew G. Knepley /* Consider each face in FIFO */ 2361a1b4d4a2SMatthew G. Knepley while (fTop < fBottom) { 2362d27a0f52SMatthew G. Knepley const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB; 2363a1b4d4a2SMatthew G. Knepley PetscInt supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1; 2364d27a0f52SMatthew G. Knepley PetscInt seenA, flippedA, seenB, flippedB, mismatch; 2365d27a0f52SMatthew G. Knepley 2366a1b4d4a2SMatthew G. Knepley face = faceFIFO[fTop++]; 2367a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2368a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2369d27a0f52SMatthew G. Knepley if (supportSize < 2) continue; 2370d27a0f52SMatthew G. Knepley if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize); 2371a1b4d4a2SMatthew G. Knepley seenA = PetscBTLookup(seenCells, support[0]-cStart); 237286cff514SMatthew G. Knepley flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0; 2373a1b4d4a2SMatthew G. Knepley seenB = PetscBTLookup(seenCells, support[1]-cStart); 237486cff514SMatthew G. Knepley flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0; 2375d27a0f52SMatthew G. Knepley 2376d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr); 2377d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr); 2378d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr); 2379d27a0f52SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr); 2380d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr); 2381d27a0f52SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr); 2382a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeA; ++c) { 2383a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) { 2384a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneA[c]; 2385a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr); 2386a1b4d4a2SMatthew G. Knepley } 2387a1b4d4a2SMatthew G. Knepley if (coneA[c] == face) posA = c; 2388a1b4d4a2SMatthew 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); 2389a1b4d4a2SMatthew G. Knepley } 2390a1b4d4a2SMatthew 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]); 2391a1b4d4a2SMatthew G. Knepley for (c = 0; c < coneSizeB; ++c) { 2392a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) { 2393a1b4d4a2SMatthew G. Knepley faceFIFO[fBottom++] = coneB[c]; 2394a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr); 2395a1b4d4a2SMatthew G. Knepley } 2396a1b4d4a2SMatthew G. Knepley if (coneB[c] == face) posB = c; 2397a1b4d4a2SMatthew 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); 2398a1b4d4a2SMatthew G. Knepley } 2399a1b4d4a2SMatthew 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]); 2400d27a0f52SMatthew G. Knepley 2401d27a0f52SMatthew G. Knepley if (dim == 1) { 2402d27a0f52SMatthew G. Knepley mismatch = posA == posB; 2403d27a0f52SMatthew G. Knepley } else { 2404d27a0f52SMatthew G. Knepley mismatch = coneOA[posA] == coneOB[posB]; 2405d27a0f52SMatthew G. Knepley } 2406d27a0f52SMatthew G. Knepley 2407d27a0f52SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 2408d27a0f52SMatthew 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]); 2409d27a0f52SMatthew G. Knepley if (!seenA && !flippedA) { 2410a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr); 2411d27a0f52SMatthew G. Knepley } else if (!seenB && !flippedB) { 2412a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr); 2413d27a0f52SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 241486cff514SMatthew 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"); 2415a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr); 2416a1b4d4a2SMatthew G. Knepley ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr); 2417d27a0f52SMatthew G. Knepley } 2418fedde076SMatthew G. Knepley /* Now all subdomains are oriented, but we need a consistent parallel orientation */ 2419fedde076SMatthew G. Knepley { 2420fedde076SMatthew G. Knepley /* Find a representative face (edge) separating pairs of procs */ 2421fedde076SMatthew G. Knepley PetscSF sf; 2422fedde076SMatthew G. Knepley const PetscInt *lpoints; 2423fedde076SMatthew G. Knepley const PetscSFNode *rpoints; 242413048561SMatthew G. Knepley PetscInt *neighbors, *nranks; 2425fedde076SMatthew G. Knepley PetscInt numLeaves, numRoots, numNeighbors = 0, l, n; 2426a1b4d4a2SMatthew G. Knepley 2427fedde076SMatthew G. Knepley ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr); 2428fedde076SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr); 2429fedde076SMatthew G. Knepley if (numLeaves >= 0) { 243062ad4a6aSMatthew G. Knepley const PetscInt *cone, *ornt, *support; 243162ad4a6aSMatthew G. Knepley PetscInt coneSize, supportSize; 243262ad4a6aSMatthew G. Knepley int *rornt, *lornt; /* PetscSF cannot handle smaller than int */ 243313048561SMatthew G. Knepley PetscBool *match, flipped = PETSC_FALSE; 243462ad4a6aSMatthew G. Knepley 2435fedde076SMatthew G. Knepley ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr); 2436fedde076SMatthew G. Knepley /* I know this is p^2 time in general, but for bounded degree its alright */ 2437fedde076SMatthew G. Knepley for (l = 0; l < numLeaves; ++l) { 2438fedde076SMatthew G. Knepley const PetscInt face = lpoints[l]; 2439fedde076SMatthew G. Knepley if ((face >= fStart) && (face < fEnd)) { 2440fedde076SMatthew G. Knepley const PetscInt rank = rpoints[l].rank; 2441fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break; 2442fedde076SMatthew G. Knepley if (n >= numNeighbors) { 2443fedde076SMatthew G. Knepley PetscInt supportSize; 2444fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2445fedde076SMatthew G. Knepley if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize); 2446fedde076SMatthew G. Knepley neighbors[numNeighbors++] = l; 2447fedde076SMatthew G. Knepley } 2448fedde076SMatthew G. Knepley } 2449fedde076SMatthew G. Knepley } 245013048561SMatthew G. Knepley ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr); 2451fedde076SMatthew G. Knepley for (face = fStart; face < fEnd; ++face) { 2452fedde076SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr); 2453fedde076SMatthew G. Knepley if (supportSize != 1) continue; 2454fedde076SMatthew G. Knepley ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr); 2455fedde076SMatthew G. Knepley 2456fedde076SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr); 245762ad4a6aSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr); 2458fedde076SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr); 2459fedde076SMatthew G. Knepley for (c = 0; c < coneSize; ++c) if (cone[c] == face) break; 24605b7033fcSMatthew G. Knepley if (dim == 1) { 24615b7033fcSMatthew G. Knepley /* Use cone position instead, shifted to -1 or 1 */ 24625b7033fcSMatthew G. Knepley rornt[face] = c*2-1; 24635b7033fcSMatthew G. Knepley } else { 2464fedde076SMatthew G. Knepley if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 : 1; 2465fedde076SMatthew G. Knepley else rornt[face] = ornt[c] < 0 ? 1 : -1; 2466fedde076SMatthew G. Knepley } 24675b7033fcSMatthew G. Knepley } 2468fedde076SMatthew G. Knepley /* Mark each edge with match or nomatch */ 2469fedde076SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2470fedde076SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr); 2471fedde076SMatthew G. Knepley for (n = 0; n < numNeighbors; ++n) { 2472fedde076SMatthew G. Knepley const PetscInt face = lpoints[neighbors[n]]; 2473fedde076SMatthew G. Knepley 247413048561SMatthew G. Knepley if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE; 247513048561SMatthew G. Knepley else match[n] = PETSC_FALSE; 247613048561SMatthew G. Knepley nranks[n] = rpoints[neighbors[n]].rank; 2477fedde076SMatthew G. Knepley } 247813048561SMatthew G. Knepley /* Collect the graph on 0 */ 247913048561SMatthew G. Knepley { 248013048561SMatthew G. Knepley MPI_Comm comm = PetscObjectComm((PetscObject) sf); 248113048561SMatthew G. Knepley PetscBT seenProcs, flippedProcs; 248213048561SMatthew G. Knepley PetscInt *procFIFO, pTop, pBottom; 248313048561SMatthew G. Knepley PetscInt *adj = NULL; 248413048561SMatthew G. Knepley PetscBool *val = NULL; 248513048561SMatthew G. Knepley PetscMPIInt *recvcounts = NULL, *displs = NULL, p; 248613048561SMatthew G. Knepley PetscMPIInt N = numNeighbors, numProcs = 0, rank; 248713048561SMatthew G. Knepley PetscInt debug = 0; 248813048561SMatthew G. Knepley 248913048561SMatthew G. Knepley ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 249013048561SMatthew G. Knepley if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);} 249113048561SMatthew G. Knepley ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr); 249213048561SMatthew G. Knepley ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr); 249313048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 249413048561SMatthew G. Knepley displs[p+1] = displs[p] + recvcounts[p]; 249513048561SMatthew G. Knepley } 249613048561SMatthew G. Knepley if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);} 249713048561SMatthew G. Knepley ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr); 249813048561SMatthew G. Knepley ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 249913048561SMatthew G. Knepley if (debug) { 250013048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 250113048561SMatthew G. Knepley ierr = PetscPrintf(comm, "Proc %d:\n", p); 250213048561SMatthew G. Knepley for (n = 0; n < recvcounts[p]; ++n) { 250313048561SMatthew G. Knepley ierr = PetscPrintf(comm, " edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]); 250413048561SMatthew G. Knepley } 250513048561SMatthew G. Knepley } 250613048561SMatthew G. Knepley } 250713048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr); 250813048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr); 250913048561SMatthew G. Knepley ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr); 251013048561SMatthew G. Knepley ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr); 251113048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr); 251213048561SMatthew G. Knepley pTop = pBottom = 0; 251313048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 251413048561SMatthew G. Knepley if (PetscBTLookup(seenProcs, p)) continue; 251513048561SMatthew G. Knepley /* Initialize FIFO with next proc */ 251613048561SMatthew G. Knepley procFIFO[pBottom++] = p; 251713048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr); 251813048561SMatthew G. Knepley /* Consider each proc in FIFO */ 251913048561SMatthew G. Knepley while (pTop < pBottom) { 252013048561SMatthew G. Knepley PetscInt proc, nproc, seen, flippedA, flippedB, mismatch; 252113048561SMatthew G. Knepley 252213048561SMatthew G. Knepley proc = procFIFO[pTop++]; 252313048561SMatthew G. Knepley flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0; 252413048561SMatthew G. Knepley /* Loop over neighboring procs */ 252513048561SMatthew G. Knepley for (n = 0; n < recvcounts[proc]; ++n) { 252613048561SMatthew G. Knepley nproc = adj[displs[proc]+n]; 252713048561SMatthew G. Knepley mismatch = val[displs[proc]+n] ? 0 : 1; 252813048561SMatthew G. Knepley seen = PetscBTLookup(seenProcs, nproc); 252913048561SMatthew G. Knepley flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0; 253013048561SMatthew G. Knepley 253113048561SMatthew G. Knepley if (mismatch ^ (flippedA ^ flippedB)) { 253213048561SMatthew 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); 253313048561SMatthew G. Knepley if (!flippedB) { 253413048561SMatthew G. Knepley ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr); 253513048561SMatthew G. Knepley } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable"); 253613048561SMatthew 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"); 253713048561SMatthew G. Knepley if (!seen) { 253813048561SMatthew G. Knepley procFIFO[pBottom++] = nproc; 253913048561SMatthew G. Knepley ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr); 254013048561SMatthew G. Knepley } 254113048561SMatthew G. Knepley } 254213048561SMatthew G. Knepley } 254313048561SMatthew G. Knepley } 254413048561SMatthew G. Knepley ierr = PetscFree(procFIFO);CHKERRQ(ierr); 254513048561SMatthew G. Knepley 254613048561SMatthew G. Knepley ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr); 254713048561SMatthew G. Knepley ierr = PetscFree2(adj,val);CHKERRQ(ierr); 254813048561SMatthew G. Knepley { 254913048561SMatthew G. Knepley PetscBool *flips; 255013048561SMatthew G. Knepley 255113048561SMatthew G. Knepley ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr); 255213048561SMatthew G. Knepley for (p = 0; p < numProcs; ++p) { 255313048561SMatthew G. Knepley flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE; 255413048561SMatthew G. Knepley if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);} 255513048561SMatthew G. Knepley } 255613048561SMatthew G. Knepley ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr); 255713048561SMatthew G. Knepley ierr = PetscFree(flips);CHKERRQ(ierr); 255813048561SMatthew G. Knepley } 255913048561SMatthew G. Knepley ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr); 256013048561SMatthew G. Knepley ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr); 256113048561SMatthew G. Knepley } 256213048561SMatthew G. Knepley ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr); 2563fedde076SMatthew G. Knepley ierr = PetscFree(neighbors);CHKERRQ(ierr); 256413048561SMatthew G. Knepley if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}} 2565fedde076SMatthew G. Knepley } 2566fedde076SMatthew G. Knepley } 2567fedde076SMatthew G. Knepley /* Reverse flipped cells in the mesh */ 2568d27a0f52SMatthew G. Knepley ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr); 2569d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2570d27a0f52SMatthew G. Knepley ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2571a1b4d4a2SMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 2572f4e909fcSMatthew G. Knepley const PetscInt *cone, *coneO, *support; 2573f4e909fcSMatthew G. Knepley PetscInt coneSize, supportSize, faceSize, cp, sp; 2574d27a0f52SMatthew G. Knepley 2575a1b4d4a2SMatthew G. Knepley if (!PetscBTLookup(flippedCells, c-cStart)) continue; 2576a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 2577a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 2578a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr); 2579a1b4d4a2SMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2580a1b4d4a2SMatthew G. Knepley const PetscInt rcp = coneSize-cp-1; 2581a1b4d4a2SMatthew G. Knepley 2582a1b4d4a2SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr); 2583a1b4d4a2SMatthew G. Knepley revcone[cp] = cone[rcp]; 2584a1b4d4a2SMatthew G. Knepley revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp]; 2585d27a0f52SMatthew G. Knepley } 2586a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr); 2587a1b4d4a2SMatthew G. Knepley ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr); 2588f4e909fcSMatthew G. Knepley /* Reverse orientations of support */ 2589f4e909fcSMatthew G. Knepley faceSize = coneSize; 2590f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr); 2591f4e909fcSMatthew G. Knepley ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr); 2592f4e909fcSMatthew G. Knepley for (sp = 0; sp < supportSize; ++sp) { 2593f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr); 2594f4e909fcSMatthew G. Knepley ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr); 2595f4e909fcSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr); 2596f4e909fcSMatthew G. Knepley for (cp = 0; cp < coneSize; ++cp) { 2597f4e909fcSMatthew G. Knepley if (cone[cp] != c) continue; 2598f4e909fcSMatthew G. Knepley ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr); 2599f4e909fcSMatthew G. Knepley } 2600f4e909fcSMatthew G. Knepley } 2601d27a0f52SMatthew G. Knepley } 2602d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr); 2603d27a0f52SMatthew G. Knepley ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr); 2604d27a0f52SMatthew G. Knepley ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr); 2605a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr); 2606a1b4d4a2SMatthew G. Knepley ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr); 2607a1b4d4a2SMatthew G. Knepley ierr = PetscFree(faceFIFO);CHKERRQ(ierr); 2608d27a0f52SMatthew G. Knepley PetscFunctionReturn(0); 2609d27a0f52SMatthew G. Knepley } 2610d27a0f52SMatthew G. Knepley 2611d27a0f52SMatthew G. Knepley #undef __FUNCT__ 26129db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell" 26139db3b87dSMatthew G. Knepley /*@C 26149db3b87dSMatthew G. Knepley DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched. 26159db3b87dSMatthew G. Knepley 26169db3b87dSMatthew G. Knepley Input Parameters: 26179db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell 26189db3b87dSMatthew G. Knepley - cone - The incoming cone 26199db3b87dSMatthew G. Knepley 26209db3b87dSMatthew G. Knepley Output Parameter: 26219db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place) 26229db3b87dSMatthew G. Knepley 26239db3b87dSMatthew G. Knepley Level: developer 26249db3b87dSMatthew G. Knepley 26259db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate() 26269db3b87dSMatthew G. Knepley @*/ 26279db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[]) 26282e1b13c2SMatthew G. Knepley { 26299db3b87dSMatthew G. Knepley int tmpc; 26302e1b13c2SMatthew G. Knepley 26312e1b13c2SMatthew G. Knepley PetscFunctionBegin; 26329db3b87dSMatthew G. Knepley if (dim != 3) PetscFunctionReturn(0); 26339db3b87dSMatthew G. Knepley switch (numCorners) { 26349db3b87dSMatthew G. Knepley case 4: 26351885f254SMatthew G. Knepley tmpc = cone[0]; 26361885f254SMatthew G. Knepley cone[0] = cone[1]; 26371885f254SMatthew G. Knepley cone[1] = tmpc; 26389db3b87dSMatthew G. Knepley break; 26399db3b87dSMatthew G. Knepley case 8: 26409db3b87dSMatthew G. Knepley tmpc = cone[1]; 26419db3b87dSMatthew G. Knepley cone[1] = cone[3]; 26429db3b87dSMatthew G. Knepley cone[3] = tmpc; 26439db3b87dSMatthew G. Knepley break; 26449db3b87dSMatthew G. Knepley default: break; 26459db3b87dSMatthew G. Knepley } 26469db3b87dSMatthew G. Knepley PetscFunctionReturn(0); 26479db3b87dSMatthew G. Knepley } 26489db3b87dSMatthew G. Knepley 26499db3b87dSMatthew G. Knepley #undef __FUNCT__ 26509db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal" 26519db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */ 26529db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[]) 26539db3b87dSMatthew G. Knepley { 26549db3b87dSMatthew G. Knepley PetscInt bound = numCells*numCorners, coff; 26559db3b87dSMatthew G. Knepley PetscErrorCode ierr; 26569db3b87dSMatthew G. Knepley 26579db3b87dSMatthew G. Knepley PetscFunctionBegin; 26589db3b87dSMatthew G. Knepley for (coff = 0; coff < bound; coff += numCorners) { 26599db3b87dSMatthew G. Knepley ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr); 26602e1b13c2SMatthew G. Knepley } 26612e1b13c2SMatthew G. Knepley PetscFunctionReturn(0); 26622e1b13c2SMatthew G. Knepley } 26632e1b13c2SMatthew G. Knepley 2664519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 2665552f7358SJed Brown #include <triangle.h> 2666552f7358SJed Brown 2667552f7358SJed Brown #undef __FUNCT__ 2668552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle" 26690adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx) 26700adebc6cSBarry Smith { 2671552f7358SJed Brown PetscFunctionBegin; 2672552f7358SJed Brown inputCtx->numberofpoints = 0; 2673552f7358SJed Brown inputCtx->numberofpointattributes = 0; 26740298fd71SBarry Smith inputCtx->pointlist = NULL; 26750298fd71SBarry Smith inputCtx->pointattributelist = NULL; 26760298fd71SBarry Smith inputCtx->pointmarkerlist = NULL; 2677552f7358SJed Brown inputCtx->numberofsegments = 0; 26780298fd71SBarry Smith inputCtx->segmentlist = NULL; 26790298fd71SBarry Smith inputCtx->segmentmarkerlist = NULL; 2680552f7358SJed Brown inputCtx->numberoftriangleattributes = 0; 26810298fd71SBarry Smith inputCtx->trianglelist = NULL; 2682552f7358SJed Brown inputCtx->numberofholes = 0; 26830298fd71SBarry Smith inputCtx->holelist = NULL; 2684552f7358SJed Brown inputCtx->numberofregions = 0; 26850298fd71SBarry Smith inputCtx->regionlist = NULL; 2686552f7358SJed Brown PetscFunctionReturn(0); 2687552f7358SJed Brown } 2688552f7358SJed Brown 2689552f7358SJed Brown #undef __FUNCT__ 2690552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle" 26910adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx) 26920adebc6cSBarry Smith { 2693552f7358SJed Brown PetscFunctionBegin; 2694552f7358SJed Brown outputCtx->numberofpoints = 0; 26950298fd71SBarry Smith outputCtx->pointlist = NULL; 26960298fd71SBarry Smith outputCtx->pointattributelist = NULL; 26970298fd71SBarry Smith outputCtx->pointmarkerlist = NULL; 2698552f7358SJed Brown outputCtx->numberoftriangles = 0; 26990298fd71SBarry Smith outputCtx->trianglelist = NULL; 27000298fd71SBarry Smith outputCtx->triangleattributelist = NULL; 27010298fd71SBarry Smith outputCtx->neighborlist = NULL; 27020298fd71SBarry Smith outputCtx->segmentlist = NULL; 27030298fd71SBarry Smith outputCtx->segmentmarkerlist = NULL; 2704552f7358SJed Brown outputCtx->numberofedges = 0; 27050298fd71SBarry Smith outputCtx->edgelist = NULL; 27060298fd71SBarry Smith outputCtx->edgemarkerlist = NULL; 2707552f7358SJed Brown PetscFunctionReturn(0); 2708552f7358SJed Brown } 2709552f7358SJed Brown 2710552f7358SJed Brown #undef __FUNCT__ 2711552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle" 27120adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx) 27130adebc6cSBarry Smith { 2714552f7358SJed Brown PetscFunctionBegin; 271523b0c128SMatthew G. Knepley free(outputCtx->pointlist); 2716552f7358SJed Brown free(outputCtx->pointmarkerlist); 271723b0c128SMatthew G. Knepley free(outputCtx->segmentlist); 271823b0c128SMatthew G. Knepley free(outputCtx->segmentmarkerlist); 2719552f7358SJed Brown free(outputCtx->edgelist); 2720552f7358SJed Brown free(outputCtx->edgemarkerlist); 2721552f7358SJed Brown free(outputCtx->trianglelist); 2722552f7358SJed Brown free(outputCtx->neighborlist); 2723552f7358SJed Brown PetscFunctionReturn(0); 2724552f7358SJed Brown } 2725552f7358SJed Brown 2726552f7358SJed Brown #undef __FUNCT__ 2727552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle" 2728552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm) 2729552f7358SJed Brown { 273082f516ccSBarry Smith MPI_Comm comm; 2731552f7358SJed Brown PetscInt dim = 2; 2732552f7358SJed Brown const PetscBool createConvexHull = PETSC_FALSE; 2733552f7358SJed Brown const PetscBool constrained = PETSC_FALSE; 2734552f7358SJed Brown struct triangulateio in; 2735552f7358SJed Brown struct triangulateio out; 2736552f7358SJed Brown PetscInt vStart, vEnd, v, eStart, eEnd, e; 2737552f7358SJed Brown PetscMPIInt rank; 2738552f7358SJed Brown PetscErrorCode ierr; 2739552f7358SJed Brown 2740552f7358SJed Brown PetscFunctionBegin; 274182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 2742552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2743552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2744552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2745552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 27460d644c17SKarl Rupp 2747552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2748552f7358SJed Brown if (in.numberofpoints > 0) { 2749552f7358SJed Brown PetscSection coordSection; 2750552f7358SJed Brown Vec coordinates; 2751552f7358SJed Brown PetscScalar *array; 2752552f7358SJed Brown 2753785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2754785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2755552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 275669d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 2757552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2758552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2759552f7358SJed Brown const PetscInt idx = v - vStart; 2760552f7358SJed Brown PetscInt off, d; 2761552f7358SJed Brown 2762552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2763552f7358SJed Brown for (d = 0; d < dim; ++d) { 2764552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2765552f7358SJed Brown } 2766552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2767552f7358SJed Brown } 2768552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2769552f7358SJed Brown } 2770552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr); 2771552f7358SJed Brown in.numberofsegments = eEnd - eStart; 2772552f7358SJed Brown if (in.numberofsegments > 0) { 2773785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr); 2774785e854fSJed Brown ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr); 2775552f7358SJed Brown for (e = eStart; e < eEnd; ++e) { 2776552f7358SJed Brown const PetscInt idx = e - eStart; 2777552f7358SJed Brown const PetscInt *cone; 2778552f7358SJed Brown 2779552f7358SJed Brown ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr); 27800d644c17SKarl Rupp 2781552f7358SJed Brown in.segmentlist[idx*2+0] = cone[0] - vStart; 2782552f7358SJed Brown in.segmentlist[idx*2+1] = cone[1] - vStart; 27830d644c17SKarl Rupp 2784552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr); 2785552f7358SJed Brown } 2786552f7358SJed Brown } 2787552f7358SJed Brown #if 0 /* Do not currently support holes */ 2788552f7358SJed Brown PetscReal *holeCoords; 2789552f7358SJed Brown PetscInt h, d; 2790552f7358SJed Brown 2791552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2792552f7358SJed Brown if (in.numberofholes > 0) { 2793785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2794552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2795552f7358SJed Brown for (d = 0; d < dim; ++d) { 2796552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2797552f7358SJed Brown } 2798552f7358SJed Brown } 2799552f7358SJed Brown } 2800552f7358SJed Brown #endif 2801552f7358SJed Brown if (!rank) { 2802552f7358SJed Brown char args[32]; 2803552f7358SJed Brown 2804552f7358SJed Brown /* Take away 'Q' for verbose output */ 2805552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 2806552f7358SJed Brown if (createConvexHull) { 2807552f7358SJed Brown ierr = PetscStrcat(args, "c");CHKERRQ(ierr); 2808552f7358SJed Brown } 2809552f7358SJed Brown if (constrained) { 2810552f7358SJed Brown ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr); 2811552f7358SJed Brown } 28120298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2813552f7358SJed Brown } 2814552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2815552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2816552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2817552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2818552f7358SJed Brown ierr = PetscFree(in.holelist);CHKERRQ(ierr); 2819552f7358SJed Brown 2820552f7358SJed Brown { 2821552f7358SJed Brown const PetscInt numCorners = 3; 2822552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2823552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2824552f7358SJed Brown const int *cells = out.trianglelist; 2825552f7358SJed Brown const double *meshCoords = out.pointlist; 2826552f7358SJed Brown 28270fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 2828552f7358SJed Brown /* Set labels */ 2829552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2830552f7358SJed Brown if (out.pointmarkerlist[v]) { 2831552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2832552f7358SJed Brown } 2833552f7358SJed Brown } 2834552f7358SJed Brown if (interpolate) { 2835552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2836552f7358SJed Brown if (out.edgemarkerlist[e]) { 2837552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2838552f7358SJed Brown const PetscInt *edges; 2839552f7358SJed Brown PetscInt numEdges; 2840552f7358SJed Brown 2841552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2842552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2843552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2844552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2845552f7358SJed Brown } 2846552f7358SJed Brown } 2847552f7358SJed Brown } 2848552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 2849552f7358SJed Brown } 2850552f7358SJed Brown #if 0 /* Do not currently support holes */ 2851552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2852552f7358SJed Brown #endif 2853552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2854552f7358SJed Brown PetscFunctionReturn(0); 2855552f7358SJed Brown } 2856552f7358SJed Brown 2857552f7358SJed Brown #undef __FUNCT__ 2858552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle" 2859552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined) 2860552f7358SJed Brown { 286182f516ccSBarry Smith MPI_Comm comm; 2862552f7358SJed Brown PetscInt dim = 2; 2863552f7358SJed Brown struct triangulateio in; 2864552f7358SJed Brown struct triangulateio out; 2865552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 2866552f7358SJed Brown PetscMPIInt rank; 2867552f7358SJed Brown PetscErrorCode ierr; 2868552f7358SJed Brown 2869552f7358SJed Brown PetscFunctionBegin; 287082f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 2871552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 2872552f7358SJed Brown ierr = InitInput_Triangle(&in);CHKERRQ(ierr); 2873552f7358SJed Brown ierr = InitOutput_Triangle(&out);CHKERRQ(ierr); 2874552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 2875552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 2876552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 28770d644c17SKarl Rupp 2878552f7358SJed Brown in.numberofpoints = vEnd - vStart; 2879552f7358SJed Brown if (in.numberofpoints > 0) { 2880552f7358SJed Brown PetscSection coordSection; 2881552f7358SJed Brown Vec coordinates; 2882552f7358SJed Brown PetscScalar *array; 2883552f7358SJed Brown 2884785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr); 2885785e854fSJed Brown ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr); 2886552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 288769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 2888552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 2889552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 2890552f7358SJed Brown const PetscInt idx = v - vStart; 2891552f7358SJed Brown PetscInt off, d; 2892552f7358SJed Brown 2893552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 2894552f7358SJed Brown for (d = 0; d < dim; ++d) { 2895552f7358SJed Brown in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 2896552f7358SJed Brown } 2897552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 2898552f7358SJed Brown } 2899552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 2900552f7358SJed Brown } 2901552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 29020d644c17SKarl Rupp 2903552f7358SJed Brown in.numberofcorners = 3; 2904552f7358SJed Brown in.numberoftriangles = cEnd - cStart; 29050d644c17SKarl Rupp 2906552f7358SJed Brown in.trianglearealist = (double*) maxVolumes; 2907552f7358SJed Brown if (in.numberoftriangles > 0) { 2908785e854fSJed Brown ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr); 2909552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 2910552f7358SJed Brown const PetscInt idx = c - cStart; 29110298fd71SBarry Smith PetscInt *closure = NULL; 2912552f7358SJed Brown PetscInt closureSize; 2913552f7358SJed Brown 2914552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2915552f7358SJed 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); 2916552f7358SJed Brown for (v = 0; v < 3; ++v) { 2917552f7358SJed Brown in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart; 2918552f7358SJed Brown } 2919552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 2920552f7358SJed Brown } 2921552f7358SJed Brown } 2922552f7358SJed Brown /* TODO: Segment markers are missing on input */ 2923552f7358SJed Brown #if 0 /* Do not currently support holes */ 2924552f7358SJed Brown PetscReal *holeCoords; 2925552f7358SJed Brown PetscInt h, d; 2926552f7358SJed Brown 2927552f7358SJed Brown ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr); 2928552f7358SJed Brown if (in.numberofholes > 0) { 2929785e854fSJed Brown ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr); 2930552f7358SJed Brown for (h = 0; h < in.numberofholes; ++h) { 2931552f7358SJed Brown for (d = 0; d < dim; ++d) { 2932552f7358SJed Brown in.holelist[h*dim+d] = holeCoords[h*dim+d]; 2933552f7358SJed Brown } 2934552f7358SJed Brown } 2935552f7358SJed Brown } 2936552f7358SJed Brown #endif 2937552f7358SJed Brown if (!rank) { 2938552f7358SJed Brown char args[32]; 2939552f7358SJed Brown 2940552f7358SJed Brown /* Take away 'Q' for verbose output */ 2941552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr); 29420298fd71SBarry Smith triangulate(args, &in, &out, NULL); 2943552f7358SJed Brown } 2944552f7358SJed Brown ierr = PetscFree(in.pointlist);CHKERRQ(ierr); 2945552f7358SJed Brown ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr); 2946552f7358SJed Brown ierr = PetscFree(in.segmentlist);CHKERRQ(ierr); 2947552f7358SJed Brown ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr); 2948552f7358SJed Brown ierr = PetscFree(in.trianglelist);CHKERRQ(ierr); 2949552f7358SJed Brown 2950552f7358SJed Brown { 2951552f7358SJed Brown const PetscInt numCorners = 3; 2952552f7358SJed Brown const PetscInt numCells = out.numberoftriangles; 2953552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 2954552f7358SJed Brown const int *cells = out.trianglelist; 2955552f7358SJed Brown const double *meshCoords = out.pointlist; 2956552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 2957552f7358SJed Brown 29580fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 2959552f7358SJed Brown /* Set labels */ 2960552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 2961552f7358SJed Brown if (out.pointmarkerlist[v]) { 2962552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 2963552f7358SJed Brown } 2964552f7358SJed Brown } 2965552f7358SJed Brown if (interpolate) { 2966552f7358SJed Brown PetscInt e; 2967552f7358SJed Brown 2968552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 2969552f7358SJed Brown if (out.edgemarkerlist[e]) { 2970552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 2971552f7358SJed Brown const PetscInt *edges; 2972552f7358SJed Brown PetscInt numEdges; 2973552f7358SJed Brown 2974552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2975552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 2976552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 2977552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 2978552f7358SJed Brown } 2979552f7358SJed Brown } 2980552f7358SJed Brown } 2981552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 2982552f7358SJed Brown } 2983552f7358SJed Brown #if 0 /* Do not currently support holes */ 2984552f7358SJed Brown ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr); 2985552f7358SJed Brown #endif 2986552f7358SJed Brown ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr); 2987552f7358SJed Brown PetscFunctionReturn(0); 2988552f7358SJed Brown } 2989552f7358SJed Brown #endif 2990552f7358SJed Brown 2991519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 2992552f7358SJed Brown #include <tetgen.h> 2993552f7358SJed Brown #undef __FUNCT__ 2994552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen" 2995552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm) 2996552f7358SJed Brown { 299782f516ccSBarry Smith MPI_Comm comm; 2998552f7358SJed Brown const PetscInt dim = 3; 2999552f7358SJed Brown ::tetgenio in; 3000552f7358SJed Brown ::tetgenio out; 3001552f7358SJed Brown PetscInt vStart, vEnd, v, fStart, fEnd, f; 3002552f7358SJed Brown PetscMPIInt rank; 3003552f7358SJed Brown PetscErrorCode ierr; 3004552f7358SJed Brown 3005552f7358SJed Brown PetscFunctionBegin; 300682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 3007552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3008552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3009552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3010552f7358SJed Brown if (in.numberofpoints > 0) { 3011552f7358SJed Brown PetscSection coordSection; 3012552f7358SJed Brown Vec coordinates; 3013552f7358SJed Brown PetscScalar *array; 3014552f7358SJed Brown 3015552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3016552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 30170d644c17SKarl Rupp 3018552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 301969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3020552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3021552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3022552f7358SJed Brown const PetscInt idx = v - vStart; 3023552f7358SJed Brown PetscInt off, d; 3024552f7358SJed Brown 3025552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 30260d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3027552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3028552f7358SJed Brown } 3029552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3030552f7358SJed Brown } 3031552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 30320d644c17SKarl Rupp 3033552f7358SJed Brown in.numberoffacets = fEnd - fStart; 3034552f7358SJed Brown if (in.numberoffacets > 0) { 3035552f7358SJed Brown in.facetlist = new tetgenio::facet[in.numberoffacets]; 3036552f7358SJed Brown in.facetmarkerlist = new int[in.numberoffacets]; 3037552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3038552f7358SJed Brown const PetscInt idx = f - fStart; 30390298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v; 3040552f7358SJed Brown 3041552f7358SJed Brown in.facetlist[idx].numberofpolygons = 1; 3042552f7358SJed Brown in.facetlist[idx].polygonlist = new tetgenio::polygon[in.facetlist[idx].numberofpolygons]; 3043552f7358SJed Brown in.facetlist[idx].numberofholes = 0; 3044552f7358SJed Brown in.facetlist[idx].holelist = NULL; 3045552f7358SJed Brown 3046552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3047552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3048552f7358SJed Brown const PetscInt point = points[p]; 30490d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3050552f7358SJed Brown } 3051552f7358SJed Brown 3052552f7358SJed Brown tetgenio::polygon *poly = in.facetlist[idx].polygonlist; 3053552f7358SJed Brown poly->numberofvertices = numVertices; 3054552f7358SJed Brown poly->vertexlist = new int[poly->numberofvertices]; 3055552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3056552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3057552f7358SJed Brown poly->vertexlist[v] = vIdx; 3058552f7358SJed Brown } 3059552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr); 3060552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3061552f7358SJed Brown } 3062552f7358SJed Brown } 3063552f7358SJed Brown if (!rank) { 3064552f7358SJed Brown char args[32]; 3065552f7358SJed Brown 3066552f7358SJed Brown /* Take away 'Q' for verbose output */ 3067552f7358SJed Brown ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr); 3068552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3069552f7358SJed Brown } 3070552f7358SJed Brown { 3071552f7358SJed Brown const PetscInt numCorners = 4; 3072552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3073552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3074552f7358SJed Brown const double *meshCoords = out.pointlist; 30751d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 3076552f7358SJed Brown 30779db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 30780fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3079552f7358SJed Brown /* Set labels */ 3080552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3081552f7358SJed Brown if (out.pointmarkerlist[v]) { 3082552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3083552f7358SJed Brown } 3084552f7358SJed Brown } 3085552f7358SJed Brown if (interpolate) { 3086552f7358SJed Brown PetscInt e; 3087552f7358SJed Brown 3088552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3089552f7358SJed Brown if (out.edgemarkerlist[e]) { 3090552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3091552f7358SJed Brown const PetscInt *edges; 3092552f7358SJed Brown PetscInt numEdges; 3093552f7358SJed Brown 3094552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3095552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3096552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3097552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3098552f7358SJed Brown } 3099552f7358SJed Brown } 3100552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3101552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3102552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3103552f7358SJed Brown const PetscInt *faces; 3104552f7358SJed Brown PetscInt numFaces; 3105552f7358SJed Brown 3106552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3107552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3108552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3109552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3110552f7358SJed Brown } 3111552f7358SJed Brown } 3112552f7358SJed Brown } 3113552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3114552f7358SJed Brown } 3115552f7358SJed Brown PetscFunctionReturn(0); 3116552f7358SJed Brown } 3117552f7358SJed Brown 3118552f7358SJed Brown #undef __FUNCT__ 3119552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen" 3120552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined) 3121552f7358SJed Brown { 312282f516ccSBarry Smith MPI_Comm comm; 3123552f7358SJed Brown const PetscInt dim = 3; 3124552f7358SJed Brown ::tetgenio in; 3125552f7358SJed Brown ::tetgenio out; 3126552f7358SJed Brown PetscInt vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3127552f7358SJed Brown PetscMPIInt rank; 3128552f7358SJed Brown PetscErrorCode ierr; 3129552f7358SJed Brown 3130552f7358SJed Brown PetscFunctionBegin; 313182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 3132552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3133552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3134552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3135552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 31360d644c17SKarl Rupp 3137552f7358SJed Brown in.numberofpoints = vEnd - vStart; 3138552f7358SJed Brown if (in.numberofpoints > 0) { 3139552f7358SJed Brown PetscSection coordSection; 3140552f7358SJed Brown Vec coordinates; 3141552f7358SJed Brown PetscScalar *array; 3142552f7358SJed Brown 3143552f7358SJed Brown in.pointlist = new double[in.numberofpoints*dim]; 3144552f7358SJed Brown in.pointmarkerlist = new int[in.numberofpoints]; 31450d644c17SKarl Rupp 3146552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 314769d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3148552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3149552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3150552f7358SJed Brown const PetscInt idx = v - vStart; 3151552f7358SJed Brown PetscInt off, d; 3152552f7358SJed Brown 3153552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 31540d644c17SKarl Rupp for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d]; 3155552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr); 3156552f7358SJed Brown } 3157552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3158552f7358SJed Brown } 3159552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 31600d644c17SKarl Rupp 3161552f7358SJed Brown in.numberofcorners = 4; 3162552f7358SJed Brown in.numberoftetrahedra = cEnd - cStart; 3163552f7358SJed Brown in.tetrahedronvolumelist = (double*) maxVolumes; 3164552f7358SJed Brown if (in.numberoftetrahedra > 0) { 3165552f7358SJed Brown in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners]; 3166552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3167552f7358SJed Brown const PetscInt idx = c - cStart; 31680298fd71SBarry Smith PetscInt *closure = NULL; 3169552f7358SJed Brown PetscInt closureSize; 3170552f7358SJed Brown 3171552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3172552f7358SJed 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); 3173552f7358SJed Brown for (v = 0; v < 4; ++v) { 3174552f7358SJed Brown in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3175552f7358SJed Brown } 3176552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3177552f7358SJed Brown } 3178552f7358SJed Brown } 317919436ca2SJed Brown /* TODO: Put in boundary faces with markers */ 3180552f7358SJed Brown if (!rank) { 3181552f7358SJed Brown char args[32]; 3182552f7358SJed Brown 3183552f7358SJed Brown /* Take away 'Q' for verbose output */ 318419436ca2SJed Brown /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */ 3185552f7358SJed Brown ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr); 3186552f7358SJed Brown ::tetrahedralize(args, &in, &out); 3187552f7358SJed Brown } 3188552f7358SJed Brown in.tetrahedronvolumelist = NULL; 3189552f7358SJed Brown 3190552f7358SJed Brown { 3191552f7358SJed Brown const PetscInt numCorners = 4; 3192552f7358SJed Brown const PetscInt numCells = out.numberoftetrahedra; 3193552f7358SJed Brown const PetscInt numVertices = out.numberofpoints; 3194552f7358SJed Brown const double *meshCoords = out.pointlist; 31951d4b4d7bSJed Brown int *cells = out.tetrahedronlist; 31961d4b4d7bSJed Brown 3197552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3198552f7358SJed Brown 31999db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 32000fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3201552f7358SJed Brown /* Set labels */ 3202552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3203552f7358SJed Brown if (out.pointmarkerlist[v]) { 3204552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr); 3205552f7358SJed Brown } 3206552f7358SJed Brown } 3207552f7358SJed Brown if (interpolate) { 3208552f7358SJed Brown PetscInt e, f; 3209552f7358SJed Brown 3210552f7358SJed Brown for (e = 0; e < out.numberofedges; e++) { 3211552f7358SJed Brown if (out.edgemarkerlist[e]) { 3212552f7358SJed Brown const PetscInt vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells}; 3213552f7358SJed Brown const PetscInt *edges; 3214552f7358SJed Brown PetscInt numEdges; 3215552f7358SJed Brown 3216552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3217552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3218552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr); 3219552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3220552f7358SJed Brown } 3221552f7358SJed Brown } 3222552f7358SJed Brown for (f = 0; f < out.numberoftrifaces; f++) { 3223552f7358SJed Brown if (out.trifacemarkerlist[f]) { 3224552f7358SJed Brown const PetscInt vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells}; 3225552f7358SJed Brown const PetscInt *faces; 3226552f7358SJed Brown PetscInt numFaces; 3227552f7358SJed Brown 3228552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3229552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3230552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr); 3231552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3232552f7358SJed Brown } 3233552f7358SJed Brown } 3234552f7358SJed Brown } 3235552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3236552f7358SJed Brown } 3237552f7358SJed Brown PetscFunctionReturn(0); 3238552f7358SJed Brown } 3239552f7358SJed Brown #endif 3240552f7358SJed Brown 3241519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3242aaa7dc30SBarry Smith #include <ctetgen.h> 3243552f7358SJed Brown 3244552f7358SJed Brown #undef __FUNCT__ 3245552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen" 3246552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm) 3247552f7358SJed Brown { 324882f516ccSBarry Smith MPI_Comm comm; 3249552f7358SJed Brown const PetscInt dim = 3; 3250552f7358SJed Brown PLC *in, *out; 3251552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, fStart, fEnd, f; 3252552f7358SJed Brown PetscMPIInt rank; 3253552f7358SJed Brown PetscErrorCode ierr; 3254552f7358SJed Brown 3255552f7358SJed Brown PetscFunctionBegin; 325682f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr); 32570298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3258552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3259552f7358SJed Brown ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr); 3260552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3261552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 32620d644c17SKarl Rupp 3263552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3264552f7358SJed Brown if (in->numberofpoints > 0) { 3265552f7358SJed Brown PetscSection coordSection; 3266552f7358SJed Brown Vec coordinates; 3267552f7358SJed Brown PetscScalar *array; 3268552f7358SJed Brown 3269785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3270785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3271552f7358SJed Brown ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr); 327269d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr); 3273552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3274552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3275552f7358SJed Brown const PetscInt idx = v - vStart; 3276552f7358SJed Brown PetscInt off, d, m; 3277552f7358SJed Brown 3278552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3279552f7358SJed Brown for (d = 0; d < dim; ++d) { 3280552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3281552f7358SJed Brown } 3282552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr); 32830d644c17SKarl Rupp 3284552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3285552f7358SJed Brown } 3286552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3287552f7358SJed Brown } 3288552f7358SJed Brown ierr = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr); 32890d644c17SKarl Rupp 3290552f7358SJed Brown in->numberoffacets = fEnd - fStart; 3291552f7358SJed Brown if (in->numberoffacets > 0) { 3292785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr); 3293785e854fSJed Brown ierr = PetscMalloc1(in->numberoffacets, &in->facetmarkerlist);CHKERRQ(ierr); 3294552f7358SJed Brown for (f = fStart; f < fEnd; ++f) { 3295552f7358SJed Brown const PetscInt idx = f - fStart; 32960298fd71SBarry Smith PetscInt *points = NULL, numPoints, p, numVertices = 0, v, m; 3297552f7358SJed Brown polygon *poly; 3298552f7358SJed Brown 3299552f7358SJed Brown in->facetlist[idx].numberofpolygons = 1; 33000d644c17SKarl Rupp 3301785e854fSJed Brown ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr); 33020d644c17SKarl Rupp 3303552f7358SJed Brown in->facetlist[idx].numberofholes = 0; 33040298fd71SBarry Smith in->facetlist[idx].holelist = NULL; 3305552f7358SJed Brown 3306552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3307552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 3308552f7358SJed Brown const PetscInt point = points[p]; 33090d644c17SKarl Rupp if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point; 3310552f7358SJed Brown } 3311552f7358SJed Brown 3312552f7358SJed Brown poly = in->facetlist[idx].polygonlist; 3313552f7358SJed Brown poly->numberofvertices = numVertices; 3314785e854fSJed Brown ierr = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr); 3315552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3316552f7358SJed Brown const PetscInt vIdx = points[v] - vStart; 3317552f7358SJed Brown poly->vertexlist[v] = vIdx; 3318552f7358SJed Brown } 3319552f7358SJed Brown ierr = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr); 3320552f7358SJed Brown in->facetmarkerlist[idx] = (int) m; 3321552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 3322552f7358SJed Brown } 3323552f7358SJed Brown } 3324552f7358SJed Brown if (!rank) { 3325552f7358SJed Brown TetGenOpts t; 3326552f7358SJed Brown 3327552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 3328552f7358SJed Brown t.in = boundary; /* Should go away */ 3329552f7358SJed Brown t.plc = 1; 3330552f7358SJed Brown t.quality = 1; 3331552f7358SJed Brown t.edgesout = 1; 3332552f7358SJed Brown t.zeroindex = 1; 3333552f7358SJed Brown t.quiet = 1; 3334552f7358SJed Brown t.verbose = verbose; 3335552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3336552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3337552f7358SJed Brown } 3338552f7358SJed Brown { 3339552f7358SJed Brown const PetscInt numCorners = 4; 3340552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3341552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3342552f7358SJed Brown const double *meshCoords = out->pointlist; 33431d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3344552f7358SJed Brown 33459db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 33460fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr); 3347552f7358SJed Brown /* Set labels */ 3348552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3349552f7358SJed Brown if (out->pointmarkerlist[v]) { 3350552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3351552f7358SJed Brown } 3352552f7358SJed Brown } 3353552f7358SJed Brown if (interpolate) { 3354552f7358SJed Brown PetscInt e; 3355552f7358SJed Brown 3356552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3357552f7358SJed Brown if (out->edgemarkerlist[e]) { 3358552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3359552f7358SJed Brown const PetscInt *edges; 3360552f7358SJed Brown PetscInt numEdges; 3361552f7358SJed Brown 3362552f7358SJed Brown ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3363552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3364552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3365552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3366552f7358SJed Brown } 3367552f7358SJed Brown } 3368552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3369552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3370552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3371552f7358SJed Brown const PetscInt *faces; 3372552f7358SJed Brown PetscInt numFaces; 3373552f7358SJed Brown 3374552f7358SJed Brown ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3375552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3376552f7358SJed Brown ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3377552f7358SJed Brown ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3378552f7358SJed Brown } 3379552f7358SJed Brown } 3380552f7358SJed Brown } 3381552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr); 3382552f7358SJed Brown } 3383552f7358SJed Brown 3384552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3385552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3386552f7358SJed Brown PetscFunctionReturn(0); 3387552f7358SJed Brown } 3388552f7358SJed Brown 3389552f7358SJed Brown #undef __FUNCT__ 3390552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen" 3391552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined) 3392552f7358SJed Brown { 339382f516ccSBarry Smith MPI_Comm comm; 3394552f7358SJed Brown const PetscInt dim = 3; 3395552f7358SJed Brown PLC *in, *out; 3396552f7358SJed Brown PetscInt verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal; 3397552f7358SJed Brown PetscMPIInt rank; 3398552f7358SJed Brown PetscErrorCode ierr; 3399552f7358SJed Brown 3400552f7358SJed Brown PetscFunctionBegin; 340182f516ccSBarry Smith ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr); 34020298fd71SBarry Smith ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr); 3403552f7358SJed Brown ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 3404552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3405552f7358SJed Brown ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr); 3406552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 3407552f7358SJed Brown ierr = PLCCreate(&in);CHKERRQ(ierr); 3408552f7358SJed Brown ierr = PLCCreate(&out);CHKERRQ(ierr); 34090d644c17SKarl Rupp 3410552f7358SJed Brown in->numberofpoints = vEnd - vStart; 3411552f7358SJed Brown if (in->numberofpoints > 0) { 3412552f7358SJed Brown PetscSection coordSection; 3413552f7358SJed Brown Vec coordinates; 3414552f7358SJed Brown PetscScalar *array; 3415552f7358SJed Brown 3416785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr); 3417785e854fSJed Brown ierr = PetscMalloc1(in->numberofpoints, &in->pointmarkerlist);CHKERRQ(ierr); 3418552f7358SJed Brown ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr); 341969d8a9ceSMatthew G. Knepley ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr); 3420552f7358SJed Brown ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr); 3421552f7358SJed Brown for (v = vStart; v < vEnd; ++v) { 3422552f7358SJed Brown const PetscInt idx = v - vStart; 3423552f7358SJed Brown PetscInt off, d, m; 3424552f7358SJed Brown 3425552f7358SJed Brown ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr); 3426552f7358SJed Brown for (d = 0; d < dim; ++d) { 3427552f7358SJed Brown in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]); 3428552f7358SJed Brown } 3429552f7358SJed Brown ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr); 34300d644c17SKarl Rupp 3431552f7358SJed Brown in->pointmarkerlist[idx] = (int) m; 3432552f7358SJed Brown } 3433552f7358SJed Brown ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr); 3434552f7358SJed Brown } 3435552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 34360d644c17SKarl Rupp 3437552f7358SJed Brown in->numberofcorners = 4; 3438552f7358SJed Brown in->numberoftetrahedra = cEnd - cStart; 3439552f7358SJed Brown in->tetrahedronvolumelist = maxVolumes; 3440552f7358SJed Brown if (in->numberoftetrahedra > 0) { 3441785e854fSJed Brown ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr); 3442552f7358SJed Brown for (c = cStart; c < cEnd; ++c) { 3443552f7358SJed Brown const PetscInt idx = c - cStart; 34440298fd71SBarry Smith PetscInt *closure = NULL; 3445552f7358SJed Brown PetscInt closureSize; 3446552f7358SJed Brown 3447552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3448552f7358SJed 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); 3449552f7358SJed Brown for (v = 0; v < 4; ++v) { 3450552f7358SJed Brown in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart; 3451552f7358SJed Brown } 3452552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 3453552f7358SJed Brown } 3454552f7358SJed Brown } 3455552f7358SJed Brown if (!rank) { 3456552f7358SJed Brown TetGenOpts t; 3457552f7358SJed Brown 3458552f7358SJed Brown ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr); 34590d644c17SKarl Rupp 3460552f7358SJed Brown t.in = dm; /* Should go away */ 3461552f7358SJed Brown t.refine = 1; 3462552f7358SJed Brown t.varvolume = 1; 3463552f7358SJed Brown t.quality = 1; 3464552f7358SJed Brown t.edgesout = 1; 3465552f7358SJed Brown t.zeroindex = 1; 3466552f7358SJed Brown t.quiet = 1; 3467552f7358SJed Brown t.verbose = verbose; /* Change this */ 34680d644c17SKarl Rupp 3469552f7358SJed Brown ierr = TetGenCheckOpts(&t);CHKERRQ(ierr); 3470552f7358SJed Brown ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr); 3471552f7358SJed Brown } 3472552f7358SJed Brown { 3473552f7358SJed Brown const PetscInt numCorners = 4; 3474552f7358SJed Brown const PetscInt numCells = out->numberoftetrahedra; 3475552f7358SJed Brown const PetscInt numVertices = out->numberofpoints; 3476552f7358SJed Brown const double *meshCoords = out->pointlist; 34771d4b4d7bSJed Brown int *cells = out->tetrahedronlist; 3478552f7358SJed Brown PetscBool interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE; 3479552f7358SJed Brown 34809db3b87dSMatthew G. Knepley ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr); 34810fde5641SMatthew G Knepley ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr); 3482552f7358SJed Brown /* Set labels */ 3483552f7358SJed Brown for (v = 0; v < numVertices; ++v) { 3484552f7358SJed Brown if (out->pointmarkerlist[v]) { 3485552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr); 3486552f7358SJed Brown } 3487552f7358SJed Brown } 3488552f7358SJed Brown if (interpolate) { 3489552f7358SJed Brown PetscInt e, f; 3490552f7358SJed Brown 3491552f7358SJed Brown for (e = 0; e < out->numberofedges; e++) { 3492552f7358SJed Brown if (out->edgemarkerlist[e]) { 3493552f7358SJed Brown const PetscInt vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells}; 3494552f7358SJed Brown const PetscInt *edges; 3495552f7358SJed Brown PetscInt numEdges; 3496552f7358SJed Brown 3497552f7358SJed Brown ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3498552f7358SJed Brown if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges); 3499552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr); 3500552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr); 3501552f7358SJed Brown } 3502552f7358SJed Brown } 3503552f7358SJed Brown for (f = 0; f < out->numberoftrifaces; f++) { 3504552f7358SJed Brown if (out->trifacemarkerlist[f]) { 3505552f7358SJed Brown const PetscInt vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells}; 3506552f7358SJed Brown const PetscInt *faces; 3507552f7358SJed Brown PetscInt numFaces; 3508552f7358SJed Brown 3509552f7358SJed Brown ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3510552f7358SJed Brown if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces); 3511552f7358SJed Brown ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr); 3512552f7358SJed Brown ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr); 3513552f7358SJed Brown } 3514552f7358SJed Brown } 3515552f7358SJed Brown } 3516552f7358SJed Brown ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr); 3517552f7358SJed Brown } 3518552f7358SJed Brown ierr = PLCDestroy(&in);CHKERRQ(ierr); 3519552f7358SJed Brown ierr = PLCDestroy(&out);CHKERRQ(ierr); 3520552f7358SJed Brown PetscFunctionReturn(0); 3521552f7358SJed Brown } 3522552f7358SJed Brown #endif 3523552f7358SJed Brown 3524552f7358SJed Brown #undef __FUNCT__ 3525552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate" 3526552f7358SJed Brown /*@C 3527552f7358SJed Brown DMPlexGenerate - Generates a mesh. 3528552f7358SJed Brown 3529552f7358SJed Brown Not Collective 3530552f7358SJed Brown 3531552f7358SJed Brown Input Parameters: 3532552f7358SJed Brown + boundary - The DMPlex boundary object 3533552f7358SJed Brown . name - The mesh generation package name 3534552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements 3535552f7358SJed Brown 3536552f7358SJed Brown Output Parameter: 3537552f7358SJed Brown . mesh - The DMPlex object 3538552f7358SJed Brown 3539552f7358SJed Brown Level: intermediate 3540552f7358SJed Brown 3541552f7358SJed Brown .keywords: mesh, elements 3542552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine() 3543552f7358SJed Brown @*/ 3544552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh) 3545552f7358SJed Brown { 3546552f7358SJed Brown PetscInt dim; 3547552f7358SJed Brown char genname[1024]; 3548552f7358SJed Brown PetscBool isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3549552f7358SJed Brown PetscErrorCode ierr; 3550552f7358SJed Brown 3551552f7358SJed Brown PetscFunctionBegin; 3552552f7358SJed Brown PetscValidHeaderSpecific(boundary, DM_CLASSID, 1); 3553552f7358SJed Brown PetscValidLogicalCollectiveBool(boundary, interpolate, 2); 3554552f7358SJed Brown ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr); 3555552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 35560d644c17SKarl Rupp if (flg) name = genname; 3557552f7358SJed Brown if (name) { 3558552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3559552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3560552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3561552f7358SJed Brown } 3562552f7358SJed Brown switch (dim) { 3563552f7358SJed Brown case 1: 3564552f7358SJed Brown if (!name || isTriangle) { 3565519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3566552f7358SJed Brown ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr); 3567552f7358SJed Brown #else 356882f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle."); 3569552f7358SJed Brown #endif 357082f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3571552f7358SJed Brown break; 3572552f7358SJed Brown case 2: 3573552f7358SJed Brown if (!name || isCTetgen) { 3574519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3575552f7358SJed Brown ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3576552f7358SJed Brown #else 357782f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3578552f7358SJed Brown #endif 3579552f7358SJed Brown } else if (isTetgen) { 3580519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3581552f7358SJed Brown ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr); 3582552f7358SJed Brown #else 358382f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3584552f7358SJed Brown #endif 358582f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3586552f7358SJed Brown break; 3587552f7358SJed Brown default: 358882f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim); 3589552f7358SJed Brown } 3590552f7358SJed Brown PetscFunctionReturn(0); 3591552f7358SJed Brown } 3592552f7358SJed Brown 3593552f7358SJed Brown #undef __FUNCT__ 3594552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex" 3595552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined) 3596552f7358SJed Brown { 3597552f7358SJed Brown PetscReal refinementLimit; 3598552f7358SJed Brown PetscInt dim, cStart, cEnd; 35990298fd71SBarry Smith char genname[1024], *name = NULL; 3600552f7358SJed Brown PetscBool isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg; 3601552f7358SJed Brown PetscErrorCode ierr; 3602552f7358SJed Brown 3603552f7358SJed Brown PetscFunctionBegin; 3604552f7358SJed Brown ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 3605552f7358SJed Brown if (isUniform) { 3606552f7358SJed Brown CellRefiner cellRefiner; 3607552f7358SJed Brown 3608509c9b89SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr); 3609509c9b89SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr); 3610552f7358SJed Brown PetscFunctionReturn(0); 3611552f7358SJed Brown } 3612552f7358SJed Brown ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr); 3613552f7358SJed Brown if (refinementLimit == 0.0) PetscFunctionReturn(0); 3614552f7358SJed Brown ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 3615552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr); 3616552f7358SJed Brown ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr); 36170d644c17SKarl Rupp if (flg) name = genname; 3618552f7358SJed Brown if (name) { 3619552f7358SJed Brown ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr); 3620552f7358SJed Brown ierr = PetscStrcmp(name, "tetgen", &isTetgen);CHKERRQ(ierr); 3621552f7358SJed Brown ierr = PetscStrcmp(name, "ctetgen", &isCTetgen);CHKERRQ(ierr); 3622552f7358SJed Brown } 3623552f7358SJed Brown switch (dim) { 3624552f7358SJed Brown case 2: 3625552f7358SJed Brown if (!name || isTriangle) { 3626519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE) 3627552f7358SJed Brown double *maxVolumes; 3628552f7358SJed Brown PetscInt c; 3629552f7358SJed Brown 3630785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36310d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3632552f7358SJed Brown ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 36336b0a3334SMatthew G. Knepley ierr = PetscFree(maxVolumes);CHKERRQ(ierr); 3634552f7358SJed Brown #else 363582f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle."); 3636552f7358SJed Brown #endif 363782f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name); 3638552f7358SJed Brown break; 3639552f7358SJed Brown case 3: 3640552f7358SJed Brown if (!name || isCTetgen) { 3641519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN) 3642552f7358SJed Brown PetscReal *maxVolumes; 3643552f7358SJed Brown PetscInt c; 3644552f7358SJed Brown 3645785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36460d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3647552f7358SJed Brown ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3648552f7358SJed Brown #else 364982f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen."); 3650552f7358SJed Brown #endif 3651552f7358SJed Brown } else if (isTetgen) { 3652519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN) 3653552f7358SJed Brown double *maxVolumes; 3654552f7358SJed Brown PetscInt c; 3655552f7358SJed Brown 3656785e854fSJed Brown ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr); 36570d644c17SKarl Rupp for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit; 3658552f7358SJed Brown ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr); 3659552f7358SJed Brown #else 366082f516ccSBarry Smith SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen."); 3661552f7358SJed Brown #endif 366282f516ccSBarry Smith } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name); 3663552f7358SJed Brown break; 3664552f7358SJed Brown default: 366582f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim); 3666552f7358SJed Brown } 3667552f7358SJed Brown PetscFunctionReturn(0); 3668552f7358SJed Brown } 3669552f7358SJed Brown 3670552f7358SJed Brown #undef __FUNCT__ 36710a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex" 36720a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[]) 36730a6ba040SMatthew G. Knepley { 36740a6ba040SMatthew G. Knepley DM cdm = dm; 36750a6ba040SMatthew G. Knepley PetscInt r; 36760a6ba040SMatthew G. Knepley PetscBool isUniform; 36770a6ba040SMatthew G. Knepley PetscErrorCode ierr; 36780a6ba040SMatthew G. Knepley 36790a6ba040SMatthew G. Knepley PetscFunctionBegin; 36800a6ba040SMatthew G. Knepley ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr); 36810a6ba040SMatthew G. Knepley if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy"); 36820a6ba040SMatthew G. Knepley for (r = 0; r < nlevels; ++r) { 36830a6ba040SMatthew G. Knepley CellRefiner cellRefiner; 36840a6ba040SMatthew G. Knepley 36850a6ba040SMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr); 36860a6ba040SMatthew G. Knepley ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr); 36870a6ba040SMatthew G. Knepley ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr); 36880a6ba040SMatthew G. Knepley cdm = dmRefined[r]; 36890a6ba040SMatthew G. Knepley } 36900a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 36910a6ba040SMatthew G. Knepley } 36920a6ba040SMatthew G. Knepley 36930a6ba040SMatthew G. Knepley #undef __FUNCT__ 36940a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex" 36950a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened) 36960a6ba040SMatthew G. Knepley { 36970a6ba040SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3698549a8adaSMatthew G. Knepley PetscErrorCode ierr; 36990a6ba040SMatthew G. Knepley 37000a6ba040SMatthew G. Knepley PetscFunctionBegin; 3701549a8adaSMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 37020a6ba040SMatthew G. Knepley *dmCoarsened = mesh->coarseMesh; 37030a6ba040SMatthew G. Knepley PetscFunctionReturn(0); 37040a6ba040SMatthew G. Knepley } 37050a6ba040SMatthew G. Knepley 37060a6ba040SMatthew G. Knepley #undef __FUNCT__ 3707aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel" 3708552f7358SJed Brown /*@ 3709aa50250dSMatthew G. Knepley DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point 3710552f7358SJed Brown 3711552f7358SJed Brown Not Collective 3712552f7358SJed Brown 3713aa50250dSMatthew G. Knepley Input Parameter: 3714552f7358SJed Brown . dm - The DMPlex object 3715552f7358SJed Brown 3716aa50250dSMatthew G. Knepley Output Parameter: 3717aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth 3718552f7358SJed Brown 3719552f7358SJed Brown Level: developer 3720552f7358SJed Brown 3721aa50250dSMatthew G. Knepley .keywords: mesh, points 3722aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3723aa50250dSMatthew G. Knepley @*/ 3724aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel) 3725aa50250dSMatthew G. Knepley { 3726aa50250dSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 3727aa50250dSMatthew G. Knepley PetscErrorCode ierr; 3728aa50250dSMatthew G. Knepley 3729aa50250dSMatthew G. Knepley PetscFunctionBegin; 3730aa50250dSMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3731aa50250dSMatthew G. Knepley PetscValidPointer(depthLabel, 2); 373263d1a920SMatthew G. Knepley if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);} 3733aa50250dSMatthew G. Knepley *depthLabel = mesh->depthLabel; 3734aa50250dSMatthew G. Knepley PetscFunctionReturn(0); 3735aa50250dSMatthew G. Knepley } 3736aa50250dSMatthew G. Knepley 3737aa50250dSMatthew G. Knepley #undef __FUNCT__ 3738aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth" 3739aa50250dSMatthew G. Knepley /*@ 3740aa50250dSMatthew G. Knepley DMPlexGetDepth - Get the depth of the DAG representing this mesh 3741aa50250dSMatthew G. Knepley 3742aa50250dSMatthew G. Knepley Not Collective 3743aa50250dSMatthew G. Knepley 3744aa50250dSMatthew G. Knepley Input Parameter: 3745aa50250dSMatthew G. Knepley . dm - The DMPlex object 3746aa50250dSMatthew G. Knepley 3747aa50250dSMatthew G. Knepley Output Parameter: 3748aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG 3749aa50250dSMatthew G. Knepley 3750aa50250dSMatthew G. Knepley Level: developer 3751552f7358SJed Brown 3752552f7358SJed Brown .keywords: mesh, points 3753aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum() 3754552f7358SJed Brown @*/ 3755552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth) 3756552f7358SJed Brown { 3757aa50250dSMatthew G. Knepley DMLabel label; 3758aa50250dSMatthew G. Knepley PetscInt d = 0; 3759552f7358SJed Brown PetscErrorCode ierr; 3760552f7358SJed Brown 3761552f7358SJed Brown PetscFunctionBegin; 3762552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 3763552f7358SJed Brown PetscValidPointer(depth, 2); 3764aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3765aa50250dSMatthew G. Knepley if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);} 3766552f7358SJed Brown *depth = d-1; 3767552f7358SJed Brown PetscFunctionReturn(0); 3768552f7358SJed Brown } 3769552f7358SJed Brown 3770552f7358SJed Brown #undef __FUNCT__ 3771552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum" 3772552f7358SJed Brown /*@ 3773552f7358SJed Brown DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth. 3774552f7358SJed Brown 3775552f7358SJed Brown Not Collective 3776552f7358SJed Brown 3777552f7358SJed Brown Input Parameters: 3778552f7358SJed Brown + dm - The DMPlex object 3779552f7358SJed Brown - stratumValue - The requested depth 3780552f7358SJed Brown 3781552f7358SJed Brown Output Parameters: 3782552f7358SJed Brown + start - The first point at this depth 3783552f7358SJed Brown - end - One beyond the last point at this depth 3784552f7358SJed Brown 3785552f7358SJed Brown Level: developer 3786552f7358SJed Brown 3787552f7358SJed Brown .keywords: mesh, points 3788552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth() 3789552f7358SJed Brown @*/ 37900adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 37910adebc6cSBarry Smith { 3792aa50250dSMatthew G. Knepley DMLabel label; 379363d1a920SMatthew G. Knepley PetscInt pStart, pEnd; 3794552f7358SJed Brown PetscErrorCode ierr; 3795552f7358SJed Brown 3796552f7358SJed Brown PetscFunctionBegin; 3797552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 379863d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 379963d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3800552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 38010d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 380263d1a920SMatthew G. Knepley if (stratumValue < 0) { 380363d1a920SMatthew G. Knepley if (start) *start = pStart; 380463d1a920SMatthew G. Knepley if (end) *end = pEnd; 380563d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3806552f7358SJed Brown } 3807aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 380863d1a920SMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found"); 380963d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr); 3810552f7358SJed Brown PetscFunctionReturn(0); 3811552f7358SJed Brown } 3812552f7358SJed Brown 3813552f7358SJed Brown #undef __FUNCT__ 3814552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum" 3815552f7358SJed Brown /*@ 3816552f7358SJed Brown DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height. 3817552f7358SJed Brown 3818552f7358SJed Brown Not Collective 3819552f7358SJed Brown 3820552f7358SJed Brown Input Parameters: 3821552f7358SJed Brown + dm - The DMPlex object 3822552f7358SJed Brown - stratumValue - The requested height 3823552f7358SJed Brown 3824552f7358SJed Brown Output Parameters: 3825552f7358SJed Brown + start - The first point at this height 3826552f7358SJed Brown - end - One beyond the last point at this height 3827552f7358SJed Brown 3828552f7358SJed Brown Level: developer 3829552f7358SJed Brown 3830552f7358SJed Brown .keywords: mesh, points 3831552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth() 3832552f7358SJed Brown @*/ 38330adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end) 38340adebc6cSBarry Smith { 3835aa50250dSMatthew G. Knepley DMLabel label; 383663d1a920SMatthew G. Knepley PetscInt depth, pStart, pEnd; 3837552f7358SJed Brown PetscErrorCode ierr; 3838552f7358SJed Brown 3839552f7358SJed Brown PetscFunctionBegin; 3840552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 384163d1a920SMatthew G. Knepley if (start) {PetscValidPointer(start, 3); *start = 0;} 384263d1a920SMatthew G. Knepley if (end) {PetscValidPointer(end, 4); *end = 0;} 3843552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 38440d644c17SKarl Rupp if (pStart == pEnd) PetscFunctionReturn(0); 384563d1a920SMatthew G. Knepley if (stratumValue < 0) { 384663d1a920SMatthew G. Knepley if (start) *start = pStart; 384763d1a920SMatthew G. Knepley if (end) *end = pEnd; 384863d1a920SMatthew G. Knepley PetscFunctionReturn(0); 3849552f7358SJed Brown } 3850aa50250dSMatthew G. Knepley ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr); 3851aa50250dSMatthew G. Knepley if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr); 385263d1a920SMatthew G. Knepley ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr); 385363d1a920SMatthew G. Knepley ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr); 3854552f7358SJed Brown PetscFunctionReturn(0); 3855552f7358SJed Brown } 3856552f7358SJed Brown 3857552f7358SJed Brown #undef __FUNCT__ 3858552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial" 3859552f7358SJed Brown /* Set the number of dof on each point and separate by fields */ 3860a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section) 3861a6dfd86eSKarl Rupp { 3862552f7358SJed Brown PetscInt *numDofTot; 3863916f0f19SMatthew G. Knepley PetscInt depth, pStart = 0, pEnd = 0; 3864916f0f19SMatthew G. Knepley PetscInt p, d, dep, f; 3865552f7358SJed Brown PetscErrorCode ierr; 3866552f7358SJed Brown 3867552f7358SJed Brown PetscFunctionBegin; 3868785e854fSJed Brown ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr); 3869552f7358SJed Brown for (d = 0; d <= dim; ++d) { 3870552f7358SJed Brown numDofTot[d] = 0; 38710d644c17SKarl Rupp for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d]; 3872552f7358SJed Brown } 387382f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr); 3874552f7358SJed Brown if (numFields > 0) { 3875552f7358SJed Brown ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr); 3876552f7358SJed Brown if (numComp) { 3877552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3878552f7358SJed Brown ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr); 3879552f7358SJed Brown } 3880552f7358SJed Brown } 3881552f7358SJed Brown } 3882552f7358SJed Brown ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 3883552f7358SJed Brown ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr); 3884916f0f19SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 3885916f0f19SMatthew G. Knepley for (dep = 0; dep <= depth; ++dep) { 3886916f0f19SMatthew G. Knepley d = dim == depth ? dep : (!dep ? 0 : dim); 3887916f0f19SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr); 3888552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3889552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3890552f7358SJed Brown ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr); 3891552f7358SJed Brown } 3892552f7358SJed Brown ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr); 3893552f7358SJed Brown } 3894552f7358SJed Brown } 3895552f7358SJed Brown ierr = PetscFree(numDofTot);CHKERRQ(ierr); 3896552f7358SJed Brown PetscFunctionReturn(0); 3897552f7358SJed Brown } 3898552f7358SJed Brown 3899552f7358SJed Brown #undef __FUNCT__ 3900552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof" 3901552f7358SJed Brown /* Set the number of dof on each point and separate by fields 3902552f7358SJed Brown If constDof is PETSC_DETERMINE, constrain every dof on the point 3903552f7358SJed Brown */ 3904a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section) 3905a6dfd86eSKarl Rupp { 3906552f7358SJed Brown PetscInt numFields; 3907552f7358SJed Brown PetscInt bc; 3908552f7358SJed Brown PetscErrorCode ierr; 3909552f7358SJed Brown 3910552f7358SJed Brown PetscFunctionBegin; 3911552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3912552f7358SJed Brown for (bc = 0; bc < numBC; ++bc) { 3913552f7358SJed Brown PetscInt field = 0; 3914552f7358SJed Brown const PetscInt *idx; 3915552f7358SJed Brown PetscInt n, i; 3916552f7358SJed Brown 39170d644c17SKarl Rupp if (numFields) field = bcField[bc]; 3918552f7358SJed Brown ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr); 3919552f7358SJed Brown ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 3920552f7358SJed Brown for (i = 0; i < n; ++i) { 3921552f7358SJed Brown const PetscInt p = idx[i]; 3922552f7358SJed Brown PetscInt numConst = constDof; 3923552f7358SJed Brown 3924552f7358SJed Brown /* Constrain every dof on the point */ 3925552f7358SJed Brown if (numConst < 0) { 3926552f7358SJed Brown if (numFields) { 3927552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr); 3928552f7358SJed Brown } else { 3929552f7358SJed Brown ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr); 3930552f7358SJed Brown } 3931552f7358SJed Brown } 3932552f7358SJed Brown if (numFields) { 3933552f7358SJed Brown ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr); 3934552f7358SJed Brown } 3935552f7358SJed Brown ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr); 3936552f7358SJed Brown } 3937552f7358SJed Brown ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr); 3938552f7358SJed Brown } 3939552f7358SJed Brown PetscFunctionReturn(0); 3940552f7358SJed Brown } 3941552f7358SJed Brown 3942552f7358SJed Brown #undef __FUNCT__ 3943552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll" 3944552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 39450adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section) 39460adebc6cSBarry Smith { 3947552f7358SJed Brown PetscInt *maxConstraints; 3948552f7358SJed Brown PetscInt numFields, f, pStart = 0, pEnd = 0, p; 3949552f7358SJed Brown PetscErrorCode ierr; 3950552f7358SJed Brown 3951552f7358SJed Brown PetscFunctionBegin; 3952552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 3953552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 3954785e854fSJed Brown ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr); 39550d644c17SKarl Rupp for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0; 3956552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3957552f7358SJed Brown PetscInt cdof; 3958552f7358SJed Brown 3959552f7358SJed Brown if (numFields) { 3960552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3961552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr); 3962552f7358SJed Brown maxConstraints[f] = PetscMax(maxConstraints[f], cdof); 3963552f7358SJed Brown } 3964552f7358SJed Brown } else { 3965552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3966552f7358SJed Brown maxConstraints[0] = PetscMax(maxConstraints[0], cdof); 3967552f7358SJed Brown } 3968552f7358SJed Brown } 3969552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3970552f7358SJed Brown maxConstraints[numFields] += maxConstraints[f]; 3971552f7358SJed Brown } 3972552f7358SJed Brown if (maxConstraints[numFields]) { 3973552f7358SJed Brown PetscInt *indices; 3974552f7358SJed Brown 3975785e854fSJed Brown ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr); 3976552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 3977552f7358SJed Brown PetscInt cdof, d; 3978552f7358SJed Brown 3979552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 3980552f7358SJed Brown if (cdof) { 3981552f7358SJed 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]); 3982552f7358SJed Brown if (numFields) { 3983552f7358SJed Brown PetscInt numConst = 0, foff = 0; 3984552f7358SJed Brown 3985552f7358SJed Brown for (f = 0; f < numFields; ++f) { 3986552f7358SJed Brown PetscInt cfdof, fdof; 3987552f7358SJed Brown 3988552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 3989552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr); 3990552f7358SJed Brown /* Change constraint numbering from absolute local dof number to field relative local dof number */ 39910d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] = d; 3992552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr); 39930d644c17SKarl Rupp for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff; 3994552f7358SJed Brown numConst += cfdof; 3995552f7358SJed Brown foff += fdof; 3996552f7358SJed Brown } 3997552f7358SJed Brown if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 3998552f7358SJed Brown } else { 39990d644c17SKarl Rupp for (d = 0; d < cdof; ++d) indices[d] = d; 4000552f7358SJed Brown } 4001552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4002552f7358SJed Brown } 4003552f7358SJed Brown } 4004552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4005552f7358SJed Brown } 4006552f7358SJed Brown ierr = PetscFree(maxConstraints);CHKERRQ(ierr); 4007552f7358SJed Brown PetscFunctionReturn(0); 4008552f7358SJed Brown } 4009552f7358SJed Brown 4010552f7358SJed Brown #undef __FUNCT__ 4011552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField" 4012552f7358SJed Brown /* Set the constrained field indices on each point */ 40130adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section) 40140adebc6cSBarry Smith { 4015552f7358SJed Brown const PetscInt *points, *indices; 4016552f7358SJed Brown PetscInt numFields, maxDof, numPoints, p, numConstraints; 4017552f7358SJed Brown PetscErrorCode ierr; 4018552f7358SJed Brown 4019552f7358SJed Brown PetscFunctionBegin; 4020552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4021552f7358SJed 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); 4022552f7358SJed Brown 4023552f7358SJed Brown ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr); 4024552f7358SJed Brown ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr); 4025552f7358SJed Brown if (!constraintIndices) { 4026552f7358SJed Brown PetscInt *idx, i; 4027552f7358SJed Brown 4028552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4029785e854fSJed Brown ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr); 40300d644c17SKarl Rupp for (i = 0; i < maxDof; ++i) idx[i] = i; 4031552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4032552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr); 4033552f7358SJed Brown } 4034552f7358SJed Brown ierr = PetscFree(idx);CHKERRQ(ierr); 4035552f7358SJed Brown } else { 4036552f7358SJed Brown ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr); 4037552f7358SJed Brown ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr); 4038552f7358SJed Brown for (p = 0; p < numPoints; ++p) { 4039552f7358SJed Brown PetscInt fcdof; 4040552f7358SJed Brown 4041552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr); 404282f516ccSBarry 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); 4043552f7358SJed Brown ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr); 4044552f7358SJed Brown } 4045552f7358SJed Brown ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr); 4046552f7358SJed Brown } 4047552f7358SJed Brown ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr); 4048552f7358SJed Brown PetscFunctionReturn(0); 4049552f7358SJed Brown } 4050552f7358SJed Brown 4051552f7358SJed Brown #undef __FUNCT__ 4052552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices" 4053552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */ 40540adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section) 40550adebc6cSBarry Smith { 4056552f7358SJed Brown PetscInt *indices; 4057552f7358SJed Brown PetscInt numFields, maxDof, f, pStart = 0, pEnd = 0, p; 4058552f7358SJed Brown PetscErrorCode ierr; 4059552f7358SJed Brown 4060552f7358SJed Brown PetscFunctionBegin; 4061552f7358SJed Brown ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr); 4062785e854fSJed Brown ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr); 4063552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 406482f516ccSBarry Smith if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices."); 4065552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4066552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 4067552f7358SJed Brown PetscInt cdof, d; 4068552f7358SJed Brown 4069552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr); 4070552f7358SJed Brown if (cdof) { 4071552f7358SJed Brown PetscInt numConst = 0, foff = 0; 4072552f7358SJed Brown 4073552f7358SJed Brown for (f = 0; f < numFields; ++f) { 4074552f7358SJed Brown const PetscInt *fcind; 4075552f7358SJed Brown PetscInt fdof, fcdof; 4076552f7358SJed Brown 4077552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr); 4078552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr); 4079552f7358SJed Brown if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);} 4080552f7358SJed Brown /* Change constraint numbering from field relative local dof number to absolute local dof number */ 40810d644c17SKarl Rupp for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff; 4082552f7358SJed Brown foff += fdof; 4083552f7358SJed Brown numConst += fcdof; 4084552f7358SJed Brown } 408582f516ccSBarry Smith if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof); 4086552f7358SJed Brown ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr); 4087552f7358SJed Brown } 4088552f7358SJed Brown } 4089552f7358SJed Brown ierr = PetscFree(indices);CHKERRQ(ierr); 4090552f7358SJed Brown PetscFunctionReturn(0); 4091552f7358SJed Brown } 4092552f7358SJed Brown 4093552f7358SJed Brown #undef __FUNCT__ 4094552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection" 4095552f7358SJed Brown /*@C 4096552f7358SJed Brown DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided. 4097552f7358SJed Brown 4098552f7358SJed Brown Not Collective 4099552f7358SJed Brown 4100552f7358SJed Brown Input Parameters: 4101552f7358SJed Brown + dm - The DMPlex object 4102552f7358SJed Brown . dim - The spatial dimension of the problem 4103552f7358SJed Brown . numFields - The number of fields in the problem 4104552f7358SJed Brown . numComp - An array of size numFields that holds the number of components for each field 4105552f7358SJed 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 4106552f7358SJed Brown . numBC - The number of boundary conditions 4107552f7358SJed Brown . bcField - An array of size numBC giving the field number for each boundry condition 4108552f7358SJed Brown - bcPoints - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies 4109552f7358SJed Brown 4110552f7358SJed Brown Output Parameter: 4111552f7358SJed Brown . section - The PetscSection object 4112552f7358SJed Brown 4113552f7358SJed 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 4114552f7358SJed Brown nubmer of dof for field 0 on each edge. 4115552f7358SJed Brown 4116552f7358SJed Brown Level: developer 4117552f7358SJed Brown 41183813dfbdSMatthew G Knepley Fortran Notes: 41193813dfbdSMatthew G Knepley A Fortran 90 version is available as DMPlexCreateSectionF90() 41203813dfbdSMatthew G Knepley 4121552f7358SJed Brown .keywords: mesh, elements 4122552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate() 4123552f7358SJed Brown @*/ 4124a6dfd86eSKarl 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) 4125a6dfd86eSKarl Rupp { 4126552f7358SJed Brown PetscErrorCode ierr; 4127552f7358SJed Brown 4128552f7358SJed Brown PetscFunctionBegin; 4129552f7358SJed Brown ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr); 4130552f7358SJed Brown ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr); 4131552f7358SJed Brown ierr = PetscSectionSetUp(*section);CHKERRQ(ierr); 4132552f7358SJed Brown if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);} 4133ce1779c8SBarry Smith ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr); 4134552f7358SJed Brown PetscFunctionReturn(0); 4135552f7358SJed Brown } 4136552f7358SJed Brown 4137552f7358SJed Brown #undef __FUNCT__ 4138552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex" 41390adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm) 41400adebc6cSBarry Smith { 4141552f7358SJed Brown PetscSection section; 4142552f7358SJed Brown PetscErrorCode ierr; 4143552f7358SJed Brown 4144552f7358SJed Brown PetscFunctionBegin; 414538221697SMatthew G. Knepley ierr = DMClone(dm, cdm);CHKERRQ(ierr); 414682f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 4147552f7358SJed Brown ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr); 41481d799100SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 4149552f7358SJed Brown PetscFunctionReturn(0); 4150552f7358SJed Brown } 4151552f7358SJed Brown 4152552f7358SJed Brown #undef __FUNCT__ 4153552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection" 41540adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section) 41550adebc6cSBarry Smith { 4156552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4157552f7358SJed Brown 4158552f7358SJed Brown PetscFunctionBegin; 4159552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4160552f7358SJed Brown if (section) *section = mesh->coneSection; 4161552f7358SJed Brown PetscFunctionReturn(0); 4162552f7358SJed Brown } 4163552f7358SJed Brown 4164552f7358SJed Brown #undef __FUNCT__ 41658cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection" 41668cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section) 41678cb4d582SMatthew G. Knepley { 41688cb4d582SMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dm->data; 41698cb4d582SMatthew G. Knepley 41708cb4d582SMatthew G. Knepley PetscFunctionBegin; 41718cb4d582SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 41728cb4d582SMatthew G. Knepley if (section) *section = mesh->supportSection; 41738cb4d582SMatthew G. Knepley PetscFunctionReturn(0); 41748cb4d582SMatthew G. Knepley } 41758cb4d582SMatthew G. Knepley 41768cb4d582SMatthew G. Knepley #undef __FUNCT__ 4177552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones" 4178a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[]) 4179a6dfd86eSKarl Rupp { 4180552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4181552f7358SJed Brown 4182552f7358SJed Brown PetscFunctionBegin; 4183552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4184552f7358SJed Brown if (cones) *cones = mesh->cones; 4185552f7358SJed Brown PetscFunctionReturn(0); 4186552f7358SJed Brown } 4187552f7358SJed Brown 4188552f7358SJed Brown #undef __FUNCT__ 4189552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations" 4190a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[]) 4191a6dfd86eSKarl Rupp { 4192552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 4193552f7358SJed Brown 4194552f7358SJed Brown PetscFunctionBegin; 4195552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4196552f7358SJed Brown if (coneOrientations) *coneOrientations = mesh->coneOrientations; 4197552f7358SJed Brown PetscFunctionReturn(0); 4198552f7358SJed Brown } 4199552f7358SJed Brown 4200552f7358SJed Brown /******************************** FEM Support **********************************/ 4201552f7358SJed Brown 4202552f7358SJed Brown #undef __FUNCT__ 42031a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static" 42041a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4205a6dfd86eSKarl Rupp { 4206552f7358SJed Brown PetscScalar *array, *vArray; 4207d9917b9dSMatthew G. Knepley const PetscInt *cone, *coneO; 42081a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, size = 0, offset = 0; 4209552f7358SJed Brown PetscErrorCode ierr; 4210552f7358SJed Brown 42111b406b76SMatthew G. Knepley PetscFunctionBeginHot; 42122a3aaacfSMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 42135a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 42145a1bb5cfSMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 42155a1bb5cfSMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 42163f7cbbe7SMatthew G. Knepley if (!values || !*values) { 42179df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 42189df71ca4SMatthew G. Knepley PetscInt dof; 4219d9917b9dSMatthew G. Knepley 42209df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 42219df71ca4SMatthew G. Knepley size += dof; 42229df71ca4SMatthew G. Knepley } 42239df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 42249df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 42252a3aaacfSMatthew G. Knepley PetscInt dof; 42265a1bb5cfSMatthew G. Knepley 42275a1bb5cfSMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 42282a3aaacfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 42295a1bb5cfSMatthew G. Knepley size += dof; 42305a1bb5cfSMatthew G. Knepley } 42313f7cbbe7SMatthew G. Knepley if (!values) { 42323f7cbbe7SMatthew G. Knepley if (csize) *csize = size; 42333f7cbbe7SMatthew G. Knepley PetscFunctionReturn(0); 42343f7cbbe7SMatthew G. Knepley } 42355a1bb5cfSMatthew G. Knepley ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr); 4236982e9ed1SMatthew G. Knepley } else { 4237982e9ed1SMatthew G. Knepley array = *values; 4238982e9ed1SMatthew G. Knepley } 42399df71ca4SMatthew G. Knepley size = 0; 42405a1bb5cfSMatthew G. Knepley ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 42419df71ca4SMatthew G. Knepley if ((point >= pStart) && (point < pEnd)) { 42429df71ca4SMatthew G. Knepley PetscInt dof, off, d; 42439df71ca4SMatthew G. Knepley PetscScalar *varr; 4244d9917b9dSMatthew G. Knepley 42459df71ca4SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 42469df71ca4SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 42479df71ca4SMatthew G. Knepley varr = &vArray[off]; 42481a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 42491a271a75SMatthew G. Knepley array[offset] = varr[d]; 42509df71ca4SMatthew G. Knepley } 42519df71ca4SMatthew G. Knepley size += dof; 42529df71ca4SMatthew G. Knepley } 42539df71ca4SMatthew G. Knepley for (p = 0; p < numPoints; ++p) { 42549df71ca4SMatthew G. Knepley const PetscInt cp = cone[p]; 42559df71ca4SMatthew G. Knepley PetscInt o = coneO[p]; 42565a1bb5cfSMatthew G. Knepley PetscInt dof, off, d; 42575a1bb5cfSMatthew G. Knepley PetscScalar *varr; 42585a1bb5cfSMatthew G. Knepley 425952ed52e8SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) continue; 42605a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 42615a1bb5cfSMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr); 42625a1bb5cfSMatthew G. Knepley varr = &vArray[off]; 42635a1bb5cfSMatthew G. Knepley if (o >= 0) { 42641a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) { 42651a271a75SMatthew G. Knepley array[offset] = varr[d]; 42665a1bb5cfSMatthew G. Knepley } 42675a1bb5cfSMatthew G. Knepley } else { 42681a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) { 42691a271a75SMatthew G. Knepley array[offset] = varr[d]; 42705a1bb5cfSMatthew G. Knepley } 42715a1bb5cfSMatthew G. Knepley } 42729df71ca4SMatthew G. Knepley size += dof; 42735a1bb5cfSMatthew G. Knepley } 42745a1bb5cfSMatthew G. Knepley ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 42759df71ca4SMatthew G. Knepley if (!*values) { 42765a1bb5cfSMatthew G. Knepley if (csize) *csize = size; 42775a1bb5cfSMatthew G. Knepley *values = array; 42789df71ca4SMatthew G. Knepley } else { 42799df71ca4SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 42808c312ff3SMatthew G. Knepley *csize = size; 42819df71ca4SMatthew G. Knepley } 42825a1bb5cfSMatthew G. Knepley PetscFunctionReturn(0); 42835a1bb5cfSMatthew G. Knepley } 4284d9917b9dSMatthew G. Knepley 4285d9917b9dSMatthew G. Knepley #undef __FUNCT__ 42861a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static" 42871a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[]) 42881a271a75SMatthew G. Knepley { 42891a271a75SMatthew G. Knepley PetscInt offset = 0, p; 42901a271a75SMatthew G. Knepley PetscErrorCode ierr; 42911a271a75SMatthew G. Knepley 42921a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4293fe02ba77SJed Brown *size = 0; 42941a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 42951a271a75SMatthew G. Knepley const PetscInt point = points[p]; 42961a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 42971a271a75SMatthew G. Knepley PetscInt dof, off, d; 42981a271a75SMatthew G. Knepley const PetscScalar *varr; 42991a271a75SMatthew G. Knepley 43001a271a75SMatthew G. Knepley ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 43011a271a75SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 43021a271a75SMatthew G. Knepley varr = &vArray[off]; 43031a271a75SMatthew G. Knepley if (o >= 0) { 43041a271a75SMatthew G. Knepley for (d = 0; d < dof; ++d, ++offset) array[offset] = varr[d]; 43051a271a75SMatthew G. Knepley } else { 43061a271a75SMatthew G. Knepley for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d]; 43071a271a75SMatthew G. Knepley } 43081a271a75SMatthew G. Knepley } 43091a271a75SMatthew G. Knepley *size = offset; 43101a271a75SMatthew G. Knepley PetscFunctionReturn(0); 43111a271a75SMatthew G. Knepley } 43121a271a75SMatthew G. Knepley 43131a271a75SMatthew G. Knepley #undef __FUNCT__ 43141a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static" 43151a271a75SMatthew 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[]) 43161a271a75SMatthew G. Knepley { 43171a271a75SMatthew G. Knepley PetscInt offset = 0, f; 43181a271a75SMatthew G. Knepley PetscErrorCode ierr; 43191a271a75SMatthew G. Knepley 43201a271a75SMatthew G. Knepley PetscFunctionBeginHot; 4321fe02ba77SJed Brown *size = 0; 43221a271a75SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 43231a271a75SMatthew G. Knepley PetscInt fcomp, p; 43241a271a75SMatthew G. Knepley 43251a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 43261a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 43271a271a75SMatthew G. Knepley const PetscInt point = points[p]; 43281a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 43291a271a75SMatthew G. Knepley PetscInt fdof, foff, d, c; 43301a271a75SMatthew G. Knepley const PetscScalar *varr; 43311a271a75SMatthew G. Knepley 43321a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 43331a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 43341a271a75SMatthew G. Knepley varr = &vArray[foff]; 43351a271a75SMatthew G. Knepley if (o >= 0) { 43361a271a75SMatthew G. Knepley for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d]; 43371a271a75SMatthew G. Knepley } else { 43381a271a75SMatthew G. Knepley for (d = fdof/fcomp-1; d >= 0; --d) { 43391a271a75SMatthew G. Knepley for (c = 0; c < fcomp; ++c, ++offset) { 43401a271a75SMatthew G. Knepley array[offset] = varr[d*fcomp+c]; 43411a271a75SMatthew G. Knepley } 43421a271a75SMatthew G. Knepley } 43431a271a75SMatthew G. Knepley } 43441a271a75SMatthew G. Knepley } 43451a271a75SMatthew G. Knepley } 43461a271a75SMatthew G. Knepley *size = offset; 43471a271a75SMatthew G. Knepley PetscFunctionReturn(0); 43481a271a75SMatthew G. Knepley } 43491a271a75SMatthew G. Knepley 43501a271a75SMatthew G. Knepley #undef __FUNCT__ 4351552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure" 4352552f7358SJed Brown /*@C 4353552f7358SJed Brown DMPlexVecGetClosure - Get an array of the values on the closure of 'point' 4354552f7358SJed Brown 4355552f7358SJed Brown Not collective 4356552f7358SJed Brown 4357552f7358SJed Brown Input Parameters: 4358552f7358SJed Brown + dm - The DM 4359552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section 4360552f7358SJed Brown . v - The local vector 4361552f7358SJed Brown - point - The sieve point in the DM 4362552f7358SJed Brown 4363552f7358SJed Brown Output Parameters: 4364552f7358SJed Brown + csize - The number of values in the closure, or NULL 4365552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4366552f7358SJed Brown 4367552f7358SJed Brown Fortran Notes: 4368552f7358SJed Brown Since it returns an array, this routine is only available in Fortran 90, and you must 4369552f7358SJed Brown include petsc.h90 in your code. 4370552f7358SJed Brown 4371552f7358SJed Brown The csize argument is not present in the Fortran 90 binding since it is internal to the array. 4372552f7358SJed Brown 4373552f7358SJed Brown Level: intermediate 4374552f7358SJed Brown 4375552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4376552f7358SJed Brown @*/ 4377552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4378552f7358SJed Brown { 4379552f7358SJed Brown PetscSection clSection; 4380d9917b9dSMatthew G. Knepley IS clPoints; 4381552f7358SJed Brown PetscScalar *array, *vArray; 4382552f7358SJed Brown PetscInt *points = NULL; 4383d9917b9dSMatthew G. Knepley const PetscInt *clp; 43841a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, size; 4385552f7358SJed Brown PetscErrorCode ierr; 4386552f7358SJed Brown 4387d9917b9dSMatthew G. Knepley PetscFunctionBeginHot; 4388552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 4389552f7358SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 43901a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 43911a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 4392552f7358SJed Brown ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 4393552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4394552f7358SJed Brown if (depth == 1 && numFields < 2) { 43951a271a75SMatthew G. Knepley ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr); 4396552f7358SJed Brown PetscFunctionReturn(0); 4397552f7358SJed Brown } 43981a271a75SMatthew G. Knepley /* Get points */ 4399d9917b9dSMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 4400d9917b9dSMatthew G. Knepley if (!clPoints) { 44011a271a75SMatthew G. Knepley PetscInt pStart, pEnd, p, q; 4402552f7358SJed Brown 44031a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4404552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4405552f7358SJed Brown /* Compress out points not in the section */ 4406552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4407552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4408552f7358SJed Brown points[q*2] = points[p]; 4409552f7358SJed Brown points[q*2+1] = points[p+1]; 4410552f7358SJed Brown ++q; 4411552f7358SJed Brown } 4412552f7358SJed Brown } 4413552f7358SJed Brown numPoints = q; 4414d9917b9dSMatthew G. Knepley } else { 4415d9917b9dSMatthew G. Knepley PetscInt dof, off; 4416552f7358SJed Brown 4417d9917b9dSMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 4418d9917b9dSMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 4419d9917b9dSMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 44201a271a75SMatthew G. Knepley numPoints = dof/2; 4421d9917b9dSMatthew G. Knepley points = (PetscInt *) &clp[off]; 4422552f7358SJed Brown } 44231a271a75SMatthew G. Knepley /* Get array */ 4424552f7358SJed Brown if (!values || !*values) { 44251a271a75SMatthew G. Knepley PetscInt asize = 0, dof, p; 4426552f7358SJed Brown 44271a271a75SMatthew G. Knepley for (p = 0; p < numPoints*2; p += 2) { 4428552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 44291a271a75SMatthew G. Knepley asize += dof; 4430552f7358SJed Brown } 4431bd6c0d32SMatthew G. Knepley if (!values) { 4432d9917b9dSMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 44331a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 44341a271a75SMatthew G. Knepley if (csize) *csize = asize; 4435bd6c0d32SMatthew G. Knepley PetscFunctionReturn(0); 4436bd6c0d32SMatthew G. Knepley } 44371a271a75SMatthew G. Knepley ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr); 4438d0f6b257SMatthew G. Knepley } else { 4439d0f6b257SMatthew G. Knepley array = *values; 4440d0f6b257SMatthew G. Knepley } 4441552f7358SJed Brown ierr = VecGetArray(v, &vArray);CHKERRQ(ierr); 44421a271a75SMatthew G. Knepley /* Get values */ 4443ef90cfe2SMatthew G. Knepley if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);} 44441a271a75SMatthew G. Knepley else {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);} 44451a271a75SMatthew G. Knepley /* Cleanup points */ 44461a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 44471a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 44481a271a75SMatthew G. Knepley /* Cleanup array */ 4449552f7358SJed Brown ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr); 4450d0f6b257SMatthew G. Knepley if (!*values) { 4451552f7358SJed Brown if (csize) *csize = size; 4452552f7358SJed Brown *values = array; 4453d0f6b257SMatthew G. Knepley } else { 4454d0f6b257SMatthew G. Knepley if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size); 4455d0f6b257SMatthew G. Knepley *csize = size; 4456d0f6b257SMatthew G. Knepley } 4457552f7358SJed Brown PetscFunctionReturn(0); 4458552f7358SJed Brown } 4459552f7358SJed Brown 4460552f7358SJed Brown #undef __FUNCT__ 4461552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure" 4462552f7358SJed Brown /*@C 4463552f7358SJed Brown DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point' 4464552f7358SJed Brown 4465552f7358SJed Brown Not collective 4466552f7358SJed Brown 4467552f7358SJed Brown Input Parameters: 4468552f7358SJed Brown + dm - The DM 44690298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section 4470552f7358SJed Brown . v - The local vector 4471552f7358SJed Brown . point - The sieve point in the DM 44720298fd71SBarry Smith . csize - The number of values in the closure, or NULL 4473552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed 4474552f7358SJed Brown 44753813dfbdSMatthew G Knepley Fortran Notes: 44763813dfbdSMatthew G Knepley Since it returns an array, this routine is only available in Fortran 90, and you must 44773813dfbdSMatthew G Knepley include petsc.h90 in your code. 44783813dfbdSMatthew G Knepley 44793813dfbdSMatthew G Knepley The csize argument is not present in the Fortran 90 binding since it is internal to the array. 44803813dfbdSMatthew G Knepley 4481552f7358SJed Brown Level: intermediate 4482552f7358SJed Brown 4483552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure() 4484552f7358SJed Brown @*/ 44857c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[]) 4486a6dfd86eSKarl Rupp { 4487552f7358SJed Brown PetscInt size = 0; 4488552f7358SJed Brown PetscErrorCode ierr; 4489552f7358SJed Brown 4490552f7358SJed Brown PetscFunctionBegin; 4491552f7358SJed Brown /* Should work without recalculating size */ 4492552f7358SJed Brown ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr); 4493552f7358SJed Brown PetscFunctionReturn(0); 4494552f7358SJed Brown } 4495552f7358SJed Brown 4496552f7358SJed Brown PETSC_STATIC_INLINE void add (PetscScalar *x, PetscScalar y) {*x += y;} 4497552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x = y;} 4498552f7358SJed Brown 4499552f7358SJed Brown #undef __FUNCT__ 4500552f7358SJed Brown #define __FUNCT__ "updatePoint_private" 45011a271a75SMatthew 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[]) 4502552f7358SJed Brown { 4503552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4504552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4505552f7358SJed Brown PetscScalar *a; 4506552f7358SJed Brown PetscInt off, cind = 0, k; 4507552f7358SJed Brown PetscErrorCode ierr; 4508552f7358SJed Brown 4509552f7358SJed Brown PetscFunctionBegin; 4510552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4511552f7358SJed Brown ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4512552f7358SJed Brown a = &array[off]; 4513552f7358SJed Brown if (!cdof || setBC) { 4514552f7358SJed Brown if (orientation >= 0) { 4515552f7358SJed Brown for (k = 0; k < dof; ++k) { 4516552f7358SJed Brown fuse(&a[k], values[k]); 4517552f7358SJed Brown } 4518552f7358SJed Brown } else { 4519552f7358SJed Brown for (k = 0; k < dof; ++k) { 4520552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4521552f7358SJed Brown } 4522552f7358SJed Brown } 4523552f7358SJed Brown } else { 4524552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4525552f7358SJed Brown if (orientation >= 0) { 4526552f7358SJed Brown for (k = 0; k < dof; ++k) { 4527552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4528552f7358SJed Brown fuse(&a[k], values[k]); 4529552f7358SJed Brown } 4530552f7358SJed Brown } else { 4531552f7358SJed Brown for (k = 0; k < dof; ++k) { 4532552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4533552f7358SJed Brown fuse(&a[k], values[dof-k-1]); 4534552f7358SJed Brown } 4535552f7358SJed Brown } 4536552f7358SJed Brown } 4537552f7358SJed Brown PetscFunctionReturn(0); 4538552f7358SJed Brown } 4539552f7358SJed Brown 4540552f7358SJed Brown #undef __FUNCT__ 4541a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private" 45421a271a75SMatthew 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[]) 4543a5e93ea8SMatthew G. Knepley { 4544a5e93ea8SMatthew G. Knepley PetscInt cdof; /* The number of constraints on this point */ 4545a5e93ea8SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4546a5e93ea8SMatthew G. Knepley PetscScalar *a; 4547a5e93ea8SMatthew G. Knepley PetscInt off, cind = 0, k; 4548a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4549a5e93ea8SMatthew G. Knepley 4550a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4551a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4552a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr); 4553a5e93ea8SMatthew G. Knepley a = &array[off]; 4554a5e93ea8SMatthew G. Knepley if (cdof) { 4555a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4556a5e93ea8SMatthew G. Knepley if (orientation >= 0) { 4557a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4558a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4559a5e93ea8SMatthew G. Knepley fuse(&a[k], values[k]); 4560a5e93ea8SMatthew G. Knepley ++cind; 4561a5e93ea8SMatthew G. Knepley } 4562a5e93ea8SMatthew G. Knepley } 4563a5e93ea8SMatthew G. Knepley } else { 4564a5e93ea8SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4565a5e93ea8SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) { 4566a5e93ea8SMatthew G. Knepley fuse(&a[k], values[dof-k-1]); 4567a5e93ea8SMatthew G. Knepley ++cind; 4568a5e93ea8SMatthew G. Knepley } 4569a5e93ea8SMatthew G. Knepley } 4570a5e93ea8SMatthew G. Knepley } 4571a5e93ea8SMatthew G. Knepley } 4572a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4573a5e93ea8SMatthew G. Knepley } 4574a5e93ea8SMatthew G. Knepley 4575a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 4576552f7358SJed Brown #define __FUNCT__ "updatePointFields_private" 45771a271a75SMatthew 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[]) 4578a6dfd86eSKarl Rupp { 4579552f7358SJed Brown PetscScalar *a; 45801a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 45811a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 45821a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4583552f7358SJed Brown PetscErrorCode ierr; 4584552f7358SJed Brown 4585552f7358SJed Brown PetscFunctionBegin; 4586552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4587552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 45881a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 45891a271a75SMatthew G. Knepley a = &array[foff]; 4590552f7358SJed Brown if (!fcdof || setBC) { 45911a271a75SMatthew G. Knepley if (o >= 0) { 45921a271a75SMatthew G. Knepley for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]); 4593552f7358SJed Brown } else { 4594552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4595552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 45961a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4597552f7358SJed Brown } 4598552f7358SJed Brown } 4599552f7358SJed Brown } 4600552f7358SJed Brown } else { 4601552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 46021a271a75SMatthew G. Knepley if (o >= 0) { 4603552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4604552f7358SJed Brown if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;} 46051a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4606552f7358SJed Brown } 4607552f7358SJed Brown } else { 4608552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4609552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4610552f7358SJed Brown if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;} 46111a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4612552f7358SJed Brown } 4613552f7358SJed Brown } 4614552f7358SJed Brown } 4615552f7358SJed Brown } 46161a271a75SMatthew G. Knepley *offset += fdof; 4617552f7358SJed Brown PetscFunctionReturn(0); 4618552f7358SJed Brown } 4619552f7358SJed Brown 4620552f7358SJed Brown #undef __FUNCT__ 4621a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private" 46221a271a75SMatthew 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[]) 4623a5e93ea8SMatthew G. Knepley { 4624a5e93ea8SMatthew G. Knepley PetscScalar *a; 46251a271a75SMatthew G. Knepley PetscInt fdof, foff, fcdof, foffset = *offset; 46261a271a75SMatthew G. Knepley const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 46271a271a75SMatthew G. Knepley PetscInt cind = 0, k, c; 4628a5e93ea8SMatthew G. Knepley PetscErrorCode ierr; 4629a5e93ea8SMatthew G. Knepley 4630a5e93ea8SMatthew G. Knepley PetscFunctionBegin; 4631a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4632a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr); 46331a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr); 46341a271a75SMatthew G. Knepley a = &array[foff]; 4635a5e93ea8SMatthew G. Knepley if (fcdof) { 4636a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 46371a271a75SMatthew G. Knepley if (o >= 0) { 4638a5e93ea8SMatthew G. Knepley for (k = 0; k < fdof; ++k) { 4639a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k == fcdofs[cind])) { 46401a271a75SMatthew G. Knepley fuse(&a[k], values[foffset+k]); 4641a5e93ea8SMatthew G. Knepley ++cind; 4642a5e93ea8SMatthew G. Knepley } 4643a5e93ea8SMatthew G. Knepley } 4644a5e93ea8SMatthew G. Knepley } else { 4645a5e93ea8SMatthew G. Knepley for (k = fdof/fcomp-1; k >= 0; --k) { 4646a5e93ea8SMatthew G. Knepley for (c = 0; c < fcomp; ++c) { 4647a5e93ea8SMatthew G. Knepley if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) { 46481a271a75SMatthew G. Knepley fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]); 4649a5e93ea8SMatthew G. Knepley ++cind; 4650a5e93ea8SMatthew G. Knepley } 4651a5e93ea8SMatthew G. Knepley } 4652a5e93ea8SMatthew G. Knepley } 4653a5e93ea8SMatthew G. Knepley } 4654a5e93ea8SMatthew G. Knepley } 46551a271a75SMatthew G. Knepley *offset += fdof; 4656a5e93ea8SMatthew G. Knepley PetscFunctionReturn(0); 4657a5e93ea8SMatthew G. Knepley } 4658a5e93ea8SMatthew G. Knepley 4659a5e93ea8SMatthew G. Knepley #undef __FUNCT__ 46601b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static" 46611a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 4662a6dfd86eSKarl Rupp { 4663552f7358SJed Brown PetscScalar *array; 46641b406b76SMatthew G. Knepley const PetscInt *cone, *coneO; 46651b406b76SMatthew G. Knepley PetscInt pStart, pEnd, p, numPoints, off, dof; 4666552f7358SJed Brown PetscErrorCode ierr; 4667552f7358SJed Brown 46681b406b76SMatthew G. Knepley PetscFunctionBeginHot; 4669b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4670b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr); 4671b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr); 4672b6ebb6e6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr); 4673b6ebb6e6SMatthew G. Knepley ierr = VecGetArray(v, &array);CHKERRQ(ierr); 4674b6ebb6e6SMatthew G. Knepley for (p = 0, off = 0; p <= numPoints; ++p, off += dof) { 4675b6ebb6e6SMatthew G. Knepley const PetscInt cp = !p ? point : cone[p-1]; 4676b6ebb6e6SMatthew G. Knepley const PetscInt o = !p ? 0 : coneO[p-1]; 4677b6ebb6e6SMatthew G. Knepley 4678b6ebb6e6SMatthew G. Knepley if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;} 4679b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr); 4680b6ebb6e6SMatthew G. Knepley /* ADD_VALUES */ 4681b6ebb6e6SMatthew G. Knepley { 4682b6ebb6e6SMatthew G. Knepley const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4683b6ebb6e6SMatthew G. Knepley PetscScalar *a; 4684b6ebb6e6SMatthew G. Knepley PetscInt cdof, coff, cind = 0, k; 4685b6ebb6e6SMatthew G. Knepley 4686b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr); 4687b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr); 4688b6ebb6e6SMatthew G. Knepley a = &array[coff]; 4689b6ebb6e6SMatthew G. Knepley if (!cdof) { 4690b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4691b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4692b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4693b6ebb6e6SMatthew G. Knepley } 4694b6ebb6e6SMatthew G. Knepley } else { 4695b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4696b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4697b6ebb6e6SMatthew G. Knepley } 4698b6ebb6e6SMatthew G. Knepley } 4699b6ebb6e6SMatthew G. Knepley } else { 4700b6ebb6e6SMatthew G. Knepley ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr); 4701b6ebb6e6SMatthew G. Knepley if (o >= 0) { 4702b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4703b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4704b6ebb6e6SMatthew G. Knepley a[k] += values[off+k]; 4705b6ebb6e6SMatthew G. Knepley } 4706b6ebb6e6SMatthew G. Knepley } else { 4707b6ebb6e6SMatthew G. Knepley for (k = 0; k < dof; ++k) { 4708b6ebb6e6SMatthew G. Knepley if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;} 4709b6ebb6e6SMatthew G. Knepley a[k] += values[off+dof-k-1]; 4710b6ebb6e6SMatthew G. Knepley } 4711b6ebb6e6SMatthew G. Knepley } 4712b6ebb6e6SMatthew G. Knepley } 4713b6ebb6e6SMatthew G. Knepley } 4714b6ebb6e6SMatthew G. Knepley } 4715b6ebb6e6SMatthew G. Knepley ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4716b6ebb6e6SMatthew G. Knepley PetscFunctionReturn(0); 4717b6ebb6e6SMatthew G. Knepley } 47181b406b76SMatthew G. Knepley 47191b406b76SMatthew G. Knepley #undef __FUNCT__ 47201b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure" 47211b406b76SMatthew G. Knepley /*@C 47221b406b76SMatthew G. Knepley DMPlexVecSetClosure - Set an array of the values on the closure of 'point' 47231b406b76SMatthew G. Knepley 47241b406b76SMatthew G. Knepley Not collective 47251b406b76SMatthew G. Knepley 47261b406b76SMatthew G. Knepley Input Parameters: 47271b406b76SMatthew G. Knepley + dm - The DM 47281b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section 47291b406b76SMatthew G. Knepley . v - The local vector 47301b406b76SMatthew G. Knepley . point - The sieve point in the DM 47311b406b76SMatthew G. Knepley . values - The array of values 47321b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 47331b406b76SMatthew G. Knepley 47341b406b76SMatthew G. Knepley Fortran Notes: 47351b406b76SMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 47361b406b76SMatthew G. Knepley 47371b406b76SMatthew G. Knepley Level: intermediate 47381b406b76SMatthew G. Knepley 47391b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure() 47401b406b76SMatthew G. Knepley @*/ 47411b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode) 47421b406b76SMatthew G. Knepley { 47431b406b76SMatthew G. Knepley PetscSection clSection; 47441b406b76SMatthew G. Knepley IS clPoints; 47451b406b76SMatthew G. Knepley PetscScalar *array; 47461b406b76SMatthew G. Knepley PetscInt *points = NULL; 47471b406b76SMatthew G. Knepley const PetscInt *clp; 47481a271a75SMatthew G. Knepley PetscInt depth, numFields, numPoints, p; 47491b406b76SMatthew G. Knepley PetscErrorCode ierr; 47501b406b76SMatthew G. Knepley 47511a271a75SMatthew G. Knepley PetscFunctionBeginHot; 47521b406b76SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 47531b406b76SMatthew G. Knepley if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 47541a271a75SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 47551a271a75SMatthew G. Knepley PetscValidHeaderSpecific(v, VEC_CLASSID, 3); 47561b406b76SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 47571b406b76SMatthew G. Knepley ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 47581b406b76SMatthew G. Knepley if (depth == 1 && numFields < 2 && mode == ADD_VALUES) { 47591a271a75SMatthew G. Knepley ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr); 47601b406b76SMatthew G. Knepley PetscFunctionReturn(0); 47611b406b76SMatthew G. Knepley } 47621a271a75SMatthew G. Knepley /* Get points */ 47631b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 47641b406b76SMatthew G. Knepley if (!clPoints) { 47651a271a75SMatthew G. Knepley PetscInt pStart, pEnd, q; 47661a271a75SMatthew G. Knepley 47671a271a75SMatthew G. Knepley ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 4768552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 4769552f7358SJed Brown /* Compress out points not in the section */ 4770552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 4771552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 4772552f7358SJed Brown points[q*2] = points[p]; 4773552f7358SJed Brown points[q*2+1] = points[p+1]; 4774552f7358SJed Brown ++q; 4775552f7358SJed Brown } 4776552f7358SJed Brown } 4777552f7358SJed Brown numPoints = q; 47781b406b76SMatthew G. Knepley } else { 47791b406b76SMatthew G. Knepley PetscInt dof, off; 4780552f7358SJed Brown 47811b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 47821b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 47831b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 47841a271a75SMatthew G. Knepley numPoints = dof/2; 47851b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 4786552f7358SJed Brown } 47871a271a75SMatthew G. Knepley /* Get array */ 4788552f7358SJed Brown ierr = VecGetArray(v, &array);CHKERRQ(ierr); 47891a271a75SMatthew G. Knepley /* Get values */ 4790ef90cfe2SMatthew G. Knepley if (numFields > 0) { 47911a271a75SMatthew G. Knepley PetscInt offset = 0, fcomp, f; 4792552f7358SJed Brown for (f = 0; f < numFields; ++f) { 47931a271a75SMatthew G. Knepley ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4794552f7358SJed Brown switch (mode) { 4795552f7358SJed Brown case INSERT_VALUES: 4796552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 47971a271a75SMatthew G. Knepley const PetscInt point = points[p]; 47981a271a75SMatthew G. Knepley const PetscInt o = points[p+1]; 47991a271a75SMatthew G. Knepley updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array); 4800552f7358SJed Brown } break; 4801552f7358SJed Brown case INSERT_ALL_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_TRUE, values, &offset, array); 4806552f7358SJed Brown } break; 4807a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4808a5e93ea8SMatthew G. Knepley 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 updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array); 4812a5e93ea8SMatthew G. Knepley } break; 4813552f7358SJed Brown case ADD_VALUES: 4814552f7358SJed Brown 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 updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array); 4818552f7358SJed Brown } break; 4819552f7358SJed Brown case ADD_ALL_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_TRUE, values, &offset, array); 4824552f7358SJed Brown } break; 4825552f7358SJed Brown default: 482682f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4827552f7358SJed Brown } 48281a271a75SMatthew G. Knepley } 4829552f7358SJed Brown } else { 48301a271a75SMatthew G. Knepley PetscInt dof, off; 48311a271a75SMatthew G. Knepley 4832552f7358SJed Brown switch (mode) { 4833552f7358SJed Brown case INSERT_VALUES: 4834552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4835552f7358SJed Brown PetscInt o = points[p+1]; 4836552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4837552f7358SJed Brown updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array); 4838552f7358SJed Brown } break; 4839552f7358SJed Brown case INSERT_ALL_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_TRUE, o, &values[off], array); 4844552f7358SJed Brown } break; 4845a5e93ea8SMatthew G. Knepley case INSERT_BC_VALUES: 4846a5e93ea8SMatthew G. Knepley for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4847a5e93ea8SMatthew G. Knepley PetscInt o = points[p+1]; 4848a5e93ea8SMatthew G. Knepley ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4849a5e93ea8SMatthew G. Knepley updatePointBC_private(section, points[p], dof, insert, o, &values[off], array); 4850a5e93ea8SMatthew G. Knepley } break; 4851552f7358SJed Brown case ADD_VALUES: 4852552f7358SJed Brown for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) { 4853552f7358SJed Brown PetscInt o = points[p+1]; 4854552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 4855552f7358SJed Brown updatePoint_private(section, points[p], dof, add, PETSC_FALSE, o, &values[off], array); 4856552f7358SJed Brown } break; 4857552f7358SJed Brown case ADD_ALL_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_TRUE, o, &values[off], array); 4862552f7358SJed Brown } break; 4863552f7358SJed Brown default: 486482f516ccSBarry Smith SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode); 4865552f7358SJed Brown } 4866552f7358SJed Brown } 48671a271a75SMatthew G. Knepley /* Cleanup points */ 48681a271a75SMatthew G. Knepley if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);} 48691a271a75SMatthew G. Knepley else {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);} 48701a271a75SMatthew G. Knepley /* Cleanup array */ 4871552f7358SJed Brown ierr = VecRestoreArray(v, &array);CHKERRQ(ierr); 4872552f7358SJed Brown PetscFunctionReturn(0); 4873552f7358SJed Brown } 4874552f7358SJed Brown 4875552f7358SJed Brown #undef __FUNCT__ 4876552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues" 4877b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[]) 4878552f7358SJed Brown { 4879552f7358SJed Brown PetscMPIInt rank; 4880552f7358SJed Brown PetscInt i, j; 4881552f7358SJed Brown PetscErrorCode ierr; 4882552f7358SJed Brown 4883552f7358SJed Brown PetscFunctionBegin; 488482f516ccSBarry Smith ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr); 488577a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr); 4886b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);} 4887b0ecff45SMatthew G. Knepley for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);} 4888b0ecff45SMatthew G. Knepley numCIndices = numCIndices ? numCIndices : numRIndices; 4889b0ecff45SMatthew G. Knepley for (i = 0; i < numRIndices; i++) { 489077a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr); 4891b0ecff45SMatthew G. Knepley for (j = 0; j < numCIndices; j++) { 4892519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX) 48937eba1a17SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr); 4894552f7358SJed Brown #else 4895b0ecff45SMatthew G. Knepley ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr); 4896552f7358SJed Brown #endif 4897552f7358SJed Brown } 489877a6746dSMatthew G Knepley ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr); 4899552f7358SJed Brown } 4900552f7358SJed Brown PetscFunctionReturn(0); 4901552f7358SJed Brown } 4902552f7358SJed Brown 4903552f7358SJed Brown #undef __FUNCT__ 4904552f7358SJed Brown #define __FUNCT__ "indicesPoint_private" 4905552f7358SJed Brown /* . off - The global offset of this point */ 4906e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4907a6dfd86eSKarl Rupp { 4908e6ccafaeSMatthew G Knepley PetscInt dof; /* The number of unknowns on this point */ 4909552f7358SJed Brown PetscInt cdof; /* The number of constraints on this point */ 4910552f7358SJed Brown const PetscInt *cdofs; /* The indices of the constrained dofs on this point */ 4911552f7358SJed Brown PetscInt cind = 0, k; 4912552f7358SJed Brown PetscErrorCode ierr; 4913552f7358SJed Brown 4914552f7358SJed Brown PetscFunctionBegin; 4915552f7358SJed Brown ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr); 4916552f7358SJed Brown ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr); 4917552f7358SJed Brown if (!cdof || setBC) { 4918552f7358SJed Brown if (orientation >= 0) { 4919e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+k] = off+k; 4920552f7358SJed Brown } else { 4921e6ccafaeSMatthew G Knepley for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k; 4922552f7358SJed Brown } 4923552f7358SJed Brown } else { 4924552f7358SJed Brown ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr); 4925552f7358SJed Brown if (orientation >= 0) { 4926552f7358SJed Brown for (k = 0; k < dof; ++k) { 4927552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4928552f7358SJed Brown /* Insert check for returning constrained indices */ 4929e6ccafaeSMatthew G Knepley indices[*loff+k] = -(off+k+1); 4930552f7358SJed Brown ++cind; 4931552f7358SJed Brown } else { 4932e6ccafaeSMatthew G Knepley indices[*loff+k] = off+k-cind; 4933552f7358SJed Brown } 4934552f7358SJed Brown } 4935552f7358SJed Brown } else { 4936552f7358SJed Brown for (k = 0; k < dof; ++k) { 4937552f7358SJed Brown if ((cind < cdof) && (k == cdofs[cind])) { 4938552f7358SJed Brown /* Insert check for returning constrained indices */ 4939e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = -(off+k+1); 4940552f7358SJed Brown ++cind; 4941552f7358SJed Brown } else { 4942e6ccafaeSMatthew G Knepley indices[*loff+dof-k-1] = off+k-cind; 4943552f7358SJed Brown } 4944552f7358SJed Brown } 4945552f7358SJed Brown } 4946552f7358SJed Brown } 4947e6ccafaeSMatthew G Knepley *loff += dof; 4948552f7358SJed Brown PetscFunctionReturn(0); 4949552f7358SJed Brown } 4950552f7358SJed Brown 4951552f7358SJed Brown #undef __FUNCT__ 4952552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private" 4953552f7358SJed Brown /* . off - The global offset of this point */ 4954a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[]) 4955a6dfd86eSKarl Rupp { 4956552f7358SJed Brown PetscInt numFields, foff, f; 4957552f7358SJed Brown PetscErrorCode ierr; 4958552f7358SJed Brown 4959552f7358SJed Brown PetscFunctionBegin; 4960552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 4961552f7358SJed Brown for (f = 0, foff = 0; f < numFields; ++f) { 4962552f7358SJed Brown PetscInt fdof, fcomp, cfdof; 4963552f7358SJed Brown const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */ 4964552f7358SJed Brown PetscInt cind = 0, k, c; 4965552f7358SJed Brown 4966552f7358SJed Brown ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr); 4967552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr); 4968552f7358SJed Brown ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr); 4969552f7358SJed Brown if (!cfdof || setBC) { 4970552f7358SJed Brown if (orientation >= 0) { 49710d644c17SKarl Rupp for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k; 4972552f7358SJed Brown } else { 4973552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4974552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4975552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c; 4976552f7358SJed Brown } 4977552f7358SJed Brown } 4978552f7358SJed Brown } 4979552f7358SJed Brown } else { 4980552f7358SJed Brown ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr); 4981552f7358SJed Brown if (orientation >= 0) { 4982552f7358SJed Brown for (k = 0; k < fdof; ++k) { 4983552f7358SJed Brown if ((cind < cfdof) && (k == fcdofs[cind])) { 4984552f7358SJed Brown indices[foffs[f]+k] = -(off+foff+k+1); 4985552f7358SJed Brown ++cind; 4986552f7358SJed Brown } else { 4987552f7358SJed Brown indices[foffs[f]+k] = off+foff+k-cind; 4988552f7358SJed Brown } 4989552f7358SJed Brown } 4990552f7358SJed Brown } else { 4991552f7358SJed Brown for (k = fdof/fcomp-1; k >= 0; --k) { 4992552f7358SJed Brown for (c = 0; c < fcomp; ++c) { 4993552f7358SJed Brown if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) { 4994552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1); 4995552f7358SJed Brown ++cind; 4996552f7358SJed Brown } else { 4997552f7358SJed Brown indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind; 4998552f7358SJed Brown } 4999552f7358SJed Brown } 5000552f7358SJed Brown } 5001552f7358SJed Brown } 5002552f7358SJed Brown } 5003552f7358SJed Brown foff += fdof - cfdof; 5004552f7358SJed Brown foffs[f] += fdof; 5005552f7358SJed Brown } 5006552f7358SJed Brown PetscFunctionReturn(0); 5007552f7358SJed Brown } 5008552f7358SJed Brown 5009552f7358SJed Brown #undef __FUNCT__ 5010552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure" 50117f5d1fdeSMatthew G. Knepley /*@C 50127f5d1fdeSMatthew G. Knepley DMPlexMatSetClosure - Set an array of the values on the closure of 'point' 50137f5d1fdeSMatthew G. Knepley 50147f5d1fdeSMatthew G. Knepley Not collective 50157f5d1fdeSMatthew G. Knepley 50167f5d1fdeSMatthew G. Knepley Input Parameters: 50177f5d1fdeSMatthew G. Knepley + dm - The DM 5018ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section 5019ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section 50207f5d1fdeSMatthew G. Knepley . A - The matrix 50217f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM 50227f5d1fdeSMatthew G. Knepley . values - The array of values 50237f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions 50247f5d1fdeSMatthew G. Knepley 50257f5d1fdeSMatthew G. Knepley Fortran Notes: 50267f5d1fdeSMatthew G. Knepley This routine is only available in Fortran 90, and you must include petsc.h90 in your code. 50277f5d1fdeSMatthew G. Knepley 50287f5d1fdeSMatthew G. Knepley Level: intermediate 50297f5d1fdeSMatthew G. Knepley 50307f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure() 50317f5d1fdeSMatthew G. Knepley @*/ 50327c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode) 5033552f7358SJed Brown { 5034552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 50351b406b76SMatthew G. Knepley PetscSection clSection; 50361b406b76SMatthew G. Knepley IS clPoints; 50370298fd71SBarry Smith PetscInt *points = NULL; 50381b406b76SMatthew G. Knepley const PetscInt *clp; 5039552f7358SJed Brown PetscInt *indices; 5040552f7358SJed Brown PetscInt offsets[32]; 5041552f7358SJed Brown PetscInt numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f; 5042552f7358SJed Brown PetscErrorCode ierr; 5043552f7358SJed Brown 5044552f7358SJed Brown PetscFunctionBegin; 5045552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5046ebd6d717SJed Brown if (!section) {ierr = DMGetDefaultSection(dm, §ion);CHKERRQ(ierr);} 50473dc93601SMatthew G. Knepley PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2); 5048ebd6d717SJed Brown if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);} 50493dc93601SMatthew G. Knepley PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3); 50503dc93601SMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 4); 5051552f7358SJed Brown ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr); 505282f516ccSBarry Smith if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5053552f7358SJed Brown ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 50541b406b76SMatthew G. Knepley ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr); 50551b406b76SMatthew G. Knepley if (!clPoints) { 5056552f7358SJed Brown ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 5057552f7358SJed Brown /* Compress out points not in the section */ 5058552f7358SJed Brown ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr); 5059552f7358SJed Brown for (p = 0, q = 0; p < numPoints*2; p += 2) { 5060552f7358SJed Brown if ((points[p] >= pStart) && (points[p] < pEnd)) { 5061552f7358SJed Brown points[q*2] = points[p]; 5062552f7358SJed Brown points[q*2+1] = points[p+1]; 5063552f7358SJed Brown ++q; 5064552f7358SJed Brown } 5065552f7358SJed Brown } 5066552f7358SJed Brown numPoints = q; 50671b406b76SMatthew G. Knepley } else { 50681b406b76SMatthew G. Knepley PetscInt dof, off; 50691b406b76SMatthew G. Knepley 50701b406b76SMatthew G. Knepley ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr); 50711b406b76SMatthew G. Knepley numPoints = dof/2; 50721b406b76SMatthew G. Knepley ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr); 50731b406b76SMatthew G. Knepley ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr); 50741b406b76SMatthew G. Knepley points = (PetscInt *) &clp[off]; 50751b406b76SMatthew G. Knepley } 5076552f7358SJed Brown for (p = 0, numIndices = 0; p < numPoints*2; p += 2) { 5077552f7358SJed Brown PetscInt fdof; 5078552f7358SJed Brown 5079552f7358SJed Brown ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr); 5080552f7358SJed Brown for (f = 0; f < numFields; ++f) { 5081552f7358SJed Brown ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr); 5082552f7358SJed Brown offsets[f+1] += fdof; 5083552f7358SJed Brown } 5084552f7358SJed Brown numIndices += dof; 5085552f7358SJed Brown } 50860d644c17SKarl Rupp for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f]; 50870d644c17SKarl Rupp 508882f516ccSBarry Smith if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices); 5089552f7358SJed Brown ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5090552f7358SJed Brown if (numFields) { 5091552f7358SJed Brown for (p = 0; p < numPoints*2; p += 2) { 5092552f7358SJed Brown PetscInt o = points[p+1]; 5093552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5094552f7358SJed Brown indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices); 5095552f7358SJed Brown } 5096552f7358SJed Brown } else { 5097e6ccafaeSMatthew G Knepley for (p = 0, off = 0; p < numPoints*2; p += 2) { 5098552f7358SJed Brown PetscInt o = points[p+1]; 5099552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr); 5100e6ccafaeSMatthew G Knepley indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices); 5101552f7358SJed Brown } 5102552f7358SJed Brown } 5103b0ecff45SMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);} 5104552f7358SJed Brown ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode); 5105552f7358SJed Brown if (ierr) { 5106552f7358SJed Brown PetscMPIInt rank; 5107552f7358SJed Brown PetscErrorCode ierr2; 5108552f7358SJed Brown 510982f516ccSBarry Smith ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 511077a6746dSMatthew G Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5111b0ecff45SMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2); 51126a415b8fSMatthew G Knepley ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2); 5113552f7358SJed Brown CHKERRQ(ierr); 5114552f7358SJed Brown } 51151b406b76SMatthew G. Knepley if (!clPoints) { 5116552f7358SJed Brown ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr); 51171b406b76SMatthew G. Knepley } else { 51181b406b76SMatthew G. Knepley ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr); 51191b406b76SMatthew G. Knepley } 5120552f7358SJed Brown ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr); 5121552f7358SJed Brown PetscFunctionReturn(0); 5122552f7358SJed Brown } 5123552f7358SJed Brown 5124552f7358SJed Brown #undef __FUNCT__ 5125de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined" 5126de41b84cSMatthew 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) 5127de41b84cSMatthew G. Knepley { 5128de41b84cSMatthew G. Knepley DM_Plex *mesh = (DM_Plex*) dmf->data; 5129de41b84cSMatthew G. Knepley PetscInt *fpoints = NULL, *ftotpoints = NULL; 5130de41b84cSMatthew G. Knepley PetscInt *cpoints = NULL; 5131de41b84cSMatthew G. Knepley PetscInt *findices, *cindices; 5132de41b84cSMatthew G. Knepley PetscInt foffsets[32], coffsets[32]; 5133de41b84cSMatthew G. Knepley CellRefiner cellRefiner; 51344ca5e9f5SMatthew G. Knepley PetscInt numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f; 5135de41b84cSMatthew G. Knepley PetscErrorCode ierr; 5136de41b84cSMatthew G. Knepley 5137de41b84cSMatthew G. Knepley PetscFunctionBegin; 5138de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmf, DM_CLASSID, 1); 5139de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(dmc, DM_CLASSID, 4); 5140de41b84cSMatthew G. Knepley if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);} 5141de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2); 5142de41b84cSMatthew G. Knepley if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);} 5143de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5); 5144de41b84cSMatthew G. Knepley if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);} 5145de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3); 5146de41b84cSMatthew G. Knepley if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);} 5147de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6); 5148de41b84cSMatthew G. Knepley PetscValidHeaderSpecific(A, MAT_CLASSID, 7); 5149de41b84cSMatthew G. Knepley ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr); 5150de41b84cSMatthew G. Knepley if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields); 5151de41b84cSMatthew G. Knepley ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5152de41b84cSMatthew G. Knepley ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr); 5153de41b84cSMatthew G. Knepley /* Column indices */ 5154de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 51554ca5e9f5SMatthew G. Knepley maxFPoints = numCPoints; 5156de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5157de41b84cSMatthew G. Knepley /* TODO: Squeeze out points with 0 dof as well */ 5158de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr); 5159de41b84cSMatthew G. Knepley for (p = 0, q = 0; p < numCPoints*2; p += 2) { 5160de41b84cSMatthew G. Knepley if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) { 5161de41b84cSMatthew G. Knepley cpoints[q*2] = cpoints[p]; 5162de41b84cSMatthew G. Knepley cpoints[q*2+1] = cpoints[p+1]; 5163de41b84cSMatthew G. Knepley ++q; 5164de41b84cSMatthew G. Knepley } 5165de41b84cSMatthew G. Knepley } 5166de41b84cSMatthew G. Knepley numCPoints = q; 5167de41b84cSMatthew G. Knepley for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) { 5168de41b84cSMatthew G. Knepley PetscInt fdof; 5169de41b84cSMatthew G. Knepley 5170de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr); 51714ca5e9f5SMatthew G. Knepley if (!dof) continue; 5172de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5173de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr); 5174de41b84cSMatthew G. Knepley coffsets[f+1] += fdof; 5175de41b84cSMatthew G. Knepley } 5176de41b84cSMatthew G. Knepley numCIndices += dof; 5177de41b84cSMatthew G. Knepley } 5178de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f]; 5179de41b84cSMatthew G. Knepley /* Row indices */ 5180de41b84cSMatthew G. Knepley ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr); 5181de41b84cSMatthew G. Knepley ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr); 51821ba5f902SMatthew G. Knepley ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5183de41b84cSMatthew G. Knepley for (r = 0, q = 0; r < numSubcells; ++r) { 5184de41b84cSMatthew G. Knepley /* TODO Map from coarse to fine cells */ 5185de41b84cSMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5186de41b84cSMatthew G. Knepley /* Compress out points not in the section */ 5187de41b84cSMatthew G. Knepley ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr); 5188de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5189de41b84cSMatthew G. Knepley if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) { 51904ca5e9f5SMatthew G. Knepley ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr); 51914ca5e9f5SMatthew G. Knepley if (!dof) continue; 51924ca5e9f5SMatthew G. Knepley for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break; 51934ca5e9f5SMatthew G. Knepley if (s < q) continue; 5194de41b84cSMatthew G. Knepley ftotpoints[q*2] = fpoints[p]; 5195de41b84cSMatthew G. Knepley ftotpoints[q*2+1] = fpoints[p+1]; 5196de41b84cSMatthew G. Knepley ++q; 5197de41b84cSMatthew G. Knepley } 5198de41b84cSMatthew G. Knepley } 5199de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr); 5200de41b84cSMatthew G. Knepley } 5201de41b84cSMatthew G. Knepley numFPoints = q; 5202de41b84cSMatthew G. Knepley for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) { 5203de41b84cSMatthew G. Knepley PetscInt fdof; 5204de41b84cSMatthew G. Knepley 5205de41b84cSMatthew G. Knepley ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr); 52064ca5e9f5SMatthew G. Knepley if (!dof) continue; 5207de41b84cSMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5208de41b84cSMatthew G. Knepley ierr = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr); 5209de41b84cSMatthew G. Knepley foffsets[f+1] += fdof; 5210de41b84cSMatthew G. Knepley } 5211de41b84cSMatthew G. Knepley numFIndices += dof; 5212de41b84cSMatthew G. Knepley } 5213de41b84cSMatthew G. Knepley for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f]; 5214de41b84cSMatthew G. Knepley 5215de41b84cSMatthew 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); 5216de41b84cSMatthew 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); 5217de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5218de41b84cSMatthew G. Knepley ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5219de41b84cSMatthew G. Knepley if (numFields) { 5220de41b84cSMatthew G. Knepley for (p = 0; p < numFPoints*2; p += 2) { 5221de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5222de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5223de41b84cSMatthew G. Knepley indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices); 5224de41b84cSMatthew G. Knepley } 5225de41b84cSMatthew G. Knepley for (p = 0; p < numCPoints*2; p += 2) { 5226de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5227de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5228de41b84cSMatthew G. Knepley indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices); 5229de41b84cSMatthew G. Knepley } 5230de41b84cSMatthew G. Knepley } else { 5231de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numFPoints*2; p += 2) { 5232de41b84cSMatthew G. Knepley PetscInt o = ftotpoints[p+1]; 5233de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr); 5234de41b84cSMatthew G. Knepley indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices); 5235de41b84cSMatthew G. Knepley } 5236de41b84cSMatthew G. Knepley for (p = 0, off = 0; p < numCPoints*2; p += 2) { 5237de41b84cSMatthew G. Knepley PetscInt o = cpoints[p+1]; 5238de41b84cSMatthew G. Knepley ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr); 5239de41b84cSMatthew G. Knepley indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices); 5240de41b84cSMatthew G. Knepley } 5241de41b84cSMatthew G. Knepley } 5242de41b84cSMatthew G. Knepley if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);} 5243de41b84cSMatthew G. Knepley ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode); 5244de41b84cSMatthew G. Knepley if (ierr) { 5245de41b84cSMatthew G. Knepley PetscMPIInt rank; 5246de41b84cSMatthew G. Knepley PetscErrorCode ierr2; 5247de41b84cSMatthew G. Knepley 5248de41b84cSMatthew G. Knepley ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2); 5249de41b84cSMatthew G. Knepley ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2); 5250de41b84cSMatthew G. Knepley ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2); 5251de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2); 5252de41b84cSMatthew G. Knepley ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2); 5253de41b84cSMatthew G. Knepley CHKERRQ(ierr); 5254de41b84cSMatthew G. Knepley } 5255549a8adaSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr); 5256de41b84cSMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr); 5257de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr); 5258de41b84cSMatthew G. Knepley ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr); 5259de41b84cSMatthew G. Knepley PetscFunctionReturn(0); 5260de41b84cSMatthew G. Knepley } 5261de41b84cSMatthew G. Knepley 5262de41b84cSMatthew G. Knepley #undef __FUNCT__ 5263770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds" 5264f96281f8SMatthew G. Knepley /*@ 5265f96281f8SMatthew G. Knepley DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid 5266f96281f8SMatthew G. Knepley 5267f96281f8SMatthew G. Knepley Input Parameter: 5268f96281f8SMatthew G. Knepley . dm - The DMPlex object 5269f96281f8SMatthew G. Knepley 5270f96281f8SMatthew G. Knepley Output Parameters: 5271f96281f8SMatthew G. Knepley + cMax - The first hybrid cell 5272f96281f8SMatthew G. Knepley . cMax - The first hybrid face 5273f96281f8SMatthew G. Knepley . cMax - The first hybrid edge 5274f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex 5275f96281f8SMatthew G. Knepley 5276f96281f8SMatthew G. Knepley Level: developer 5277f96281f8SMatthew G. Knepley 5278f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh() 5279f96281f8SMatthew G. Knepley @*/ 5280770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax) 5281552f7358SJed Brown { 5282552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5283770b213bSMatthew G Knepley PetscInt dim; 5284770b213bSMatthew G Knepley PetscErrorCode ierr; 5285552f7358SJed Brown 5286552f7358SJed Brown PetscFunctionBegin; 5287552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5288770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5289770b213bSMatthew G Knepley if (cMax) *cMax = mesh->hybridPointMax[dim]; 5290770b213bSMatthew G Knepley if (fMax) *fMax = mesh->hybridPointMax[dim-1]; 5291770b213bSMatthew G Knepley if (eMax) *eMax = mesh->hybridPointMax[1]; 5292770b213bSMatthew G Knepley if (vMax) *vMax = mesh->hybridPointMax[0]; 5293552f7358SJed Brown PetscFunctionReturn(0); 5294552f7358SJed Brown } 5295552f7358SJed Brown 5296552f7358SJed Brown #undef __FUNCT__ 5297770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds" 5298770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax) 5299552f7358SJed Brown { 5300552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5301770b213bSMatthew G Knepley PetscInt dim; 5302770b213bSMatthew G Knepley PetscErrorCode ierr; 5303552f7358SJed Brown 5304552f7358SJed Brown PetscFunctionBegin; 5305552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5306770b213bSMatthew G Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5307770b213bSMatthew G Knepley if (cMax >= 0) mesh->hybridPointMax[dim] = cMax; 5308770b213bSMatthew G Knepley if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax; 5309770b213bSMatthew G Knepley if (eMax >= 0) mesh->hybridPointMax[1] = eMax; 5310770b213bSMatthew G Knepley if (vMax >= 0) mesh->hybridPointMax[0] = vMax; 5311552f7358SJed Brown PetscFunctionReturn(0); 5312552f7358SJed Brown } 5313552f7358SJed Brown 5314552f7358SJed Brown #undef __FUNCT__ 5315552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight" 5316552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight) 5317552f7358SJed Brown { 5318552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5319552f7358SJed Brown 5320552f7358SJed Brown PetscFunctionBegin; 5321552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5322552f7358SJed Brown PetscValidPointer(cellHeight, 2); 5323552f7358SJed Brown *cellHeight = mesh->vtkCellHeight; 5324552f7358SJed Brown PetscFunctionReturn(0); 5325552f7358SJed Brown } 5326552f7358SJed Brown 5327552f7358SJed Brown #undef __FUNCT__ 5328552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight" 5329552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight) 5330552f7358SJed Brown { 5331552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5332552f7358SJed Brown 5333552f7358SJed Brown PetscFunctionBegin; 5334552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5335552f7358SJed Brown mesh->vtkCellHeight = cellHeight; 5336552f7358SJed Brown PetscFunctionReturn(0); 5337552f7358SJed Brown } 5338552f7358SJed Brown 5339552f7358SJed Brown #undef __FUNCT__ 5340552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private" 5341552f7358SJed Brown /* We can easily have a form that takes an IS instead */ 5342552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering) 5343552f7358SJed Brown { 5344552f7358SJed Brown PetscSection section, globalSection; 5345552f7358SJed Brown PetscInt *numbers, p; 5346552f7358SJed Brown PetscErrorCode ierr; 5347552f7358SJed Brown 5348552f7358SJed Brown PetscFunctionBegin; 534982f516ccSBarry Smith ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), §ion);CHKERRQ(ierr); 5350552f7358SJed Brown ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr); 5351552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5352552f7358SJed Brown ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr); 5353552f7358SJed Brown } 5354552f7358SJed Brown ierr = PetscSectionSetUp(section);CHKERRQ(ierr); 5355552f7358SJed Brown ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr); 5356785e854fSJed Brown ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr); 5357552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5358552f7358SJed Brown ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr); 5359552f7358SJed Brown } 536082f516ccSBarry Smith ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr); 5361552f7358SJed Brown ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5362552f7358SJed Brown ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr); 5363552f7358SJed Brown PetscFunctionReturn(0); 5364552f7358SJed Brown } 5365552f7358SJed Brown 5366552f7358SJed Brown #undef __FUNCT__ 5367552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering" 5368552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers) 5369552f7358SJed Brown { 5370552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5371552f7358SJed Brown PetscInt cellHeight, cStart, cEnd, cMax; 5372552f7358SJed Brown PetscErrorCode ierr; 5373552f7358SJed Brown 5374552f7358SJed Brown PetscFunctionBegin; 5375552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5376552f7358SJed Brown if (!mesh->globalCellNumbers) { 5377552f7358SJed Brown ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr); 5378552f7358SJed Brown ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 53790298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 53800d644c17SKarl Rupp if (cMax >= 0) cEnd = PetscMin(cEnd, cMax); 5381552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr); 5382552f7358SJed Brown } 5383552f7358SJed Brown *globalCellNumbers = mesh->globalCellNumbers; 5384552f7358SJed Brown PetscFunctionReturn(0); 5385552f7358SJed Brown } 5386552f7358SJed Brown 5387552f7358SJed Brown #undef __FUNCT__ 5388552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering" 5389552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers) 5390552f7358SJed Brown { 5391552f7358SJed Brown DM_Plex *mesh = (DM_Plex*) dm->data; 5392552f7358SJed Brown PetscInt vStart, vEnd, vMax; 5393552f7358SJed Brown PetscErrorCode ierr; 5394552f7358SJed Brown 5395552f7358SJed Brown PetscFunctionBegin; 5396552f7358SJed Brown PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5397552f7358SJed Brown if (!mesh->globalVertexNumbers) { 5398552f7358SJed Brown ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 53990298fd71SBarry Smith ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr); 54000d644c17SKarl Rupp if (vMax >= 0) vEnd = PetscMin(vEnd, vMax); 5401552f7358SJed Brown ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr); 5402552f7358SJed Brown } 5403552f7358SJed Brown *globalVertexNumbers = mesh->globalVertexNumbers; 5404552f7358SJed Brown PetscFunctionReturn(0); 5405552f7358SJed Brown } 5406552f7358SJed Brown 5407552f7358SJed Brown 5408552f7358SJed Brown #undef __FUNCT__ 5409552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel" 5410552f7358SJed Brown /*@C 5411552f7358SJed Brown PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using 5412552f7358SJed Brown the local section and an SF describing the section point overlap. 5413552f7358SJed Brown 5414552f7358SJed Brown Input Parameters: 5415552f7358SJed Brown + s - The PetscSection for the local field layout 5416552f7358SJed Brown . sf - The SF describing parallel layout of the section points 5417552f7358SJed Brown . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs 5418552f7358SJed Brown . label - The label specifying the points 5419552f7358SJed Brown - labelValue - The label stratum specifying the points 5420552f7358SJed Brown 5421552f7358SJed Brown Output Parameter: 5422552f7358SJed Brown . gsection - The PetscSection for the global field layout 5423552f7358SJed Brown 5424552f7358SJed Brown Note: This gives negative sizes and offsets to points not owned by this process 5425552f7358SJed Brown 5426552f7358SJed Brown Level: developer 5427552f7358SJed Brown 5428552f7358SJed Brown .seealso: PetscSectionCreate() 5429552f7358SJed Brown @*/ 5430552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection) 5431552f7358SJed Brown { 54327ec39499SMatthew G. Knepley PetscInt *neg = NULL, *tmpOff = NULL; 5433552f7358SJed Brown PetscInt pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots; 5434552f7358SJed Brown PetscErrorCode ierr; 5435552f7358SJed Brown 5436552f7358SJed Brown PetscFunctionBegin; 5437552f7358SJed Brown ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr); 5438552f7358SJed Brown ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr); 5439552f7358SJed Brown ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr); 54407ec39499SMatthew G. Knepley ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr); 54417ec39499SMatthew G. Knepley if (nroots >= 0) { 54427ec39499SMatthew G. Knepley if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart); 54431795a4d1SJed Brown ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr); 54447ec39499SMatthew G. Knepley if (nroots > pEnd-pStart) { 54451795a4d1SJed Brown ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr); 54467ec39499SMatthew G. Knepley } else { 54477ec39499SMatthew G. Knepley tmpOff = &(*gsection)->atlasDof[-pStart]; 54487ec39499SMatthew G. Knepley } 54497ec39499SMatthew G. Knepley } 5450552f7358SJed Brown /* Mark ghost points with negative dof */ 5451552f7358SJed Brown for (p = pStart; p < pEnd; ++p) { 5452552f7358SJed Brown PetscInt value; 5453552f7358SJed Brown 5454552f7358SJed Brown ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr); 5455552f7358SJed Brown if (value != labelValue) continue; 5456552f7358SJed Brown ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr); 5457552f7358SJed Brown ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr); 5458552f7358SJed Brown ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr); 5459552f7358SJed Brown if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);} 54607ec39499SMatthew G. Knepley if (neg) neg[p] = -(dof+1); 5461552f7358SJed Brown } 5462552f7358SJed Brown ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr); 5463552f7358SJed Brown if (nroots >= 0) { 54647ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 54657ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5466552f7358SJed Brown if (nroots > pEnd-pStart) { 54677ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];} 5468552f7358SJed Brown } 5469552f7358SJed Brown } 5470552f7358SJed Brown /* Calculate new sizes, get proccess offset, and calculate point offsets */ 5471552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5472552f7358SJed Brown cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0; 5473552f7358SJed Brown (*gsection)->atlasOff[p] = off; 5474552f7358SJed Brown off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0; 5475552f7358SJed Brown } 5476552f7358SJed Brown ierr = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr); 5477552f7358SJed Brown globalOff -= off; 5478552f7358SJed Brown for (p = 0, off = 0; p < pEnd-pStart; ++p) { 5479552f7358SJed Brown (*gsection)->atlasOff[p] += globalOff; 54807ec39499SMatthew G. Knepley if (neg) neg[p] = -((*gsection)->atlasOff[p]+1); 5481552f7358SJed Brown } 5482552f7358SJed Brown /* Put in negative offsets for ghost points */ 5483552f7358SJed Brown if (nroots >= 0) { 54847ec39499SMatthew G. Knepley ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 54857ec39499SMatthew G. Knepley ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr); 5486552f7358SJed Brown if (nroots > pEnd-pStart) { 54877ec39499SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];} 5488552f7358SJed Brown } 5489552f7358SJed Brown } 54907ec39499SMatthew G. Knepley if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);} 5491552f7358SJed Brown ierr = PetscFree(neg);CHKERRQ(ierr); 5492552f7358SJed Brown PetscFunctionReturn(0); 5493552f7358SJed Brown } 5494ca8062c8SMatthew G. Knepley 5495ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5496ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry" 5497ca8062c8SMatthew G. Knepley /*@ 5498ca8062c8SMatthew G. Knepley DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric. 5499ca8062c8SMatthew G. Knepley 5500ca8062c8SMatthew G. Knepley Input Parameters: 5501ca8062c8SMatthew G. Knepley + dm - The DMPlex object 5502ca8062c8SMatthew G. Knepley 5503ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5504ca8062c8SMatthew G. Knepley 5505ca8062c8SMatthew G. Knepley Level: developer 5506ca8062c8SMatthew G. Knepley 55079bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces() 5508ca8062c8SMatthew G. Knepley @*/ 5509ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm) 5510ca8062c8SMatthew G. Knepley { 5511ca8062c8SMatthew G. Knepley PetscSection coneSection, supportSection; 5512ca8062c8SMatthew G. Knepley const PetscInt *cone, *support; 5513ca8062c8SMatthew G. Knepley PetscInt coneSize, c, supportSize, s; 5514ca8062c8SMatthew G. Knepley PetscInt pStart, pEnd, p, csize, ssize; 5515ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5516ca8062c8SMatthew G. Knepley 5517ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5518ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5519ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr); 5520ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr); 5521ca8062c8SMatthew G. Knepley /* Check that point p is found in the support of its cone points, and vice versa */ 5522ca8062c8SMatthew G. Knepley ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr); 5523ca8062c8SMatthew G. Knepley for (p = pStart; p < pEnd; ++p) { 5524ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr); 5525ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr); 5526ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 552742e66dfaSMatthew G. Knepley PetscBool dup = PETSC_FALSE; 552842e66dfaSMatthew G. Knepley PetscInt d; 552942e66dfaSMatthew G. Knepley for (d = c-1; d >= 0; --d) { 553042e66dfaSMatthew G. Knepley if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;} 553142e66dfaSMatthew G. Knepley } 5532ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr); 5533ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr); 5534ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5535ca8062c8SMatthew G. Knepley if (support[s] == p) break; 5536ca8062c8SMatthew G. Knepley } 553742e66dfaSMatthew G. Knepley if ((s >= supportSize) || (dup && (support[s+1] != p))) { 5538ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p); 5539ca8062c8SMatthew G. Knepley for (s = 0; s < coneSize; ++s) { 5540ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]); 5541ca8062c8SMatthew G. Knepley } 5542ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5543ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]); 5544ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5545ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]); 5546ca8062c8SMatthew G. Knepley } 5547ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 554842e66dfaSMatthew G. Knepley if (dup) { 554942e66dfaSMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]); 555042e66dfaSMatthew G. Knepley } else { 5551ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]); 5552ca8062c8SMatthew G. Knepley } 5553ca8062c8SMatthew G. Knepley } 555442e66dfaSMatthew G. Knepley } 5555ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr); 5556ca8062c8SMatthew G. Knepley ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr); 5557ca8062c8SMatthew G. Knepley for (s = 0; s < supportSize; ++s) { 5558ca8062c8SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr); 5559ca8062c8SMatthew G. Knepley ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr); 5560ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5561ca8062c8SMatthew G. Knepley if (cone[c] == p) break; 5562ca8062c8SMatthew G. Knepley } 5563ca8062c8SMatthew G. Knepley if (c >= coneSize) { 5564ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p); 5565ca8062c8SMatthew G. Knepley for (c = 0; c < supportSize; ++c) { 5566ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]); 5567ca8062c8SMatthew G. Knepley } 5568ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5569ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]); 5570ca8062c8SMatthew G. Knepley for (c = 0; c < coneSize; ++c) { 5571ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]); 5572ca8062c8SMatthew G. Knepley } 5573ca8062c8SMatthew G. Knepley ierr = PetscPrintf(PETSC_COMM_SELF, "\n"); 5574ca8062c8SMatthew G. Knepley SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]); 5575ca8062c8SMatthew G. Knepley } 5576ca8062c8SMatthew G. Knepley } 5577ca8062c8SMatthew G. Knepley } 5578ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr); 5579ca8062c8SMatthew G. Knepley ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr); 5580ca8062c8SMatthew G. Knepley if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize); 5581ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5582ca8062c8SMatthew G. Knepley } 5583ca8062c8SMatthew G. Knepley 5584ca8062c8SMatthew G. Knepley #undef __FUNCT__ 5585ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton" 5586ca8062c8SMatthew G. Knepley /*@ 5587ca8062c8SMatthew G. Knepley DMPlexCheckSkeleton - Check that each cell has the correct number of vertices 5588ca8062c8SMatthew G. Knepley 5589ca8062c8SMatthew G. Knepley Input Parameters: 5590ca8062c8SMatthew G. Knepley + dm - The DMPlex object 559158723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 559258723a97SMatthew G. Knepley - cellHeight - Normally 0 5593ca8062c8SMatthew G. Knepley 5594ca8062c8SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 5595ca8062c8SMatthew G. Knepley 5596ca8062c8SMatthew G. Knepley Level: developer 5597ca8062c8SMatthew G. Knepley 55989bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces() 5599ca8062c8SMatthew G. Knepley @*/ 560058723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight) 5601ca8062c8SMatthew G. Knepley { 560242363296SMatthew G. Knepley PetscInt dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c; 5603ca8062c8SMatthew G. Knepley PetscErrorCode ierr; 5604ca8062c8SMatthew G. Knepley 5605ca8062c8SMatthew G. Knepley PetscFunctionBegin; 5606ca8062c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 5607ca8062c8SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5608ca8062c8SMatthew G. Knepley switch (dim) { 560942363296SMatthew G. Knepley case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break; 561042363296SMatthew G. Knepley case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break; 561142363296SMatthew G. Knepley case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break; 5612ca8062c8SMatthew G. Knepley default: 5613ca8062c8SMatthew G. Knepley SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim); 5614ca8062c8SMatthew G. Knepley } 561558723a97SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 561658723a97SMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr); 5617ca8062c8SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr); 5618ca8062c8SMatthew G. Knepley cMax = cMax >= 0 ? cMax : cEnd; 5619ca8062c8SMatthew G. Knepley for (c = cStart; c < cMax; ++c) { 562058723a97SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 562158723a97SMatthew G. Knepley 562258723a97SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 562358723a97SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 562458723a97SMatthew G. Knepley const PetscInt p = closure[cl]; 562558723a97SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 562658723a97SMatthew G. Knepley } 562758723a97SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 5628ca8062c8SMatthew G. Knepley if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d vertices != %d", c, coneSize, numCorners); 5629ca8062c8SMatthew G. Knepley } 563042363296SMatthew G. Knepley for (c = cMax; c < cEnd; ++c) { 563142363296SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, coneSize = 0; 563242363296SMatthew G. Knepley 563342363296SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 563442363296SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 563542363296SMatthew G. Knepley const PetscInt p = closure[cl]; 563642363296SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) ++coneSize; 563742363296SMatthew G. Knepley } 563842363296SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 563942363296SMatthew G. Knepley if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has %d vertices > %d", c, coneSize, numHybridCorners); 564042363296SMatthew G. Knepley } 5641ca8062c8SMatthew G. Knepley PetscFunctionReturn(0); 5642ca8062c8SMatthew G. Knepley } 56439bf0dad6SMatthew G. Knepley 56449bf0dad6SMatthew G. Knepley #undef __FUNCT__ 56459bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces" 56469bf0dad6SMatthew G. Knepley /*@ 56479bf0dad6SMatthew 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 56489bf0dad6SMatthew G. Knepley 56499bf0dad6SMatthew G. Knepley Input Parameters: 56509bf0dad6SMatthew G. Knepley + dm - The DMPlex object 56519bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products 56529bf0dad6SMatthew G. Knepley - cellHeight - Normally 0 56539bf0dad6SMatthew G. Knepley 56549bf0dad6SMatthew G. Knepley Note: This is a useful diagnostic when creating meshes programmatically. 56559bf0dad6SMatthew G. Knepley 56569bf0dad6SMatthew G. Knepley Level: developer 56579bf0dad6SMatthew G. Knepley 56589bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton() 56599bf0dad6SMatthew G. Knepley @*/ 56609bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight) 56619bf0dad6SMatthew G. Knepley { 56623554e41dSMatthew G. Knepley PetscInt pMax[4]; 56633554e41dSMatthew G. Knepley PetscInt dim, vStart, vEnd, cStart, cEnd, c, h; 56649bf0dad6SMatthew G. Knepley PetscErrorCode ierr; 56659bf0dad6SMatthew G. Knepley 56669bf0dad6SMatthew G. Knepley PetscFunctionBegin; 56679bf0dad6SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 56689bf0dad6SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 56699bf0dad6SMatthew G. Knepley ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr); 567025abba81SMatthew G. Knepley ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr); 56713554e41dSMatthew G. Knepley for (h = cellHeight; h < dim; ++h) { 56723554e41dSMatthew G. Knepley ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr); 56733554e41dSMatthew G. Knepley for (c = cStart; c < cEnd; ++c) { 56749bf0dad6SMatthew G. Knepley const PetscInt *cone, *ornt, *faces; 56759bf0dad6SMatthew G. Knepley PetscInt numFaces, faceSize, coneSize,f; 56769bf0dad6SMatthew G. Knepley PetscInt *closure = NULL, closureSize, cl, numCorners = 0; 56779bf0dad6SMatthew G. Knepley 567825abba81SMatthew G. Knepley if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue; 56799bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr); 56809bf0dad6SMatthew G. Knepley ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr); 56819bf0dad6SMatthew G. Knepley ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr); 56829bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 56839bf0dad6SMatthew G. Knepley for (cl = 0; cl < closureSize*2; cl += 2) { 56849bf0dad6SMatthew G. Knepley const PetscInt p = closure[cl]; 56859bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p; 56869bf0dad6SMatthew G. Knepley } 56873554e41dSMatthew G. Knepley ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 56889bf0dad6SMatthew 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); 56899bf0dad6SMatthew G. Knepley for (f = 0; f < numFaces; ++f) { 56909bf0dad6SMatthew G. Knepley PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v; 56919bf0dad6SMatthew G. Knepley 56929bf0dad6SMatthew G. Knepley ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 56939bf0dad6SMatthew G. Knepley for (cl = 0; cl < fclosureSize*2; cl += 2) { 56949bf0dad6SMatthew G. Knepley const PetscInt p = fclosure[cl]; 56959bf0dad6SMatthew G. Knepley if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p; 56969bf0dad6SMatthew G. Knepley } 5697e003ed69SMatthew 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); 56989bf0dad6SMatthew G. Knepley for (v = 0; v < fnumCorners; ++v) { 5699e003ed69SMatthew 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]); 57009bf0dad6SMatthew G. Knepley } 57019bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr); 57029bf0dad6SMatthew G. Knepley } 57039bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr); 57049bf0dad6SMatthew G. Knepley ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr); 57059bf0dad6SMatthew G. Knepley } 57063554e41dSMatthew G. Knepley } 5707552f7358SJed Brown PetscFunctionReturn(0); 5708552f7358SJed Brown } 57093913d7c8SMatthew G. Knepley 57103913d7c8SMatthew G. Knepley #undef __FUNCT__ 5711bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex" 5712bceba477SMatthew G. Knepley /* Pointwise interpolation 5713bceba477SMatthew G. Knepley Just code FEM for now 5714bceba477SMatthew G. Knepley u^f = I u^c 57154ca5e9f5SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j 57164ca5e9f5SMatthew G. Knepley u^f_i = sum_j psi^f_i I phi^c_j u^c_j 57174ca5e9f5SMatthew G. Knepley I_{ij} = psi^f_i phi^c_j 5718bceba477SMatthew G. Knepley */ 5719bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling) 5720bceba477SMatthew G. Knepley { 5721bceba477SMatthew G. Knepley PetscSection gsc, gsf; 5722bceba477SMatthew G. Knepley PetscInt m, n; 5723a063dac3SMatthew G. Knepley void *ctx; 5724bceba477SMatthew G. Knepley PetscErrorCode ierr; 5725bceba477SMatthew G. Knepley 5726bceba477SMatthew G. Knepley PetscFunctionBegin; 5727bceba477SMatthew G. Knepley /* 5728bceba477SMatthew G. Knepley Loop over coarse cells 5729bceba477SMatthew G. Knepley Loop over coarse basis functions 5730bceba477SMatthew G. Knepley Loop over fine cells in coarse cell 5731bceba477SMatthew G. Knepley Loop over fine dual basis functions 5732bceba477SMatthew G. Knepley Evaluate coarse basis on fine dual basis quad points 5733bceba477SMatthew G. Knepley Sum 5734bceba477SMatthew G. Knepley Update local element matrix 5735bceba477SMatthew G. Knepley Accumulate to interpolation matrix 5736bceba477SMatthew G. Knepley 5737bceba477SMatthew G. Knepley Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop 5738bceba477SMatthew G. Knepley */ 5739bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 5740bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr); 5741bceba477SMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 5742bceba477SMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr); 5743bceba477SMatthew G. Knepley /* We need to preallocate properly */ 5744bceba477SMatthew G. Knepley ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr); 5745bceba477SMatthew G. Knepley ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 5746bceba477SMatthew G. Knepley ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr); 5747bceba477SMatthew G. Knepley ierr = MatSetUp(*interpolation);CHKERRQ(ierr); 5748bceba477SMatthew G. Knepley ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr); 5749bceba477SMatthew G. Knepley ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr); 5750a063dac3SMatthew G. Knepley ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr); 5751a063dac3SMatthew G. Knepley ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr); 57525d1c2e58SMatthew G. Knepley /* Use naive scaling */ 57535d1c2e58SMatthew G. Knepley ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr); 5754a063dac3SMatthew G. Knepley PetscFunctionReturn(0); 5755a063dac3SMatthew G. Knepley } 5756bceba477SMatthew G. Knepley 5757a063dac3SMatthew G. Knepley #undef __FUNCT__ 5758a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex" 5759a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx) 5760a063dac3SMatthew G. Knepley { 576190748bafSMatthew G. Knepley Vec cv, fv; 576290748bafSMatthew G. Knepley IS cis, fis, fpointIS; 576390748bafSMatthew G. Knepley PetscSection sc, gsc, gsf; 576490748bafSMatthew G. Knepley const PetscInt *fpoints; 576590748bafSMatthew G. Knepley PetscInt *cindices, *findices; 576690748bafSMatthew G. Knepley PetscInt cpStart, cpEnd, m, off, cp; 576790748bafSMatthew G. Knepley PetscErrorCode ierr; 576890748bafSMatthew G. Knepley 5769a063dac3SMatthew G. Knepley PetscFunctionBegin; 577090748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr); 577190748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr); 577290748bafSMatthew G. Knepley ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr); 577390748bafSMatthew G. Knepley ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr); 577490748bafSMatthew G. Knepley ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 577590748bafSMatthew G. Knepley ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr); 577690748bafSMatthew G. Knepley ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr); 577790748bafSMatthew G. Knepley ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr); 577890748bafSMatthew G. Knepley ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr); 577990748bafSMatthew G. Knepley ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr); 578090748bafSMatthew G. Knepley for (cp = cpStart, off = 0; cp < cpEnd; ++cp) { 578190748bafSMatthew G. Knepley const PetscInt *cdofsC = NULL; 578290748bafSMatthew G. Knepley PetscInt fp = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e; 578390748bafSMatthew G. Knepley 578490748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr); 578590748bafSMatthew G. Knepley if (dofC <= 0) continue; 578690748bafSMatthew G. Knepley ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr); 578790748bafSMatthew G. Knepley ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr); 578890748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr); 578990748bafSMatthew G. Knepley ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr); 579090748bafSMatthew G. Knepley if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);} 579190748bafSMatthew 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); 579290748bafSMatthew 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); 579390748bafSMatthew G. Knepley for (d = 0, e = 0; d < dofC; ++d) { 579490748bafSMatthew G. Knepley if (cdofsC && cdofsC[e] == d) {++e; continue;} 579590748bafSMatthew G. Knepley cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d; 579690748bafSMatthew G. Knepley } 579790748bafSMatthew 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); 579890748bafSMatthew G. Knepley off += dofC-cdofC; 579990748bafSMatthew G. Knepley } 580090748bafSMatthew G. Knepley ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr); 580190748bafSMatthew G. Knepley if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m); 580290748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr); 580390748bafSMatthew G. Knepley ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr); 580490748bafSMatthew G. Knepley ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr); 580590748bafSMatthew G. Knepley ierr = ISDestroy(&cis);CHKERRQ(ierr); 580690748bafSMatthew G. Knepley ierr = ISDestroy(&fis);CHKERRQ(ierr); 580790748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr); 580890748bafSMatthew G. Knepley ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr); 580990748bafSMatthew G. Knepley ierr = ISDestroy(&fpointIS);CHKERRQ(ierr); 5810bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5811bceba477SMatthew G. Knepley } 5812bceba477SMatthew G. Knepley 5813bceba477SMatthew G. Knepley #undef __FUNCT__ 5814fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex" 5815fd59a867SMatthew G. Knepley /* Pointwise interpolation 5816fd59a867SMatthew G. Knepley Just code FEM for now 5817fd59a867SMatthew G. Knepley u^f = I u^c 5818fd59a867SMatthew G. Knepley sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l 5819fd59a867SMatthew G. Knepley u^f_i = sum_l int psi^f_i I phi^c_l u^c_l 5820fd59a867SMatthew G. Knepley I_{ij} = int psi^f_i phi^c_j 5821fd59a867SMatthew G. Knepley */ 5822fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm) 5823fd59a867SMatthew G. Knepley { 5824fd59a867SMatthew G. Knepley PetscSection section; 5825fd59a867SMatthew G. Knepley IS *bcPoints; 5826286d8613SMatthew G. Knepley PetscInt *bcFields, *numComp, *numDof; 5827286d8613SMatthew G. Knepley PetscInt depth, dim, numBd, numBC = 0, numFields, bd, bc, f; 5828fd59a867SMatthew G. Knepley PetscErrorCode ierr; 5829fd59a867SMatthew G. Knepley 5830fd59a867SMatthew G. Knepley PetscFunctionBegin; 5831fd59a867SMatthew G. Knepley /* Handle boundary conditions */ 5832286d8613SMatthew G. Knepley ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr); 5833fd59a867SMatthew G. Knepley ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr); 5834fd59a867SMatthew G. Knepley ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr); 5835fd59a867SMatthew G. Knepley for (bd = 0; bd < numBd; ++bd) { 5836fd59a867SMatthew G. Knepley PetscBool isEssential; 5837fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr); 5838fd59a867SMatthew G. Knepley if (isEssential) ++numBC; 5839fd59a867SMatthew G. Knepley } 5840fd59a867SMatthew G. Knepley ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr); 5841fd59a867SMatthew G. Knepley for (bd = 0, bc = 0; bd < numBd; ++bd) { 5842fd59a867SMatthew G. Knepley const char *bdLabel; 5843fd59a867SMatthew G. Knepley DMLabel label; 5844fd59a867SMatthew G. Knepley const PetscInt *values; 5845fd59a867SMatthew G. Knepley PetscInt field, numValues; 5846fd59a867SMatthew G. Knepley PetscBool isEssential, has; 5847fd59a867SMatthew G. Knepley 5848fd59a867SMatthew G. Knepley ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr); 5849fd59a867SMatthew G. Knepley if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this"); 5850fd59a867SMatthew G. Knepley ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr); 5851fd59a867SMatthew G. Knepley if (!has) { 5852fd59a867SMatthew G. Knepley ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr); 5853fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5854fd59a867SMatthew G. Knepley ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr); 5855fd59a867SMatthew G. Knepley } 5856fd59a867SMatthew G. Knepley ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr); 5857fd59a867SMatthew G. Knepley ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr); 5858fd59a867SMatthew G. Knepley if (isEssential) { 5859fd59a867SMatthew G. Knepley bcFields[bc] = field; 5860fd59a867SMatthew G. Knepley ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &bcPoints[bc++]);CHKERRQ(ierr); 5861fd59a867SMatthew G. Knepley } 5862fd59a867SMatthew G. Knepley } 5863fd59a867SMatthew G. Knepley /* Handle discretization */ 5864fd59a867SMatthew G. Knepley ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr); 5865286d8613SMatthew G. Knepley ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr); 5866fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5867fd59a867SMatthew G. Knepley PetscFE fe; 5868286d8613SMatthew G. Knepley const PetscInt *numFieldDof; 5869fd59a867SMatthew G. Knepley PetscInt d; 5870fd59a867SMatthew G. Knepley 587118abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5872fd59a867SMatthew G. Knepley ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr); 5873286d8613SMatthew G. Knepley ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr); 5874286d8613SMatthew G. Knepley for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d]; 5875fd59a867SMatthew G. Knepley } 5876286d8613SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5877286d8613SMatthew G. Knepley PetscInt d; 5878286d8613SMatthew G. Knepley for (d = 1; d < dim; ++d) { 5879286d8613SMatthew 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."); 5880286d8613SMatthew G. Knepley } 5881286d8613SMatthew G. Knepley } 5882286d8613SMatthew G. Knepley ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, §ion);CHKERRQ(ierr); 5883fd59a867SMatthew G. Knepley for (f = 0; f < numFields; ++f) { 5884fd59a867SMatthew G. Knepley PetscFE fe; 5885fd59a867SMatthew G. Knepley const char *name; 588618abd763SMatthew G. Knepley 588718abd763SMatthew G. Knepley ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr); 5888fd59a867SMatthew G. Knepley ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr); 5889fd59a867SMatthew G. Knepley ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr); 5890fd59a867SMatthew G. Knepley } 5891fd59a867SMatthew G. Knepley ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr); 5892fd59a867SMatthew G. Knepley ierr = PetscSectionDestroy(§ion);CHKERRQ(ierr); 5893fd59a867SMatthew G. Knepley for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);} 5894fd59a867SMatthew G. Knepley ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr); 5895286d8613SMatthew G. Knepley ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr); 5896bceba477SMatthew G. Knepley PetscFunctionReturn(0); 5897bceba477SMatthew G. Knepley } 5898bceba477SMatthew G. Knepley 5899bceba477SMatthew G. Knepley #undef __FUNCT__ 59003913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM" 59013913d7c8SMatthew G. Knepley /*@ 59023913d7c8SMatthew G. Knepley DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement 59033913d7c8SMatthew G. Knepley 59043913d7c8SMatthew G. Knepley Input Parameter: 59053913d7c8SMatthew G. Knepley . dm - The DMPlex object 59063913d7c8SMatthew G. Knepley 59073913d7c8SMatthew G. Knepley Output Parameter: 59083913d7c8SMatthew G. Knepley . cdm - The coarse DM 59093913d7c8SMatthew G. Knepley 59103913d7c8SMatthew G. Knepley Level: intermediate 59113913d7c8SMatthew G. Knepley 59123913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM() 59133913d7c8SMatthew G. Knepley @*/ 59143913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm) 59153913d7c8SMatthew G. Knepley { 59163913d7c8SMatthew G. Knepley PetscFunctionBegin; 59173913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59183913d7c8SMatthew G. Knepley PetscValidPointer(cdm, 2); 59193913d7c8SMatthew G. Knepley *cdm = ((DM_Plex *) dm->data)->coarseMesh; 59203913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 59213913d7c8SMatthew G. Knepley } 59223913d7c8SMatthew G. Knepley 59233913d7c8SMatthew G. Knepley #undef __FUNCT__ 59243913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM" 59253913d7c8SMatthew G. Knepley /*@ 59263913d7c8SMatthew G. Knepley DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement 59273913d7c8SMatthew G. Knepley 59283913d7c8SMatthew G. Knepley Input Parameters: 59293913d7c8SMatthew G. Knepley + dm - The DMPlex object 59303913d7c8SMatthew G. Knepley - cdm - The coarse DM 59313913d7c8SMatthew G. Knepley 59323913d7c8SMatthew G. Knepley Level: intermediate 59333913d7c8SMatthew G. Knepley 59343913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM() 59353913d7c8SMatthew G. Knepley @*/ 59363913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm) 59373913d7c8SMatthew G. Knepley { 59383913d7c8SMatthew G. Knepley DM_Plex *mesh; 59393913d7c8SMatthew G. Knepley PetscErrorCode ierr; 59403913d7c8SMatthew G. Knepley 59413913d7c8SMatthew G. Knepley PetscFunctionBegin; 59423913d7c8SMatthew G. Knepley PetscValidHeaderSpecific(dm, DM_CLASSID, 1); 59433913d7c8SMatthew G. Knepley if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2); 59443913d7c8SMatthew G. Knepley mesh = (DM_Plex *) dm->data; 59453913d7c8SMatthew G. Knepley ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr); 59463913d7c8SMatthew G. Knepley mesh->coarseMesh = cdm; 59473913d7c8SMatthew G. Knepley ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr); 59483913d7c8SMatthew G. Knepley PetscFunctionReturn(0); 59493913d7c8SMatthew G. Knepley } 5950