xref: /petsc/src/dm/impls/plex/plex.c (revision 6dfbe1fc10d0e79b26ed0061760d4d2ab95808a3)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
2552f7358SJed Brown #include <../src/sys/utils/hash.h>
3d53a3d6fSBarry Smith #include <petsc-private/isimpl.h>
40c312b8eSJed Brown #include <petscsf.h>
5552f7358SJed Brown 
6552f7358SJed Brown /* Logging support */
7b96afcd5SMatthew G. Knepley PetscLogEvent DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_Stratify, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM;
8552f7358SJed Brown 
95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer);
105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer);
11552f7358SJed Brown 
12552f7358SJed Brown #undef __FUNCT__
13552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local"
14552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer)
15552f7358SJed Brown {
16552f7358SJed Brown   DM             dm;
17552f7358SJed Brown   PetscBool      isvtk;
18552f7358SJed Brown   PetscErrorCode ierr;
19552f7358SJed Brown 
20552f7358SJed Brown   PetscFunctionBegin;
21552f7358SJed Brown   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
2282f516ccSBarry Smith   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
23552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr);
24552f7358SJed Brown   if (isvtk) {
25552f7358SJed Brown     PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD;
26552f7358SJed Brown     PetscSection            section;
27552f7358SJed Brown     PetscInt                dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0;
28552f7358SJed Brown 
29552f7358SJed Brown     ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
30552f7358SJed Brown     ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
310298fd71SBarry Smith     ierr = DMPlexGetHeightStratum(dm, 0, &cStart, NULL);CHKERRQ(ierr);
320298fd71SBarry Smith     ierr = DMPlexGetHeightStratum(dm, 1, &fStart, NULL);CHKERRQ(ierr);
330298fd71SBarry Smith     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, NULL);CHKERRQ(ierr);
34552f7358SJed Brown     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
35552f7358SJed Brown     /* Assumes that numer of dofs per point of each stratum is constant, natural for VTK */
36552f7358SJed Brown     if ((cStart >= pStart) && (cStart < pEnd)) {ierr = PetscSectionGetDof(section, cStart, &cdof);CHKERRQ(ierr);}
37552f7358SJed Brown     if ((fStart >= pStart) && (fStart < pEnd)) {ierr = PetscSectionGetDof(section, fStart, &fdof);CHKERRQ(ierr);}
38552f7358SJed Brown     if ((vStart >= pStart) && (vStart < pEnd)) {ierr = PetscSectionGetDof(section, vStart, &vdof);CHKERRQ(ierr);}
39552f7358SJed Brown     if (cdof && fdof && vdof) { /* Actually Q2 or some such, but visualize as Q1 */
40552f7358SJed Brown       ft = (cdof == dim) ? PETSC_VTK_POINT_VECTOR_FIELD : PETSC_VTK_POINT_FIELD;
41552f7358SJed Brown     } else if (cdof && vdof) {
42ce94432eSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)viewer),PETSC_ERR_SUP,"No support for viewing mixed space with dofs at both vertices and cells");
43552f7358SJed Brown     } else if (cdof) {
44552f7358SJed Brown       /* TODO: This assumption should be removed when there is a way of identifying whether a space is conceptually a
45552f7358SJed Brown        * vector or just happens to have the same number of dofs as the dimension. */
46552f7358SJed Brown       if (cdof == dim) {
47552f7358SJed Brown         ft = PETSC_VTK_CELL_VECTOR_FIELD;
48552f7358SJed Brown       } else {
49552f7358SJed Brown         ft = PETSC_VTK_CELL_FIELD;
50552f7358SJed Brown       }
51552f7358SJed Brown     } else if (vdof) {
52552f7358SJed Brown       if (vdof == dim) {
53552f7358SJed Brown         ft = PETSC_VTK_POINT_VECTOR_FIELD;
54552f7358SJed Brown       } else {
55552f7358SJed Brown         ft = PETSC_VTK_POINT_FIELD;
56552f7358SJed Brown       }
5782f516ccSBarry Smith     } else SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Could not classify input Vec for VTK");
58552f7358SJed Brown 
59552f7358SJed Brown     ierr = PetscObjectReference((PetscObject) dm);CHKERRQ(ierr); /* viewer drops reference */
60552f7358SJed Brown     ierr = PetscObjectReference((PetscObject) v);CHKERRQ(ierr);  /* viewer drops reference */
61552f7358SJed Brown     ierr = PetscViewerVTKAddField(viewer, (PetscObject) dm, DMPlexVTKWriteAll, ft, (PetscObject) v);CHKERRQ(ierr);
62552f7358SJed Brown   } else {
63552f7358SJed Brown     PetscBool isseq;
64552f7358SJed Brown 
65552f7358SJed Brown     ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr);
66552f7358SJed Brown     if (isseq) {
67552f7358SJed Brown       ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);
68552f7358SJed Brown     } else {
69552f7358SJed Brown       ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);
70552f7358SJed Brown     }
71552f7358SJed Brown   }
72552f7358SJed Brown   PetscFunctionReturn(0);
73552f7358SJed Brown }
74552f7358SJed Brown 
75552f7358SJed Brown #undef __FUNCT__
76552f7358SJed Brown #define __FUNCT__ "VecView_Plex"
77552f7358SJed Brown PetscErrorCode VecView_Plex(Vec v, PetscViewer viewer)
78552f7358SJed Brown {
79552f7358SJed Brown   DM             dm;
80552f7358SJed Brown   PetscBool      isvtk;
81552f7358SJed Brown   PetscErrorCode ierr;
82552f7358SJed Brown 
83552f7358SJed Brown   PetscFunctionBegin;
84552f7358SJed Brown   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
8582f516ccSBarry Smith   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
86552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr);
87552f7358SJed Brown   if (isvtk) {
88552f7358SJed Brown     Vec         locv;
89552f7358SJed Brown     const char *name;
90552f7358SJed Brown 
91552f7358SJed Brown     ierr = DMGetLocalVector(dm, &locv);CHKERRQ(ierr);
92552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) v, &name);CHKERRQ(ierr);
93552f7358SJed Brown     ierr = PetscObjectSetName((PetscObject) locv, name);CHKERRQ(ierr);
94552f7358SJed Brown     ierr = DMGlobalToLocalBegin(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr);
95552f7358SJed Brown     ierr = DMGlobalToLocalEnd(dm, v, INSERT_VALUES, locv);CHKERRQ(ierr);
96552f7358SJed Brown     ierr = VecView_Plex_Local(locv, viewer);CHKERRQ(ierr);
97552f7358SJed Brown     ierr = DMRestoreLocalVector(dm, &locv);CHKERRQ(ierr);
98552f7358SJed Brown   } else {
99552f7358SJed Brown     PetscBool isseq;
100552f7358SJed Brown 
101552f7358SJed Brown     ierr = PetscObjectTypeCompare((PetscObject) v, VECSEQ, &isseq);CHKERRQ(ierr);
102552f7358SJed Brown     if (isseq) {
103552f7358SJed Brown       ierr = VecView_Seq(v, viewer);CHKERRQ(ierr);
104552f7358SJed Brown     } else {
105552f7358SJed Brown       ierr = VecView_MPI(v, viewer);CHKERRQ(ierr);
106552f7358SJed Brown     }
107552f7358SJed Brown   }
108552f7358SJed Brown   PetscFunctionReturn(0);
109552f7358SJed Brown }
110552f7358SJed Brown 
111552f7358SJed Brown #undef __FUNCT__
112552f7358SJed Brown #define __FUNCT__ "DMPlexView_Ascii"
113552f7358SJed Brown PetscErrorCode DMPlexView_Ascii(DM dm, PetscViewer viewer)
114552f7358SJed Brown {
115552f7358SJed Brown   DM_Plex          *mesh = (DM_Plex*) dm->data;
116552f7358SJed Brown   DM                cdm;
117552f7358SJed Brown   DMLabel           markers;
118552f7358SJed Brown   PetscSection      coordSection;
119552f7358SJed Brown   Vec               coordinates;
120552f7358SJed Brown   PetscViewerFormat format;
121552f7358SJed Brown   PetscErrorCode    ierr;
122552f7358SJed Brown 
123552f7358SJed Brown   PetscFunctionBegin;
124552f7358SJed Brown   ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr);
125552f7358SJed Brown   ierr = DMGetDefaultSection(cdm, &coordSection);CHKERRQ(ierr);
126552f7358SJed Brown   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
127552f7358SJed Brown   ierr = PetscViewerGetFormat(viewer, &format);CHKERRQ(ierr);
128552f7358SJed Brown   if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) {
129552f7358SJed Brown     const char *name;
130552f7358SJed Brown     PetscInt    maxConeSize, maxSupportSize;
131552f7358SJed Brown     PetscInt    pStart, pEnd, p;
132552f7358SJed Brown     PetscMPIInt rank, size;
133552f7358SJed Brown 
13482f516ccSBarry Smith     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
13582f516ccSBarry Smith     ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr);
136552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
137552f7358SJed Brown     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
138552f7358SJed Brown     ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
139552f7358SJed Brown     ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr);
140552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "Mesh '%s':\n", name);CHKERRQ(ierr);
141552f7358SJed Brown     ierr = PetscViewerASCIISynchronizedPrintf(viewer, "Max sizes cone: %D support: %D\n", maxConeSize, maxSupportSize);CHKERRQ(ierr);
142552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "orientation is missing\n", name);CHKERRQ(ierr);
143552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "cap --> base:\n", name);CHKERRQ(ierr);
144552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
145552f7358SJed Brown       PetscInt dof, off, s;
146552f7358SJed Brown 
147552f7358SJed Brown       ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
148552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
149552f7358SJed Brown       for (s = off; s < off+dof; ++s) {
150552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D ----> %D\n", rank, p, mesh->supports[s]);CHKERRQ(ierr);
151552f7358SJed Brown       }
152552f7358SJed Brown     }
153552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
154552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "base <-- cap:\n", name);CHKERRQ(ierr);
155552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
156552f7358SJed Brown       PetscInt dof, off, c;
157552f7358SJed Brown 
158552f7358SJed Brown       ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
159552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
160552f7358SJed Brown       for (c = off; c < off+dof; ++c) {
161552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "[%D]: %D <---- %D (%D)\n", rank, p, mesh->cones[c], mesh->coneOrientations[c]);CHKERRQ(ierr);
162552f7358SJed Brown       }
163552f7358SJed Brown     }
164552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
1650298fd71SBarry Smith     ierr = PetscSectionGetChart(coordSection, &pStart, NULL);CHKERRQ(ierr);
166552f7358SJed Brown     if (pStart >= 0) {ierr = PetscSectionVecView(coordSection, coordinates, viewer);CHKERRQ(ierr);}
167552f7358SJed Brown     ierr = DMPlexGetLabel(dm, "marker", &markers);CHKERRQ(ierr);
168552f7358SJed Brown     ierr = DMLabelView(markers,viewer);CHKERRQ(ierr);
169552f7358SJed Brown     if (size > 1) {
170552f7358SJed Brown       PetscSF sf;
171552f7358SJed Brown 
172552f7358SJed Brown       ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
173552f7358SJed Brown       ierr = PetscSFView(sf, viewer);CHKERRQ(ierr);
174552f7358SJed Brown     }
175552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
176552f7358SJed Brown   } else if (format == PETSC_VIEWER_ASCII_LATEX) {
177552f7358SJed Brown     const char  *name;
178552f7358SJed Brown     const char  *colors[3] = {"red", "blue", "green"};
179552f7358SJed Brown     const int    numColors  = 3;
180552f7358SJed Brown     PetscReal    scale      = 2.0;
181552f7358SJed Brown     PetscScalar *coords;
182552f7358SJed Brown     PetscInt     depth, cStart, cEnd, c, vStart, vEnd, v, eStart = 0, eEnd = 0, e, p;
183552f7358SJed Brown     PetscMPIInt  rank, size;
184552f7358SJed Brown 
185552f7358SJed Brown     ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
18682f516ccSBarry Smith     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
18782f516ccSBarry Smith     ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr);
188552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
189552f7358SJed Brown     ierr = PetscViewerASCIISynchronizedAllow(viewer, PETSC_TRUE);CHKERRQ(ierr);
190770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\
191770b213bSMatthew G Knepley \\documentclass[crop,multi=false]{standalone}\n\n\
192552f7358SJed Brown \\usepackage{tikz}\n\
193552f7358SJed Brown \\usepackage{pgflibraryshapes}\n\
194552f7358SJed Brown \\usetikzlibrary{backgrounds}\n\
195552f7358SJed Brown \\usetikzlibrary{arrows}\n\
196552f7358SJed Brown \\begin{document}\n\
197552f7358SJed Brown \\section{%s}\n\
198770b213bSMatthew G Knepley \\begin{center}\n", name, 8.0/scale);CHKERRQ(ierr);
199770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "Mesh for process ");CHKERRQ(ierr);
200770b213bSMatthew G Knepley     for (p = 0; p < size; ++p) {
201770b213bSMatthew G Knepley       if (p > 0 && p == size-1) {
202770b213bSMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, ", and ", colors[p%numColors], p);CHKERRQ(ierr);
203770b213bSMatthew G Knepley       } else if (p > 0) {
204770b213bSMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, ", ", colors[p%numColors], p);CHKERRQ(ierr);
205770b213bSMatthew G Knepley       }
206770b213bSMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, "{\\textcolor{%s}%D}", colors[p%numColors], p);CHKERRQ(ierr);
207770b213bSMatthew G Knepley     }
208770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, ".\n\n\n\
209770b213bSMatthew G Knepley \\begin{tikzpicture}[scale = %g,font=\\fontsize{8}{8}\\selectfont]\n");CHKERRQ(ierr);
210552f7358SJed Brown     /* Plot vertices */
211552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
212552f7358SJed Brown     ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
213552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr);
214552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
215552f7358SJed Brown       PetscInt off, dof, d;
216552f7358SJed Brown 
217552f7358SJed Brown       ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
218552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
219552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr);
220552f7358SJed Brown       for (d = 0; d < dof; ++d) {
221552f7358SJed Brown         if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);}
222552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%G", scale*PetscRealPart(coords[off+d]));CHKERRQ(ierr);
223552f7358SJed Brown       }
224552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr);
225552f7358SJed Brown     }
226552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
227552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
228552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr);
229552f7358SJed Brown     /* Plot edges */
230552f7358SJed Brown     ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
231552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr);
232552f7358SJed Brown     if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);}
233552f7358SJed Brown     for (e = eStart; e < eEnd; ++e) {
234552f7358SJed Brown       const PetscInt *cone;
235552f7358SJed Brown       PetscInt        coneSize, offA, offB, dof, d;
236552f7358SJed Brown 
237552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr);
23882f516ccSBarry Smith       if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize);
239552f7358SJed Brown       ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr);
240552f7358SJed Brown       ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr);
241552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr);
242552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr);
243552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr);
244552f7358SJed Brown       for (d = 0; d < dof; ++d) {
245552f7358SJed Brown         if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);}
246552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%G", scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d]));CHKERRQ(ierr);
247552f7358SJed Brown       }
248552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr);
249552f7358SJed Brown     }
250552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
251552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
252552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr);
253552f7358SJed Brown     /* Plot cells */
254552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
255552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
2560298fd71SBarry Smith       PetscInt *closure = NULL;
257552f7358SJed Brown       PetscInt  closureSize, firstPoint = -1;
258552f7358SJed Brown 
259552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
260552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr);
261552f7358SJed Brown       for (p = 0; p < closureSize*2; p += 2) {
262552f7358SJed Brown         const PetscInt point = closure[p];
263552f7358SJed Brown 
264552f7358SJed Brown         if ((point < vStart) || (point >= vEnd)) continue;
265552f7358SJed Brown         if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);}
266552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr);
267552f7358SJed Brown         if (firstPoint < 0) firstPoint = point;
268552f7358SJed Brown       }
269552f7358SJed Brown       /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */
270552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr);
271552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
272552f7358SJed Brown     }
273552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
274552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr);
275770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr);
276552f7358SJed Brown   } else {
27782f516ccSBarry Smith     MPI_Comm    comm;
278834065abSMatthew G. Knepley     PetscInt   *sizes, *hybsizes;
279834065abSMatthew G. Knepley     PetscInt    locDepth, depth, dim, d, pMax[4];
280552f7358SJed Brown     PetscInt    pStart, pEnd, p;
281a57dd577SMatthew G Knepley     PetscInt    numLabels, l;
2821143a3c0SMatthew G. Knepley     const char *name;
283552f7358SJed Brown     PetscMPIInt size;
284552f7358SJed Brown 
28582f516ccSBarry Smith     ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
286552f7358SJed Brown     ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr);
287552f7358SJed Brown     ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2885f64d76eSMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
2891143a3c0SMatthew G. Knepley     if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);}
2901143a3c0SMatthew G. Knepley     else      {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);}
291552f7358SJed Brown     ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr);
292552f7358SJed Brown     ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
293834065abSMatthew G. Knepley     ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr);
294834065abSMatthew G. Knepley     ierr = PetscMalloc2(size,PetscInt,&sizes,size,PetscInt,&hybsizes);CHKERRQ(ierr);
295552f7358SJed Brown     if (depth == 1) {
296552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr);
297552f7358SJed Brown       pEnd = pEnd - pStart;
298552f7358SJed Brown       ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
299552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", 0);CHKERRQ(ierr);
300552f7358SJed Brown       for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
301552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
302552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr);
303552f7358SJed Brown       pEnd = pEnd - pStart;
304552f7358SJed Brown       ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
305552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", dim);CHKERRQ(ierr);
306552f7358SJed Brown       for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
307552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
308552f7358SJed Brown     } else {
309552f7358SJed Brown       for (d = 0; d <= dim; d++) {
310552f7358SJed Brown         ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
311834065abSMatthew G. Knepley         pEnd    -= pStart;
312834065abSMatthew G. Knepley         pMax[d] -= pStart;
313552f7358SJed Brown         ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
314834065abSMatthew G. Knepley         ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
315552f7358SJed Brown         ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", d);CHKERRQ(ierr);
316834065abSMatthew G. Knepley         for (p = 0; p < size; ++p) {
317834065abSMatthew G. Knepley           if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);}
318834065abSMatthew G. Knepley           else                  {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
319834065abSMatthew G. Knepley         }
320552f7358SJed Brown         ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
321552f7358SJed Brown       }
322552f7358SJed Brown     }
323834065abSMatthew G. Knepley     ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr);
324a57dd577SMatthew G Knepley     ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
325a57dd577SMatthew G Knepley     if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);}
326a57dd577SMatthew G Knepley     for (l = 0; l < numLabels; ++l) {
327a57dd577SMatthew G Knepley       DMLabel         label;
328a57dd577SMatthew G Knepley       const char     *name;
329a57dd577SMatthew G Knepley       IS              valueIS;
330a57dd577SMatthew G Knepley       const PetscInt *values;
331a57dd577SMatthew G Knepley       PetscInt        numValues, v;
332a57dd577SMatthew G Knepley 
333a57dd577SMatthew G Knepley       ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr);
334a57dd577SMatthew G Knepley       ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
335a57dd577SMatthew G Knepley       ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
336a57dd577SMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, "  %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr);
337a57dd577SMatthew G Knepley       ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
338a57dd577SMatthew G Knepley       ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
339a57dd577SMatthew G Knepley       for (v = 0; v < numValues; ++v) {
340a57dd577SMatthew G Knepley         PetscInt size;
341a57dd577SMatthew G Knepley 
342a57dd577SMatthew G Knepley         ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr);
343a57dd577SMatthew G Knepley         if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);}
344a57dd577SMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr);
345a57dd577SMatthew G Knepley       }
346a57dd577SMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr);
347a57dd577SMatthew G Knepley       ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
3484d41221fSMatthew G Knepley       ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
349a57dd577SMatthew G Knepley     }
350552f7358SJed Brown   }
351552f7358SJed Brown   PetscFunctionReturn(0);
352552f7358SJed Brown }
353552f7358SJed Brown 
354552f7358SJed Brown #undef __FUNCT__
355552f7358SJed Brown #define __FUNCT__ "DMView_Plex"
356552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer)
357552f7358SJed Brown {
358552f7358SJed Brown   PetscBool      iascii, isbinary;
359552f7358SJed Brown   PetscErrorCode ierr;
360552f7358SJed Brown 
361552f7358SJed Brown   PetscFunctionBegin;
362552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
363552f7358SJed Brown   PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2);
364552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr);
365552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr);
366552f7358SJed Brown   if (iascii) {
367552f7358SJed Brown     ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr);
368552f7358SJed Brown #if 0
369552f7358SJed Brown   } else if (isbinary) {
370552f7358SJed Brown     ierr = DMPlexView_Binary(dm, viewer);CHKERRQ(ierr);
371552f7358SJed Brown #endif
37211aeaf0aSBarry Smith   }
373552f7358SJed Brown   PetscFunctionReturn(0);
374552f7358SJed Brown }
375552f7358SJed Brown 
376552f7358SJed Brown #undef __FUNCT__
377552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex"
378552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm)
379552f7358SJed Brown {
380552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
381552f7358SJed Brown   DMLabel        next  = mesh->labels;
382552f7358SJed Brown   PetscErrorCode ierr;
383552f7358SJed Brown 
384552f7358SJed Brown   PetscFunctionBegin;
3850d644c17SKarl Rupp   if (--mesh->refct > 0) PetscFunctionReturn(0);
386552f7358SJed Brown   ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr);
387552f7358SJed Brown   ierr = PetscFree(mesh->cones);CHKERRQ(ierr);
388552f7358SJed Brown   ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr);
389552f7358SJed Brown   ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr);
390552f7358SJed Brown   ierr = PetscFree(mesh->supports);CHKERRQ(ierr);
391552f7358SJed Brown   ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr);
392552f7358SJed Brown   while (next) {
393552f7358SJed Brown     DMLabel tmp = next->next;
394552f7358SJed Brown 
395552f7358SJed Brown     ierr = DMLabelDestroy(&next);CHKERRQ(ierr);
396552f7358SJed Brown     next = tmp;
397552f7358SJed Brown   }
398a89082eeSMatthew G Knepley   ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr);
399552f7358SJed Brown   ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr);
400552f7358SJed Brown   ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr);
401552f7358SJed Brown   /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */
402552f7358SJed Brown   ierr = PetscFree(mesh);CHKERRQ(ierr);
403552f7358SJed Brown   PetscFunctionReturn(0);
404552f7358SJed Brown }
405552f7358SJed Brown 
406552f7358SJed Brown #undef __FUNCT__
407552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex"
408b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J)
409552f7358SJed Brown {
410552f7358SJed Brown   PetscSection   section, sectionGlobal;
411552f7358SJed Brown   PetscInt       bs = -1;
412552f7358SJed Brown   PetscInt       localSize;
41389545effSMatthew G. Knepley   PetscBool      isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock;
414552f7358SJed Brown   PetscErrorCode ierr;
415b412c318SBarry Smith   MatType        mtype;
416552f7358SJed Brown 
417552f7358SJed Brown   PetscFunctionBegin;
418607a6623SBarry Smith   ierr = MatInitializePackage();CHKERRQ(ierr);
419b412c318SBarry Smith   mtype = dm->mattype;
420552f7358SJed Brown   ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
421552f7358SJed Brown   ierr = DMGetDefaultGlobalSection(dm, &sectionGlobal);CHKERRQ(ierr);
422552f7358SJed Brown   /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */
423552f7358SJed Brown   ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr);
42482f516ccSBarry Smith   ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr);
425552f7358SJed Brown   ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
426552f7358SJed Brown   ierr = MatSetType(*J, mtype);CHKERRQ(ierr);
427552f7358SJed Brown   ierr = MatSetFromOptions(*J);CHKERRQ(ierr);
428552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr);
429552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr);
430552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr);
431552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr);
432552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr);
433552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr);
434552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr);
435552f7358SJed Brown   if (!isShell) {
436552f7358SJed Brown     PetscBool fillMatrix = (PetscBool) !dm->prealloc_only;
4372a28c762SMatthew G Knepley     PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin;
438552f7358SJed Brown 
439552f7358SJed Brown     if (bs < 0) {
440552f7358SJed Brown       if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) {
441fad22124SMatthew G Knepley         PetscInt pStart, pEnd, p, dof, cdof;
442552f7358SJed Brown 
443552f7358SJed Brown         ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr);
444552f7358SJed Brown         for (p = pStart; p < pEnd; ++p) {
445552f7358SJed Brown           ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr);
446fad22124SMatthew G Knepley           ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr);
447fad22124SMatthew G Knepley           if (dof-cdof) {
4482a28c762SMatthew G Knepley             if (bs < 0) {
449fad22124SMatthew G Knepley               bs = dof-cdof;
450fad22124SMatthew G Knepley             } else if (bs != dof-cdof) {
4512a28c762SMatthew G Knepley               /* Layout does not admit a pointwise block size */
4522a28c762SMatthew G Knepley               bs = 1;
453552f7358SJed Brown               break;
454552f7358SJed Brown             }
455552f7358SJed Brown           }
4562a28c762SMatthew G Knepley         }
4572a28c762SMatthew G Knepley         /* Must have same blocksize on all procs (some might have no points) */
4582a28c762SMatthew G Knepley         bsLocal = bs;
45982f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
4602a28c762SMatthew G Knepley         bsLocal = bs < 0 ? bsMax : bs;
46182f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
4622a28c762SMatthew G Knepley         if (bsMin != bsMax) {
4632a28c762SMatthew G Knepley           bs = 1;
4642a28c762SMatthew G Knepley         } else {
4652a28c762SMatthew G Knepley           bs = bsMax;
4662a28c762SMatthew G Knepley         }
467552f7358SJed Brown       } else {
468552f7358SJed Brown         bs = 1;
469552f7358SJed Brown       }
470552f7358SJed Brown     }
471552f7358SJed Brown     ierr = PetscMalloc4(localSize/bs, PetscInt, &dnz, localSize/bs, PetscInt, &onz, localSize/bs, PetscInt, &dnzu, localSize/bs, PetscInt, &onzu);CHKERRQ(ierr);
472552f7358SJed Brown     ierr = PetscMemzero(dnz,  localSize/bs * sizeof(PetscInt));CHKERRQ(ierr);
473552f7358SJed Brown     ierr = PetscMemzero(onz,  localSize/bs * sizeof(PetscInt));CHKERRQ(ierr);
474552f7358SJed Brown     ierr = PetscMemzero(dnzu, localSize/bs * sizeof(PetscInt));CHKERRQ(ierr);
475552f7358SJed Brown     ierr = PetscMemzero(onzu, localSize/bs * sizeof(PetscInt));CHKERRQ(ierr);
476552f7358SJed Brown     ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr);
477552f7358SJed Brown     ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr);
478552f7358SJed Brown   }
479552f7358SJed Brown   PetscFunctionReturn(0);
480552f7358SJed Brown }
481552f7358SJed Brown 
482552f7358SJed Brown #undef __FUNCT__
483552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension"
484552f7358SJed Brown /*@
485552f7358SJed Brown   DMPlexGetDimension - Return the topological mesh dimension
486552f7358SJed Brown 
487552f7358SJed Brown   Not collective
488552f7358SJed Brown 
489552f7358SJed Brown   Input Parameter:
490552f7358SJed Brown . mesh - The DMPlex
491552f7358SJed Brown 
492552f7358SJed Brown   Output Parameter:
493552f7358SJed Brown . dim - The topological mesh dimension
494552f7358SJed Brown 
495552f7358SJed Brown   Level: beginner
496552f7358SJed Brown 
497552f7358SJed Brown .seealso: DMPlexCreate()
498552f7358SJed Brown @*/
499552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim)
500552f7358SJed Brown {
501552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
502552f7358SJed Brown 
503552f7358SJed Brown   PetscFunctionBegin;
504552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
505552f7358SJed Brown   PetscValidPointer(dim, 2);
506552f7358SJed Brown   *dim = mesh->dim;
507552f7358SJed Brown   PetscFunctionReturn(0);
508552f7358SJed Brown }
509552f7358SJed Brown 
510552f7358SJed Brown #undef __FUNCT__
511552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension"
512552f7358SJed Brown /*@
513552f7358SJed Brown   DMPlexSetDimension - Set the topological mesh dimension
514552f7358SJed Brown 
515552f7358SJed Brown   Collective on mesh
516552f7358SJed Brown 
517552f7358SJed Brown   Input Parameters:
518552f7358SJed Brown + mesh - The DMPlex
519552f7358SJed Brown - dim - The topological mesh dimension
520552f7358SJed Brown 
521552f7358SJed Brown   Level: beginner
522552f7358SJed Brown 
523552f7358SJed Brown .seealso: DMPlexCreate()
524552f7358SJed Brown @*/
525552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim)
526552f7358SJed Brown {
527552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
528552f7358SJed Brown 
529552f7358SJed Brown   PetscFunctionBegin;
530552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
531552f7358SJed Brown   PetscValidLogicalCollectiveInt(dm, dim, 2);
532552f7358SJed Brown   mesh->dim               = dim;
533552f7358SJed Brown   mesh->preallocCenterDim = dim;
534552f7358SJed Brown   PetscFunctionReturn(0);
535552f7358SJed Brown }
536552f7358SJed Brown 
537552f7358SJed Brown #undef __FUNCT__
538552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart"
539552f7358SJed Brown /*@
540552f7358SJed Brown   DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd)
541552f7358SJed Brown 
542552f7358SJed Brown   Not collective
543552f7358SJed Brown 
544552f7358SJed Brown   Input Parameter:
545552f7358SJed Brown . mesh - The DMPlex
546552f7358SJed Brown 
547552f7358SJed Brown   Output Parameters:
548552f7358SJed Brown + pStart - The first mesh point
549552f7358SJed Brown - pEnd   - The upper bound for mesh points
550552f7358SJed Brown 
551552f7358SJed Brown   Level: beginner
552552f7358SJed Brown 
553552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart()
554552f7358SJed Brown @*/
555552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd)
556552f7358SJed Brown {
557552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
558552f7358SJed Brown   PetscErrorCode ierr;
559552f7358SJed Brown 
560552f7358SJed Brown   PetscFunctionBegin;
561552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
562552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
563552f7358SJed Brown   PetscFunctionReturn(0);
564552f7358SJed Brown }
565552f7358SJed Brown 
566552f7358SJed Brown #undef __FUNCT__
567552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart"
568552f7358SJed Brown /*@
569552f7358SJed Brown   DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd)
570552f7358SJed Brown 
571552f7358SJed Brown   Not collective
572552f7358SJed Brown 
573552f7358SJed Brown   Input Parameters:
574552f7358SJed Brown + mesh - The DMPlex
575552f7358SJed Brown . pStart - The first mesh point
576552f7358SJed Brown - pEnd   - The upper bound for mesh points
577552f7358SJed Brown 
578552f7358SJed Brown   Output Parameters:
579552f7358SJed Brown 
580552f7358SJed Brown   Level: beginner
581552f7358SJed Brown 
582552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart()
583552f7358SJed Brown @*/
584552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd)
585552f7358SJed Brown {
586552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
587552f7358SJed Brown   PetscErrorCode ierr;
588552f7358SJed Brown 
589552f7358SJed Brown   PetscFunctionBegin;
590552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
591552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
592552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr);
593552f7358SJed Brown   PetscFunctionReturn(0);
594552f7358SJed Brown }
595552f7358SJed Brown 
596552f7358SJed Brown #undef __FUNCT__
597552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize"
598552f7358SJed Brown /*@
599552f7358SJed Brown   DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG
600552f7358SJed Brown 
601552f7358SJed Brown   Not collective
602552f7358SJed Brown 
603552f7358SJed Brown   Input Parameters:
604552f7358SJed Brown + mesh - The DMPlex
605552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
606552f7358SJed Brown 
607552f7358SJed Brown   Output Parameter:
608552f7358SJed Brown . size - The cone size for point p
609552f7358SJed Brown 
610552f7358SJed Brown   Level: beginner
611552f7358SJed Brown 
612552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
613552f7358SJed Brown @*/
614552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size)
615552f7358SJed Brown {
616552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
617552f7358SJed Brown   PetscErrorCode ierr;
618552f7358SJed Brown 
619552f7358SJed Brown   PetscFunctionBegin;
620552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
621552f7358SJed Brown   PetscValidPointer(size, 3);
622552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
623552f7358SJed Brown   PetscFunctionReturn(0);
624552f7358SJed Brown }
625552f7358SJed Brown 
626552f7358SJed Brown #undef __FUNCT__
627552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize"
628552f7358SJed Brown /*@
629552f7358SJed Brown   DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG
630552f7358SJed Brown 
631552f7358SJed Brown   Not collective
632552f7358SJed Brown 
633552f7358SJed Brown   Input Parameters:
634552f7358SJed Brown + mesh - The DMPlex
635552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
636552f7358SJed Brown - size - The cone size for point p
637552f7358SJed Brown 
638552f7358SJed Brown   Output Parameter:
639552f7358SJed Brown 
640552f7358SJed Brown   Note:
641552f7358SJed Brown   This should be called after DMPlexSetChart().
642552f7358SJed Brown 
643552f7358SJed Brown   Level: beginner
644552f7358SJed Brown 
645552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart()
646552f7358SJed Brown @*/
647552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size)
648552f7358SJed Brown {
649552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
650552f7358SJed Brown   PetscErrorCode ierr;
651552f7358SJed Brown 
652552f7358SJed Brown   PetscFunctionBegin;
653552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
654552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
6550d644c17SKarl Rupp 
656552f7358SJed Brown   mesh->maxConeSize = PetscMax(mesh->maxConeSize, size);
657552f7358SJed Brown   PetscFunctionReturn(0);
658552f7358SJed Brown }
659552f7358SJed Brown 
660552f7358SJed Brown #undef __FUNCT__
661552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone"
662552f7358SJed Brown /*@C
663552f7358SJed Brown   DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG
664552f7358SJed Brown 
665552f7358SJed Brown   Not collective
666552f7358SJed Brown 
667552f7358SJed Brown   Input Parameters:
668552f7358SJed Brown + mesh - The DMPlex
669552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
670552f7358SJed Brown 
671552f7358SJed Brown   Output Parameter:
672552f7358SJed Brown . cone - An array of points which are on the in-edges for point p
673552f7358SJed Brown 
674552f7358SJed Brown   Level: beginner
675552f7358SJed Brown 
6763813dfbdSMatthew G Knepley   Fortran Notes:
6773813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
6783813dfbdSMatthew G Knepley   include petsc.h90 in your code.
6793813dfbdSMatthew G Knepley 
6803813dfbdSMatthew G Knepley   You must also call DMPlexRestoreCone() after you finish using the returned array.
681552f7358SJed Brown 
682552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart()
683552f7358SJed Brown @*/
684552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[])
685552f7358SJed Brown {
686552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
687552f7358SJed Brown   PetscInt       off;
688552f7358SJed Brown   PetscErrorCode ierr;
689552f7358SJed Brown 
690552f7358SJed Brown   PetscFunctionBegin;
691552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
692552f7358SJed Brown   PetscValidPointer(cone, 3);
693552f7358SJed Brown   ierr  = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
694552f7358SJed Brown   *cone = &mesh->cones[off];
695552f7358SJed Brown   PetscFunctionReturn(0);
696552f7358SJed Brown }
697552f7358SJed Brown 
698552f7358SJed Brown #undef __FUNCT__
699552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone"
700552f7358SJed Brown /*@
701552f7358SJed Brown   DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG
702552f7358SJed Brown 
703552f7358SJed Brown   Not collective
704552f7358SJed Brown 
705552f7358SJed Brown   Input Parameters:
706552f7358SJed Brown + mesh - The DMPlex
707552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
708552f7358SJed Brown - cone - An array of points which are on the in-edges for point p
709552f7358SJed Brown 
710552f7358SJed Brown   Output Parameter:
711552f7358SJed Brown 
712552f7358SJed Brown   Note:
713552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
714552f7358SJed Brown 
715552f7358SJed Brown   Level: beginner
716552f7358SJed Brown 
717552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
718552f7358SJed Brown @*/
719552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[])
720552f7358SJed Brown {
721552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
722552f7358SJed Brown   PetscInt       pStart, pEnd;
723552f7358SJed Brown   PetscInt       dof, off, c;
724552f7358SJed Brown   PetscErrorCode ierr;
725552f7358SJed Brown 
726552f7358SJed Brown   PetscFunctionBegin;
727552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
728552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
729552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
730552f7358SJed Brown   if (dof) PetscValidPointer(cone, 3);
731552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
73282f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
733552f7358SJed Brown   for (c = 0; c < dof; ++c) {
73482f516ccSBarry Smith     if ((cone[c] < pStart) || (cone[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", cone[c], pStart, pEnd);
735552f7358SJed Brown     mesh->cones[off+c] = cone[c];
736552f7358SJed Brown   }
737552f7358SJed Brown   PetscFunctionReturn(0);
738552f7358SJed Brown }
739552f7358SJed Brown 
740552f7358SJed Brown #undef __FUNCT__
741552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation"
742552f7358SJed Brown /*@C
743552f7358SJed Brown   DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG
744552f7358SJed Brown 
745552f7358SJed Brown   Not collective
746552f7358SJed Brown 
747552f7358SJed Brown   Input Parameters:
748552f7358SJed Brown + mesh - The DMPlex
749552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
750552f7358SJed Brown 
751552f7358SJed Brown   Output Parameter:
752552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
753552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
754552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
755552f7358SJed Brown                     the index of the cone point on which to start.
756552f7358SJed Brown 
757552f7358SJed Brown   Level: beginner
758552f7358SJed Brown 
7593813dfbdSMatthew G Knepley   Fortran Notes:
7603813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
7613813dfbdSMatthew G Knepley   include petsc.h90 in your code.
7623813dfbdSMatthew G Knepley 
7633813dfbdSMatthew G Knepley   You must also call DMPlexRestoreConeOrientation() after you finish using the returned array.
764552f7358SJed Brown 
765552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart()
766552f7358SJed Brown @*/
767552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[])
768552f7358SJed Brown {
769552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
770552f7358SJed Brown   PetscInt       off;
771552f7358SJed Brown   PetscErrorCode ierr;
772552f7358SJed Brown 
773552f7358SJed Brown   PetscFunctionBegin;
774552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
775552f7358SJed Brown #if defined(PETSC_USE_DEBUG)
776552f7358SJed Brown   {
777552f7358SJed Brown     PetscInt dof;
778552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
779552f7358SJed Brown     if (dof) PetscValidPointer(coneOrientation, 3);
780552f7358SJed Brown   }
781552f7358SJed Brown #endif
782552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
7830d644c17SKarl Rupp 
784552f7358SJed Brown   *coneOrientation = &mesh->coneOrientations[off];
785552f7358SJed Brown   PetscFunctionReturn(0);
786552f7358SJed Brown }
787552f7358SJed Brown 
788552f7358SJed Brown #undef __FUNCT__
789552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation"
790552f7358SJed Brown /*@
791552f7358SJed Brown   DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG
792552f7358SJed Brown 
793552f7358SJed Brown   Not collective
794552f7358SJed Brown 
795552f7358SJed Brown   Input Parameters:
796552f7358SJed Brown + mesh - The DMPlex
797552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
798552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
799552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
800552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
801552f7358SJed Brown                     the index of the cone point on which to start.
802552f7358SJed Brown 
803552f7358SJed Brown   Output Parameter:
804552f7358SJed Brown 
805552f7358SJed Brown   Note:
806552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
807552f7358SJed Brown 
808552f7358SJed Brown   Level: beginner
809552f7358SJed Brown 
810552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
811552f7358SJed Brown @*/
812552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[])
813552f7358SJed Brown {
814552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
815552f7358SJed Brown   PetscInt       pStart, pEnd;
816552f7358SJed Brown   PetscInt       dof, off, c;
817552f7358SJed Brown   PetscErrorCode ierr;
818552f7358SJed Brown 
819552f7358SJed Brown   PetscFunctionBegin;
820552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
821552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
822552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
823552f7358SJed Brown   if (dof) PetscValidPointer(coneOrientation, 3);
824552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
82582f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
826552f7358SJed Brown   for (c = 0; c < dof; ++c) {
827552f7358SJed Brown     PetscInt cdof, o = coneOrientation[c];
828552f7358SJed Brown 
829552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr);
83082f516ccSBarry Smith     if (o && ((o < -(cdof+1)) || (o >= cdof))) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone orientation %D is not in the valid range [%D. %D)", o, -(cdof+1), cdof);
831552f7358SJed Brown     mesh->coneOrientations[off+c] = o;
832552f7358SJed Brown   }
833552f7358SJed Brown   PetscFunctionReturn(0);
834552f7358SJed Brown }
835552f7358SJed Brown 
836552f7358SJed Brown #undef __FUNCT__
837552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone"
838552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint)
839552f7358SJed Brown {
840552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
841552f7358SJed Brown   PetscInt       pStart, pEnd;
842552f7358SJed Brown   PetscInt       dof, off;
843552f7358SJed Brown   PetscErrorCode ierr;
844552f7358SJed Brown 
845552f7358SJed Brown   PetscFunctionBegin;
846552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
847552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
84882f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
84982f516ccSBarry Smith   if ((conePoint < pStart) || (conePoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone point %D is not in the valid range [%D, %D)", conePoint, pStart, pEnd);
85077c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
85177c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
85277c88f5bSMatthew G Knepley   if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof);
853552f7358SJed Brown   mesh->cones[off+conePos] = conePoint;
854552f7358SJed Brown   PetscFunctionReturn(0);
855552f7358SJed Brown }
856552f7358SJed Brown 
857552f7358SJed Brown #undef __FUNCT__
85877c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation"
85977c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation)
86077c88f5bSMatthew G Knepley {
86177c88f5bSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
86277c88f5bSMatthew G Knepley   PetscInt       pStart, pEnd;
86377c88f5bSMatthew G Knepley   PetscInt       dof, off;
86477c88f5bSMatthew G Knepley   PetscErrorCode ierr;
86577c88f5bSMatthew G Knepley 
86677c88f5bSMatthew G Knepley   PetscFunctionBegin;
86777c88f5bSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
86877c88f5bSMatthew G Knepley   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
86977c88f5bSMatthew G Knepley   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
87077c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
87177c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
87277c88f5bSMatthew G Knepley   if ((conePos < 0) || (conePos >= dof)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cone position %D of point %D is not in the valid range [0, %D)", conePos, p, dof);
87377c88f5bSMatthew G Knepley   mesh->coneOrientations[off+conePos] = coneOrientation;
87477c88f5bSMatthew G Knepley   PetscFunctionReturn(0);
87577c88f5bSMatthew G Knepley }
87677c88f5bSMatthew G Knepley 
87777c88f5bSMatthew G Knepley #undef __FUNCT__
878552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize"
879552f7358SJed Brown /*@
880552f7358SJed Brown   DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG
881552f7358SJed Brown 
882552f7358SJed Brown   Not collective
883552f7358SJed Brown 
884552f7358SJed Brown   Input Parameters:
885552f7358SJed Brown + mesh - The DMPlex
886552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
887552f7358SJed Brown 
888552f7358SJed Brown   Output Parameter:
889552f7358SJed Brown . size - The support size for point p
890552f7358SJed Brown 
891552f7358SJed Brown   Level: beginner
892552f7358SJed Brown 
893552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize()
894552f7358SJed Brown @*/
895552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size)
896552f7358SJed Brown {
897552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
898552f7358SJed Brown   PetscErrorCode ierr;
899552f7358SJed Brown 
900552f7358SJed Brown   PetscFunctionBegin;
901552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
902552f7358SJed Brown   PetscValidPointer(size, 3);
903552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
904552f7358SJed Brown   PetscFunctionReturn(0);
905552f7358SJed Brown }
906552f7358SJed Brown 
907552f7358SJed Brown #undef __FUNCT__
908552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize"
909552f7358SJed Brown /*@
910552f7358SJed Brown   DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG
911552f7358SJed Brown 
912552f7358SJed Brown   Not collective
913552f7358SJed Brown 
914552f7358SJed Brown   Input Parameters:
915552f7358SJed Brown + mesh - The DMPlex
916552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
917552f7358SJed Brown - size - The support size for point p
918552f7358SJed Brown 
919552f7358SJed Brown   Output Parameter:
920552f7358SJed Brown 
921552f7358SJed Brown   Note:
922552f7358SJed Brown   This should be called after DMPlexSetChart().
923552f7358SJed Brown 
924552f7358SJed Brown   Level: beginner
925552f7358SJed Brown 
926552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart()
927552f7358SJed Brown @*/
928552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size)
929552f7358SJed Brown {
930552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
931552f7358SJed Brown   PetscErrorCode ierr;
932552f7358SJed Brown 
933552f7358SJed Brown   PetscFunctionBegin;
934552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
935552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
9360d644c17SKarl Rupp 
937552f7358SJed Brown   mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size);
938552f7358SJed Brown   PetscFunctionReturn(0);
939552f7358SJed Brown }
940552f7358SJed Brown 
941552f7358SJed Brown #undef __FUNCT__
942552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport"
943552f7358SJed Brown /*@C
944552f7358SJed Brown   DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG
945552f7358SJed Brown 
946552f7358SJed Brown   Not collective
947552f7358SJed Brown 
948552f7358SJed Brown   Input Parameters:
949552f7358SJed Brown + mesh - The DMPlex
950552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
951552f7358SJed Brown 
952552f7358SJed Brown   Output Parameter:
953552f7358SJed Brown . support - An array of points which are on the out-edges for point p
954552f7358SJed Brown 
955552f7358SJed Brown   Level: beginner
956552f7358SJed Brown 
9573813dfbdSMatthew G Knepley   Fortran Notes:
9583813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
9593813dfbdSMatthew G Knepley   include petsc.h90 in your code.
9603813dfbdSMatthew G Knepley 
9613813dfbdSMatthew G Knepley   You must also call DMPlexRestoreSupport() after you finish using the returned array.
9623813dfbdSMatthew G Knepley 
963552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
964552f7358SJed Brown @*/
965552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[])
966552f7358SJed Brown {
967552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
968552f7358SJed Brown   PetscInt       off;
969552f7358SJed Brown   PetscErrorCode ierr;
970552f7358SJed Brown 
971552f7358SJed Brown   PetscFunctionBegin;
972552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
973552f7358SJed Brown   PetscValidPointer(support, 3);
974552f7358SJed Brown   ierr     = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
975552f7358SJed Brown   *support = &mesh->supports[off];
976552f7358SJed Brown   PetscFunctionReturn(0);
977552f7358SJed Brown }
978552f7358SJed Brown 
979552f7358SJed Brown #undef __FUNCT__
980552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport"
981552f7358SJed Brown /*@
982552f7358SJed Brown   DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG
983552f7358SJed Brown 
984552f7358SJed Brown   Not collective
985552f7358SJed Brown 
986552f7358SJed Brown   Input Parameters:
987552f7358SJed Brown + mesh - The DMPlex
988552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
989552f7358SJed Brown - support - An array of points which are on the in-edges for point p
990552f7358SJed Brown 
991552f7358SJed Brown   Output Parameter:
992552f7358SJed Brown 
993552f7358SJed Brown   Note:
994552f7358SJed Brown   This should be called after all calls to DMPlexSetSupportSize() and DMSetUp().
995552f7358SJed Brown 
996552f7358SJed Brown   Level: beginner
997552f7358SJed Brown 
998552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp()
999552f7358SJed Brown @*/
1000552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[])
1001552f7358SJed Brown {
1002552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1003552f7358SJed Brown   PetscInt       pStart, pEnd;
1004552f7358SJed Brown   PetscInt       dof, off, c;
1005552f7358SJed Brown   PetscErrorCode ierr;
1006552f7358SJed Brown 
1007552f7358SJed Brown   PetscFunctionBegin;
1008552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1009552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1010552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1011552f7358SJed Brown   if (dof) PetscValidPointer(support, 3);
1012552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
101382f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
1014552f7358SJed Brown   for (c = 0; c < dof; ++c) {
101582f516ccSBarry Smith     if ((support[c] < pStart) || (support[c] >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", support[c], pStart, pEnd);
1016552f7358SJed Brown     mesh->supports[off+c] = support[c];
1017552f7358SJed Brown   }
1018552f7358SJed Brown   PetscFunctionReturn(0);
1019552f7358SJed Brown }
1020552f7358SJed Brown 
1021552f7358SJed Brown #undef __FUNCT__
1022552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport"
1023552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint)
1024552f7358SJed Brown {
1025552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1026552f7358SJed Brown   PetscInt       pStart, pEnd;
1027552f7358SJed Brown   PetscInt       dof, off;
1028552f7358SJed Brown   PetscErrorCode ierr;
1029552f7358SJed Brown 
1030552f7358SJed Brown   PetscFunctionBegin;
1031552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1032552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1033552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1034552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
103582f516ccSBarry Smith   if ((p < pStart) || (p >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Mesh point %D is not in the valid range [%D, %D)", p, pStart, pEnd);
103682f516ccSBarry Smith   if ((supportPoint < pStart) || (supportPoint >= pEnd)) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support point %D is not in the valid range [%D, %D)", supportPoint, pStart, pEnd);
103782f516ccSBarry Smith   if (supportPos >= dof) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Support position %D of point %D is not in the valid range [0, %D)", supportPos, p, dof);
1038552f7358SJed Brown   mesh->supports[off+supportPos] = supportPoint;
1039552f7358SJed Brown   PetscFunctionReturn(0);
1040552f7358SJed Brown }
1041552f7358SJed Brown 
1042552f7358SJed Brown #undef __FUNCT__
1043552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure"
1044552f7358SJed Brown /*@C
1045552f7358SJed Brown   DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG
1046552f7358SJed Brown 
1047552f7358SJed Brown   Not collective
1048552f7358SJed Brown 
1049552f7358SJed Brown   Input Parameters:
1050552f7358SJed Brown + mesh - The DMPlex
1051552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1052552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
10530298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
1054552f7358SJed Brown 
1055552f7358SJed Brown   Output Parameters:
1056552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
1057552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
1058552f7358SJed Brown 
1059552f7358SJed Brown   Note:
10600298fd71SBarry Smith   If using internal storage (points is NULL on input), each call overwrites the last output.
1061552f7358SJed Brown 
10623813dfbdSMatthew G Knepley   Fortran Notes:
10633813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
10643813dfbdSMatthew G Knepley   include petsc.h90 in your code.
10653813dfbdSMatthew G Knepley 
10663813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
10673813dfbdSMatthew G Knepley 
1068552f7358SJed Brown   Level: beginner
1069552f7358SJed Brown 
1070552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1071552f7358SJed Brown @*/
1072552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1073552f7358SJed Brown {
1074552f7358SJed Brown   DM_Plex        *mesh = (DM_Plex*) dm->data;
1075552f7358SJed Brown   PetscInt       *closure, *fifo;
10760298fd71SBarry Smith   const PetscInt *tmp = NULL, *tmpO = NULL;
1077552f7358SJed Brown   PetscInt        tmpSize, t;
1078552f7358SJed Brown   PetscInt        depth       = 0, maxSize;
1079552f7358SJed Brown   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
1080552f7358SJed Brown   PetscErrorCode  ierr;
1081552f7358SJed Brown 
1082552f7358SJed Brown   PetscFunctionBegin;
1083552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1084552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1085552f7358SJed Brown   /* This is only 1-level */
1086552f7358SJed Brown   if (useCone) {
1087552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
1088552f7358SJed Brown     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
1089552f7358SJed Brown     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
1090552f7358SJed Brown   } else {
1091552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
1092552f7358SJed Brown     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
1093552f7358SJed Brown   }
1094bfbcdd7aSMatthew G. Knepley   if (depth == 1) {
1095bfbcdd7aSMatthew G. Knepley     if (*points) {
1096bfbcdd7aSMatthew G. Knepley       closure = *points;
1097bfbcdd7aSMatthew G. Knepley     } else {
1098bfbcdd7aSMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
1099bfbcdd7aSMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1100bfbcdd7aSMatthew G. Knepley     }
1101bfbcdd7aSMatthew G. Knepley     closure[0] = p; closure[1] = 0;
1102bfbcdd7aSMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
1103bfbcdd7aSMatthew G. Knepley       closure[closureSize]   = tmp[t];
1104bfbcdd7aSMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[t] : 0;
1105bfbcdd7aSMatthew G. Knepley     }
1106bfbcdd7aSMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
1107bfbcdd7aSMatthew G. Knepley     if (points)    *points    = closure;
1108bfbcdd7aSMatthew G. Knepley     PetscFunctionReturn(0);
1109bfbcdd7aSMatthew G. Knepley   }
1110bfbcdd7aSMatthew G. Knepley   maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1);
1111bfbcdd7aSMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1112bfbcdd7aSMatthew G. Knepley   if (*points) {
1113bfbcdd7aSMatthew G. Knepley     closure = *points;
1114bfbcdd7aSMatthew G. Knepley   } else {
1115bfbcdd7aSMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1116bfbcdd7aSMatthew G. Knepley   }
1117bfbcdd7aSMatthew G. Knepley   closure[0] = p; closure[1] = 0;
1118552f7358SJed Brown   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
1119552f7358SJed Brown     const PetscInt cp = tmp[t];
1120552f7358SJed Brown     const PetscInt co = tmpO ? tmpO[t] : 0;
1121552f7358SJed Brown 
1122552f7358SJed Brown     closure[closureSize]   = cp;
1123552f7358SJed Brown     closure[closureSize+1] = co;
1124552f7358SJed Brown     fifo[fifoSize]         = cp;
1125552f7358SJed Brown     fifo[fifoSize+1]       = co;
1126552f7358SJed Brown   }
1127bfbcdd7aSMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
1128552f7358SJed Brown   while (fifoSize - fifoStart) {
1129552f7358SJed Brown     const PetscInt q   = fifo[fifoStart];
1130552f7358SJed Brown     const PetscInt o   = fifo[fifoStart+1];
1131552f7358SJed Brown     const PetscInt rev = o >= 0 ? 0 : 1;
1132552f7358SJed Brown     const PetscInt off = rev ? -(o+1) : o;
1133552f7358SJed Brown 
1134552f7358SJed Brown     if (useCone) {
1135552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
1136552f7358SJed Brown       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
1137552f7358SJed Brown       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
1138552f7358SJed Brown     } else {
1139552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
1140552f7358SJed Brown       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
11410298fd71SBarry Smith       tmpO = NULL;
1142552f7358SJed Brown     }
1143552f7358SJed Brown     for (t = 0; t < tmpSize; ++t) {
1144552f7358SJed Brown       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
1145552f7358SJed Brown       const PetscInt cp = tmp[i];
11462e1b13c2SMatthew G. Knepley       /* Must propogate orientation: When we reverse orientation, we both reverse the direction of iteration and start at the other end of the chain. */
11472e1b13c2SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
11482e1b13c2SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
11492e1b13c2SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
1150552f7358SJed Brown       PetscInt       c;
1151552f7358SJed Brown 
11522e1b13c2SMatthew G. Knepley       if (rev) {
11532e1b13c2SMatthew G. Knepley         PetscInt childSize, coff;
11542e1b13c2SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
11552e1b13c2SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
11562e1b13c2SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
11572e1b13c2SMatthew G. Knepley       }
1158552f7358SJed Brown       /* Check for duplicate */
1159552f7358SJed Brown       for (c = 0; c < closureSize; c += 2) {
1160552f7358SJed Brown         if (closure[c] == cp) break;
1161552f7358SJed Brown       }
1162552f7358SJed Brown       if (c == closureSize) {
1163552f7358SJed Brown         closure[closureSize]   = cp;
1164552f7358SJed Brown         closure[closureSize+1] = co;
1165552f7358SJed Brown         fifo[fifoSize]         = cp;
1166552f7358SJed Brown         fifo[fifoSize+1]       = co;
1167552f7358SJed Brown         closureSize           += 2;
1168552f7358SJed Brown         fifoSize              += 2;
1169552f7358SJed Brown       }
1170552f7358SJed Brown     }
1171552f7358SJed Brown     fifoStart += 2;
1172552f7358SJed Brown   }
1173552f7358SJed Brown   if (numPoints) *numPoints = closureSize/2;
1174552f7358SJed Brown   if (points)    *points    = closure;
1175552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1176552f7358SJed Brown   PetscFunctionReturn(0);
1177552f7358SJed Brown }
1178552f7358SJed Brown 
1179552f7358SJed Brown #undef __FUNCT__
1180552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure"
1181552f7358SJed Brown /*@C
1182552f7358SJed Brown   DMPlexRestoreTransitiveClosure - Restore the array of points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG
1183552f7358SJed Brown 
1184552f7358SJed Brown   Not collective
1185552f7358SJed Brown 
1186552f7358SJed Brown   Input Parameters:
1187552f7358SJed Brown + mesh - The DMPlex
1188552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1189552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
11900298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
1191552f7358SJed Brown 
1192552f7358SJed Brown   Output Parameters:
1193552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
1194552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
1195552f7358SJed Brown 
1196552f7358SJed Brown   Note:
11970298fd71SBarry Smith   If not using internal storage (points is not NULL on input), this call is unnecessary
1198552f7358SJed Brown 
11993813dfbdSMatthew G Knepley   Fortran Notes:
12003813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
12013813dfbdSMatthew G Knepley   include petsc.h90 in your code.
12023813dfbdSMatthew G Knepley 
12033813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
12043813dfbdSMatthew G Knepley 
1205552f7358SJed Brown   Level: beginner
1206552f7358SJed Brown 
1207552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1208552f7358SJed Brown @*/
1209552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1210552f7358SJed Brown {
1211552f7358SJed Brown   PetscErrorCode ierr;
1212552f7358SJed Brown 
1213552f7358SJed Brown   PetscFunctionBegin;
1214552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1215552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr);
1216552f7358SJed Brown   PetscFunctionReturn(0);
1217552f7358SJed Brown }
1218552f7358SJed Brown 
1219552f7358SJed Brown #undef __FUNCT__
1220552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes"
1221552f7358SJed Brown /*@
1222552f7358SJed Brown   DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG
1223552f7358SJed Brown 
1224552f7358SJed Brown   Not collective
1225552f7358SJed Brown 
1226552f7358SJed Brown   Input Parameter:
1227552f7358SJed Brown . mesh - The DMPlex
1228552f7358SJed Brown 
1229552f7358SJed Brown   Output Parameters:
1230552f7358SJed Brown + maxConeSize - The maximum number of in-edges
1231552f7358SJed Brown - maxSupportSize - The maximum number of out-edges
1232552f7358SJed Brown 
1233552f7358SJed Brown   Level: beginner
1234552f7358SJed Brown 
1235552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
1236552f7358SJed Brown @*/
1237552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize)
1238552f7358SJed Brown {
1239552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
1240552f7358SJed Brown 
1241552f7358SJed Brown   PetscFunctionBegin;
1242552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1243552f7358SJed Brown   if (maxConeSize)    *maxConeSize    = mesh->maxConeSize;
1244552f7358SJed Brown   if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize;
1245552f7358SJed Brown   PetscFunctionReturn(0);
1246552f7358SJed Brown }
1247552f7358SJed Brown 
1248552f7358SJed Brown #undef __FUNCT__
1249552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex"
1250552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm)
1251552f7358SJed Brown {
1252552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1253552f7358SJed Brown   PetscInt       size;
1254552f7358SJed Brown   PetscErrorCode ierr;
1255552f7358SJed Brown 
1256552f7358SJed Brown   PetscFunctionBegin;
1257552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1258552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr);
1259552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr);
1260552f7358SJed Brown   ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->cones);CHKERRQ(ierr);
1261552f7358SJed Brown   ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->coneOrientations);CHKERRQ(ierr);
1262552f7358SJed Brown   ierr = PetscMemzero(mesh->coneOrientations, size * sizeof(PetscInt));CHKERRQ(ierr);
1263552f7358SJed Brown   if (mesh->maxSupportSize) {
1264552f7358SJed Brown     ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1265552f7358SJed Brown     ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr);
1266552f7358SJed Brown     ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->supports);CHKERRQ(ierr);
1267552f7358SJed Brown   }
1268552f7358SJed Brown   PetscFunctionReturn(0);
1269552f7358SJed Brown }
1270552f7358SJed Brown 
1271552f7358SJed Brown #undef __FUNCT__
1272552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex"
1273552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm)
1274552f7358SJed Brown {
1275552f7358SJed Brown   PetscErrorCode ierr;
1276552f7358SJed Brown 
1277552f7358SJed Brown   PetscFunctionBegin;
12784d9407bcSMatthew G. Knepley   if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);}
12794d9407bcSMatthew G. Knepley   ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr);
1280552f7358SJed Brown   PetscFunctionReturn(0);
1281552f7358SJed Brown }
1282552f7358SJed Brown 
1283552f7358SJed Brown #undef __FUNCT__
1284552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize"
1285552f7358SJed Brown /*@
1286552f7358SJed Brown   DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation
1287552f7358SJed Brown 
1288552f7358SJed Brown   Not collective
1289552f7358SJed Brown 
1290552f7358SJed Brown   Input Parameter:
1291552f7358SJed Brown . mesh - The DMPlex
1292552f7358SJed Brown 
1293552f7358SJed Brown   Output Parameter:
1294552f7358SJed Brown 
1295552f7358SJed Brown   Note:
1296552f7358SJed Brown   This should be called after all calls to DMPlexSetCone()
1297552f7358SJed Brown 
1298552f7358SJed Brown   Level: beginner
1299552f7358SJed Brown 
1300552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone()
1301552f7358SJed Brown @*/
1302552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm)
1303552f7358SJed Brown {
1304552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1305552f7358SJed Brown   PetscInt      *offsets;
1306552f7358SJed Brown   PetscInt       supportSize;
1307552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1308552f7358SJed Brown   PetscErrorCode ierr;
1309552f7358SJed Brown 
1310552f7358SJed Brown   PetscFunctionBegin;
1311552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
131282f516ccSBarry Smith   if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex");
1313552f7358SJed Brown   /* Calculate support sizes */
1314552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1315552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1316552f7358SJed Brown     PetscInt dof, off, c;
1317552f7358SJed Brown 
1318552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1319552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1320552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1321552f7358SJed Brown       ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr);
1322552f7358SJed Brown     }
1323552f7358SJed Brown   }
1324552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1325552f7358SJed Brown     PetscInt dof;
1326552f7358SJed Brown 
1327552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
13280d644c17SKarl Rupp 
1329552f7358SJed Brown     mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof);
1330552f7358SJed Brown   }
1331552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1332552f7358SJed Brown   /* Calculate supports */
1333552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr);
1334552f7358SJed Brown   ierr = PetscMalloc(supportSize * sizeof(PetscInt), &mesh->supports);CHKERRQ(ierr);
1335552f7358SJed Brown   ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt), &offsets);CHKERRQ(ierr);
1336552f7358SJed Brown   ierr = PetscMemzero(offsets, (pEnd - pStart) * sizeof(PetscInt));CHKERRQ(ierr);
1337552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1338552f7358SJed Brown     PetscInt dof, off, c;
1339552f7358SJed Brown 
1340552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1341552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1342552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1343552f7358SJed Brown       const PetscInt q = mesh->cones[c];
1344552f7358SJed Brown       PetscInt       offS;
1345552f7358SJed Brown 
1346552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr);
13470d644c17SKarl Rupp 
1348552f7358SJed Brown       mesh->supports[offS+offsets[q]] = p;
1349552f7358SJed Brown       ++offsets[q];
1350552f7358SJed Brown     }
1351552f7358SJed Brown   }
1352552f7358SJed Brown   ierr = PetscFree(offsets);CHKERRQ(ierr);
1353552f7358SJed Brown   PetscFunctionReturn(0);
1354552f7358SJed Brown }
1355552f7358SJed Brown 
1356552f7358SJed Brown #undef __FUNCT__
1357552f7358SJed Brown #define __FUNCT__ "DMPlexStratify"
1358552f7358SJed Brown /*@
1359552f7358SJed Brown   DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and
1360552f7358SJed Brown   can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the
1361552f7358SJed Brown   same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in
1362552f7358SJed Brown   the DAG.
1363552f7358SJed Brown 
1364552f7358SJed Brown   Not collective
1365552f7358SJed Brown 
1366552f7358SJed Brown   Input Parameter:
1367552f7358SJed Brown . mesh - The DMPlex
1368552f7358SJed Brown 
1369552f7358SJed Brown   Output Parameter:
1370552f7358SJed Brown 
1371552f7358SJed Brown   Notes:
1372552f7358SJed Brown   The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would
1373552f7358SJed Brown   have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1.
1374552f7358SJed Brown 
1375552f7358SJed Brown   This should be called after all calls to DMPlexSymmetrize()
1376552f7358SJed Brown 
1377552f7358SJed Brown   Level: beginner
1378552f7358SJed Brown 
1379552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize()
1380552f7358SJed Brown @*/
1381552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm)
1382552f7358SJed Brown {
1383aa50250dSMatthew G. Knepley   DMLabel        label;
1384552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1385552f7358SJed Brown   PetscInt       numRoots = 0, numLeaves = 0;
1386552f7358SJed Brown   PetscErrorCode ierr;
1387552f7358SJed Brown 
1388552f7358SJed Brown   PetscFunctionBegin;
1389552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1390552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1391552f7358SJed Brown   /* Calculate depth */
1392aa50250dSMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1393aa50250dSMatthew G. Knepley   ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr);
1394aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
1395552f7358SJed Brown   /* Initialize roots and count leaves */
1396552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1397552f7358SJed Brown     PetscInt coneSize, supportSize;
1398552f7358SJed Brown 
1399552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1400552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1401552f7358SJed Brown     if (!coneSize && supportSize) {
1402552f7358SJed Brown       ++numRoots;
1403aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1404552f7358SJed Brown     } else if (!supportSize && coneSize) {
1405552f7358SJed Brown       ++numLeaves;
1406552f7358SJed Brown     } else if (!supportSize && !coneSize) {
1407552f7358SJed Brown       /* Isolated points */
1408aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1409552f7358SJed Brown     }
1410552f7358SJed Brown   }
1411552f7358SJed Brown   if (numRoots + numLeaves == (pEnd - pStart)) {
1412552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
1413552f7358SJed Brown       PetscInt coneSize, supportSize;
1414552f7358SJed Brown 
1415552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1416552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1417552f7358SJed Brown       if (!supportSize && coneSize) {
1418aa50250dSMatthew G. Knepley         ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr);
1419552f7358SJed Brown       }
1420552f7358SJed Brown     }
1421552f7358SJed Brown   } else {
142274ef644bSMatthew G. Knepley     IS       pointIS;
142374ef644bSMatthew G. Knepley     PetscInt numPoints = 0, level = 0;
1424552f7358SJed Brown 
142574ef644bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
142674ef644bSMatthew G. Knepley     if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
142774ef644bSMatthew G. Knepley     while (numPoints) {
142874ef644bSMatthew G. Knepley       const PetscInt *points;
142974ef644bSMatthew G. Knepley       const PetscInt  newLevel = level+1;
143074ef644bSMatthew G. Knepley 
143174ef644bSMatthew G. Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
143274ef644bSMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
143374ef644bSMatthew G. Knepley         const PetscInt  point = points[p];
143474ef644bSMatthew G. Knepley         const PetscInt *support;
143574ef644bSMatthew G. Knepley         PetscInt        supportSize, s;
143674ef644bSMatthew G. Knepley 
143774ef644bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
143874ef644bSMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
143974ef644bSMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
144074ef644bSMatthew G. Knepley           ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr);
1441552f7358SJed Brown         }
1442552f7358SJed Brown       }
144374ef644bSMatthew G. Knepley       ++level;
144474ef644bSMatthew G. Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
144574ef644bSMatthew G. Knepley       ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
144674ef644bSMatthew G. Knepley       if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
144774ef644bSMatthew G. Knepley       else         {numPoints = 0;}
144874ef644bSMatthew G. Knepley     }
144974ef644bSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
145074ef644bSMatthew G. Knepley   }
1451552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1452552f7358SJed Brown   PetscFunctionReturn(0);
1453552f7358SJed Brown }
1454552f7358SJed Brown 
1455552f7358SJed Brown #undef __FUNCT__
1456552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin"
1457552f7358SJed Brown /*@C
1458552f7358SJed Brown   DMPlexGetJoin - Get an array for the join of the set of points
1459552f7358SJed Brown 
1460552f7358SJed Brown   Not Collective
1461552f7358SJed Brown 
1462552f7358SJed Brown   Input Parameters:
1463552f7358SJed Brown + dm - The DMPlex object
1464552f7358SJed Brown . numPoints - The number of input points for the join
1465552f7358SJed Brown - points - The input points
1466552f7358SJed Brown 
1467552f7358SJed Brown   Output Parameters:
1468552f7358SJed Brown + numCoveredPoints - The number of points in the join
1469552f7358SJed Brown - coveredPoints - The points in the join
1470552f7358SJed Brown 
1471552f7358SJed Brown   Level: intermediate
1472552f7358SJed Brown 
1473552f7358SJed Brown   Note: Currently, this is restricted to a single level join
1474552f7358SJed Brown 
14753813dfbdSMatthew G Knepley   Fortran Notes:
14763813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
14773813dfbdSMatthew G Knepley   include petsc.h90 in your code.
14783813dfbdSMatthew G Knepley 
14793813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
14803813dfbdSMatthew G Knepley 
1481552f7358SJed Brown .keywords: mesh
1482552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet()
1483552f7358SJed Brown @*/
1484552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1485552f7358SJed Brown {
1486552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1487552f7358SJed Brown   PetscInt      *join[2];
1488552f7358SJed Brown   PetscInt       joinSize, i = 0;
1489552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1490552f7358SJed Brown   PetscErrorCode ierr;
1491552f7358SJed Brown 
1492552f7358SJed Brown   PetscFunctionBegin;
1493552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1494552f7358SJed Brown   PetscValidPointer(points, 2);
1495552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1496552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1497552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1498552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1499552f7358SJed Brown   /* Copy in support of first point */
1500552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr);
1501552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr);
1502552f7358SJed Brown   for (joinSize = 0; joinSize < dof; ++joinSize) {
1503552f7358SJed Brown     join[i][joinSize] = mesh->supports[off+joinSize];
1504552f7358SJed Brown   }
1505552f7358SJed Brown   /* Check each successive support */
1506552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1507552f7358SJed Brown     PetscInt newJoinSize = 0;
1508552f7358SJed Brown 
1509552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr);
1510552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr);
1511552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1512552f7358SJed Brown       const PetscInt point = mesh->supports[off+c];
1513552f7358SJed Brown 
1514552f7358SJed Brown       for (m = 0; m < joinSize; ++m) {
1515552f7358SJed Brown         if (point == join[i][m]) {
1516552f7358SJed Brown           join[1-i][newJoinSize++] = point;
1517552f7358SJed Brown           break;
1518552f7358SJed Brown         }
1519552f7358SJed Brown       }
1520552f7358SJed Brown     }
1521552f7358SJed Brown     joinSize = newJoinSize;
1522552f7358SJed Brown     i        = 1-i;
1523552f7358SJed Brown   }
1524552f7358SJed Brown   *numCoveredPoints = joinSize;
1525552f7358SJed Brown   *coveredPoints    = join[i];
1526552f7358SJed Brown   ierr              = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1527552f7358SJed Brown   PetscFunctionReturn(0);
1528552f7358SJed Brown }
1529552f7358SJed Brown 
1530552f7358SJed Brown #undef __FUNCT__
1531552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin"
1532552f7358SJed Brown /*@C
1533552f7358SJed Brown   DMPlexRestoreJoin - Restore an array for the join of the set of points
1534552f7358SJed Brown 
1535552f7358SJed Brown   Not Collective
1536552f7358SJed Brown 
1537552f7358SJed Brown   Input Parameters:
1538552f7358SJed Brown + dm - The DMPlex object
1539552f7358SJed Brown . numPoints - The number of input points for the join
1540552f7358SJed Brown - points - The input points
1541552f7358SJed Brown 
1542552f7358SJed Brown   Output Parameters:
1543552f7358SJed Brown + numCoveredPoints - The number of points in the join
1544552f7358SJed Brown - coveredPoints - The points in the join
1545552f7358SJed Brown 
15463813dfbdSMatthew G Knepley   Fortran Notes:
15473813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
15483813dfbdSMatthew G Knepley   include petsc.h90 in your code.
15493813dfbdSMatthew G Knepley 
15503813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
15513813dfbdSMatthew G Knepley 
1552552f7358SJed Brown   Level: intermediate
1553552f7358SJed Brown 
1554552f7358SJed Brown .keywords: mesh
1555552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet()
1556552f7358SJed Brown @*/
1557552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1558552f7358SJed Brown {
1559552f7358SJed Brown   PetscErrorCode ierr;
1560552f7358SJed Brown 
1561552f7358SJed Brown   PetscFunctionBegin;
1562552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1563552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1564552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1565552f7358SJed Brown   PetscFunctionReturn(0);
1566552f7358SJed Brown }
1567552f7358SJed Brown 
1568552f7358SJed Brown #undef __FUNCT__
1569552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin"
1570552f7358SJed Brown /*@C
1571552f7358SJed Brown   DMPlexGetFullJoin - Get an array for the join of the set of points
1572552f7358SJed Brown 
1573552f7358SJed Brown   Not Collective
1574552f7358SJed Brown 
1575552f7358SJed Brown   Input Parameters:
1576552f7358SJed Brown + dm - The DMPlex object
1577552f7358SJed Brown . numPoints - The number of input points for the join
1578552f7358SJed Brown - points - The input points
1579552f7358SJed Brown 
1580552f7358SJed Brown   Output Parameters:
1581552f7358SJed Brown + numCoveredPoints - The number of points in the join
1582552f7358SJed Brown - coveredPoints - The points in the join
1583552f7358SJed Brown 
15843813dfbdSMatthew G Knepley   Fortran Notes:
15853813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
15863813dfbdSMatthew G Knepley   include petsc.h90 in your code.
15873813dfbdSMatthew G Knepley 
15883813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
15893813dfbdSMatthew G Knepley 
1590552f7358SJed Brown   Level: intermediate
1591552f7358SJed Brown 
1592552f7358SJed Brown .keywords: mesh
1593552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet()
1594552f7358SJed Brown @*/
1595552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1596552f7358SJed Brown {
1597552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1598552f7358SJed Brown   PetscInt      *offsets, **closures;
1599552f7358SJed Brown   PetscInt      *join[2];
1600552f7358SJed Brown   PetscInt       depth = 0, maxSize, joinSize = 0, i = 0;
1601552f7358SJed Brown   PetscInt       p, d, c, m;
1602552f7358SJed Brown   PetscErrorCode ierr;
1603552f7358SJed Brown 
1604552f7358SJed Brown   PetscFunctionBegin;
1605552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1606552f7358SJed Brown   PetscValidPointer(points, 2);
1607552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1608552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1609552f7358SJed Brown 
1610552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1611552f7358SJed Brown   ierr    = PetscMalloc(numPoints * sizeof(PetscInt*), &closures);CHKERRQ(ierr);
1612552f7358SJed Brown   ierr    = PetscMemzero(closures,numPoints*sizeof(PetscInt*));CHKERRQ(ierr);
1613552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1614e7b80042SMatthew G. Knepley   maxSize = PetscPowInt(mesh->maxSupportSize,depth+1);
1615552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1616552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1617552f7358SJed Brown 
1618552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1619552f7358SJed Brown     PetscInt closureSize;
1620552f7358SJed Brown 
1621552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr);
16220d644c17SKarl Rupp 
1623552f7358SJed Brown     offsets[p*(depth+2)+0] = 0;
1624552f7358SJed Brown     for (d = 0; d < depth+1; ++d) {
1625552f7358SJed Brown       PetscInt pStart, pEnd, i;
1626552f7358SJed Brown 
1627552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
1628552f7358SJed Brown       for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) {
1629552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
1630552f7358SJed Brown           offsets[p*(depth+2)+d+1] = i;
1631552f7358SJed Brown           break;
1632552f7358SJed Brown         }
1633552f7358SJed Brown       }
1634552f7358SJed Brown       if (i == closureSize) offsets[p*(depth+2)+d+1] = i;
1635552f7358SJed Brown     }
163682f516ccSBarry 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);
1637552f7358SJed Brown   }
1638552f7358SJed Brown   for (d = 0; d < depth+1; ++d) {
1639552f7358SJed Brown     PetscInt dof;
1640552f7358SJed Brown 
1641552f7358SJed Brown     /* Copy in support of first point */
1642552f7358SJed Brown     dof = offsets[d+1] - offsets[d];
1643552f7358SJed Brown     for (joinSize = 0; joinSize < dof; ++joinSize) {
1644552f7358SJed Brown       join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2];
1645552f7358SJed Brown     }
1646552f7358SJed Brown     /* Check each successive cone */
1647552f7358SJed Brown     for (p = 1; p < numPoints && joinSize; ++p) {
1648552f7358SJed Brown       PetscInt newJoinSize = 0;
1649552f7358SJed Brown 
1650552f7358SJed Brown       dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d];
1651552f7358SJed Brown       for (c = 0; c < dof; ++c) {
1652552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2];
1653552f7358SJed Brown 
1654552f7358SJed Brown         for (m = 0; m < joinSize; ++m) {
1655552f7358SJed Brown           if (point == join[i][m]) {
1656552f7358SJed Brown             join[1-i][newJoinSize++] = point;
1657552f7358SJed Brown             break;
1658552f7358SJed Brown           }
1659552f7358SJed Brown         }
1660552f7358SJed Brown       }
1661552f7358SJed Brown       joinSize = newJoinSize;
1662552f7358SJed Brown       i        = 1-i;
1663552f7358SJed Brown     }
1664552f7358SJed Brown     if (joinSize) break;
1665552f7358SJed Brown   }
1666552f7358SJed Brown   *numCoveredPoints = joinSize;
1667552f7358SJed Brown   *coveredPoints    = join[i];
1668552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
16690298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr);
1670552f7358SJed Brown   }
1671552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
1672552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1673552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1674552f7358SJed Brown   PetscFunctionReturn(0);
1675552f7358SJed Brown }
1676552f7358SJed Brown 
1677552f7358SJed Brown #undef __FUNCT__
1678552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet"
1679552f7358SJed Brown /*@C
1680552f7358SJed Brown   DMPlexGetMeet - Get an array for the meet of the set of points
1681552f7358SJed Brown 
1682552f7358SJed Brown   Not Collective
1683552f7358SJed Brown 
1684552f7358SJed Brown   Input Parameters:
1685552f7358SJed Brown + dm - The DMPlex object
1686552f7358SJed Brown . numPoints - The number of input points for the meet
1687552f7358SJed Brown - points - The input points
1688552f7358SJed Brown 
1689552f7358SJed Brown   Output Parameters:
1690552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1691552f7358SJed Brown - coveredPoints - The points in the meet
1692552f7358SJed Brown 
1693552f7358SJed Brown   Level: intermediate
1694552f7358SJed Brown 
1695552f7358SJed Brown   Note: Currently, this is restricted to a single level meet
1696552f7358SJed Brown 
16973813dfbdSMatthew G Knepley   Fortran Notes:
16983813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
16993813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17003813dfbdSMatthew G Knepley 
17013813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17023813dfbdSMatthew G Knepley 
1703552f7358SJed Brown .keywords: mesh
1704552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin()
1705552f7358SJed Brown @*/
1706552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints)
1707552f7358SJed Brown {
1708552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1709552f7358SJed Brown   PetscInt      *meet[2];
1710552f7358SJed Brown   PetscInt       meetSize, i = 0;
1711552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1712552f7358SJed Brown   PetscErrorCode ierr;
1713552f7358SJed Brown 
1714552f7358SJed Brown   PetscFunctionBegin;
1715552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1716552f7358SJed Brown   PetscValidPointer(points, 2);
1717552f7358SJed Brown   PetscValidPointer(numCoveringPoints, 3);
1718552f7358SJed Brown   PetscValidPointer(coveringPoints, 4);
1719552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
1720552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
1721552f7358SJed Brown   /* Copy in cone of first point */
1722552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr);
1723552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr);
1724552f7358SJed Brown   for (meetSize = 0; meetSize < dof; ++meetSize) {
1725552f7358SJed Brown     meet[i][meetSize] = mesh->cones[off+meetSize];
1726552f7358SJed Brown   }
1727552f7358SJed Brown   /* Check each successive cone */
1728552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1729552f7358SJed Brown     PetscInt newMeetSize = 0;
1730552f7358SJed Brown 
1731552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr);
1732552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr);
1733552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1734552f7358SJed Brown       const PetscInt point = mesh->cones[off+c];
1735552f7358SJed Brown 
1736552f7358SJed Brown       for (m = 0; m < meetSize; ++m) {
1737552f7358SJed Brown         if (point == meet[i][m]) {
1738552f7358SJed Brown           meet[1-i][newMeetSize++] = point;
1739552f7358SJed Brown           break;
1740552f7358SJed Brown         }
1741552f7358SJed Brown       }
1742552f7358SJed Brown     }
1743552f7358SJed Brown     meetSize = newMeetSize;
1744552f7358SJed Brown     i        = 1-i;
1745552f7358SJed Brown   }
1746552f7358SJed Brown   *numCoveringPoints = meetSize;
1747552f7358SJed Brown   *coveringPoints    = meet[i];
1748552f7358SJed Brown   ierr               = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
1749552f7358SJed Brown   PetscFunctionReturn(0);
1750552f7358SJed Brown }
1751552f7358SJed Brown 
1752552f7358SJed Brown #undef __FUNCT__
1753552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet"
1754552f7358SJed Brown /*@C
1755552f7358SJed Brown   DMPlexRestoreMeet - Restore an array for the meet of the set of points
1756552f7358SJed Brown 
1757552f7358SJed Brown   Not Collective
1758552f7358SJed Brown 
1759552f7358SJed Brown   Input Parameters:
1760552f7358SJed Brown + dm - The DMPlex object
1761552f7358SJed Brown . numPoints - The number of input points for the meet
1762552f7358SJed Brown - points - The input points
1763552f7358SJed Brown 
1764552f7358SJed Brown   Output Parameters:
1765552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1766552f7358SJed Brown - coveredPoints - The points in the meet
1767552f7358SJed Brown 
1768552f7358SJed Brown   Level: intermediate
1769552f7358SJed Brown 
17703813dfbdSMatthew G Knepley   Fortran Notes:
17713813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
17723813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17733813dfbdSMatthew G Knepley 
17743813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17753813dfbdSMatthew G Knepley 
1776552f7358SJed Brown .keywords: mesh
1777552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin()
1778552f7358SJed Brown @*/
1779552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1780552f7358SJed Brown {
1781552f7358SJed Brown   PetscErrorCode ierr;
1782552f7358SJed Brown 
1783552f7358SJed Brown   PetscFunctionBegin;
1784552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1785552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1786552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1787552f7358SJed Brown   PetscFunctionReturn(0);
1788552f7358SJed Brown }
1789552f7358SJed Brown 
1790552f7358SJed Brown #undef __FUNCT__
1791552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet"
1792552f7358SJed Brown /*@C
1793552f7358SJed Brown   DMPlexGetFullMeet - Get an array for the meet of the set of points
1794552f7358SJed Brown 
1795552f7358SJed Brown   Not Collective
1796552f7358SJed Brown 
1797552f7358SJed Brown   Input Parameters:
1798552f7358SJed Brown + dm - The DMPlex object
1799552f7358SJed Brown . numPoints - The number of input points for the meet
1800552f7358SJed Brown - points - The input points
1801552f7358SJed Brown 
1802552f7358SJed Brown   Output Parameters:
1803552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1804552f7358SJed Brown - coveredPoints - The points in the meet
1805552f7358SJed Brown 
1806552f7358SJed Brown   Level: intermediate
1807552f7358SJed Brown 
18083813dfbdSMatthew G Knepley   Fortran Notes:
18093813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18103813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18113813dfbdSMatthew G Knepley 
18123813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18133813dfbdSMatthew G Knepley 
1814552f7358SJed Brown .keywords: mesh
1815552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin()
1816552f7358SJed Brown @*/
1817552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1818552f7358SJed Brown {
1819552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1820552f7358SJed Brown   PetscInt      *offsets, **closures;
1821552f7358SJed Brown   PetscInt      *meet[2];
1822552f7358SJed Brown   PetscInt       height = 0, maxSize, meetSize = 0, i = 0;
1823552f7358SJed Brown   PetscInt       p, h, c, m;
1824552f7358SJed Brown   PetscErrorCode ierr;
1825552f7358SJed Brown 
1826552f7358SJed Brown   PetscFunctionBegin;
1827552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1828552f7358SJed Brown   PetscValidPointer(points, 2);
1829552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1830552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1831552f7358SJed Brown 
1832552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &height);CHKERRQ(ierr);
1833552f7358SJed Brown   ierr    = PetscMalloc(numPoints * sizeof(PetscInt*), &closures);CHKERRQ(ierr);
1834552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1835e7b80042SMatthew G. Knepley   maxSize = PetscPowInt(mesh->maxConeSize,height+1);
1836552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
1837552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
1838552f7358SJed Brown 
1839552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1840552f7358SJed Brown     PetscInt closureSize;
1841552f7358SJed Brown 
1842552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr);
18430d644c17SKarl Rupp 
1844552f7358SJed Brown     offsets[p*(height+2)+0] = 0;
1845552f7358SJed Brown     for (h = 0; h < height+1; ++h) {
1846552f7358SJed Brown       PetscInt pStart, pEnd, i;
1847552f7358SJed Brown 
1848552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr);
1849552f7358SJed Brown       for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) {
1850552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
1851552f7358SJed Brown           offsets[p*(height+2)+h+1] = i;
1852552f7358SJed Brown           break;
1853552f7358SJed Brown         }
1854552f7358SJed Brown       }
1855552f7358SJed Brown       if (i == closureSize) offsets[p*(height+2)+h+1] = i;
1856552f7358SJed Brown     }
185782f516ccSBarry 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);
1858552f7358SJed Brown   }
1859552f7358SJed Brown   for (h = 0; h < height+1; ++h) {
1860552f7358SJed Brown     PetscInt dof;
1861552f7358SJed Brown 
1862552f7358SJed Brown     /* Copy in cone of first point */
1863552f7358SJed Brown     dof = offsets[h+1] - offsets[h];
1864552f7358SJed Brown     for (meetSize = 0; meetSize < dof; ++meetSize) {
1865552f7358SJed Brown       meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2];
1866552f7358SJed Brown     }
1867552f7358SJed Brown     /* Check each successive cone */
1868552f7358SJed Brown     for (p = 1; p < numPoints && meetSize; ++p) {
1869552f7358SJed Brown       PetscInt newMeetSize = 0;
1870552f7358SJed Brown 
1871552f7358SJed Brown       dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h];
1872552f7358SJed Brown       for (c = 0; c < dof; ++c) {
1873552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2];
1874552f7358SJed Brown 
1875552f7358SJed Brown         for (m = 0; m < meetSize; ++m) {
1876552f7358SJed Brown           if (point == meet[i][m]) {
1877552f7358SJed Brown             meet[1-i][newMeetSize++] = point;
1878552f7358SJed Brown             break;
1879552f7358SJed Brown           }
1880552f7358SJed Brown         }
1881552f7358SJed Brown       }
1882552f7358SJed Brown       meetSize = newMeetSize;
1883552f7358SJed Brown       i        = 1-i;
1884552f7358SJed Brown     }
1885552f7358SJed Brown     if (meetSize) break;
1886552f7358SJed Brown   }
1887552f7358SJed Brown   *numCoveredPoints = meetSize;
1888552f7358SJed Brown   *coveredPoints    = meet[i];
1889552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
18900298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr);
1891552f7358SJed Brown   }
1892552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
1893552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1894552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
1895552f7358SJed Brown   PetscFunctionReturn(0);
1896552f7358SJed Brown }
1897552f7358SJed Brown 
1898552f7358SJed Brown #undef __FUNCT__
18994e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual"
19004e3744c5SMatthew G. Knepley /*@C
19014e3744c5SMatthew G. Knepley   DMPlexEqual - Determine if two DMs have the same topology
19024e3744c5SMatthew G. Knepley 
19034e3744c5SMatthew G. Knepley   Not Collective
19044e3744c5SMatthew G. Knepley 
19054e3744c5SMatthew G. Knepley   Input Parameters:
19064e3744c5SMatthew G. Knepley + dmA - A DMPlex object
19074e3744c5SMatthew G. Knepley - dmB - A DMPlex object
19084e3744c5SMatthew G. Knepley 
19094e3744c5SMatthew G. Knepley   Output Parameters:
19104e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical
19114e3744c5SMatthew G. Knepley 
19124e3744c5SMatthew G. Knepley   Level: intermediate
19134e3744c5SMatthew G. Knepley 
19144e3744c5SMatthew G. Knepley   Notes:
19154e3744c5SMatthew G. Knepley   We are not solving graph isomorphism, so we do not permutation.
19164e3744c5SMatthew G. Knepley 
19174e3744c5SMatthew G. Knepley .keywords: mesh
19184e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone()
19194e3744c5SMatthew G. Knepley @*/
19204e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal)
19214e3744c5SMatthew G. Knepley {
19224e3744c5SMatthew G. Knepley   PetscInt       depth, depthB, pStart, pEnd, pStartB, pEndB, p;
19234e3744c5SMatthew G. Knepley   PetscErrorCode ierr;
19244e3744c5SMatthew G. Knepley 
19254e3744c5SMatthew G. Knepley   PetscFunctionBegin;
19264e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmA, DM_CLASSID, 1);
19274e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmB, DM_CLASSID, 2);
19284e3744c5SMatthew G. Knepley   PetscValidPointer(equal, 3);
19294e3744c5SMatthew G. Knepley 
19304e3744c5SMatthew G. Knepley   *equal = PETSC_FALSE;
19314e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr);
19324e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr);
19334e3744c5SMatthew G. Knepley   if (depth != depthB) PetscFunctionReturn(0);
19344e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmA, &pStart,  &pEnd);CHKERRQ(ierr);
19354e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr);
19364e3744c5SMatthew G. Knepley   if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0);
19374e3744c5SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
19384e3744c5SMatthew G. Knepley     const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB;
19394e3744c5SMatthew G. Knepley     PetscInt        coneSize, coneSizeB, c, supportSize, supportSizeB, s;
19404e3744c5SMatthew G. Knepley 
19414e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr);
19424e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr);
19434e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr);
19444e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr);
19454e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr);
19464e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr);
19474e3744c5SMatthew G. Knepley     if (coneSize != coneSizeB) PetscFunctionReturn(0);
19484e3744c5SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
19494e3744c5SMatthew G. Knepley       if (cone[c] != coneB[c]) PetscFunctionReturn(0);
19504e3744c5SMatthew G. Knepley       if (ornt[c] != orntB[c]) PetscFunctionReturn(0);
19514e3744c5SMatthew G. Knepley     }
19524e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr);
19534e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr);
19544e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr);
19554e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr);
19564e3744c5SMatthew G. Knepley     if (supportSize != supportSizeB) PetscFunctionReturn(0);
19574e3744c5SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
19584e3744c5SMatthew G. Knepley       if (support[s] != supportB[s]) PetscFunctionReturn(0);
19594e3744c5SMatthew G. Knepley     }
19604e3744c5SMatthew G. Knepley   }
19614e3744c5SMatthew G. Knepley   *equal = PETSC_TRUE;
19624e3744c5SMatthew G. Knepley   PetscFunctionReturn(0);
19634e3744c5SMatthew G. Knepley }
19644e3744c5SMatthew G. Knepley 
19654e3744c5SMatthew G. Knepley #undef __FUNCT__
196618ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices"
196718ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices)
1968a6dfd86eSKarl Rupp {
196982f516ccSBarry Smith   MPI_Comm       comm;
1970552f7358SJed Brown   PetscErrorCode ierr;
1971552f7358SJed Brown 
1972552f7358SJed Brown   PetscFunctionBegin;
197382f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1974552f7358SJed Brown   PetscValidPointer(numFaceVertices,3);
1975552f7358SJed Brown   switch (cellDim) {
1976552f7358SJed Brown   case 0:
1977552f7358SJed Brown     *numFaceVertices = 0;
1978552f7358SJed Brown     break;
1979552f7358SJed Brown   case 1:
1980552f7358SJed Brown     *numFaceVertices = 1;
1981552f7358SJed Brown     break;
1982552f7358SJed Brown   case 2:
1983552f7358SJed Brown     switch (numCorners) {
198419436ca2SJed Brown     case 3: /* triangle */
198519436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
1986552f7358SJed Brown       break;
198719436ca2SJed Brown     case 4: /* quadrilateral */
198819436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
1989552f7358SJed Brown       break;
199019436ca2SJed Brown     case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */
199119436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
1992552f7358SJed Brown       break;
199319436ca2SJed Brown     case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */
199419436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
1995552f7358SJed Brown       break;
1996552f7358SJed Brown     default:
1997552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
1998552f7358SJed Brown     }
1999552f7358SJed Brown     break;
2000552f7358SJed Brown   case 3:
2001552f7358SJed Brown     switch (numCorners) {
200219436ca2SJed Brown     case 4: /* tetradehdron */
200319436ca2SJed Brown       *numFaceVertices = 3; /* Face has 3 vertices */
2004552f7358SJed Brown       break;
200519436ca2SJed Brown     case 6: /* tet cohesive cells */
200619436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2007552f7358SJed Brown       break;
200819436ca2SJed Brown     case 8: /* hexahedron */
200919436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2010552f7358SJed Brown       break;
201119436ca2SJed Brown     case 9: /* tet cohesive Lagrange cells */
201219436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2013552f7358SJed Brown       break;
201419436ca2SJed Brown     case 10: /* quadratic tetrahedron */
201519436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2016552f7358SJed Brown       break;
201719436ca2SJed Brown     case 12: /* hex cohesive Lagrange cells */
201819436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2019552f7358SJed Brown       break;
202019436ca2SJed Brown     case 18: /* quadratic tet cohesive Lagrange cells */
202119436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2022552f7358SJed Brown       break;
202319436ca2SJed Brown     case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */
202419436ca2SJed Brown       *numFaceVertices = 9; /* Face has 9 vertices */
2025552f7358SJed Brown       break;
2026552f7358SJed Brown     default:
2027552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2028552f7358SJed Brown     }
2029552f7358SJed Brown     break;
2030552f7358SJed Brown   default:
2031552f7358SJed Brown     SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim);
2032552f7358SJed Brown   }
2033552f7358SJed Brown   PetscFunctionReturn(0);
2034552f7358SJed Brown }
2035552f7358SJed Brown 
2036552f7358SJed Brown #undef __FUNCT__
2037d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient"
2038d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */
2039d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm)
2040d27a0f52SMatthew G. Knepley {
2041a1b4d4a2SMatthew G. Knepley   PetscBT        seenCells, flippedCells, seenFaces;
2042a1b4d4a2SMatthew G. Knepley   PetscInt      *faceFIFO, fTop, fBottom;
2043a1b4d4a2SMatthew G. Knepley   PetscInt       dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO;
2044d27a0f52SMatthew G. Knepley   PetscErrorCode ierr;
2045d27a0f52SMatthew G. Knepley 
2046d27a0f52SMatthew G. Knepley   PetscFunctionBegin;
2047d27a0f52SMatthew G. Knepley   /* Truth Table
2048d27a0f52SMatthew G. Knepley      mismatch    flips   do action   mismatch   flipA ^ flipB   action
2049d27a0f52SMatthew G. Knepley          F       0 flips     no         F             F           F
2050d27a0f52SMatthew G. Knepley          F       1 flip      yes        F             T           T
2051d27a0f52SMatthew G. Knepley          F       2 flips     no         T             F           T
2052d27a0f52SMatthew G. Knepley          T       0 flips     yes        T             T           F
2053d27a0f52SMatthew G. Knepley          T       1 flip      no
2054d27a0f52SMatthew G. Knepley          T       2 flips     yes
2055d27a0f52SMatthew G. Knepley   */
2056a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2057d27a0f52SMatthew G. Knepley   ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr);
2058a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h,   &cStart, &cEnd);CHKERRQ(ierr);
2059d27a0f52SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr);
2060a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr);
2061a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr);
2062a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr);
2063a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr);
2064a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr);
2065a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr);
2066a1b4d4a2SMatthew G. Knepley   ierr = PetscMalloc((fEnd - fStart) * sizeof(PetscInt), &faceFIFO);CHKERRQ(ierr);
2067a1b4d4a2SMatthew G. Knepley   fTop = fBottom = 0;
2068a1b4d4a2SMatthew G. Knepley   /* Initialize FIFO with first cell */
2069defeeaeaSMatthew G. Knepley   if (cEnd > cStart) {
2070a1b4d4a2SMatthew G. Knepley     const PetscInt *cone;
2071a1b4d4a2SMatthew G. Knepley     PetscInt        coneSize;
2072a1b4d4a2SMatthew G. Knepley 
2073a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr);
2074a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr);
2075a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
2076a1b4d4a2SMatthew G. Knepley       faceFIFO[fBottom++] = cone[c];
2077a1b4d4a2SMatthew G. Knepley       ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr);
2078a1b4d4a2SMatthew G. Knepley     }
2079a1b4d4a2SMatthew G. Knepley   }
2080a1b4d4a2SMatthew G. Knepley   /* Consider each face in FIFO */
2081a1b4d4a2SMatthew G. Knepley   while (fTop < fBottom) {
2082d27a0f52SMatthew G. Knepley     const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB;
2083a1b4d4a2SMatthew G. Knepley     PetscInt        supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1;
2084d27a0f52SMatthew G. Knepley     PetscInt        seenA, flippedA, seenB, flippedB, mismatch;
2085d27a0f52SMatthew G. Knepley 
2086a1b4d4a2SMatthew G. Knepley     face = faceFIFO[fTop++];
2087a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2088a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2089d27a0f52SMatthew G. Knepley     if (supportSize < 2) continue;
2090d27a0f52SMatthew G. Knepley     if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize);
2091a1b4d4a2SMatthew G. Knepley     seenA    = PetscBTLookup(seenCells,    support[0]-cStart);
209286cff514SMatthew G. Knepley     flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0;
2093a1b4d4a2SMatthew G. Knepley     seenB    = PetscBTLookup(seenCells,    support[1]-cStart);
209486cff514SMatthew G. Knepley     flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0;
2095d27a0f52SMatthew G. Knepley 
2096d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr);
2097d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr);
2098d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr);
2099d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr);
2100d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr);
2101d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr);
2102a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeA; ++c) {
2103a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) {
2104a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneA[c];
2105a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr);
2106a1b4d4a2SMatthew G. Knepley       }
2107a1b4d4a2SMatthew G. Knepley       if (coneA[c] == face) posA = c;
2108a1b4d4a2SMatthew 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);
2109a1b4d4a2SMatthew G. Knepley     }
2110a1b4d4a2SMatthew 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]);
2111a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeB; ++c) {
2112a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) {
2113a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneB[c];
2114a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr);
2115a1b4d4a2SMatthew G. Knepley       }
2116a1b4d4a2SMatthew G. Knepley       if (coneB[c] == face) posB = c;
2117a1b4d4a2SMatthew 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);
2118a1b4d4a2SMatthew G. Knepley     }
2119a1b4d4a2SMatthew 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]);
2120d27a0f52SMatthew G. Knepley 
2121d27a0f52SMatthew G. Knepley     if (dim == 1) {
2122d27a0f52SMatthew G. Knepley       mismatch = posA == posB;
2123d27a0f52SMatthew G. Knepley     } else {
2124d27a0f52SMatthew G. Knepley       mismatch = coneOA[posA] == coneOB[posB];
2125d27a0f52SMatthew G. Knepley     }
2126d27a0f52SMatthew G. Knepley 
2127d27a0f52SMatthew G. Knepley     if (mismatch ^ (flippedA ^ flippedB)) {
2128d27a0f52SMatthew 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]);
2129d27a0f52SMatthew G. Knepley       if (!seenA && !flippedA) {
2130a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr);
2131d27a0f52SMatthew G. Knepley       } else if (!seenB && !flippedB) {
2132a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr);
2133d27a0f52SMatthew G. Knepley       } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
213486cff514SMatthew 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");
2135a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr);
2136a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr);
2137d27a0f52SMatthew G. Knepley   }
2138a1b4d4a2SMatthew G. Knepley 
2139d27a0f52SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2140d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2141d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2142a1b4d4a2SMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2143f4e909fcSMatthew G. Knepley     const PetscInt *cone, *coneO, *support;
2144f4e909fcSMatthew G. Knepley     PetscInt        coneSize, supportSize, faceSize, cp, sp;
2145d27a0f52SMatthew G. Knepley 
2146a1b4d4a2SMatthew G. Knepley     if (!PetscBTLookup(flippedCells, c-cStart)) continue;
2147a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2148a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2149a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr);
2150a1b4d4a2SMatthew G. Knepley     for (cp = 0; cp < coneSize; ++cp) {
2151a1b4d4a2SMatthew G. Knepley       const PetscInt rcp = coneSize-cp-1;
2152a1b4d4a2SMatthew G. Knepley 
2153a1b4d4a2SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr);
2154a1b4d4a2SMatthew G. Knepley       revcone[cp]  = cone[rcp];
2155a1b4d4a2SMatthew G. Knepley       revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp];
2156d27a0f52SMatthew G. Knepley     }
2157a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr);
2158a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr);
2159f4e909fcSMatthew G. Knepley     /* Reverse orientations of support */
2160f4e909fcSMatthew G. Knepley     faceSize = coneSize;
2161f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr);
2162f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr);
2163f4e909fcSMatthew G. Knepley     for (sp = 0; sp < supportSize; ++sp) {
2164f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr);
2165f4e909fcSMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr);
2166f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr);
2167f4e909fcSMatthew G. Knepley       for (cp = 0; cp < coneSize; ++cp) {
2168f4e909fcSMatthew G. Knepley         if (cone[cp] != c) continue;
2169f4e909fcSMatthew G. Knepley         ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr);
2170f4e909fcSMatthew G. Knepley       }
2171f4e909fcSMatthew G. Knepley     }
2172d27a0f52SMatthew G. Knepley   }
2173d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2174d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2175d27a0f52SMatthew G. Knepley   ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr);
2176a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr);
2177a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr);
2178a1b4d4a2SMatthew G. Knepley   ierr = PetscFree(faceFIFO);CHKERRQ(ierr);
2179d27a0f52SMatthew G. Knepley   PetscFunctionReturn(0);
2180d27a0f52SMatthew G. Knepley }
2181d27a0f52SMatthew G. Knepley 
2182d27a0f52SMatthew G. Knepley #undef __FUNCT__
2183cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal"
2184cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[])
2185cb1e1211SMatthew G Knepley {
2186cb1e1211SMatthew G Knepley   const PetscInt *support = NULL;
2187cb1e1211SMatthew G Knepley   PetscInt        numAdj   = 0, maxAdjSize = *adjSize, supportSize, s;
2188cb1e1211SMatthew G Knepley   PetscErrorCode  ierr;
2189cb1e1211SMatthew G Knepley 
2190cb1e1211SMatthew G Knepley   PetscFunctionBegin;
2191cb1e1211SMatthew G Knepley   if (useClosure) {
2192cb1e1211SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr);
2193cb1e1211SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr);
2194cb1e1211SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
2195cb1e1211SMatthew G Knepley       const PetscInt *cone = NULL;
2196cb1e1211SMatthew G Knepley       PetscInt        coneSize, c, q;
2197cb1e1211SMatthew G Knepley 
2198cb1e1211SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr);
2199cb1e1211SMatthew G Knepley       ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr);
2200cb1e1211SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
2201cb1e1211SMatthew G Knepley         for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) {
2202cb1e1211SMatthew G Knepley           if (cone[c] == adj[q]) break;
2203cb1e1211SMatthew G Knepley         }
2204cb1e1211SMatthew G Knepley         if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize);
2205cb1e1211SMatthew G Knepley       }
2206cb1e1211SMatthew G Knepley     }
2207cb1e1211SMatthew G Knepley   } else {
2208cb1e1211SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
2209cb1e1211SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
2210cb1e1211SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
2211cb1e1211SMatthew G Knepley       const PetscInt *cone = NULL;
2212cb1e1211SMatthew G Knepley       PetscInt        coneSize, c, q;
2213cb1e1211SMatthew G Knepley 
2214cb1e1211SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
2215cb1e1211SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
2216cb1e1211SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
2217cb1e1211SMatthew G Knepley         for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) {
2218cb1e1211SMatthew G Knepley           if (cone[c] == adj[q]) break;
2219cb1e1211SMatthew G Knepley         }
2220cb1e1211SMatthew G Knepley         if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize);
2221cb1e1211SMatthew G Knepley       }
2222cb1e1211SMatthew G Knepley     }
2223cb1e1211SMatthew G Knepley   }
2224cb1e1211SMatthew G Knepley   *adjSize = numAdj;
2225cb1e1211SMatthew G Knepley   PetscFunctionReturn(0);
2226cb1e1211SMatthew G Knepley }
2227cb1e1211SMatthew G Knepley 
2228cb1e1211SMatthew G Knepley #undef __FUNCT__
2229552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR"
223077c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency)
22310adebc6cSBarry Smith {
2232552f7358SJed Brown   const PetscInt maxFaceCases = 30;
2233552f7358SJed Brown   PetscInt       numFaceCases = 0;
2234552f7358SJed Brown   PetscInt       numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */
2235552f7358SJed Brown   PetscInt      *off, *adj;
2236552f7358SJed Brown   PetscInt      *neighborCells, *tmpClosure;
2237552f7358SJed Brown   PetscInt       maxConeSize, maxSupportSize, maxClosure, maxNeighbors;
223877c88f5bSMatthew G Knepley   PetscInt       dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell;
2239552f7358SJed Brown   PetscErrorCode ierr;
2240552f7358SJed Brown 
2241552f7358SJed Brown   PetscFunctionBegin;
2242552f7358SJed Brown   /* For parallel partitioning, I think you have to communicate supports */
2243552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
224477c88f5bSMatthew G Knepley   cellDim = dim - cellHeight;
2245552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
224677c88f5bSMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
2247552f7358SJed Brown   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
2248552f7358SJed Brown   if (cEnd - cStart == 0) {
2249552f7358SJed Brown     if (numVertices) *numVertices = 0;
22500298fd71SBarry Smith     if (offsets)   *offsets   = NULL;
22510298fd71SBarry Smith     if (adjacency) *adjacency = NULL;
2252552f7358SJed Brown     PetscFunctionReturn(0);
2253552f7358SJed Brown   }
2254552f7358SJed Brown   numCells  = cEnd - cStart;
225577c88f5bSMatthew G Knepley   faceDepth = depth - cellHeight;
2256552f7358SJed Brown   /* Setup face recognition */
225777c88f5bSMatthew G Knepley   if (faceDepth == 1) {
2258552f7358SJed Brown     PetscInt cornersSeen[30] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; /* Could use PetscBT */
2259552f7358SJed Brown 
2260552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
2261552f7358SJed Brown       PetscInt corners;
2262552f7358SJed Brown 
2263552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr);
2264552f7358SJed Brown       if (!cornersSeen[corners]) {
2265552f7358SJed Brown         PetscInt nFV;
2266552f7358SJed Brown 
226782f516ccSBarry Smith         if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases");
2268552f7358SJed Brown         cornersSeen[corners] = 1;
22690d644c17SKarl Rupp 
227018ad9376SMatthew G. Knepley         ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr);
22710d644c17SKarl Rupp 
2272552f7358SJed Brown         numFaceVertices[numFaceCases++] = nFV;
2273552f7358SJed Brown       }
2274552f7358SJed Brown     }
2275552f7358SJed Brown   }
2276e7b80042SMatthew G. Knepley   maxClosure   = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1));
2277e7b80042SMatthew G. Knepley   maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1);
2278552f7358SJed Brown   ierr         = PetscMalloc2(maxNeighbors,PetscInt,&neighborCells,maxClosure,PetscInt,&tmpClosure);CHKERRQ(ierr);
2279552f7358SJed Brown   ierr         = PetscMalloc((numCells+1) * sizeof(PetscInt), &off);CHKERRQ(ierr);
2280552f7358SJed Brown   ierr         = PetscMemzero(off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr);
2281552f7358SJed Brown   /* Count neighboring cells */
2282552f7358SJed Brown   for (cell = cStart; cell < cEnd; ++cell) {
2283552f7358SJed Brown     PetscInt numNeighbors = maxNeighbors, n;
2284552f7358SJed Brown 
2285cb1e1211SMatthew G Knepley     ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr);
2286552f7358SJed Brown     /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */
2287552f7358SJed Brown     for (n = 0; n < numNeighbors; ++n) {
22884d25b1e8SKarl Rupp       PetscInt        cellPair[2];
228977c88f5bSMatthew G Knepley       PetscBool       found    = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE;
2290552f7358SJed Brown       PetscInt        meetSize = 0;
22910298fd71SBarry Smith       const PetscInt *meet    = NULL;
2292552f7358SJed Brown 
22934d25b1e8SKarl Rupp       cellPair[0] = cell; cellPair[1] = neighborCells[n];
2294552f7358SJed Brown       if (cellPair[0] == cellPair[1]) continue;
2295552f7358SJed Brown       if (!found) {
2296552f7358SJed Brown         ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2297552f7358SJed Brown         if (meetSize) {
2298552f7358SJed Brown           PetscInt f;
2299552f7358SJed Brown 
2300552f7358SJed Brown           for (f = 0; f < numFaceCases; ++f) {
2301552f7358SJed Brown             if (numFaceVertices[f] == meetSize) {
2302552f7358SJed Brown               found = PETSC_TRUE;
2303552f7358SJed Brown               break;
2304552f7358SJed Brown             }
2305552f7358SJed Brown           }
2306552f7358SJed Brown         }
2307552f7358SJed Brown         ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2308552f7358SJed Brown       }
23090d644c17SKarl Rupp       if (found) ++off[cell-cStart+1];
2310552f7358SJed Brown     }
2311552f7358SJed Brown   }
2312552f7358SJed Brown   /* Prefix sum */
23130d644c17SKarl Rupp   for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1];
23140d644c17SKarl Rupp 
2315552f7358SJed Brown   if (adjacency) {
2316552f7358SJed Brown     ierr = PetscMalloc(off[numCells] * sizeof(PetscInt), &adj);CHKERRQ(ierr);
2317552f7358SJed Brown     /* Get neighboring cells */
2318552f7358SJed Brown     for (cell = cStart; cell < cEnd; ++cell) {
2319552f7358SJed Brown       PetscInt numNeighbors = maxNeighbors, n;
2320552f7358SJed Brown       PetscInt cellOffset   = 0;
2321552f7358SJed Brown 
2322cb1e1211SMatthew G Knepley       ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr);
2323552f7358SJed Brown       /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */
2324552f7358SJed Brown       for (n = 0; n < numNeighbors; ++n) {
23254d25b1e8SKarl Rupp         PetscInt        cellPair[2];
232677c88f5bSMatthew G Knepley         PetscBool       found    = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE;
2327552f7358SJed Brown         PetscInt        meetSize = 0;
23280298fd71SBarry Smith         const PetscInt *meet    = NULL;
2329552f7358SJed Brown 
23304d25b1e8SKarl Rupp         cellPair[0] = cell; cellPair[1] = neighborCells[n];
2331552f7358SJed Brown         if (cellPair[0] == cellPair[1]) continue;
2332552f7358SJed Brown         if (!found) {
2333552f7358SJed Brown           ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2334552f7358SJed Brown           if (meetSize) {
2335552f7358SJed Brown             PetscInt f;
2336552f7358SJed Brown 
2337552f7358SJed Brown             for (f = 0; f < numFaceCases; ++f) {
2338552f7358SJed Brown               if (numFaceVertices[f] == meetSize) {
2339552f7358SJed Brown                 found = PETSC_TRUE;
2340552f7358SJed Brown                 break;
2341552f7358SJed Brown               }
2342552f7358SJed Brown             }
2343552f7358SJed Brown           }
2344552f7358SJed Brown           ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2345552f7358SJed Brown         }
2346552f7358SJed Brown         if (found) {
2347552f7358SJed Brown           adj[off[cell-cStart]+cellOffset] = neighborCells[n];
2348552f7358SJed Brown           ++cellOffset;
2349552f7358SJed Brown         }
2350552f7358SJed Brown       }
2351552f7358SJed Brown     }
2352552f7358SJed Brown   }
2353552f7358SJed Brown   ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr);
2354552f7358SJed Brown   if (numVertices) *numVertices = numCells;
2355552f7358SJed Brown   if (offsets)   *offsets   = off;
2356552f7358SJed Brown   if (adjacency) *adjacency = adj;
2357552f7358SJed Brown   PetscFunctionReturn(0);
2358552f7358SJed Brown }
2359552f7358SJed Brown 
2360519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO)
2361519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H)
2362552f7358SJed Brown #include <unistd.h>
2363552f7358SJed Brown #endif
2364552f7358SJed Brown /* Chaco does not have an include file */
236539d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts,
2366552f7358SJed Brown                        float *ewgts, float *x, float *y, float *z, char *outassignname,
2367552f7358SJed Brown                        char *outfilename, short *assignment, int architecture, int ndims_tot,
2368552f7358SJed Brown                        int mesh_dims[3], double *goal, int global_method, int local_method,
2369552f7358SJed Brown                        int rqi_flag, int vmax, int ndims, double eigtol, long seed);
2370552f7358SJed Brown 
2371552f7358SJed Brown extern int FREE_GRAPH;
2372552f7358SJed Brown 
2373552f7358SJed Brown #undef __FUNCT__
2374552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco"
2375552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition)
2376552f7358SJed Brown {
2377552f7358SJed Brown   enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3};
237882f516ccSBarry Smith   MPI_Comm       comm;
2379552f7358SJed Brown   int            nvtxs          = numVertices; /* number of vertices in full graph */
2380552f7358SJed Brown   int           *vwgts          = NULL;   /* weights for all vertices */
2381552f7358SJed Brown   float         *ewgts          = NULL;   /* weights for all edges */
2382552f7358SJed Brown   float         *x              = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */
2383552f7358SJed Brown   char          *outassignname  = NULL;   /*  name of assignment output file */
2384552f7358SJed Brown   char          *outfilename    = NULL;   /* output file name */
2385552f7358SJed Brown   int            architecture   = 1;      /* 0 => hypercube, d => d-dimensional mesh */
2386552f7358SJed Brown   int            ndims_tot      = 0;      /* total number of cube dimensions to divide */
2387552f7358SJed Brown   int            mesh_dims[3];            /* dimensions of mesh of processors */
2388552f7358SJed Brown   double        *goal          = NULL;    /* desired set sizes for each set */
2389552f7358SJed Brown   int            global_method = 1;       /* global partitioning algorithm */
2390552f7358SJed Brown   int            local_method  = 1;       /* local partitioning algorithm */
2391552f7358SJed Brown   int            rqi_flag      = 0;       /* should I use RQI/Symmlq eigensolver? */
2392552f7358SJed Brown   int            vmax          = 200;     /* how many vertices to coarsen down to? */
2393552f7358SJed Brown   int            ndims         = 1;       /* number of eigenvectors (2^d sets) */
2394552f7358SJed Brown   double         eigtol        = 0.001;   /* tolerance on eigenvectors */
2395552f7358SJed Brown   long           seed          = 123636512; /* for random graph mutations */
2396552f7358SJed Brown   short int     *assignment;              /* Output partition */
2397552f7358SJed Brown   int            fd_stdout, fd_pipe[2];
2398552f7358SJed Brown   PetscInt      *points;
2399552f7358SJed Brown   PetscMPIInt    commSize;
2400552f7358SJed Brown   int            i, v, p;
2401552f7358SJed Brown   PetscErrorCode ierr;
2402552f7358SJed Brown 
2403552f7358SJed Brown   PetscFunctionBegin;
240482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2405552f7358SJed Brown   ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr);
2406552f7358SJed Brown   if (!numVertices) {
2407552f7358SJed Brown     ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr);
2408552f7358SJed Brown     ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr);
2409552f7358SJed Brown     ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
24100298fd71SBarry Smith     ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2411552f7358SJed Brown     PetscFunctionReturn(0);
2412552f7358SJed Brown   }
2413552f7358SJed Brown   FREE_GRAPH = 0;                         /* Do not let Chaco free my memory */
24140d644c17SKarl Rupp   for (i = 0; i < start[numVertices]; ++i) ++adjacency[i];
24150d644c17SKarl Rupp 
2416552f7358SJed Brown   if (global_method == INERTIAL_METHOD) {
2417552f7358SJed Brown     /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */
2418552f7358SJed Brown     SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported");
2419552f7358SJed Brown   }
2420552f7358SJed Brown   mesh_dims[0] = commSize;
2421552f7358SJed Brown   mesh_dims[1] = 1;
2422552f7358SJed Brown   mesh_dims[2] = 1;
2423552f7358SJed Brown   ierr = PetscMalloc(nvtxs * sizeof(short int), &assignment);CHKERRQ(ierr);
2424552f7358SJed Brown   /* Chaco outputs to stdout. We redirect this to a buffer. */
2425552f7358SJed Brown   /* TODO: check error codes for UNIX calls */
2426519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H)
2427552f7358SJed Brown   {
24287995c745SJed Brown     int piperet;
24297995c745SJed Brown     piperet = pipe(fd_pipe);
24307995c745SJed Brown     if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe");
2431552f7358SJed Brown     fd_stdout = dup(1);
2432552f7358SJed Brown     close(1);
2433552f7358SJed Brown     dup2(fd_pipe[1], 1);
2434552f7358SJed Brown   }
2435552f7358SJed Brown #endif
2436552f7358SJed Brown   ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename,
2437552f7358SJed Brown                    assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag,
2438552f7358SJed Brown                    vmax, ndims, eigtol, seed);
2439519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H)
2440552f7358SJed Brown   {
2441552f7358SJed Brown     char msgLog[10000];
2442552f7358SJed Brown     int  count;
2443552f7358SJed Brown 
2444552f7358SJed Brown     fflush(stdout);
2445552f7358SJed Brown     count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char));
2446552f7358SJed Brown     if (count < 0) count = 0;
2447552f7358SJed Brown     msgLog[count] = 0;
2448552f7358SJed Brown     close(1);
2449552f7358SJed Brown     dup2(fd_stdout, 1);
2450552f7358SJed Brown     close(fd_stdout);
2451552f7358SJed Brown     close(fd_pipe[0]);
2452552f7358SJed Brown     close(fd_pipe[1]);
2453552f7358SJed Brown     if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog);
2454552f7358SJed Brown   }
2455552f7358SJed Brown #endif
2456552f7358SJed Brown   /* Convert to PetscSection+IS */
2457552f7358SJed Brown   ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr);
2458552f7358SJed Brown   ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr);
2459552f7358SJed Brown   for (v = 0; v < nvtxs; ++v) {
2460552f7358SJed Brown     ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr);
2461552f7358SJed Brown   }
2462552f7358SJed Brown   ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
2463552f7358SJed Brown   ierr = PetscMalloc(nvtxs * sizeof(PetscInt), &points);CHKERRQ(ierr);
2464552f7358SJed Brown   for (p = 0, i = 0; p < commSize; ++p) {
2465552f7358SJed Brown     for (v = 0; v < nvtxs; ++v) {
2466552f7358SJed Brown       if (assignment[v] == p) points[i++] = v;
2467552f7358SJed Brown     }
2468552f7358SJed Brown   }
2469552f7358SJed Brown   if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs);
2470552f7358SJed Brown   ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2471552f7358SJed Brown   if (global_method == INERTIAL_METHOD) {
2472552f7358SJed Brown     /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */
2473552f7358SJed Brown   }
2474552f7358SJed Brown   ierr = PetscFree(assignment);CHKERRQ(ierr);
24750d644c17SKarl Rupp   for (i = 0; i < start[numVertices]; ++i) --adjacency[i];
2476552f7358SJed Brown   PetscFunctionReturn(0);
2477552f7358SJed Brown }
2478552f7358SJed Brown #endif
2479552f7358SJed Brown 
2480519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS)
248125cda350SMatthew G. Knepley #include <parmetis.h>
248225cda350SMatthew G. Knepley 
2483552f7358SJed Brown #undef __FUNCT__
2484552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis"
2485552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition)
2486552f7358SJed Brown {
248725cda350SMatthew G. Knepley   MPI_Comm       comm;
248825cda350SMatthew G. Knepley   PetscInt       nvtxs      = numVertices; // The number of vertices in full graph
248925cda350SMatthew G. Knepley   PetscInt      *vtxdist;                  // Distribution of vertices across processes
249025cda350SMatthew G. Knepley   PetscInt      *xadj       = start;       // Start of edge list for each vertex
249125cda350SMatthew G. Knepley   PetscInt      *adjncy     = adjacency;   // Edge lists for all vertices
249225cda350SMatthew G. Knepley   PetscInt      *vwgt       = NULL;        // Vertex weights
249325cda350SMatthew G. Knepley   PetscInt      *adjwgt     = NULL;        // Edge weights
249425cda350SMatthew G. Knepley   PetscInt       wgtflag    = 0;           // Indicates which weights are present
249525cda350SMatthew G. Knepley   PetscInt       numflag    = 0;           // Indicates initial offset (0 or 1)
249625cda350SMatthew G. Knepley   PetscInt       ncon       = 1;           // The number of weights per vertex
249725cda350SMatthew G. Knepley   PetscInt       nparts;                   // The number of partitions
249825cda350SMatthew G. Knepley   PetscReal     *tpwgts;                   // The fraction of vertex weights assigned to each partition
249925cda350SMatthew G. Knepley   PetscReal     *ubvec;                    // The balance intolerance for vertex weights
250025cda350SMatthew G. Knepley   PetscInt       options[5];               // Options
250125cda350SMatthew G. Knepley   // Outputs
250225cda350SMatthew G. Knepley   PetscInt       edgeCut;                  // The number of edges cut by the partition
250325cda350SMatthew G. Knepley   PetscInt      *assignment, *points;
250425cda350SMatthew G. Knepley   PetscMPIInt    commSize, rank, p, v, i;
250525cda350SMatthew G. Knepley   PetscErrorCode ierr;
250625cda350SMatthew G. Knepley 
2507552f7358SJed Brown   PetscFunctionBegin;
250825cda350SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr);
250925cda350SMatthew G. Knepley   ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr);
251025cda350SMatthew G. Knepley   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
251125cda350SMatthew G. Knepley   nparts = commSize;
251225cda350SMatthew G. Knepley   options[0] = 0; /* Use all defaults */
251325cda350SMatthew G. Knepley   /* Calculate vertex distribution */
251425cda350SMatthew G. Knepley   ierr = PetscMalloc4(nparts+1,PetscInt,&vtxdist,nparts*ncon,PetscReal,&tpwgts,ncon,PetscReal,&ubvec,nvtxs,PetscInt,&assignment);CHKERRQ(ierr);
251525cda350SMatthew G. Knepley   vtxdist[0] = 0;
251625cda350SMatthew G. Knepley   ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr);
251725cda350SMatthew G. Knepley   for (p = 2; p <= nparts; ++p) {
251825cda350SMatthew G. Knepley     vtxdist[p] += vtxdist[p-1];
251925cda350SMatthew G. Knepley   }
252025cda350SMatthew G. Knepley   /* Calculate weights */
252125cda350SMatthew G. Knepley   for (p = 0; p < nparts; ++p) {
252225cda350SMatthew G. Knepley     tpwgts[p] = 1.0/nparts;
252325cda350SMatthew G. Knepley   }
252425cda350SMatthew G. Knepley   ubvec[0] = 1.05;
252525cda350SMatthew G. Knepley 
252625cda350SMatthew G. Knepley   if (nparts == 1) {
252725cda350SMatthew G. Knepley     ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt));
252825cda350SMatthew G. Knepley   } else {
252925cda350SMatthew G. Knepley     if (vtxdist[1] == vtxdist[nparts]) {
253025cda350SMatthew G. Knepley       if (!rank) {
2531e7ee2502SMatthew G. Knepley         PetscStackPush("METIS_PartGraphKway");
2532e7ee2502SMatthew G. Knepley         ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment);
2533e7ee2502SMatthew G. Knepley         PetscStackPop;
2534e7ee2502SMatthew G. Knepley         if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()");
253525cda350SMatthew G. Knepley       }
253625cda350SMatthew G. Knepley     } else {
2537e7ee2502SMatthew G. Knepley       PetscStackPush("ParMETIS_V3_PartKway");
2538e7ee2502SMatthew G. Knepley       ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm);
2539e7ee2502SMatthew G. Knepley       PetscStackPop;
2540e7ee2502SMatthew G. Knepley       if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()");
254125cda350SMatthew G. Knepley     }
254225cda350SMatthew G. Knepley   }
254325cda350SMatthew G. Knepley   /* Convert to PetscSection+IS */
254425cda350SMatthew G. Knepley   ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr);
254525cda350SMatthew G. Knepley   ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr);
254625cda350SMatthew G. Knepley   for (v = 0; v < nvtxs; ++v) {
254725cda350SMatthew G. Knepley     ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr);
254825cda350SMatthew G. Knepley   }
254925cda350SMatthew G. Knepley   ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
255025cda350SMatthew G. Knepley   ierr = PetscMalloc(nvtxs * sizeof(PetscInt), &points);CHKERRQ(ierr);
255125cda350SMatthew G. Knepley   for (p = 0, i = 0; p < commSize; ++p) {
255225cda350SMatthew G. Knepley     for (v = 0; v < nvtxs; ++v) {
255325cda350SMatthew G. Knepley       if (assignment[v] == p) points[i++] = v;
255425cda350SMatthew G. Knepley     }
255525cda350SMatthew G. Knepley   }
255625cda350SMatthew G. Knepley   if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs);
255725cda350SMatthew G. Knepley   ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
255825cda350SMatthew G. Knepley   ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr);
2559552f7358SJed Brown   PetscFunctionReturn(0);
2560552f7358SJed Brown }
2561552f7358SJed Brown #endif
2562552f7358SJed Brown 
2563552f7358SJed Brown #undef __FUNCT__
2564552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition"
2565552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */
2566a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition)
2567a6dfd86eSKarl Rupp {
2568552f7358SJed Brown   PetscHashI      h;
2569552f7358SJed Brown   const PetscInt *points;
2570552f7358SJed Brown   PetscInt      **tmpPoints, *newPoints, totPoints = 0;
2571552f7358SJed Brown   PetscInt        pStart, pEnd, part, q;
2572552f7358SJed Brown   PetscErrorCode  ierr;
2573552f7358SJed Brown 
2574552f7358SJed Brown   PetscFunctionBegin;
2575552f7358SJed Brown   PetscHashICreate(h);
257682f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr);
2577552f7358SJed Brown   ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr);
2578552f7358SJed Brown   ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr);
2579552f7358SJed Brown   ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr);
2580552f7358SJed Brown   ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt*), &tmpPoints);CHKERRQ(ierr);
2581552f7358SJed Brown   for (part = pStart; part < pEnd; ++part) {
2582552f7358SJed Brown     PetscInt numPoints, nP, numNewPoints, off, p, n = 0;
2583552f7358SJed Brown 
2584552f7358SJed Brown     PetscHashIClear(h);
2585552f7358SJed Brown     ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr);
2586552f7358SJed Brown     ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr);
2587552f7358SJed Brown     /* Add all existing points to h */
2588552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
2589552f7358SJed Brown       const PetscInt point = points[off+p];
2590552f7358SJed Brown       PetscHashIAdd(h, point, 1);
2591552f7358SJed Brown     }
2592552f7358SJed Brown     PetscHashISize(h, nP);
259382f516ccSBarry Smith     if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP);
2594552f7358SJed Brown     /* Add all points in next BFS level */
2595552f7358SJed Brown     /*   TODO We are brute forcing here, but could check the adjacency size to find the boundary */
2596552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
2597552f7358SJed Brown       const PetscInt point = points[off+p];
2598552f7358SJed Brown       PetscInt       s     = start[point], e = start[point+1], a;
2599552f7358SJed Brown 
26000d644c17SKarl Rupp       for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1);
2601552f7358SJed Brown     }
2602552f7358SJed Brown     PetscHashISize(h, numNewPoints);
2603552f7358SJed Brown     ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr);
2604552f7358SJed Brown     ierr = PetscMalloc(numNewPoints * sizeof(PetscInt), &tmpPoints[part]);CHKERRQ(ierr);
26050d644c17SKarl Rupp     if (numNewPoints) PetscHashIGetKeys(h, n, tmpPoints[part]); /* Should not need this conditional */
2606552f7358SJed Brown     totPoints += numNewPoints;
2607552f7358SJed Brown   }
2608552f7358SJed Brown   ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr);
2609552f7358SJed Brown   PetscHashIDestroy(h);
2610552f7358SJed Brown   ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
2611552f7358SJed Brown   ierr = PetscMalloc(totPoints * sizeof(PetscInt), &newPoints);CHKERRQ(ierr);
2612552f7358SJed Brown   for (part = pStart, q = 0; part < pEnd; ++part) {
2613552f7358SJed Brown     PetscInt numPoints, p;
2614552f7358SJed Brown 
2615552f7358SJed Brown     ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr);
26160d644c17SKarl Rupp     for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p];
2617552f7358SJed Brown     ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr);
2618552f7358SJed Brown   }
2619552f7358SJed Brown   ierr = PetscFree(tmpPoints);CHKERRQ(ierr);
262082f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2621552f7358SJed Brown   PetscFunctionReturn(0);
2622552f7358SJed Brown }
2623552f7358SJed Brown 
2624552f7358SJed Brown #undef __FUNCT__
2625552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition"
2626552f7358SJed Brown /*
2627552f7358SJed Brown   DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height
2628552f7358SJed Brown 
2629552f7358SJed Brown   Collective on DM
2630552f7358SJed Brown 
2631552f7358SJed Brown   Input Parameters:
2632552f7358SJed Brown   + dm - The DM
2633552f7358SJed Brown   . height - The height for points in the partition
2634552f7358SJed Brown   - enlarge - Expand each partition with neighbors
2635552f7358SJed Brown 
2636552f7358SJed Brown   Output Parameters:
2637552f7358SJed Brown   + partSection - The PetscSection giving the division of points by partition
2638552f7358SJed Brown   . partition - The list of points by partition
26390298fd71SBarry Smith   . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL
26400298fd71SBarry Smith   - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL
2641552f7358SJed Brown 
2642552f7358SJed Brown   Level: developer
2643552f7358SJed Brown 
2644552f7358SJed Brown .seealso DMPlexDistribute()
2645552f7358SJed Brown */
2646ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition)
26470adebc6cSBarry Smith {
2648ac17c9edSMatthew G. Knepley   char           partname[1024];
2649ac17c9edSMatthew G. Knepley   PetscBool      isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg;
2650552f7358SJed Brown   PetscMPIInt    size;
2651552f7358SJed Brown   PetscErrorCode ierr;
2652552f7358SJed Brown 
2653552f7358SJed Brown   PetscFunctionBegin;
265482f516ccSBarry Smith   ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr);
26550d644c17SKarl Rupp 
26560298fd71SBarry Smith   *origPartSection = NULL;
26570298fd71SBarry Smith   *origPartition   = NULL;
2658552f7358SJed Brown   if (size == 1) {
2659552f7358SJed Brown     PetscInt *points;
2660552f7358SJed Brown     PetscInt  cStart, cEnd, c;
2661552f7358SJed Brown 
2662552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
266382f516ccSBarry Smith     ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr);
2664552f7358SJed Brown     ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr);
2665552f7358SJed Brown     ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr);
2666552f7358SJed Brown     ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
2667552f7358SJed Brown     ierr = PetscMalloc((cEnd - cStart) * sizeof(PetscInt), &points);CHKERRQ(ierr);
26680d644c17SKarl Rupp     for (c = cStart; c < cEnd; ++c) points[c] = c;
266982f516ccSBarry Smith     ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2670552f7358SJed Brown     PetscFunctionReturn(0);
2671552f7358SJed Brown   }
2672ac17c9edSMatthew G. Knepley   ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr);
2673ac17c9edSMatthew G. Knepley   if (flg) name = partname;
2674ac17c9edSMatthew G. Knepley   if (name) {
2675ac17c9edSMatthew G. Knepley     ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr);
2676ac17c9edSMatthew G. Knepley     ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr);
2677ac17c9edSMatthew G. Knepley   }
2678552f7358SJed Brown   if (height == 0) {
2679552f7358SJed Brown     PetscInt  numVertices;
26800298fd71SBarry Smith     PetscInt *start     = NULL;
26810298fd71SBarry Smith     PetscInt *adjacency = NULL;
2682552f7358SJed Brown 
268377c88f5bSMatthew G Knepley     ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr);
2684ac17c9edSMatthew G. Knepley     if (!name || isChaco) {
2685519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO)
2686552f7358SJed Brown       ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr);
2687ac17c9edSMatthew G. Knepley #else
2688ac17c9edSMatthew G. Knepley       SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco.");
2689552f7358SJed Brown #endif
2690ac17c9edSMatthew G. Knepley     } else if (isMetis) {
2691519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS)
2692552f7358SJed Brown       ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr);
2693552f7358SJed Brown #endif
2694ac17c9edSMatthew G. Knepley     } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name);
2695552f7358SJed Brown     if (enlarge) {
2696552f7358SJed Brown       *origPartSection = *partSection;
2697552f7358SJed Brown       *origPartition   = *partition;
26980d644c17SKarl Rupp 
2699552f7358SJed Brown       ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr);
2700552f7358SJed Brown     }
2701552f7358SJed Brown     ierr = PetscFree(start);CHKERRQ(ierr);
2702552f7358SJed Brown     ierr = PetscFree(adjacency);CHKERRQ(ierr);
2703552f7358SJed Brown # if 0
2704552f7358SJed Brown   } else if (height == 1) {
2705552f7358SJed Brown     /* Build the dual graph for faces and partition the hypergraph */
2706552f7358SJed Brown     PetscInt numEdges;
2707552f7358SJed Brown 
2708552f7358SJed Brown     buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase());
2709552f7358SJed Brown     GraphPartitioner().partition(numEdges, start, adjacency, partition, manager);
2710552f7358SJed Brown     destroyCSR(numEdges, start, adjacency);
2711552f7358SJed Brown #endif
271282f516ccSBarry Smith   } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height);
2713552f7358SJed Brown   PetscFunctionReturn(0);
2714552f7358SJed Brown }
2715552f7358SJed Brown 
2716552f7358SJed Brown #undef __FUNCT__
2717552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure"
27180adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition)
27190adebc6cSBarry Smith {
2720552f7358SJed Brown   /* const PetscInt  height = 0; */
2721552f7358SJed Brown   const PetscInt *partArray;
2722cb3cb6d9SJed Brown   PetscInt       *allPoints, *packPoints;
2723cb3cb6d9SJed Brown   PetscInt        rStart, rEnd, rank, pStart, pEnd, newSize;
2724552f7358SJed Brown   PetscErrorCode  ierr;
2725cb3cb6d9SJed Brown   PetscBT         bt;
2726cb3cb6d9SJed Brown   PetscSegBuffer  segpack,segpart;
2727552f7358SJed Brown 
2728552f7358SJed Brown   PetscFunctionBegin;
2729552f7358SJed Brown   ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr);
2730552f7358SJed Brown   ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr);
273182f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
2732552f7358SJed Brown   ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr);
2733cb3cb6d9SJed Brown   ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr);
2734cb3cb6d9SJed Brown   ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr);
2735cb3cb6d9SJed Brown   ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr);
2736cb3cb6d9SJed Brown   ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr);
2737552f7358SJed Brown   for (rank = rStart; rank < rEnd; ++rank) {
2738471ecdacSJed Brown     PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints;
2739552f7358SJed Brown 
2740552f7358SJed Brown     ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr);
2741552f7358SJed Brown     ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr);
2742552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
2743552f7358SJed Brown       PetscInt  point   = partArray[offset+p], closureSize, c;
27440298fd71SBarry Smith       PetscInt *closure = NULL;
2745552f7358SJed Brown 
2746552f7358SJed Brown       /* TODO Include support for height > 0 case */
2747552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2748cb3cb6d9SJed Brown       for (c=0; c<closureSize; c++) {
2749cb3cb6d9SJed Brown         PetscInt cpoint = closure[c*2];
2750cb3cb6d9SJed Brown         if (!PetscBTLookupSet(bt,cpoint-pStart)) {
2751471ecdacSJed Brown           PetscInt *PETSC_RESTRICT pt;
2752cb3cb6d9SJed Brown           partSize++;
2753471ecdacSJed Brown           ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr);
2754cb3cb6d9SJed Brown           *pt = cpoint;
2755552f7358SJed Brown         }
2756cb3cb6d9SJed Brown       }
2757552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2758552f7358SJed Brown     }
2759552f7358SJed Brown     ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr);
2760471ecdacSJed Brown     ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr);
2761471ecdacSJed Brown     ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr);
2762471ecdacSJed Brown     ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr);
2763471ecdacSJed Brown     for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);}
2764552f7358SJed Brown   }
2765cb3cb6d9SJed Brown   ierr = PetscBTDestroy(&bt);CHKERRQ(ierr);
2766cb3cb6d9SJed Brown   ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr);
2767cb3cb6d9SJed Brown 
2768552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
2769552f7358SJed Brown   ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr);
2770552f7358SJed Brown   ierr = PetscMalloc(newSize * sizeof(PetscInt), &allPoints);CHKERRQ(ierr);
2771552f7358SJed Brown 
2772137cf7b6SJed Brown   ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr);
2773552f7358SJed Brown   for (rank = rStart; rank < rEnd; ++rank) {
2774cb3cb6d9SJed Brown     PetscInt numPoints, offset;
2775552f7358SJed Brown 
2776cb3cb6d9SJed Brown     ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr);
2777cb3cb6d9SJed Brown     ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr);
2778cb3cb6d9SJed Brown     ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr);
2779cb3cb6d9SJed Brown     packPoints += numPoints;
2780552f7358SJed Brown   }
2781cb3cb6d9SJed Brown 
2782cb3cb6d9SJed Brown   ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr);
2783552f7358SJed Brown   ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr);
278482f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2785552f7358SJed Brown   PetscFunctionReturn(0);
2786552f7358SJed Brown }
2787552f7358SJed Brown 
2788552f7358SJed Brown #undef __FUNCT__
2789552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField"
27901858a729SMatthew G. Knepley /*@
27911858a729SMatthew G. Knepley   DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution
27921858a729SMatthew G. Knepley 
27931858a729SMatthew G. Knepley   Collective on DM
27941858a729SMatthew G. Knepley 
2795552f7358SJed Brown   Input Parameters:
27961858a729SMatthew G. Knepley + dm - The DMPlex object
27971858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern
27981858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout
27991858a729SMatthew G. Knepley - originalVec - The existing data
2800552f7358SJed Brown 
2801552f7358SJed Brown   Output Parameters:
28021858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout
28031858a729SMatthew G. Knepley - newVec - The new data
28041858a729SMatthew G. Knepley 
28051858a729SMatthew G. Knepley   Level: developer
28061858a729SMatthew G. Knepley 
28071858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData()
28081858a729SMatthew G. Knepley @*/
2809552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec)
2810552f7358SJed Brown {
2811552f7358SJed Brown   PetscSF        fieldSF;
2812552f7358SJed Brown   PetscInt      *remoteOffsets, fieldSize;
2813552f7358SJed Brown   PetscScalar   *originalValues, *newValues;
2814552f7358SJed Brown   PetscErrorCode ierr;
2815552f7358SJed Brown 
2816552f7358SJed Brown   PetscFunctionBegin;
2817552f7358SJed Brown   ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr);
2818552f7358SJed Brown 
2819552f7358SJed Brown   ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr);
2820552f7358SJed Brown   ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr);
2821c0dedaeaSBarry Smith   ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr);
2822552f7358SJed Brown 
2823552f7358SJed Brown   ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr);
2824552f7358SJed Brown   ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr);
2825552f7358SJed Brown   ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr);
2826552f7358SJed Brown   ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr);
2827552f7358SJed Brown   ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr);
2828552f7358SJed Brown   ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr);
2829552f7358SJed Brown   ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr);
2830552f7358SJed Brown   ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr);
2831552f7358SJed Brown   PetscFunctionReturn(0);
2832552f7358SJed Brown }
2833552f7358SJed Brown 
2834552f7358SJed Brown #undef __FUNCT__
28351858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData"
28361858a729SMatthew G. Knepley /*@
28371858a729SMatthew G. Knepley   DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution
28381858a729SMatthew G. Knepley 
28391858a729SMatthew G. Knepley   Collective on DM
28401858a729SMatthew G. Knepley 
28411858a729SMatthew G. Knepley   Input Parameters:
28421858a729SMatthew G. Knepley + dm - The DMPlex object
28431858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern
28441858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout
28451858a729SMatthew G. Knepley . datatype - The type of data
28461858a729SMatthew G. Knepley - originalData - The existing data
28471858a729SMatthew G. Knepley 
28481858a729SMatthew G. Knepley   Output Parameters:
28491858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout
28501858a729SMatthew G. Knepley - newData - The new data
28511858a729SMatthew G. Knepley 
28521858a729SMatthew G. Knepley   Level: developer
28531858a729SMatthew G. Knepley 
28541858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField()
28551858a729SMatthew G. Knepley @*/
28561858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData)
28571858a729SMatthew G. Knepley {
28581858a729SMatthew G. Knepley   PetscSF        fieldSF;
28591858a729SMatthew G. Knepley   PetscInt      *remoteOffsets, fieldSize;
28601858a729SMatthew G. Knepley   PetscMPIInt    dataSize;
28611858a729SMatthew G. Knepley   PetscErrorCode ierr;
28621858a729SMatthew G. Knepley 
28631858a729SMatthew G. Knepley   PetscFunctionBegin;
28641858a729SMatthew G. Knepley   ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr);
28651858a729SMatthew G. Knepley 
28661858a729SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr);
28671858a729SMatthew G. Knepley   ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr);
28681858a729SMatthew G. Knepley   ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr);
28691858a729SMatthew G. Knepley 
28701858a729SMatthew G. Knepley   ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr);
28711858a729SMatthew G. Knepley   ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr);
28721858a729SMatthew G. Knepley   ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr);
28731858a729SMatthew G. Knepley   ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr);
28741858a729SMatthew G. Knepley   PetscFunctionReturn(0);
28751858a729SMatthew G. Knepley }
28761858a729SMatthew G. Knepley 
28771858a729SMatthew G. Knepley #undef __FUNCT__
2878552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute"
2879552f7358SJed Brown /*@C
2880552f7358SJed Brown   DMPlexDistribute - Distributes the mesh and any associated sections.
2881552f7358SJed Brown 
2882552f7358SJed Brown   Not Collective
2883552f7358SJed Brown 
2884552f7358SJed Brown   Input Parameter:
2885552f7358SJed Brown + dm  - The original DMPlex object
2886552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default
2887552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default
2888552f7358SJed Brown 
2889552f7358SJed Brown   Output Parameter:
2890e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution
2891e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL
2892552f7358SJed Brown 
28930298fd71SBarry Smith   Note: If the mesh was not distributed, the return value is NULL
2894552f7358SJed Brown 
2895552f7358SJed Brown   Level: intermediate
2896552f7358SJed Brown 
2897552f7358SJed Brown .keywords: mesh, elements
2898552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace()
2899552f7358SJed Brown @*/
2900e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel)
2901552f7358SJed Brown {
2902552f7358SJed Brown   DM_Plex               *mesh   = (DM_Plex*) dm->data, *pmesh;
290382f516ccSBarry Smith   MPI_Comm               comm;
2904552f7358SJed Brown   const PetscInt         height = 0;
2905552f7358SJed Brown   PetscInt               dim, numRemoteRanks;
2906552f7358SJed Brown   IS                     origCellPart,        cellPart,        part;
2907552f7358SJed Brown   PetscSection           origCellPartSection, cellPartSection, partSection;
2908552f7358SJed Brown   PetscSFNode           *remoteRanks;
2909552f7358SJed Brown   PetscSF                partSF, pointSF, coneSF;
2910552f7358SJed Brown   ISLocalToGlobalMapping renumbering;
2911552f7358SJed Brown   PetscSection           originalConeSection, newConeSection;
2912552f7358SJed Brown   PetscInt              *remoteOffsets;
2913552f7358SJed Brown   PetscInt              *cones, *newCones, newConesSize;
2914552f7358SJed Brown   PetscBool              flg;
2915552f7358SJed Brown   PetscMPIInt            rank, numProcs, p;
2916552f7358SJed Brown   PetscErrorCode         ierr;
2917552f7358SJed Brown 
2918552f7358SJed Brown   PetscFunctionBegin;
2919552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2920e7ba9e7aSMatthew G. Knepley   if (sf) PetscValidPointer(sf,4);
2921e7ba9e7aSMatthew G. Knepley   PetscValidPointer(dmParallel,5);
29220d644c17SKarl Rupp 
2923552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr);
292482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2925552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
2926552f7358SJed Brown   ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);
29270d644c17SKarl Rupp 
29280298fd71SBarry Smith   *dmParallel = NULL;
2929552f7358SJed Brown   if (numProcs == 1) PetscFunctionReturn(0);
2930552f7358SJed Brown 
2931552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2932552f7358SJed Brown   /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */
2933b96ba592SMatthew G. Knepley   ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr);
293482f516ccSBarry Smith   if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented");
2935ac17c9edSMatthew G. Knepley   ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr);
2936552f7358SJed Brown   /* Create SF assuming a serial partition for all processes: Could check for IS length here */
29370d644c17SKarl Rupp   if (!rank) numRemoteRanks = numProcs;
29380d644c17SKarl Rupp   else       numRemoteRanks = 0;
2939552f7358SJed Brown   ierr = PetscMalloc(numRemoteRanks * sizeof(PetscSFNode), &remoteRanks);CHKERRQ(ierr);
2940552f7358SJed Brown   for (p = 0; p < numRemoteRanks; ++p) {
2941552f7358SJed Brown     remoteRanks[p].rank  = p;
2942552f7358SJed Brown     remoteRanks[p].index = 0;
2943552f7358SJed Brown   }
2944552f7358SJed Brown   ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr);
29450298fd71SBarry Smith   ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr);
2946552f7358SJed Brown   ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr);
2947552f7358SJed Brown   if (flg) {
2948552f7358SJed Brown     ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr);
2949552f7358SJed Brown     ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
29500298fd71SBarry Smith     ierr = ISView(cellPart, NULL);CHKERRQ(ierr);
2951552f7358SJed Brown     if (origCellPart) {
2952552f7358SJed Brown       ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr);
2953552f7358SJed Brown       ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
29540298fd71SBarry Smith       ierr = ISView(origCellPart, NULL);CHKERRQ(ierr);
2955552f7358SJed Brown     }
29560298fd71SBarry Smith     ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr);
2957552f7358SJed Brown   }
2958552f7358SJed Brown   /* Close the partition over the mesh */
2959552f7358SJed Brown   ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr);
2960552f7358SJed Brown   ierr = ISDestroy(&cellPart);CHKERRQ(ierr);
2961552f7358SJed Brown   ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr);
2962552f7358SJed Brown   /* Create new mesh */
2963552f7358SJed Brown   ierr  = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr);
2964552f7358SJed Brown   ierr  = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr);
2965552f7358SJed Brown   ierr  = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr);
2966552f7358SJed Brown   pmesh = (DM_Plex*) (*dmParallel)->data;
2967552f7358SJed Brown   /* Distribute sieve points and the global point numbering (replaces creating remote bases) */
2968552f7358SJed Brown   ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr);
2969552f7358SJed Brown   if (flg) {
2970552f7358SJed Brown     ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr);
2971552f7358SJed Brown     ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
29720298fd71SBarry Smith     ierr = ISView(part, NULL);CHKERRQ(ierr);
29730298fd71SBarry Smith     ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr);
2974552f7358SJed Brown     ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr);
29750298fd71SBarry Smith     ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr);
2976552f7358SJed Brown   }
2977b96ba592SMatthew G. Knepley   ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr);
2978552f7358SJed Brown   /* Distribute cone section */
2979552f7358SJed Brown   ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr);
2980552f7358SJed Brown   ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr);
2981552f7358SJed Brown   ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr);
2982552f7358SJed Brown   ierr = DMSetUp(*dmParallel);CHKERRQ(ierr);
2983552f7358SJed Brown   {
2984552f7358SJed Brown     PetscInt pStart, pEnd, p;
2985552f7358SJed Brown 
2986552f7358SJed Brown     ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr);
2987552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
2988552f7358SJed Brown       PetscInt coneSize;
2989552f7358SJed Brown       ierr               = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr);
2990552f7358SJed Brown       pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize);
2991552f7358SJed Brown     }
2992552f7358SJed Brown   }
2993552f7358SJed Brown   /* Communicate and renumber cones */
2994552f7358SJed Brown   ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr);
2995552f7358SJed Brown   ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr);
2996552f7358SJed Brown   ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr);
2997552f7358SJed Brown   ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
2998552f7358SJed Brown   ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
2999552f7358SJed Brown   ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr);
30000298fd71SBarry Smith   ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr);
3001552f7358SJed Brown   ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr);
3002552f7358SJed Brown   if (flg) {
3003552f7358SJed Brown     ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr);
3004552f7358SJed Brown     ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
3005552f7358SJed Brown     ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr);
3006552f7358SJed Brown     ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
30070298fd71SBarry Smith     ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr);
3008552f7358SJed Brown   }
3009552f7358SJed Brown   ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr);
3010552f7358SJed Brown   ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr);
3011552f7358SJed Brown   ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
3012552f7358SJed Brown   ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
3013552f7358SJed Brown   ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr);
3014552f7358SJed Brown   /* Create supports and stratify sieve */
3015552f7358SJed Brown   {
3016552f7358SJed Brown     PetscInt pStart, pEnd;
3017552f7358SJed Brown 
3018552f7358SJed Brown     ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
3019552f7358SJed Brown     ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr);
3020552f7358SJed Brown   }
3021552f7358SJed Brown   ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr);
3022552f7358SJed Brown   ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr);
3023552f7358SJed Brown   /* Distribute Coordinates */
3024552f7358SJed Brown   {
3025552f7358SJed Brown     PetscSection originalCoordSection, newCoordSection;
3026552f7358SJed Brown     Vec          originalCoordinates, newCoordinates;
3027552f7358SJed Brown     const char  *name;
3028552f7358SJed Brown 
3029552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr);
3030552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr);
3031552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr);
3032552f7358SJed Brown     ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr);
3033552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr);
3034552f7358SJed Brown     ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr);
3035552f7358SJed Brown 
3036552f7358SJed Brown     ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr);
3037552f7358SJed Brown     ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr);
3038552f7358SJed Brown     ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
3039552f7358SJed Brown   }
3040552f7358SJed Brown   /* Distribute labels */
3041b96ba592SMatthew G. Knepley   ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr);
3042552f7358SJed Brown   {
3043552f7358SJed Brown     DMLabel  next      = mesh->labels, newNext = pmesh->labels;
3044552f7358SJed Brown     PetscInt numLabels = 0, l;
3045552f7358SJed Brown 
3046552f7358SJed Brown     /* Bcast number of labels */
30470d644c17SKarl Rupp     while (next) {
30480d644c17SKarl Rupp       ++numLabels; next = next->next;
30490d644c17SKarl Rupp     }
3050552f7358SJed Brown     ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
3051552f7358SJed Brown     next = mesh->labels;
3052552f7358SJed Brown     for (l = 0; l < numLabels; ++l) {
3053552f7358SJed Brown       DMLabel         newLabel;
3054552f7358SJed Brown       const PetscInt *partArray;
3055552f7358SJed Brown       char           *name;
30560298fd71SBarry Smith       PetscInt       *stratumSizes = NULL, *points = NULL;
30570298fd71SBarry Smith       PetscMPIInt    *sendcnts     = NULL, *offsets = NULL, *displs = NULL;
30580447884eSMatthew G. Knepley       PetscInt        nameSize, s, p, proc;
3059552f7358SJed Brown       PetscBool       isdepth;
3060552f7358SJed Brown       size_t          len = 0;
3061552f7358SJed Brown 
3062552f7358SJed Brown       /* Bcast name (could filter for no points) */
3063552f7358SJed Brown       if (!rank) {ierr = PetscStrlen(next->name, &len);CHKERRQ(ierr);}
3064552f7358SJed Brown       nameSize = len;
3065552f7358SJed Brown       ierr     = MPI_Bcast(&nameSize, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
3066552f7358SJed Brown       ierr     = PetscMalloc(nameSize+1, &name);CHKERRQ(ierr);
3067552f7358SJed Brown       if (!rank) {ierr = PetscMemcpy(name, next->name, nameSize+1);CHKERRQ(ierr);}
3068552f7358SJed Brown       ierr = MPI_Bcast(name, nameSize+1, MPI_CHAR, 0, comm);CHKERRQ(ierr);
3069552f7358SJed Brown       ierr = PetscStrcmp(name, "depth", &isdepth);CHKERRQ(ierr);
307022566864SJed Brown       if (isdepth) {            /* skip because "depth" is not distributed */
307122566864SJed Brown         ierr = PetscFree(name);CHKERRQ(ierr);
307222566864SJed Brown         if (!rank) next = next->next;
307322566864SJed Brown         continue;
307422566864SJed Brown       }
3075552f7358SJed Brown       ierr           = PetscNew(struct _n_DMLabel, &newLabel);CHKERRQ(ierr);
3076552f7358SJed Brown       newLabel->name = name;
3077552f7358SJed Brown       /* Bcast numStrata (could filter for no points in stratum) */
30780d644c17SKarl Rupp       if (!rank) newLabel->numStrata = next->numStrata;
3079552f7358SJed Brown       ierr = MPI_Bcast(&newLabel->numStrata, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
3080552f7358SJed Brown       ierr = PetscMalloc3(newLabel->numStrata,PetscInt,&newLabel->stratumValues,
3081552f7358SJed Brown                           newLabel->numStrata,PetscInt,&newLabel->stratumSizes,
3082552f7358SJed Brown                           newLabel->numStrata+1,PetscInt,&newLabel->stratumOffsets);CHKERRQ(ierr);
3083552f7358SJed Brown       /* Bcast stratumValues (could filter for no points in stratum) */
3084552f7358SJed Brown       if (!rank) {ierr = PetscMemcpy(newLabel->stratumValues, next->stratumValues, next->numStrata * sizeof(PetscInt));CHKERRQ(ierr);}
3085552f7358SJed Brown       ierr = MPI_Bcast(newLabel->stratumValues, newLabel->numStrata, MPIU_INT, 0, comm);CHKERRQ(ierr);
30860447884eSMatthew G. Knepley       /* Find size on each process and Scatter
30870447884eSMatthew G. Knepley            we use the fact that both the stratum points and partArray are sorted */
3088552f7358SJed Brown       if (!rank) {
3089552f7358SJed Brown         ierr = ISGetIndices(part, &partArray);CHKERRQ(ierr);
3090552f7358SJed Brown         ierr = PetscMalloc(numProcs*next->numStrata * sizeof(PetscInt), &stratumSizes);CHKERRQ(ierr);
3091552f7358SJed Brown         ierr = PetscMemzero(stratumSizes, numProcs*next->numStrata * sizeof(PetscInt));CHKERRQ(ierr);
30920447884eSMatthew G. Knepley         /* TODO We should switch to using binary search if the label is a lot smaller than partitions */
3093552f7358SJed Brown         for (proc = 0; proc < numProcs; ++proc) {
30940447884eSMatthew G. Knepley           PetscInt dof, off;
3095552f7358SJed Brown 
3096552f7358SJed Brown           ierr = PetscSectionGetDof(partSection, proc, &dof);CHKERRQ(ierr);
3097552f7358SJed Brown           ierr = PetscSectionGetOffset(partSection, proc, &off);CHKERRQ(ierr);
30980447884eSMatthew G. Knepley           for (s = 0; s < next->numStrata; ++s) {
30990447884eSMatthew G. Knepley             PetscInt lStart = next->stratumOffsets[s], lEnd = next->stratumOffsets[s]+next->stratumSizes[s];
31000447884eSMatthew G. Knepley             PetscInt pStart = off,                     pEnd = off+dof;
31010447884eSMatthew G. Knepley 
31020447884eSMatthew G. Knepley             while (pStart < pEnd && lStart < lEnd) {
31030447884eSMatthew G. Knepley               if (partArray[pStart] > next->points[lStart]) {
31040447884eSMatthew G. Knepley                 ++lStart;
31050447884eSMatthew G. Knepley               } else if (next->points[lStart] > partArray[pStart]) {
31060447884eSMatthew G. Knepley                 ++pStart;
31070447884eSMatthew G. Knepley               } else {
3108552f7358SJed Brown                 ++stratumSizes[proc*next->numStrata+s];
31090447884eSMatthew G. Knepley                 ++pStart; ++lStart;
3110552f7358SJed Brown               }
3111552f7358SJed Brown             }
3112552f7358SJed Brown           }
3113552f7358SJed Brown         }
3114552f7358SJed Brown         ierr = ISRestoreIndices(part, &partArray);CHKERRQ(ierr);
3115552f7358SJed Brown       }
3116552f7358SJed Brown       ierr = MPI_Scatter(stratumSizes, newLabel->numStrata, MPIU_INT, newLabel->stratumSizes, newLabel->numStrata, MPIU_INT, 0, comm);CHKERRQ(ierr);
3117552f7358SJed Brown       /* Calculate stratumOffsets */
3118552f7358SJed Brown       newLabel->stratumOffsets[0] = 0;
3119552f7358SJed Brown       for (s = 0; s < newLabel->numStrata; ++s) {
3120552f7358SJed Brown         newLabel->stratumOffsets[s+1] = newLabel->stratumSizes[s] + newLabel->stratumOffsets[s];
3121552f7358SJed Brown       }
3122552f7358SJed Brown       /* Pack points and Scatter */
3123552f7358SJed Brown       if (!rank) {
3124552f7358SJed Brown         ierr = PetscMalloc3(numProcs,PetscMPIInt,&sendcnts,numProcs,PetscMPIInt,&offsets,numProcs+1,PetscMPIInt,&displs);CHKERRQ(ierr);
3125552f7358SJed Brown         displs[0] = 0;
3126552f7358SJed Brown         for (p = 0; p < numProcs; ++p) {
3127552f7358SJed Brown           sendcnts[p] = 0;
3128552f7358SJed Brown           for (s = 0; s < next->numStrata; ++s) {
3129552f7358SJed Brown             sendcnts[p] += stratumSizes[p*next->numStrata+s];
3130552f7358SJed Brown           }
3131552f7358SJed Brown           offsets[p]  = displs[p];
3132552f7358SJed Brown           displs[p+1] = displs[p] + sendcnts[p];
3133552f7358SJed Brown         }
3134552f7358SJed Brown         ierr = PetscMalloc(displs[numProcs] * sizeof(PetscInt), &points);CHKERRQ(ierr);
31350447884eSMatthew G. Knepley         /* TODO We should switch to using binary search if the label is a lot smaller than partitions */
3136552f7358SJed Brown         for (proc = 0; proc < numProcs; ++proc) {
31370447884eSMatthew G. Knepley           PetscInt dof, off;
3138552f7358SJed Brown 
3139552f7358SJed Brown           ierr = PetscSectionGetDof(partSection, proc, &dof);CHKERRQ(ierr);
3140552f7358SJed Brown           ierr = PetscSectionGetOffset(partSection, proc, &off);CHKERRQ(ierr);
31410447884eSMatthew G. Knepley           for (s = 0; s < next->numStrata; ++s) {
31420447884eSMatthew G. Knepley             PetscInt lStart = next->stratumOffsets[s], lEnd = next->stratumOffsets[s]+next->stratumSizes[s];
31430447884eSMatthew G. Knepley             PetscInt pStart = off,                     pEnd = off+dof;
31440447884eSMatthew G. Knepley 
31450447884eSMatthew G. Knepley             while (pStart < pEnd && lStart < lEnd) {
31460447884eSMatthew G. Knepley               if (partArray[pStart] > next->points[lStart]) {
31470447884eSMatthew G. Knepley                 ++lStart;
31480447884eSMatthew G. Knepley               } else if (next->points[lStart] > partArray[pStart]) {
31490447884eSMatthew G. Knepley                 ++pStart;
31500447884eSMatthew G. Knepley               } else {
31510447884eSMatthew G. Knepley                 points[offsets[proc]++] = next->points[lStart];
31520447884eSMatthew G. Knepley                 ++pStart; ++lStart;
3153552f7358SJed Brown               }
3154552f7358SJed Brown             }
3155552f7358SJed Brown           }
3156552f7358SJed Brown         }
3157552f7358SJed Brown       }
3158552f7358SJed Brown       ierr = PetscMalloc(newLabel->stratumOffsets[newLabel->numStrata] * sizeof(PetscInt), &newLabel->points);CHKERRQ(ierr);
3159552f7358SJed Brown       ierr = MPI_Scatterv(points, sendcnts, displs, MPIU_INT, newLabel->points, newLabel->stratumOffsets[newLabel->numStrata], MPIU_INT, 0, comm);CHKERRQ(ierr);
3160552f7358SJed Brown       ierr = PetscFree(points);CHKERRQ(ierr);
3161552f7358SJed Brown       ierr = PetscFree3(sendcnts,offsets,displs);CHKERRQ(ierr);
3162552f7358SJed Brown       ierr = PetscFree(stratumSizes);CHKERRQ(ierr);
3163552f7358SJed Brown       /* Renumber points */
31640298fd71SBarry Smith       ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newLabel->stratumOffsets[newLabel->numStrata], newLabel->points, NULL, newLabel->points);CHKERRQ(ierr);
3165552f7358SJed Brown       /* Sort points */
3166552f7358SJed Brown       for (s = 0; s < newLabel->numStrata; ++s) {
3167552f7358SJed Brown         ierr = PetscSortInt(newLabel->stratumSizes[s], &newLabel->points[newLabel->stratumOffsets[s]]);CHKERRQ(ierr);
3168552f7358SJed Brown       }
3169552f7358SJed Brown       /* Insert into list */
31700d644c17SKarl Rupp       if (newNext) newNext->next = newLabel;
31710d644c17SKarl Rupp       else pmesh->labels = newLabel;
3172552f7358SJed Brown       newNext = newLabel;
31730d644c17SKarl Rupp       if (!rank) next = next->next;
3174552f7358SJed Brown     }
3175552f7358SJed Brown   }
3176b96ba592SMatthew G. Knepley   ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr);
31775a9d0af9SMatthew G. Knepley   /* Setup hybrid structure */
31785a9d0af9SMatthew G. Knepley   {
31795a9d0af9SMatthew G. Knepley     const PetscInt *gpoints;
31805a9d0af9SMatthew G. Knepley     PetscInt        depth, n, d;
31815a9d0af9SMatthew G. Knepley 
31825a9d0af9SMatthew G. Knepley     for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];}
31835a9d0af9SMatthew G. Knepley     ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr);
31845a9d0af9SMatthew G. Knepley     ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr);
31855a9d0af9SMatthew G. Knepley     ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr);
31865a9d0af9SMatthew G. Knepley     ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
31875a9d0af9SMatthew G. Knepley     for (d = 0; d <= dim; ++d) {
31885a9d0af9SMatthew G. Knepley       PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p;
31895a9d0af9SMatthew G. Knepley 
31905a9d0af9SMatthew G. Knepley       if (pmax < 0) continue;
31915a9d0af9SMatthew G. Knepley       ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr);
3192*6dfbe1fcSMatthew G. Knepley       ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr);
31935a9d0af9SMatthew G. Knepley       ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr);
31945a9d0af9SMatthew G. Knepley       for (p = 0; p < n; ++p) {
31955a9d0af9SMatthew G. Knepley         const PetscInt point = gpoints[p];
31965a9d0af9SMatthew G. Knepley 
31975a9d0af9SMatthew G. Knepley         if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax;
31985a9d0af9SMatthew G. Knepley       }
31995a9d0af9SMatthew G. Knepley       if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax;
32005a9d0af9SMatthew G. Knepley       else            pmesh->hybridPointMax[d] = -1;
32015a9d0af9SMatthew G. Knepley     }
32025a9d0af9SMatthew G. Knepley     ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr);
32035a9d0af9SMatthew G. Knepley   }
3204552f7358SJed Brown   /* Cleanup Partition */
3205552f7358SJed Brown   ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr);
3206552f7358SJed Brown   ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr);
3207552f7358SJed Brown   ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr);
3208552f7358SJed Brown   ierr = ISDestroy(&part);CHKERRQ(ierr);
3209552f7358SJed Brown   /* Create point SF for parallel mesh */
3210b96ba592SMatthew G. Knepley   ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr);
3211552f7358SJed Brown   {
3212552f7358SJed Brown     const PetscInt *leaves;
3213552f7358SJed Brown     PetscSFNode    *remotePoints, *rowners, *lowners;
3214552f7358SJed Brown     PetscInt        numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints;
3215552f7358SJed Brown     PetscInt        pStart, pEnd;
3216552f7358SJed Brown 
3217552f7358SJed Brown     ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr);
32180298fd71SBarry Smith     ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr);
3219552f7358SJed Brown     ierr = PetscMalloc2(numRoots,PetscSFNode,&rowners,numLeaves,PetscSFNode,&lowners);CHKERRQ(ierr);
3220552f7358SJed Brown     for (p=0; p<numRoots; p++) {
3221552f7358SJed Brown       rowners[p].rank  = -1;
3222552f7358SJed Brown       rowners[p].index = -1;
3223552f7358SJed Brown     }
3224552f7358SJed Brown     if (origCellPart) {
3225552f7358SJed Brown       /* Make sure cells in the original partition are not assigned to other procs */
3226552f7358SJed Brown       const PetscInt *origCells;
3227552f7358SJed Brown 
3228552f7358SJed Brown       ierr = ISGetIndices(origCellPart, &origCells);CHKERRQ(ierr);
3229552f7358SJed Brown       for (p = 0; p < numProcs; ++p) {
3230552f7358SJed Brown         PetscInt dof, off, d;
3231552f7358SJed Brown 
3232552f7358SJed Brown         ierr = PetscSectionGetDof(origCellPartSection, p, &dof);CHKERRQ(ierr);
3233552f7358SJed Brown         ierr = PetscSectionGetOffset(origCellPartSection, p, &off);CHKERRQ(ierr);
3234552f7358SJed Brown         for (d = off; d < off+dof; ++d) {
3235552f7358SJed Brown           rowners[origCells[d]].rank = p;
3236552f7358SJed Brown         }
3237552f7358SJed Brown       }
3238552f7358SJed Brown       ierr = ISRestoreIndices(origCellPart, &origCells);CHKERRQ(ierr);
3239552f7358SJed Brown     }
3240552f7358SJed Brown     ierr = ISDestroy(&origCellPart);CHKERRQ(ierr);
3241552f7358SJed Brown     ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr);
3242552f7358SJed Brown 
3243552f7358SJed Brown     ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3244552f7358SJed Brown     ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3245552f7358SJed Brown     for (p = 0; p < numLeaves; ++p) {
3246552f7358SJed Brown       if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */
3247552f7358SJed Brown         lowners[p].rank  = rank;
3248552f7358SJed Brown         lowners[p].index = leaves ? leaves[p] : p;
3249552f7358SJed Brown       } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */
3250552f7358SJed Brown         lowners[p].rank  = -2;
3251552f7358SJed Brown         lowners[p].index = -2;
3252552f7358SJed Brown       }
3253552f7358SJed Brown     }
3254552f7358SJed Brown     for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */
3255552f7358SJed Brown       rowners[p].rank  = -3;
3256552f7358SJed Brown       rowners[p].index = -3;
3257552f7358SJed Brown     }
3258552f7358SJed Brown     ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr);
3259552f7358SJed Brown     ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr);
3260552f7358SJed Brown     ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3261552f7358SJed Brown     ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3262552f7358SJed Brown     for (p = 0; p < numLeaves; ++p) {
3263552f7358SJed Brown       if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed");
3264552f7358SJed Brown       if (lowners[p].rank != rank) ++numGhostPoints;
3265552f7358SJed Brown     }
3266552f7358SJed Brown     ierr = PetscMalloc(numGhostPoints * sizeof(PetscInt),    &ghostPoints);CHKERRQ(ierr);
3267552f7358SJed Brown     ierr = PetscMalloc(numGhostPoints * sizeof(PetscSFNode), &remotePoints);CHKERRQ(ierr);
3268552f7358SJed Brown     for (p = 0, gp = 0; p < numLeaves; ++p) {
3269552f7358SJed Brown       if (lowners[p].rank != rank) {
3270552f7358SJed Brown         ghostPoints[gp]        = leaves ? leaves[p] : p;
3271552f7358SJed Brown         remotePoints[gp].rank  = lowners[p].rank;
3272552f7358SJed Brown         remotePoints[gp].index = lowners[p].index;
3273552f7358SJed Brown         ++gp;
3274552f7358SJed Brown       }
3275552f7358SJed Brown     }
3276552f7358SJed Brown     ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr);
3277552f7358SJed Brown     ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3278552f7358SJed Brown     ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr);
3279552f7358SJed Brown   }
3280b96ba592SMatthew G. Knepley   ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr);
3281552f7358SJed Brown   /* Cleanup */
3282e7ba9e7aSMatthew G. Knepley   if (sf) {*sf = pointSF;}
3283e7ba9e7aSMatthew G. Knepley   else    {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);}
3284552f7358SJed Brown   ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr);
3285552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr);
3286552f7358SJed Brown   PetscFunctionReturn(0);
3287552f7358SJed Brown }
3288552f7358SJed Brown 
32892e1b13c2SMatthew G. Knepley #undef __FUNCT__
32909db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell"
32919db3b87dSMatthew G. Knepley /*@C
32929db3b87dSMatthew G. Knepley   DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched.
32939db3b87dSMatthew G. Knepley 
32949db3b87dSMatthew G. Knepley   Input Parameters:
32959db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell
32969db3b87dSMatthew G. Knepley - cone - The incoming cone
32979db3b87dSMatthew G. Knepley 
32989db3b87dSMatthew G. Knepley   Output Parameter:
32999db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place)
33009db3b87dSMatthew G. Knepley 
33019db3b87dSMatthew G. Knepley   Level: developer
33029db3b87dSMatthew G. Knepley 
33039db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate()
33049db3b87dSMatthew G. Knepley @*/
33059db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[])
33062e1b13c2SMatthew G. Knepley {
33079db3b87dSMatthew G. Knepley   int tmpc;
33082e1b13c2SMatthew G. Knepley 
33092e1b13c2SMatthew G. Knepley   PetscFunctionBegin;
33109db3b87dSMatthew G. Knepley   if (dim != 3) PetscFunctionReturn(0);
33119db3b87dSMatthew G. Knepley   switch (numCorners) {
33129db3b87dSMatthew G. Knepley   case 4:
33131885f254SMatthew G. Knepley     tmpc    = cone[0];
33141885f254SMatthew G. Knepley     cone[0] = cone[1];
33151885f254SMatthew G. Knepley     cone[1] = tmpc;
33169db3b87dSMatthew G. Knepley     break;
33179db3b87dSMatthew G. Knepley   case 8:
33189db3b87dSMatthew G. Knepley     tmpc    = cone[1];
33199db3b87dSMatthew G. Knepley     cone[1] = cone[3];
33209db3b87dSMatthew G. Knepley     cone[3] = tmpc;
33219db3b87dSMatthew G. Knepley     break;
33229db3b87dSMatthew G. Knepley   default: break;
33239db3b87dSMatthew G. Knepley   }
33249db3b87dSMatthew G. Knepley   PetscFunctionReturn(0);
33259db3b87dSMatthew G. Knepley }
33269db3b87dSMatthew G. Knepley 
33279db3b87dSMatthew G. Knepley #undef __FUNCT__
33289db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal"
33299db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */
33309db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[])
33319db3b87dSMatthew G. Knepley {
33329db3b87dSMatthew G. Knepley   PetscInt       bound = numCells*numCorners, coff;
33339db3b87dSMatthew G. Knepley   PetscErrorCode ierr;
33349db3b87dSMatthew G. Knepley 
33359db3b87dSMatthew G. Knepley   PetscFunctionBegin;
33369db3b87dSMatthew G. Knepley   for (coff = 0; coff < bound; coff += numCorners) {
33379db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr);
33382e1b13c2SMatthew G. Knepley   }
33392e1b13c2SMatthew G. Knepley   PetscFunctionReturn(0);
33402e1b13c2SMatthew G. Knepley }
33412e1b13c2SMatthew G. Knepley 
3342519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
3343552f7358SJed Brown #include <triangle.h>
3344552f7358SJed Brown 
3345552f7358SJed Brown #undef __FUNCT__
3346552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle"
33470adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx)
33480adebc6cSBarry Smith {
3349552f7358SJed Brown   PetscFunctionBegin;
3350552f7358SJed Brown   inputCtx->numberofpoints             = 0;
3351552f7358SJed Brown   inputCtx->numberofpointattributes    = 0;
33520298fd71SBarry Smith   inputCtx->pointlist                  = NULL;
33530298fd71SBarry Smith   inputCtx->pointattributelist         = NULL;
33540298fd71SBarry Smith   inputCtx->pointmarkerlist            = NULL;
3355552f7358SJed Brown   inputCtx->numberofsegments           = 0;
33560298fd71SBarry Smith   inputCtx->segmentlist                = NULL;
33570298fd71SBarry Smith   inputCtx->segmentmarkerlist          = NULL;
3358552f7358SJed Brown   inputCtx->numberoftriangleattributes = 0;
33590298fd71SBarry Smith   inputCtx->trianglelist               = NULL;
3360552f7358SJed Brown   inputCtx->numberofholes              = 0;
33610298fd71SBarry Smith   inputCtx->holelist                   = NULL;
3362552f7358SJed Brown   inputCtx->numberofregions            = 0;
33630298fd71SBarry Smith   inputCtx->regionlist                 = NULL;
3364552f7358SJed Brown   PetscFunctionReturn(0);
3365552f7358SJed Brown }
3366552f7358SJed Brown 
3367552f7358SJed Brown #undef __FUNCT__
3368552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle"
33690adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx)
33700adebc6cSBarry Smith {
3371552f7358SJed Brown   PetscFunctionBegin;
3372552f7358SJed Brown   outputCtx->numberofpoints        = 0;
33730298fd71SBarry Smith   outputCtx->pointlist             = NULL;
33740298fd71SBarry Smith   outputCtx->pointattributelist    = NULL;
33750298fd71SBarry Smith   outputCtx->pointmarkerlist       = NULL;
3376552f7358SJed Brown   outputCtx->numberoftriangles     = 0;
33770298fd71SBarry Smith   outputCtx->trianglelist          = NULL;
33780298fd71SBarry Smith   outputCtx->triangleattributelist = NULL;
33790298fd71SBarry Smith   outputCtx->neighborlist          = NULL;
33800298fd71SBarry Smith   outputCtx->segmentlist           = NULL;
33810298fd71SBarry Smith   outputCtx->segmentmarkerlist     = NULL;
3382552f7358SJed Brown   outputCtx->numberofedges         = 0;
33830298fd71SBarry Smith   outputCtx->edgelist              = NULL;
33840298fd71SBarry Smith   outputCtx->edgemarkerlist        = NULL;
3385552f7358SJed Brown   PetscFunctionReturn(0);
3386552f7358SJed Brown }
3387552f7358SJed Brown 
3388552f7358SJed Brown #undef __FUNCT__
3389552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle"
33900adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx)
33910adebc6cSBarry Smith {
3392552f7358SJed Brown   PetscFunctionBegin;
3393552f7358SJed Brown   free(outputCtx->pointmarkerlist);
3394552f7358SJed Brown   free(outputCtx->edgelist);
3395552f7358SJed Brown   free(outputCtx->edgemarkerlist);
3396552f7358SJed Brown   free(outputCtx->trianglelist);
3397552f7358SJed Brown   free(outputCtx->neighborlist);
3398552f7358SJed Brown   PetscFunctionReturn(0);
3399552f7358SJed Brown }
3400552f7358SJed Brown 
3401552f7358SJed Brown #undef __FUNCT__
3402552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle"
3403552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm)
3404552f7358SJed Brown {
340582f516ccSBarry Smith   MPI_Comm             comm;
3406552f7358SJed Brown   PetscInt             dim              = 2;
3407552f7358SJed Brown   const PetscBool      createConvexHull = PETSC_FALSE;
3408552f7358SJed Brown   const PetscBool      constrained      = PETSC_FALSE;
3409552f7358SJed Brown   struct triangulateio in;
3410552f7358SJed Brown   struct triangulateio out;
3411552f7358SJed Brown   PetscInt             vStart, vEnd, v, eStart, eEnd, e;
3412552f7358SJed Brown   PetscMPIInt          rank;
3413552f7358SJed Brown   PetscErrorCode       ierr;
3414552f7358SJed Brown 
3415552f7358SJed Brown   PetscFunctionBegin;
341682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
3417552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3418552f7358SJed Brown   ierr = InitInput_Triangle(&in);CHKERRQ(ierr);
3419552f7358SJed Brown   ierr = InitOutput_Triangle(&out);CHKERRQ(ierr);
3420552f7358SJed Brown   ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
34210d644c17SKarl Rupp 
3422552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3423552f7358SJed Brown   if (in.numberofpoints > 0) {
3424552f7358SJed Brown     PetscSection coordSection;
3425552f7358SJed Brown     Vec          coordinates;
3426552f7358SJed Brown     PetscScalar *array;
3427552f7358SJed Brown 
3428552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints*dim * sizeof(double), &in.pointlist);CHKERRQ(ierr);
3429552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints * sizeof(int), &in.pointmarkerlist);CHKERRQ(ierr);
3430552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
3431552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
3432552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3433552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3434552f7358SJed Brown       const PetscInt idx = v - vStart;
3435552f7358SJed Brown       PetscInt       off, d;
3436552f7358SJed Brown 
3437552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3438552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3439552f7358SJed Brown         in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3440552f7358SJed Brown       }
3441552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3442552f7358SJed Brown     }
3443552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3444552f7358SJed Brown   }
3445552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr);
3446552f7358SJed Brown   in.numberofsegments = eEnd - eStart;
3447552f7358SJed Brown   if (in.numberofsegments > 0) {
3448552f7358SJed Brown     ierr = PetscMalloc(in.numberofsegments*2 * sizeof(int), &in.segmentlist);CHKERRQ(ierr);
3449552f7358SJed Brown     ierr = PetscMalloc(in.numberofsegments   * sizeof(int), &in.segmentmarkerlist);CHKERRQ(ierr);
3450552f7358SJed Brown     for (e = eStart; e < eEnd; ++e) {
3451552f7358SJed Brown       const PetscInt  idx = e - eStart;
3452552f7358SJed Brown       const PetscInt *cone;
3453552f7358SJed Brown 
3454552f7358SJed Brown       ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr);
34550d644c17SKarl Rupp 
3456552f7358SJed Brown       in.segmentlist[idx*2+0] = cone[0] - vStart;
3457552f7358SJed Brown       in.segmentlist[idx*2+1] = cone[1] - vStart;
34580d644c17SKarl Rupp 
3459552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr);
3460552f7358SJed Brown     }
3461552f7358SJed Brown   }
3462552f7358SJed Brown #if 0 /* Do not currently support holes */
3463552f7358SJed Brown   PetscReal *holeCoords;
3464552f7358SJed Brown   PetscInt   h, d;
3465552f7358SJed Brown 
3466552f7358SJed Brown   ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr);
3467552f7358SJed Brown   if (in.numberofholes > 0) {
3468552f7358SJed Brown     ierr = PetscMalloc(in.numberofholes*dim * sizeof(double), &in.holelist);CHKERRQ(ierr);
3469552f7358SJed Brown     for (h = 0; h < in.numberofholes; ++h) {
3470552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3471552f7358SJed Brown         in.holelist[h*dim+d] = holeCoords[h*dim+d];
3472552f7358SJed Brown       }
3473552f7358SJed Brown     }
3474552f7358SJed Brown   }
3475552f7358SJed Brown #endif
3476552f7358SJed Brown   if (!rank) {
3477552f7358SJed Brown     char args[32];
3478552f7358SJed Brown 
3479552f7358SJed Brown     /* Take away 'Q' for verbose output */
3480552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr);
3481552f7358SJed Brown     if (createConvexHull) {
3482552f7358SJed Brown       ierr = PetscStrcat(args, "c");CHKERRQ(ierr);
3483552f7358SJed Brown     }
3484552f7358SJed Brown     if (constrained) {
3485552f7358SJed Brown       ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr);
3486552f7358SJed Brown     }
34870298fd71SBarry Smith     triangulate(args, &in, &out, NULL);
3488552f7358SJed Brown   }
3489552f7358SJed Brown   ierr = PetscFree(in.pointlist);CHKERRQ(ierr);
3490552f7358SJed Brown   ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr);
3491552f7358SJed Brown   ierr = PetscFree(in.segmentlist);CHKERRQ(ierr);
3492552f7358SJed Brown   ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr);
3493552f7358SJed Brown   ierr = PetscFree(in.holelist);CHKERRQ(ierr);
3494552f7358SJed Brown 
3495552f7358SJed Brown   {
3496552f7358SJed Brown     const PetscInt numCorners  = 3;
3497552f7358SJed Brown     const PetscInt numCells    = out.numberoftriangles;
3498552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3499552f7358SJed Brown     const int     *cells      = out.trianglelist;
3500552f7358SJed Brown     const double  *meshCoords = out.pointlist;
3501552f7358SJed Brown 
35020fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
3503552f7358SJed Brown     /* Set labels */
3504552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3505552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3506552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3507552f7358SJed Brown       }
3508552f7358SJed Brown     }
3509552f7358SJed Brown     if (interpolate) {
3510552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3511552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3512552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3513552f7358SJed Brown           const PetscInt *edges;
3514552f7358SJed Brown           PetscInt        numEdges;
3515552f7358SJed Brown 
3516552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3517552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3518552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3519552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3520552f7358SJed Brown         }
3521552f7358SJed Brown       }
3522552f7358SJed Brown     }
3523552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
3524552f7358SJed Brown   }
3525552f7358SJed Brown #if 0 /* Do not currently support holes */
3526552f7358SJed Brown   ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr);
3527552f7358SJed Brown #endif
3528552f7358SJed Brown   ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr);
3529552f7358SJed Brown   PetscFunctionReturn(0);
3530552f7358SJed Brown }
3531552f7358SJed Brown 
3532552f7358SJed Brown #undef __FUNCT__
3533552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle"
3534552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined)
3535552f7358SJed Brown {
353682f516ccSBarry Smith   MPI_Comm             comm;
3537552f7358SJed Brown   PetscInt             dim  = 2;
3538552f7358SJed Brown   struct triangulateio in;
3539552f7358SJed Brown   struct triangulateio out;
3540552f7358SJed Brown   PetscInt             vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
3541552f7358SJed Brown   PetscMPIInt          rank;
3542552f7358SJed Brown   PetscErrorCode       ierr;
3543552f7358SJed Brown 
3544552f7358SJed Brown   PetscFunctionBegin;
354582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
3546552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3547552f7358SJed Brown   ierr = InitInput_Triangle(&in);CHKERRQ(ierr);
3548552f7358SJed Brown   ierr = InitOutput_Triangle(&out);CHKERRQ(ierr);
3549552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3550552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
3551552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
35520d644c17SKarl Rupp 
3553552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3554552f7358SJed Brown   if (in.numberofpoints > 0) {
3555552f7358SJed Brown     PetscSection coordSection;
3556552f7358SJed Brown     Vec          coordinates;
3557552f7358SJed Brown     PetscScalar *array;
3558552f7358SJed Brown 
3559552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints*dim * sizeof(double), &in.pointlist);CHKERRQ(ierr);
3560552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints * sizeof(int), &in.pointmarkerlist);CHKERRQ(ierr);
3561552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
3562552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3563552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3564552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3565552f7358SJed Brown       const PetscInt idx = v - vStart;
3566552f7358SJed Brown       PetscInt       off, d;
3567552f7358SJed Brown 
3568552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3569552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3570552f7358SJed Brown         in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3571552f7358SJed Brown       }
3572552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3573552f7358SJed Brown     }
3574552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3575552f7358SJed Brown   }
3576552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
35770d644c17SKarl Rupp 
3578552f7358SJed Brown   in.numberofcorners   = 3;
3579552f7358SJed Brown   in.numberoftriangles = cEnd - cStart;
35800d644c17SKarl Rupp 
3581552f7358SJed Brown   in.trianglearealist  = (double*) maxVolumes;
3582552f7358SJed Brown   if (in.numberoftriangles > 0) {
3583552f7358SJed Brown     ierr = PetscMalloc(in.numberoftriangles*in.numberofcorners * sizeof(int), &in.trianglelist);CHKERRQ(ierr);
3584552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3585552f7358SJed Brown       const PetscInt idx      = c - cStart;
35860298fd71SBarry Smith       PetscInt      *closure = NULL;
3587552f7358SJed Brown       PetscInt       closureSize;
3588552f7358SJed Brown 
3589552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3590552f7358SJed 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);
3591552f7358SJed Brown       for (v = 0; v < 3; ++v) {
3592552f7358SJed Brown         in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart;
3593552f7358SJed Brown       }
3594552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3595552f7358SJed Brown     }
3596552f7358SJed Brown   }
3597552f7358SJed Brown   /* TODO: Segment markers are missing on input */
3598552f7358SJed Brown #if 0 /* Do not currently support holes */
3599552f7358SJed Brown   PetscReal *holeCoords;
3600552f7358SJed Brown   PetscInt   h, d;
3601552f7358SJed Brown 
3602552f7358SJed Brown   ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr);
3603552f7358SJed Brown   if (in.numberofholes > 0) {
3604552f7358SJed Brown     ierr = PetscMalloc(in.numberofholes*dim * sizeof(double), &in.holelist);CHKERRQ(ierr);
3605552f7358SJed Brown     for (h = 0; h < in.numberofholes; ++h) {
3606552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3607552f7358SJed Brown         in.holelist[h*dim+d] = holeCoords[h*dim+d];
3608552f7358SJed Brown       }
3609552f7358SJed Brown     }
3610552f7358SJed Brown   }
3611552f7358SJed Brown #endif
3612552f7358SJed Brown   if (!rank) {
3613552f7358SJed Brown     char args[32];
3614552f7358SJed Brown 
3615552f7358SJed Brown     /* Take away 'Q' for verbose output */
3616552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr);
36170298fd71SBarry Smith     triangulate(args, &in, &out, NULL);
3618552f7358SJed Brown   }
3619552f7358SJed Brown   ierr = PetscFree(in.pointlist);CHKERRQ(ierr);
3620552f7358SJed Brown   ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr);
3621552f7358SJed Brown   ierr = PetscFree(in.segmentlist);CHKERRQ(ierr);
3622552f7358SJed Brown   ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr);
3623552f7358SJed Brown   ierr = PetscFree(in.trianglelist);CHKERRQ(ierr);
3624552f7358SJed Brown 
3625552f7358SJed Brown   {
3626552f7358SJed Brown     const PetscInt numCorners  = 3;
3627552f7358SJed Brown     const PetscInt numCells    = out.numberoftriangles;
3628552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3629552f7358SJed Brown     const int     *cells      = out.trianglelist;
3630552f7358SJed Brown     const double  *meshCoords = out.pointlist;
3631552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
3632552f7358SJed Brown 
36330fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
3634552f7358SJed Brown     /* Set labels */
3635552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3636552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3637552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3638552f7358SJed Brown       }
3639552f7358SJed Brown     }
3640552f7358SJed Brown     if (interpolate) {
3641552f7358SJed Brown       PetscInt e;
3642552f7358SJed Brown 
3643552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3644552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3645552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3646552f7358SJed Brown           const PetscInt *edges;
3647552f7358SJed Brown           PetscInt        numEdges;
3648552f7358SJed Brown 
3649552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3650552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3651552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3652552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3653552f7358SJed Brown         }
3654552f7358SJed Brown       }
3655552f7358SJed Brown     }
3656552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
3657552f7358SJed Brown   }
3658552f7358SJed Brown #if 0 /* Do not currently support holes */
3659552f7358SJed Brown   ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr);
3660552f7358SJed Brown #endif
3661552f7358SJed Brown   ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr);
3662552f7358SJed Brown   PetscFunctionReturn(0);
3663552f7358SJed Brown }
3664552f7358SJed Brown #endif
3665552f7358SJed Brown 
3666519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
3667552f7358SJed Brown #include <tetgen.h>
3668552f7358SJed Brown #undef __FUNCT__
3669552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen"
3670552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm)
3671552f7358SJed Brown {
367282f516ccSBarry Smith   MPI_Comm       comm;
3673552f7358SJed Brown   const PetscInt dim  = 3;
3674552f7358SJed Brown   ::tetgenio     in;
3675552f7358SJed Brown   ::tetgenio     out;
3676552f7358SJed Brown   PetscInt       vStart, vEnd, v, fStart, fEnd, f;
3677552f7358SJed Brown   PetscMPIInt    rank;
3678552f7358SJed Brown   PetscErrorCode ierr;
3679552f7358SJed Brown 
3680552f7358SJed Brown   PetscFunctionBegin;
368182f516ccSBarry Smith   ierr              = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
3682552f7358SJed Brown   ierr              = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3683552f7358SJed Brown   ierr              = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
3684552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3685552f7358SJed Brown   if (in.numberofpoints > 0) {
3686552f7358SJed Brown     PetscSection coordSection;
3687552f7358SJed Brown     Vec          coordinates;
3688552f7358SJed Brown     PetscScalar *array;
3689552f7358SJed Brown 
3690552f7358SJed Brown     in.pointlist       = new double[in.numberofpoints*dim];
3691552f7358SJed Brown     in.pointmarkerlist = new int[in.numberofpoints];
36920d644c17SKarl Rupp 
3693552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
3694552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
3695552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3696552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3697552f7358SJed Brown       const PetscInt idx = v - vStart;
3698552f7358SJed Brown       PetscInt       off, d;
3699552f7358SJed Brown 
3700552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
37010d644c17SKarl Rupp       for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d];
3702552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3703552f7358SJed Brown     }
3704552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3705552f7358SJed Brown   }
3706552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr);
37070d644c17SKarl Rupp 
3708552f7358SJed Brown   in.numberoffacets = fEnd - fStart;
3709552f7358SJed Brown   if (in.numberoffacets > 0) {
3710552f7358SJed Brown     in.facetlist       = new tetgenio::facet[in.numberoffacets];
3711552f7358SJed Brown     in.facetmarkerlist = new int[in.numberoffacets];
3712552f7358SJed Brown     for (f = fStart; f < fEnd; ++f) {
3713552f7358SJed Brown       const PetscInt idx     = f - fStart;
37140298fd71SBarry Smith       PetscInt      *points = NULL, numPoints, p, numVertices = 0, v;
3715552f7358SJed Brown 
3716552f7358SJed Brown       in.facetlist[idx].numberofpolygons = 1;
3717552f7358SJed Brown       in.facetlist[idx].polygonlist      = new tetgenio::polygon[in.facetlist[idx].numberofpolygons];
3718552f7358SJed Brown       in.facetlist[idx].numberofholes    = 0;
3719552f7358SJed Brown       in.facetlist[idx].holelist         = NULL;
3720552f7358SJed Brown 
3721552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3722552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
3723552f7358SJed Brown         const PetscInt point = points[p];
37240d644c17SKarl Rupp         if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point;
3725552f7358SJed Brown       }
3726552f7358SJed Brown 
3727552f7358SJed Brown       tetgenio::polygon *poly = in.facetlist[idx].polygonlist;
3728552f7358SJed Brown       poly->numberofvertices = numVertices;
3729552f7358SJed Brown       poly->vertexlist       = new int[poly->numberofvertices];
3730552f7358SJed Brown       for (v = 0; v < numVertices; ++v) {
3731552f7358SJed Brown         const PetscInt vIdx = points[v] - vStart;
3732552f7358SJed Brown         poly->vertexlist[v] = vIdx;
3733552f7358SJed Brown       }
3734552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr);
3735552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3736552f7358SJed Brown     }
3737552f7358SJed Brown   }
3738552f7358SJed Brown   if (!rank) {
3739552f7358SJed Brown     char args[32];
3740552f7358SJed Brown 
3741552f7358SJed Brown     /* Take away 'Q' for verbose output */
3742552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr);
3743552f7358SJed Brown     ::tetrahedralize(args, &in, &out);
3744552f7358SJed Brown   }
3745552f7358SJed Brown   {
3746552f7358SJed Brown     const PetscInt numCorners  = 4;
3747552f7358SJed Brown     const PetscInt numCells    = out.numberoftetrahedra;
3748552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3749552f7358SJed Brown     const double   *meshCoords = out.pointlist;
37501d4b4d7bSJed Brown     int            *cells      = out.tetrahedronlist;
3751552f7358SJed Brown 
37529db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
37530fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
3754552f7358SJed Brown     /* Set labels */
3755552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3756552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3757552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3758552f7358SJed Brown       }
3759552f7358SJed Brown     }
3760552f7358SJed Brown     if (interpolate) {
3761552f7358SJed Brown       PetscInt e;
3762552f7358SJed Brown 
3763552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3764552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3765552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3766552f7358SJed Brown           const PetscInt *edges;
3767552f7358SJed Brown           PetscInt        numEdges;
3768552f7358SJed Brown 
3769552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3770552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3771552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3772552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3773552f7358SJed Brown         }
3774552f7358SJed Brown       }
3775552f7358SJed Brown       for (f = 0; f < out.numberoftrifaces; f++) {
3776552f7358SJed Brown         if (out.trifacemarkerlist[f]) {
3777552f7358SJed Brown           const PetscInt  vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells};
3778552f7358SJed Brown           const PetscInt *faces;
3779552f7358SJed Brown           PetscInt        numFaces;
3780552f7358SJed Brown 
3781552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3782552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
3783552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr);
3784552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3785552f7358SJed Brown         }
3786552f7358SJed Brown       }
3787552f7358SJed Brown     }
3788552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
3789552f7358SJed Brown   }
3790552f7358SJed Brown   PetscFunctionReturn(0);
3791552f7358SJed Brown }
3792552f7358SJed Brown 
3793552f7358SJed Brown #undef __FUNCT__
3794552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen"
3795552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined)
3796552f7358SJed Brown {
379782f516ccSBarry Smith   MPI_Comm       comm;
3798552f7358SJed Brown   const PetscInt dim  = 3;
3799552f7358SJed Brown   ::tetgenio     in;
3800552f7358SJed Brown   ::tetgenio     out;
3801552f7358SJed Brown   PetscInt       vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
3802552f7358SJed Brown   PetscMPIInt    rank;
3803552f7358SJed Brown   PetscErrorCode ierr;
3804552f7358SJed Brown 
3805552f7358SJed Brown   PetscFunctionBegin;
380682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
3807552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3808552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3809552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
3810552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
38110d644c17SKarl Rupp 
3812552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3813552f7358SJed Brown   if (in.numberofpoints > 0) {
3814552f7358SJed Brown     PetscSection coordSection;
3815552f7358SJed Brown     Vec          coordinates;
3816552f7358SJed Brown     PetscScalar *array;
3817552f7358SJed Brown 
3818552f7358SJed Brown     in.pointlist       = new double[in.numberofpoints*dim];
3819552f7358SJed Brown     in.pointmarkerlist = new int[in.numberofpoints];
38200d644c17SKarl Rupp 
3821552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
3822552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3823552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3824552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3825552f7358SJed Brown       const PetscInt idx = v - vStart;
3826552f7358SJed Brown       PetscInt       off, d;
3827552f7358SJed Brown 
3828552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
38290d644c17SKarl Rupp       for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d];
3830552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3831552f7358SJed Brown     }
3832552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3833552f7358SJed Brown   }
3834552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
38350d644c17SKarl Rupp 
3836552f7358SJed Brown   in.numberofcorners       = 4;
3837552f7358SJed Brown   in.numberoftetrahedra    = cEnd - cStart;
3838552f7358SJed Brown   in.tetrahedronvolumelist = (double*) maxVolumes;
3839552f7358SJed Brown   if (in.numberoftetrahedra > 0) {
3840552f7358SJed Brown     in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners];
3841552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3842552f7358SJed Brown       const PetscInt idx      = c - cStart;
38430298fd71SBarry Smith       PetscInt      *closure = NULL;
3844552f7358SJed Brown       PetscInt       closureSize;
3845552f7358SJed Brown 
3846552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3847552f7358SJed 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);
3848552f7358SJed Brown       for (v = 0; v < 4; ++v) {
3849552f7358SJed Brown         in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart;
3850552f7358SJed Brown       }
3851552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3852552f7358SJed Brown     }
3853552f7358SJed Brown   }
385419436ca2SJed Brown   /* TODO: Put in boundary faces with markers */
3855552f7358SJed Brown   if (!rank) {
3856552f7358SJed Brown     char args[32];
3857552f7358SJed Brown 
3858552f7358SJed Brown     /* Take away 'Q' for verbose output */
385919436ca2SJed Brown     /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */
3860552f7358SJed Brown     ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr);
3861552f7358SJed Brown     ::tetrahedralize(args, &in, &out);
3862552f7358SJed Brown   }
3863552f7358SJed Brown   in.tetrahedronvolumelist = NULL;
3864552f7358SJed Brown 
3865552f7358SJed Brown   {
3866552f7358SJed Brown     const PetscInt numCorners  = 4;
3867552f7358SJed Brown     const PetscInt numCells    = out.numberoftetrahedra;
3868552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3869552f7358SJed Brown     const double   *meshCoords = out.pointlist;
38701d4b4d7bSJed Brown     int            *cells      = out.tetrahedronlist;
38711d4b4d7bSJed Brown 
3872552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
3873552f7358SJed Brown 
38749db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
38750fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
3876552f7358SJed Brown     /* Set labels */
3877552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3878552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3879552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3880552f7358SJed Brown       }
3881552f7358SJed Brown     }
3882552f7358SJed Brown     if (interpolate) {
3883552f7358SJed Brown       PetscInt e, f;
3884552f7358SJed Brown 
3885552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3886552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3887552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3888552f7358SJed Brown           const PetscInt *edges;
3889552f7358SJed Brown           PetscInt        numEdges;
3890552f7358SJed Brown 
3891552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3892552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3893552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3894552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3895552f7358SJed Brown         }
3896552f7358SJed Brown       }
3897552f7358SJed Brown       for (f = 0; f < out.numberoftrifaces; f++) {
3898552f7358SJed Brown         if (out.trifacemarkerlist[f]) {
3899552f7358SJed Brown           const PetscInt  vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells};
3900552f7358SJed Brown           const PetscInt *faces;
3901552f7358SJed Brown           PetscInt        numFaces;
3902552f7358SJed Brown 
3903552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3904552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
3905552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr);
3906552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3907552f7358SJed Brown         }
3908552f7358SJed Brown       }
3909552f7358SJed Brown     }
3910552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
3911552f7358SJed Brown   }
3912552f7358SJed Brown   PetscFunctionReturn(0);
3913552f7358SJed Brown }
3914552f7358SJed Brown #endif
3915552f7358SJed Brown 
3916519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
3917552f7358SJed Brown #include "ctetgen.h"
3918552f7358SJed Brown 
3919552f7358SJed Brown #undef __FUNCT__
3920552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen"
3921552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm)
3922552f7358SJed Brown {
392382f516ccSBarry Smith   MPI_Comm       comm;
3924552f7358SJed Brown   const PetscInt dim  = 3;
3925552f7358SJed Brown   PLC           *in, *out;
3926552f7358SJed Brown   PetscInt       verbose = 0, vStart, vEnd, v, fStart, fEnd, f;
3927552f7358SJed Brown   PetscMPIInt    rank;
3928552f7358SJed Brown   PetscErrorCode ierr;
3929552f7358SJed Brown 
3930552f7358SJed Brown   PetscFunctionBegin;
393182f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
39320298fd71SBarry Smith   ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr);
3933552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3934552f7358SJed Brown   ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
3935552f7358SJed Brown   ierr = PLCCreate(&in);CHKERRQ(ierr);
3936552f7358SJed Brown   ierr = PLCCreate(&out);CHKERRQ(ierr);
39370d644c17SKarl Rupp 
3938552f7358SJed Brown   in->numberofpoints = vEnd - vStart;
3939552f7358SJed Brown   if (in->numberofpoints > 0) {
3940552f7358SJed Brown     PetscSection coordSection;
3941552f7358SJed Brown     Vec          coordinates;
3942552f7358SJed Brown     PetscScalar *array;
3943552f7358SJed Brown 
3944552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints*dim * sizeof(PetscReal), &in->pointlist);CHKERRQ(ierr);
3945552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints     * sizeof(int),       &in->pointmarkerlist);CHKERRQ(ierr);
3946552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
3947552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
3948552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3949552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3950552f7358SJed Brown       const PetscInt idx = v - vStart;
3951552f7358SJed Brown       PetscInt       off, d, m;
3952552f7358SJed Brown 
3953552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3954552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3955552f7358SJed Brown         in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3956552f7358SJed Brown       }
3957552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr);
39580d644c17SKarl Rupp 
3959552f7358SJed Brown       in->pointmarkerlist[idx] = (int) m;
3960552f7358SJed Brown     }
3961552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3962552f7358SJed Brown   }
3963552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr);
39640d644c17SKarl Rupp 
3965552f7358SJed Brown   in->numberoffacets = fEnd - fStart;
3966552f7358SJed Brown   if (in->numberoffacets > 0) {
3967552f7358SJed Brown     ierr = PetscMalloc(in->numberoffacets * sizeof(facet), &in->facetlist);CHKERRQ(ierr);
3968552f7358SJed Brown     ierr = PetscMalloc(in->numberoffacets * sizeof(int),   &in->facetmarkerlist);CHKERRQ(ierr);
3969552f7358SJed Brown     for (f = fStart; f < fEnd; ++f) {
3970552f7358SJed Brown       const PetscInt idx     = f - fStart;
39710298fd71SBarry Smith       PetscInt      *points = NULL, numPoints, p, numVertices = 0, v, m;
3972552f7358SJed Brown       polygon       *poly;
3973552f7358SJed Brown 
3974552f7358SJed Brown       in->facetlist[idx].numberofpolygons = 1;
39750d644c17SKarl Rupp 
3976552f7358SJed Brown       ierr = PetscMalloc(in->facetlist[idx].numberofpolygons * sizeof(polygon), &in->facetlist[idx].polygonlist);CHKERRQ(ierr);
39770d644c17SKarl Rupp 
3978552f7358SJed Brown       in->facetlist[idx].numberofholes    = 0;
39790298fd71SBarry Smith       in->facetlist[idx].holelist         = NULL;
3980552f7358SJed Brown 
3981552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3982552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
3983552f7358SJed Brown         const PetscInt point = points[p];
39840d644c17SKarl Rupp         if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point;
3985552f7358SJed Brown       }
3986552f7358SJed Brown 
3987552f7358SJed Brown       poly                   = in->facetlist[idx].polygonlist;
3988552f7358SJed Brown       poly->numberofvertices = numVertices;
3989552f7358SJed Brown       ierr                   = PetscMalloc(poly->numberofvertices * sizeof(int), &poly->vertexlist);CHKERRQ(ierr);
3990552f7358SJed Brown       for (v = 0; v < numVertices; ++v) {
3991552f7358SJed Brown         const PetscInt vIdx = points[v] - vStart;
3992552f7358SJed Brown         poly->vertexlist[v] = vIdx;
3993552f7358SJed Brown       }
3994552f7358SJed Brown       ierr                     = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr);
3995552f7358SJed Brown       in->facetmarkerlist[idx] = (int) m;
3996552f7358SJed Brown       ierr                     = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3997552f7358SJed Brown     }
3998552f7358SJed Brown   }
3999552f7358SJed Brown   if (!rank) {
4000552f7358SJed Brown     TetGenOpts t;
4001552f7358SJed Brown 
4002552f7358SJed Brown     ierr        = TetGenOptsInitialize(&t);CHKERRQ(ierr);
4003552f7358SJed Brown     t.in        = boundary; /* Should go away */
4004552f7358SJed Brown     t.plc       = 1;
4005552f7358SJed Brown     t.quality   = 1;
4006552f7358SJed Brown     t.edgesout  = 1;
4007552f7358SJed Brown     t.zeroindex = 1;
4008552f7358SJed Brown     t.quiet     = 1;
4009552f7358SJed Brown     t.verbose   = verbose;
4010552f7358SJed Brown     ierr        = TetGenCheckOpts(&t);CHKERRQ(ierr);
4011552f7358SJed Brown     ierr        = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr);
4012552f7358SJed Brown   }
4013552f7358SJed Brown   {
4014552f7358SJed Brown     const PetscInt numCorners  = 4;
4015552f7358SJed Brown     const PetscInt numCells    = out->numberoftetrahedra;
4016552f7358SJed Brown     const PetscInt numVertices = out->numberofpoints;
4017552f7358SJed Brown     const double   *meshCoords = out->pointlist;
40181d4b4d7bSJed Brown     int            *cells      = out->tetrahedronlist;
4019552f7358SJed Brown 
40209db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
40210fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
4022552f7358SJed Brown     /* Set labels */
4023552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
4024552f7358SJed Brown       if (out->pointmarkerlist[v]) {
4025552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr);
4026552f7358SJed Brown       }
4027552f7358SJed Brown     }
4028552f7358SJed Brown     if (interpolate) {
4029552f7358SJed Brown       PetscInt e;
4030552f7358SJed Brown 
4031552f7358SJed Brown       for (e = 0; e < out->numberofedges; e++) {
4032552f7358SJed Brown         if (out->edgemarkerlist[e]) {
4033552f7358SJed Brown           const PetscInt  vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells};
4034552f7358SJed Brown           const PetscInt *edges;
4035552f7358SJed Brown           PetscInt        numEdges;
4036552f7358SJed Brown 
4037552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4038552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
4039552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr);
4040552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4041552f7358SJed Brown         }
4042552f7358SJed Brown       }
4043552f7358SJed Brown       for (f = 0; f < out->numberoftrifaces; f++) {
4044552f7358SJed Brown         if (out->trifacemarkerlist[f]) {
4045552f7358SJed Brown           const PetscInt  vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells};
4046552f7358SJed Brown           const PetscInt *faces;
4047552f7358SJed Brown           PetscInt        numFaces;
4048552f7358SJed Brown 
4049552f7358SJed Brown           ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4050552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
4051552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr);
4052552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4053552f7358SJed Brown         }
4054552f7358SJed Brown       }
4055552f7358SJed Brown     }
4056552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
4057552f7358SJed Brown   }
4058552f7358SJed Brown 
4059552f7358SJed Brown   ierr = PLCDestroy(&in);CHKERRQ(ierr);
4060552f7358SJed Brown   ierr = PLCDestroy(&out);CHKERRQ(ierr);
4061552f7358SJed Brown   PetscFunctionReturn(0);
4062552f7358SJed Brown }
4063552f7358SJed Brown 
4064552f7358SJed Brown #undef __FUNCT__
4065552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen"
4066552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined)
4067552f7358SJed Brown {
406882f516ccSBarry Smith   MPI_Comm       comm;
4069552f7358SJed Brown   const PetscInt dim  = 3;
4070552f7358SJed Brown   PLC           *in, *out;
4071552f7358SJed Brown   PetscInt       verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
4072552f7358SJed Brown   PetscMPIInt    rank;
4073552f7358SJed Brown   PetscErrorCode ierr;
4074552f7358SJed Brown 
4075552f7358SJed Brown   PetscFunctionBegin;
407682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
40770298fd71SBarry Smith   ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr);
4078552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
4079552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
4080552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
4081552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
4082552f7358SJed Brown   ierr = PLCCreate(&in);CHKERRQ(ierr);
4083552f7358SJed Brown   ierr = PLCCreate(&out);CHKERRQ(ierr);
40840d644c17SKarl Rupp 
4085552f7358SJed Brown   in->numberofpoints = vEnd - vStart;
4086552f7358SJed Brown   if (in->numberofpoints > 0) {
4087552f7358SJed Brown     PetscSection coordSection;
4088552f7358SJed Brown     Vec          coordinates;
4089552f7358SJed Brown     PetscScalar *array;
4090552f7358SJed Brown 
4091552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints*dim * sizeof(PetscReal), &in->pointlist);CHKERRQ(ierr);
4092552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints     * sizeof(int),       &in->pointmarkerlist);CHKERRQ(ierr);
4093552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
4094552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
4095552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
4096552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
4097552f7358SJed Brown       const PetscInt idx = v - vStart;
4098552f7358SJed Brown       PetscInt       off, d, m;
4099552f7358SJed Brown 
4100552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
4101552f7358SJed Brown       for (d = 0; d < dim; ++d) {
4102552f7358SJed Brown         in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
4103552f7358SJed Brown       }
4104552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr);
41050d644c17SKarl Rupp 
4106552f7358SJed Brown       in->pointmarkerlist[idx] = (int) m;
4107552f7358SJed Brown     }
4108552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
4109552f7358SJed Brown   }
4110552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
41110d644c17SKarl Rupp 
4112552f7358SJed Brown   in->numberofcorners       = 4;
4113552f7358SJed Brown   in->numberoftetrahedra    = cEnd - cStart;
4114552f7358SJed Brown   in->tetrahedronvolumelist = maxVolumes;
4115552f7358SJed Brown   if (in->numberoftetrahedra > 0) {
4116552f7358SJed Brown     ierr = PetscMalloc(in->numberoftetrahedra*in->numberofcorners * sizeof(int), &in->tetrahedronlist);CHKERRQ(ierr);
4117552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
4118552f7358SJed Brown       const PetscInt idx      = c - cStart;
41190298fd71SBarry Smith       PetscInt      *closure = NULL;
4120552f7358SJed Brown       PetscInt       closureSize;
4121552f7358SJed Brown 
4122552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
4123552f7358SJed 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);
4124552f7358SJed Brown       for (v = 0; v < 4; ++v) {
4125552f7358SJed Brown         in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart;
4126552f7358SJed Brown       }
4127552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
4128552f7358SJed Brown     }
4129552f7358SJed Brown   }
4130552f7358SJed Brown   if (!rank) {
4131552f7358SJed Brown     TetGenOpts t;
4132552f7358SJed Brown 
4133552f7358SJed Brown     ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr);
41340d644c17SKarl Rupp 
4135552f7358SJed Brown     t.in        = dm; /* Should go away */
4136552f7358SJed Brown     t.refine    = 1;
4137552f7358SJed Brown     t.varvolume = 1;
4138552f7358SJed Brown     t.quality   = 1;
4139552f7358SJed Brown     t.edgesout  = 1;
4140552f7358SJed Brown     t.zeroindex = 1;
4141552f7358SJed Brown     t.quiet     = 1;
4142552f7358SJed Brown     t.verbose   = verbose; /* Change this */
41430d644c17SKarl Rupp 
4144552f7358SJed Brown     ierr = TetGenCheckOpts(&t);CHKERRQ(ierr);
4145552f7358SJed Brown     ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr);
4146552f7358SJed Brown   }
4147552f7358SJed Brown   {
4148552f7358SJed Brown     const PetscInt numCorners  = 4;
4149552f7358SJed Brown     const PetscInt numCells    = out->numberoftetrahedra;
4150552f7358SJed Brown     const PetscInt numVertices = out->numberofpoints;
4151552f7358SJed Brown     const double   *meshCoords = out->pointlist;
41521d4b4d7bSJed Brown     int            *cells      = out->tetrahedronlist;
4153552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
4154552f7358SJed Brown 
41559db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
41560fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
4157552f7358SJed Brown     /* Set labels */
4158552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
4159552f7358SJed Brown       if (out->pointmarkerlist[v]) {
4160552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr);
4161552f7358SJed Brown       }
4162552f7358SJed Brown     }
4163552f7358SJed Brown     if (interpolate) {
4164552f7358SJed Brown       PetscInt e, f;
4165552f7358SJed Brown 
4166552f7358SJed Brown       for (e = 0; e < out->numberofedges; e++) {
4167552f7358SJed Brown         if (out->edgemarkerlist[e]) {
4168552f7358SJed Brown           const PetscInt  vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells};
4169552f7358SJed Brown           const PetscInt *edges;
4170552f7358SJed Brown           PetscInt        numEdges;
4171552f7358SJed Brown 
4172552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4173552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
4174552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr);
4175552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4176552f7358SJed Brown         }
4177552f7358SJed Brown       }
4178552f7358SJed Brown       for (f = 0; f < out->numberoftrifaces; f++) {
4179552f7358SJed Brown         if (out->trifacemarkerlist[f]) {
4180552f7358SJed Brown           const PetscInt  vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells};
4181552f7358SJed Brown           const PetscInt *faces;
4182552f7358SJed Brown           PetscInt        numFaces;
4183552f7358SJed Brown 
4184552f7358SJed Brown           ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4185552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
4186552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr);
4187552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4188552f7358SJed Brown         }
4189552f7358SJed Brown       }
4190552f7358SJed Brown     }
4191552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
4192552f7358SJed Brown   }
4193552f7358SJed Brown   ierr = PLCDestroy(&in);CHKERRQ(ierr);
4194552f7358SJed Brown   ierr = PLCDestroy(&out);CHKERRQ(ierr);
4195552f7358SJed Brown   PetscFunctionReturn(0);
4196552f7358SJed Brown }
4197552f7358SJed Brown #endif
4198552f7358SJed Brown 
4199552f7358SJed Brown #undef __FUNCT__
4200552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate"
4201552f7358SJed Brown /*@C
4202552f7358SJed Brown   DMPlexGenerate - Generates a mesh.
4203552f7358SJed Brown 
4204552f7358SJed Brown   Not Collective
4205552f7358SJed Brown 
4206552f7358SJed Brown   Input Parameters:
4207552f7358SJed Brown + boundary - The DMPlex boundary object
4208552f7358SJed Brown . name - The mesh generation package name
4209552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements
4210552f7358SJed Brown 
4211552f7358SJed Brown   Output Parameter:
4212552f7358SJed Brown . mesh - The DMPlex object
4213552f7358SJed Brown 
4214552f7358SJed Brown   Level: intermediate
4215552f7358SJed Brown 
4216552f7358SJed Brown .keywords: mesh, elements
4217552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine()
4218552f7358SJed Brown @*/
4219552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh)
4220552f7358SJed Brown {
4221552f7358SJed Brown   PetscInt       dim;
4222552f7358SJed Brown   char           genname[1024];
4223552f7358SJed Brown   PetscBool      isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg;
4224552f7358SJed Brown   PetscErrorCode ierr;
4225552f7358SJed Brown 
4226552f7358SJed Brown   PetscFunctionBegin;
4227552f7358SJed Brown   PetscValidHeaderSpecific(boundary, DM_CLASSID, 1);
4228552f7358SJed Brown   PetscValidLogicalCollectiveBool(boundary, interpolate, 2);
4229552f7358SJed Brown   ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr);
4230552f7358SJed Brown   ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr);
42310d644c17SKarl Rupp   if (flg) name = genname;
4232552f7358SJed Brown   if (name) {
4233552f7358SJed Brown     ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr);
4234552f7358SJed Brown     ierr = PetscStrcmp(name, "tetgen",   &isTetgen);CHKERRQ(ierr);
4235552f7358SJed Brown     ierr = PetscStrcmp(name, "ctetgen",  &isCTetgen);CHKERRQ(ierr);
4236552f7358SJed Brown   }
4237552f7358SJed Brown   switch (dim) {
4238552f7358SJed Brown   case 1:
4239552f7358SJed Brown     if (!name || isTriangle) {
4240519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
4241552f7358SJed Brown       ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr);
4242552f7358SJed Brown #else
424382f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle.");
4244552f7358SJed Brown #endif
424582f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name);
4246552f7358SJed Brown     break;
4247552f7358SJed Brown   case 2:
4248552f7358SJed Brown     if (!name || isCTetgen) {
4249519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
4250552f7358SJed Brown       ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr);
4251552f7358SJed Brown #else
425282f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen.");
4253552f7358SJed Brown #endif
4254552f7358SJed Brown     } else if (isTetgen) {
4255519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
4256552f7358SJed Brown       ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr);
4257552f7358SJed Brown #else
425882f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen.");
4259552f7358SJed Brown #endif
426082f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name);
4261552f7358SJed Brown     break;
4262552f7358SJed Brown   default:
426382f516ccSBarry Smith     SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim);
4264552f7358SJed Brown   }
4265552f7358SJed Brown   PetscFunctionReturn(0);
4266552f7358SJed Brown }
4267552f7358SJed Brown 
4268552f7358SJed Brown #undef __FUNCT__
4269552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex"
4270552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined)
4271552f7358SJed Brown {
4272552f7358SJed Brown   PetscReal      refinementLimit;
4273552f7358SJed Brown   PetscInt       dim, cStart, cEnd;
42740298fd71SBarry Smith   char           genname[1024], *name = NULL;
4275552f7358SJed Brown   PetscBool      isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg;
4276552f7358SJed Brown   PetscErrorCode ierr;
4277552f7358SJed Brown 
4278552f7358SJed Brown   PetscFunctionBegin;
4279552f7358SJed Brown   ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr);
4280552f7358SJed Brown   if (isUniform) {
4281552f7358SJed Brown     CellRefiner cellRefiner;
4282552f7358SJed Brown 
4283509c9b89SMatthew G. Knepley     ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr);
4284509c9b89SMatthew G. Knepley     ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr);
4285552f7358SJed Brown     PetscFunctionReturn(0);
4286552f7358SJed Brown   }
4287552f7358SJed Brown   ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr);
4288552f7358SJed Brown   if (refinementLimit == 0.0) PetscFunctionReturn(0);
4289552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
4290552f7358SJed Brown   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
4291552f7358SJed Brown   ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr);
42920d644c17SKarl Rupp   if (flg) name = genname;
4293552f7358SJed Brown   if (name) {
4294552f7358SJed Brown     ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr);
4295552f7358SJed Brown     ierr = PetscStrcmp(name, "tetgen",   &isTetgen);CHKERRQ(ierr);
4296552f7358SJed Brown     ierr = PetscStrcmp(name, "ctetgen",  &isCTetgen);CHKERRQ(ierr);
4297552f7358SJed Brown   }
4298552f7358SJed Brown   switch (dim) {
4299552f7358SJed Brown   case 2:
4300552f7358SJed Brown     if (!name || isTriangle) {
4301519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
4302552f7358SJed Brown       double  *maxVolumes;
4303552f7358SJed Brown       PetscInt c;
4304552f7358SJed Brown 
4305552f7358SJed Brown       ierr = PetscMalloc((cEnd - cStart) * sizeof(double), &maxVolumes);CHKERRQ(ierr);
43060d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
4307552f7358SJed Brown       ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
43086b0a3334SMatthew G. Knepley       ierr = PetscFree(maxVolumes);CHKERRQ(ierr);
4309552f7358SJed Brown #else
431082f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle.");
4311552f7358SJed Brown #endif
431282f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name);
4313552f7358SJed Brown     break;
4314552f7358SJed Brown   case 3:
4315552f7358SJed Brown     if (!name || isCTetgen) {
4316519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
4317552f7358SJed Brown       PetscReal *maxVolumes;
4318552f7358SJed Brown       PetscInt   c;
4319552f7358SJed Brown 
4320552f7358SJed Brown       ierr = PetscMalloc((cEnd - cStart) * sizeof(PetscReal), &maxVolumes);CHKERRQ(ierr);
43210d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
4322552f7358SJed Brown       ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
4323552f7358SJed Brown #else
432482f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen.");
4325552f7358SJed Brown #endif
4326552f7358SJed Brown     } else if (isTetgen) {
4327519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
4328552f7358SJed Brown       double  *maxVolumes;
4329552f7358SJed Brown       PetscInt c;
4330552f7358SJed Brown 
4331552f7358SJed Brown       ierr = PetscMalloc((cEnd - cStart) * sizeof(double), &maxVolumes);CHKERRQ(ierr);
43320d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
4333552f7358SJed Brown       ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
4334552f7358SJed Brown #else
433582f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen.");
4336552f7358SJed Brown #endif
433782f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name);
4338552f7358SJed Brown     break;
4339552f7358SJed Brown   default:
434082f516ccSBarry Smith     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim);
4341552f7358SJed Brown   }
4342552f7358SJed Brown   PetscFunctionReturn(0);
4343552f7358SJed Brown }
4344552f7358SJed Brown 
4345552f7358SJed Brown #undef __FUNCT__
4346aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel"
4347552f7358SJed Brown /*@
4348aa50250dSMatthew G. Knepley   DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point
4349552f7358SJed Brown 
4350552f7358SJed Brown   Not Collective
4351552f7358SJed Brown 
4352aa50250dSMatthew G. Knepley   Input Parameter:
4353552f7358SJed Brown . dm    - The DMPlex object
4354552f7358SJed Brown 
4355aa50250dSMatthew G. Knepley   Output Parameter:
4356aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth
4357552f7358SJed Brown 
4358552f7358SJed Brown   Level: developer
4359552f7358SJed Brown 
4360aa50250dSMatthew G. Knepley .keywords: mesh, points
4361aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
4362aa50250dSMatthew G. Knepley @*/
4363aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel)
4364aa50250dSMatthew G. Knepley {
4365aa50250dSMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
4366aa50250dSMatthew G. Knepley   PetscErrorCode ierr;
4367aa50250dSMatthew G. Knepley 
4368aa50250dSMatthew G. Knepley   PetscFunctionBegin;
4369aa50250dSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4370aa50250dSMatthew G. Knepley   PetscValidPointer(depthLabel, 2);
4371aa50250dSMatthew G. Knepley   if (!mesh->depthLabel) {
4372aa50250dSMatthew G. Knepley     ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);
4373aa50250dSMatthew G. Knepley   }
4374aa50250dSMatthew G. Knepley   *depthLabel = mesh->depthLabel;
4375aa50250dSMatthew G. Knepley   PetscFunctionReturn(0);
4376aa50250dSMatthew G. Knepley }
4377aa50250dSMatthew G. Knepley 
4378aa50250dSMatthew G. Knepley #undef __FUNCT__
4379aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth"
4380aa50250dSMatthew G. Knepley /*@
4381aa50250dSMatthew G. Knepley   DMPlexGetDepth - Get the depth of the DAG representing this mesh
4382aa50250dSMatthew G. Knepley 
4383aa50250dSMatthew G. Knepley   Not Collective
4384aa50250dSMatthew G. Knepley 
4385aa50250dSMatthew G. Knepley   Input Parameter:
4386aa50250dSMatthew G. Knepley . dm    - The DMPlex object
4387aa50250dSMatthew G. Knepley 
4388aa50250dSMatthew G. Knepley   Output Parameter:
4389aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG
4390aa50250dSMatthew G. Knepley 
4391aa50250dSMatthew G. Knepley   Level: developer
4392552f7358SJed Brown 
4393552f7358SJed Brown .keywords: mesh, points
4394aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
4395552f7358SJed Brown @*/
4396552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth)
4397552f7358SJed Brown {
4398aa50250dSMatthew G. Knepley   DMLabel        label;
4399aa50250dSMatthew G. Knepley   PetscInt       d = 0;
4400552f7358SJed Brown   PetscErrorCode ierr;
4401552f7358SJed Brown 
4402552f7358SJed Brown   PetscFunctionBegin;
4403552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4404552f7358SJed Brown   PetscValidPointer(depth, 2);
4405aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
4406aa50250dSMatthew G. Knepley   if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);}
4407552f7358SJed Brown   *depth = d-1;
4408552f7358SJed Brown   PetscFunctionReturn(0);
4409552f7358SJed Brown }
4410552f7358SJed Brown 
4411552f7358SJed Brown #undef __FUNCT__
4412552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum"
4413552f7358SJed Brown /*@
4414552f7358SJed Brown   DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth.
4415552f7358SJed Brown 
4416552f7358SJed Brown   Not Collective
4417552f7358SJed Brown 
4418552f7358SJed Brown   Input Parameters:
4419552f7358SJed Brown + dm           - The DMPlex object
4420552f7358SJed Brown - stratumValue - The requested depth
4421552f7358SJed Brown 
4422552f7358SJed Brown   Output Parameters:
4423552f7358SJed Brown + start - The first point at this depth
4424552f7358SJed Brown - end   - One beyond the last point at this depth
4425552f7358SJed Brown 
4426552f7358SJed Brown   Level: developer
4427552f7358SJed Brown 
4428552f7358SJed Brown .keywords: mesh, points
4429552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth()
4430552f7358SJed Brown @*/
44310adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
44320adebc6cSBarry Smith {
4433aa50250dSMatthew G. Knepley   DMLabel        label;
4434552f7358SJed Brown   PetscInt       depth;
4435552f7358SJed Brown   PetscErrorCode ierr;
4436552f7358SJed Brown 
4437552f7358SJed Brown   PetscFunctionBegin;
4438552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4439552f7358SJed Brown   if (stratumValue < 0) {
4440552f7358SJed Brown     ierr = DMPlexGetChart(dm, start, end);CHKERRQ(ierr);
4441552f7358SJed Brown     PetscFunctionReturn(0);
4442552f7358SJed Brown   } else {
4443552f7358SJed Brown     PetscInt pStart, pEnd;
4444552f7358SJed Brown 
44450d644c17SKarl Rupp     if (start) *start = 0;
44460d644c17SKarl Rupp     if (end)   *end   = 0;
4447552f7358SJed Brown     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
44480d644c17SKarl Rupp     if (pStart == pEnd) PetscFunctionReturn(0);
4449552f7358SJed Brown   }
4450aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
4451aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
4452552f7358SJed Brown   /* Strata are sorted and contiguous -- In addition, depth/height is either full or 1-level */
4453552f7358SJed Brown   depth = stratumValue;
4454aa50250dSMatthew G. Knepley   if ((depth < 0) || (depth >= label->numStrata)) {
44550d644c17SKarl Rupp     if (start) *start = 0;
44560d644c17SKarl Rupp     if (end)   *end   = 0;
4457552f7358SJed Brown   } else {
4458aa50250dSMatthew G. Knepley     if (start) *start = label->points[label->stratumOffsets[depth]];
4459aa50250dSMatthew G. Knepley     if (end)   *end   = label->points[label->stratumOffsets[depth]+label->stratumSizes[depth]-1]+1;
4460552f7358SJed Brown   }
4461552f7358SJed Brown   PetscFunctionReturn(0);
4462552f7358SJed Brown }
4463552f7358SJed Brown 
4464552f7358SJed Brown #undef __FUNCT__
4465552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum"
4466552f7358SJed Brown /*@
4467552f7358SJed Brown   DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height.
4468552f7358SJed Brown 
4469552f7358SJed Brown   Not Collective
4470552f7358SJed Brown 
4471552f7358SJed Brown   Input Parameters:
4472552f7358SJed Brown + dm           - The DMPlex object
4473552f7358SJed Brown - stratumValue - The requested height
4474552f7358SJed Brown 
4475552f7358SJed Brown   Output Parameters:
4476552f7358SJed Brown + start - The first point at this height
4477552f7358SJed Brown - end   - One beyond the last point at this height
4478552f7358SJed Brown 
4479552f7358SJed Brown   Level: developer
4480552f7358SJed Brown 
4481552f7358SJed Brown .keywords: mesh, points
4482552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth()
4483552f7358SJed Brown @*/
44840adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
44850adebc6cSBarry Smith {
4486aa50250dSMatthew G. Knepley   DMLabel        label;
4487552f7358SJed Brown   PetscInt       depth;
4488552f7358SJed Brown   PetscErrorCode ierr;
4489552f7358SJed Brown 
4490552f7358SJed Brown   PetscFunctionBegin;
4491552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4492552f7358SJed Brown   if (stratumValue < 0) {
4493552f7358SJed Brown     ierr = DMPlexGetChart(dm, start, end);CHKERRQ(ierr);
4494552f7358SJed Brown   } else {
4495552f7358SJed Brown     PetscInt pStart, pEnd;
4496552f7358SJed Brown 
44970d644c17SKarl Rupp     if (start) *start = 0;
44980d644c17SKarl Rupp     if (end)   *end   = 0;
4499552f7358SJed Brown     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
45000d644c17SKarl Rupp     if (pStart == pEnd) PetscFunctionReturn(0);
4501552f7358SJed Brown   }
4502aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
4503aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
4504552f7358SJed Brown   /* Strata are sorted and contiguous -- In addition, depth/height is either full or 1-level */
4505aa50250dSMatthew G. Knepley   depth = label->stratumValues[label->numStrata-1] - stratumValue;
4506aa50250dSMatthew G. Knepley   if ((depth < 0) || (depth >= label->numStrata)) {
45070d644c17SKarl Rupp     if (start) *start = 0;
45080d644c17SKarl Rupp     if (end)   *end   = 0;
4509552f7358SJed Brown   } else {
4510aa50250dSMatthew G. Knepley     if (start) *start = label->points[label->stratumOffsets[depth]];
4511aa50250dSMatthew G. Knepley     if (end)   *end   = label->points[label->stratumOffsets[depth]+label->stratumSizes[depth]-1]+1;
4512552f7358SJed Brown   }
4513552f7358SJed Brown   PetscFunctionReturn(0);
4514552f7358SJed Brown }
4515552f7358SJed Brown 
4516552f7358SJed Brown #undef __FUNCT__
4517552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial"
4518552f7358SJed Brown /* Set the number of dof on each point and separate by fields */
4519a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section)
4520a6dfd86eSKarl Rupp {
4521552f7358SJed Brown   PetscInt      *numDofTot;
4522552f7358SJed Brown   PetscInt       pStart = 0, pEnd = 0;
4523552f7358SJed Brown   PetscInt       p, d, f;
4524552f7358SJed Brown   PetscErrorCode ierr;
4525552f7358SJed Brown 
4526552f7358SJed Brown   PetscFunctionBegin;
4527552f7358SJed Brown   ierr = PetscMalloc((dim+1) * sizeof(PetscInt), &numDofTot);CHKERRQ(ierr);
4528552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
4529552f7358SJed Brown     numDofTot[d] = 0;
45300d644c17SKarl Rupp     for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d];
4531552f7358SJed Brown   }
453282f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
4533552f7358SJed Brown   if (numFields > 0) {
4534552f7358SJed Brown     ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr);
4535552f7358SJed Brown     if (numComp) {
4536552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4537552f7358SJed Brown         ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr);
4538552f7358SJed Brown       }
4539552f7358SJed Brown     }
4540552f7358SJed Brown   }
4541552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
4542552f7358SJed Brown   ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr);
4543552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
4544552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
4545552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
4546552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4547552f7358SJed Brown         ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr);
4548552f7358SJed Brown       }
4549552f7358SJed Brown       ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr);
4550552f7358SJed Brown     }
4551552f7358SJed Brown   }
4552552f7358SJed Brown   ierr = PetscFree(numDofTot);CHKERRQ(ierr);
4553552f7358SJed Brown   PetscFunctionReturn(0);
4554552f7358SJed Brown }
4555552f7358SJed Brown 
4556552f7358SJed Brown #undef __FUNCT__
4557552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof"
4558552f7358SJed Brown /* Set the number of dof on each point and separate by fields
4559552f7358SJed Brown    If constDof is PETSC_DETERMINE, constrain every dof on the point
4560552f7358SJed Brown */
4561a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section)
4562a6dfd86eSKarl Rupp {
4563552f7358SJed Brown   PetscInt       numFields;
4564552f7358SJed Brown   PetscInt       bc;
4565552f7358SJed Brown   PetscErrorCode ierr;
4566552f7358SJed Brown 
4567552f7358SJed Brown   PetscFunctionBegin;
4568552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4569552f7358SJed Brown   for (bc = 0; bc < numBC; ++bc) {
4570552f7358SJed Brown     PetscInt        field = 0;
4571552f7358SJed Brown     const PetscInt *idx;
4572552f7358SJed Brown     PetscInt        n, i;
4573552f7358SJed Brown 
45740d644c17SKarl Rupp     if (numFields) field = bcField[bc];
4575552f7358SJed Brown     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
4576552f7358SJed Brown     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
4577552f7358SJed Brown     for (i = 0; i < n; ++i) {
4578552f7358SJed Brown       const PetscInt p        = idx[i];
4579552f7358SJed Brown       PetscInt       numConst = constDof;
4580552f7358SJed Brown 
4581552f7358SJed Brown       /* Constrain every dof on the point */
4582552f7358SJed Brown       if (numConst < 0) {
4583552f7358SJed Brown         if (numFields) {
4584552f7358SJed Brown           ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr);
4585552f7358SJed Brown         } else {
4586552f7358SJed Brown           ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr);
4587552f7358SJed Brown         }
4588552f7358SJed Brown       }
4589552f7358SJed Brown       if (numFields) {
4590552f7358SJed Brown         ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);
4591552f7358SJed Brown       }
4592552f7358SJed Brown       ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr);
4593552f7358SJed Brown     }
4594552f7358SJed Brown     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
4595552f7358SJed Brown   }
4596552f7358SJed Brown   PetscFunctionReturn(0);
4597552f7358SJed Brown }
4598552f7358SJed Brown 
4599552f7358SJed Brown #undef __FUNCT__
4600552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll"
4601552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
46020adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section)
46030adebc6cSBarry Smith {
4604552f7358SJed Brown   PetscInt      *maxConstraints;
4605552f7358SJed Brown   PetscInt       numFields, f, pStart = 0, pEnd = 0, p;
4606552f7358SJed Brown   PetscErrorCode ierr;
4607552f7358SJed Brown 
4608552f7358SJed Brown   PetscFunctionBegin;
4609552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4610552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4611552f7358SJed Brown   ierr = PetscMalloc((numFields+1) * sizeof(PetscInt), &maxConstraints);CHKERRQ(ierr);
46120d644c17SKarl Rupp   for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0;
4613552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
4614552f7358SJed Brown     PetscInt cdof;
4615552f7358SJed Brown 
4616552f7358SJed Brown     if (numFields) {
4617552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4618552f7358SJed Brown         ierr              = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr);
4619552f7358SJed Brown         maxConstraints[f] = PetscMax(maxConstraints[f], cdof);
4620552f7358SJed Brown       }
4621552f7358SJed Brown     } else {
4622552f7358SJed Brown       ierr              = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
4623552f7358SJed Brown       maxConstraints[0] = PetscMax(maxConstraints[0], cdof);
4624552f7358SJed Brown     }
4625552f7358SJed Brown   }
4626552f7358SJed Brown   for (f = 0; f < numFields; ++f) {
4627552f7358SJed Brown     maxConstraints[numFields] += maxConstraints[f];
4628552f7358SJed Brown   }
4629552f7358SJed Brown   if (maxConstraints[numFields]) {
4630552f7358SJed Brown     PetscInt *indices;
4631552f7358SJed Brown 
4632552f7358SJed Brown     ierr = PetscMalloc(maxConstraints[numFields] * sizeof(PetscInt), &indices);CHKERRQ(ierr);
4633552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
4634552f7358SJed Brown       PetscInt cdof, d;
4635552f7358SJed Brown 
4636552f7358SJed Brown       ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
4637552f7358SJed Brown       if (cdof) {
4638552f7358SJed 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]);
4639552f7358SJed Brown         if (numFields) {
4640552f7358SJed Brown           PetscInt numConst = 0, foff = 0;
4641552f7358SJed Brown 
4642552f7358SJed Brown           for (f = 0; f < numFields; ++f) {
4643552f7358SJed Brown             PetscInt cfdof, fdof;
4644552f7358SJed Brown 
4645552f7358SJed Brown             ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
4646552f7358SJed Brown             ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr);
4647552f7358SJed Brown             /* Change constraint numbering from absolute local dof number to field relative local dof number */
46480d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] = d;
4649552f7358SJed Brown             ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr);
46500d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff;
4651552f7358SJed Brown             numConst += cfdof;
4652552f7358SJed Brown             foff     += fdof;
4653552f7358SJed Brown           }
4654552f7358SJed Brown           if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
4655552f7358SJed Brown         } else {
46560d644c17SKarl Rupp           for (d = 0; d < cdof; ++d) indices[d] = d;
4657552f7358SJed Brown         }
4658552f7358SJed Brown         ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
4659552f7358SJed Brown       }
4660552f7358SJed Brown     }
4661552f7358SJed Brown     ierr = PetscFree(indices);CHKERRQ(ierr);
4662552f7358SJed Brown   }
4663552f7358SJed Brown   ierr = PetscFree(maxConstraints);CHKERRQ(ierr);
4664552f7358SJed Brown   PetscFunctionReturn(0);
4665552f7358SJed Brown }
4666552f7358SJed Brown 
4667552f7358SJed Brown #undef __FUNCT__
4668552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField"
4669552f7358SJed Brown /* Set the constrained field indices on each point */
46700adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section)
46710adebc6cSBarry Smith {
4672552f7358SJed Brown   const PetscInt *points, *indices;
4673552f7358SJed Brown   PetscInt        numFields, maxDof, numPoints, p, numConstraints;
4674552f7358SJed Brown   PetscErrorCode  ierr;
4675552f7358SJed Brown 
4676552f7358SJed Brown   PetscFunctionBegin;
4677552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4678552f7358SJed 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);
4679552f7358SJed Brown 
4680552f7358SJed Brown   ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr);
4681552f7358SJed Brown   ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr);
4682552f7358SJed Brown   if (!constraintIndices) {
4683552f7358SJed Brown     PetscInt *idx, i;
4684552f7358SJed Brown 
4685552f7358SJed Brown     ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
4686552f7358SJed Brown     ierr = PetscMalloc(maxDof * sizeof(PetscInt), &idx);CHKERRQ(ierr);
46870d644c17SKarl Rupp     for (i = 0; i < maxDof; ++i) idx[i] = i;
4688552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
4689552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr);
4690552f7358SJed Brown     }
4691552f7358SJed Brown     ierr = PetscFree(idx);CHKERRQ(ierr);
4692552f7358SJed Brown   } else {
4693552f7358SJed Brown     ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr);
4694552f7358SJed Brown     ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr);
4695552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
4696552f7358SJed Brown       PetscInt fcdof;
4697552f7358SJed Brown 
4698552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr);
469982f516ccSBarry 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);
4700552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr);
4701552f7358SJed Brown     }
4702552f7358SJed Brown     ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr);
4703552f7358SJed Brown   }
4704552f7358SJed Brown   ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr);
4705552f7358SJed Brown   PetscFunctionReturn(0);
4706552f7358SJed Brown }
4707552f7358SJed Brown 
4708552f7358SJed Brown #undef __FUNCT__
4709552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices"
4710552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
47110adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section)
47120adebc6cSBarry Smith {
4713552f7358SJed Brown   PetscInt      *indices;
4714552f7358SJed Brown   PetscInt       numFields, maxDof, f, pStart = 0, pEnd = 0, p;
4715552f7358SJed Brown   PetscErrorCode ierr;
4716552f7358SJed Brown 
4717552f7358SJed Brown   PetscFunctionBegin;
4718552f7358SJed Brown   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
4719552f7358SJed Brown   ierr = PetscMalloc(maxDof * sizeof(PetscInt), &indices);CHKERRQ(ierr);
4720552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
472182f516ccSBarry Smith   if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices.");
4722552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4723552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
4724552f7358SJed Brown     PetscInt cdof, d;
4725552f7358SJed Brown 
4726552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
4727552f7358SJed Brown     if (cdof) {
4728552f7358SJed Brown       PetscInt numConst = 0, foff = 0;
4729552f7358SJed Brown 
4730552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4731552f7358SJed Brown         const PetscInt *fcind;
4732552f7358SJed Brown         PetscInt        fdof, fcdof;
4733552f7358SJed Brown 
4734552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
4735552f7358SJed Brown         ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr);
4736552f7358SJed Brown         if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);}
4737552f7358SJed Brown         /* Change constraint numbering from field relative local dof number to absolute local dof number */
47380d644c17SKarl Rupp         for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff;
4739552f7358SJed Brown         foff     += fdof;
4740552f7358SJed Brown         numConst += fcdof;
4741552f7358SJed Brown       }
474282f516ccSBarry Smith       if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
4743552f7358SJed Brown       ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
4744552f7358SJed Brown     }
4745552f7358SJed Brown   }
4746552f7358SJed Brown   ierr = PetscFree(indices);CHKERRQ(ierr);
4747552f7358SJed Brown   PetscFunctionReturn(0);
4748552f7358SJed Brown }
4749552f7358SJed Brown 
4750552f7358SJed Brown #undef __FUNCT__
4751552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection"
4752552f7358SJed Brown /*@C
4753552f7358SJed Brown   DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided.
4754552f7358SJed Brown 
4755552f7358SJed Brown   Not Collective
4756552f7358SJed Brown 
4757552f7358SJed Brown   Input Parameters:
4758552f7358SJed Brown + dm        - The DMPlex object
4759552f7358SJed Brown . dim       - The spatial dimension of the problem
4760552f7358SJed Brown . numFields - The number of fields in the problem
4761552f7358SJed Brown . numComp   - An array of size numFields that holds the number of components for each field
4762552f7358SJed 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
4763552f7358SJed Brown . numBC     - The number of boundary conditions
4764552f7358SJed Brown . bcField   - An array of size numBC giving the field number for each boundry condition
4765552f7358SJed Brown - bcPoints  - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies
4766552f7358SJed Brown 
4767552f7358SJed Brown   Output Parameter:
4768552f7358SJed Brown . section - The PetscSection object
4769552f7358SJed Brown 
4770552f7358SJed 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
4771552f7358SJed Brown   nubmer of dof for field 0 on each edge.
4772552f7358SJed Brown 
4773552f7358SJed Brown   Level: developer
4774552f7358SJed Brown 
47753813dfbdSMatthew G Knepley   Fortran Notes:
47763813dfbdSMatthew G Knepley   A Fortran 90 version is available as DMPlexCreateSectionF90()
47773813dfbdSMatthew G Knepley 
4778552f7358SJed Brown .keywords: mesh, elements
4779552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate()
4780552f7358SJed Brown @*/
4781a6dfd86eSKarl 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)
4782a6dfd86eSKarl Rupp {
4783552f7358SJed Brown   PetscErrorCode ierr;
4784552f7358SJed Brown 
4785552f7358SJed Brown   PetscFunctionBegin;
4786552f7358SJed Brown   ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr);
4787552f7358SJed Brown   ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr);
4788552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
4789552f7358SJed Brown   if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);}
4790552f7358SJed Brown   {
4791552f7358SJed Brown     PetscBool view = PETSC_FALSE;
4792552f7358SJed Brown 
4793552f7358SJed Brown     ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-section_view", &view);CHKERRQ(ierr);
4794552f7358SJed Brown     if (view) {ierr = PetscSectionView(*section, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);}
4795552f7358SJed Brown   }
4796552f7358SJed Brown   PetscFunctionReturn(0);
4797552f7358SJed Brown }
4798552f7358SJed Brown 
4799552f7358SJed Brown #undef __FUNCT__
4800552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex"
48010adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm)
48020adebc6cSBarry Smith {
4803552f7358SJed Brown   PetscSection   section;
4804552f7358SJed Brown   PetscErrorCode ierr;
4805552f7358SJed Brown 
4806552f7358SJed Brown   PetscFunctionBegin;
480738221697SMatthew G. Knepley   ierr = DMClone(dm, cdm);CHKERRQ(ierr);
480882f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
4809552f7358SJed Brown   ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr);
48101d799100SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
4811552f7358SJed Brown   PetscFunctionReturn(0);
4812552f7358SJed Brown }
4813552f7358SJed Brown 
4814552f7358SJed Brown #undef __FUNCT__
4815552f7358SJed Brown #define __FUNCT__ "DMPlexGetCoordinateSection"
4816552f7358SJed Brown /*@
4817552f7358SJed Brown   DMPlexGetCoordinateSection - Retrieve the layout of coordinate values over the mesh.
4818552f7358SJed Brown 
4819552f7358SJed Brown   Not Collective
4820552f7358SJed Brown 
4821552f7358SJed Brown   Input Parameter:
4822552f7358SJed Brown . dm - The DMPlex object
4823552f7358SJed Brown 
4824552f7358SJed Brown   Output Parameter:
4825552f7358SJed Brown . section - The PetscSection object
4826552f7358SJed Brown 
4827552f7358SJed Brown   Level: intermediate
4828552f7358SJed Brown 
4829552f7358SJed Brown .keywords: mesh, coordinates
4830552f7358SJed Brown .seealso: DMGetCoordinateDM(), DMPlexGetDefaultSection(), DMPlexSetDefaultSection()
4831552f7358SJed Brown @*/
48320adebc6cSBarry Smith PetscErrorCode DMPlexGetCoordinateSection(DM dm, PetscSection *section)
48330adebc6cSBarry Smith {
4834552f7358SJed Brown   DM             cdm;
4835552f7358SJed Brown   PetscErrorCode ierr;
4836552f7358SJed Brown 
4837552f7358SJed Brown   PetscFunctionBegin;
4838552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4839552f7358SJed Brown   PetscValidPointer(section, 2);
4840552f7358SJed Brown   ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr);
4841552f7358SJed Brown   ierr = DMGetDefaultSection(cdm, section);CHKERRQ(ierr);
4842552f7358SJed Brown   PetscFunctionReturn(0);
4843552f7358SJed Brown }
4844552f7358SJed Brown 
4845552f7358SJed Brown #undef __FUNCT__
4846552f7358SJed Brown #define __FUNCT__ "DMPlexSetCoordinateSection"
4847552f7358SJed Brown /*@
4848552f7358SJed Brown   DMPlexSetCoordinateSection - Set the layout of coordinate values over the mesh.
4849552f7358SJed Brown 
4850552f7358SJed Brown   Not Collective
4851552f7358SJed Brown 
4852552f7358SJed Brown   Input Parameters:
4853552f7358SJed Brown + dm      - The DMPlex object
4854552f7358SJed Brown - section - The PetscSection object
4855552f7358SJed Brown 
4856552f7358SJed Brown   Level: intermediate
4857552f7358SJed Brown 
4858552f7358SJed Brown .keywords: mesh, coordinates
4859552f7358SJed Brown .seealso: DMPlexGetCoordinateSection(), DMPlexGetDefaultSection(), DMPlexSetDefaultSection()
4860552f7358SJed Brown @*/
48610adebc6cSBarry Smith PetscErrorCode DMPlexSetCoordinateSection(DM dm, PetscSection section)
48620adebc6cSBarry Smith {
4863552f7358SJed Brown   DM             cdm;
4864552f7358SJed Brown   PetscErrorCode ierr;
4865552f7358SJed Brown 
4866552f7358SJed Brown   PetscFunctionBegin;
4867552f7358SJed Brown   PetscValidHeaderSpecific(dm,DM_CLASSID,1);
48681d799100SJed Brown   PetscValidHeaderSpecific(section,PETSC_SECTION_CLASSID,2);
4869552f7358SJed Brown   ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr);
4870552f7358SJed Brown   ierr = DMSetDefaultSection(cdm, section);CHKERRQ(ierr);
4871552f7358SJed Brown   PetscFunctionReturn(0);
4872552f7358SJed Brown }
4873552f7358SJed Brown 
4874552f7358SJed Brown #undef __FUNCT__
4875552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection"
48760adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section)
48770adebc6cSBarry Smith {
4878552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
4879552f7358SJed Brown 
4880552f7358SJed Brown   PetscFunctionBegin;
4881552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4882552f7358SJed Brown   if (section) *section = mesh->coneSection;
4883552f7358SJed Brown   PetscFunctionReturn(0);
4884552f7358SJed Brown }
4885552f7358SJed Brown 
4886552f7358SJed Brown #undef __FUNCT__
48878cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection"
48888cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section)
48898cb4d582SMatthew G. Knepley {
48908cb4d582SMatthew G. Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
48918cb4d582SMatthew G. Knepley 
48928cb4d582SMatthew G. Knepley   PetscFunctionBegin;
48938cb4d582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
48948cb4d582SMatthew G. Knepley   if (section) *section = mesh->supportSection;
48958cb4d582SMatthew G. Knepley   PetscFunctionReturn(0);
48968cb4d582SMatthew G. Knepley }
48978cb4d582SMatthew G. Knepley 
48988cb4d582SMatthew G. Knepley #undef __FUNCT__
4899552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones"
4900a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[])
4901a6dfd86eSKarl Rupp {
4902552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
4903552f7358SJed Brown 
4904552f7358SJed Brown   PetscFunctionBegin;
4905552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4906552f7358SJed Brown   if (cones) *cones = mesh->cones;
4907552f7358SJed Brown   PetscFunctionReturn(0);
4908552f7358SJed Brown }
4909552f7358SJed Brown 
4910552f7358SJed Brown #undef __FUNCT__
4911552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations"
4912a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[])
4913a6dfd86eSKarl Rupp {
4914552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
4915552f7358SJed Brown 
4916552f7358SJed Brown   PetscFunctionBegin;
4917552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4918552f7358SJed Brown   if (coneOrientations) *coneOrientations = mesh->coneOrientations;
4919552f7358SJed Brown   PetscFunctionReturn(0);
4920552f7358SJed Brown }
4921552f7358SJed Brown 
4922552f7358SJed Brown /******************************** FEM Support **********************************/
4923552f7358SJed Brown 
4924552f7358SJed Brown #undef __FUNCT__
4925552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure"
4926552f7358SJed Brown /*@C
4927552f7358SJed Brown   DMPlexVecGetClosure - Get an array of the values on the closure of 'point'
4928552f7358SJed Brown 
4929552f7358SJed Brown   Not collective
4930552f7358SJed Brown 
4931552f7358SJed Brown   Input Parameters:
4932552f7358SJed Brown + dm - The DM
49330298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
4934552f7358SJed Brown . v - The local vector
4935552f7358SJed Brown - point - The sieve point in the DM
4936552f7358SJed Brown 
4937552f7358SJed Brown   Output Parameters:
49380298fd71SBarry Smith + csize - The number of values in the closure, or NULL
4939552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
4940552f7358SJed Brown 
49413813dfbdSMatthew G Knepley   Fortran Notes:
49423813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
49433813dfbdSMatthew G Knepley   include petsc.h90 in your code.
49443813dfbdSMatthew G Knepley 
49453813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
49463813dfbdSMatthew G Knepley 
4947552f7358SJed Brown   Level: intermediate
4948552f7358SJed Brown 
4949552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
4950552f7358SJed Brown @*/
49517c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
4952a6dfd86eSKarl Rupp {
495352744b75SMatthew G. Knepley   PetscSection   clSection;
495452744b75SMatthew G. Knepley   IS             clIndices;
4955552f7358SJed Brown   PetscScalar   *array, *vArray;
49560298fd71SBarry Smith   PetscInt      *points = NULL;
4957552f7358SJed Brown   PetscInt       offsets[32];
49589df71ca4SMatthew G. Knepley   PetscInt       depth, numFields, size = 0, numPoints, pStart, pEnd, p, q, f;
4959552f7358SJed Brown   PetscErrorCode ierr;
4960552f7358SJed Brown 
4961552f7358SJed Brown   PetscFunctionBegin;
4962552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4963552f7358SJed Brown   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
496452744b75SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
496552744b75SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clIndices);CHKERRQ(ierr);
496652744b75SMatthew G. Knepley   if (clSection) {
496752744b75SMatthew G. Knepley     const PetscInt *idx;
496852744b75SMatthew G. Knepley     PetscInt        dof, off;
496952744b75SMatthew G. Knepley 
497052744b75SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
497152744b75SMatthew G. Knepley     if (csize) *csize = dof;
497252744b75SMatthew G. Knepley     if (values) {
497352744b75SMatthew G. Knepley       if (!*values) {
497452744b75SMatthew G. Knepley         ierr = DMGetWorkArray(dm, dof, PETSC_SCALAR, &array);CHKERRQ(ierr);
497552744b75SMatthew G. Knepley         *values = array;
497652744b75SMatthew G. Knepley       } else {
497752744b75SMatthew G. Knepley         array = *values;
497852744b75SMatthew G. Knepley       }
497952744b75SMatthew G. Knepley       ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
498052744b75SMatthew G. Knepley       ierr = ISGetIndices(clIndices, &idx);CHKERRQ(ierr);
498152744b75SMatthew G. Knepley       ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
498252744b75SMatthew G. Knepley       for (p = 0; p < dof; ++p) array[p] = vArray[idx[off+p]];
498352744b75SMatthew G. Knepley       ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
498452744b75SMatthew G. Knepley       ierr = ISRestoreIndices(clIndices, &idx);CHKERRQ(ierr);
498552744b75SMatthew G. Knepley     }
498652744b75SMatthew G. Knepley     PetscFunctionReturn(0);
4987552f7358SJed Brown   }
49885a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
4989552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
49902a3aaacfSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
499182f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
4992552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
49935a1bb5cfSMatthew G. Knepley   if (depth == 1 && numFields < 2) {
49945a1bb5cfSMatthew G. Knepley     const PetscInt *cone, *coneO;
49955a1bb5cfSMatthew G. Knepley 
49965a1bb5cfSMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
49975a1bb5cfSMatthew G. Knepley     ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
49985a1bb5cfSMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
49993f7cbbe7SMatthew G. Knepley     if (!values || !*values) {
50009df71ca4SMatthew G. Knepley       if ((point >= pStart) && (point < pEnd)) {
50019df71ca4SMatthew G. Knepley         PetscInt dof;
50029df71ca4SMatthew G. Knepley         ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
50039df71ca4SMatthew G. Knepley         size += dof;
50049df71ca4SMatthew G. Knepley       }
50059df71ca4SMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
50069df71ca4SMatthew G. Knepley         const PetscInt cp = cone[p];
50072a3aaacfSMatthew G. Knepley         PetscInt       dof;
50085a1bb5cfSMatthew G. Knepley 
50095a1bb5cfSMatthew G. Knepley         if ((cp < pStart) || (cp >= pEnd)) continue;
50102a3aaacfSMatthew G. Knepley         ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
50115a1bb5cfSMatthew G. Knepley         size += dof;
50125a1bb5cfSMatthew G. Knepley       }
50133f7cbbe7SMatthew G. Knepley       if (!values) {
50143f7cbbe7SMatthew G. Knepley         if (csize) *csize = size;
50153f7cbbe7SMatthew G. Knepley         PetscFunctionReturn(0);
50163f7cbbe7SMatthew G. Knepley       }
50175a1bb5cfSMatthew G. Knepley       ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
5018982e9ed1SMatthew G. Knepley     } else {
5019982e9ed1SMatthew G. Knepley       array = *values;
5020982e9ed1SMatthew G. Knepley     }
50219df71ca4SMatthew G. Knepley     size = 0;
50225a1bb5cfSMatthew G. Knepley     ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
50239df71ca4SMatthew G. Knepley     if ((point >= pStart) && (point < pEnd)) {
50249df71ca4SMatthew G. Knepley       PetscInt     dof, off, d;
50259df71ca4SMatthew G. Knepley       PetscScalar *varr;
50269df71ca4SMatthew G. Knepley       ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
50279df71ca4SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
50289df71ca4SMatthew G. Knepley       varr = &vArray[off];
50299df71ca4SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offsets[0]) {
50309df71ca4SMatthew G. Knepley         array[offsets[0]] = varr[d];
50319df71ca4SMatthew G. Knepley       }
50329df71ca4SMatthew G. Knepley       size += dof;
50339df71ca4SMatthew G. Knepley     }
50349df71ca4SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
50359df71ca4SMatthew G. Knepley       const PetscInt cp = cone[p];
50369df71ca4SMatthew G. Knepley       PetscInt       o  = coneO[p];
50375a1bb5cfSMatthew G. Knepley       PetscInt       dof, off, d;
50385a1bb5cfSMatthew G. Knepley       PetscScalar   *varr;
50395a1bb5cfSMatthew G. Knepley 
504052ed52e8SMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) continue;
50415a1bb5cfSMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
50425a1bb5cfSMatthew G. Knepley       ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr);
50435a1bb5cfSMatthew G. Knepley       varr = &vArray[off];
50445a1bb5cfSMatthew G. Knepley       if (o >= 0) {
50455a1bb5cfSMatthew G. Knepley         for (d = 0; d < dof; ++d, ++offsets[0]) {
50465a1bb5cfSMatthew G. Knepley           array[offsets[0]] = varr[d];
50475a1bb5cfSMatthew G. Knepley         }
50485a1bb5cfSMatthew G. Knepley       } else {
50495a1bb5cfSMatthew G. Knepley         for (d = dof-1; d >= 0; --d, ++offsets[0]) {
50505a1bb5cfSMatthew G. Knepley           array[offsets[0]] = varr[d];
50515a1bb5cfSMatthew G. Knepley         }
50525a1bb5cfSMatthew G. Knepley       }
50539df71ca4SMatthew G. Knepley       size += dof;
50545a1bb5cfSMatthew G. Knepley     }
50555a1bb5cfSMatthew G. Knepley     ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
50569df71ca4SMatthew G. Knepley     if (!*values) {
50575a1bb5cfSMatthew G. Knepley       if (csize) *csize = size;
50585a1bb5cfSMatthew G. Knepley       *values = array;
50599df71ca4SMatthew G. Knepley     } else {
50609df71ca4SMatthew G. Knepley       if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
50618c312ff3SMatthew G. Knepley       *csize = size;
50629df71ca4SMatthew G. Knepley     }
50635a1bb5cfSMatthew G. Knepley     PetscFunctionReturn(0);
50645a1bb5cfSMatthew G. Knepley   }
5065552f7358SJed Brown   ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5066552f7358SJed Brown   /* Compress out points not in the section */
5067552f7358SJed Brown   for (p = 0, q = 0; p < numPoints*2; p += 2) {
5068552f7358SJed Brown     if ((points[p] >= pStart) && (points[p] < pEnd)) {
5069552f7358SJed Brown       points[q*2]   = points[p];
5070552f7358SJed Brown       points[q*2+1] = points[p+1];
5071552f7358SJed Brown       ++q;
5072552f7358SJed Brown     }
5073552f7358SJed Brown   }
5074552f7358SJed Brown   numPoints = q;
5075bd6c0d32SMatthew G. Knepley   if (!values || !*values) {
5076552f7358SJed Brown     for (p = 0, size = 0; p < numPoints*2; p += 2) {
5077552f7358SJed Brown       PetscInt dof, 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       size += dof;
5085552f7358SJed Brown     }
5086bd6c0d32SMatthew G. Knepley     if (!values) {
5087648a61deSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5088bd6c0d32SMatthew G. Knepley       if (csize) *csize = size;
5089bd6c0d32SMatthew G. Knepley       PetscFunctionReturn(0);
5090bd6c0d32SMatthew G. Knepley     }
5091d0f6b257SMatthew G. Knepley     ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
5092d0f6b257SMatthew G. Knepley   } else {
5093d0f6b257SMatthew G. Knepley     array = *values;
5094d0f6b257SMatthew G. Knepley   }
50950d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
509682f516ccSBarry Smith   if (numFields && offsets[numFields] != size) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], size);
5097552f7358SJed Brown   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
5098552f7358SJed Brown   for (p = 0; p < numPoints*2; p += 2) {
5099552f7358SJed Brown     PetscInt     o = points[p+1];
5100552f7358SJed Brown     PetscInt     dof, off, d;
5101552f7358SJed Brown     PetscScalar *varr;
5102552f7358SJed Brown 
5103552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5104552f7358SJed Brown     ierr = PetscSectionGetOffset(section, points[p], &off);CHKERRQ(ierr);
5105552f7358SJed Brown     varr = &vArray[off];
5106552f7358SJed Brown     if (numFields) {
5107552f7358SJed Brown       PetscInt fdof, foff, fcomp, f, c;
5108552f7358SJed Brown 
5109552f7358SJed Brown       for (f = 0, foff = 0; f < numFields; ++f) {
5110552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5111552f7358SJed Brown         if (o >= 0) {
5112552f7358SJed Brown           for (d = 0; d < fdof; ++d, ++offsets[f]) {
5113552f7358SJed Brown             array[offsets[f]] = varr[foff+d];
5114552f7358SJed Brown           }
5115552f7358SJed Brown         } else {
5116552f7358SJed Brown           ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5117552f7358SJed Brown           for (d = fdof/fcomp-1; d >= 0; --d) {
5118552f7358SJed Brown             for (c = 0; c < fcomp; ++c, ++offsets[f]) {
5119552f7358SJed Brown               array[offsets[f]] = varr[foff+d*fcomp+c];
5120552f7358SJed Brown             }
5121552f7358SJed Brown           }
5122552f7358SJed Brown         }
5123552f7358SJed Brown         foff += fdof;
5124552f7358SJed Brown       }
5125552f7358SJed Brown     } else {
5126552f7358SJed Brown       if (o >= 0) {
5127552f7358SJed Brown         for (d = 0; d < dof; ++d, ++offsets[0]) {
5128552f7358SJed Brown           array[offsets[0]] = varr[d];
5129552f7358SJed Brown         }
5130552f7358SJed Brown       } else {
5131552f7358SJed Brown         for (d = dof-1; d >= 0; --d, ++offsets[0]) {
5132552f7358SJed Brown           array[offsets[0]] = varr[d];
5133552f7358SJed Brown         }
5134552f7358SJed Brown       }
5135552f7358SJed Brown     }
5136552f7358SJed Brown   }
5137552f7358SJed Brown   ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5138552f7358SJed Brown   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
5139d0f6b257SMatthew G. Knepley   if (!*values) {
5140552f7358SJed Brown     if (csize) *csize = size;
5141552f7358SJed Brown     *values = array;
5142d0f6b257SMatthew G. Knepley   } else {
5143d0f6b257SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
5144d0f6b257SMatthew G. Knepley     *csize = size;
5145d0f6b257SMatthew G. Knepley   }
5146552f7358SJed Brown   PetscFunctionReturn(0);
5147552f7358SJed Brown }
5148552f7358SJed Brown 
5149552f7358SJed Brown #undef __FUNCT__
5150552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure"
5151552f7358SJed Brown /*@C
5152552f7358SJed Brown   DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point'
5153552f7358SJed Brown 
5154552f7358SJed Brown   Not collective
5155552f7358SJed Brown 
5156552f7358SJed Brown   Input Parameters:
5157552f7358SJed Brown + dm - The DM
51580298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
5159552f7358SJed Brown . v - The local vector
5160552f7358SJed Brown . point - The sieve point in the DM
51610298fd71SBarry Smith . csize - The number of values in the closure, or NULL
5162552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
5163552f7358SJed Brown 
51643813dfbdSMatthew G Knepley   Fortran Notes:
51653813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
51663813dfbdSMatthew G Knepley   include petsc.h90 in your code.
51673813dfbdSMatthew G Knepley 
51683813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
51693813dfbdSMatthew G Knepley 
5170552f7358SJed Brown   Level: intermediate
5171552f7358SJed Brown 
5172552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
5173552f7358SJed Brown @*/
51747c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
5175a6dfd86eSKarl Rupp {
5176552f7358SJed Brown   PetscInt       size = 0;
5177552f7358SJed Brown   PetscErrorCode ierr;
5178552f7358SJed Brown 
5179552f7358SJed Brown   PetscFunctionBegin;
5180552f7358SJed Brown   /* Should work without recalculating size */
5181552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr);
5182552f7358SJed Brown   PetscFunctionReturn(0);
5183552f7358SJed Brown }
5184552f7358SJed Brown 
5185552f7358SJed Brown PETSC_STATIC_INLINE void add   (PetscScalar *x, PetscScalar y) {*x += y;}
5186552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x  = y;}
5187552f7358SJed Brown 
5188552f7358SJed Brown #undef __FUNCT__
5189552f7358SJed Brown #define __FUNCT__ "updatePoint_private"
5190552f7358SJed Brown PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5191552f7358SJed Brown {
5192552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
5193552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5194552f7358SJed Brown   PetscScalar    *a;
5195552f7358SJed Brown   PetscInt        off, cind = 0, k;
5196552f7358SJed Brown   PetscErrorCode  ierr;
5197552f7358SJed Brown 
5198552f7358SJed Brown   PetscFunctionBegin;
5199552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
5200552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5201552f7358SJed Brown   a    = &array[off];
5202552f7358SJed Brown   if (!cdof || setBC) {
5203552f7358SJed Brown     if (orientation >= 0) {
5204552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5205552f7358SJed Brown         fuse(&a[k], values[k]);
5206552f7358SJed Brown       }
5207552f7358SJed Brown     } else {
5208552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5209552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
5210552f7358SJed Brown       }
5211552f7358SJed Brown     }
5212552f7358SJed Brown   } else {
5213552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
5214552f7358SJed Brown     if (orientation >= 0) {
5215552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5216552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5217552f7358SJed Brown         fuse(&a[k], values[k]);
5218552f7358SJed Brown       }
5219552f7358SJed Brown     } else {
5220552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5221552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5222552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
5223552f7358SJed Brown       }
5224552f7358SJed Brown     }
5225552f7358SJed Brown   }
5226552f7358SJed Brown   PetscFunctionReturn(0);
5227552f7358SJed Brown }
5228552f7358SJed Brown 
5229552f7358SJed Brown #undef __FUNCT__
5230a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private"
5231a5e93ea8SMatthew G. Knepley PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5232a5e93ea8SMatthew G. Knepley {
5233a5e93ea8SMatthew G. Knepley   PetscInt        cdof;   /* The number of constraints on this point */
5234a5e93ea8SMatthew G. Knepley   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5235a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
5236a5e93ea8SMatthew G. Knepley   PetscInt        off, cind = 0, k;
5237a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
5238a5e93ea8SMatthew G. Knepley 
5239a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
5240a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
5241a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5242a5e93ea8SMatthew G. Knepley   a    = &array[off];
5243a5e93ea8SMatthew G. Knepley   if (cdof) {
5244a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
5245a5e93ea8SMatthew G. Knepley     if (orientation >= 0) {
5246a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
5247a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
5248a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[k]);
5249a5e93ea8SMatthew G. Knepley           ++cind;
5250a5e93ea8SMatthew G. Knepley         }
5251a5e93ea8SMatthew G. Knepley       }
5252a5e93ea8SMatthew G. Knepley     } else {
5253a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
5254a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
5255a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[dof-k-1]);
5256a5e93ea8SMatthew G. Knepley           ++cind;
5257a5e93ea8SMatthew G. Knepley         }
5258a5e93ea8SMatthew G. Knepley       }
5259a5e93ea8SMatthew G. Knepley     }
5260a5e93ea8SMatthew G. Knepley   }
5261a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
5262a5e93ea8SMatthew G. Knepley }
5263a5e93ea8SMatthew G. Knepley 
5264a5e93ea8SMatthew G. Knepley #undef __FUNCT__
5265552f7358SJed Brown #define __FUNCT__ "updatePointFields_private"
5266a6dfd86eSKarl Rupp PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt foffs[], void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5267a6dfd86eSKarl Rupp {
5268552f7358SJed Brown   PetscScalar   *a;
5269552f7358SJed Brown   PetscInt       numFields, off, foff, f;
5270552f7358SJed Brown   PetscErrorCode ierr;
5271552f7358SJed Brown 
5272552f7358SJed Brown   PetscFunctionBegin;
5273552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5274552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5275552f7358SJed Brown   a    = &array[off];
5276552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
5277552f7358SJed Brown     PetscInt        fdof, fcomp, fcdof;
5278552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
5279552f7358SJed Brown     PetscInt        cind = 0, k, c;
5280552f7358SJed Brown 
5281552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5282552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
5283552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
5284552f7358SJed Brown     if (!fcdof || setBC) {
5285552f7358SJed Brown       if (orientation >= 0) {
5286552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
5287552f7358SJed Brown           fuse(&a[foff+k], values[foffs[f]+k]);
5288552f7358SJed Brown         }
5289552f7358SJed Brown       } else {
5290552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5291552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5292552f7358SJed Brown             fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]);
5293552f7358SJed Brown           }
5294552f7358SJed Brown         }
5295552f7358SJed Brown       }
5296552f7358SJed Brown     } else {
5297552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
5298552f7358SJed Brown       if (orientation >= 0) {
5299552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
5300552f7358SJed Brown           if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;}
5301552f7358SJed Brown           fuse(&a[foff+k], values[foffs[f]+k]);
5302552f7358SJed Brown         }
5303552f7358SJed Brown       } else {
5304552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5305552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5306552f7358SJed Brown             if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;}
5307552f7358SJed Brown             fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]);
5308552f7358SJed Brown           }
5309552f7358SJed Brown         }
5310552f7358SJed Brown       }
5311552f7358SJed Brown     }
5312552f7358SJed Brown     foff     += fdof;
5313552f7358SJed Brown     foffs[f] += fdof;
5314552f7358SJed Brown   }
5315552f7358SJed Brown   PetscFunctionReturn(0);
5316552f7358SJed Brown }
5317552f7358SJed Brown 
5318552f7358SJed Brown #undef __FUNCT__
5319a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private"
5320a5e93ea8SMatthew G. Knepley PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt foffs[], void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5321a5e93ea8SMatthew G. Knepley {
5322a5e93ea8SMatthew G. Knepley   PetscScalar   *a;
5323a5e93ea8SMatthew G. Knepley   PetscInt       numFields, off, foff, f;
5324a5e93ea8SMatthew G. Knepley   PetscErrorCode ierr;
5325a5e93ea8SMatthew G. Knepley 
5326a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
5327a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5328a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5329a5e93ea8SMatthew G. Knepley   a    = &array[off];
5330a5e93ea8SMatthew G. Knepley   for (f = 0, foff = 0; f < numFields; ++f) {
5331a5e93ea8SMatthew G. Knepley     PetscInt        fdof, fcomp, fcdof;
5332a5e93ea8SMatthew G. Knepley     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
5333a5e93ea8SMatthew G. Knepley     PetscInt        cind = 0, k, c;
5334a5e93ea8SMatthew G. Knepley 
5335a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5336a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
5337a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
5338a5e93ea8SMatthew G. Knepley     if (fcdof) {
5339a5e93ea8SMatthew G. Knepley       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
5340a5e93ea8SMatthew G. Knepley       if (orientation >= 0) {
5341a5e93ea8SMatthew G. Knepley         for (k = 0; k < fdof; ++k) {
5342a5e93ea8SMatthew G. Knepley           if ((cind < fcdof) && (k == fcdofs[cind])) {
5343a5e93ea8SMatthew G. Knepley             fuse(&a[foff+k], values[foffs[f]+k]);
5344a5e93ea8SMatthew G. Knepley             ++cind;
5345a5e93ea8SMatthew G. Knepley           }
5346a5e93ea8SMatthew G. Knepley         }
5347a5e93ea8SMatthew G. Knepley       } else {
5348a5e93ea8SMatthew G. Knepley         for (k = fdof/fcomp-1; k >= 0; --k) {
5349a5e93ea8SMatthew G. Knepley           for (c = 0; c < fcomp; ++c) {
5350a5e93ea8SMatthew G. Knepley             if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {
5351a5e93ea8SMatthew G. Knepley               fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]);
5352a5e93ea8SMatthew G. Knepley               ++cind;
5353a5e93ea8SMatthew G. Knepley             }
5354a5e93ea8SMatthew G. Knepley           }
5355a5e93ea8SMatthew G. Knepley         }
5356a5e93ea8SMatthew G. Knepley       }
5357a5e93ea8SMatthew G. Knepley     }
5358a5e93ea8SMatthew G. Knepley     foff     += fdof;
5359a5e93ea8SMatthew G. Knepley     foffs[f] += fdof;
5360a5e93ea8SMatthew G. Knepley   }
5361a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
5362a5e93ea8SMatthew G. Knepley }
5363a5e93ea8SMatthew G. Knepley 
5364a5e93ea8SMatthew G. Knepley #undef __FUNCT__
5365552f7358SJed Brown #define __FUNCT__ "DMPlexVecSetClosure"
5366552f7358SJed Brown /*@C
5367552f7358SJed Brown   DMPlexVecSetClosure - Set an array of the values on the closure of 'point'
5368552f7358SJed Brown 
5369552f7358SJed Brown   Not collective
5370552f7358SJed Brown 
5371552f7358SJed Brown   Input Parameters:
5372552f7358SJed Brown + dm - The DM
53737f5d1fdeSMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section
5374552f7358SJed Brown . v - The local vector
5375552f7358SJed Brown . point - The sieve point in the DM
53767f5d1fdeSMatthew G. Knepley . values - The array of values
5377552f7358SJed Brown - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
5378552f7358SJed Brown 
53793813dfbdSMatthew G Knepley   Fortran Notes:
53807f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
53813813dfbdSMatthew G Knepley 
5382552f7358SJed Brown   Level: intermediate
5383552f7358SJed Brown 
5384552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure()
5385552f7358SJed Brown @*/
5386a6dfd86eSKarl Rupp PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
5387a6dfd86eSKarl Rupp {
5388552f7358SJed Brown   PetscScalar   *array;
53890298fd71SBarry Smith   PetscInt      *points = NULL;
5390552f7358SJed Brown   PetscInt       offsets[32];
5391b6ebb6e6SMatthew G. Knepley   PetscInt       depth, numFields, numPoints, off, dof, pStart, pEnd, p, q, f;
5392552f7358SJed Brown   PetscErrorCode ierr;
5393552f7358SJed Brown 
5394552f7358SJed Brown   PetscFunctionBegin;
5395552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5396552f7358SJed Brown   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
5397552f7358SJed Brown   if (!section) {
5398552f7358SJed Brown     ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
5399552f7358SJed Brown   }
5400b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5401552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5402b6ebb6e6SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
540382f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5404552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5405b6ebb6e6SMatthew G. Knepley   if (depth == 1 && numFields < 2 && mode == ADD_VALUES) {
5406b6ebb6e6SMatthew G. Knepley     const PetscInt *cone, *coneO;
5407b6ebb6e6SMatthew G. Knepley 
5408b6ebb6e6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
5409b6ebb6e6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
5410b6ebb6e6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
5411b6ebb6e6SMatthew G. Knepley     ierr = VecGetArray(v, &array);CHKERRQ(ierr);
5412b6ebb6e6SMatthew G. Knepley     for (p = 0, off = 0; p <= numPoints; ++p, off += dof) {
5413b6ebb6e6SMatthew G. Knepley       const PetscInt cp = !p ? point : cone[p-1];
5414b6ebb6e6SMatthew G. Knepley       const PetscInt o  = !p ? 0     : coneO[p-1];
5415b6ebb6e6SMatthew G. Knepley 
5416b6ebb6e6SMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;}
5417b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
5418b6ebb6e6SMatthew G. Knepley       /* ADD_VALUES */
5419b6ebb6e6SMatthew G. Knepley       {
5420b6ebb6e6SMatthew G. Knepley         const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5421b6ebb6e6SMatthew G. Knepley         PetscScalar    *a;
5422b6ebb6e6SMatthew G. Knepley         PetscInt        cdof, coff, cind = 0, k;
5423b6ebb6e6SMatthew G. Knepley 
5424b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr);
5425b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr);
5426b6ebb6e6SMatthew G. Knepley         a    = &array[coff];
5427b6ebb6e6SMatthew G. Knepley         if (!cdof) {
5428b6ebb6e6SMatthew G. Knepley           if (o >= 0) {
5429b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5430b6ebb6e6SMatthew G. Knepley               a[k] += values[off+k];
5431b6ebb6e6SMatthew G. Knepley             }
5432b6ebb6e6SMatthew G. Knepley           } else {
5433b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5434b6ebb6e6SMatthew G. Knepley               a[k] += values[off+dof-k-1];
5435b6ebb6e6SMatthew G. Knepley             }
5436b6ebb6e6SMatthew G. Knepley           }
5437b6ebb6e6SMatthew G. Knepley         } else {
5438b6ebb6e6SMatthew G. Knepley           ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr);
5439b6ebb6e6SMatthew G. Knepley           if (o >= 0) {
5440b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5441b6ebb6e6SMatthew G. Knepley               if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5442b6ebb6e6SMatthew G. Knepley               a[k] += values[off+k];
5443b6ebb6e6SMatthew G. Knepley             }
5444b6ebb6e6SMatthew G. Knepley           } else {
5445b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5446b6ebb6e6SMatthew G. Knepley               if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5447b6ebb6e6SMatthew G. Knepley               a[k] += values[off+dof-k-1];
5448b6ebb6e6SMatthew G. Knepley             }
5449b6ebb6e6SMatthew G. Knepley           }
5450b6ebb6e6SMatthew G. Knepley         }
5451b6ebb6e6SMatthew G. Knepley       }
5452b6ebb6e6SMatthew G. Knepley     }
5453b6ebb6e6SMatthew G. Knepley     ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
5454b6ebb6e6SMatthew G. Knepley     PetscFunctionReturn(0);
5455b6ebb6e6SMatthew G. Knepley   }
5456552f7358SJed Brown   ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5457552f7358SJed Brown   /* Compress out points not in the section */
5458552f7358SJed Brown   for (p = 0, q = 0; p < numPoints*2; p += 2) {
5459552f7358SJed Brown     if ((points[p] >= pStart) && (points[p] < pEnd)) {
5460552f7358SJed Brown       points[q*2]   = points[p];
5461552f7358SJed Brown       points[q*2+1] = points[p+1];
5462552f7358SJed Brown       ++q;
5463552f7358SJed Brown     }
5464552f7358SJed Brown   }
5465552f7358SJed Brown   numPoints = q;
5466552f7358SJed Brown   for (p = 0; p < numPoints*2; p += 2) {
5467552f7358SJed Brown     PetscInt fdof;
5468552f7358SJed Brown 
5469552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
5470552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5471552f7358SJed Brown       offsets[f+1] += fdof;
5472552f7358SJed Brown     }
5473552f7358SJed Brown   }
54740d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
5475552f7358SJed Brown   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
5476552f7358SJed Brown   if (numFields) {
5477552f7358SJed Brown     switch (mode) {
5478552f7358SJed Brown     case INSERT_VALUES:
5479552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5480552f7358SJed Brown         PetscInt o = points[p+1];
5481552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, insert, PETSC_FALSE, o, values, array);
5482552f7358SJed Brown       } break;
5483552f7358SJed Brown     case INSERT_ALL_VALUES:
5484552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5485552f7358SJed Brown         PetscInt o = points[p+1];
5486552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, insert, PETSC_TRUE,  o, values, array);
5487552f7358SJed Brown       } break;
5488a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
5489a5e93ea8SMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
5490a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
5491a5e93ea8SMatthew G. Knepley         updatePointFieldsBC_private(section, points[p], offsets, insert,  o, values, array);
5492a5e93ea8SMatthew G. Knepley       } break;
5493552f7358SJed Brown     case ADD_VALUES:
5494552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5495552f7358SJed Brown         PetscInt o = points[p+1];
5496552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, add,    PETSC_FALSE, o, values, array);
5497552f7358SJed Brown       } break;
5498552f7358SJed Brown     case ADD_ALL_VALUES:
5499552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5500552f7358SJed Brown         PetscInt o = points[p+1];
5501552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, add,    PETSC_TRUE,  o, values, array);
5502552f7358SJed Brown       } break;
5503552f7358SJed Brown     default:
550482f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
5505552f7358SJed Brown     }
5506552f7358SJed Brown   } else {
5507552f7358SJed Brown     switch (mode) {
5508552f7358SJed Brown     case INSERT_VALUES:
5509552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5510552f7358SJed Brown         PetscInt o = points[p+1];
5511552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5512552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array);
5513552f7358SJed Brown       } break;
5514552f7358SJed Brown     case INSERT_ALL_VALUES:
5515552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5516552f7358SJed Brown         PetscInt o = points[p+1];
5517552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5518552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_TRUE,  o, &values[off], array);
5519552f7358SJed Brown       } break;
5520a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
5521a5e93ea8SMatthew G. Knepley       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5522a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
5523a5e93ea8SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5524a5e93ea8SMatthew G. Knepley         updatePointBC_private(section, points[p], dof, insert,  o, &values[off], array);
5525a5e93ea8SMatthew G. Knepley       } break;
5526552f7358SJed Brown     case ADD_VALUES:
5527552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5528552f7358SJed Brown         PetscInt o = points[p+1];
5529552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5530552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_FALSE, o, &values[off], array);
5531552f7358SJed Brown       } break;
5532552f7358SJed Brown     case ADD_ALL_VALUES:
5533552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5534552f7358SJed Brown         PetscInt o = points[p+1];
5535552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5536552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_TRUE,  o, &values[off], array);
5537552f7358SJed Brown       } break;
5538552f7358SJed Brown     default:
553982f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
5540552f7358SJed Brown     }
5541552f7358SJed Brown   }
5542552f7358SJed Brown   ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5543552f7358SJed Brown   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
5544552f7358SJed Brown   PetscFunctionReturn(0);
5545552f7358SJed Brown }
5546552f7358SJed Brown 
5547552f7358SJed Brown #undef __FUNCT__
5548e159ff95SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateClosureIndex"
5549e159ff95SMatthew G. Knepley /*@
5550e159ff95SMatthew G. Knepley   DMPlexCreateClosureIndex - Calculate an index for the given PetscSection for the closure operation on the DM
5551e159ff95SMatthew G. Knepley 
5552e159ff95SMatthew G. Knepley   Not collective
5553e159ff95SMatthew G. Knepley 
5554e159ff95SMatthew G. Knepley   Input Parameters:
5555e159ff95SMatthew G. Knepley + dm - The DM
5556e159ff95SMatthew G. Knepley - section - The section describing the layout in v, or NULL to use the default section
5557e159ff95SMatthew G. Knepley 
5558e159ff95SMatthew G. Knepley   Note:
5559e159ff95SMatthew G. Knepley   This should greatly improve the performance of the closure operations, at the cost of additional memory.
5560e159ff95SMatthew G. Knepley 
5561e159ff95SMatthew G. Knepley   Level: intermediate
5562e159ff95SMatthew G. Knepley 
5563e159ff95SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
5564e159ff95SMatthew G. Knepley @*/
5565e159ff95SMatthew G. Knepley PetscErrorCode DMPlexCreateClosureIndex(DM dm, PetscSection section)
5566e159ff95SMatthew G. Knepley {
5567e159ff95SMatthew G. Knepley   PetscSection   closureSection;
5568e159ff95SMatthew G. Knepley   IS             closureIS;
5569e159ff95SMatthew G. Knepley   PetscInt       offsets[32], *clIndices;
5570e159ff95SMatthew G. Knepley   PetscInt       depth, numFields, pStart, pEnd, point, clSize;
5571e159ff95SMatthew G. Knepley   PetscErrorCode ierr;
5572e159ff95SMatthew G. Knepley 
5573e159ff95SMatthew G. Knepley   PetscFunctionBegin;
5574e159ff95SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5575e159ff95SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
5576e159ff95SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5577e159ff95SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5578e159ff95SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
5579e159ff95SMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5580e159ff95SMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) section), &closureSection);CHKERRQ(ierr);
5581e159ff95SMatthew G. Knepley   ierr = PetscSectionSetChart(closureSection, pStart, pEnd);CHKERRQ(ierr);
5582e159ff95SMatthew G. Knepley   for (point = pStart; point < pEnd; ++point) {
5583e159ff95SMatthew G. Knepley     PetscInt *points = NULL, numPoints, p, dof, cldof = 0;
5584e159ff95SMatthew G. Knepley 
5585e159ff95SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5586e159ff95SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
5587e159ff95SMatthew G. Knepley       if ((points[p] >= pStart) && (points[p] < pEnd)) {
5588e159ff95SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5589e159ff95SMatthew G. Knepley         cldof += dof;
5590e159ff95SMatthew G. Knepley       }
5591e159ff95SMatthew G. Knepley     }
5592e159ff95SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5593e159ff95SMatthew G. Knepley     ierr = PetscSectionSetDof(closureSection, point, cldof);CHKERRQ(ierr);
5594e159ff95SMatthew G. Knepley   }
5595e159ff95SMatthew G. Knepley   ierr = PetscSectionSetUp(closureSection);CHKERRQ(ierr);
5596e159ff95SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(closureSection, &clSize);CHKERRQ(ierr);
5597e159ff95SMatthew G. Knepley   ierr = PetscMalloc(clSize * sizeof(PetscInt), &clIndices);CHKERRQ(ierr);
5598e159ff95SMatthew G. Knepley   for (point = pStart; point < pEnd; ++point) {
5599e159ff95SMatthew G. Knepley     PetscInt *points = NULL, numPoints, p, q, cldof, cloff, fdof, f;
5600e159ff95SMatthew G. Knepley 
5601e159ff95SMatthew G. Knepley     ierr = PetscSectionGetDof(closureSection, point, &cldof);CHKERRQ(ierr);
5602e159ff95SMatthew G. Knepley     ierr = PetscSectionGetOffset(closureSection, point, &cloff);CHKERRQ(ierr);
5603e159ff95SMatthew G. Knepley     ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5604e159ff95SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5605e159ff95SMatthew G. Knepley     /* Compress out points not in the section, and create field offsets */
5606e159ff95SMatthew G. Knepley     for (p = 0, q = 0; p < numPoints*2; p += 2) {
5607e159ff95SMatthew G. Knepley       if ((points[p] >= pStart) && (points[p] < pEnd)) {
5608e159ff95SMatthew G. Knepley         points[q*2]   = points[p];
5609e159ff95SMatthew G. Knepley         points[q*2+1] = points[p+1];
5610e159ff95SMatthew G. Knepley         for (f = 0; f < numFields; ++f) {
5611e159ff95SMatthew G. Knepley           ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5612e159ff95SMatthew G. Knepley           offsets[f+1] += fdof;
5613e159ff95SMatthew G. Knepley         }
5614e159ff95SMatthew G. Knepley         ++q;
5615e159ff95SMatthew G. Knepley       }
5616e159ff95SMatthew G. Knepley     }
5617e159ff95SMatthew G. Knepley     numPoints = q;
5618e159ff95SMatthew G. Knepley     for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
5619e159ff95SMatthew G. Knepley     if (numFields && offsets[numFields] != cldof) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], cldof);
5620e159ff95SMatthew G. Knepley     /* Create indices */
5621e159ff95SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
5622e159ff95SMatthew G. Knepley       PetscInt o = points[p+1], dof, off, d;
5623e159ff95SMatthew G. Knepley 
5624e159ff95SMatthew G. Knepley       ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5625e159ff95SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, points[p], &off);CHKERRQ(ierr);
5626e159ff95SMatthew G. Knepley       if (numFields) {
5627e159ff95SMatthew G. Knepley         PetscInt fdof, foff, fcomp, f, c;
5628e159ff95SMatthew G. Knepley 
5629e159ff95SMatthew G. Knepley         for (f = 0, foff = 0; f < numFields; ++f) {
5630e159ff95SMatthew G. Knepley           ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5631e159ff95SMatthew G. Knepley           if (o >= 0) {
5632e159ff95SMatthew G. Knepley             for (d = 0; d < fdof; ++d, ++offsets[f]) clIndices[cloff+offsets[f]] = off+foff+d;
5633e159ff95SMatthew G. Knepley           } else {
5634e159ff95SMatthew G. Knepley             ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5635e159ff95SMatthew G. Knepley             for (d = fdof/fcomp-1; d >= 0; --d) {
5636e159ff95SMatthew G. Knepley               for (c = 0; c < fcomp; ++c, ++offsets[f]) clIndices[cloff+offsets[f]] = off+foff+d*fcomp+c;
5637e159ff95SMatthew G. Knepley             }
5638e159ff95SMatthew G. Knepley           }
5639e159ff95SMatthew G. Knepley           foff += fdof;
5640e159ff95SMatthew G. Knepley         }
5641e159ff95SMatthew G. Knepley       } else {
5642e159ff95SMatthew G. Knepley         if (o >= 0) for (d = 0;     d < dof; ++d) clIndices[cloff+d] = off+d;
5643e159ff95SMatthew G. Knepley         else        for (d = dof-1; d >= 0;  --d) clIndices[cloff+d] = off+d;
5644e159ff95SMatthew G. Knepley       }
5645e159ff95SMatthew G. Knepley     }
5646e159ff95SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5647e159ff95SMatthew G. Knepley   }
5648e159ff95SMatthew G. Knepley   ierr = ISCreateGeneral(PETSC_COMM_SELF, clSize, clIndices, PETSC_OWN_POINTER, &closureIS);CHKERRQ(ierr);
5649e159ff95SMatthew G. Knepley   ierr = PetscSectionSetClosureIndex(section, (PetscObject) dm, closureSection, closureIS);
5650e159ff95SMatthew G. Knepley   PetscFunctionReturn(0);
5651e159ff95SMatthew G. Knepley }
5652e159ff95SMatthew G. Knepley 
5653e159ff95SMatthew G. Knepley #undef __FUNCT__
5654552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues"
56557c1f9639SMatthew G Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numIndices, const PetscInt indices[], const PetscScalar values[])
5656552f7358SJed Brown {
5657552f7358SJed Brown   PetscMPIInt    rank;
5658552f7358SJed Brown   PetscInt       i, j;
5659552f7358SJed Brown   PetscErrorCode ierr;
5660552f7358SJed Brown 
5661552f7358SJed Brown   PetscFunctionBegin;
566282f516ccSBarry Smith   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr);
566377a6746dSMatthew G Knepley   ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr);
5664552f7358SJed Brown   for (i = 0; i < numIndices; i++) {
566577a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat indices[%D] = %D\n", rank, i, indices[i]);CHKERRQ(ierr);
5666552f7358SJed Brown   }
5667552f7358SJed Brown   for (i = 0; i < numIndices; i++) {
566877a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr);
5669552f7358SJed Brown     for (j = 0; j < numIndices; j++) {
5670519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX)
567177a6746dSMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, " (%G,%G)", PetscRealPart(values[i*numIndices+j]), PetscImaginaryPart(values[i*numIndices+j]));CHKERRQ(ierr);
5672552f7358SJed Brown #else
567377a6746dSMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, " %G", values[i*numIndices+j]);CHKERRQ(ierr);
5674552f7358SJed Brown #endif
5675552f7358SJed Brown     }
567677a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
5677552f7358SJed Brown   }
5678552f7358SJed Brown   PetscFunctionReturn(0);
5679552f7358SJed Brown }
5680552f7358SJed Brown 
5681552f7358SJed Brown #undef __FUNCT__
5682552f7358SJed Brown #define __FUNCT__ "indicesPoint_private"
5683552f7358SJed Brown /* . off - The global offset of this point */
5684e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[])
5685a6dfd86eSKarl Rupp {
5686e6ccafaeSMatthew G Knepley   PetscInt        dof;    /* The number of unknowns on this point */
5687552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
5688552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5689552f7358SJed Brown   PetscInt        cind = 0, k;
5690552f7358SJed Brown   PetscErrorCode  ierr;
5691552f7358SJed Brown 
5692552f7358SJed Brown   PetscFunctionBegin;
5693552f7358SJed Brown   ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
5694552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
5695552f7358SJed Brown   if (!cdof || setBC) {
5696552f7358SJed Brown     if (orientation >= 0) {
5697e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+k] = off+k;
5698552f7358SJed Brown     } else {
5699e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k;
5700552f7358SJed Brown     }
5701552f7358SJed Brown   } else {
5702552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
5703552f7358SJed Brown     if (orientation >= 0) {
5704552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5705552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
5706552f7358SJed Brown           /* Insert check for returning constrained indices */
5707e6ccafaeSMatthew G Knepley           indices[*loff+k] = -(off+k+1);
5708552f7358SJed Brown           ++cind;
5709552f7358SJed Brown         } else {
5710e6ccafaeSMatthew G Knepley           indices[*loff+k] = off+k-cind;
5711552f7358SJed Brown         }
5712552f7358SJed Brown       }
5713552f7358SJed Brown     } else {
5714552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5715552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
5716552f7358SJed Brown           /* Insert check for returning constrained indices */
5717e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = -(off+k+1);
5718552f7358SJed Brown           ++cind;
5719552f7358SJed Brown         } else {
5720e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = off+k-cind;
5721552f7358SJed Brown         }
5722552f7358SJed Brown       }
5723552f7358SJed Brown     }
5724552f7358SJed Brown   }
5725e6ccafaeSMatthew G Knepley   *loff += dof;
5726552f7358SJed Brown   PetscFunctionReturn(0);
5727552f7358SJed Brown }
5728552f7358SJed Brown 
5729552f7358SJed Brown #undef __FUNCT__
5730552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private"
5731552f7358SJed Brown /* . off - The global offset of this point */
5732a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[])
5733a6dfd86eSKarl Rupp {
5734552f7358SJed Brown   PetscInt       numFields, foff, f;
5735552f7358SJed Brown   PetscErrorCode ierr;
5736552f7358SJed Brown 
5737552f7358SJed Brown   PetscFunctionBegin;
5738552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5739552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
5740552f7358SJed Brown     PetscInt        fdof, fcomp, cfdof;
5741552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
5742552f7358SJed Brown     PetscInt        cind = 0, k, c;
5743552f7358SJed Brown 
5744552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5745552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
5746552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr);
5747552f7358SJed Brown     if (!cfdof || setBC) {
5748552f7358SJed Brown       if (orientation >= 0) {
57490d644c17SKarl Rupp         for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k;
5750552f7358SJed Brown       } else {
5751552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5752552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5753552f7358SJed Brown             indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c;
5754552f7358SJed Brown           }
5755552f7358SJed Brown         }
5756552f7358SJed Brown       }
5757552f7358SJed Brown     } else {
5758552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
5759552f7358SJed Brown       if (orientation >= 0) {
5760552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
5761552f7358SJed Brown           if ((cind < cfdof) && (k == fcdofs[cind])) {
5762552f7358SJed Brown             indices[foffs[f]+k] = -(off+foff+k+1);
5763552f7358SJed Brown             ++cind;
5764552f7358SJed Brown           } else {
5765552f7358SJed Brown             indices[foffs[f]+k] = off+foff+k-cind;
5766552f7358SJed Brown           }
5767552f7358SJed Brown         }
5768552f7358SJed Brown       } else {
5769552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5770552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5771552f7358SJed Brown             if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) {
5772552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1);
5773552f7358SJed Brown               ++cind;
5774552f7358SJed Brown             } else {
5775552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind;
5776552f7358SJed Brown             }
5777552f7358SJed Brown           }
5778552f7358SJed Brown         }
5779552f7358SJed Brown       }
5780552f7358SJed Brown     }
5781552f7358SJed Brown     foff     += fdof - cfdof;
5782552f7358SJed Brown     foffs[f] += fdof;
5783552f7358SJed Brown   }
5784552f7358SJed Brown   PetscFunctionReturn(0);
5785552f7358SJed Brown }
5786552f7358SJed Brown 
5787552f7358SJed Brown #undef __FUNCT__
5788552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure"
57897f5d1fdeSMatthew G. Knepley /*@C
57907f5d1fdeSMatthew G. Knepley   DMPlexMatSetClosure - Set an array of the values on the closure of 'point'
57917f5d1fdeSMatthew G. Knepley 
57927f5d1fdeSMatthew G. Knepley   Not collective
57937f5d1fdeSMatthew G. Knepley 
57947f5d1fdeSMatthew G. Knepley   Input Parameters:
57957f5d1fdeSMatthew G. Knepley + dm - The DM
57963dc93601SMatthew G. Knepley . section - The section describing the layout in v
57973dc93601SMatthew G. Knepley . globalSection - The section describing the layout in v
57987f5d1fdeSMatthew G. Knepley . A - The matrix
57997f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM
58007f5d1fdeSMatthew G. Knepley . values - The array of values
58017f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
58027f5d1fdeSMatthew G. Knepley 
58037f5d1fdeSMatthew G. Knepley   Fortran Notes:
58047f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
58057f5d1fdeSMatthew G. Knepley 
58067f5d1fdeSMatthew G. Knepley   Level: intermediate
58077f5d1fdeSMatthew G. Knepley 
58087f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure()
58097f5d1fdeSMatthew G. Knepley @*/
58107c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
5811552f7358SJed Brown {
5812552f7358SJed Brown   DM_Plex       *mesh   = (DM_Plex*) dm->data;
58130298fd71SBarry Smith   PetscInt      *points = NULL;
5814552f7358SJed Brown   PetscInt      *indices;
5815552f7358SJed Brown   PetscInt       offsets[32];
5816552f7358SJed Brown   PetscInt       numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f;
5817552f7358SJed Brown   PetscErrorCode ierr;
5818552f7358SJed Brown 
5819552f7358SJed Brown   PetscFunctionBegin;
5820552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
58213dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
58223dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3);
58233dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 4);
5824552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
582582f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5826552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5827552f7358SJed Brown   ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5828552f7358SJed Brown   /* Compress out points not in the section */
5829552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
5830552f7358SJed Brown   for (p = 0, q = 0; p < numPoints*2; p += 2) {
5831552f7358SJed Brown     if ((points[p] >= pStart) && (points[p] < pEnd)) {
5832552f7358SJed Brown       points[q*2]   = points[p];
5833552f7358SJed Brown       points[q*2+1] = points[p+1];
5834552f7358SJed Brown       ++q;
5835552f7358SJed Brown     }
5836552f7358SJed Brown   }
5837552f7358SJed Brown   numPoints = q;
5838552f7358SJed Brown   for (p = 0, numIndices = 0; p < numPoints*2; p += 2) {
5839552f7358SJed Brown     PetscInt fdof;
5840552f7358SJed Brown 
5841552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5842552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
5843552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5844552f7358SJed Brown       offsets[f+1] += fdof;
5845552f7358SJed Brown     }
5846552f7358SJed Brown     numIndices += dof;
5847552f7358SJed Brown   }
58480d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
58490d644c17SKarl Rupp 
585082f516ccSBarry Smith   if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices);
5851552f7358SJed Brown   ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
5852552f7358SJed Brown   if (numFields) {
5853552f7358SJed Brown     for (p = 0; p < numPoints*2; p += 2) {
5854552f7358SJed Brown       PetscInt o = points[p+1];
5855552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
5856552f7358SJed Brown       indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices);
5857552f7358SJed Brown     }
5858552f7358SJed Brown   } else {
5859e6ccafaeSMatthew G Knepley     for (p = 0, off = 0; p < numPoints*2; p += 2) {
5860552f7358SJed Brown       PetscInt o = points[p+1];
5861552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
5862e6ccafaeSMatthew G Knepley       indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices);
5863552f7358SJed Brown     }
5864552f7358SJed Brown   }
586577a6746dSMatthew G Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr);}
5866552f7358SJed Brown   ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode);
5867552f7358SJed Brown   if (ierr) {
5868552f7358SJed Brown     PetscMPIInt    rank;
5869552f7358SJed Brown     PetscErrorCode ierr2;
5870552f7358SJed Brown 
587182f516ccSBarry Smith     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
587277a6746dSMatthew G Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
587377a6746dSMatthew G Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr2);
58746a415b8fSMatthew G Knepley     ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2);
5875552f7358SJed Brown     CHKERRQ(ierr);
5876552f7358SJed Brown   }
5877552f7358SJed Brown   ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5878552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
5879552f7358SJed Brown   PetscFunctionReturn(0);
5880552f7358SJed Brown }
5881552f7358SJed Brown 
5882552f7358SJed Brown #undef __FUNCT__
5883770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds"
5884770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax)
5885552f7358SJed Brown {
5886552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5887770b213bSMatthew G Knepley   PetscInt       dim;
5888770b213bSMatthew G Knepley   PetscErrorCode ierr;
5889552f7358SJed Brown 
5890552f7358SJed Brown   PetscFunctionBegin;
5891552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5892770b213bSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
5893770b213bSMatthew G Knepley   if (cMax) *cMax = mesh->hybridPointMax[dim];
5894770b213bSMatthew G Knepley   if (fMax) *fMax = mesh->hybridPointMax[dim-1];
5895770b213bSMatthew G Knepley   if (eMax) *eMax = mesh->hybridPointMax[1];
5896770b213bSMatthew G Knepley   if (vMax) *vMax = mesh->hybridPointMax[0];
5897552f7358SJed Brown   PetscFunctionReturn(0);
5898552f7358SJed Brown }
5899552f7358SJed Brown 
5900552f7358SJed Brown #undef __FUNCT__
5901770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds"
5902770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax)
5903552f7358SJed Brown {
5904552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5905770b213bSMatthew G Knepley   PetscInt       dim;
5906770b213bSMatthew G Knepley   PetscErrorCode ierr;
5907552f7358SJed Brown 
5908552f7358SJed Brown   PetscFunctionBegin;
5909552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5910770b213bSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
5911770b213bSMatthew G Knepley   if (cMax >= 0) mesh->hybridPointMax[dim]   = cMax;
5912770b213bSMatthew G Knepley   if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax;
5913770b213bSMatthew G Knepley   if (eMax >= 0) mesh->hybridPointMax[1]     = eMax;
5914770b213bSMatthew G Knepley   if (vMax >= 0) mesh->hybridPointMax[0]     = vMax;
5915552f7358SJed Brown   PetscFunctionReturn(0);
5916552f7358SJed Brown }
5917552f7358SJed Brown 
5918552f7358SJed Brown #undef __FUNCT__
5919552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight"
5920552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight)
5921552f7358SJed Brown {
5922552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5923552f7358SJed Brown 
5924552f7358SJed Brown   PetscFunctionBegin;
5925552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5926552f7358SJed Brown   PetscValidPointer(cellHeight, 2);
5927552f7358SJed Brown   *cellHeight = mesh->vtkCellHeight;
5928552f7358SJed Brown   PetscFunctionReturn(0);
5929552f7358SJed Brown }
5930552f7358SJed Brown 
5931552f7358SJed Brown #undef __FUNCT__
5932552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight"
5933552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight)
5934552f7358SJed Brown {
5935552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5936552f7358SJed Brown 
5937552f7358SJed Brown   PetscFunctionBegin;
5938552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5939552f7358SJed Brown   mesh->vtkCellHeight = cellHeight;
5940552f7358SJed Brown   PetscFunctionReturn(0);
5941552f7358SJed Brown }
5942552f7358SJed Brown 
5943552f7358SJed Brown #undef __FUNCT__
5944552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private"
5945552f7358SJed Brown /* We can easily have a form that takes an IS instead */
5946552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering)
5947552f7358SJed Brown {
5948552f7358SJed Brown   PetscSection   section, globalSection;
5949552f7358SJed Brown   PetscInt      *numbers, p;
5950552f7358SJed Brown   PetscErrorCode ierr;
5951552f7358SJed Brown 
5952552f7358SJed Brown   PetscFunctionBegin;
595382f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
5954552f7358SJed Brown   ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr);
5955552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5956552f7358SJed Brown     ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr);
5957552f7358SJed Brown   }
5958552f7358SJed Brown   ierr = PetscSectionSetUp(section);CHKERRQ(ierr);
5959552f7358SJed Brown   ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr);
5960552f7358SJed Brown   ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt), &numbers);CHKERRQ(ierr);
5961552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5962552f7358SJed Brown     ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr);
5963552f7358SJed Brown   }
596482f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr);
5965552f7358SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5966552f7358SJed Brown   ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr);
5967552f7358SJed Brown   PetscFunctionReturn(0);
5968552f7358SJed Brown }
5969552f7358SJed Brown 
5970552f7358SJed Brown #undef __FUNCT__
5971552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering"
5972552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers)
5973552f7358SJed Brown {
5974552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5975552f7358SJed Brown   PetscInt       cellHeight, cStart, cEnd, cMax;
5976552f7358SJed Brown   PetscErrorCode ierr;
5977552f7358SJed Brown 
5978552f7358SJed Brown   PetscFunctionBegin;
5979552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5980552f7358SJed Brown   if (!mesh->globalCellNumbers) {
5981552f7358SJed Brown     ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr);
5982552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
59830298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
59840d644c17SKarl Rupp     if (cMax >= 0) cEnd = PetscMin(cEnd, cMax);
5985552f7358SJed Brown     ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr);
5986552f7358SJed Brown   }
5987552f7358SJed Brown   *globalCellNumbers = mesh->globalCellNumbers;
5988552f7358SJed Brown   PetscFunctionReturn(0);
5989552f7358SJed Brown }
5990552f7358SJed Brown 
5991552f7358SJed Brown #undef __FUNCT__
5992552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering"
5993552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers)
5994552f7358SJed Brown {
5995552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5996552f7358SJed Brown   PetscInt       vStart, vEnd, vMax;
5997552f7358SJed Brown   PetscErrorCode ierr;
5998552f7358SJed Brown 
5999552f7358SJed Brown   PetscFunctionBegin;
6000552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6001552f7358SJed Brown   if (!mesh->globalVertexNumbers) {
6002552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
60030298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr);
60040d644c17SKarl Rupp     if (vMax >= 0) vEnd = PetscMin(vEnd, vMax);
6005552f7358SJed Brown     ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr);
6006552f7358SJed Brown   }
6007552f7358SJed Brown   *globalVertexNumbers = mesh->globalVertexNumbers;
6008552f7358SJed Brown   PetscFunctionReturn(0);
6009552f7358SJed Brown }
6010552f7358SJed Brown 
6011552f7358SJed Brown 
6012552f7358SJed Brown #undef __FUNCT__
6013552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel"
6014552f7358SJed Brown /*@C
6015552f7358SJed Brown   PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using
6016552f7358SJed Brown   the local section and an SF describing the section point overlap.
6017552f7358SJed Brown 
6018552f7358SJed Brown   Input Parameters:
6019552f7358SJed Brown   + s - The PetscSection for the local field layout
6020552f7358SJed Brown   . sf - The SF describing parallel layout of the section points
6021552f7358SJed Brown   . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs
6022552f7358SJed Brown   . label - The label specifying the points
6023552f7358SJed Brown   - labelValue - The label stratum specifying the points
6024552f7358SJed Brown 
6025552f7358SJed Brown   Output Parameter:
6026552f7358SJed Brown   . gsection - The PetscSection for the global field layout
6027552f7358SJed Brown 
6028552f7358SJed Brown   Note: This gives negative sizes and offsets to points not owned by this process
6029552f7358SJed Brown 
6030552f7358SJed Brown   Level: developer
6031552f7358SJed Brown 
6032552f7358SJed Brown .seealso: PetscSectionCreate()
6033552f7358SJed Brown @*/
6034552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection)
6035552f7358SJed Brown {
60367ec39499SMatthew G. Knepley   PetscInt      *neg = NULL, *tmpOff = NULL;
6037552f7358SJed Brown   PetscInt       pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots;
6038552f7358SJed Brown   PetscErrorCode ierr;
6039552f7358SJed Brown 
6040552f7358SJed Brown   PetscFunctionBegin;
6041552f7358SJed Brown   ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr);
6042552f7358SJed Brown   ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr);
6043552f7358SJed Brown   ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr);
60447ec39499SMatthew G. Knepley   ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr);
60457ec39499SMatthew G. Knepley   if (nroots >= 0) {
60467ec39499SMatthew G. Knepley     if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart);
60477ec39499SMatthew G. Knepley     ierr = PetscMalloc(nroots * sizeof(PetscInt), &neg);CHKERRQ(ierr);
60487ec39499SMatthew G. Knepley     ierr = PetscMemzero(neg, nroots * sizeof(PetscInt));CHKERRQ(ierr);
60497ec39499SMatthew G. Knepley     if (nroots > pEnd-pStart) {
60507ec39499SMatthew G. Knepley       ierr = PetscMalloc(nroots * sizeof(PetscInt), &tmpOff);CHKERRQ(ierr);
60517ec39499SMatthew G. Knepley       ierr = PetscMemzero(tmpOff, nroots * sizeof(PetscInt));CHKERRQ(ierr);
60527ec39499SMatthew G. Knepley     } else {
60537ec39499SMatthew G. Knepley       tmpOff = &(*gsection)->atlasDof[-pStart];
60547ec39499SMatthew G. Knepley     }
60557ec39499SMatthew G. Knepley   }
6056552f7358SJed Brown   /* Mark ghost points with negative dof */
6057552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
6058552f7358SJed Brown     PetscInt value;
6059552f7358SJed Brown 
6060552f7358SJed Brown     ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr);
6061552f7358SJed Brown     if (value != labelValue) continue;
6062552f7358SJed Brown     ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr);
6063552f7358SJed Brown     ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr);
6064552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr);
6065552f7358SJed Brown     if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);}
60667ec39499SMatthew G. Knepley     if (neg) neg[p] = -(dof+1);
6067552f7358SJed Brown   }
6068552f7358SJed Brown   ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr);
6069552f7358SJed Brown   if (nroots >= 0) {
60707ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
60717ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
6072552f7358SJed Brown     if (nroots > pEnd-pStart) {
60737ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];}
6074552f7358SJed Brown     }
6075552f7358SJed Brown   }
6076552f7358SJed Brown   /* Calculate new sizes, get proccess offset, and calculate point offsets */
6077552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
6078552f7358SJed Brown     cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0;
6079552f7358SJed Brown     (*gsection)->atlasOff[p] = off;
6080552f7358SJed Brown     off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0;
6081552f7358SJed Brown   }
6082552f7358SJed Brown   ierr       = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr);
6083552f7358SJed Brown   globalOff -= off;
6084552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
6085552f7358SJed Brown     (*gsection)->atlasOff[p] += globalOff;
60867ec39499SMatthew G. Knepley     if (neg) neg[p] = -((*gsection)->atlasOff[p]+1);
6087552f7358SJed Brown   }
6088552f7358SJed Brown   /* Put in negative offsets for ghost points */
6089552f7358SJed Brown   if (nroots >= 0) {
60907ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
60917ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
6092552f7358SJed Brown     if (nroots > pEnd-pStart) {
60937ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];}
6094552f7358SJed Brown     }
6095552f7358SJed Brown   }
60967ec39499SMatthew G. Knepley   if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);}
6097552f7358SJed Brown   ierr = PetscFree(neg);CHKERRQ(ierr);
6098552f7358SJed Brown   PetscFunctionReturn(0);
6099552f7358SJed Brown }
6100ca8062c8SMatthew G. Knepley 
6101ca8062c8SMatthew G. Knepley #undef __FUNCT__
6102ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry"
6103ca8062c8SMatthew G. Knepley /*@
6104ca8062c8SMatthew G. Knepley   DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric.
6105ca8062c8SMatthew G. Knepley 
6106ca8062c8SMatthew G. Knepley   Input Parameters:
6107ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
6108ca8062c8SMatthew G. Knepley 
6109ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
6110ca8062c8SMatthew G. Knepley 
6111ca8062c8SMatthew G. Knepley   Level: developer
6112ca8062c8SMatthew G. Knepley 
6113ca8062c8SMatthew G. Knepley .seealso: DMCreate()
6114ca8062c8SMatthew G. Knepley @*/
6115ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm)
6116ca8062c8SMatthew G. Knepley {
6117ca8062c8SMatthew G. Knepley   PetscSection    coneSection, supportSection;
6118ca8062c8SMatthew G. Knepley   const PetscInt *cone, *support;
6119ca8062c8SMatthew G. Knepley   PetscInt        coneSize, c, supportSize, s;
6120ca8062c8SMatthew G. Knepley   PetscInt        pStart, pEnd, p, csize, ssize;
6121ca8062c8SMatthew G. Knepley   PetscErrorCode  ierr;
6122ca8062c8SMatthew G. Knepley 
6123ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
6124ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6125ca8062c8SMatthew G. Knepley   ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr);
6126ca8062c8SMatthew G. Knepley   ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr);
6127ca8062c8SMatthew G. Knepley   /* Check that point p is found in the support of its cone points, and vice versa */
6128ca8062c8SMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
6129ca8062c8SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
6130ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
6131ca8062c8SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr);
6132ca8062c8SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
6133ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr);
6134ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr);
6135ca8062c8SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
6136ca8062c8SMatthew G. Knepley         if (support[s] == p) break;
6137ca8062c8SMatthew G. Knepley       }
6138ca8062c8SMatthew G. Knepley       if (s >= supportSize) {
6139ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);
6140ca8062c8SMatthew G. Knepley         for (s = 0; s < coneSize; ++s) {
6141ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);
6142ca8062c8SMatthew G. Knepley         }
6143ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6144ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);
6145ca8062c8SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
6146ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);
6147ca8062c8SMatthew G. Knepley         }
6148ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6149ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]);
6150ca8062c8SMatthew G. Knepley       }
6151ca8062c8SMatthew G. Knepley     }
6152ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
6153ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
6154ca8062c8SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
6155ca8062c8SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
6156ca8062c8SMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
6157ca8062c8SMatthew G. Knepley       for (c = 0; c < coneSize; ++c) {
6158ca8062c8SMatthew G. Knepley         if (cone[c] == p) break;
6159ca8062c8SMatthew G. Knepley       }
6160ca8062c8SMatthew G. Knepley       if (c >= coneSize) {
6161ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);
6162ca8062c8SMatthew G. Knepley         for (c = 0; c < supportSize; ++c) {
6163ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);
6164ca8062c8SMatthew G. Knepley         }
6165ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6166ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);
6167ca8062c8SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) {
6168ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);
6169ca8062c8SMatthew G. Knepley         }
6170ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6171ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]);
6172ca8062c8SMatthew G. Knepley       }
6173ca8062c8SMatthew G. Knepley     }
6174ca8062c8SMatthew G. Knepley   }
6175ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr);
6176ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr);
6177ca8062c8SMatthew G. Knepley   if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize);
6178ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
6179ca8062c8SMatthew G. Knepley }
6180ca8062c8SMatthew G. Knepley 
6181ca8062c8SMatthew G. Knepley #undef __FUNCT__
6182ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton"
6183ca8062c8SMatthew G. Knepley /*@
6184ca8062c8SMatthew G. Knepley   DMPlexCheckSkeleton - Check that each cell has the correct number of vertices
6185ca8062c8SMatthew G. Knepley 
6186ca8062c8SMatthew G. Knepley   Input Parameters:
6187ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
6188ca8062c8SMatthew G. Knepley 
6189ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
6190ca8062c8SMatthew G. Knepley 
6191ca8062c8SMatthew G. Knepley   Level: developer
6192ca8062c8SMatthew G. Knepley 
6193ca8062c8SMatthew G. Knepley .seealso: DMCreate()
6194ca8062c8SMatthew G. Knepley @*/
6195ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex)
6196ca8062c8SMatthew G. Knepley {
6197ca8062c8SMatthew G. Knepley   DM             udm;
6198ca8062c8SMatthew G. Knepley   PetscInt       dim, numCorners, coneSize, cStart, cEnd, cMax, c;
6199ca8062c8SMatthew G. Knepley   PetscErrorCode ierr;
6200ca8062c8SMatthew G. Knepley 
6201ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
6202ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6203ca8062c8SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
6204ca8062c8SMatthew G. Knepley   switch (dim) {
6205ca8062c8SMatthew G. Knepley   case 2: numCorners = isSimplex ? 3 : 4; break;
6206ca8062c8SMatthew G. Knepley   case 3: numCorners = isSimplex ? 4 : 8; break;
6207ca8062c8SMatthew G. Knepley   default:
6208ca8062c8SMatthew G. Knepley     SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim);
6209ca8062c8SMatthew G. Knepley   }
6210ca8062c8SMatthew G. Knepley   ierr = DMPlexUninterpolate(dm, &udm);CHKERRQ(ierr);
6211ca8062c8SMatthew G. Knepley   ierr = PetscObjectSetOptionsPrefix((PetscObject) udm, "un_");CHKERRQ(ierr);
6212ca8062c8SMatthew G. Knepley   ierr = DMSetFromOptions(udm);CHKERRQ(ierr);
6213ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
6214ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
6215ca8062c8SMatthew G. Knepley   cMax = cMax >= 0 ? cMax : cEnd;
6216ca8062c8SMatthew G. Knepley   for (c = cStart; c < cMax; ++c) {
6217ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(udm, c, &coneSize);CHKERRQ(ierr);
6218ca8062c8SMatthew G. Knepley     if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has  %d vertices != %d", c, coneSize, numCorners);
6219ca8062c8SMatthew G. Knepley   }
6220ca8062c8SMatthew G. Knepley   ierr = DMDestroy(&udm);CHKERRQ(ierr);
6221ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
6222ca8062c8SMatthew G. Knepley }
6223