xref: /petsc/src/dm/impls/plex/plex.c (revision 9bf0dad6ceb743954a8c3263dfdaff1853886eae)
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__
1180*9bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal"
1181*9bf0dad6SMatthew G. Knepley /*@C
1182*9bf0dad6SMatthew G. Knepley   DMPlexGetTransitiveClosure_Internal - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG with a specified initial orientation
1183*9bf0dad6SMatthew G. Knepley 
1184*9bf0dad6SMatthew G. Knepley   Not collective
1185*9bf0dad6SMatthew G. Knepley 
1186*9bf0dad6SMatthew G. Knepley   Input Parameters:
1187*9bf0dad6SMatthew G. Knepley + mesh - The DMPlex
1188*9bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1189*9bf0dad6SMatthew G. Knepley . orientation - The orientation of the point
1190*9bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
1191*9bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
1192*9bf0dad6SMatthew G. Knepley 
1193*9bf0dad6SMatthew G. Knepley   Output Parameters:
1194*9bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
1195*9bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
1196*9bf0dad6SMatthew G. Knepley 
1197*9bf0dad6SMatthew G. Knepley   Note:
1198*9bf0dad6SMatthew G. Knepley   If using internal storage (points is NULL on input), each call overwrites the last output.
1199*9bf0dad6SMatthew G. Knepley 
1200*9bf0dad6SMatthew G. Knepley   Fortran Notes:
1201*9bf0dad6SMatthew G. Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
1202*9bf0dad6SMatthew G. Knepley   include petsc.h90 in your code.
1203*9bf0dad6SMatthew G. Knepley 
1204*9bf0dad6SMatthew G. Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
1205*9bf0dad6SMatthew G. Knepley 
1206*9bf0dad6SMatthew G. Knepley   Level: beginner
1207*9bf0dad6SMatthew G. Knepley 
1208*9bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1209*9bf0dad6SMatthew G. Knepley @*/
1210*9bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1211*9bf0dad6SMatthew G. Knepley {
1212*9bf0dad6SMatthew G. Knepley   DM_Plex        *mesh = (DM_Plex*) dm->data;
1213*9bf0dad6SMatthew G. Knepley   PetscInt       *closure, *fifo;
1214*9bf0dad6SMatthew G. Knepley   const PetscInt *tmp = NULL, *tmpO = NULL;
1215*9bf0dad6SMatthew G. Knepley   PetscInt        tmpSize, t;
1216*9bf0dad6SMatthew G. Knepley   PetscInt        depth       = 0, maxSize;
1217*9bf0dad6SMatthew G. Knepley   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
1218*9bf0dad6SMatthew G. Knepley   PetscErrorCode  ierr;
1219*9bf0dad6SMatthew G. Knepley 
1220*9bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
1221*9bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1222*9bf0dad6SMatthew G. Knepley   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1223*9bf0dad6SMatthew G. Knepley   /* This is only 1-level */
1224*9bf0dad6SMatthew G. Knepley   if (useCone) {
1225*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
1226*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
1227*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
1228*9bf0dad6SMatthew G. Knepley   } else {
1229*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
1230*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
1231*9bf0dad6SMatthew G. Knepley   }
1232*9bf0dad6SMatthew G. Knepley   if (depth == 1) {
1233*9bf0dad6SMatthew G. Knepley     if (*points) {
1234*9bf0dad6SMatthew G. Knepley       closure = *points;
1235*9bf0dad6SMatthew G. Knepley     } else {
1236*9bf0dad6SMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
1237*9bf0dad6SMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1238*9bf0dad6SMatthew G. Knepley     }
1239*9bf0dad6SMatthew G. Knepley     closure[0] = p; closure[1] = ornt;
1240*9bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
1241*9bf0dad6SMatthew G. Knepley       const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
1242*9bf0dad6SMatthew G. Knepley       closure[closureSize]   = tmp[i];
1243*9bf0dad6SMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[i] : 0;
1244*9bf0dad6SMatthew G. Knepley     }
1245*9bf0dad6SMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
1246*9bf0dad6SMatthew G. Knepley     if (points)    *points    = closure;
1247*9bf0dad6SMatthew G. Knepley     PetscFunctionReturn(0);
1248*9bf0dad6SMatthew G. Knepley   }
1249*9bf0dad6SMatthew G. Knepley   maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1);
1250*9bf0dad6SMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1251*9bf0dad6SMatthew G. Knepley   if (*points) {
1252*9bf0dad6SMatthew G. Knepley     closure = *points;
1253*9bf0dad6SMatthew G. Knepley   } else {
1254*9bf0dad6SMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1255*9bf0dad6SMatthew G. Knepley   }
1256*9bf0dad6SMatthew G. Knepley   closure[0] = p; closure[1] = ornt;
1257*9bf0dad6SMatthew G. Knepley   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
1258*9bf0dad6SMatthew G. Knepley     const PetscInt i  = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
1259*9bf0dad6SMatthew G. Knepley     const PetscInt cp = tmp[i];
1260*9bf0dad6SMatthew G. Knepley     PetscInt       co = tmpO ? tmpO[i] : 0;
1261*9bf0dad6SMatthew G. Knepley 
1262*9bf0dad6SMatthew G. Knepley     if (ornt < 0) {
1263*9bf0dad6SMatthew G. Knepley       PetscInt childSize, coff;
1264*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
1265*9bf0dad6SMatthew G. Knepley       coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
1266*9bf0dad6SMatthew G. Knepley       co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
1267*9bf0dad6SMatthew G. Knepley     }
1268*9bf0dad6SMatthew G. Knepley     closure[closureSize]   = cp;
1269*9bf0dad6SMatthew G. Knepley     closure[closureSize+1] = co;
1270*9bf0dad6SMatthew G. Knepley     fifo[fifoSize]         = cp;
1271*9bf0dad6SMatthew G. Knepley     fifo[fifoSize+1]       = co;
1272*9bf0dad6SMatthew G. Knepley   }
1273*9bf0dad6SMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
1274*9bf0dad6SMatthew G. Knepley   while (fifoSize - fifoStart) {
1275*9bf0dad6SMatthew G. Knepley     const PetscInt q   = fifo[fifoStart];
1276*9bf0dad6SMatthew G. Knepley     const PetscInt o   = fifo[fifoStart+1];
1277*9bf0dad6SMatthew G. Knepley     const PetscInt rev = o >= 0 ? 0 : 1;
1278*9bf0dad6SMatthew G. Knepley     const PetscInt off = rev ? -(o+1) : o;
1279*9bf0dad6SMatthew G. Knepley 
1280*9bf0dad6SMatthew G. Knepley     if (useCone) {
1281*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
1282*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
1283*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
1284*9bf0dad6SMatthew G. Knepley     } else {
1285*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
1286*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
1287*9bf0dad6SMatthew G. Knepley       tmpO = NULL;
1288*9bf0dad6SMatthew G. Knepley     }
1289*9bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t) {
1290*9bf0dad6SMatthew G. Knepley       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
1291*9bf0dad6SMatthew G. Knepley       const PetscInt cp = tmp[i];
1292*9bf0dad6SMatthew 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. */
1293*9bf0dad6SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
1294*9bf0dad6SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
1295*9bf0dad6SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
1296*9bf0dad6SMatthew G. Knepley       PetscInt       c;
1297*9bf0dad6SMatthew G. Knepley 
1298*9bf0dad6SMatthew G. Knepley       if (rev) {
1299*9bf0dad6SMatthew G. Knepley         PetscInt childSize, coff;
1300*9bf0dad6SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
1301*9bf0dad6SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
1302*9bf0dad6SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
1303*9bf0dad6SMatthew G. Knepley       }
1304*9bf0dad6SMatthew G. Knepley       /* Check for duplicate */
1305*9bf0dad6SMatthew G. Knepley       for (c = 0; c < closureSize; c += 2) {
1306*9bf0dad6SMatthew G. Knepley         if (closure[c] == cp) break;
1307*9bf0dad6SMatthew G. Knepley       }
1308*9bf0dad6SMatthew G. Knepley       if (c == closureSize) {
1309*9bf0dad6SMatthew G. Knepley         closure[closureSize]   = cp;
1310*9bf0dad6SMatthew G. Knepley         closure[closureSize+1] = co;
1311*9bf0dad6SMatthew G. Knepley         fifo[fifoSize]         = cp;
1312*9bf0dad6SMatthew G. Knepley         fifo[fifoSize+1]       = co;
1313*9bf0dad6SMatthew G. Knepley         closureSize           += 2;
1314*9bf0dad6SMatthew G. Knepley         fifoSize              += 2;
1315*9bf0dad6SMatthew G. Knepley       }
1316*9bf0dad6SMatthew G. Knepley     }
1317*9bf0dad6SMatthew G. Knepley     fifoStart += 2;
1318*9bf0dad6SMatthew G. Knepley   }
1319*9bf0dad6SMatthew G. Knepley   if (numPoints) *numPoints = closureSize/2;
1320*9bf0dad6SMatthew G. Knepley   if (points)    *points    = closure;
1321*9bf0dad6SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1322*9bf0dad6SMatthew G. Knepley   PetscFunctionReturn(0);
1323*9bf0dad6SMatthew G. Knepley }
1324*9bf0dad6SMatthew G. Knepley 
1325*9bf0dad6SMatthew G. Knepley #undef __FUNCT__
1326552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure"
1327552f7358SJed Brown /*@C
1328552f7358SJed 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
1329552f7358SJed Brown 
1330552f7358SJed Brown   Not collective
1331552f7358SJed Brown 
1332552f7358SJed Brown   Input Parameters:
1333552f7358SJed Brown + mesh - The DMPlex
1334552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1335552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
1336e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit
1337e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit
1338552f7358SJed Brown 
1339552f7358SJed Brown   Note:
13400298fd71SBarry Smith   If not using internal storage (points is not NULL on input), this call is unnecessary
1341552f7358SJed Brown 
13423813dfbdSMatthew G Knepley   Fortran Notes:
13433813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
13443813dfbdSMatthew G Knepley   include petsc.h90 in your code.
13453813dfbdSMatthew G Knepley 
13463813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
13473813dfbdSMatthew G Knepley 
1348552f7358SJed Brown   Level: beginner
1349552f7358SJed Brown 
1350552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1351552f7358SJed Brown @*/
1352552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1353552f7358SJed Brown {
1354552f7358SJed Brown   PetscErrorCode ierr;
1355552f7358SJed Brown 
1356552f7358SJed Brown   PetscFunctionBegin;
1357552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1358e5c84f05SJed Brown   if (numPoints) PetscValidIntPointer(numPoints,4);
1359e5c84f05SJed Brown   if (points) PetscValidPointer(points,5);
1360552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr);
13614ff43b2cSJed Brown   if (numPoints) *numPoints = 0;
1362552f7358SJed Brown   PetscFunctionReturn(0);
1363552f7358SJed Brown }
1364552f7358SJed Brown 
1365552f7358SJed Brown #undef __FUNCT__
1366552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes"
1367552f7358SJed Brown /*@
1368552f7358SJed Brown   DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG
1369552f7358SJed Brown 
1370552f7358SJed Brown   Not collective
1371552f7358SJed Brown 
1372552f7358SJed Brown   Input Parameter:
1373552f7358SJed Brown . mesh - The DMPlex
1374552f7358SJed Brown 
1375552f7358SJed Brown   Output Parameters:
1376552f7358SJed Brown + maxConeSize - The maximum number of in-edges
1377552f7358SJed Brown - maxSupportSize - The maximum number of out-edges
1378552f7358SJed Brown 
1379552f7358SJed Brown   Level: beginner
1380552f7358SJed Brown 
1381552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
1382552f7358SJed Brown @*/
1383552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize)
1384552f7358SJed Brown {
1385552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
1386552f7358SJed Brown 
1387552f7358SJed Brown   PetscFunctionBegin;
1388552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1389552f7358SJed Brown   if (maxConeSize)    *maxConeSize    = mesh->maxConeSize;
1390552f7358SJed Brown   if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize;
1391552f7358SJed Brown   PetscFunctionReturn(0);
1392552f7358SJed Brown }
1393552f7358SJed Brown 
1394552f7358SJed Brown #undef __FUNCT__
1395552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex"
1396552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm)
1397552f7358SJed Brown {
1398552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1399552f7358SJed Brown   PetscInt       size;
1400552f7358SJed Brown   PetscErrorCode ierr;
1401552f7358SJed Brown 
1402552f7358SJed Brown   PetscFunctionBegin;
1403552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1404552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr);
1405552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr);
1406552f7358SJed Brown   ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->cones);CHKERRQ(ierr);
1407552f7358SJed Brown   ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->coneOrientations);CHKERRQ(ierr);
1408552f7358SJed Brown   ierr = PetscMemzero(mesh->coneOrientations, size * sizeof(PetscInt));CHKERRQ(ierr);
1409552f7358SJed Brown   if (mesh->maxSupportSize) {
1410552f7358SJed Brown     ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1411552f7358SJed Brown     ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr);
1412552f7358SJed Brown     ierr = PetscMalloc(size * sizeof(PetscInt), &mesh->supports);CHKERRQ(ierr);
1413552f7358SJed Brown   }
1414552f7358SJed Brown   PetscFunctionReturn(0);
1415552f7358SJed Brown }
1416552f7358SJed Brown 
1417552f7358SJed Brown #undef __FUNCT__
1418552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex"
1419552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm)
1420552f7358SJed Brown {
1421552f7358SJed Brown   PetscErrorCode ierr;
1422552f7358SJed Brown 
1423552f7358SJed Brown   PetscFunctionBegin;
14244d9407bcSMatthew G. Knepley   if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);}
14254d9407bcSMatthew G. Knepley   ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr);
1426552f7358SJed Brown   PetscFunctionReturn(0);
1427552f7358SJed Brown }
1428552f7358SJed Brown 
1429552f7358SJed Brown #undef __FUNCT__
1430552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize"
1431552f7358SJed Brown /*@
1432552f7358SJed Brown   DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation
1433552f7358SJed Brown 
1434552f7358SJed Brown   Not collective
1435552f7358SJed Brown 
1436552f7358SJed Brown   Input Parameter:
1437552f7358SJed Brown . mesh - The DMPlex
1438552f7358SJed Brown 
1439552f7358SJed Brown   Output Parameter:
1440552f7358SJed Brown 
1441552f7358SJed Brown   Note:
1442552f7358SJed Brown   This should be called after all calls to DMPlexSetCone()
1443552f7358SJed Brown 
1444552f7358SJed Brown   Level: beginner
1445552f7358SJed Brown 
1446552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone()
1447552f7358SJed Brown @*/
1448552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm)
1449552f7358SJed Brown {
1450552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1451552f7358SJed Brown   PetscInt      *offsets;
1452552f7358SJed Brown   PetscInt       supportSize;
1453552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1454552f7358SJed Brown   PetscErrorCode ierr;
1455552f7358SJed Brown 
1456552f7358SJed Brown   PetscFunctionBegin;
1457552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
145882f516ccSBarry Smith   if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex");
1459552f7358SJed Brown   /* Calculate support sizes */
1460552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1461552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1462552f7358SJed Brown     PetscInt dof, off, c;
1463552f7358SJed Brown 
1464552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1465552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1466552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1467552f7358SJed Brown       ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr);
1468552f7358SJed Brown     }
1469552f7358SJed Brown   }
1470552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1471552f7358SJed Brown     PetscInt dof;
1472552f7358SJed Brown 
1473552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
14740d644c17SKarl Rupp 
1475552f7358SJed Brown     mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof);
1476552f7358SJed Brown   }
1477552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1478552f7358SJed Brown   /* Calculate supports */
1479552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr);
1480552f7358SJed Brown   ierr = PetscMalloc(supportSize * sizeof(PetscInt), &mesh->supports);CHKERRQ(ierr);
1481552f7358SJed Brown   ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt), &offsets);CHKERRQ(ierr);
1482552f7358SJed Brown   ierr = PetscMemzero(offsets, (pEnd - pStart) * sizeof(PetscInt));CHKERRQ(ierr);
1483552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1484552f7358SJed Brown     PetscInt dof, off, c;
1485552f7358SJed Brown 
1486552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1487552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1488552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1489552f7358SJed Brown       const PetscInt q = mesh->cones[c];
1490552f7358SJed Brown       PetscInt       offS;
1491552f7358SJed Brown 
1492552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr);
14930d644c17SKarl Rupp 
1494552f7358SJed Brown       mesh->supports[offS+offsets[q]] = p;
1495552f7358SJed Brown       ++offsets[q];
1496552f7358SJed Brown     }
1497552f7358SJed Brown   }
1498552f7358SJed Brown   ierr = PetscFree(offsets);CHKERRQ(ierr);
1499552f7358SJed Brown   PetscFunctionReturn(0);
1500552f7358SJed Brown }
1501552f7358SJed Brown 
1502552f7358SJed Brown #undef __FUNCT__
1503552f7358SJed Brown #define __FUNCT__ "DMPlexStratify"
1504552f7358SJed Brown /*@
1505552f7358SJed Brown   DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and
1506552f7358SJed Brown   can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the
1507552f7358SJed Brown   same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in
1508552f7358SJed Brown   the DAG.
1509552f7358SJed Brown 
1510552f7358SJed Brown   Not collective
1511552f7358SJed Brown 
1512552f7358SJed Brown   Input Parameter:
1513552f7358SJed Brown . mesh - The DMPlex
1514552f7358SJed Brown 
1515552f7358SJed Brown   Output Parameter:
1516552f7358SJed Brown 
1517552f7358SJed Brown   Notes:
1518552f7358SJed Brown   The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would
1519552f7358SJed Brown   have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1.
1520552f7358SJed Brown 
1521552f7358SJed Brown   This should be called after all calls to DMPlexSymmetrize()
1522552f7358SJed Brown 
1523552f7358SJed Brown   Level: beginner
1524552f7358SJed Brown 
1525552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize()
1526552f7358SJed Brown @*/
1527552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm)
1528552f7358SJed Brown {
1529aa50250dSMatthew G. Knepley   DMLabel        label;
1530552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1531552f7358SJed Brown   PetscInt       numRoots = 0, numLeaves = 0;
1532552f7358SJed Brown   PetscErrorCode ierr;
1533552f7358SJed Brown 
1534552f7358SJed Brown   PetscFunctionBegin;
1535552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1536552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1537552f7358SJed Brown   /* Calculate depth */
1538aa50250dSMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1539aa50250dSMatthew G. Knepley   ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr);
1540aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
1541552f7358SJed Brown   /* Initialize roots and count leaves */
1542552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1543552f7358SJed Brown     PetscInt coneSize, supportSize;
1544552f7358SJed Brown 
1545552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1546552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1547552f7358SJed Brown     if (!coneSize && supportSize) {
1548552f7358SJed Brown       ++numRoots;
1549aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1550552f7358SJed Brown     } else if (!supportSize && coneSize) {
1551552f7358SJed Brown       ++numLeaves;
1552552f7358SJed Brown     } else if (!supportSize && !coneSize) {
1553552f7358SJed Brown       /* Isolated points */
1554aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1555552f7358SJed Brown     }
1556552f7358SJed Brown   }
1557552f7358SJed Brown   if (numRoots + numLeaves == (pEnd - pStart)) {
1558552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
1559552f7358SJed Brown       PetscInt coneSize, supportSize;
1560552f7358SJed Brown 
1561552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1562552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1563552f7358SJed Brown       if (!supportSize && coneSize) {
1564aa50250dSMatthew G. Knepley         ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr);
1565552f7358SJed Brown       }
1566552f7358SJed Brown     }
1567552f7358SJed Brown   } else {
156874ef644bSMatthew G. Knepley     IS       pointIS;
156974ef644bSMatthew G. Knepley     PetscInt numPoints = 0, level = 0;
1570552f7358SJed Brown 
157174ef644bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
157274ef644bSMatthew G. Knepley     if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
157374ef644bSMatthew G. Knepley     while (numPoints) {
157474ef644bSMatthew G. Knepley       const PetscInt *points;
157574ef644bSMatthew G. Knepley       const PetscInt  newLevel = level+1;
157674ef644bSMatthew G. Knepley 
157774ef644bSMatthew G. Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
157874ef644bSMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
157974ef644bSMatthew G. Knepley         const PetscInt  point = points[p];
158074ef644bSMatthew G. Knepley         const PetscInt *support;
158174ef644bSMatthew G. Knepley         PetscInt        supportSize, s;
158274ef644bSMatthew G. Knepley 
158374ef644bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
158474ef644bSMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
158574ef644bSMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
158674ef644bSMatthew G. Knepley           ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr);
1587552f7358SJed Brown         }
1588552f7358SJed Brown       }
158974ef644bSMatthew G. Knepley       ++level;
159074ef644bSMatthew G. Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
159174ef644bSMatthew G. Knepley       ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
159274ef644bSMatthew G. Knepley       if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
159374ef644bSMatthew G. Knepley       else         {numPoints = 0;}
159474ef644bSMatthew G. Knepley     }
159574ef644bSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
159674ef644bSMatthew G. Knepley   }
1597552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1598552f7358SJed Brown   PetscFunctionReturn(0);
1599552f7358SJed Brown }
1600552f7358SJed Brown 
1601552f7358SJed Brown #undef __FUNCT__
1602552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin"
1603552f7358SJed Brown /*@C
1604552f7358SJed Brown   DMPlexGetJoin - Get an array for the join of the set of points
1605552f7358SJed Brown 
1606552f7358SJed Brown   Not Collective
1607552f7358SJed Brown 
1608552f7358SJed Brown   Input Parameters:
1609552f7358SJed Brown + dm - The DMPlex object
1610552f7358SJed Brown . numPoints - The number of input points for the join
1611552f7358SJed Brown - points - The input points
1612552f7358SJed Brown 
1613552f7358SJed Brown   Output Parameters:
1614552f7358SJed Brown + numCoveredPoints - The number of points in the join
1615552f7358SJed Brown - coveredPoints - The points in the join
1616552f7358SJed Brown 
1617552f7358SJed Brown   Level: intermediate
1618552f7358SJed Brown 
1619552f7358SJed Brown   Note: Currently, this is restricted to a single level join
1620552f7358SJed Brown 
16213813dfbdSMatthew G Knepley   Fortran Notes:
16223813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
16233813dfbdSMatthew G Knepley   include petsc.h90 in your code.
16243813dfbdSMatthew G Knepley 
16253813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
16263813dfbdSMatthew G Knepley 
1627552f7358SJed Brown .keywords: mesh
1628552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet()
1629552f7358SJed Brown @*/
1630552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1631552f7358SJed Brown {
1632552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1633552f7358SJed Brown   PetscInt      *join[2];
1634552f7358SJed Brown   PetscInt       joinSize, i = 0;
1635552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1636552f7358SJed Brown   PetscErrorCode ierr;
1637552f7358SJed Brown 
1638552f7358SJed Brown   PetscFunctionBegin;
1639552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1640552f7358SJed Brown   PetscValidPointer(points, 2);
1641552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1642552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1643552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1644552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1645552f7358SJed Brown   /* Copy in support of first point */
1646552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr);
1647552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr);
1648552f7358SJed Brown   for (joinSize = 0; joinSize < dof; ++joinSize) {
1649552f7358SJed Brown     join[i][joinSize] = mesh->supports[off+joinSize];
1650552f7358SJed Brown   }
1651552f7358SJed Brown   /* Check each successive support */
1652552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1653552f7358SJed Brown     PetscInt newJoinSize = 0;
1654552f7358SJed Brown 
1655552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr);
1656552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr);
1657552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1658552f7358SJed Brown       const PetscInt point = mesh->supports[off+c];
1659552f7358SJed Brown 
1660552f7358SJed Brown       for (m = 0; m < joinSize; ++m) {
1661552f7358SJed Brown         if (point == join[i][m]) {
1662552f7358SJed Brown           join[1-i][newJoinSize++] = point;
1663552f7358SJed Brown           break;
1664552f7358SJed Brown         }
1665552f7358SJed Brown       }
1666552f7358SJed Brown     }
1667552f7358SJed Brown     joinSize = newJoinSize;
1668552f7358SJed Brown     i        = 1-i;
1669552f7358SJed Brown   }
1670552f7358SJed Brown   *numCoveredPoints = joinSize;
1671552f7358SJed Brown   *coveredPoints    = join[i];
1672552f7358SJed Brown   ierr              = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1673552f7358SJed Brown   PetscFunctionReturn(0);
1674552f7358SJed Brown }
1675552f7358SJed Brown 
1676552f7358SJed Brown #undef __FUNCT__
1677552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin"
1678552f7358SJed Brown /*@C
1679552f7358SJed Brown   DMPlexRestoreJoin - Restore an array for the join of the set of points
1680552f7358SJed Brown 
1681552f7358SJed Brown   Not Collective
1682552f7358SJed Brown 
1683552f7358SJed Brown   Input Parameters:
1684552f7358SJed Brown + dm - The DMPlex object
1685552f7358SJed Brown . numPoints - The number of input points for the join
1686552f7358SJed Brown - points - The input points
1687552f7358SJed Brown 
1688552f7358SJed Brown   Output Parameters:
1689552f7358SJed Brown + numCoveredPoints - The number of points in the join
1690552f7358SJed Brown - coveredPoints - The points in the join
1691552f7358SJed Brown 
16923813dfbdSMatthew G Knepley   Fortran Notes:
16933813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
16943813dfbdSMatthew G Knepley   include petsc.h90 in your code.
16953813dfbdSMatthew G Knepley 
16963813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
16973813dfbdSMatthew G Knepley 
1698552f7358SJed Brown   Level: intermediate
1699552f7358SJed Brown 
1700552f7358SJed Brown .keywords: mesh
1701552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet()
1702552f7358SJed Brown @*/
1703552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1704552f7358SJed Brown {
1705552f7358SJed Brown   PetscErrorCode ierr;
1706552f7358SJed Brown 
1707552f7358SJed Brown   PetscFunctionBegin;
1708552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1709d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
1710d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
1711d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints, 5);
1712552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1713d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
1714552f7358SJed Brown   PetscFunctionReturn(0);
1715552f7358SJed Brown }
1716552f7358SJed Brown 
1717552f7358SJed Brown #undef __FUNCT__
1718552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin"
1719552f7358SJed Brown /*@C
1720552f7358SJed Brown   DMPlexGetFullJoin - Get an array for the join of the set of points
1721552f7358SJed Brown 
1722552f7358SJed Brown   Not Collective
1723552f7358SJed Brown 
1724552f7358SJed Brown   Input Parameters:
1725552f7358SJed Brown + dm - The DMPlex object
1726552f7358SJed Brown . numPoints - The number of input points for the join
1727552f7358SJed Brown - points - The input points
1728552f7358SJed Brown 
1729552f7358SJed Brown   Output Parameters:
1730552f7358SJed Brown + numCoveredPoints - The number of points in the join
1731552f7358SJed Brown - coveredPoints - The points in the join
1732552f7358SJed Brown 
17333813dfbdSMatthew G Knepley   Fortran Notes:
17343813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
17353813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17363813dfbdSMatthew G Knepley 
17373813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17383813dfbdSMatthew G Knepley 
1739552f7358SJed Brown   Level: intermediate
1740552f7358SJed Brown 
1741552f7358SJed Brown .keywords: mesh
1742552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet()
1743552f7358SJed Brown @*/
1744552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1745552f7358SJed Brown {
1746552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1747552f7358SJed Brown   PetscInt      *offsets, **closures;
1748552f7358SJed Brown   PetscInt      *join[2];
1749552f7358SJed Brown   PetscInt       depth = 0, maxSize, joinSize = 0, i = 0;
1750552f7358SJed Brown   PetscInt       p, d, c, m;
1751552f7358SJed Brown   PetscErrorCode ierr;
1752552f7358SJed Brown 
1753552f7358SJed Brown   PetscFunctionBegin;
1754552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1755552f7358SJed Brown   PetscValidPointer(points, 2);
1756552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1757552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1758552f7358SJed Brown 
1759552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1760552f7358SJed Brown   ierr    = PetscMalloc(numPoints * sizeof(PetscInt*), &closures);CHKERRQ(ierr);
1761552f7358SJed Brown   ierr    = PetscMemzero(closures,numPoints*sizeof(PetscInt*));CHKERRQ(ierr);
1762552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1763e7b80042SMatthew G. Knepley   maxSize = PetscPowInt(mesh->maxSupportSize,depth+1);
1764552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1765552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1766552f7358SJed Brown 
1767552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1768552f7358SJed Brown     PetscInt closureSize;
1769552f7358SJed Brown 
1770552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr);
17710d644c17SKarl Rupp 
1772552f7358SJed Brown     offsets[p*(depth+2)+0] = 0;
1773552f7358SJed Brown     for (d = 0; d < depth+1; ++d) {
1774552f7358SJed Brown       PetscInt pStart, pEnd, i;
1775552f7358SJed Brown 
1776552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
1777552f7358SJed Brown       for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) {
1778552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
1779552f7358SJed Brown           offsets[p*(depth+2)+d+1] = i;
1780552f7358SJed Brown           break;
1781552f7358SJed Brown         }
1782552f7358SJed Brown       }
1783552f7358SJed Brown       if (i == closureSize) offsets[p*(depth+2)+d+1] = i;
1784552f7358SJed Brown     }
178582f516ccSBarry 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);
1786552f7358SJed Brown   }
1787552f7358SJed Brown   for (d = 0; d < depth+1; ++d) {
1788552f7358SJed Brown     PetscInt dof;
1789552f7358SJed Brown 
1790552f7358SJed Brown     /* Copy in support of first point */
1791552f7358SJed Brown     dof = offsets[d+1] - offsets[d];
1792552f7358SJed Brown     for (joinSize = 0; joinSize < dof; ++joinSize) {
1793552f7358SJed Brown       join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2];
1794552f7358SJed Brown     }
1795552f7358SJed Brown     /* Check each successive cone */
1796552f7358SJed Brown     for (p = 1; p < numPoints && joinSize; ++p) {
1797552f7358SJed Brown       PetscInt newJoinSize = 0;
1798552f7358SJed Brown 
1799552f7358SJed Brown       dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d];
1800552f7358SJed Brown       for (c = 0; c < dof; ++c) {
1801552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2];
1802552f7358SJed Brown 
1803552f7358SJed Brown         for (m = 0; m < joinSize; ++m) {
1804552f7358SJed Brown           if (point == join[i][m]) {
1805552f7358SJed Brown             join[1-i][newJoinSize++] = point;
1806552f7358SJed Brown             break;
1807552f7358SJed Brown           }
1808552f7358SJed Brown         }
1809552f7358SJed Brown       }
1810552f7358SJed Brown       joinSize = newJoinSize;
1811552f7358SJed Brown       i        = 1-i;
1812552f7358SJed Brown     }
1813552f7358SJed Brown     if (joinSize) break;
1814552f7358SJed Brown   }
1815552f7358SJed Brown   *numCoveredPoints = joinSize;
1816552f7358SJed Brown   *coveredPoints    = join[i];
1817552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
18180298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr);
1819552f7358SJed Brown   }
1820552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
1821552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1822552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1823552f7358SJed Brown   PetscFunctionReturn(0);
1824552f7358SJed Brown }
1825552f7358SJed Brown 
1826552f7358SJed Brown #undef __FUNCT__
1827552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet"
1828552f7358SJed Brown /*@C
1829552f7358SJed Brown   DMPlexGetMeet - Get an array for the meet of the set of points
1830552f7358SJed Brown 
1831552f7358SJed Brown   Not Collective
1832552f7358SJed Brown 
1833552f7358SJed Brown   Input Parameters:
1834552f7358SJed Brown + dm - The DMPlex object
1835552f7358SJed Brown . numPoints - The number of input points for the meet
1836552f7358SJed Brown - points - The input points
1837552f7358SJed Brown 
1838552f7358SJed Brown   Output Parameters:
1839552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1840552f7358SJed Brown - coveredPoints - The points in the meet
1841552f7358SJed Brown 
1842552f7358SJed Brown   Level: intermediate
1843552f7358SJed Brown 
1844552f7358SJed Brown   Note: Currently, this is restricted to a single level meet
1845552f7358SJed Brown 
18463813dfbdSMatthew G Knepley   Fortran Notes:
18473813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18483813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18493813dfbdSMatthew G Knepley 
18503813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18513813dfbdSMatthew G Knepley 
1852552f7358SJed Brown .keywords: mesh
1853552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin()
1854552f7358SJed Brown @*/
1855552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints)
1856552f7358SJed Brown {
1857552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1858552f7358SJed Brown   PetscInt      *meet[2];
1859552f7358SJed Brown   PetscInt       meetSize, i = 0;
1860552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1861552f7358SJed Brown   PetscErrorCode ierr;
1862552f7358SJed Brown 
1863552f7358SJed Brown   PetscFunctionBegin;
1864552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1865552f7358SJed Brown   PetscValidPointer(points, 2);
1866552f7358SJed Brown   PetscValidPointer(numCoveringPoints, 3);
1867552f7358SJed Brown   PetscValidPointer(coveringPoints, 4);
1868552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
1869552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
1870552f7358SJed Brown   /* Copy in cone of first point */
1871552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr);
1872552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr);
1873552f7358SJed Brown   for (meetSize = 0; meetSize < dof; ++meetSize) {
1874552f7358SJed Brown     meet[i][meetSize] = mesh->cones[off+meetSize];
1875552f7358SJed Brown   }
1876552f7358SJed Brown   /* Check each successive cone */
1877552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1878552f7358SJed Brown     PetscInt newMeetSize = 0;
1879552f7358SJed Brown 
1880552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr);
1881552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr);
1882552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1883552f7358SJed Brown       const PetscInt point = mesh->cones[off+c];
1884552f7358SJed Brown 
1885552f7358SJed Brown       for (m = 0; m < meetSize; ++m) {
1886552f7358SJed Brown         if (point == meet[i][m]) {
1887552f7358SJed Brown           meet[1-i][newMeetSize++] = point;
1888552f7358SJed Brown           break;
1889552f7358SJed Brown         }
1890552f7358SJed Brown       }
1891552f7358SJed Brown     }
1892552f7358SJed Brown     meetSize = newMeetSize;
1893552f7358SJed Brown     i        = 1-i;
1894552f7358SJed Brown   }
1895552f7358SJed Brown   *numCoveringPoints = meetSize;
1896552f7358SJed Brown   *coveringPoints    = meet[i];
1897552f7358SJed Brown   ierr               = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
1898552f7358SJed Brown   PetscFunctionReturn(0);
1899552f7358SJed Brown }
1900552f7358SJed Brown 
1901552f7358SJed Brown #undef __FUNCT__
1902552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet"
1903552f7358SJed Brown /*@C
1904552f7358SJed Brown   DMPlexRestoreMeet - Restore an array for the meet of the set of points
1905552f7358SJed Brown 
1906552f7358SJed Brown   Not Collective
1907552f7358SJed Brown 
1908552f7358SJed Brown   Input Parameters:
1909552f7358SJed Brown + dm - The DMPlex object
1910552f7358SJed Brown . numPoints - The number of input points for the meet
1911552f7358SJed Brown - points - The input points
1912552f7358SJed Brown 
1913552f7358SJed Brown   Output Parameters:
1914552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1915552f7358SJed Brown - coveredPoints - The points in the meet
1916552f7358SJed Brown 
1917552f7358SJed Brown   Level: intermediate
1918552f7358SJed Brown 
19193813dfbdSMatthew G Knepley   Fortran Notes:
19203813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
19213813dfbdSMatthew G Knepley   include petsc.h90 in your code.
19223813dfbdSMatthew G Knepley 
19233813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
19243813dfbdSMatthew G Knepley 
1925552f7358SJed Brown .keywords: mesh
1926552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin()
1927552f7358SJed Brown @*/
1928552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1929552f7358SJed Brown {
1930552f7358SJed Brown   PetscErrorCode ierr;
1931552f7358SJed Brown 
1932552f7358SJed Brown   PetscFunctionBegin;
1933552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1934d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
1935d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
1936d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints,5);
1937552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1938d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
1939552f7358SJed Brown   PetscFunctionReturn(0);
1940552f7358SJed Brown }
1941552f7358SJed Brown 
1942552f7358SJed Brown #undef __FUNCT__
1943552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet"
1944552f7358SJed Brown /*@C
1945552f7358SJed Brown   DMPlexGetFullMeet - Get an array for the meet of the set of points
1946552f7358SJed Brown 
1947552f7358SJed Brown   Not Collective
1948552f7358SJed Brown 
1949552f7358SJed Brown   Input Parameters:
1950552f7358SJed Brown + dm - The DMPlex object
1951552f7358SJed Brown . numPoints - The number of input points for the meet
1952552f7358SJed Brown - points - The input points
1953552f7358SJed Brown 
1954552f7358SJed Brown   Output Parameters:
1955552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1956552f7358SJed Brown - coveredPoints - The points in the meet
1957552f7358SJed Brown 
1958552f7358SJed Brown   Level: intermediate
1959552f7358SJed Brown 
19603813dfbdSMatthew G Knepley   Fortran Notes:
19613813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
19623813dfbdSMatthew G Knepley   include petsc.h90 in your code.
19633813dfbdSMatthew G Knepley 
19643813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
19653813dfbdSMatthew G Knepley 
1966552f7358SJed Brown .keywords: mesh
1967552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin()
1968552f7358SJed Brown @*/
1969552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1970552f7358SJed Brown {
1971552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1972552f7358SJed Brown   PetscInt      *offsets, **closures;
1973552f7358SJed Brown   PetscInt      *meet[2];
1974552f7358SJed Brown   PetscInt       height = 0, maxSize, meetSize = 0, i = 0;
1975552f7358SJed Brown   PetscInt       p, h, c, m;
1976552f7358SJed Brown   PetscErrorCode ierr;
1977552f7358SJed Brown 
1978552f7358SJed Brown   PetscFunctionBegin;
1979552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1980552f7358SJed Brown   PetscValidPointer(points, 2);
1981552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1982552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1983552f7358SJed Brown 
1984552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &height);CHKERRQ(ierr);
1985552f7358SJed Brown   ierr    = PetscMalloc(numPoints * sizeof(PetscInt*), &closures);CHKERRQ(ierr);
1986552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1987e7b80042SMatthew G. Knepley   maxSize = PetscPowInt(mesh->maxConeSize,height+1);
1988552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
1989552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
1990552f7358SJed Brown 
1991552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1992552f7358SJed Brown     PetscInt closureSize;
1993552f7358SJed Brown 
1994552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr);
19950d644c17SKarl Rupp 
1996552f7358SJed Brown     offsets[p*(height+2)+0] = 0;
1997552f7358SJed Brown     for (h = 0; h < height+1; ++h) {
1998552f7358SJed Brown       PetscInt pStart, pEnd, i;
1999552f7358SJed Brown 
2000552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr);
2001552f7358SJed Brown       for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) {
2002552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
2003552f7358SJed Brown           offsets[p*(height+2)+h+1] = i;
2004552f7358SJed Brown           break;
2005552f7358SJed Brown         }
2006552f7358SJed Brown       }
2007552f7358SJed Brown       if (i == closureSize) offsets[p*(height+2)+h+1] = i;
2008552f7358SJed Brown     }
200982f516ccSBarry 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);
2010552f7358SJed Brown   }
2011552f7358SJed Brown   for (h = 0; h < height+1; ++h) {
2012552f7358SJed Brown     PetscInt dof;
2013552f7358SJed Brown 
2014552f7358SJed Brown     /* Copy in cone of first point */
2015552f7358SJed Brown     dof = offsets[h+1] - offsets[h];
2016552f7358SJed Brown     for (meetSize = 0; meetSize < dof; ++meetSize) {
2017552f7358SJed Brown       meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2];
2018552f7358SJed Brown     }
2019552f7358SJed Brown     /* Check each successive cone */
2020552f7358SJed Brown     for (p = 1; p < numPoints && meetSize; ++p) {
2021552f7358SJed Brown       PetscInt newMeetSize = 0;
2022552f7358SJed Brown 
2023552f7358SJed Brown       dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h];
2024552f7358SJed Brown       for (c = 0; c < dof; ++c) {
2025552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2];
2026552f7358SJed Brown 
2027552f7358SJed Brown         for (m = 0; m < meetSize; ++m) {
2028552f7358SJed Brown           if (point == meet[i][m]) {
2029552f7358SJed Brown             meet[1-i][newMeetSize++] = point;
2030552f7358SJed Brown             break;
2031552f7358SJed Brown           }
2032552f7358SJed Brown         }
2033552f7358SJed Brown       }
2034552f7358SJed Brown       meetSize = newMeetSize;
2035552f7358SJed Brown       i        = 1-i;
2036552f7358SJed Brown     }
2037552f7358SJed Brown     if (meetSize) break;
2038552f7358SJed Brown   }
2039552f7358SJed Brown   *numCoveredPoints = meetSize;
2040552f7358SJed Brown   *coveredPoints    = meet[i];
2041552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
20420298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr);
2043552f7358SJed Brown   }
2044552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
2045552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
2046552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
2047552f7358SJed Brown   PetscFunctionReturn(0);
2048552f7358SJed Brown }
2049552f7358SJed Brown 
2050552f7358SJed Brown #undef __FUNCT__
20514e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual"
20524e3744c5SMatthew G. Knepley /*@C
20534e3744c5SMatthew G. Knepley   DMPlexEqual - Determine if two DMs have the same topology
20544e3744c5SMatthew G. Knepley 
20554e3744c5SMatthew G. Knepley   Not Collective
20564e3744c5SMatthew G. Knepley 
20574e3744c5SMatthew G. Knepley   Input Parameters:
20584e3744c5SMatthew G. Knepley + dmA - A DMPlex object
20594e3744c5SMatthew G. Knepley - dmB - A DMPlex object
20604e3744c5SMatthew G. Knepley 
20614e3744c5SMatthew G. Knepley   Output Parameters:
20624e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical
20634e3744c5SMatthew G. Knepley 
20644e3744c5SMatthew G. Knepley   Level: intermediate
20654e3744c5SMatthew G. Knepley 
20664e3744c5SMatthew G. Knepley   Notes:
20674e3744c5SMatthew G. Knepley   We are not solving graph isomorphism, so we do not permutation.
20684e3744c5SMatthew G. Knepley 
20694e3744c5SMatthew G. Knepley .keywords: mesh
20704e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone()
20714e3744c5SMatthew G. Knepley @*/
20724e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal)
20734e3744c5SMatthew G. Knepley {
20744e3744c5SMatthew G. Knepley   PetscInt       depth, depthB, pStart, pEnd, pStartB, pEndB, p;
20754e3744c5SMatthew G. Knepley   PetscErrorCode ierr;
20764e3744c5SMatthew G. Knepley 
20774e3744c5SMatthew G. Knepley   PetscFunctionBegin;
20784e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmA, DM_CLASSID, 1);
20794e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmB, DM_CLASSID, 2);
20804e3744c5SMatthew G. Knepley   PetscValidPointer(equal, 3);
20814e3744c5SMatthew G. Knepley 
20824e3744c5SMatthew G. Knepley   *equal = PETSC_FALSE;
20834e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr);
20844e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr);
20854e3744c5SMatthew G. Knepley   if (depth != depthB) PetscFunctionReturn(0);
20864e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmA, &pStart,  &pEnd);CHKERRQ(ierr);
20874e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr);
20884e3744c5SMatthew G. Knepley   if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0);
20894e3744c5SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
20904e3744c5SMatthew G. Knepley     const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB;
20914e3744c5SMatthew G. Knepley     PetscInt        coneSize, coneSizeB, c, supportSize, supportSizeB, s;
20924e3744c5SMatthew G. Knepley 
20934e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr);
20944e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr);
20954e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr);
20964e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr);
20974e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr);
20984e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr);
20994e3744c5SMatthew G. Knepley     if (coneSize != coneSizeB) PetscFunctionReturn(0);
21004e3744c5SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
21014e3744c5SMatthew G. Knepley       if (cone[c] != coneB[c]) PetscFunctionReturn(0);
21024e3744c5SMatthew G. Knepley       if (ornt[c] != orntB[c]) PetscFunctionReturn(0);
21034e3744c5SMatthew G. Knepley     }
21044e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr);
21054e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr);
21064e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr);
21074e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr);
21084e3744c5SMatthew G. Knepley     if (supportSize != supportSizeB) PetscFunctionReturn(0);
21094e3744c5SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
21104e3744c5SMatthew G. Knepley       if (support[s] != supportB[s]) PetscFunctionReturn(0);
21114e3744c5SMatthew G. Knepley     }
21124e3744c5SMatthew G. Knepley   }
21134e3744c5SMatthew G. Knepley   *equal = PETSC_TRUE;
21144e3744c5SMatthew G. Knepley   PetscFunctionReturn(0);
21154e3744c5SMatthew G. Knepley }
21164e3744c5SMatthew G. Knepley 
21174e3744c5SMatthew G. Knepley #undef __FUNCT__
211818ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices"
211918ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices)
2120a6dfd86eSKarl Rupp {
212182f516ccSBarry Smith   MPI_Comm       comm;
2122552f7358SJed Brown   PetscErrorCode ierr;
2123552f7358SJed Brown 
2124552f7358SJed Brown   PetscFunctionBegin;
212582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2126552f7358SJed Brown   PetscValidPointer(numFaceVertices,3);
2127552f7358SJed Brown   switch (cellDim) {
2128552f7358SJed Brown   case 0:
2129552f7358SJed Brown     *numFaceVertices = 0;
2130552f7358SJed Brown     break;
2131552f7358SJed Brown   case 1:
2132552f7358SJed Brown     *numFaceVertices = 1;
2133552f7358SJed Brown     break;
2134552f7358SJed Brown   case 2:
2135552f7358SJed Brown     switch (numCorners) {
213619436ca2SJed Brown     case 3: /* triangle */
213719436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2138552f7358SJed Brown       break;
213919436ca2SJed Brown     case 4: /* quadrilateral */
214019436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2141552f7358SJed Brown       break;
214219436ca2SJed Brown     case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */
214319436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2144552f7358SJed Brown       break;
214519436ca2SJed Brown     case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */
214619436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2147552f7358SJed Brown       break;
2148552f7358SJed Brown     default:
2149552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2150552f7358SJed Brown     }
2151552f7358SJed Brown     break;
2152552f7358SJed Brown   case 3:
2153552f7358SJed Brown     switch (numCorners) {
215419436ca2SJed Brown     case 4: /* tetradehdron */
215519436ca2SJed Brown       *numFaceVertices = 3; /* Face has 3 vertices */
2156552f7358SJed Brown       break;
215719436ca2SJed Brown     case 6: /* tet cohesive cells */
215819436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2159552f7358SJed Brown       break;
216019436ca2SJed Brown     case 8: /* hexahedron */
216119436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2162552f7358SJed Brown       break;
216319436ca2SJed Brown     case 9: /* tet cohesive Lagrange cells */
216419436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2165552f7358SJed Brown       break;
216619436ca2SJed Brown     case 10: /* quadratic tetrahedron */
216719436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2168552f7358SJed Brown       break;
216919436ca2SJed Brown     case 12: /* hex cohesive Lagrange cells */
217019436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2171552f7358SJed Brown       break;
217219436ca2SJed Brown     case 18: /* quadratic tet cohesive Lagrange cells */
217319436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2174552f7358SJed Brown       break;
217519436ca2SJed Brown     case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */
217619436ca2SJed Brown       *numFaceVertices = 9; /* Face has 9 vertices */
2177552f7358SJed Brown       break;
2178552f7358SJed Brown     default:
2179552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2180552f7358SJed Brown     }
2181552f7358SJed Brown     break;
2182552f7358SJed Brown   default:
2183552f7358SJed Brown     SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim);
2184552f7358SJed Brown   }
2185552f7358SJed Brown   PetscFunctionReturn(0);
2186552f7358SJed Brown }
2187552f7358SJed Brown 
2188552f7358SJed Brown #undef __FUNCT__
2189d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient"
2190d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */
2191d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm)
2192d27a0f52SMatthew G. Knepley {
2193a1b4d4a2SMatthew G. Knepley   PetscBT        seenCells, flippedCells, seenFaces;
2194a1b4d4a2SMatthew G. Knepley   PetscInt      *faceFIFO, fTop, fBottom;
2195a1b4d4a2SMatthew G. Knepley   PetscInt       dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO;
2196d27a0f52SMatthew G. Knepley   PetscErrorCode ierr;
2197d27a0f52SMatthew G. Knepley 
2198d27a0f52SMatthew G. Knepley   PetscFunctionBegin;
2199d27a0f52SMatthew G. Knepley   /* Truth Table
2200d27a0f52SMatthew G. Knepley      mismatch    flips   do action   mismatch   flipA ^ flipB   action
2201d27a0f52SMatthew G. Knepley          F       0 flips     no         F             F           F
2202d27a0f52SMatthew G. Knepley          F       1 flip      yes        F             T           T
2203d27a0f52SMatthew G. Knepley          F       2 flips     no         T             F           T
2204d27a0f52SMatthew G. Knepley          T       0 flips     yes        T             T           F
2205d27a0f52SMatthew G. Knepley          T       1 flip      no
2206d27a0f52SMatthew G. Knepley          T       2 flips     yes
2207d27a0f52SMatthew G. Knepley   */
2208a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2209d27a0f52SMatthew G. Knepley   ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr);
2210a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h,   &cStart, &cEnd);CHKERRQ(ierr);
2211d27a0f52SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr);
2212a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr);
2213a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr);
2214a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr);
2215a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr);
2216a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr);
2217a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr);
2218a1b4d4a2SMatthew G. Knepley   ierr = PetscMalloc((fEnd - fStart) * sizeof(PetscInt), &faceFIFO);CHKERRQ(ierr);
2219a1b4d4a2SMatthew G. Knepley   fTop = fBottom = 0;
2220a1b4d4a2SMatthew G. Knepley   /* Initialize FIFO with first cell */
2221defeeaeaSMatthew G. Knepley   if (cEnd > cStart) {
2222a1b4d4a2SMatthew G. Knepley     const PetscInt *cone;
2223a1b4d4a2SMatthew G. Knepley     PetscInt        coneSize;
2224a1b4d4a2SMatthew G. Knepley 
2225a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr);
2226a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr);
2227a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
2228a1b4d4a2SMatthew G. Knepley       faceFIFO[fBottom++] = cone[c];
2229a1b4d4a2SMatthew G. Knepley       ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr);
2230a1b4d4a2SMatthew G. Knepley     }
2231a1b4d4a2SMatthew G. Knepley   }
2232a1b4d4a2SMatthew G. Knepley   /* Consider each face in FIFO */
2233a1b4d4a2SMatthew G. Knepley   while (fTop < fBottom) {
2234d27a0f52SMatthew G. Knepley     const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB;
2235a1b4d4a2SMatthew G. Knepley     PetscInt        supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1;
2236d27a0f52SMatthew G. Knepley     PetscInt        seenA, flippedA, seenB, flippedB, mismatch;
2237d27a0f52SMatthew G. Knepley 
2238a1b4d4a2SMatthew G. Knepley     face = faceFIFO[fTop++];
2239a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2240a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2241d27a0f52SMatthew G. Knepley     if (supportSize < 2) continue;
2242d27a0f52SMatthew G. Knepley     if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize);
2243a1b4d4a2SMatthew G. Knepley     seenA    = PetscBTLookup(seenCells,    support[0]-cStart);
224486cff514SMatthew G. Knepley     flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0;
2245a1b4d4a2SMatthew G. Knepley     seenB    = PetscBTLookup(seenCells,    support[1]-cStart);
224686cff514SMatthew G. Knepley     flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0;
2247d27a0f52SMatthew G. Knepley 
2248d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr);
2249d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr);
2250d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr);
2251d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr);
2252d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr);
2253d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr);
2254a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeA; ++c) {
2255a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) {
2256a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneA[c];
2257a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr);
2258a1b4d4a2SMatthew G. Knepley       }
2259a1b4d4a2SMatthew G. Knepley       if (coneA[c] == face) posA = c;
2260a1b4d4a2SMatthew 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);
2261a1b4d4a2SMatthew G. Knepley     }
2262a1b4d4a2SMatthew 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]);
2263a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeB; ++c) {
2264a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) {
2265a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneB[c];
2266a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr);
2267a1b4d4a2SMatthew G. Knepley       }
2268a1b4d4a2SMatthew G. Knepley       if (coneB[c] == face) posB = c;
2269a1b4d4a2SMatthew 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);
2270a1b4d4a2SMatthew G. Knepley     }
2271a1b4d4a2SMatthew 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]);
2272d27a0f52SMatthew G. Knepley 
2273d27a0f52SMatthew G. Knepley     if (dim == 1) {
2274d27a0f52SMatthew G. Knepley       mismatch = posA == posB;
2275d27a0f52SMatthew G. Knepley     } else {
2276d27a0f52SMatthew G. Knepley       mismatch = coneOA[posA] == coneOB[posB];
2277d27a0f52SMatthew G. Knepley     }
2278d27a0f52SMatthew G. Knepley 
2279d27a0f52SMatthew G. Knepley     if (mismatch ^ (flippedA ^ flippedB)) {
2280d27a0f52SMatthew 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]);
2281d27a0f52SMatthew G. Knepley       if (!seenA && !flippedA) {
2282a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr);
2283d27a0f52SMatthew G. Knepley       } else if (!seenB && !flippedB) {
2284a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr);
2285d27a0f52SMatthew G. Knepley       } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
228686cff514SMatthew 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");
2287a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr);
2288a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr);
2289d27a0f52SMatthew G. Knepley   }
2290a1b4d4a2SMatthew G. Knepley 
2291d27a0f52SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2292d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2293d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2294a1b4d4a2SMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2295f4e909fcSMatthew G. Knepley     const PetscInt *cone, *coneO, *support;
2296f4e909fcSMatthew G. Knepley     PetscInt        coneSize, supportSize, faceSize, cp, sp;
2297d27a0f52SMatthew G. Knepley 
2298a1b4d4a2SMatthew G. Knepley     if (!PetscBTLookup(flippedCells, c-cStart)) continue;
2299a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2300a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2301a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr);
2302a1b4d4a2SMatthew G. Knepley     for (cp = 0; cp < coneSize; ++cp) {
2303a1b4d4a2SMatthew G. Knepley       const PetscInt rcp = coneSize-cp-1;
2304a1b4d4a2SMatthew G. Knepley 
2305a1b4d4a2SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr);
2306a1b4d4a2SMatthew G. Knepley       revcone[cp]  = cone[rcp];
2307a1b4d4a2SMatthew G. Knepley       revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp];
2308d27a0f52SMatthew G. Knepley     }
2309a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr);
2310a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr);
2311f4e909fcSMatthew G. Knepley     /* Reverse orientations of support */
2312f4e909fcSMatthew G. Knepley     faceSize = coneSize;
2313f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr);
2314f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr);
2315f4e909fcSMatthew G. Knepley     for (sp = 0; sp < supportSize; ++sp) {
2316f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr);
2317f4e909fcSMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr);
2318f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr);
2319f4e909fcSMatthew G. Knepley       for (cp = 0; cp < coneSize; ++cp) {
2320f4e909fcSMatthew G. Knepley         if (cone[cp] != c) continue;
2321f4e909fcSMatthew G. Knepley         ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr);
2322f4e909fcSMatthew G. Knepley       }
2323f4e909fcSMatthew G. Knepley     }
2324d27a0f52SMatthew G. Knepley   }
2325d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2326d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2327d27a0f52SMatthew G. Knepley   ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr);
2328a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr);
2329a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr);
2330a1b4d4a2SMatthew G. Knepley   ierr = PetscFree(faceFIFO);CHKERRQ(ierr);
2331d27a0f52SMatthew G. Knepley   PetscFunctionReturn(0);
2332d27a0f52SMatthew G. Knepley }
2333d27a0f52SMatthew G. Knepley 
2334d27a0f52SMatthew G. Knepley #undef __FUNCT__
2335cb1e1211SMatthew G Knepley #define __FUNCT__ "DMPlexGetAdjacencySingleLevel_Internal"
2336cb1e1211SMatthew G Knepley static PetscErrorCode DMPlexGetAdjacencySingleLevel_Internal(DM dm, PetscInt p, PetscBool useClosure, const PetscInt *tmpClosure, PetscInt *adjSize, PetscInt adj[])
2337cb1e1211SMatthew G Knepley {
2338cb1e1211SMatthew G Knepley   const PetscInt *support = NULL;
2339cb1e1211SMatthew G Knepley   PetscInt        numAdj   = 0, maxAdjSize = *adjSize, supportSize, s;
2340cb1e1211SMatthew G Knepley   PetscErrorCode  ierr;
2341cb1e1211SMatthew G Knepley 
2342cb1e1211SMatthew G Knepley   PetscFunctionBegin;
2343cb1e1211SMatthew G Knepley   if (useClosure) {
2344cb1e1211SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &supportSize);CHKERRQ(ierr);
2345cb1e1211SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &support);CHKERRQ(ierr);
2346cb1e1211SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
2347cb1e1211SMatthew G Knepley       const PetscInt *cone = NULL;
2348cb1e1211SMatthew G Knepley       PetscInt        coneSize, c, q;
2349cb1e1211SMatthew G Knepley 
2350cb1e1211SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, support[s], &coneSize);CHKERRQ(ierr);
2351cb1e1211SMatthew G Knepley       ierr = DMPlexGetSupport(dm, support[s], &cone);CHKERRQ(ierr);
2352cb1e1211SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
2353cb1e1211SMatthew G Knepley         for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) {
2354cb1e1211SMatthew G Knepley           if (cone[c] == adj[q]) break;
2355cb1e1211SMatthew G Knepley         }
2356cb1e1211SMatthew G Knepley         if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize);
2357cb1e1211SMatthew G Knepley       }
2358cb1e1211SMatthew G Knepley     }
2359cb1e1211SMatthew G Knepley   } else {
2360cb1e1211SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
2361cb1e1211SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
2362cb1e1211SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
2363cb1e1211SMatthew G Knepley       const PetscInt *cone = NULL;
2364cb1e1211SMatthew G Knepley       PetscInt        coneSize, c, q;
2365cb1e1211SMatthew G Knepley 
2366cb1e1211SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
2367cb1e1211SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
2368cb1e1211SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
2369cb1e1211SMatthew G Knepley         for (q = 0; q < numAdj || (adj[numAdj++] = cone[c],0); ++q) {
2370cb1e1211SMatthew G Knepley           if (cone[c] == adj[q]) break;
2371cb1e1211SMatthew G Knepley         }
2372cb1e1211SMatthew G Knepley         if (numAdj > maxAdjSize) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid mesh exceeded adjacency allocation (%D)", maxAdjSize);
2373cb1e1211SMatthew G Knepley       }
2374cb1e1211SMatthew G Knepley     }
2375cb1e1211SMatthew G Knepley   }
2376cb1e1211SMatthew G Knepley   *adjSize = numAdj;
2377cb1e1211SMatthew G Knepley   PetscFunctionReturn(0);
2378cb1e1211SMatthew G Knepley }
2379cb1e1211SMatthew G Knepley 
2380cb1e1211SMatthew G Knepley #undef __FUNCT__
2381552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNeighborCSR"
238277c88f5bSMatthew G Knepley PetscErrorCode DMPlexCreateNeighborCSR(DM dm, PetscInt cellHeight, PetscInt *numVertices, PetscInt **offsets, PetscInt **adjacency)
23830adebc6cSBarry Smith {
2384552f7358SJed Brown   const PetscInt maxFaceCases = 30;
2385552f7358SJed Brown   PetscInt       numFaceCases = 0;
2386552f7358SJed Brown   PetscInt       numFaceVertices[30]; /* maxFaceCases, C89 sucks sucks sucks */
2387552f7358SJed Brown   PetscInt      *off, *adj;
2388552f7358SJed Brown   PetscInt      *neighborCells, *tmpClosure;
2389552f7358SJed Brown   PetscInt       maxConeSize, maxSupportSize, maxClosure, maxNeighbors;
239077c88f5bSMatthew G Knepley   PetscInt       dim, cellDim, depth = 0, faceDepth, cStart, cEnd, c, numCells, cell;
2391552f7358SJed Brown   PetscErrorCode ierr;
2392552f7358SJed Brown 
2393552f7358SJed Brown   PetscFunctionBegin;
2394552f7358SJed Brown   /* For parallel partitioning, I think you have to communicate supports */
2395552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
239677c88f5bSMatthew G Knepley   cellDim = dim - cellHeight;
2397552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
239877c88f5bSMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
2399552f7358SJed Brown   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
2400552f7358SJed Brown   if (cEnd - cStart == 0) {
2401552f7358SJed Brown     if (numVertices) *numVertices = 0;
24020298fd71SBarry Smith     if (offsets)   *offsets   = NULL;
24030298fd71SBarry Smith     if (adjacency) *adjacency = NULL;
2404552f7358SJed Brown     PetscFunctionReturn(0);
2405552f7358SJed Brown   }
2406552f7358SJed Brown   numCells  = cEnd - cStart;
240777c88f5bSMatthew G Knepley   faceDepth = depth - cellHeight;
2408552f7358SJed Brown   /* Setup face recognition */
240977c88f5bSMatthew G Knepley   if (faceDepth == 1) {
2410552f7358SJed 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 */
2411552f7358SJed Brown 
2412552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
2413552f7358SJed Brown       PetscInt corners;
2414552f7358SJed Brown 
2415552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, c, &corners);CHKERRQ(ierr);
2416552f7358SJed Brown       if (!cornersSeen[corners]) {
2417552f7358SJed Brown         PetscInt nFV;
2418552f7358SJed Brown 
241982f516ccSBarry Smith         if (numFaceCases >= maxFaceCases) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Exceeded maximum number of face recognition cases");
2420552f7358SJed Brown         cornersSeen[corners] = 1;
24210d644c17SKarl Rupp 
242218ad9376SMatthew G. Knepley         ierr = DMPlexGetNumFaceVertices(dm, cellDim, corners, &nFV);CHKERRQ(ierr);
24230d644c17SKarl Rupp 
2424552f7358SJed Brown         numFaceVertices[numFaceCases++] = nFV;
2425552f7358SJed Brown       }
2426552f7358SJed Brown     }
2427552f7358SJed Brown   }
2428e7b80042SMatthew G. Knepley   maxClosure   = 2*PetscMax(PetscPowInt(maxConeSize,depth+1),PetscPowInt(maxSupportSize,depth+1));
2429e7b80042SMatthew G. Knepley   maxNeighbors = PetscPowInt(maxConeSize,depth+1)*PetscPowInt(maxSupportSize,depth+1);
2430552f7358SJed Brown   ierr         = PetscMalloc2(maxNeighbors,PetscInt,&neighborCells,maxClosure,PetscInt,&tmpClosure);CHKERRQ(ierr);
2431552f7358SJed Brown   ierr         = PetscMalloc((numCells+1) * sizeof(PetscInt), &off);CHKERRQ(ierr);
2432552f7358SJed Brown   ierr         = PetscMemzero(off, (numCells+1) * sizeof(PetscInt));CHKERRQ(ierr);
2433552f7358SJed Brown   /* Count neighboring cells */
2434552f7358SJed Brown   for (cell = cStart; cell < cEnd; ++cell) {
2435552f7358SJed Brown     PetscInt numNeighbors = maxNeighbors, n;
2436552f7358SJed Brown 
2437cb1e1211SMatthew G Knepley     ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr);
2438552f7358SJed Brown     /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */
2439552f7358SJed Brown     for (n = 0; n < numNeighbors; ++n) {
24404d25b1e8SKarl Rupp       PetscInt        cellPair[2];
244177c88f5bSMatthew G Knepley       PetscBool       found    = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE;
2442552f7358SJed Brown       PetscInt        meetSize = 0;
24430298fd71SBarry Smith       const PetscInt *meet    = NULL;
2444552f7358SJed Brown 
24454d25b1e8SKarl Rupp       cellPair[0] = cell; cellPair[1] = neighborCells[n];
2446552f7358SJed Brown       if (cellPair[0] == cellPair[1]) continue;
2447552f7358SJed Brown       if (!found) {
2448552f7358SJed Brown         ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2449552f7358SJed Brown         if (meetSize) {
2450552f7358SJed Brown           PetscInt f;
2451552f7358SJed Brown 
2452552f7358SJed Brown           for (f = 0; f < numFaceCases; ++f) {
2453552f7358SJed Brown             if (numFaceVertices[f] == meetSize) {
2454552f7358SJed Brown               found = PETSC_TRUE;
2455552f7358SJed Brown               break;
2456552f7358SJed Brown             }
2457552f7358SJed Brown           }
2458552f7358SJed Brown         }
2459552f7358SJed Brown         ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2460552f7358SJed Brown       }
24610d644c17SKarl Rupp       if (found) ++off[cell-cStart+1];
2462552f7358SJed Brown     }
2463552f7358SJed Brown   }
2464552f7358SJed Brown   /* Prefix sum */
24650d644c17SKarl Rupp   for (cell = 1; cell <= numCells; ++cell) off[cell] += off[cell-1];
24660d644c17SKarl Rupp 
2467552f7358SJed Brown   if (adjacency) {
2468552f7358SJed Brown     ierr = PetscMalloc(off[numCells] * sizeof(PetscInt), &adj);CHKERRQ(ierr);
2469552f7358SJed Brown     /* Get neighboring cells */
2470552f7358SJed Brown     for (cell = cStart; cell < cEnd; ++cell) {
2471552f7358SJed Brown       PetscInt numNeighbors = maxNeighbors, n;
2472552f7358SJed Brown       PetscInt cellOffset   = 0;
2473552f7358SJed Brown 
2474cb1e1211SMatthew G Knepley       ierr = DMPlexGetAdjacencySingleLevel_Internal(dm, cell, PETSC_TRUE, tmpClosure, &numNeighbors, neighborCells);CHKERRQ(ierr);
2475552f7358SJed Brown       /* Get meet with each cell, and check with recognizer (could optimize to check each pair only once) */
2476552f7358SJed Brown       for (n = 0; n < numNeighbors; ++n) {
24774d25b1e8SKarl Rupp         PetscInt        cellPair[2];
247877c88f5bSMatthew G Knepley         PetscBool       found    = faceDepth > 1 ? PETSC_TRUE : PETSC_FALSE;
2479552f7358SJed Brown         PetscInt        meetSize = 0;
24800298fd71SBarry Smith         const PetscInt *meet    = NULL;
2481552f7358SJed Brown 
24824d25b1e8SKarl Rupp         cellPair[0] = cell; cellPair[1] = neighborCells[n];
2483552f7358SJed Brown         if (cellPair[0] == cellPair[1]) continue;
2484552f7358SJed Brown         if (!found) {
2485552f7358SJed Brown           ierr = DMPlexGetMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2486552f7358SJed Brown           if (meetSize) {
2487552f7358SJed Brown             PetscInt f;
2488552f7358SJed Brown 
2489552f7358SJed Brown             for (f = 0; f < numFaceCases; ++f) {
2490552f7358SJed Brown               if (numFaceVertices[f] == meetSize) {
2491552f7358SJed Brown                 found = PETSC_TRUE;
2492552f7358SJed Brown                 break;
2493552f7358SJed Brown               }
2494552f7358SJed Brown             }
2495552f7358SJed Brown           }
2496552f7358SJed Brown           ierr = DMPlexRestoreMeet(dm, 2, cellPair, &meetSize, &meet);CHKERRQ(ierr);
2497552f7358SJed Brown         }
2498552f7358SJed Brown         if (found) {
2499552f7358SJed Brown           adj[off[cell-cStart]+cellOffset] = neighborCells[n];
2500552f7358SJed Brown           ++cellOffset;
2501552f7358SJed Brown         }
2502552f7358SJed Brown       }
2503552f7358SJed Brown     }
2504552f7358SJed Brown   }
2505552f7358SJed Brown   ierr = PetscFree2(neighborCells,tmpClosure);CHKERRQ(ierr);
2506552f7358SJed Brown   if (numVertices) *numVertices = numCells;
2507552f7358SJed Brown   if (offsets)   *offsets   = off;
2508552f7358SJed Brown   if (adjacency) *adjacency = adj;
2509552f7358SJed Brown   PetscFunctionReturn(0);
2510552f7358SJed Brown }
2511552f7358SJed Brown 
2512519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO)
2513519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H)
2514552f7358SJed Brown #include <unistd.h>
2515552f7358SJed Brown #endif
2516552f7358SJed Brown /* Chaco does not have an include file */
251739d7646bSJed Brown PETSC_EXTERN int interface(int nvtxs, int *start, int *adjacency, int *vwgts,
2518552f7358SJed Brown                        float *ewgts, float *x, float *y, float *z, char *outassignname,
2519552f7358SJed Brown                        char *outfilename, short *assignment, int architecture, int ndims_tot,
2520552f7358SJed Brown                        int mesh_dims[3], double *goal, int global_method, int local_method,
2521552f7358SJed Brown                        int rqi_flag, int vmax, int ndims, double eigtol, long seed);
2522552f7358SJed Brown 
2523552f7358SJed Brown extern int FREE_GRAPH;
2524552f7358SJed Brown 
2525552f7358SJed Brown #undef __FUNCT__
2526552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_Chaco"
2527552f7358SJed Brown PetscErrorCode DMPlexPartition_Chaco(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition)
2528552f7358SJed Brown {
2529552f7358SJed Brown   enum {DEFAULT_METHOD = 1, INERTIAL_METHOD = 3};
253082f516ccSBarry Smith   MPI_Comm       comm;
2531552f7358SJed Brown   int            nvtxs          = numVertices; /* number of vertices in full graph */
2532552f7358SJed Brown   int           *vwgts          = NULL;   /* weights for all vertices */
2533552f7358SJed Brown   float         *ewgts          = NULL;   /* weights for all edges */
2534552f7358SJed Brown   float         *x              = NULL, *y = NULL, *z = NULL; /* coordinates for inertial method */
2535552f7358SJed Brown   char          *outassignname  = NULL;   /*  name of assignment output file */
2536552f7358SJed Brown   char          *outfilename    = NULL;   /* output file name */
2537552f7358SJed Brown   int            architecture   = 1;      /* 0 => hypercube, d => d-dimensional mesh */
2538552f7358SJed Brown   int            ndims_tot      = 0;      /* total number of cube dimensions to divide */
2539552f7358SJed Brown   int            mesh_dims[3];            /* dimensions of mesh of processors */
2540552f7358SJed Brown   double        *goal          = NULL;    /* desired set sizes for each set */
2541552f7358SJed Brown   int            global_method = 1;       /* global partitioning algorithm */
2542552f7358SJed Brown   int            local_method  = 1;       /* local partitioning algorithm */
2543552f7358SJed Brown   int            rqi_flag      = 0;       /* should I use RQI/Symmlq eigensolver? */
2544552f7358SJed Brown   int            vmax          = 200;     /* how many vertices to coarsen down to? */
2545552f7358SJed Brown   int            ndims         = 1;       /* number of eigenvectors (2^d sets) */
2546552f7358SJed Brown   double         eigtol        = 0.001;   /* tolerance on eigenvectors */
2547552f7358SJed Brown   long           seed          = 123636512; /* for random graph mutations */
2548552f7358SJed Brown   short int     *assignment;              /* Output partition */
2549552f7358SJed Brown   int            fd_stdout, fd_pipe[2];
2550552f7358SJed Brown   PetscInt      *points;
2551552f7358SJed Brown   PetscMPIInt    commSize;
2552552f7358SJed Brown   int            i, v, p;
2553552f7358SJed Brown   PetscErrorCode ierr;
2554552f7358SJed Brown 
2555552f7358SJed Brown   PetscFunctionBegin;
255682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2557552f7358SJed Brown   ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr);
2558552f7358SJed Brown   if (!numVertices) {
2559552f7358SJed Brown     ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr);
2560552f7358SJed Brown     ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr);
2561552f7358SJed Brown     ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
25620298fd71SBarry Smith     ierr = ISCreateGeneral(comm, 0, NULL, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2563552f7358SJed Brown     PetscFunctionReturn(0);
2564552f7358SJed Brown   }
2565552f7358SJed Brown   FREE_GRAPH = 0;                         /* Do not let Chaco free my memory */
25660d644c17SKarl Rupp   for (i = 0; i < start[numVertices]; ++i) ++adjacency[i];
25670d644c17SKarl Rupp 
2568552f7358SJed Brown   if (global_method == INERTIAL_METHOD) {
2569552f7358SJed Brown     /* manager.createCellCoordinates(nvtxs, &x, &y, &z); */
2570552f7358SJed Brown     SETERRQ(comm, PETSC_ERR_SUP, "Inertial partitioning not yet supported");
2571552f7358SJed Brown   }
2572552f7358SJed Brown   mesh_dims[0] = commSize;
2573552f7358SJed Brown   mesh_dims[1] = 1;
2574552f7358SJed Brown   mesh_dims[2] = 1;
2575552f7358SJed Brown   ierr = PetscMalloc(nvtxs * sizeof(short int), &assignment);CHKERRQ(ierr);
2576552f7358SJed Brown   /* Chaco outputs to stdout. We redirect this to a buffer. */
2577552f7358SJed Brown   /* TODO: check error codes for UNIX calls */
2578519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H)
2579552f7358SJed Brown   {
25807995c745SJed Brown     int piperet;
25817995c745SJed Brown     piperet = pipe(fd_pipe);
25827995c745SJed Brown     if (piperet) SETERRQ(comm,PETSC_ERR_SYS,"Could not create pipe");
2583552f7358SJed Brown     fd_stdout = dup(1);
2584552f7358SJed Brown     close(1);
2585552f7358SJed Brown     dup2(fd_pipe[1], 1);
2586552f7358SJed Brown   }
2587552f7358SJed Brown #endif
2588552f7358SJed Brown   ierr = interface(nvtxs, (int*) start, (int*) adjacency, vwgts, ewgts, x, y, z, outassignname, outfilename,
2589552f7358SJed Brown                    assignment, architecture, ndims_tot, mesh_dims, goal, global_method, local_method, rqi_flag,
2590552f7358SJed Brown                    vmax, ndims, eigtol, seed);
2591519f805aSKarl Rupp #if defined(PETSC_HAVE_UNISTD_H)
2592552f7358SJed Brown   {
2593552f7358SJed Brown     char msgLog[10000];
2594552f7358SJed Brown     int  count;
2595552f7358SJed Brown 
2596552f7358SJed Brown     fflush(stdout);
2597552f7358SJed Brown     count = read(fd_pipe[0], msgLog, (10000-1)*sizeof(char));
2598552f7358SJed Brown     if (count < 0) count = 0;
2599552f7358SJed Brown     msgLog[count] = 0;
2600552f7358SJed Brown     close(1);
2601552f7358SJed Brown     dup2(fd_stdout, 1);
2602552f7358SJed Brown     close(fd_stdout);
2603552f7358SJed Brown     close(fd_pipe[0]);
2604552f7358SJed Brown     close(fd_pipe[1]);
2605552f7358SJed Brown     if (ierr) SETERRQ1(comm, PETSC_ERR_LIB, "Error in Chaco library: %s", msgLog);
2606552f7358SJed Brown   }
2607552f7358SJed Brown #endif
2608552f7358SJed Brown   /* Convert to PetscSection+IS */
2609552f7358SJed Brown   ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr);
2610552f7358SJed Brown   ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr);
2611552f7358SJed Brown   for (v = 0; v < nvtxs; ++v) {
2612552f7358SJed Brown     ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr);
2613552f7358SJed Brown   }
2614552f7358SJed Brown   ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
2615552f7358SJed Brown   ierr = PetscMalloc(nvtxs * sizeof(PetscInt), &points);CHKERRQ(ierr);
2616552f7358SJed Brown   for (p = 0, i = 0; p < commSize; ++p) {
2617552f7358SJed Brown     for (v = 0; v < nvtxs; ++v) {
2618552f7358SJed Brown       if (assignment[v] == p) points[i++] = v;
2619552f7358SJed Brown     }
2620552f7358SJed Brown   }
2621552f7358SJed Brown   if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs);
2622552f7358SJed Brown   ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2623552f7358SJed Brown   if (global_method == INERTIAL_METHOD) {
2624552f7358SJed Brown     /* manager.destroyCellCoordinates(nvtxs, &x, &y, &z); */
2625552f7358SJed Brown   }
2626552f7358SJed Brown   ierr = PetscFree(assignment);CHKERRQ(ierr);
26270d644c17SKarl Rupp   for (i = 0; i < start[numVertices]; ++i) --adjacency[i];
2628552f7358SJed Brown   PetscFunctionReturn(0);
2629552f7358SJed Brown }
2630552f7358SJed Brown #endif
2631552f7358SJed Brown 
2632519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS)
263325cda350SMatthew G. Knepley #include <parmetis.h>
263425cda350SMatthew G. Knepley 
2635552f7358SJed Brown #undef __FUNCT__
2636552f7358SJed Brown #define __FUNCT__ "DMPlexPartition_ParMetis"
2637552f7358SJed Brown PetscErrorCode DMPlexPartition_ParMetis(DM dm, PetscInt numVertices, PetscInt start[], PetscInt adjacency[], PetscSection *partSection, IS *partition)
2638552f7358SJed Brown {
263925cda350SMatthew G. Knepley   MPI_Comm       comm;
264025cda350SMatthew G. Knepley   PetscInt       nvtxs      = numVertices; // The number of vertices in full graph
264125cda350SMatthew G. Knepley   PetscInt      *vtxdist;                  // Distribution of vertices across processes
264225cda350SMatthew G. Knepley   PetscInt      *xadj       = start;       // Start of edge list for each vertex
264325cda350SMatthew G. Knepley   PetscInt      *adjncy     = adjacency;   // Edge lists for all vertices
264425cda350SMatthew G. Knepley   PetscInt      *vwgt       = NULL;        // Vertex weights
264525cda350SMatthew G. Knepley   PetscInt      *adjwgt     = NULL;        // Edge weights
264625cda350SMatthew G. Knepley   PetscInt       wgtflag    = 0;           // Indicates which weights are present
264725cda350SMatthew G. Knepley   PetscInt       numflag    = 0;           // Indicates initial offset (0 or 1)
264825cda350SMatthew G. Knepley   PetscInt       ncon       = 1;           // The number of weights per vertex
264925cda350SMatthew G. Knepley   PetscInt       nparts;                   // The number of partitions
265025cda350SMatthew G. Knepley   PetscReal     *tpwgts;                   // The fraction of vertex weights assigned to each partition
265125cda350SMatthew G. Knepley   PetscReal     *ubvec;                    // The balance intolerance for vertex weights
265225cda350SMatthew G. Knepley   PetscInt       options[5];               // Options
265325cda350SMatthew G. Knepley   // Outputs
265425cda350SMatthew G. Knepley   PetscInt       edgeCut;                  // The number of edges cut by the partition
265525cda350SMatthew G. Knepley   PetscInt      *assignment, *points;
265625cda350SMatthew G. Knepley   PetscMPIInt    commSize, rank, p, v, i;
265725cda350SMatthew G. Knepley   PetscErrorCode ierr;
265825cda350SMatthew G. Knepley 
2659552f7358SJed Brown   PetscFunctionBegin;
266025cda350SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject) dm, &comm);CHKERRQ(ierr);
266125cda350SMatthew G. Knepley   ierr = MPI_Comm_size(comm, &commSize);CHKERRQ(ierr);
266225cda350SMatthew G. Knepley   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
266325cda350SMatthew G. Knepley   nparts = commSize;
266425cda350SMatthew G. Knepley   options[0] = 0; /* Use all defaults */
266525cda350SMatthew G. Knepley   /* Calculate vertex distribution */
266625cda350SMatthew G. Knepley   ierr = PetscMalloc4(nparts+1,PetscInt,&vtxdist,nparts*ncon,PetscReal,&tpwgts,ncon,PetscReal,&ubvec,nvtxs,PetscInt,&assignment);CHKERRQ(ierr);
266725cda350SMatthew G. Knepley   vtxdist[0] = 0;
266825cda350SMatthew G. Knepley   ierr = MPI_Allgather(&nvtxs, 1, MPIU_INT, &vtxdist[1], 1, MPIU_INT, comm);CHKERRQ(ierr);
266925cda350SMatthew G. Knepley   for (p = 2; p <= nparts; ++p) {
267025cda350SMatthew G. Knepley     vtxdist[p] += vtxdist[p-1];
267125cda350SMatthew G. Knepley   }
267225cda350SMatthew G. Knepley   /* Calculate weights */
267325cda350SMatthew G. Knepley   for (p = 0; p < nparts; ++p) {
267425cda350SMatthew G. Knepley     tpwgts[p] = 1.0/nparts;
267525cda350SMatthew G. Knepley   }
267625cda350SMatthew G. Knepley   ubvec[0] = 1.05;
267725cda350SMatthew G. Knepley 
267825cda350SMatthew G. Knepley   if (nparts == 1) {
267925cda350SMatthew G. Knepley     ierr = PetscMemzero(assignment, nvtxs * sizeof(PetscInt));
268025cda350SMatthew G. Knepley   } else {
268125cda350SMatthew G. Knepley     if (vtxdist[1] == vtxdist[nparts]) {
268225cda350SMatthew G. Knepley       if (!rank) {
2683e7ee2502SMatthew G. Knepley         PetscStackPush("METIS_PartGraphKway");
2684e7ee2502SMatthew G. Knepley         ierr = METIS_PartGraphKway(&nvtxs, &ncon, xadj, adjncy, vwgt, NULL, adjwgt, &nparts, tpwgts, ubvec, NULL, &edgeCut, assignment);
2685e7ee2502SMatthew G. Knepley         PetscStackPop;
2686e7ee2502SMatthew G. Knepley         if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in METIS_PartGraphKway()");
268725cda350SMatthew G. Knepley       }
268825cda350SMatthew G. Knepley     } else {
2689e7ee2502SMatthew G. Knepley       PetscStackPush("ParMETIS_V3_PartKway");
2690e7ee2502SMatthew G. Knepley       ierr = ParMETIS_V3_PartKway(vtxdist, xadj, adjncy, vwgt, adjwgt, &wgtflag, &numflag, &ncon, &nparts, tpwgts, ubvec, options, &edgeCut, assignment, &comm);
2691e7ee2502SMatthew G. Knepley       PetscStackPop;
2692e7ee2502SMatthew G. Knepley       if (ierr != METIS_OK) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in ParMETIS_V3_PartKway()");
269325cda350SMatthew G. Knepley     }
269425cda350SMatthew G. Knepley   }
269525cda350SMatthew G. Knepley   /* Convert to PetscSection+IS */
269625cda350SMatthew G. Knepley   ierr = PetscSectionCreate(comm, partSection);CHKERRQ(ierr);
269725cda350SMatthew G. Knepley   ierr = PetscSectionSetChart(*partSection, 0, commSize);CHKERRQ(ierr);
269825cda350SMatthew G. Knepley   for (v = 0; v < nvtxs; ++v) {
269925cda350SMatthew G. Knepley     ierr = PetscSectionAddDof(*partSection, assignment[v], 1);CHKERRQ(ierr);
270025cda350SMatthew G. Knepley   }
270125cda350SMatthew G. Knepley   ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
270225cda350SMatthew G. Knepley   ierr = PetscMalloc(nvtxs * sizeof(PetscInt), &points);CHKERRQ(ierr);
270325cda350SMatthew G. Knepley   for (p = 0, i = 0; p < commSize; ++p) {
270425cda350SMatthew G. Knepley     for (v = 0; v < nvtxs; ++v) {
270525cda350SMatthew G. Knepley       if (assignment[v] == p) points[i++] = v;
270625cda350SMatthew G. Knepley     }
270725cda350SMatthew G. Knepley   }
270825cda350SMatthew G. Knepley   if (i != nvtxs) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of points %D should be %D", i, nvtxs);
270925cda350SMatthew G. Knepley   ierr = ISCreateGeneral(comm, nvtxs, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
271025cda350SMatthew G. Knepley   ierr = PetscFree4(vtxdist,tpwgts,ubvec,assignment);CHKERRQ(ierr);
2711552f7358SJed Brown   PetscFunctionReturn(0);
2712552f7358SJed Brown }
2713552f7358SJed Brown #endif
2714552f7358SJed Brown 
2715552f7358SJed Brown #undef __FUNCT__
2716552f7358SJed Brown #define __FUNCT__ "DMPlexEnlargePartition"
2717552f7358SJed Brown /* Expand the partition by BFS on the adjacency graph */
2718a6dfd86eSKarl Rupp PetscErrorCode DMPlexEnlargePartition(DM dm, const PetscInt start[], const PetscInt adjacency[], PetscSection origPartSection, IS origPartition, PetscSection *partSection, IS *partition)
2719a6dfd86eSKarl Rupp {
2720552f7358SJed Brown   PetscHashI      h;
2721552f7358SJed Brown   const PetscInt *points;
2722552f7358SJed Brown   PetscInt      **tmpPoints, *newPoints, totPoints = 0;
2723552f7358SJed Brown   PetscInt        pStart, pEnd, part, q;
2724552f7358SJed Brown   PetscErrorCode  ierr;
2725552f7358SJed Brown 
2726552f7358SJed Brown   PetscFunctionBegin;
2727552f7358SJed Brown   PetscHashICreate(h);
272882f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr);
2729552f7358SJed Brown   ierr = PetscSectionGetChart(origPartSection, &pStart, &pEnd);CHKERRQ(ierr);
2730552f7358SJed Brown   ierr = PetscSectionSetChart(*partSection, pStart, pEnd);CHKERRQ(ierr);
2731552f7358SJed Brown   ierr = ISGetIndices(origPartition, &points);CHKERRQ(ierr);
2732552f7358SJed Brown   ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt*), &tmpPoints);CHKERRQ(ierr);
2733552f7358SJed Brown   for (part = pStart; part < pEnd; ++part) {
2734552f7358SJed Brown     PetscInt numPoints, nP, numNewPoints, off, p, n = 0;
2735552f7358SJed Brown 
2736552f7358SJed Brown     PetscHashIClear(h);
2737552f7358SJed Brown     ierr = PetscSectionGetDof(origPartSection, part, &numPoints);CHKERRQ(ierr);
2738552f7358SJed Brown     ierr = PetscSectionGetOffset(origPartSection, part, &off);CHKERRQ(ierr);
2739552f7358SJed Brown     /* Add all existing points to h */
2740552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
2741552f7358SJed Brown       const PetscInt point = points[off+p];
2742552f7358SJed Brown       PetscHashIAdd(h, point, 1);
2743552f7358SJed Brown     }
2744552f7358SJed Brown     PetscHashISize(h, nP);
274582f516ccSBarry Smith     if (nP != numPoints) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid partition has %d points, but only %d were unique", numPoints, nP);
2746552f7358SJed Brown     /* Add all points in next BFS level */
2747552f7358SJed Brown     /*   TODO We are brute forcing here, but could check the adjacency size to find the boundary */
2748552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
2749552f7358SJed Brown       const PetscInt point = points[off+p];
2750552f7358SJed Brown       PetscInt       s     = start[point], e = start[point+1], a;
2751552f7358SJed Brown 
27520d644c17SKarl Rupp       for (a = s; a < e; ++a) PetscHashIAdd(h, adjacency[a], 1);
2753552f7358SJed Brown     }
2754552f7358SJed Brown     PetscHashISize(h, numNewPoints);
2755552f7358SJed Brown     ierr = PetscSectionSetDof(*partSection, part, numNewPoints);CHKERRQ(ierr);
2756552f7358SJed Brown     ierr = PetscMalloc(numNewPoints * sizeof(PetscInt), &tmpPoints[part]);CHKERRQ(ierr);
27570d644c17SKarl Rupp     if (numNewPoints) PetscHashIGetKeys(h, n, tmpPoints[part]); /* Should not need this conditional */
2758552f7358SJed Brown     totPoints += numNewPoints;
2759552f7358SJed Brown   }
2760552f7358SJed Brown   ierr = ISRestoreIndices(origPartition, &points);CHKERRQ(ierr);
2761552f7358SJed Brown   PetscHashIDestroy(h);
2762552f7358SJed Brown   ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
2763552f7358SJed Brown   ierr = PetscMalloc(totPoints * sizeof(PetscInt), &newPoints);CHKERRQ(ierr);
2764552f7358SJed Brown   for (part = pStart, q = 0; part < pEnd; ++part) {
2765552f7358SJed Brown     PetscInt numPoints, p;
2766552f7358SJed Brown 
2767552f7358SJed Brown     ierr = PetscSectionGetDof(*partSection, part, &numPoints);CHKERRQ(ierr);
27680d644c17SKarl Rupp     for (p = 0; p < numPoints; ++p, ++q) newPoints[q] = tmpPoints[part][p];
2769552f7358SJed Brown     ierr = PetscFree(tmpPoints[part]);CHKERRQ(ierr);
2770552f7358SJed Brown   }
2771552f7358SJed Brown   ierr = PetscFree(tmpPoints);CHKERRQ(ierr);
277282f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), totPoints, newPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2773552f7358SJed Brown   PetscFunctionReturn(0);
2774552f7358SJed Brown }
2775552f7358SJed Brown 
2776552f7358SJed Brown #undef __FUNCT__
2777552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartition"
2778552f7358SJed Brown /*
2779552f7358SJed Brown   DMPlexCreatePartition - Create a non-overlapping partition of the points at the given height
2780552f7358SJed Brown 
2781552f7358SJed Brown   Collective on DM
2782552f7358SJed Brown 
2783552f7358SJed Brown   Input Parameters:
2784552f7358SJed Brown   + dm - The DM
2785552f7358SJed Brown   . height - The height for points in the partition
2786552f7358SJed Brown   - enlarge - Expand each partition with neighbors
2787552f7358SJed Brown 
2788552f7358SJed Brown   Output Parameters:
2789552f7358SJed Brown   + partSection - The PetscSection giving the division of points by partition
2790552f7358SJed Brown   . partition - The list of points by partition
27910298fd71SBarry Smith   . origPartSection - If enlarge is true, the PetscSection giving the division of points before enlarging by partition, otherwise NULL
27920298fd71SBarry Smith   - origPartition - If enlarge is true, the list of points before enlarging by partition, otherwise NULL
2793552f7358SJed Brown 
2794552f7358SJed Brown   Level: developer
2795552f7358SJed Brown 
2796552f7358SJed Brown .seealso DMPlexDistribute()
2797552f7358SJed Brown */
2798ac17c9edSMatthew G. Knepley PetscErrorCode DMPlexCreatePartition(DM dm, const char name[], PetscInt height, PetscBool enlarge, PetscSection *partSection, IS *partition, PetscSection *origPartSection, IS *origPartition)
27990adebc6cSBarry Smith {
2800ac17c9edSMatthew G. Knepley   char           partname[1024];
2801ac17c9edSMatthew G. Knepley   PetscBool      isChaco = PETSC_FALSE, isMetis = PETSC_FALSE, flg;
2802552f7358SJed Brown   PetscMPIInt    size;
2803552f7358SJed Brown   PetscErrorCode ierr;
2804552f7358SJed Brown 
2805552f7358SJed Brown   PetscFunctionBegin;
280682f516ccSBarry Smith   ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &size);CHKERRQ(ierr);
28070d644c17SKarl Rupp 
28080298fd71SBarry Smith   *origPartSection = NULL;
28090298fd71SBarry Smith   *origPartition   = NULL;
2810552f7358SJed Brown   if (size == 1) {
2811552f7358SJed Brown     PetscInt *points;
2812552f7358SJed Brown     PetscInt  cStart, cEnd, c;
2813552f7358SJed Brown 
2814552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
281582f516ccSBarry Smith     ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), partSection);CHKERRQ(ierr);
2816552f7358SJed Brown     ierr = PetscSectionSetChart(*partSection, 0, size);CHKERRQ(ierr);
2817552f7358SJed Brown     ierr = PetscSectionSetDof(*partSection, 0, cEnd-cStart);CHKERRQ(ierr);
2818552f7358SJed Brown     ierr = PetscSectionSetUp(*partSection);CHKERRQ(ierr);
2819552f7358SJed Brown     ierr = PetscMalloc((cEnd - cStart) * sizeof(PetscInt), &points);CHKERRQ(ierr);
28200d644c17SKarl Rupp     for (c = cStart; c < cEnd; ++c) points[c] = c;
282182f516ccSBarry Smith     ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), cEnd-cStart, points, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2822552f7358SJed Brown     PetscFunctionReturn(0);
2823552f7358SJed Brown   }
2824ac17c9edSMatthew G. Knepley   ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_partitioner", partname, 1024, &flg);CHKERRQ(ierr);
2825ac17c9edSMatthew G. Knepley   if (flg) name = partname;
2826ac17c9edSMatthew G. Knepley   if (name) {
2827ac17c9edSMatthew G. Knepley     ierr = PetscStrcmp(name, "chaco", &isChaco);CHKERRQ(ierr);
2828ac17c9edSMatthew G. Knepley     ierr = PetscStrcmp(name, "metis", &isMetis);CHKERRQ(ierr);
2829ac17c9edSMatthew G. Knepley   }
2830552f7358SJed Brown   if (height == 0) {
2831552f7358SJed Brown     PetscInt  numVertices;
28320298fd71SBarry Smith     PetscInt *start     = NULL;
28330298fd71SBarry Smith     PetscInt *adjacency = NULL;
2834552f7358SJed Brown 
283577c88f5bSMatthew G Knepley     ierr = DMPlexCreateNeighborCSR(dm, 0, &numVertices, &start, &adjacency);CHKERRQ(ierr);
2836ac17c9edSMatthew G. Knepley     if (!name || isChaco) {
2837519f805aSKarl Rupp #if defined(PETSC_HAVE_CHACO)
2838552f7358SJed Brown       ierr = DMPlexPartition_Chaco(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr);
2839ac17c9edSMatthew G. Knepley #else
2840ac17c9edSMatthew G. Knepley       SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Mesh partitioning needs external package support.\nPlease reconfigure with --download-chaco.");
2841552f7358SJed Brown #endif
2842ac17c9edSMatthew G. Knepley     } else if (isMetis) {
2843519f805aSKarl Rupp #if defined(PETSC_HAVE_PARMETIS)
2844552f7358SJed Brown       ierr = DMPlexPartition_ParMetis(dm, numVertices, start, adjacency, partSection, partition);CHKERRQ(ierr);
2845552f7358SJed Brown #endif
2846ac17c9edSMatthew G. Knepley     } else SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_SUP, "Unknown mesh partitioning package %s", name);
2847552f7358SJed Brown     if (enlarge) {
2848552f7358SJed Brown       *origPartSection = *partSection;
2849552f7358SJed Brown       *origPartition   = *partition;
28500d644c17SKarl Rupp 
2851552f7358SJed Brown       ierr = DMPlexEnlargePartition(dm, start, adjacency, *origPartSection, *origPartition, partSection, partition);CHKERRQ(ierr);
2852552f7358SJed Brown     }
2853552f7358SJed Brown     ierr = PetscFree(start);CHKERRQ(ierr);
2854552f7358SJed Brown     ierr = PetscFree(adjacency);CHKERRQ(ierr);
2855552f7358SJed Brown # if 0
2856552f7358SJed Brown   } else if (height == 1) {
2857552f7358SJed Brown     /* Build the dual graph for faces and partition the hypergraph */
2858552f7358SJed Brown     PetscInt numEdges;
2859552f7358SJed Brown 
2860552f7358SJed Brown     buildFaceCSRV(mesh, mesh->getFactory()->getNumbering(mesh, mesh->depth()-1), &numEdges, &start, &adjacency, GraphPartitioner::zeroBase());
2861552f7358SJed Brown     GraphPartitioner().partition(numEdges, start, adjacency, partition, manager);
2862552f7358SJed Brown     destroyCSR(numEdges, start, adjacency);
2863552f7358SJed Brown #endif
286482f516ccSBarry Smith   } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid partition height %D", height);
2865552f7358SJed Brown   PetscFunctionReturn(0);
2866552f7358SJed Brown }
2867552f7358SJed Brown 
2868552f7358SJed Brown #undef __FUNCT__
2869552f7358SJed Brown #define __FUNCT__ "DMPlexCreatePartitionClosure"
28700adebc6cSBarry Smith PetscErrorCode DMPlexCreatePartitionClosure(DM dm, PetscSection pointSection, IS pointPartition, PetscSection *section, IS *partition)
28710adebc6cSBarry Smith {
2872552f7358SJed Brown   /* const PetscInt  height = 0; */
2873552f7358SJed Brown   const PetscInt *partArray;
2874cb3cb6d9SJed Brown   PetscInt       *allPoints, *packPoints;
2875cb3cb6d9SJed Brown   PetscInt        rStart, rEnd, rank, pStart, pEnd, newSize;
2876552f7358SJed Brown   PetscErrorCode  ierr;
2877cb3cb6d9SJed Brown   PetscBT         bt;
2878cb3cb6d9SJed Brown   PetscSegBuffer  segpack,segpart;
2879552f7358SJed Brown 
2880552f7358SJed Brown   PetscFunctionBegin;
2881552f7358SJed Brown   ierr = PetscSectionGetChart(pointSection, &rStart, &rEnd);CHKERRQ(ierr);
2882552f7358SJed Brown   ierr = ISGetIndices(pointPartition, &partArray);CHKERRQ(ierr);
288382f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
2884552f7358SJed Brown   ierr = PetscSectionSetChart(*section, rStart, rEnd);CHKERRQ(ierr);
2885cb3cb6d9SJed Brown   ierr = DMPlexGetChart(dm,&pStart,&pEnd);CHKERRQ(ierr);
2886cb3cb6d9SJed Brown   ierr = PetscBTCreate(pEnd-pStart,&bt);CHKERRQ(ierr);
2887cb3cb6d9SJed Brown   ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpack);CHKERRQ(ierr);
2888cb3cb6d9SJed Brown   ierr = PetscSegBufferCreate(sizeof(PetscInt),1000,&segpart);CHKERRQ(ierr);
2889552f7358SJed Brown   for (rank = rStart; rank < rEnd; ++rank) {
2890471ecdacSJed Brown     PetscInt partSize = 0, numPoints, offset, p, *PETSC_RESTRICT placePoints;
2891552f7358SJed Brown 
2892552f7358SJed Brown     ierr = PetscSectionGetDof(pointSection, rank, &numPoints);CHKERRQ(ierr);
2893552f7358SJed Brown     ierr = PetscSectionGetOffset(pointSection, rank, &offset);CHKERRQ(ierr);
2894552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
2895552f7358SJed Brown       PetscInt  point   = partArray[offset+p], closureSize, c;
28960298fd71SBarry Smith       PetscInt *closure = NULL;
2897552f7358SJed Brown 
2898552f7358SJed Brown       /* TODO Include support for height > 0 case */
2899552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2900cb3cb6d9SJed Brown       for (c=0; c<closureSize; c++) {
2901cb3cb6d9SJed Brown         PetscInt cpoint = closure[c*2];
2902cb3cb6d9SJed Brown         if (!PetscBTLookupSet(bt,cpoint-pStart)) {
2903471ecdacSJed Brown           PetscInt *PETSC_RESTRICT pt;
2904cb3cb6d9SJed Brown           partSize++;
2905471ecdacSJed Brown           ierr = PetscSegBufferGetInts(segpart,1,&pt);CHKERRQ(ierr);
2906cb3cb6d9SJed Brown           *pt = cpoint;
2907552f7358SJed Brown         }
2908cb3cb6d9SJed Brown       }
2909552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2910552f7358SJed Brown     }
2911552f7358SJed Brown     ierr = PetscSectionSetDof(*section, rank, partSize);CHKERRQ(ierr);
2912471ecdacSJed Brown     ierr = PetscSegBufferGetInts(segpack,partSize,&placePoints);CHKERRQ(ierr);
2913471ecdacSJed Brown     ierr = PetscSegBufferExtractTo(segpart,placePoints);CHKERRQ(ierr);
2914471ecdacSJed Brown     ierr = PetscSortInt(partSize,placePoints);CHKERRQ(ierr);
2915471ecdacSJed Brown     for (p=0; p<partSize; p++) {ierr = PetscBTClear(bt,placePoints[p]-pStart);CHKERRQ(ierr);}
2916552f7358SJed Brown   }
2917cb3cb6d9SJed Brown   ierr = PetscBTDestroy(&bt);CHKERRQ(ierr);
2918cb3cb6d9SJed Brown   ierr = PetscSegBufferDestroy(&segpart);CHKERRQ(ierr);
2919cb3cb6d9SJed Brown 
2920552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
2921552f7358SJed Brown   ierr = PetscSectionGetStorageSize(*section, &newSize);CHKERRQ(ierr);
2922552f7358SJed Brown   ierr = PetscMalloc(newSize * sizeof(PetscInt), &allPoints);CHKERRQ(ierr);
2923552f7358SJed Brown 
2924137cf7b6SJed Brown   ierr = PetscSegBufferExtractInPlace(segpack,&packPoints);CHKERRQ(ierr);
2925552f7358SJed Brown   for (rank = rStart; rank < rEnd; ++rank) {
2926cb3cb6d9SJed Brown     PetscInt numPoints, offset;
2927552f7358SJed Brown 
2928cb3cb6d9SJed Brown     ierr = PetscSectionGetDof(*section, rank, &numPoints);CHKERRQ(ierr);
2929cb3cb6d9SJed Brown     ierr = PetscSectionGetOffset(*section, rank, &offset);CHKERRQ(ierr);
2930cb3cb6d9SJed Brown     ierr = PetscMemcpy(&allPoints[offset], packPoints, numPoints * sizeof(PetscInt));CHKERRQ(ierr);
2931cb3cb6d9SJed Brown     packPoints += numPoints;
2932552f7358SJed Brown   }
2933cb3cb6d9SJed Brown 
2934cb3cb6d9SJed Brown   ierr = PetscSegBufferDestroy(&segpack);CHKERRQ(ierr);
2935552f7358SJed Brown   ierr = ISRestoreIndices(pointPartition, &partArray);CHKERRQ(ierr);
293682f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), newSize, allPoints, PETSC_OWN_POINTER, partition);CHKERRQ(ierr);
2937552f7358SJed Brown   PetscFunctionReturn(0);
2938552f7358SJed Brown }
2939552f7358SJed Brown 
2940552f7358SJed Brown #undef __FUNCT__
2941552f7358SJed Brown #define __FUNCT__ "DMPlexDistributeField"
29421858a729SMatthew G. Knepley /*@
29431858a729SMatthew G. Knepley   DMPlexDistributeField - Distribute field data to match a given PetscSF, usually the SF from mesh distribution
29441858a729SMatthew G. Knepley 
29451858a729SMatthew G. Knepley   Collective on DM
29461858a729SMatthew G. Knepley 
2947552f7358SJed Brown   Input Parameters:
29481858a729SMatthew G. Knepley + dm - The DMPlex object
29491858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern
29501858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout
29511858a729SMatthew G. Knepley - originalVec - The existing data
2952552f7358SJed Brown 
2953552f7358SJed Brown   Output Parameters:
29541858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout
29551858a729SMatthew G. Knepley - newVec - The new data
29561858a729SMatthew G. Knepley 
29571858a729SMatthew G. Knepley   Level: developer
29581858a729SMatthew G. Knepley 
29591858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeData()
29601858a729SMatthew G. Knepley @*/
2961552f7358SJed Brown PetscErrorCode DMPlexDistributeField(DM dm, PetscSF pointSF, PetscSection originalSection, Vec originalVec, PetscSection newSection, Vec newVec)
2962552f7358SJed Brown {
2963552f7358SJed Brown   PetscSF        fieldSF;
2964552f7358SJed Brown   PetscInt      *remoteOffsets, fieldSize;
2965552f7358SJed Brown   PetscScalar   *originalValues, *newValues;
2966552f7358SJed Brown   PetscErrorCode ierr;
2967552f7358SJed Brown 
2968552f7358SJed Brown   PetscFunctionBegin;
2969552f7358SJed Brown   ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr);
2970552f7358SJed Brown 
2971552f7358SJed Brown   ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr);
2972552f7358SJed Brown   ierr = VecSetSizes(newVec, fieldSize, PETSC_DETERMINE);CHKERRQ(ierr);
2973c0dedaeaSBarry Smith   ierr = VecSetType(newVec,dm->vectype);CHKERRQ(ierr);
2974552f7358SJed Brown 
2975552f7358SJed Brown   ierr = VecGetArray(originalVec, &originalValues);CHKERRQ(ierr);
2976552f7358SJed Brown   ierr = VecGetArray(newVec, &newValues);CHKERRQ(ierr);
2977552f7358SJed Brown   ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr);
2978552f7358SJed Brown   ierr = PetscSFBcastBegin(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr);
2979552f7358SJed Brown   ierr = PetscSFBcastEnd(fieldSF, MPIU_SCALAR, originalValues, newValues);CHKERRQ(ierr);
2980552f7358SJed Brown   ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr);
2981552f7358SJed Brown   ierr = VecRestoreArray(newVec, &newValues);CHKERRQ(ierr);
2982552f7358SJed Brown   ierr = VecRestoreArray(originalVec, &originalValues);CHKERRQ(ierr);
2983552f7358SJed Brown   PetscFunctionReturn(0);
2984552f7358SJed Brown }
2985552f7358SJed Brown 
2986552f7358SJed Brown #undef __FUNCT__
29871858a729SMatthew G. Knepley #define __FUNCT__ "DMPlexDistributeData"
29881858a729SMatthew G. Knepley /*@
29891858a729SMatthew G. Knepley   DMPlexDistributeData - Distribute field data to match a given PetscSF, usually the SF from mesh distribution
29901858a729SMatthew G. Knepley 
29911858a729SMatthew G. Knepley   Collective on DM
29921858a729SMatthew G. Knepley 
29931858a729SMatthew G. Knepley   Input Parameters:
29941858a729SMatthew G. Knepley + dm - The DMPlex object
29951858a729SMatthew G. Knepley . pointSF - The PetscSF describing the communication pattern
29961858a729SMatthew G. Knepley . originalSection - The PetscSection for existing data layout
29971858a729SMatthew G. Knepley . datatype - The type of data
29981858a729SMatthew G. Knepley - originalData - The existing data
29991858a729SMatthew G. Knepley 
30001858a729SMatthew G. Knepley   Output Parameters:
30011858a729SMatthew G. Knepley + newSection - The PetscSF describing the new data layout
30021858a729SMatthew G. Knepley - newData - The new data
30031858a729SMatthew G. Knepley 
30041858a729SMatthew G. Knepley   Level: developer
30051858a729SMatthew G. Knepley 
30061858a729SMatthew G. Knepley .seealso: DMPlexDistribute(), DMPlexDistributeField()
30071858a729SMatthew G. Knepley @*/
30081858a729SMatthew G. Knepley PetscErrorCode DMPlexDistributeData(DM dm, PetscSF pointSF, PetscSection originalSection, MPI_Datatype datatype, void *originalData, PetscSection newSection, void **newData)
30091858a729SMatthew G. Knepley {
30101858a729SMatthew G. Knepley   PetscSF        fieldSF;
30111858a729SMatthew G. Knepley   PetscInt      *remoteOffsets, fieldSize;
30121858a729SMatthew G. Knepley   PetscMPIInt    dataSize;
30131858a729SMatthew G. Knepley   PetscErrorCode ierr;
30141858a729SMatthew G. Knepley 
30151858a729SMatthew G. Knepley   PetscFunctionBegin;
30161858a729SMatthew G. Knepley   ierr = PetscSFDistributeSection(pointSF, originalSection, &remoteOffsets, newSection);CHKERRQ(ierr);
30171858a729SMatthew G. Knepley 
30181858a729SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(newSection, &fieldSize);CHKERRQ(ierr);
30191858a729SMatthew G. Knepley   ierr = MPI_Type_size(datatype, &dataSize);CHKERRQ(ierr);
30201858a729SMatthew G. Knepley   ierr = PetscMalloc(fieldSize * dataSize, newData);CHKERRQ(ierr);
30211858a729SMatthew G. Knepley 
30221858a729SMatthew G. Knepley   ierr = PetscSFCreateSectionSF(pointSF, originalSection, remoteOffsets, newSection, &fieldSF);CHKERRQ(ierr);
30231858a729SMatthew G. Knepley   ierr = PetscSFBcastBegin(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr);
30241858a729SMatthew G. Knepley   ierr = PetscSFBcastEnd(fieldSF, datatype, originalData, *newData);CHKERRQ(ierr);
30251858a729SMatthew G. Knepley   ierr = PetscSFDestroy(&fieldSF);CHKERRQ(ierr);
30261858a729SMatthew G. Knepley   PetscFunctionReturn(0);
30271858a729SMatthew G. Knepley }
30281858a729SMatthew G. Knepley 
30291858a729SMatthew G. Knepley #undef __FUNCT__
3030552f7358SJed Brown #define __FUNCT__ "DMPlexDistribute"
3031552f7358SJed Brown /*@C
3032552f7358SJed Brown   DMPlexDistribute - Distributes the mesh and any associated sections.
3033552f7358SJed Brown 
3034552f7358SJed Brown   Not Collective
3035552f7358SJed Brown 
3036552f7358SJed Brown   Input Parameter:
3037552f7358SJed Brown + dm  - The original DMPlex object
3038552f7358SJed Brown . partitioner - The partitioning package, or NULL for the default
3039552f7358SJed Brown - overlap - The overlap of partitions, 0 is the default
3040552f7358SJed Brown 
3041552f7358SJed Brown   Output Parameter:
3042e7ba9e7aSMatthew G. Knepley + sf - The PetscSF used for point distribution
3043e7ba9e7aSMatthew G. Knepley - parallelMesh - The distributed DMPlex object, or NULL
3044552f7358SJed Brown 
30450298fd71SBarry Smith   Note: If the mesh was not distributed, the return value is NULL
3046552f7358SJed Brown 
3047552f7358SJed Brown   Level: intermediate
3048552f7358SJed Brown 
3049552f7358SJed Brown .keywords: mesh, elements
3050552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexDistributeByFace()
3051552f7358SJed Brown @*/
3052e7ba9e7aSMatthew G. Knepley PetscErrorCode DMPlexDistribute(DM dm, const char partitioner[], PetscInt overlap, PetscSF *sf, DM *dmParallel)
3053552f7358SJed Brown {
3054552f7358SJed Brown   DM_Plex               *mesh   = (DM_Plex*) dm->data, *pmesh;
305582f516ccSBarry Smith   MPI_Comm               comm;
3056552f7358SJed Brown   const PetscInt         height = 0;
3057552f7358SJed Brown   PetscInt               dim, numRemoteRanks;
3058552f7358SJed Brown   IS                     origCellPart,        cellPart,        part;
3059552f7358SJed Brown   PetscSection           origCellPartSection, cellPartSection, partSection;
3060552f7358SJed Brown   PetscSFNode           *remoteRanks;
3061552f7358SJed Brown   PetscSF                partSF, pointSF, coneSF;
3062552f7358SJed Brown   ISLocalToGlobalMapping renumbering;
3063552f7358SJed Brown   PetscSection           originalConeSection, newConeSection;
3064552f7358SJed Brown   PetscInt              *remoteOffsets;
3065552f7358SJed Brown   PetscInt              *cones, *newCones, newConesSize;
3066552f7358SJed Brown   PetscBool              flg;
3067552f7358SJed Brown   PetscMPIInt            rank, numProcs, p;
3068552f7358SJed Brown   PetscErrorCode         ierr;
3069552f7358SJed Brown 
3070552f7358SJed Brown   PetscFunctionBegin;
3071552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3072e7ba9e7aSMatthew G. Knepley   if (sf) PetscValidPointer(sf,4);
3073e7ba9e7aSMatthew G. Knepley   PetscValidPointer(dmParallel,5);
30740d644c17SKarl Rupp 
3075552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr);
307682f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
3077552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3078552f7358SJed Brown   ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);
30790d644c17SKarl Rupp 
30800298fd71SBarry Smith   *dmParallel = NULL;
3081552f7358SJed Brown   if (numProcs == 1) PetscFunctionReturn(0);
3082552f7358SJed Brown 
3083552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
3084552f7358SJed Brown   /* Create cell partition - We need to rewrite to use IS, use the MatPartition stuff */
3085b96ba592SMatthew G. Knepley   ierr = PetscLogEventBegin(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr);
308682f516ccSBarry Smith   if (overlap > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Overlap > 1 not yet implemented");
3087ac17c9edSMatthew G. Knepley   ierr = DMPlexCreatePartition(dm, partitioner, height, overlap > 0 ? PETSC_TRUE : PETSC_FALSE, &cellPartSection, &cellPart, &origCellPartSection, &origCellPart);CHKERRQ(ierr);
3088552f7358SJed Brown   /* Create SF assuming a serial partition for all processes: Could check for IS length here */
30890d644c17SKarl Rupp   if (!rank) numRemoteRanks = numProcs;
30900d644c17SKarl Rupp   else       numRemoteRanks = 0;
3091552f7358SJed Brown   ierr = PetscMalloc(numRemoteRanks * sizeof(PetscSFNode), &remoteRanks);CHKERRQ(ierr);
3092552f7358SJed Brown   for (p = 0; p < numRemoteRanks; ++p) {
3093552f7358SJed Brown     remoteRanks[p].rank  = p;
3094552f7358SJed Brown     remoteRanks[p].index = 0;
3095552f7358SJed Brown   }
3096552f7358SJed Brown   ierr = PetscSFCreate(comm, &partSF);CHKERRQ(ierr);
30970298fd71SBarry Smith   ierr = PetscSFSetGraph(partSF, 1, numRemoteRanks, NULL, PETSC_OWN_POINTER, remoteRanks, PETSC_OWN_POINTER);CHKERRQ(ierr);
3098552f7358SJed Brown   ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-partition_view", &flg);CHKERRQ(ierr);
3099552f7358SJed Brown   if (flg) {
3100552f7358SJed Brown     ierr = PetscPrintf(comm, "Cell Partition:\n");CHKERRQ(ierr);
3101552f7358SJed Brown     ierr = PetscSectionView(cellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
31020298fd71SBarry Smith     ierr = ISView(cellPart, NULL);CHKERRQ(ierr);
3103552f7358SJed Brown     if (origCellPart) {
3104552f7358SJed Brown       ierr = PetscPrintf(comm, "Original Cell Partition:\n");CHKERRQ(ierr);
3105552f7358SJed Brown       ierr = PetscSectionView(origCellPartSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
31060298fd71SBarry Smith       ierr = ISView(origCellPart, NULL);CHKERRQ(ierr);
3107552f7358SJed Brown     }
31080298fd71SBarry Smith     ierr = PetscSFView(partSF, NULL);CHKERRQ(ierr);
3109552f7358SJed Brown   }
3110552f7358SJed Brown   /* Close the partition over the mesh */
3111552f7358SJed Brown   ierr = DMPlexCreatePartitionClosure(dm, cellPartSection, cellPart, &partSection, &part);CHKERRQ(ierr);
3112552f7358SJed Brown   ierr = ISDestroy(&cellPart);CHKERRQ(ierr);
3113552f7358SJed Brown   ierr = PetscSectionDestroy(&cellPartSection);CHKERRQ(ierr);
3114552f7358SJed Brown   /* Create new mesh */
3115552f7358SJed Brown   ierr  = DMPlexCreate(comm, dmParallel);CHKERRQ(ierr);
3116552f7358SJed Brown   ierr  = DMPlexSetDimension(*dmParallel, dim);CHKERRQ(ierr);
3117552f7358SJed Brown   ierr  = PetscObjectSetName((PetscObject) *dmParallel, "Parallel Mesh");CHKERRQ(ierr);
3118552f7358SJed Brown   pmesh = (DM_Plex*) (*dmParallel)->data;
3119552f7358SJed Brown   /* Distribute sieve points and the global point numbering (replaces creating remote bases) */
3120552f7358SJed Brown   ierr = PetscSFConvertPartition(partSF, partSection, part, &renumbering, &pointSF);CHKERRQ(ierr);
3121552f7358SJed Brown   if (flg) {
3122552f7358SJed Brown     ierr = PetscPrintf(comm, "Point Partition:\n");CHKERRQ(ierr);
3123552f7358SJed Brown     ierr = PetscSectionView(partSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
31240298fd71SBarry Smith     ierr = ISView(part, NULL);CHKERRQ(ierr);
31250298fd71SBarry Smith     ierr = PetscSFView(pointSF, NULL);CHKERRQ(ierr);
3126552f7358SJed Brown     ierr = PetscPrintf(comm, "Point Renumbering after partition:\n");CHKERRQ(ierr);
31270298fd71SBarry Smith     ierr = ISLocalToGlobalMappingView(renumbering, NULL);CHKERRQ(ierr);
3128552f7358SJed Brown   }
3129b96ba592SMatthew G. Knepley   ierr = PetscLogEventEnd(DMPLEX_Partition,dm,0,0,0);CHKERRQ(ierr);
3130552f7358SJed Brown   /* Distribute cone section */
3131552f7358SJed Brown   ierr = DMPlexGetConeSection(dm, &originalConeSection);CHKERRQ(ierr);
3132552f7358SJed Brown   ierr = DMPlexGetConeSection(*dmParallel, &newConeSection);CHKERRQ(ierr);
3133552f7358SJed Brown   ierr = PetscSFDistributeSection(pointSF, originalConeSection, &remoteOffsets, newConeSection);CHKERRQ(ierr);
3134552f7358SJed Brown   ierr = DMSetUp(*dmParallel);CHKERRQ(ierr);
3135552f7358SJed Brown   {
3136552f7358SJed Brown     PetscInt pStart, pEnd, p;
3137552f7358SJed Brown 
3138552f7358SJed Brown     ierr = PetscSectionGetChart(newConeSection, &pStart, &pEnd);CHKERRQ(ierr);
3139552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
3140552f7358SJed Brown       PetscInt coneSize;
3141552f7358SJed Brown       ierr               = PetscSectionGetDof(newConeSection, p, &coneSize);CHKERRQ(ierr);
3142552f7358SJed Brown       pmesh->maxConeSize = PetscMax(pmesh->maxConeSize, coneSize);
3143552f7358SJed Brown     }
3144552f7358SJed Brown   }
3145552f7358SJed Brown   /* Communicate and renumber cones */
3146552f7358SJed Brown   ierr = PetscSFCreateSectionSF(pointSF, originalConeSection, remoteOffsets, newConeSection, &coneSF);CHKERRQ(ierr);
3147552f7358SJed Brown   ierr = DMPlexGetCones(dm, &cones);CHKERRQ(ierr);
3148552f7358SJed Brown   ierr = DMPlexGetCones(*dmParallel, &newCones);CHKERRQ(ierr);
3149552f7358SJed Brown   ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
3150552f7358SJed Brown   ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
3151552f7358SJed Brown   ierr = PetscSectionGetStorageSize(newConeSection, &newConesSize);CHKERRQ(ierr);
31520298fd71SBarry Smith   ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newConesSize, newCones, NULL, newCones);CHKERRQ(ierr);
3153552f7358SJed Brown   ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-cones_view", &flg);CHKERRQ(ierr);
3154552f7358SJed Brown   if (flg) {
3155552f7358SJed Brown     ierr = PetscPrintf(comm, "Serial Cone Section:\n");CHKERRQ(ierr);
3156552f7358SJed Brown     ierr = PetscSectionView(originalConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
3157552f7358SJed Brown     ierr = PetscPrintf(comm, "Parallel Cone Section:\n");CHKERRQ(ierr);
3158552f7358SJed Brown     ierr = PetscSectionView(newConeSection, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
31590298fd71SBarry Smith     ierr = PetscSFView(coneSF, NULL);CHKERRQ(ierr);
3160552f7358SJed Brown   }
3161552f7358SJed Brown   ierr = DMPlexGetConeOrientations(dm, &cones);CHKERRQ(ierr);
3162552f7358SJed Brown   ierr = DMPlexGetConeOrientations(*dmParallel, &newCones);CHKERRQ(ierr);
3163552f7358SJed Brown   ierr = PetscSFBcastBegin(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
3164552f7358SJed Brown   ierr = PetscSFBcastEnd(coneSF, MPIU_INT, cones, newCones);CHKERRQ(ierr);
3165552f7358SJed Brown   ierr = PetscSFDestroy(&coneSF);CHKERRQ(ierr);
3166552f7358SJed Brown   /* Create supports and stratify sieve */
3167552f7358SJed Brown   {
3168552f7358SJed Brown     PetscInt pStart, pEnd;
3169552f7358SJed Brown 
3170552f7358SJed Brown     ierr = PetscSectionGetChart(pmesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
3171552f7358SJed Brown     ierr = PetscSectionSetChart(pmesh->supportSection, pStart, pEnd);CHKERRQ(ierr);
3172552f7358SJed Brown   }
3173552f7358SJed Brown   ierr = DMPlexSymmetrize(*dmParallel);CHKERRQ(ierr);
3174552f7358SJed Brown   ierr = DMPlexStratify(*dmParallel);CHKERRQ(ierr);
3175552f7358SJed Brown   /* Distribute Coordinates */
3176552f7358SJed Brown   {
3177552f7358SJed Brown     PetscSection originalCoordSection, newCoordSection;
3178552f7358SJed Brown     Vec          originalCoordinates, newCoordinates;
3179552f7358SJed Brown     const char  *name;
3180552f7358SJed Brown 
3181552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &originalCoordSection);CHKERRQ(ierr);
3182552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(*dmParallel, &newCoordSection);CHKERRQ(ierr);
3183552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &originalCoordinates);CHKERRQ(ierr);
3184552f7358SJed Brown     ierr = VecCreate(comm, &newCoordinates);CHKERRQ(ierr);
3185552f7358SJed Brown     ierr = PetscObjectGetName((PetscObject) originalCoordinates, &name);CHKERRQ(ierr);
3186552f7358SJed Brown     ierr = PetscObjectSetName((PetscObject) newCoordinates, name);CHKERRQ(ierr);
3187552f7358SJed Brown 
3188552f7358SJed Brown     ierr = DMPlexDistributeField(dm, pointSF, originalCoordSection, originalCoordinates, newCoordSection, newCoordinates);CHKERRQ(ierr);
3189552f7358SJed Brown     ierr = DMSetCoordinatesLocal(*dmParallel, newCoordinates);CHKERRQ(ierr);
3190552f7358SJed Brown     ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
3191552f7358SJed Brown   }
3192552f7358SJed Brown   /* Distribute labels */
3193b96ba592SMatthew G. Knepley   ierr = PetscLogEventBegin(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr);
3194552f7358SJed Brown   {
3195552f7358SJed Brown     DMLabel  next      = mesh->labels, newNext = pmesh->labels;
3196552f7358SJed Brown     PetscInt numLabels = 0, l;
3197552f7358SJed Brown 
3198552f7358SJed Brown     /* Bcast number of labels */
31990d644c17SKarl Rupp     while (next) {
32000d644c17SKarl Rupp       ++numLabels; next = next->next;
32010d644c17SKarl Rupp     }
3202552f7358SJed Brown     ierr = MPI_Bcast(&numLabels, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
3203552f7358SJed Brown     next = mesh->labels;
3204552f7358SJed Brown     for (l = 0; l < numLabels; ++l) {
3205552f7358SJed Brown       DMLabel         newLabel;
3206552f7358SJed Brown       const PetscInt *partArray;
3207552f7358SJed Brown       char           *name;
32080298fd71SBarry Smith       PetscInt       *stratumSizes = NULL, *points = NULL;
32090298fd71SBarry Smith       PetscMPIInt    *sendcnts     = NULL, *offsets = NULL, *displs = NULL;
32100447884eSMatthew G. Knepley       PetscInt        nameSize, s, p, proc;
3211552f7358SJed Brown       PetscBool       isdepth;
3212552f7358SJed Brown       size_t          len = 0;
3213552f7358SJed Brown 
3214552f7358SJed Brown       /* Bcast name (could filter for no points) */
3215552f7358SJed Brown       if (!rank) {ierr = PetscStrlen(next->name, &len);CHKERRQ(ierr);}
3216552f7358SJed Brown       nameSize = len;
3217552f7358SJed Brown       ierr     = MPI_Bcast(&nameSize, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
3218552f7358SJed Brown       ierr     = PetscMalloc(nameSize+1, &name);CHKERRQ(ierr);
3219552f7358SJed Brown       if (!rank) {ierr = PetscMemcpy(name, next->name, nameSize+1);CHKERRQ(ierr);}
3220552f7358SJed Brown       ierr = MPI_Bcast(name, nameSize+1, MPI_CHAR, 0, comm);CHKERRQ(ierr);
3221552f7358SJed Brown       ierr = PetscStrcmp(name, "depth", &isdepth);CHKERRQ(ierr);
322222566864SJed Brown       if (isdepth) {            /* skip because "depth" is not distributed */
322322566864SJed Brown         ierr = PetscFree(name);CHKERRQ(ierr);
322422566864SJed Brown         if (!rank) next = next->next;
322522566864SJed Brown         continue;
322622566864SJed Brown       }
3227552f7358SJed Brown       ierr           = PetscNew(struct _n_DMLabel, &newLabel);CHKERRQ(ierr);
3228552f7358SJed Brown       newLabel->name = name;
3229552f7358SJed Brown       /* Bcast numStrata (could filter for no points in stratum) */
32300d644c17SKarl Rupp       if (!rank) newLabel->numStrata = next->numStrata;
3231552f7358SJed Brown       ierr = MPI_Bcast(&newLabel->numStrata, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
3232552f7358SJed Brown       ierr = PetscMalloc3(newLabel->numStrata,PetscInt,&newLabel->stratumValues,
3233552f7358SJed Brown                           newLabel->numStrata,PetscInt,&newLabel->stratumSizes,
3234552f7358SJed Brown                           newLabel->numStrata+1,PetscInt,&newLabel->stratumOffsets);CHKERRQ(ierr);
3235552f7358SJed Brown       /* Bcast stratumValues (could filter for no points in stratum) */
3236552f7358SJed Brown       if (!rank) {ierr = PetscMemcpy(newLabel->stratumValues, next->stratumValues, next->numStrata * sizeof(PetscInt));CHKERRQ(ierr);}
3237552f7358SJed Brown       ierr = MPI_Bcast(newLabel->stratumValues, newLabel->numStrata, MPIU_INT, 0, comm);CHKERRQ(ierr);
32380447884eSMatthew G. Knepley       /* Find size on each process and Scatter
32390447884eSMatthew G. Knepley            we use the fact that both the stratum points and partArray are sorted */
3240552f7358SJed Brown       if (!rank) {
3241552f7358SJed Brown         ierr = ISGetIndices(part, &partArray);CHKERRQ(ierr);
3242552f7358SJed Brown         ierr = PetscMalloc(numProcs*next->numStrata * sizeof(PetscInt), &stratumSizes);CHKERRQ(ierr);
3243552f7358SJed Brown         ierr = PetscMemzero(stratumSizes, numProcs*next->numStrata * sizeof(PetscInt));CHKERRQ(ierr);
32440447884eSMatthew G. Knepley         /* TODO We should switch to using binary search if the label is a lot smaller than partitions */
3245552f7358SJed Brown         for (proc = 0; proc < numProcs; ++proc) {
32460447884eSMatthew G. Knepley           PetscInt dof, off;
3247552f7358SJed Brown 
3248552f7358SJed Brown           ierr = PetscSectionGetDof(partSection, proc, &dof);CHKERRQ(ierr);
3249552f7358SJed Brown           ierr = PetscSectionGetOffset(partSection, proc, &off);CHKERRQ(ierr);
32500447884eSMatthew G. Knepley           for (s = 0; s < next->numStrata; ++s) {
32510447884eSMatthew G. Knepley             PetscInt lStart = next->stratumOffsets[s], lEnd = next->stratumOffsets[s]+next->stratumSizes[s];
32520447884eSMatthew G. Knepley             PetscInt pStart = off,                     pEnd = off+dof;
32530447884eSMatthew G. Knepley 
32540447884eSMatthew G. Knepley             while (pStart < pEnd && lStart < lEnd) {
32550447884eSMatthew G. Knepley               if (partArray[pStart] > next->points[lStart]) {
32560447884eSMatthew G. Knepley                 ++lStart;
32570447884eSMatthew G. Knepley               } else if (next->points[lStart] > partArray[pStart]) {
32580447884eSMatthew G. Knepley                 ++pStart;
32590447884eSMatthew G. Knepley               } else {
3260552f7358SJed Brown                 ++stratumSizes[proc*next->numStrata+s];
32610447884eSMatthew G. Knepley                 ++pStart; ++lStart;
3262552f7358SJed Brown               }
3263552f7358SJed Brown             }
3264552f7358SJed Brown           }
3265552f7358SJed Brown         }
3266552f7358SJed Brown         ierr = ISRestoreIndices(part, &partArray);CHKERRQ(ierr);
3267552f7358SJed Brown       }
3268552f7358SJed Brown       ierr = MPI_Scatter(stratumSizes, newLabel->numStrata, MPIU_INT, newLabel->stratumSizes, newLabel->numStrata, MPIU_INT, 0, comm);CHKERRQ(ierr);
3269552f7358SJed Brown       /* Calculate stratumOffsets */
3270552f7358SJed Brown       newLabel->stratumOffsets[0] = 0;
3271552f7358SJed Brown       for (s = 0; s < newLabel->numStrata; ++s) {
3272552f7358SJed Brown         newLabel->stratumOffsets[s+1] = newLabel->stratumSizes[s] + newLabel->stratumOffsets[s];
3273552f7358SJed Brown       }
3274552f7358SJed Brown       /* Pack points and Scatter */
3275552f7358SJed Brown       if (!rank) {
3276552f7358SJed Brown         ierr = PetscMalloc3(numProcs,PetscMPIInt,&sendcnts,numProcs,PetscMPIInt,&offsets,numProcs+1,PetscMPIInt,&displs);CHKERRQ(ierr);
3277552f7358SJed Brown         displs[0] = 0;
3278552f7358SJed Brown         for (p = 0; p < numProcs; ++p) {
3279552f7358SJed Brown           sendcnts[p] = 0;
3280552f7358SJed Brown           for (s = 0; s < next->numStrata; ++s) {
3281552f7358SJed Brown             sendcnts[p] += stratumSizes[p*next->numStrata+s];
3282552f7358SJed Brown           }
3283552f7358SJed Brown           offsets[p]  = displs[p];
3284552f7358SJed Brown           displs[p+1] = displs[p] + sendcnts[p];
3285552f7358SJed Brown         }
3286552f7358SJed Brown         ierr = PetscMalloc(displs[numProcs] * sizeof(PetscInt), &points);CHKERRQ(ierr);
32870447884eSMatthew G. Knepley         /* TODO We should switch to using binary search if the label is a lot smaller than partitions */
3288552f7358SJed Brown         for (proc = 0; proc < numProcs; ++proc) {
32890447884eSMatthew G. Knepley           PetscInt dof, off;
3290552f7358SJed Brown 
3291552f7358SJed Brown           ierr = PetscSectionGetDof(partSection, proc, &dof);CHKERRQ(ierr);
3292552f7358SJed Brown           ierr = PetscSectionGetOffset(partSection, proc, &off);CHKERRQ(ierr);
32930447884eSMatthew G. Knepley           for (s = 0; s < next->numStrata; ++s) {
32940447884eSMatthew G. Knepley             PetscInt lStart = next->stratumOffsets[s], lEnd = next->stratumOffsets[s]+next->stratumSizes[s];
32950447884eSMatthew G. Knepley             PetscInt pStart = off,                     pEnd = off+dof;
32960447884eSMatthew G. Knepley 
32970447884eSMatthew G. Knepley             while (pStart < pEnd && lStart < lEnd) {
32980447884eSMatthew G. Knepley               if (partArray[pStart] > next->points[lStart]) {
32990447884eSMatthew G. Knepley                 ++lStart;
33000447884eSMatthew G. Knepley               } else if (next->points[lStart] > partArray[pStart]) {
33010447884eSMatthew G. Knepley                 ++pStart;
33020447884eSMatthew G. Knepley               } else {
33030447884eSMatthew G. Knepley                 points[offsets[proc]++] = next->points[lStart];
33040447884eSMatthew G. Knepley                 ++pStart; ++lStart;
3305552f7358SJed Brown               }
3306552f7358SJed Brown             }
3307552f7358SJed Brown           }
3308552f7358SJed Brown         }
3309552f7358SJed Brown       }
3310552f7358SJed Brown       ierr = PetscMalloc(newLabel->stratumOffsets[newLabel->numStrata] * sizeof(PetscInt), &newLabel->points);CHKERRQ(ierr);
3311552f7358SJed Brown       ierr = MPI_Scatterv(points, sendcnts, displs, MPIU_INT, newLabel->points, newLabel->stratumOffsets[newLabel->numStrata], MPIU_INT, 0, comm);CHKERRQ(ierr);
3312552f7358SJed Brown       ierr = PetscFree(points);CHKERRQ(ierr);
3313552f7358SJed Brown       ierr = PetscFree3(sendcnts,offsets,displs);CHKERRQ(ierr);
3314552f7358SJed Brown       ierr = PetscFree(stratumSizes);CHKERRQ(ierr);
3315552f7358SJed Brown       /* Renumber points */
33160298fd71SBarry Smith       ierr = ISGlobalToLocalMappingApply(renumbering, IS_GTOLM_MASK, newLabel->stratumOffsets[newLabel->numStrata], newLabel->points, NULL, newLabel->points);CHKERRQ(ierr);
3317552f7358SJed Brown       /* Sort points */
3318552f7358SJed Brown       for (s = 0; s < newLabel->numStrata; ++s) {
3319552f7358SJed Brown         ierr = PetscSortInt(newLabel->stratumSizes[s], &newLabel->points[newLabel->stratumOffsets[s]]);CHKERRQ(ierr);
3320552f7358SJed Brown       }
3321552f7358SJed Brown       /* Insert into list */
33220d644c17SKarl Rupp       if (newNext) newNext->next = newLabel;
33230d644c17SKarl Rupp       else pmesh->labels = newLabel;
3324552f7358SJed Brown       newNext = newLabel;
33250d644c17SKarl Rupp       if (!rank) next = next->next;
3326552f7358SJed Brown     }
3327552f7358SJed Brown   }
3328b96ba592SMatthew G. Knepley   ierr = PetscLogEventEnd(DMPLEX_DistributeLabels,dm,0,0,0);CHKERRQ(ierr);
33295a9d0af9SMatthew G. Knepley   /* Setup hybrid structure */
33305a9d0af9SMatthew G. Knepley   {
33315a9d0af9SMatthew G. Knepley     const PetscInt *gpoints;
33325a9d0af9SMatthew G. Knepley     PetscInt        depth, n, d;
33335a9d0af9SMatthew G. Knepley 
33345a9d0af9SMatthew G. Knepley     for (d = 0; d <= dim; ++d) {pmesh->hybridPointMax[d] = mesh->hybridPointMax[d];}
33355a9d0af9SMatthew G. Knepley     ierr = MPI_Bcast(pmesh->hybridPointMax, dim+1, MPIU_INT, 0, comm);CHKERRQ(ierr);
33365a9d0af9SMatthew G. Knepley     ierr = ISLocalToGlobalMappingGetSize(renumbering, &n);CHKERRQ(ierr);
33375a9d0af9SMatthew G. Knepley     ierr = ISLocalToGlobalMappingGetIndices(renumbering, &gpoints);CHKERRQ(ierr);
33385a9d0af9SMatthew G. Knepley     ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
33395a9d0af9SMatthew G. Knepley     for (d = 0; d <= dim; ++d) {
33405a9d0af9SMatthew G. Knepley       PetscInt pmax = pmesh->hybridPointMax[d], newmax = 0, pEnd, stratum[2], p;
33415a9d0af9SMatthew G. Knepley 
33425a9d0af9SMatthew G. Knepley       if (pmax < 0) continue;
33435a9d0af9SMatthew G. Knepley       ierr = DMPlexGetDepthStratum(dm, d > depth ? depth : d, &stratum[0], &stratum[1]);CHKERRQ(ierr);
33446dfbe1fcSMatthew G. Knepley       ierr = DMPlexGetDepthStratum(*dmParallel, d, NULL, &pEnd);CHKERRQ(ierr);
33455a9d0af9SMatthew G. Knepley       ierr = MPI_Bcast(stratum, 2, MPIU_INT, 0, comm);CHKERRQ(ierr);
33465a9d0af9SMatthew G. Knepley       for (p = 0; p < n; ++p) {
33475a9d0af9SMatthew G. Knepley         const PetscInt point = gpoints[p];
33485a9d0af9SMatthew G. Knepley 
33495a9d0af9SMatthew G. Knepley         if ((point >= stratum[0]) && (point < stratum[1]) && (point >= pmax)) ++newmax;
33505a9d0af9SMatthew G. Knepley       }
33515a9d0af9SMatthew G. Knepley       if (newmax > 0) pmesh->hybridPointMax[d] = pEnd - newmax;
33525a9d0af9SMatthew G. Knepley       else            pmesh->hybridPointMax[d] = -1;
33535a9d0af9SMatthew G. Knepley     }
33545a9d0af9SMatthew G. Knepley     ierr = ISLocalToGlobalMappingRestoreIndices(renumbering, &gpoints);CHKERRQ(ierr);
33555a9d0af9SMatthew G. Knepley   }
3356552f7358SJed Brown   /* Cleanup Partition */
3357552f7358SJed Brown   ierr = ISLocalToGlobalMappingDestroy(&renumbering);CHKERRQ(ierr);
3358552f7358SJed Brown   ierr = PetscSFDestroy(&partSF);CHKERRQ(ierr);
3359552f7358SJed Brown   ierr = PetscSectionDestroy(&partSection);CHKERRQ(ierr);
3360552f7358SJed Brown   ierr = ISDestroy(&part);CHKERRQ(ierr);
3361552f7358SJed Brown   /* Create point SF for parallel mesh */
3362b96ba592SMatthew G. Knepley   ierr = PetscLogEventBegin(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr);
3363552f7358SJed Brown   {
3364552f7358SJed Brown     const PetscInt *leaves;
3365552f7358SJed Brown     PetscSFNode    *remotePoints, *rowners, *lowners;
3366552f7358SJed Brown     PetscInt        numRoots, numLeaves, numGhostPoints = 0, p, gp, *ghostPoints;
3367552f7358SJed Brown     PetscInt        pStart, pEnd;
3368552f7358SJed Brown 
3369552f7358SJed Brown     ierr = DMPlexGetChart(*dmParallel, &pStart, &pEnd);CHKERRQ(ierr);
33700298fd71SBarry Smith     ierr = PetscSFGetGraph(pointSF, &numRoots, &numLeaves, &leaves, NULL);CHKERRQ(ierr);
3371552f7358SJed Brown     ierr = PetscMalloc2(numRoots,PetscSFNode,&rowners,numLeaves,PetscSFNode,&lowners);CHKERRQ(ierr);
3372552f7358SJed Brown     for (p=0; p<numRoots; p++) {
3373552f7358SJed Brown       rowners[p].rank  = -1;
3374552f7358SJed Brown       rowners[p].index = -1;
3375552f7358SJed Brown     }
3376552f7358SJed Brown     if (origCellPart) {
3377552f7358SJed Brown       /* Make sure cells in the original partition are not assigned to other procs */
3378552f7358SJed Brown       const PetscInt *origCells;
3379552f7358SJed Brown 
3380552f7358SJed Brown       ierr = ISGetIndices(origCellPart, &origCells);CHKERRQ(ierr);
3381552f7358SJed Brown       for (p = 0; p < numProcs; ++p) {
3382552f7358SJed Brown         PetscInt dof, off, d;
3383552f7358SJed Brown 
3384552f7358SJed Brown         ierr = PetscSectionGetDof(origCellPartSection, p, &dof);CHKERRQ(ierr);
3385552f7358SJed Brown         ierr = PetscSectionGetOffset(origCellPartSection, p, &off);CHKERRQ(ierr);
3386552f7358SJed Brown         for (d = off; d < off+dof; ++d) {
3387552f7358SJed Brown           rowners[origCells[d]].rank = p;
3388552f7358SJed Brown         }
3389552f7358SJed Brown       }
3390552f7358SJed Brown       ierr = ISRestoreIndices(origCellPart, &origCells);CHKERRQ(ierr);
3391552f7358SJed Brown     }
3392552f7358SJed Brown     ierr = ISDestroy(&origCellPart);CHKERRQ(ierr);
3393552f7358SJed Brown     ierr = PetscSectionDestroy(&origCellPartSection);CHKERRQ(ierr);
3394552f7358SJed Brown 
3395552f7358SJed Brown     ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3396552f7358SJed Brown     ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3397552f7358SJed Brown     for (p = 0; p < numLeaves; ++p) {
3398552f7358SJed Brown       if (lowners[p].rank < 0 || lowners[p].rank == rank) { /* Either put in a bid or we know we own it */
3399552f7358SJed Brown         lowners[p].rank  = rank;
3400552f7358SJed Brown         lowners[p].index = leaves ? leaves[p] : p;
3401552f7358SJed Brown       } else if (lowners[p].rank >= 0) { /* Point already claimed so flag so that MAXLOC does not listen to us */
3402552f7358SJed Brown         lowners[p].rank  = -2;
3403552f7358SJed Brown         lowners[p].index = -2;
3404552f7358SJed Brown       }
3405552f7358SJed Brown     }
3406552f7358SJed Brown     for (p=0; p<numRoots; p++) { /* Root must not participate in the rediction, flag so that MAXLOC does not use */
3407552f7358SJed Brown       rowners[p].rank  = -3;
3408552f7358SJed Brown       rowners[p].index = -3;
3409552f7358SJed Brown     }
3410552f7358SJed Brown     ierr = PetscSFReduceBegin(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr);
3411552f7358SJed Brown     ierr = PetscSFReduceEnd(pointSF, MPIU_2INT, lowners, rowners, MPI_MAXLOC);CHKERRQ(ierr);
3412552f7358SJed Brown     ierr = PetscSFBcastBegin(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3413552f7358SJed Brown     ierr = PetscSFBcastEnd(pointSF, MPIU_2INT, rowners, lowners);CHKERRQ(ierr);
3414552f7358SJed Brown     for (p = 0; p < numLeaves; ++p) {
3415552f7358SJed Brown       if (lowners[p].rank < 0 || lowners[p].index < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cell partition corrupt: point not claimed");
3416552f7358SJed Brown       if (lowners[p].rank != rank) ++numGhostPoints;
3417552f7358SJed Brown     }
3418552f7358SJed Brown     ierr = PetscMalloc(numGhostPoints * sizeof(PetscInt),    &ghostPoints);CHKERRQ(ierr);
3419552f7358SJed Brown     ierr = PetscMalloc(numGhostPoints * sizeof(PetscSFNode), &remotePoints);CHKERRQ(ierr);
3420552f7358SJed Brown     for (p = 0, gp = 0; p < numLeaves; ++p) {
3421552f7358SJed Brown       if (lowners[p].rank != rank) {
3422552f7358SJed Brown         ghostPoints[gp]        = leaves ? leaves[p] : p;
3423552f7358SJed Brown         remotePoints[gp].rank  = lowners[p].rank;
3424552f7358SJed Brown         remotePoints[gp].index = lowners[p].index;
3425552f7358SJed Brown         ++gp;
3426552f7358SJed Brown       }
3427552f7358SJed Brown     }
3428552f7358SJed Brown     ierr = PetscFree2(rowners,lowners);CHKERRQ(ierr);
3429552f7358SJed Brown     ierr = PetscSFSetGraph((*dmParallel)->sf, pEnd - pStart, numGhostPoints, ghostPoints, PETSC_OWN_POINTER, remotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3430552f7358SJed Brown     ierr = PetscSFSetFromOptions((*dmParallel)->sf);CHKERRQ(ierr);
3431552f7358SJed Brown   }
3432b96ba592SMatthew G. Knepley   ierr = PetscLogEventEnd(DMPLEX_DistributeSF,dm,0,0,0);CHKERRQ(ierr);
3433552f7358SJed Brown   /* Cleanup */
3434e7ba9e7aSMatthew G. Knepley   if (sf) {*sf = pointSF;}
3435e7ba9e7aSMatthew G. Knepley   else    {ierr = PetscSFDestroy(&pointSF);CHKERRQ(ierr);}
3436552f7358SJed Brown   ierr = DMSetFromOptions(*dmParallel);CHKERRQ(ierr);
3437552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Distribute,dm,0,0,0);CHKERRQ(ierr);
3438552f7358SJed Brown   PetscFunctionReturn(0);
3439552f7358SJed Brown }
3440552f7358SJed Brown 
34412e1b13c2SMatthew G. Knepley #undef __FUNCT__
34429db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell"
34439db3b87dSMatthew G. Knepley /*@C
34449db3b87dSMatthew G. Knepley   DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched.
34459db3b87dSMatthew G. Knepley 
34469db3b87dSMatthew G. Knepley   Input Parameters:
34479db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell
34489db3b87dSMatthew G. Knepley - cone - The incoming cone
34499db3b87dSMatthew G. Knepley 
34509db3b87dSMatthew G. Knepley   Output Parameter:
34519db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place)
34529db3b87dSMatthew G. Knepley 
34539db3b87dSMatthew G. Knepley   Level: developer
34549db3b87dSMatthew G. Knepley 
34559db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate()
34569db3b87dSMatthew G. Knepley @*/
34579db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[])
34582e1b13c2SMatthew G. Knepley {
34599db3b87dSMatthew G. Knepley   int tmpc;
34602e1b13c2SMatthew G. Knepley 
34612e1b13c2SMatthew G. Knepley   PetscFunctionBegin;
34629db3b87dSMatthew G. Knepley   if (dim != 3) PetscFunctionReturn(0);
34639db3b87dSMatthew G. Knepley   switch (numCorners) {
34649db3b87dSMatthew G. Knepley   case 4:
34651885f254SMatthew G. Knepley     tmpc    = cone[0];
34661885f254SMatthew G. Knepley     cone[0] = cone[1];
34671885f254SMatthew G. Knepley     cone[1] = tmpc;
34689db3b87dSMatthew G. Knepley     break;
34699db3b87dSMatthew G. Knepley   case 8:
34709db3b87dSMatthew G. Knepley     tmpc    = cone[1];
34719db3b87dSMatthew G. Knepley     cone[1] = cone[3];
34729db3b87dSMatthew G. Knepley     cone[3] = tmpc;
34739db3b87dSMatthew G. Knepley     break;
34749db3b87dSMatthew G. Knepley   default: break;
34759db3b87dSMatthew G. Knepley   }
34769db3b87dSMatthew G. Knepley   PetscFunctionReturn(0);
34779db3b87dSMatthew G. Knepley }
34789db3b87dSMatthew G. Knepley 
34799db3b87dSMatthew G. Knepley #undef __FUNCT__
34809db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal"
34819db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */
34829db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[])
34839db3b87dSMatthew G. Knepley {
34849db3b87dSMatthew G. Knepley   PetscInt       bound = numCells*numCorners, coff;
34859db3b87dSMatthew G. Knepley   PetscErrorCode ierr;
34869db3b87dSMatthew G. Knepley 
34879db3b87dSMatthew G. Knepley   PetscFunctionBegin;
34889db3b87dSMatthew G. Knepley   for (coff = 0; coff < bound; coff += numCorners) {
34899db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr);
34902e1b13c2SMatthew G. Knepley   }
34912e1b13c2SMatthew G. Knepley   PetscFunctionReturn(0);
34922e1b13c2SMatthew G. Knepley }
34932e1b13c2SMatthew G. Knepley 
3494519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
3495552f7358SJed Brown #include <triangle.h>
3496552f7358SJed Brown 
3497552f7358SJed Brown #undef __FUNCT__
3498552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle"
34990adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx)
35000adebc6cSBarry Smith {
3501552f7358SJed Brown   PetscFunctionBegin;
3502552f7358SJed Brown   inputCtx->numberofpoints             = 0;
3503552f7358SJed Brown   inputCtx->numberofpointattributes    = 0;
35040298fd71SBarry Smith   inputCtx->pointlist                  = NULL;
35050298fd71SBarry Smith   inputCtx->pointattributelist         = NULL;
35060298fd71SBarry Smith   inputCtx->pointmarkerlist            = NULL;
3507552f7358SJed Brown   inputCtx->numberofsegments           = 0;
35080298fd71SBarry Smith   inputCtx->segmentlist                = NULL;
35090298fd71SBarry Smith   inputCtx->segmentmarkerlist          = NULL;
3510552f7358SJed Brown   inputCtx->numberoftriangleattributes = 0;
35110298fd71SBarry Smith   inputCtx->trianglelist               = NULL;
3512552f7358SJed Brown   inputCtx->numberofholes              = 0;
35130298fd71SBarry Smith   inputCtx->holelist                   = NULL;
3514552f7358SJed Brown   inputCtx->numberofregions            = 0;
35150298fd71SBarry Smith   inputCtx->regionlist                 = NULL;
3516552f7358SJed Brown   PetscFunctionReturn(0);
3517552f7358SJed Brown }
3518552f7358SJed Brown 
3519552f7358SJed Brown #undef __FUNCT__
3520552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle"
35210adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx)
35220adebc6cSBarry Smith {
3523552f7358SJed Brown   PetscFunctionBegin;
3524552f7358SJed Brown   outputCtx->numberofpoints        = 0;
35250298fd71SBarry Smith   outputCtx->pointlist             = NULL;
35260298fd71SBarry Smith   outputCtx->pointattributelist    = NULL;
35270298fd71SBarry Smith   outputCtx->pointmarkerlist       = NULL;
3528552f7358SJed Brown   outputCtx->numberoftriangles     = 0;
35290298fd71SBarry Smith   outputCtx->trianglelist          = NULL;
35300298fd71SBarry Smith   outputCtx->triangleattributelist = NULL;
35310298fd71SBarry Smith   outputCtx->neighborlist          = NULL;
35320298fd71SBarry Smith   outputCtx->segmentlist           = NULL;
35330298fd71SBarry Smith   outputCtx->segmentmarkerlist     = NULL;
3534552f7358SJed Brown   outputCtx->numberofedges         = 0;
35350298fd71SBarry Smith   outputCtx->edgelist              = NULL;
35360298fd71SBarry Smith   outputCtx->edgemarkerlist        = NULL;
3537552f7358SJed Brown   PetscFunctionReturn(0);
3538552f7358SJed Brown }
3539552f7358SJed Brown 
3540552f7358SJed Brown #undef __FUNCT__
3541552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle"
35420adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx)
35430adebc6cSBarry Smith {
3544552f7358SJed Brown   PetscFunctionBegin;
3545552f7358SJed Brown   free(outputCtx->pointmarkerlist);
3546552f7358SJed Brown   free(outputCtx->edgelist);
3547552f7358SJed Brown   free(outputCtx->edgemarkerlist);
3548552f7358SJed Brown   free(outputCtx->trianglelist);
3549552f7358SJed Brown   free(outputCtx->neighborlist);
3550552f7358SJed Brown   PetscFunctionReturn(0);
3551552f7358SJed Brown }
3552552f7358SJed Brown 
3553552f7358SJed Brown #undef __FUNCT__
3554552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle"
3555552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm)
3556552f7358SJed Brown {
355782f516ccSBarry Smith   MPI_Comm             comm;
3558552f7358SJed Brown   PetscInt             dim              = 2;
3559552f7358SJed Brown   const PetscBool      createConvexHull = PETSC_FALSE;
3560552f7358SJed Brown   const PetscBool      constrained      = PETSC_FALSE;
3561552f7358SJed Brown   struct triangulateio in;
3562552f7358SJed Brown   struct triangulateio out;
3563552f7358SJed Brown   PetscInt             vStart, vEnd, v, eStart, eEnd, e;
3564552f7358SJed Brown   PetscMPIInt          rank;
3565552f7358SJed Brown   PetscErrorCode       ierr;
3566552f7358SJed Brown 
3567552f7358SJed Brown   PetscFunctionBegin;
356882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
3569552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3570552f7358SJed Brown   ierr = InitInput_Triangle(&in);CHKERRQ(ierr);
3571552f7358SJed Brown   ierr = InitOutput_Triangle(&out);CHKERRQ(ierr);
3572552f7358SJed Brown   ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
35730d644c17SKarl Rupp 
3574552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3575552f7358SJed Brown   if (in.numberofpoints > 0) {
3576552f7358SJed Brown     PetscSection coordSection;
3577552f7358SJed Brown     Vec          coordinates;
3578552f7358SJed Brown     PetscScalar *array;
3579552f7358SJed Brown 
3580552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints*dim * sizeof(double), &in.pointlist);CHKERRQ(ierr);
3581552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints * sizeof(int), &in.pointmarkerlist);CHKERRQ(ierr);
3582552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
3583552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
3584552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3585552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3586552f7358SJed Brown       const PetscInt idx = v - vStart;
3587552f7358SJed Brown       PetscInt       off, d;
3588552f7358SJed Brown 
3589552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3590552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3591552f7358SJed Brown         in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3592552f7358SJed Brown       }
3593552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3594552f7358SJed Brown     }
3595552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3596552f7358SJed Brown   }
3597552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr);
3598552f7358SJed Brown   in.numberofsegments = eEnd - eStart;
3599552f7358SJed Brown   if (in.numberofsegments > 0) {
3600552f7358SJed Brown     ierr = PetscMalloc(in.numberofsegments*2 * sizeof(int), &in.segmentlist);CHKERRQ(ierr);
3601552f7358SJed Brown     ierr = PetscMalloc(in.numberofsegments   * sizeof(int), &in.segmentmarkerlist);CHKERRQ(ierr);
3602552f7358SJed Brown     for (e = eStart; e < eEnd; ++e) {
3603552f7358SJed Brown       const PetscInt  idx = e - eStart;
3604552f7358SJed Brown       const PetscInt *cone;
3605552f7358SJed Brown 
3606552f7358SJed Brown       ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr);
36070d644c17SKarl Rupp 
3608552f7358SJed Brown       in.segmentlist[idx*2+0] = cone[0] - vStart;
3609552f7358SJed Brown       in.segmentlist[idx*2+1] = cone[1] - vStart;
36100d644c17SKarl Rupp 
3611552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr);
3612552f7358SJed Brown     }
3613552f7358SJed Brown   }
3614552f7358SJed Brown #if 0 /* Do not currently support holes */
3615552f7358SJed Brown   PetscReal *holeCoords;
3616552f7358SJed Brown   PetscInt   h, d;
3617552f7358SJed Brown 
3618552f7358SJed Brown   ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr);
3619552f7358SJed Brown   if (in.numberofholes > 0) {
3620552f7358SJed Brown     ierr = PetscMalloc(in.numberofholes*dim * sizeof(double), &in.holelist);CHKERRQ(ierr);
3621552f7358SJed Brown     for (h = 0; h < in.numberofholes; ++h) {
3622552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3623552f7358SJed Brown         in.holelist[h*dim+d] = holeCoords[h*dim+d];
3624552f7358SJed Brown       }
3625552f7358SJed Brown     }
3626552f7358SJed Brown   }
3627552f7358SJed Brown #endif
3628552f7358SJed Brown   if (!rank) {
3629552f7358SJed Brown     char args[32];
3630552f7358SJed Brown 
3631552f7358SJed Brown     /* Take away 'Q' for verbose output */
3632552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr);
3633552f7358SJed Brown     if (createConvexHull) {
3634552f7358SJed Brown       ierr = PetscStrcat(args, "c");CHKERRQ(ierr);
3635552f7358SJed Brown     }
3636552f7358SJed Brown     if (constrained) {
3637552f7358SJed Brown       ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr);
3638552f7358SJed Brown     }
36390298fd71SBarry Smith     triangulate(args, &in, &out, NULL);
3640552f7358SJed Brown   }
3641552f7358SJed Brown   ierr = PetscFree(in.pointlist);CHKERRQ(ierr);
3642552f7358SJed Brown   ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr);
3643552f7358SJed Brown   ierr = PetscFree(in.segmentlist);CHKERRQ(ierr);
3644552f7358SJed Brown   ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr);
3645552f7358SJed Brown   ierr = PetscFree(in.holelist);CHKERRQ(ierr);
3646552f7358SJed Brown 
3647552f7358SJed Brown   {
3648552f7358SJed Brown     const PetscInt numCorners  = 3;
3649552f7358SJed Brown     const PetscInt numCells    = out.numberoftriangles;
3650552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3651552f7358SJed Brown     const int     *cells      = out.trianglelist;
3652552f7358SJed Brown     const double  *meshCoords = out.pointlist;
3653552f7358SJed Brown 
36540fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
3655552f7358SJed Brown     /* Set labels */
3656552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3657552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3658552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3659552f7358SJed Brown       }
3660552f7358SJed Brown     }
3661552f7358SJed Brown     if (interpolate) {
3662552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3663552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3664552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3665552f7358SJed Brown           const PetscInt *edges;
3666552f7358SJed Brown           PetscInt        numEdges;
3667552f7358SJed Brown 
3668552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3669552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3670552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3671552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3672552f7358SJed Brown         }
3673552f7358SJed Brown       }
3674552f7358SJed Brown     }
3675552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
3676552f7358SJed Brown   }
3677552f7358SJed Brown #if 0 /* Do not currently support holes */
3678552f7358SJed Brown   ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr);
3679552f7358SJed Brown #endif
3680552f7358SJed Brown   ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr);
3681552f7358SJed Brown   PetscFunctionReturn(0);
3682552f7358SJed Brown }
3683552f7358SJed Brown 
3684552f7358SJed Brown #undef __FUNCT__
3685552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle"
3686552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined)
3687552f7358SJed Brown {
368882f516ccSBarry Smith   MPI_Comm             comm;
3689552f7358SJed Brown   PetscInt             dim  = 2;
3690552f7358SJed Brown   struct triangulateio in;
3691552f7358SJed Brown   struct triangulateio out;
3692552f7358SJed Brown   PetscInt             vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
3693552f7358SJed Brown   PetscMPIInt          rank;
3694552f7358SJed Brown   PetscErrorCode       ierr;
3695552f7358SJed Brown 
3696552f7358SJed Brown   PetscFunctionBegin;
369782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
3698552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3699552f7358SJed Brown   ierr = InitInput_Triangle(&in);CHKERRQ(ierr);
3700552f7358SJed Brown   ierr = InitOutput_Triangle(&out);CHKERRQ(ierr);
3701552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3702552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
3703552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
37040d644c17SKarl Rupp 
3705552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3706552f7358SJed Brown   if (in.numberofpoints > 0) {
3707552f7358SJed Brown     PetscSection coordSection;
3708552f7358SJed Brown     Vec          coordinates;
3709552f7358SJed Brown     PetscScalar *array;
3710552f7358SJed Brown 
3711552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints*dim * sizeof(double), &in.pointlist);CHKERRQ(ierr);
3712552f7358SJed Brown     ierr = PetscMalloc(in.numberofpoints * sizeof(int), &in.pointmarkerlist);CHKERRQ(ierr);
3713552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
3714552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3715552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3716552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3717552f7358SJed Brown       const PetscInt idx = v - vStart;
3718552f7358SJed Brown       PetscInt       off, d;
3719552f7358SJed Brown 
3720552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3721552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3722552f7358SJed Brown         in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3723552f7358SJed Brown       }
3724552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3725552f7358SJed Brown     }
3726552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3727552f7358SJed Brown   }
3728552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
37290d644c17SKarl Rupp 
3730552f7358SJed Brown   in.numberofcorners   = 3;
3731552f7358SJed Brown   in.numberoftriangles = cEnd - cStart;
37320d644c17SKarl Rupp 
3733552f7358SJed Brown   in.trianglearealist  = (double*) maxVolumes;
3734552f7358SJed Brown   if (in.numberoftriangles > 0) {
3735552f7358SJed Brown     ierr = PetscMalloc(in.numberoftriangles*in.numberofcorners * sizeof(int), &in.trianglelist);CHKERRQ(ierr);
3736552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3737552f7358SJed Brown       const PetscInt idx      = c - cStart;
37380298fd71SBarry Smith       PetscInt      *closure = NULL;
3739552f7358SJed Brown       PetscInt       closureSize;
3740552f7358SJed Brown 
3741552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3742552f7358SJed 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);
3743552f7358SJed Brown       for (v = 0; v < 3; ++v) {
3744552f7358SJed Brown         in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart;
3745552f7358SJed Brown       }
3746552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3747552f7358SJed Brown     }
3748552f7358SJed Brown   }
3749552f7358SJed Brown   /* TODO: Segment markers are missing on input */
3750552f7358SJed Brown #if 0 /* Do not currently support holes */
3751552f7358SJed Brown   PetscReal *holeCoords;
3752552f7358SJed Brown   PetscInt   h, d;
3753552f7358SJed Brown 
3754552f7358SJed Brown   ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr);
3755552f7358SJed Brown   if (in.numberofholes > 0) {
3756552f7358SJed Brown     ierr = PetscMalloc(in.numberofholes*dim * sizeof(double), &in.holelist);CHKERRQ(ierr);
3757552f7358SJed Brown     for (h = 0; h < in.numberofholes; ++h) {
3758552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3759552f7358SJed Brown         in.holelist[h*dim+d] = holeCoords[h*dim+d];
3760552f7358SJed Brown       }
3761552f7358SJed Brown     }
3762552f7358SJed Brown   }
3763552f7358SJed Brown #endif
3764552f7358SJed Brown   if (!rank) {
3765552f7358SJed Brown     char args[32];
3766552f7358SJed Brown 
3767552f7358SJed Brown     /* Take away 'Q' for verbose output */
3768552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr);
37690298fd71SBarry Smith     triangulate(args, &in, &out, NULL);
3770552f7358SJed Brown   }
3771552f7358SJed Brown   ierr = PetscFree(in.pointlist);CHKERRQ(ierr);
3772552f7358SJed Brown   ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr);
3773552f7358SJed Brown   ierr = PetscFree(in.segmentlist);CHKERRQ(ierr);
3774552f7358SJed Brown   ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr);
3775552f7358SJed Brown   ierr = PetscFree(in.trianglelist);CHKERRQ(ierr);
3776552f7358SJed Brown 
3777552f7358SJed Brown   {
3778552f7358SJed Brown     const PetscInt numCorners  = 3;
3779552f7358SJed Brown     const PetscInt numCells    = out.numberoftriangles;
3780552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3781552f7358SJed Brown     const int     *cells      = out.trianglelist;
3782552f7358SJed Brown     const double  *meshCoords = out.pointlist;
3783552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
3784552f7358SJed Brown 
37850fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
3786552f7358SJed Brown     /* Set labels */
3787552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3788552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3789552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3790552f7358SJed Brown       }
3791552f7358SJed Brown     }
3792552f7358SJed Brown     if (interpolate) {
3793552f7358SJed Brown       PetscInt e;
3794552f7358SJed Brown 
3795552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3796552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3797552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3798552f7358SJed Brown           const PetscInt *edges;
3799552f7358SJed Brown           PetscInt        numEdges;
3800552f7358SJed Brown 
3801552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3802552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3803552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3804552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3805552f7358SJed Brown         }
3806552f7358SJed Brown       }
3807552f7358SJed Brown     }
3808552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
3809552f7358SJed Brown   }
3810552f7358SJed Brown #if 0 /* Do not currently support holes */
3811552f7358SJed Brown   ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr);
3812552f7358SJed Brown #endif
3813552f7358SJed Brown   ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr);
3814552f7358SJed Brown   PetscFunctionReturn(0);
3815552f7358SJed Brown }
3816552f7358SJed Brown #endif
3817552f7358SJed Brown 
3818519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
3819552f7358SJed Brown #include <tetgen.h>
3820552f7358SJed Brown #undef __FUNCT__
3821552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen"
3822552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm)
3823552f7358SJed Brown {
382482f516ccSBarry Smith   MPI_Comm       comm;
3825552f7358SJed Brown   const PetscInt dim  = 3;
3826552f7358SJed Brown   ::tetgenio     in;
3827552f7358SJed Brown   ::tetgenio     out;
3828552f7358SJed Brown   PetscInt       vStart, vEnd, v, fStart, fEnd, f;
3829552f7358SJed Brown   PetscMPIInt    rank;
3830552f7358SJed Brown   PetscErrorCode ierr;
3831552f7358SJed Brown 
3832552f7358SJed Brown   PetscFunctionBegin;
383382f516ccSBarry Smith   ierr              = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
3834552f7358SJed Brown   ierr              = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3835552f7358SJed Brown   ierr              = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
3836552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3837552f7358SJed Brown   if (in.numberofpoints > 0) {
3838552f7358SJed Brown     PetscSection coordSection;
3839552f7358SJed Brown     Vec          coordinates;
3840552f7358SJed Brown     PetscScalar *array;
3841552f7358SJed Brown 
3842552f7358SJed Brown     in.pointlist       = new double[in.numberofpoints*dim];
3843552f7358SJed Brown     in.pointmarkerlist = new int[in.numberofpoints];
38440d644c17SKarl Rupp 
3845552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
3846552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
3847552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3848552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3849552f7358SJed Brown       const PetscInt idx = v - vStart;
3850552f7358SJed Brown       PetscInt       off, d;
3851552f7358SJed Brown 
3852552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
38530d644c17SKarl Rupp       for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d];
3854552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3855552f7358SJed Brown     }
3856552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3857552f7358SJed Brown   }
3858552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr);
38590d644c17SKarl Rupp 
3860552f7358SJed Brown   in.numberoffacets = fEnd - fStart;
3861552f7358SJed Brown   if (in.numberoffacets > 0) {
3862552f7358SJed Brown     in.facetlist       = new tetgenio::facet[in.numberoffacets];
3863552f7358SJed Brown     in.facetmarkerlist = new int[in.numberoffacets];
3864552f7358SJed Brown     for (f = fStart; f < fEnd; ++f) {
3865552f7358SJed Brown       const PetscInt idx     = f - fStart;
38660298fd71SBarry Smith       PetscInt      *points = NULL, numPoints, p, numVertices = 0, v;
3867552f7358SJed Brown 
3868552f7358SJed Brown       in.facetlist[idx].numberofpolygons = 1;
3869552f7358SJed Brown       in.facetlist[idx].polygonlist      = new tetgenio::polygon[in.facetlist[idx].numberofpolygons];
3870552f7358SJed Brown       in.facetlist[idx].numberofholes    = 0;
3871552f7358SJed Brown       in.facetlist[idx].holelist         = NULL;
3872552f7358SJed Brown 
3873552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3874552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
3875552f7358SJed Brown         const PetscInt point = points[p];
38760d644c17SKarl Rupp         if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point;
3877552f7358SJed Brown       }
3878552f7358SJed Brown 
3879552f7358SJed Brown       tetgenio::polygon *poly = in.facetlist[idx].polygonlist;
3880552f7358SJed Brown       poly->numberofvertices = numVertices;
3881552f7358SJed Brown       poly->vertexlist       = new int[poly->numberofvertices];
3882552f7358SJed Brown       for (v = 0; v < numVertices; ++v) {
3883552f7358SJed Brown         const PetscInt vIdx = points[v] - vStart;
3884552f7358SJed Brown         poly->vertexlist[v] = vIdx;
3885552f7358SJed Brown       }
3886552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr);
3887552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3888552f7358SJed Brown     }
3889552f7358SJed Brown   }
3890552f7358SJed Brown   if (!rank) {
3891552f7358SJed Brown     char args[32];
3892552f7358SJed Brown 
3893552f7358SJed Brown     /* Take away 'Q' for verbose output */
3894552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr);
3895552f7358SJed Brown     ::tetrahedralize(args, &in, &out);
3896552f7358SJed Brown   }
3897552f7358SJed Brown   {
3898552f7358SJed Brown     const PetscInt numCorners  = 4;
3899552f7358SJed Brown     const PetscInt numCells    = out.numberoftetrahedra;
3900552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3901552f7358SJed Brown     const double   *meshCoords = out.pointlist;
39021d4b4d7bSJed Brown     int            *cells      = out.tetrahedronlist;
3903552f7358SJed Brown 
39049db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
39050fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
3906552f7358SJed Brown     /* Set labels */
3907552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3908552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3909552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3910552f7358SJed Brown       }
3911552f7358SJed Brown     }
3912552f7358SJed Brown     if (interpolate) {
3913552f7358SJed Brown       PetscInt e;
3914552f7358SJed Brown 
3915552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3916552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3917552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3918552f7358SJed Brown           const PetscInt *edges;
3919552f7358SJed Brown           PetscInt        numEdges;
3920552f7358SJed Brown 
3921552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3922552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3923552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3924552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3925552f7358SJed Brown         }
3926552f7358SJed Brown       }
3927552f7358SJed Brown       for (f = 0; f < out.numberoftrifaces; f++) {
3928552f7358SJed Brown         if (out.trifacemarkerlist[f]) {
3929552f7358SJed Brown           const PetscInt  vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells};
3930552f7358SJed Brown           const PetscInt *faces;
3931552f7358SJed Brown           PetscInt        numFaces;
3932552f7358SJed Brown 
3933552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3934552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
3935552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr);
3936552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3937552f7358SJed Brown         }
3938552f7358SJed Brown       }
3939552f7358SJed Brown     }
3940552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
3941552f7358SJed Brown   }
3942552f7358SJed Brown   PetscFunctionReturn(0);
3943552f7358SJed Brown }
3944552f7358SJed Brown 
3945552f7358SJed Brown #undef __FUNCT__
3946552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen"
3947552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined)
3948552f7358SJed Brown {
394982f516ccSBarry Smith   MPI_Comm       comm;
3950552f7358SJed Brown   const PetscInt dim  = 3;
3951552f7358SJed Brown   ::tetgenio     in;
3952552f7358SJed Brown   ::tetgenio     out;
3953552f7358SJed Brown   PetscInt       vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
3954552f7358SJed Brown   PetscMPIInt    rank;
3955552f7358SJed Brown   PetscErrorCode ierr;
3956552f7358SJed Brown 
3957552f7358SJed Brown   PetscFunctionBegin;
395882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
3959552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3960552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3961552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
3962552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
39630d644c17SKarl Rupp 
3964552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3965552f7358SJed Brown   if (in.numberofpoints > 0) {
3966552f7358SJed Brown     PetscSection coordSection;
3967552f7358SJed Brown     Vec          coordinates;
3968552f7358SJed Brown     PetscScalar *array;
3969552f7358SJed Brown 
3970552f7358SJed Brown     in.pointlist       = new double[in.numberofpoints*dim];
3971552f7358SJed Brown     in.pointmarkerlist = new int[in.numberofpoints];
39720d644c17SKarl Rupp 
3973552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
3974552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3975552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3976552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3977552f7358SJed Brown       const PetscInt idx = v - vStart;
3978552f7358SJed Brown       PetscInt       off, d;
3979552f7358SJed Brown 
3980552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
39810d644c17SKarl Rupp       for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d];
3982552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3983552f7358SJed Brown     }
3984552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3985552f7358SJed Brown   }
3986552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
39870d644c17SKarl Rupp 
3988552f7358SJed Brown   in.numberofcorners       = 4;
3989552f7358SJed Brown   in.numberoftetrahedra    = cEnd - cStart;
3990552f7358SJed Brown   in.tetrahedronvolumelist = (double*) maxVolumes;
3991552f7358SJed Brown   if (in.numberoftetrahedra > 0) {
3992552f7358SJed Brown     in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners];
3993552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3994552f7358SJed Brown       const PetscInt idx      = c - cStart;
39950298fd71SBarry Smith       PetscInt      *closure = NULL;
3996552f7358SJed Brown       PetscInt       closureSize;
3997552f7358SJed Brown 
3998552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3999552f7358SJed 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);
4000552f7358SJed Brown       for (v = 0; v < 4; ++v) {
4001552f7358SJed Brown         in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart;
4002552f7358SJed Brown       }
4003552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
4004552f7358SJed Brown     }
4005552f7358SJed Brown   }
400619436ca2SJed Brown   /* TODO: Put in boundary faces with markers */
4007552f7358SJed Brown   if (!rank) {
4008552f7358SJed Brown     char args[32];
4009552f7358SJed Brown 
4010552f7358SJed Brown     /* Take away 'Q' for verbose output */
401119436ca2SJed Brown     /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */
4012552f7358SJed Brown     ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr);
4013552f7358SJed Brown     ::tetrahedralize(args, &in, &out);
4014552f7358SJed Brown   }
4015552f7358SJed Brown   in.tetrahedronvolumelist = NULL;
4016552f7358SJed Brown 
4017552f7358SJed Brown   {
4018552f7358SJed Brown     const PetscInt numCorners  = 4;
4019552f7358SJed Brown     const PetscInt numCells    = out.numberoftetrahedra;
4020552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
4021552f7358SJed Brown     const double   *meshCoords = out.pointlist;
40221d4b4d7bSJed Brown     int            *cells      = out.tetrahedronlist;
40231d4b4d7bSJed Brown 
4024552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
4025552f7358SJed Brown 
40269db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
40270fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
4028552f7358SJed Brown     /* Set labels */
4029552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
4030552f7358SJed Brown       if (out.pointmarkerlist[v]) {
4031552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
4032552f7358SJed Brown       }
4033552f7358SJed Brown     }
4034552f7358SJed Brown     if (interpolate) {
4035552f7358SJed Brown       PetscInt e, f;
4036552f7358SJed Brown 
4037552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
4038552f7358SJed Brown         if (out.edgemarkerlist[e]) {
4039552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
4040552f7358SJed Brown           const PetscInt *edges;
4041552f7358SJed Brown           PetscInt        numEdges;
4042552f7358SJed Brown 
4043552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4044552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
4045552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
4046552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4047552f7358SJed Brown         }
4048552f7358SJed Brown       }
4049552f7358SJed Brown       for (f = 0; f < out.numberoftrifaces; f++) {
4050552f7358SJed Brown         if (out.trifacemarkerlist[f]) {
4051552f7358SJed Brown           const PetscInt  vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells};
4052552f7358SJed Brown           const PetscInt *faces;
4053552f7358SJed Brown           PetscInt        numFaces;
4054552f7358SJed Brown 
4055552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4056552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
4057552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr);
4058552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4059552f7358SJed Brown         }
4060552f7358SJed Brown       }
4061552f7358SJed Brown     }
4062552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
4063552f7358SJed Brown   }
4064552f7358SJed Brown   PetscFunctionReturn(0);
4065552f7358SJed Brown }
4066552f7358SJed Brown #endif
4067552f7358SJed Brown 
4068519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
4069552f7358SJed Brown #include "ctetgen.h"
4070552f7358SJed Brown 
4071552f7358SJed Brown #undef __FUNCT__
4072552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen"
4073552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm)
4074552f7358SJed Brown {
407582f516ccSBarry Smith   MPI_Comm       comm;
4076552f7358SJed Brown   const PetscInt dim  = 3;
4077552f7358SJed Brown   PLC           *in, *out;
4078552f7358SJed Brown   PetscInt       verbose = 0, vStart, vEnd, v, fStart, fEnd, f;
4079552f7358SJed Brown   PetscMPIInt    rank;
4080552f7358SJed Brown   PetscErrorCode ierr;
4081552f7358SJed Brown 
4082552f7358SJed Brown   PetscFunctionBegin;
408382f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
40840298fd71SBarry Smith   ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr);
4085552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
4086552f7358SJed Brown   ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
4087552f7358SJed Brown   ierr = PLCCreate(&in);CHKERRQ(ierr);
4088552f7358SJed Brown   ierr = PLCCreate(&out);CHKERRQ(ierr);
40890d644c17SKarl Rupp 
4090552f7358SJed Brown   in->numberofpoints = vEnd - vStart;
4091552f7358SJed Brown   if (in->numberofpoints > 0) {
4092552f7358SJed Brown     PetscSection coordSection;
4093552f7358SJed Brown     Vec          coordinates;
4094552f7358SJed Brown     PetscScalar *array;
4095552f7358SJed Brown 
4096552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints*dim * sizeof(PetscReal), &in->pointlist);CHKERRQ(ierr);
4097552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints     * sizeof(int),       &in->pointmarkerlist);CHKERRQ(ierr);
4098552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
4099552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
4100552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
4101552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
4102552f7358SJed Brown       const PetscInt idx = v - vStart;
4103552f7358SJed Brown       PetscInt       off, d, m;
4104552f7358SJed Brown 
4105552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
4106552f7358SJed Brown       for (d = 0; d < dim; ++d) {
4107552f7358SJed Brown         in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
4108552f7358SJed Brown       }
4109552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr);
41100d644c17SKarl Rupp 
4111552f7358SJed Brown       in->pointmarkerlist[idx] = (int) m;
4112552f7358SJed Brown     }
4113552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
4114552f7358SJed Brown   }
4115552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr);
41160d644c17SKarl Rupp 
4117552f7358SJed Brown   in->numberoffacets = fEnd - fStart;
4118552f7358SJed Brown   if (in->numberoffacets > 0) {
4119552f7358SJed Brown     ierr = PetscMalloc(in->numberoffacets * sizeof(facet), &in->facetlist);CHKERRQ(ierr);
4120552f7358SJed Brown     ierr = PetscMalloc(in->numberoffacets * sizeof(int),   &in->facetmarkerlist);CHKERRQ(ierr);
4121552f7358SJed Brown     for (f = fStart; f < fEnd; ++f) {
4122552f7358SJed Brown       const PetscInt idx     = f - fStart;
41230298fd71SBarry Smith       PetscInt      *points = NULL, numPoints, p, numVertices = 0, v, m;
4124552f7358SJed Brown       polygon       *poly;
4125552f7358SJed Brown 
4126552f7358SJed Brown       in->facetlist[idx].numberofpolygons = 1;
41270d644c17SKarl Rupp 
4128552f7358SJed Brown       ierr = PetscMalloc(in->facetlist[idx].numberofpolygons * sizeof(polygon), &in->facetlist[idx].polygonlist);CHKERRQ(ierr);
41290d644c17SKarl Rupp 
4130552f7358SJed Brown       in->facetlist[idx].numberofholes    = 0;
41310298fd71SBarry Smith       in->facetlist[idx].holelist         = NULL;
4132552f7358SJed Brown 
4133552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4134552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
4135552f7358SJed Brown         const PetscInt point = points[p];
41360d644c17SKarl Rupp         if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point;
4137552f7358SJed Brown       }
4138552f7358SJed Brown 
4139552f7358SJed Brown       poly                   = in->facetlist[idx].polygonlist;
4140552f7358SJed Brown       poly->numberofvertices = numVertices;
4141552f7358SJed Brown       ierr                   = PetscMalloc(poly->numberofvertices * sizeof(int), &poly->vertexlist);CHKERRQ(ierr);
4142552f7358SJed Brown       for (v = 0; v < numVertices; ++v) {
4143552f7358SJed Brown         const PetscInt vIdx = points[v] - vStart;
4144552f7358SJed Brown         poly->vertexlist[v] = vIdx;
4145552f7358SJed Brown       }
4146552f7358SJed Brown       ierr                     = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr);
4147552f7358SJed Brown       in->facetmarkerlist[idx] = (int) m;
4148552f7358SJed Brown       ierr                     = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4149552f7358SJed Brown     }
4150552f7358SJed Brown   }
4151552f7358SJed Brown   if (!rank) {
4152552f7358SJed Brown     TetGenOpts t;
4153552f7358SJed Brown 
4154552f7358SJed Brown     ierr        = TetGenOptsInitialize(&t);CHKERRQ(ierr);
4155552f7358SJed Brown     t.in        = boundary; /* Should go away */
4156552f7358SJed Brown     t.plc       = 1;
4157552f7358SJed Brown     t.quality   = 1;
4158552f7358SJed Brown     t.edgesout  = 1;
4159552f7358SJed Brown     t.zeroindex = 1;
4160552f7358SJed Brown     t.quiet     = 1;
4161552f7358SJed Brown     t.verbose   = verbose;
4162552f7358SJed Brown     ierr        = TetGenCheckOpts(&t);CHKERRQ(ierr);
4163552f7358SJed Brown     ierr        = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr);
4164552f7358SJed Brown   }
4165552f7358SJed Brown   {
4166552f7358SJed Brown     const PetscInt numCorners  = 4;
4167552f7358SJed Brown     const PetscInt numCells    = out->numberoftetrahedra;
4168552f7358SJed Brown     const PetscInt numVertices = out->numberofpoints;
4169552f7358SJed Brown     const double   *meshCoords = out->pointlist;
41701d4b4d7bSJed Brown     int            *cells      = out->tetrahedronlist;
4171552f7358SJed Brown 
41729db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
41730fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
4174552f7358SJed Brown     /* Set labels */
4175552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
4176552f7358SJed Brown       if (out->pointmarkerlist[v]) {
4177552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr);
4178552f7358SJed Brown       }
4179552f7358SJed Brown     }
4180552f7358SJed Brown     if (interpolate) {
4181552f7358SJed Brown       PetscInt e;
4182552f7358SJed Brown 
4183552f7358SJed Brown       for (e = 0; e < out->numberofedges; e++) {
4184552f7358SJed Brown         if (out->edgemarkerlist[e]) {
4185552f7358SJed Brown           const PetscInt  vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells};
4186552f7358SJed Brown           const PetscInt *edges;
4187552f7358SJed Brown           PetscInt        numEdges;
4188552f7358SJed Brown 
4189552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4190552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
4191552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr);
4192552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4193552f7358SJed Brown         }
4194552f7358SJed Brown       }
4195552f7358SJed Brown       for (f = 0; f < out->numberoftrifaces; f++) {
4196552f7358SJed Brown         if (out->trifacemarkerlist[f]) {
4197552f7358SJed Brown           const PetscInt  vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells};
4198552f7358SJed Brown           const PetscInt *faces;
4199552f7358SJed Brown           PetscInt        numFaces;
4200552f7358SJed Brown 
4201552f7358SJed Brown           ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4202552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
4203552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr);
4204552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4205552f7358SJed Brown         }
4206552f7358SJed Brown       }
4207552f7358SJed Brown     }
4208552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
4209552f7358SJed Brown   }
4210552f7358SJed Brown 
4211552f7358SJed Brown   ierr = PLCDestroy(&in);CHKERRQ(ierr);
4212552f7358SJed Brown   ierr = PLCDestroy(&out);CHKERRQ(ierr);
4213552f7358SJed Brown   PetscFunctionReturn(0);
4214552f7358SJed Brown }
4215552f7358SJed Brown 
4216552f7358SJed Brown #undef __FUNCT__
4217552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen"
4218552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined)
4219552f7358SJed Brown {
422082f516ccSBarry Smith   MPI_Comm       comm;
4221552f7358SJed Brown   const PetscInt dim  = 3;
4222552f7358SJed Brown   PLC           *in, *out;
4223552f7358SJed Brown   PetscInt       verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
4224552f7358SJed Brown   PetscMPIInt    rank;
4225552f7358SJed Brown   PetscErrorCode ierr;
4226552f7358SJed Brown 
4227552f7358SJed Brown   PetscFunctionBegin;
422882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
42290298fd71SBarry Smith   ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr);
4230552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
4231552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
4232552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
4233552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
4234552f7358SJed Brown   ierr = PLCCreate(&in);CHKERRQ(ierr);
4235552f7358SJed Brown   ierr = PLCCreate(&out);CHKERRQ(ierr);
42360d644c17SKarl Rupp 
4237552f7358SJed Brown   in->numberofpoints = vEnd - vStart;
4238552f7358SJed Brown   if (in->numberofpoints > 0) {
4239552f7358SJed Brown     PetscSection coordSection;
4240552f7358SJed Brown     Vec          coordinates;
4241552f7358SJed Brown     PetscScalar *array;
4242552f7358SJed Brown 
4243552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints*dim * sizeof(PetscReal), &in->pointlist);CHKERRQ(ierr);
4244552f7358SJed Brown     ierr = PetscMalloc(in->numberofpoints     * sizeof(int),       &in->pointmarkerlist);CHKERRQ(ierr);
4245552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
4246552f7358SJed Brown     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
4247552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
4248552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
4249552f7358SJed Brown       const PetscInt idx = v - vStart;
4250552f7358SJed Brown       PetscInt       off, d, m;
4251552f7358SJed Brown 
4252552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
4253552f7358SJed Brown       for (d = 0; d < dim; ++d) {
4254552f7358SJed Brown         in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
4255552f7358SJed Brown       }
4256552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr);
42570d644c17SKarl Rupp 
4258552f7358SJed Brown       in->pointmarkerlist[idx] = (int) m;
4259552f7358SJed Brown     }
4260552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
4261552f7358SJed Brown   }
4262552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
42630d644c17SKarl Rupp 
4264552f7358SJed Brown   in->numberofcorners       = 4;
4265552f7358SJed Brown   in->numberoftetrahedra    = cEnd - cStart;
4266552f7358SJed Brown   in->tetrahedronvolumelist = maxVolumes;
4267552f7358SJed Brown   if (in->numberoftetrahedra > 0) {
4268552f7358SJed Brown     ierr = PetscMalloc(in->numberoftetrahedra*in->numberofcorners * sizeof(int), &in->tetrahedronlist);CHKERRQ(ierr);
4269552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
4270552f7358SJed Brown       const PetscInt idx      = c - cStart;
42710298fd71SBarry Smith       PetscInt      *closure = NULL;
4272552f7358SJed Brown       PetscInt       closureSize;
4273552f7358SJed Brown 
4274552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
4275552f7358SJed 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);
4276552f7358SJed Brown       for (v = 0; v < 4; ++v) {
4277552f7358SJed Brown         in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart;
4278552f7358SJed Brown       }
4279552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
4280552f7358SJed Brown     }
4281552f7358SJed Brown   }
4282552f7358SJed Brown   if (!rank) {
4283552f7358SJed Brown     TetGenOpts t;
4284552f7358SJed Brown 
4285552f7358SJed Brown     ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr);
42860d644c17SKarl Rupp 
4287552f7358SJed Brown     t.in        = dm; /* Should go away */
4288552f7358SJed Brown     t.refine    = 1;
4289552f7358SJed Brown     t.varvolume = 1;
4290552f7358SJed Brown     t.quality   = 1;
4291552f7358SJed Brown     t.edgesout  = 1;
4292552f7358SJed Brown     t.zeroindex = 1;
4293552f7358SJed Brown     t.quiet     = 1;
4294552f7358SJed Brown     t.verbose   = verbose; /* Change this */
42950d644c17SKarl Rupp 
4296552f7358SJed Brown     ierr = TetGenCheckOpts(&t);CHKERRQ(ierr);
4297552f7358SJed Brown     ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr);
4298552f7358SJed Brown   }
4299552f7358SJed Brown   {
4300552f7358SJed Brown     const PetscInt numCorners  = 4;
4301552f7358SJed Brown     const PetscInt numCells    = out->numberoftetrahedra;
4302552f7358SJed Brown     const PetscInt numVertices = out->numberofpoints;
4303552f7358SJed Brown     const double   *meshCoords = out->pointlist;
43041d4b4d7bSJed Brown     int            *cells      = out->tetrahedronlist;
4305552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
4306552f7358SJed Brown 
43079db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
43080fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
4309552f7358SJed Brown     /* Set labels */
4310552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
4311552f7358SJed Brown       if (out->pointmarkerlist[v]) {
4312552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr);
4313552f7358SJed Brown       }
4314552f7358SJed Brown     }
4315552f7358SJed Brown     if (interpolate) {
4316552f7358SJed Brown       PetscInt e, f;
4317552f7358SJed Brown 
4318552f7358SJed Brown       for (e = 0; e < out->numberofedges; e++) {
4319552f7358SJed Brown         if (out->edgemarkerlist[e]) {
4320552f7358SJed Brown           const PetscInt  vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells};
4321552f7358SJed Brown           const PetscInt *edges;
4322552f7358SJed Brown           PetscInt        numEdges;
4323552f7358SJed Brown 
4324552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4325552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
4326552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr);
4327552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
4328552f7358SJed Brown         }
4329552f7358SJed Brown       }
4330552f7358SJed Brown       for (f = 0; f < out->numberoftrifaces; f++) {
4331552f7358SJed Brown         if (out->trifacemarkerlist[f]) {
4332552f7358SJed Brown           const PetscInt  vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells};
4333552f7358SJed Brown           const PetscInt *faces;
4334552f7358SJed Brown           PetscInt        numFaces;
4335552f7358SJed Brown 
4336552f7358SJed Brown           ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4337552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
4338552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr);
4339552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
4340552f7358SJed Brown         }
4341552f7358SJed Brown       }
4342552f7358SJed Brown     }
4343552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
4344552f7358SJed Brown   }
4345552f7358SJed Brown   ierr = PLCDestroy(&in);CHKERRQ(ierr);
4346552f7358SJed Brown   ierr = PLCDestroy(&out);CHKERRQ(ierr);
4347552f7358SJed Brown   PetscFunctionReturn(0);
4348552f7358SJed Brown }
4349552f7358SJed Brown #endif
4350552f7358SJed Brown 
4351552f7358SJed Brown #undef __FUNCT__
4352552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate"
4353552f7358SJed Brown /*@C
4354552f7358SJed Brown   DMPlexGenerate - Generates a mesh.
4355552f7358SJed Brown 
4356552f7358SJed Brown   Not Collective
4357552f7358SJed Brown 
4358552f7358SJed Brown   Input Parameters:
4359552f7358SJed Brown + boundary - The DMPlex boundary object
4360552f7358SJed Brown . name - The mesh generation package name
4361552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements
4362552f7358SJed Brown 
4363552f7358SJed Brown   Output Parameter:
4364552f7358SJed Brown . mesh - The DMPlex object
4365552f7358SJed Brown 
4366552f7358SJed Brown   Level: intermediate
4367552f7358SJed Brown 
4368552f7358SJed Brown .keywords: mesh, elements
4369552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine()
4370552f7358SJed Brown @*/
4371552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh)
4372552f7358SJed Brown {
4373552f7358SJed Brown   PetscInt       dim;
4374552f7358SJed Brown   char           genname[1024];
4375552f7358SJed Brown   PetscBool      isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg;
4376552f7358SJed Brown   PetscErrorCode ierr;
4377552f7358SJed Brown 
4378552f7358SJed Brown   PetscFunctionBegin;
4379552f7358SJed Brown   PetscValidHeaderSpecific(boundary, DM_CLASSID, 1);
4380552f7358SJed Brown   PetscValidLogicalCollectiveBool(boundary, interpolate, 2);
4381552f7358SJed Brown   ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr);
4382552f7358SJed Brown   ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr);
43830d644c17SKarl Rupp   if (flg) name = genname;
4384552f7358SJed Brown   if (name) {
4385552f7358SJed Brown     ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr);
4386552f7358SJed Brown     ierr = PetscStrcmp(name, "tetgen",   &isTetgen);CHKERRQ(ierr);
4387552f7358SJed Brown     ierr = PetscStrcmp(name, "ctetgen",  &isCTetgen);CHKERRQ(ierr);
4388552f7358SJed Brown   }
4389552f7358SJed Brown   switch (dim) {
4390552f7358SJed Brown   case 1:
4391552f7358SJed Brown     if (!name || isTriangle) {
4392519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
4393552f7358SJed Brown       ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr);
4394552f7358SJed Brown #else
439582f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle.");
4396552f7358SJed Brown #endif
439782f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name);
4398552f7358SJed Brown     break;
4399552f7358SJed Brown   case 2:
4400552f7358SJed Brown     if (!name || isCTetgen) {
4401519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
4402552f7358SJed Brown       ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr);
4403552f7358SJed Brown #else
440482f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen.");
4405552f7358SJed Brown #endif
4406552f7358SJed Brown     } else if (isTetgen) {
4407519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
4408552f7358SJed Brown       ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr);
4409552f7358SJed Brown #else
441082f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen.");
4411552f7358SJed Brown #endif
441282f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name);
4413552f7358SJed Brown     break;
4414552f7358SJed Brown   default:
441582f516ccSBarry Smith     SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim);
4416552f7358SJed Brown   }
4417552f7358SJed Brown   PetscFunctionReturn(0);
4418552f7358SJed Brown }
4419552f7358SJed Brown 
4420552f7358SJed Brown #undef __FUNCT__
4421552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex"
4422552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined)
4423552f7358SJed Brown {
4424552f7358SJed Brown   PetscReal      refinementLimit;
4425552f7358SJed Brown   PetscInt       dim, cStart, cEnd;
44260298fd71SBarry Smith   char           genname[1024], *name = NULL;
4427552f7358SJed Brown   PetscBool      isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg;
4428552f7358SJed Brown   PetscErrorCode ierr;
4429552f7358SJed Brown 
4430552f7358SJed Brown   PetscFunctionBegin;
4431552f7358SJed Brown   ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr);
4432552f7358SJed Brown   if (isUniform) {
4433552f7358SJed Brown     CellRefiner cellRefiner;
4434552f7358SJed Brown 
4435509c9b89SMatthew G. Knepley     ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr);
4436509c9b89SMatthew G. Knepley     ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr);
4437552f7358SJed Brown     PetscFunctionReturn(0);
4438552f7358SJed Brown   }
4439552f7358SJed Brown   ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr);
4440552f7358SJed Brown   if (refinementLimit == 0.0) PetscFunctionReturn(0);
4441552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
4442552f7358SJed Brown   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
4443552f7358SJed Brown   ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr);
44440d644c17SKarl Rupp   if (flg) name = genname;
4445552f7358SJed Brown   if (name) {
4446552f7358SJed Brown     ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr);
4447552f7358SJed Brown     ierr = PetscStrcmp(name, "tetgen",   &isTetgen);CHKERRQ(ierr);
4448552f7358SJed Brown     ierr = PetscStrcmp(name, "ctetgen",  &isCTetgen);CHKERRQ(ierr);
4449552f7358SJed Brown   }
4450552f7358SJed Brown   switch (dim) {
4451552f7358SJed Brown   case 2:
4452552f7358SJed Brown     if (!name || isTriangle) {
4453519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
4454552f7358SJed Brown       double  *maxVolumes;
4455552f7358SJed Brown       PetscInt c;
4456552f7358SJed Brown 
4457552f7358SJed Brown       ierr = PetscMalloc((cEnd - cStart) * sizeof(double), &maxVolumes);CHKERRQ(ierr);
44580d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
4459552f7358SJed Brown       ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
44606b0a3334SMatthew G. Knepley       ierr = PetscFree(maxVolumes);CHKERRQ(ierr);
4461552f7358SJed Brown #else
446282f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle.");
4463552f7358SJed Brown #endif
446482f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name);
4465552f7358SJed Brown     break;
4466552f7358SJed Brown   case 3:
4467552f7358SJed Brown     if (!name || isCTetgen) {
4468519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
4469552f7358SJed Brown       PetscReal *maxVolumes;
4470552f7358SJed Brown       PetscInt   c;
4471552f7358SJed Brown 
4472552f7358SJed Brown       ierr = PetscMalloc((cEnd - cStart) * sizeof(PetscReal), &maxVolumes);CHKERRQ(ierr);
44730d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
4474552f7358SJed Brown       ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
4475552f7358SJed Brown #else
447682f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen.");
4477552f7358SJed Brown #endif
4478552f7358SJed Brown     } else if (isTetgen) {
4479519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
4480552f7358SJed Brown       double  *maxVolumes;
4481552f7358SJed Brown       PetscInt c;
4482552f7358SJed Brown 
4483552f7358SJed Brown       ierr = PetscMalloc((cEnd - cStart) * sizeof(double), &maxVolumes);CHKERRQ(ierr);
44840d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
4485552f7358SJed Brown       ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
4486552f7358SJed Brown #else
448782f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen.");
4488552f7358SJed Brown #endif
448982f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name);
4490552f7358SJed Brown     break;
4491552f7358SJed Brown   default:
449282f516ccSBarry Smith     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim);
4493552f7358SJed Brown   }
4494552f7358SJed Brown   PetscFunctionReturn(0);
4495552f7358SJed Brown }
4496552f7358SJed Brown 
4497552f7358SJed Brown #undef __FUNCT__
4498aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel"
4499552f7358SJed Brown /*@
4500aa50250dSMatthew G. Knepley   DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point
4501552f7358SJed Brown 
4502552f7358SJed Brown   Not Collective
4503552f7358SJed Brown 
4504aa50250dSMatthew G. Knepley   Input Parameter:
4505552f7358SJed Brown . dm    - The DMPlex object
4506552f7358SJed Brown 
4507aa50250dSMatthew G. Knepley   Output Parameter:
4508aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth
4509552f7358SJed Brown 
4510552f7358SJed Brown   Level: developer
4511552f7358SJed Brown 
4512aa50250dSMatthew G. Knepley .keywords: mesh, points
4513aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
4514aa50250dSMatthew G. Knepley @*/
4515aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel)
4516aa50250dSMatthew G. Knepley {
4517aa50250dSMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
4518aa50250dSMatthew G. Knepley   PetscErrorCode ierr;
4519aa50250dSMatthew G. Knepley 
4520aa50250dSMatthew G. Knepley   PetscFunctionBegin;
4521aa50250dSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4522aa50250dSMatthew G. Knepley   PetscValidPointer(depthLabel, 2);
4523aa50250dSMatthew G. Knepley   if (!mesh->depthLabel) {
4524aa50250dSMatthew G. Knepley     ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);
4525aa50250dSMatthew G. Knepley   }
4526aa50250dSMatthew G. Knepley   *depthLabel = mesh->depthLabel;
4527aa50250dSMatthew G. Knepley   PetscFunctionReturn(0);
4528aa50250dSMatthew G. Knepley }
4529aa50250dSMatthew G. Knepley 
4530aa50250dSMatthew G. Knepley #undef __FUNCT__
4531aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth"
4532aa50250dSMatthew G. Knepley /*@
4533aa50250dSMatthew G. Knepley   DMPlexGetDepth - Get the depth of the DAG representing this mesh
4534aa50250dSMatthew G. Knepley 
4535aa50250dSMatthew G. Knepley   Not Collective
4536aa50250dSMatthew G. Knepley 
4537aa50250dSMatthew G. Knepley   Input Parameter:
4538aa50250dSMatthew G. Knepley . dm    - The DMPlex object
4539aa50250dSMatthew G. Knepley 
4540aa50250dSMatthew G. Knepley   Output Parameter:
4541aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG
4542aa50250dSMatthew G. Knepley 
4543aa50250dSMatthew G. Knepley   Level: developer
4544552f7358SJed Brown 
4545552f7358SJed Brown .keywords: mesh, points
4546aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
4547552f7358SJed Brown @*/
4548552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth)
4549552f7358SJed Brown {
4550aa50250dSMatthew G. Knepley   DMLabel        label;
4551aa50250dSMatthew G. Knepley   PetscInt       d = 0;
4552552f7358SJed Brown   PetscErrorCode ierr;
4553552f7358SJed Brown 
4554552f7358SJed Brown   PetscFunctionBegin;
4555552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4556552f7358SJed Brown   PetscValidPointer(depth, 2);
4557aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
4558aa50250dSMatthew G. Knepley   if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);}
4559552f7358SJed Brown   *depth = d-1;
4560552f7358SJed Brown   PetscFunctionReturn(0);
4561552f7358SJed Brown }
4562552f7358SJed Brown 
4563552f7358SJed Brown #undef __FUNCT__
4564552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum"
4565552f7358SJed Brown /*@
4566552f7358SJed Brown   DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth.
4567552f7358SJed Brown 
4568552f7358SJed Brown   Not Collective
4569552f7358SJed Brown 
4570552f7358SJed Brown   Input Parameters:
4571552f7358SJed Brown + dm           - The DMPlex object
4572552f7358SJed Brown - stratumValue - The requested depth
4573552f7358SJed Brown 
4574552f7358SJed Brown   Output Parameters:
4575552f7358SJed Brown + start - The first point at this depth
4576552f7358SJed Brown - end   - One beyond the last point at this depth
4577552f7358SJed Brown 
4578552f7358SJed Brown   Level: developer
4579552f7358SJed Brown 
4580552f7358SJed Brown .keywords: mesh, points
4581552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth()
4582552f7358SJed Brown @*/
45830adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
45840adebc6cSBarry Smith {
4585aa50250dSMatthew G. Knepley   DMLabel        label;
4586552f7358SJed Brown   PetscInt       depth;
4587552f7358SJed Brown   PetscErrorCode ierr;
4588552f7358SJed Brown 
4589552f7358SJed Brown   PetscFunctionBegin;
4590552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4591552f7358SJed Brown   if (stratumValue < 0) {
4592552f7358SJed Brown     ierr = DMPlexGetChart(dm, start, end);CHKERRQ(ierr);
4593552f7358SJed Brown     PetscFunctionReturn(0);
4594552f7358SJed Brown   } else {
4595552f7358SJed Brown     PetscInt pStart, pEnd;
4596552f7358SJed Brown 
45970d644c17SKarl Rupp     if (start) *start = 0;
45980d644c17SKarl Rupp     if (end)   *end   = 0;
4599552f7358SJed Brown     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
46000d644c17SKarl Rupp     if (pStart == pEnd) PetscFunctionReturn(0);
4601552f7358SJed Brown   }
4602aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
4603aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
4604552f7358SJed Brown   /* Strata are sorted and contiguous -- In addition, depth/height is either full or 1-level */
4605552f7358SJed Brown   depth = stratumValue;
4606aa50250dSMatthew G. Knepley   if ((depth < 0) || (depth >= label->numStrata)) {
46070d644c17SKarl Rupp     if (start) *start = 0;
46080d644c17SKarl Rupp     if (end)   *end   = 0;
4609552f7358SJed Brown   } else {
4610aa50250dSMatthew G. Knepley     if (start) *start = label->points[label->stratumOffsets[depth]];
4611aa50250dSMatthew G. Knepley     if (end)   *end   = label->points[label->stratumOffsets[depth]+label->stratumSizes[depth]-1]+1;
4612552f7358SJed Brown   }
4613552f7358SJed Brown   PetscFunctionReturn(0);
4614552f7358SJed Brown }
4615552f7358SJed Brown 
4616552f7358SJed Brown #undef __FUNCT__
4617552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum"
4618552f7358SJed Brown /*@
4619552f7358SJed Brown   DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height.
4620552f7358SJed Brown 
4621552f7358SJed Brown   Not Collective
4622552f7358SJed Brown 
4623552f7358SJed Brown   Input Parameters:
4624552f7358SJed Brown + dm           - The DMPlex object
4625552f7358SJed Brown - stratumValue - The requested height
4626552f7358SJed Brown 
4627552f7358SJed Brown   Output Parameters:
4628552f7358SJed Brown + start - The first point at this height
4629552f7358SJed Brown - end   - One beyond the last point at this height
4630552f7358SJed Brown 
4631552f7358SJed Brown   Level: developer
4632552f7358SJed Brown 
4633552f7358SJed Brown .keywords: mesh, points
4634552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth()
4635552f7358SJed Brown @*/
46360adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
46370adebc6cSBarry Smith {
4638aa50250dSMatthew G. Knepley   DMLabel        label;
4639552f7358SJed Brown   PetscInt       depth;
4640552f7358SJed Brown   PetscErrorCode ierr;
4641552f7358SJed Brown 
4642552f7358SJed Brown   PetscFunctionBegin;
4643552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4644552f7358SJed Brown   if (stratumValue < 0) {
4645552f7358SJed Brown     ierr = DMPlexGetChart(dm, start, end);CHKERRQ(ierr);
4646552f7358SJed Brown   } else {
4647552f7358SJed Brown     PetscInt pStart, pEnd;
4648552f7358SJed Brown 
46490d644c17SKarl Rupp     if (start) *start = 0;
46500d644c17SKarl Rupp     if (end)   *end   = 0;
4651552f7358SJed Brown     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
46520d644c17SKarl Rupp     if (pStart == pEnd) PetscFunctionReturn(0);
4653552f7358SJed Brown   }
4654aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
4655aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
4656552f7358SJed Brown   /* Strata are sorted and contiguous -- In addition, depth/height is either full or 1-level */
4657aa50250dSMatthew G. Knepley   depth = label->stratumValues[label->numStrata-1] - stratumValue;
4658aa50250dSMatthew G. Knepley   if ((depth < 0) || (depth >= label->numStrata)) {
46590d644c17SKarl Rupp     if (start) *start = 0;
46600d644c17SKarl Rupp     if (end)   *end   = 0;
4661552f7358SJed Brown   } else {
4662aa50250dSMatthew G. Knepley     if (start) *start = label->points[label->stratumOffsets[depth]];
4663aa50250dSMatthew G. Knepley     if (end)   *end   = label->points[label->stratumOffsets[depth]+label->stratumSizes[depth]-1]+1;
4664552f7358SJed Brown   }
4665552f7358SJed Brown   PetscFunctionReturn(0);
4666552f7358SJed Brown }
4667552f7358SJed Brown 
4668552f7358SJed Brown #undef __FUNCT__
4669552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial"
4670552f7358SJed Brown /* Set the number of dof on each point and separate by fields */
4671a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section)
4672a6dfd86eSKarl Rupp {
4673552f7358SJed Brown   PetscInt      *numDofTot;
4674552f7358SJed Brown   PetscInt       pStart = 0, pEnd = 0;
4675552f7358SJed Brown   PetscInt       p, d, f;
4676552f7358SJed Brown   PetscErrorCode ierr;
4677552f7358SJed Brown 
4678552f7358SJed Brown   PetscFunctionBegin;
4679552f7358SJed Brown   ierr = PetscMalloc((dim+1) * sizeof(PetscInt), &numDofTot);CHKERRQ(ierr);
4680552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
4681552f7358SJed Brown     numDofTot[d] = 0;
46820d644c17SKarl Rupp     for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d];
4683552f7358SJed Brown   }
468482f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
4685552f7358SJed Brown   if (numFields > 0) {
4686552f7358SJed Brown     ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr);
4687552f7358SJed Brown     if (numComp) {
4688552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4689552f7358SJed Brown         ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr);
4690552f7358SJed Brown       }
4691552f7358SJed Brown     }
4692552f7358SJed Brown   }
4693552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
4694552f7358SJed Brown   ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr);
4695552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
4696552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
4697552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
4698552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4699552f7358SJed Brown         ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr);
4700552f7358SJed Brown       }
4701552f7358SJed Brown       ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr);
4702552f7358SJed Brown     }
4703552f7358SJed Brown   }
4704552f7358SJed Brown   ierr = PetscFree(numDofTot);CHKERRQ(ierr);
4705552f7358SJed Brown   PetscFunctionReturn(0);
4706552f7358SJed Brown }
4707552f7358SJed Brown 
4708552f7358SJed Brown #undef __FUNCT__
4709552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof"
4710552f7358SJed Brown /* Set the number of dof on each point and separate by fields
4711552f7358SJed Brown    If constDof is PETSC_DETERMINE, constrain every dof on the point
4712552f7358SJed Brown */
4713a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section)
4714a6dfd86eSKarl Rupp {
4715552f7358SJed Brown   PetscInt       numFields;
4716552f7358SJed Brown   PetscInt       bc;
4717552f7358SJed Brown   PetscErrorCode ierr;
4718552f7358SJed Brown 
4719552f7358SJed Brown   PetscFunctionBegin;
4720552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4721552f7358SJed Brown   for (bc = 0; bc < numBC; ++bc) {
4722552f7358SJed Brown     PetscInt        field = 0;
4723552f7358SJed Brown     const PetscInt *idx;
4724552f7358SJed Brown     PetscInt        n, i;
4725552f7358SJed Brown 
47260d644c17SKarl Rupp     if (numFields) field = bcField[bc];
4727552f7358SJed Brown     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
4728552f7358SJed Brown     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
4729552f7358SJed Brown     for (i = 0; i < n; ++i) {
4730552f7358SJed Brown       const PetscInt p        = idx[i];
4731552f7358SJed Brown       PetscInt       numConst = constDof;
4732552f7358SJed Brown 
4733552f7358SJed Brown       /* Constrain every dof on the point */
4734552f7358SJed Brown       if (numConst < 0) {
4735552f7358SJed Brown         if (numFields) {
4736552f7358SJed Brown           ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr);
4737552f7358SJed Brown         } else {
4738552f7358SJed Brown           ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr);
4739552f7358SJed Brown         }
4740552f7358SJed Brown       }
4741552f7358SJed Brown       if (numFields) {
4742552f7358SJed Brown         ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);
4743552f7358SJed Brown       }
4744552f7358SJed Brown       ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr);
4745552f7358SJed Brown     }
4746552f7358SJed Brown     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
4747552f7358SJed Brown   }
4748552f7358SJed Brown   PetscFunctionReturn(0);
4749552f7358SJed Brown }
4750552f7358SJed Brown 
4751552f7358SJed Brown #undef __FUNCT__
4752552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll"
4753552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
47540adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section)
47550adebc6cSBarry Smith {
4756552f7358SJed Brown   PetscInt      *maxConstraints;
4757552f7358SJed Brown   PetscInt       numFields, f, pStart = 0, pEnd = 0, p;
4758552f7358SJed Brown   PetscErrorCode ierr;
4759552f7358SJed Brown 
4760552f7358SJed Brown   PetscFunctionBegin;
4761552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4762552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4763552f7358SJed Brown   ierr = PetscMalloc((numFields+1) * sizeof(PetscInt), &maxConstraints);CHKERRQ(ierr);
47640d644c17SKarl Rupp   for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0;
4765552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
4766552f7358SJed Brown     PetscInt cdof;
4767552f7358SJed Brown 
4768552f7358SJed Brown     if (numFields) {
4769552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4770552f7358SJed Brown         ierr              = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr);
4771552f7358SJed Brown         maxConstraints[f] = PetscMax(maxConstraints[f], cdof);
4772552f7358SJed Brown       }
4773552f7358SJed Brown     } else {
4774552f7358SJed Brown       ierr              = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
4775552f7358SJed Brown       maxConstraints[0] = PetscMax(maxConstraints[0], cdof);
4776552f7358SJed Brown     }
4777552f7358SJed Brown   }
4778552f7358SJed Brown   for (f = 0; f < numFields; ++f) {
4779552f7358SJed Brown     maxConstraints[numFields] += maxConstraints[f];
4780552f7358SJed Brown   }
4781552f7358SJed Brown   if (maxConstraints[numFields]) {
4782552f7358SJed Brown     PetscInt *indices;
4783552f7358SJed Brown 
4784552f7358SJed Brown     ierr = PetscMalloc(maxConstraints[numFields] * sizeof(PetscInt), &indices);CHKERRQ(ierr);
4785552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
4786552f7358SJed Brown       PetscInt cdof, d;
4787552f7358SJed Brown 
4788552f7358SJed Brown       ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
4789552f7358SJed Brown       if (cdof) {
4790552f7358SJed 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]);
4791552f7358SJed Brown         if (numFields) {
4792552f7358SJed Brown           PetscInt numConst = 0, foff = 0;
4793552f7358SJed Brown 
4794552f7358SJed Brown           for (f = 0; f < numFields; ++f) {
4795552f7358SJed Brown             PetscInt cfdof, fdof;
4796552f7358SJed Brown 
4797552f7358SJed Brown             ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
4798552f7358SJed Brown             ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr);
4799552f7358SJed Brown             /* Change constraint numbering from absolute local dof number to field relative local dof number */
48000d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] = d;
4801552f7358SJed Brown             ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr);
48020d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff;
4803552f7358SJed Brown             numConst += cfdof;
4804552f7358SJed Brown             foff     += fdof;
4805552f7358SJed Brown           }
4806552f7358SJed Brown           if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
4807552f7358SJed Brown         } else {
48080d644c17SKarl Rupp           for (d = 0; d < cdof; ++d) indices[d] = d;
4809552f7358SJed Brown         }
4810552f7358SJed Brown         ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
4811552f7358SJed Brown       }
4812552f7358SJed Brown     }
4813552f7358SJed Brown     ierr = PetscFree(indices);CHKERRQ(ierr);
4814552f7358SJed Brown   }
4815552f7358SJed Brown   ierr = PetscFree(maxConstraints);CHKERRQ(ierr);
4816552f7358SJed Brown   PetscFunctionReturn(0);
4817552f7358SJed Brown }
4818552f7358SJed Brown 
4819552f7358SJed Brown #undef __FUNCT__
4820552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField"
4821552f7358SJed Brown /* Set the constrained field indices on each point */
48220adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section)
48230adebc6cSBarry Smith {
4824552f7358SJed Brown   const PetscInt *points, *indices;
4825552f7358SJed Brown   PetscInt        numFields, maxDof, numPoints, p, numConstraints;
4826552f7358SJed Brown   PetscErrorCode  ierr;
4827552f7358SJed Brown 
4828552f7358SJed Brown   PetscFunctionBegin;
4829552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4830552f7358SJed 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);
4831552f7358SJed Brown 
4832552f7358SJed Brown   ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr);
4833552f7358SJed Brown   ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr);
4834552f7358SJed Brown   if (!constraintIndices) {
4835552f7358SJed Brown     PetscInt *idx, i;
4836552f7358SJed Brown 
4837552f7358SJed Brown     ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
4838552f7358SJed Brown     ierr = PetscMalloc(maxDof * sizeof(PetscInt), &idx);CHKERRQ(ierr);
48390d644c17SKarl Rupp     for (i = 0; i < maxDof; ++i) idx[i] = i;
4840552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
4841552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr);
4842552f7358SJed Brown     }
4843552f7358SJed Brown     ierr = PetscFree(idx);CHKERRQ(ierr);
4844552f7358SJed Brown   } else {
4845552f7358SJed Brown     ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr);
4846552f7358SJed Brown     ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr);
4847552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
4848552f7358SJed Brown       PetscInt fcdof;
4849552f7358SJed Brown 
4850552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr);
485182f516ccSBarry 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);
4852552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr);
4853552f7358SJed Brown     }
4854552f7358SJed Brown     ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr);
4855552f7358SJed Brown   }
4856552f7358SJed Brown   ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr);
4857552f7358SJed Brown   PetscFunctionReturn(0);
4858552f7358SJed Brown }
4859552f7358SJed Brown 
4860552f7358SJed Brown #undef __FUNCT__
4861552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices"
4862552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
48630adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section)
48640adebc6cSBarry Smith {
4865552f7358SJed Brown   PetscInt      *indices;
4866552f7358SJed Brown   PetscInt       numFields, maxDof, f, pStart = 0, pEnd = 0, p;
4867552f7358SJed Brown   PetscErrorCode ierr;
4868552f7358SJed Brown 
4869552f7358SJed Brown   PetscFunctionBegin;
4870552f7358SJed Brown   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
4871552f7358SJed Brown   ierr = PetscMalloc(maxDof * sizeof(PetscInt), &indices);CHKERRQ(ierr);
4872552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
487382f516ccSBarry Smith   if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices.");
4874552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4875552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
4876552f7358SJed Brown     PetscInt cdof, d;
4877552f7358SJed Brown 
4878552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
4879552f7358SJed Brown     if (cdof) {
4880552f7358SJed Brown       PetscInt numConst = 0, foff = 0;
4881552f7358SJed Brown 
4882552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
4883552f7358SJed Brown         const PetscInt *fcind;
4884552f7358SJed Brown         PetscInt        fdof, fcdof;
4885552f7358SJed Brown 
4886552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
4887552f7358SJed Brown         ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr);
4888552f7358SJed Brown         if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);}
4889552f7358SJed Brown         /* Change constraint numbering from field relative local dof number to absolute local dof number */
48900d644c17SKarl Rupp         for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff;
4891552f7358SJed Brown         foff     += fdof;
4892552f7358SJed Brown         numConst += fcdof;
4893552f7358SJed Brown       }
489482f516ccSBarry Smith       if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
4895552f7358SJed Brown       ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
4896552f7358SJed Brown     }
4897552f7358SJed Brown   }
4898552f7358SJed Brown   ierr = PetscFree(indices);CHKERRQ(ierr);
4899552f7358SJed Brown   PetscFunctionReturn(0);
4900552f7358SJed Brown }
4901552f7358SJed Brown 
4902552f7358SJed Brown #undef __FUNCT__
4903552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection"
4904552f7358SJed Brown /*@C
4905552f7358SJed Brown   DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided.
4906552f7358SJed Brown 
4907552f7358SJed Brown   Not Collective
4908552f7358SJed Brown 
4909552f7358SJed Brown   Input Parameters:
4910552f7358SJed Brown + dm        - The DMPlex object
4911552f7358SJed Brown . dim       - The spatial dimension of the problem
4912552f7358SJed Brown . numFields - The number of fields in the problem
4913552f7358SJed Brown . numComp   - An array of size numFields that holds the number of components for each field
4914552f7358SJed 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
4915552f7358SJed Brown . numBC     - The number of boundary conditions
4916552f7358SJed Brown . bcField   - An array of size numBC giving the field number for each boundry condition
4917552f7358SJed Brown - bcPoints  - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies
4918552f7358SJed Brown 
4919552f7358SJed Brown   Output Parameter:
4920552f7358SJed Brown . section - The PetscSection object
4921552f7358SJed Brown 
4922552f7358SJed 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
4923552f7358SJed Brown   nubmer of dof for field 0 on each edge.
4924552f7358SJed Brown 
4925552f7358SJed Brown   Level: developer
4926552f7358SJed Brown 
49273813dfbdSMatthew G Knepley   Fortran Notes:
49283813dfbdSMatthew G Knepley   A Fortran 90 version is available as DMPlexCreateSectionF90()
49293813dfbdSMatthew G Knepley 
4930552f7358SJed Brown .keywords: mesh, elements
4931552f7358SJed Brown .seealso: DMPlexCreate(), PetscSectionCreate()
4932552f7358SJed Brown @*/
4933a6dfd86eSKarl 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)
4934a6dfd86eSKarl Rupp {
4935552f7358SJed Brown   PetscErrorCode ierr;
4936552f7358SJed Brown 
4937552f7358SJed Brown   PetscFunctionBegin;
4938552f7358SJed Brown   ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr);
4939552f7358SJed Brown   ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr);
4940552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
4941552f7358SJed Brown   if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);}
4942552f7358SJed Brown   {
4943552f7358SJed Brown     PetscBool view = PETSC_FALSE;
4944552f7358SJed Brown 
4945552f7358SJed Brown     ierr = PetscOptionsHasName(((PetscObject) dm)->prefix, "-section_view", &view);CHKERRQ(ierr);
4946552f7358SJed Brown     if (view) {ierr = PetscSectionView(*section, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);}
4947552f7358SJed Brown   }
4948552f7358SJed Brown   PetscFunctionReturn(0);
4949552f7358SJed Brown }
4950552f7358SJed Brown 
4951552f7358SJed Brown #undef __FUNCT__
4952552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex"
49530adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm)
49540adebc6cSBarry Smith {
4955552f7358SJed Brown   PetscSection   section;
4956552f7358SJed Brown   PetscErrorCode ierr;
4957552f7358SJed Brown 
4958552f7358SJed Brown   PetscFunctionBegin;
495938221697SMatthew G. Knepley   ierr = DMClone(dm, cdm);CHKERRQ(ierr);
496082f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
4961552f7358SJed Brown   ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr);
49621d799100SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
4963552f7358SJed Brown   PetscFunctionReturn(0);
4964552f7358SJed Brown }
4965552f7358SJed Brown 
4966552f7358SJed Brown #undef __FUNCT__
4967552f7358SJed Brown #define __FUNCT__ "DMPlexGetCoordinateSection"
4968552f7358SJed Brown /*@
4969552f7358SJed Brown   DMPlexGetCoordinateSection - Retrieve the layout of coordinate values over the mesh.
4970552f7358SJed Brown 
4971552f7358SJed Brown   Not Collective
4972552f7358SJed Brown 
4973552f7358SJed Brown   Input Parameter:
4974552f7358SJed Brown . dm - The DMPlex object
4975552f7358SJed Brown 
4976552f7358SJed Brown   Output Parameter:
4977552f7358SJed Brown . section - The PetscSection object
4978552f7358SJed Brown 
4979552f7358SJed Brown   Level: intermediate
4980552f7358SJed Brown 
4981552f7358SJed Brown .keywords: mesh, coordinates
4982552f7358SJed Brown .seealso: DMGetCoordinateDM(), DMPlexGetDefaultSection(), DMPlexSetDefaultSection()
4983552f7358SJed Brown @*/
49840adebc6cSBarry Smith PetscErrorCode DMPlexGetCoordinateSection(DM dm, PetscSection *section)
49850adebc6cSBarry Smith {
4986552f7358SJed Brown   DM             cdm;
4987552f7358SJed Brown   PetscErrorCode ierr;
4988552f7358SJed Brown 
4989552f7358SJed Brown   PetscFunctionBegin;
4990552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4991552f7358SJed Brown   PetscValidPointer(section, 2);
4992552f7358SJed Brown   ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr);
4993552f7358SJed Brown   ierr = DMGetDefaultSection(cdm, section);CHKERRQ(ierr);
4994552f7358SJed Brown   PetscFunctionReturn(0);
4995552f7358SJed Brown }
4996552f7358SJed Brown 
4997552f7358SJed Brown #undef __FUNCT__
4998552f7358SJed Brown #define __FUNCT__ "DMPlexSetCoordinateSection"
4999552f7358SJed Brown /*@
5000552f7358SJed Brown   DMPlexSetCoordinateSection - Set the layout of coordinate values over the mesh.
5001552f7358SJed Brown 
5002552f7358SJed Brown   Not Collective
5003552f7358SJed Brown 
5004552f7358SJed Brown   Input Parameters:
5005552f7358SJed Brown + dm      - The DMPlex object
5006552f7358SJed Brown - section - The PetscSection object
5007552f7358SJed Brown 
5008552f7358SJed Brown   Level: intermediate
5009552f7358SJed Brown 
5010552f7358SJed Brown .keywords: mesh, coordinates
5011552f7358SJed Brown .seealso: DMPlexGetCoordinateSection(), DMPlexGetDefaultSection(), DMPlexSetDefaultSection()
5012552f7358SJed Brown @*/
50130adebc6cSBarry Smith PetscErrorCode DMPlexSetCoordinateSection(DM dm, PetscSection section)
50140adebc6cSBarry Smith {
5015552f7358SJed Brown   DM             cdm;
5016552f7358SJed Brown   PetscErrorCode ierr;
5017552f7358SJed Brown 
5018552f7358SJed Brown   PetscFunctionBegin;
5019552f7358SJed Brown   PetscValidHeaderSpecific(dm,DM_CLASSID,1);
50201d799100SJed Brown   PetscValidHeaderSpecific(section,PETSC_SECTION_CLASSID,2);
5021552f7358SJed Brown   ierr = DMGetCoordinateDM(dm, &cdm);CHKERRQ(ierr);
5022552f7358SJed Brown   ierr = DMSetDefaultSection(cdm, section);CHKERRQ(ierr);
5023552f7358SJed Brown   PetscFunctionReturn(0);
5024552f7358SJed Brown }
5025552f7358SJed Brown 
5026552f7358SJed Brown #undef __FUNCT__
5027552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection"
50280adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section)
50290adebc6cSBarry Smith {
5030552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5031552f7358SJed Brown 
5032552f7358SJed Brown   PetscFunctionBegin;
5033552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5034552f7358SJed Brown   if (section) *section = mesh->coneSection;
5035552f7358SJed Brown   PetscFunctionReturn(0);
5036552f7358SJed Brown }
5037552f7358SJed Brown 
5038552f7358SJed Brown #undef __FUNCT__
50398cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection"
50408cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section)
50418cb4d582SMatthew G. Knepley {
50428cb4d582SMatthew G. Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
50438cb4d582SMatthew G. Knepley 
50448cb4d582SMatthew G. Knepley   PetscFunctionBegin;
50458cb4d582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
50468cb4d582SMatthew G. Knepley   if (section) *section = mesh->supportSection;
50478cb4d582SMatthew G. Knepley   PetscFunctionReturn(0);
50488cb4d582SMatthew G. Knepley }
50498cb4d582SMatthew G. Knepley 
50508cb4d582SMatthew G. Knepley #undef __FUNCT__
5051552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones"
5052a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[])
5053a6dfd86eSKarl Rupp {
5054552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5055552f7358SJed Brown 
5056552f7358SJed Brown   PetscFunctionBegin;
5057552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5058552f7358SJed Brown   if (cones) *cones = mesh->cones;
5059552f7358SJed Brown   PetscFunctionReturn(0);
5060552f7358SJed Brown }
5061552f7358SJed Brown 
5062552f7358SJed Brown #undef __FUNCT__
5063552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations"
5064a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[])
5065a6dfd86eSKarl Rupp {
5066552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5067552f7358SJed Brown 
5068552f7358SJed Brown   PetscFunctionBegin;
5069552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5070552f7358SJed Brown   if (coneOrientations) *coneOrientations = mesh->coneOrientations;
5071552f7358SJed Brown   PetscFunctionReturn(0);
5072552f7358SJed Brown }
5073552f7358SJed Brown 
5074552f7358SJed Brown /******************************** FEM Support **********************************/
5075552f7358SJed Brown 
5076552f7358SJed Brown #undef __FUNCT__
5077552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure"
5078552f7358SJed Brown /*@C
5079552f7358SJed Brown   DMPlexVecGetClosure - Get an array of the values on the closure of 'point'
5080552f7358SJed Brown 
5081552f7358SJed Brown   Not collective
5082552f7358SJed Brown 
5083552f7358SJed Brown   Input Parameters:
5084552f7358SJed Brown + dm - The DM
50850298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
5086552f7358SJed Brown . v - The local vector
5087552f7358SJed Brown - point - The sieve point in the DM
5088552f7358SJed Brown 
5089552f7358SJed Brown   Output Parameters:
50900298fd71SBarry Smith + csize - The number of values in the closure, or NULL
5091552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
5092552f7358SJed Brown 
50933813dfbdSMatthew G Knepley   Fortran Notes:
50943813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
50953813dfbdSMatthew G Knepley   include petsc.h90 in your code.
50963813dfbdSMatthew G Knepley 
50973813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
50983813dfbdSMatthew G Knepley 
5099552f7358SJed Brown   Level: intermediate
5100552f7358SJed Brown 
5101552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
5102552f7358SJed Brown @*/
51037c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
5104a6dfd86eSKarl Rupp {
510552744b75SMatthew G. Knepley   PetscSection   clSection;
510652744b75SMatthew G. Knepley   IS             clIndices;
5107552f7358SJed Brown   PetscScalar   *array, *vArray;
51080298fd71SBarry Smith   PetscInt      *points = NULL;
5109552f7358SJed Brown   PetscInt       offsets[32];
51109df71ca4SMatthew G. Knepley   PetscInt       depth, numFields, size = 0, numPoints, pStart, pEnd, p, q, f;
5111552f7358SJed Brown   PetscErrorCode ierr;
5112552f7358SJed Brown 
5113552f7358SJed Brown   PetscFunctionBegin;
5114552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5115552f7358SJed Brown   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
511652744b75SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
511752744b75SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clIndices);CHKERRQ(ierr);
511852744b75SMatthew G. Knepley   if (clSection) {
511952744b75SMatthew G. Knepley     const PetscInt *idx;
512052744b75SMatthew G. Knepley     PetscInt        dof, off;
512152744b75SMatthew G. Knepley 
512252744b75SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
512352744b75SMatthew G. Knepley     if (csize) *csize = dof;
512452744b75SMatthew G. Knepley     if (values) {
512552744b75SMatthew G. Knepley       if (!*values) {
512652744b75SMatthew G. Knepley         ierr = DMGetWorkArray(dm, dof, PETSC_SCALAR, &array);CHKERRQ(ierr);
512752744b75SMatthew G. Knepley         *values = array;
512852744b75SMatthew G. Knepley       } else {
512952744b75SMatthew G. Knepley         array = *values;
513052744b75SMatthew G. Knepley       }
513152744b75SMatthew G. Knepley       ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
513252744b75SMatthew G. Knepley       ierr = ISGetIndices(clIndices, &idx);CHKERRQ(ierr);
513352744b75SMatthew G. Knepley       ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
513452744b75SMatthew G. Knepley       for (p = 0; p < dof; ++p) array[p] = vArray[idx[off+p]];
513552744b75SMatthew G. Knepley       ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
513652744b75SMatthew G. Knepley       ierr = ISRestoreIndices(clIndices, &idx);CHKERRQ(ierr);
513752744b75SMatthew G. Knepley     }
513852744b75SMatthew G. Knepley     PetscFunctionReturn(0);
5139552f7358SJed Brown   }
51405a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5141552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
51422a3aaacfSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
514382f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5144552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
51455a1bb5cfSMatthew G. Knepley   if (depth == 1 && numFields < 2) {
51465a1bb5cfSMatthew G. Knepley     const PetscInt *cone, *coneO;
51475a1bb5cfSMatthew G. Knepley 
51485a1bb5cfSMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
51495a1bb5cfSMatthew G. Knepley     ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
51505a1bb5cfSMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
51513f7cbbe7SMatthew G. Knepley     if (!values || !*values) {
51529df71ca4SMatthew G. Knepley       if ((point >= pStart) && (point < pEnd)) {
51539df71ca4SMatthew G. Knepley         PetscInt dof;
51549df71ca4SMatthew G. Knepley         ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
51559df71ca4SMatthew G. Knepley         size += dof;
51569df71ca4SMatthew G. Knepley       }
51579df71ca4SMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
51589df71ca4SMatthew G. Knepley         const PetscInt cp = cone[p];
51592a3aaacfSMatthew G. Knepley         PetscInt       dof;
51605a1bb5cfSMatthew G. Knepley 
51615a1bb5cfSMatthew G. Knepley         if ((cp < pStart) || (cp >= pEnd)) continue;
51622a3aaacfSMatthew G. Knepley         ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
51635a1bb5cfSMatthew G. Knepley         size += dof;
51645a1bb5cfSMatthew G. Knepley       }
51653f7cbbe7SMatthew G. Knepley       if (!values) {
51663f7cbbe7SMatthew G. Knepley         if (csize) *csize = size;
51673f7cbbe7SMatthew G. Knepley         PetscFunctionReturn(0);
51683f7cbbe7SMatthew G. Knepley       }
51695a1bb5cfSMatthew G. Knepley       ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
5170982e9ed1SMatthew G. Knepley     } else {
5171982e9ed1SMatthew G. Knepley       array = *values;
5172982e9ed1SMatthew G. Knepley     }
51739df71ca4SMatthew G. Knepley     size = 0;
51745a1bb5cfSMatthew G. Knepley     ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
51759df71ca4SMatthew G. Knepley     if ((point >= pStart) && (point < pEnd)) {
51769df71ca4SMatthew G. Knepley       PetscInt     dof, off, d;
51779df71ca4SMatthew G. Knepley       PetscScalar *varr;
51789df71ca4SMatthew G. Knepley       ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
51799df71ca4SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
51809df71ca4SMatthew G. Knepley       varr = &vArray[off];
51819df71ca4SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offsets[0]) {
51829df71ca4SMatthew G. Knepley         array[offsets[0]] = varr[d];
51839df71ca4SMatthew G. Knepley       }
51849df71ca4SMatthew G. Knepley       size += dof;
51859df71ca4SMatthew G. Knepley     }
51869df71ca4SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
51879df71ca4SMatthew G. Knepley       const PetscInt cp = cone[p];
51889df71ca4SMatthew G. Knepley       PetscInt       o  = coneO[p];
51895a1bb5cfSMatthew G. Knepley       PetscInt       dof, off, d;
51905a1bb5cfSMatthew G. Knepley       PetscScalar   *varr;
51915a1bb5cfSMatthew G. Knepley 
519252ed52e8SMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) continue;
51935a1bb5cfSMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
51945a1bb5cfSMatthew G. Knepley       ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr);
51955a1bb5cfSMatthew G. Knepley       varr = &vArray[off];
51965a1bb5cfSMatthew G. Knepley       if (o >= 0) {
51975a1bb5cfSMatthew G. Knepley         for (d = 0; d < dof; ++d, ++offsets[0]) {
51985a1bb5cfSMatthew G. Knepley           array[offsets[0]] = varr[d];
51995a1bb5cfSMatthew G. Knepley         }
52005a1bb5cfSMatthew G. Knepley       } else {
52015a1bb5cfSMatthew G. Knepley         for (d = dof-1; d >= 0; --d, ++offsets[0]) {
52025a1bb5cfSMatthew G. Knepley           array[offsets[0]] = varr[d];
52035a1bb5cfSMatthew G. Knepley         }
52045a1bb5cfSMatthew G. Knepley       }
52059df71ca4SMatthew G. Knepley       size += dof;
52065a1bb5cfSMatthew G. Knepley     }
52075a1bb5cfSMatthew G. Knepley     ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
52089df71ca4SMatthew G. Knepley     if (!*values) {
52095a1bb5cfSMatthew G. Knepley       if (csize) *csize = size;
52105a1bb5cfSMatthew G. Knepley       *values = array;
52119df71ca4SMatthew G. Knepley     } else {
52129df71ca4SMatthew G. Knepley       if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
52138c312ff3SMatthew G. Knepley       *csize = size;
52149df71ca4SMatthew G. Knepley     }
52155a1bb5cfSMatthew G. Knepley     PetscFunctionReturn(0);
52165a1bb5cfSMatthew G. Knepley   }
5217552f7358SJed Brown   ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5218552f7358SJed Brown   /* Compress out points not in the section */
5219552f7358SJed Brown   for (p = 0, q = 0; p < numPoints*2; p += 2) {
5220552f7358SJed Brown     if ((points[p] >= pStart) && (points[p] < pEnd)) {
5221552f7358SJed Brown       points[q*2]   = points[p];
5222552f7358SJed Brown       points[q*2+1] = points[p+1];
5223552f7358SJed Brown       ++q;
5224552f7358SJed Brown     }
5225552f7358SJed Brown   }
5226552f7358SJed Brown   numPoints = q;
5227bd6c0d32SMatthew G. Knepley   if (!values || !*values) {
5228552f7358SJed Brown     for (p = 0, size = 0; p < numPoints*2; p += 2) {
5229552f7358SJed Brown       PetscInt dof, fdof;
5230552f7358SJed Brown 
5231552f7358SJed Brown       ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5232552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
5233552f7358SJed Brown         ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5234552f7358SJed Brown         offsets[f+1] += fdof;
5235552f7358SJed Brown       }
5236552f7358SJed Brown       size += dof;
5237552f7358SJed Brown     }
5238bd6c0d32SMatthew G. Knepley     if (!values) {
5239648a61deSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5240bd6c0d32SMatthew G. Knepley       if (csize) *csize = size;
5241bd6c0d32SMatthew G. Knepley       PetscFunctionReturn(0);
5242bd6c0d32SMatthew G. Knepley     }
5243d0f6b257SMatthew G. Knepley     ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
5244d0f6b257SMatthew G. Knepley   } else {
5245d0f6b257SMatthew G. Knepley     array = *values;
5246d0f6b257SMatthew G. Knepley   }
52470d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
524882f516ccSBarry Smith   if (numFields && offsets[numFields] != size) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], size);
5249552f7358SJed Brown   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
5250552f7358SJed Brown   for (p = 0; p < numPoints*2; p += 2) {
5251552f7358SJed Brown     PetscInt     o = points[p+1];
5252552f7358SJed Brown     PetscInt     dof, off, d;
5253552f7358SJed Brown     PetscScalar *varr;
5254552f7358SJed Brown 
5255552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5256552f7358SJed Brown     ierr = PetscSectionGetOffset(section, points[p], &off);CHKERRQ(ierr);
5257552f7358SJed Brown     varr = &vArray[off];
5258552f7358SJed Brown     if (numFields) {
5259552f7358SJed Brown       PetscInt fdof, foff, fcomp, f, c;
5260552f7358SJed Brown 
5261552f7358SJed Brown       for (f = 0, foff = 0; f < numFields; ++f) {
5262552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5263552f7358SJed Brown         if (o >= 0) {
5264552f7358SJed Brown           for (d = 0; d < fdof; ++d, ++offsets[f]) {
5265552f7358SJed Brown             array[offsets[f]] = varr[foff+d];
5266552f7358SJed Brown           }
5267552f7358SJed Brown         } else {
5268552f7358SJed Brown           ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5269552f7358SJed Brown           for (d = fdof/fcomp-1; d >= 0; --d) {
5270552f7358SJed Brown             for (c = 0; c < fcomp; ++c, ++offsets[f]) {
5271552f7358SJed Brown               array[offsets[f]] = varr[foff+d*fcomp+c];
5272552f7358SJed Brown             }
5273552f7358SJed Brown           }
5274552f7358SJed Brown         }
5275552f7358SJed Brown         foff += fdof;
5276552f7358SJed Brown       }
5277552f7358SJed Brown     } else {
5278552f7358SJed Brown       if (o >= 0) {
5279552f7358SJed Brown         for (d = 0; d < dof; ++d, ++offsets[0]) {
5280552f7358SJed Brown           array[offsets[0]] = varr[d];
5281552f7358SJed Brown         }
5282552f7358SJed Brown       } else {
5283552f7358SJed Brown         for (d = dof-1; d >= 0; --d, ++offsets[0]) {
5284552f7358SJed Brown           array[offsets[0]] = varr[d];
5285552f7358SJed Brown         }
5286552f7358SJed Brown       }
5287552f7358SJed Brown     }
5288552f7358SJed Brown   }
5289552f7358SJed Brown   ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5290552f7358SJed Brown   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
5291d0f6b257SMatthew G. Knepley   if (!*values) {
5292552f7358SJed Brown     if (csize) *csize = size;
5293552f7358SJed Brown     *values = array;
5294d0f6b257SMatthew G. Knepley   } else {
5295d0f6b257SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
5296d0f6b257SMatthew G. Knepley     *csize = size;
5297d0f6b257SMatthew G. Knepley   }
5298552f7358SJed Brown   PetscFunctionReturn(0);
5299552f7358SJed Brown }
5300552f7358SJed Brown 
5301552f7358SJed Brown #undef __FUNCT__
5302552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure"
5303552f7358SJed Brown /*@C
5304552f7358SJed Brown   DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point'
5305552f7358SJed Brown 
5306552f7358SJed Brown   Not collective
5307552f7358SJed Brown 
5308552f7358SJed Brown   Input Parameters:
5309552f7358SJed Brown + dm - The DM
53100298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
5311552f7358SJed Brown . v - The local vector
5312552f7358SJed Brown . point - The sieve point in the DM
53130298fd71SBarry Smith . csize - The number of values in the closure, or NULL
5314552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
5315552f7358SJed Brown 
53163813dfbdSMatthew G Knepley   Fortran Notes:
53173813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
53183813dfbdSMatthew G Knepley   include petsc.h90 in your code.
53193813dfbdSMatthew G Knepley 
53203813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
53213813dfbdSMatthew G Knepley 
5322552f7358SJed Brown   Level: intermediate
5323552f7358SJed Brown 
5324552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
5325552f7358SJed Brown @*/
53267c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
5327a6dfd86eSKarl Rupp {
5328552f7358SJed Brown   PetscInt       size = 0;
5329552f7358SJed Brown   PetscErrorCode ierr;
5330552f7358SJed Brown 
5331552f7358SJed Brown   PetscFunctionBegin;
5332552f7358SJed Brown   /* Should work without recalculating size */
5333552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr);
5334552f7358SJed Brown   PetscFunctionReturn(0);
5335552f7358SJed Brown }
5336552f7358SJed Brown 
5337552f7358SJed Brown PETSC_STATIC_INLINE void add   (PetscScalar *x, PetscScalar y) {*x += y;}
5338552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x  = y;}
5339552f7358SJed Brown 
5340552f7358SJed Brown #undef __FUNCT__
5341552f7358SJed Brown #define __FUNCT__ "updatePoint_private"
5342552f7358SJed Brown PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5343552f7358SJed Brown {
5344552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
5345552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5346552f7358SJed Brown   PetscScalar    *a;
5347552f7358SJed Brown   PetscInt        off, cind = 0, k;
5348552f7358SJed Brown   PetscErrorCode  ierr;
5349552f7358SJed Brown 
5350552f7358SJed Brown   PetscFunctionBegin;
5351552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
5352552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5353552f7358SJed Brown   a    = &array[off];
5354552f7358SJed Brown   if (!cdof || setBC) {
5355552f7358SJed Brown     if (orientation >= 0) {
5356552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5357552f7358SJed Brown         fuse(&a[k], values[k]);
5358552f7358SJed Brown       }
5359552f7358SJed Brown     } else {
5360552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5361552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
5362552f7358SJed Brown       }
5363552f7358SJed Brown     }
5364552f7358SJed Brown   } else {
5365552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
5366552f7358SJed Brown     if (orientation >= 0) {
5367552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5368552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5369552f7358SJed Brown         fuse(&a[k], values[k]);
5370552f7358SJed Brown       }
5371552f7358SJed Brown     } else {
5372552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5373552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5374552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
5375552f7358SJed Brown       }
5376552f7358SJed Brown     }
5377552f7358SJed Brown   }
5378552f7358SJed Brown   PetscFunctionReturn(0);
5379552f7358SJed Brown }
5380552f7358SJed Brown 
5381552f7358SJed Brown #undef __FUNCT__
5382a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private"
5383a5e93ea8SMatthew G. Knepley PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5384a5e93ea8SMatthew G. Knepley {
5385a5e93ea8SMatthew G. Knepley   PetscInt        cdof;   /* The number of constraints on this point */
5386a5e93ea8SMatthew G. Knepley   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5387a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
5388a5e93ea8SMatthew G. Knepley   PetscInt        off, cind = 0, k;
5389a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
5390a5e93ea8SMatthew G. Knepley 
5391a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
5392a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
5393a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5394a5e93ea8SMatthew G. Knepley   a    = &array[off];
5395a5e93ea8SMatthew G. Knepley   if (cdof) {
5396a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
5397a5e93ea8SMatthew G. Knepley     if (orientation >= 0) {
5398a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
5399a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
5400a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[k]);
5401a5e93ea8SMatthew G. Knepley           ++cind;
5402a5e93ea8SMatthew G. Knepley         }
5403a5e93ea8SMatthew G. Knepley       }
5404a5e93ea8SMatthew G. Knepley     } else {
5405a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
5406a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
5407a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[dof-k-1]);
5408a5e93ea8SMatthew G. Knepley           ++cind;
5409a5e93ea8SMatthew G. Knepley         }
5410a5e93ea8SMatthew G. Knepley       }
5411a5e93ea8SMatthew G. Knepley     }
5412a5e93ea8SMatthew G. Knepley   }
5413a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
5414a5e93ea8SMatthew G. Knepley }
5415a5e93ea8SMatthew G. Knepley 
5416a5e93ea8SMatthew G. Knepley #undef __FUNCT__
5417552f7358SJed Brown #define __FUNCT__ "updatePointFields_private"
5418a6dfd86eSKarl Rupp PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt foffs[], void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5419a6dfd86eSKarl Rupp {
5420552f7358SJed Brown   PetscScalar   *a;
5421552f7358SJed Brown   PetscInt       numFields, off, foff, f;
5422552f7358SJed Brown   PetscErrorCode ierr;
5423552f7358SJed Brown 
5424552f7358SJed Brown   PetscFunctionBegin;
5425552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5426552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5427552f7358SJed Brown   a    = &array[off];
5428552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
5429552f7358SJed Brown     PetscInt        fdof, fcomp, fcdof;
5430552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
5431552f7358SJed Brown     PetscInt        cind = 0, k, c;
5432552f7358SJed Brown 
5433552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5434552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
5435552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
5436552f7358SJed Brown     if (!fcdof || setBC) {
5437552f7358SJed Brown       if (orientation >= 0) {
5438552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
5439552f7358SJed Brown           fuse(&a[foff+k], values[foffs[f]+k]);
5440552f7358SJed Brown         }
5441552f7358SJed Brown       } else {
5442552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5443552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5444552f7358SJed Brown             fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]);
5445552f7358SJed Brown           }
5446552f7358SJed Brown         }
5447552f7358SJed Brown       }
5448552f7358SJed Brown     } else {
5449552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
5450552f7358SJed Brown       if (orientation >= 0) {
5451552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
5452552f7358SJed Brown           if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;}
5453552f7358SJed Brown           fuse(&a[foff+k], values[foffs[f]+k]);
5454552f7358SJed Brown         }
5455552f7358SJed Brown       } else {
5456552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5457552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5458552f7358SJed Brown             if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;}
5459552f7358SJed Brown             fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]);
5460552f7358SJed Brown           }
5461552f7358SJed Brown         }
5462552f7358SJed Brown       }
5463552f7358SJed Brown     }
5464552f7358SJed Brown     foff     += fdof;
5465552f7358SJed Brown     foffs[f] += fdof;
5466552f7358SJed Brown   }
5467552f7358SJed Brown   PetscFunctionReturn(0);
5468552f7358SJed Brown }
5469552f7358SJed Brown 
5470552f7358SJed Brown #undef __FUNCT__
5471a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private"
5472a5e93ea8SMatthew G. Knepley PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt foffs[], void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[])
5473a5e93ea8SMatthew G. Knepley {
5474a5e93ea8SMatthew G. Knepley   PetscScalar   *a;
5475a5e93ea8SMatthew G. Knepley   PetscInt       numFields, off, foff, f;
5476a5e93ea8SMatthew G. Knepley   PetscErrorCode ierr;
5477a5e93ea8SMatthew G. Knepley 
5478a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
5479a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5480a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
5481a5e93ea8SMatthew G. Knepley   a    = &array[off];
5482a5e93ea8SMatthew G. Knepley   for (f = 0, foff = 0; f < numFields; ++f) {
5483a5e93ea8SMatthew G. Knepley     PetscInt        fdof, fcomp, fcdof;
5484a5e93ea8SMatthew G. Knepley     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
5485a5e93ea8SMatthew G. Knepley     PetscInt        cind = 0, k, c;
5486a5e93ea8SMatthew G. Knepley 
5487a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5488a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
5489a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
5490a5e93ea8SMatthew G. Knepley     if (fcdof) {
5491a5e93ea8SMatthew G. Knepley       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
5492a5e93ea8SMatthew G. Knepley       if (orientation >= 0) {
5493a5e93ea8SMatthew G. Knepley         for (k = 0; k < fdof; ++k) {
5494a5e93ea8SMatthew G. Knepley           if ((cind < fcdof) && (k == fcdofs[cind])) {
5495a5e93ea8SMatthew G. Knepley             fuse(&a[foff+k], values[foffs[f]+k]);
5496a5e93ea8SMatthew G. Knepley             ++cind;
5497a5e93ea8SMatthew G. Knepley           }
5498a5e93ea8SMatthew G. Knepley         }
5499a5e93ea8SMatthew G. Knepley       } else {
5500a5e93ea8SMatthew G. Knepley         for (k = fdof/fcomp-1; k >= 0; --k) {
5501a5e93ea8SMatthew G. Knepley           for (c = 0; c < fcomp; ++c) {
5502a5e93ea8SMatthew G. Knepley             if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {
5503a5e93ea8SMatthew G. Knepley               fuse(&a[foff+(fdof/fcomp-1-k)*fcomp+c], values[foffs[f]+k*fcomp+c]);
5504a5e93ea8SMatthew G. Knepley               ++cind;
5505a5e93ea8SMatthew G. Knepley             }
5506a5e93ea8SMatthew G. Knepley           }
5507a5e93ea8SMatthew G. Knepley         }
5508a5e93ea8SMatthew G. Knepley       }
5509a5e93ea8SMatthew G. Knepley     }
5510a5e93ea8SMatthew G. Knepley     foff     += fdof;
5511a5e93ea8SMatthew G. Knepley     foffs[f] += fdof;
5512a5e93ea8SMatthew G. Knepley   }
5513a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
5514a5e93ea8SMatthew G. Knepley }
5515a5e93ea8SMatthew G. Knepley 
5516a5e93ea8SMatthew G. Knepley #undef __FUNCT__
5517552f7358SJed Brown #define __FUNCT__ "DMPlexVecSetClosure"
5518552f7358SJed Brown /*@C
5519552f7358SJed Brown   DMPlexVecSetClosure - Set an array of the values on the closure of 'point'
5520552f7358SJed Brown 
5521552f7358SJed Brown   Not collective
5522552f7358SJed Brown 
5523552f7358SJed Brown   Input Parameters:
5524552f7358SJed Brown + dm - The DM
55257f5d1fdeSMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section
5526552f7358SJed Brown . v - The local vector
5527552f7358SJed Brown . point - The sieve point in the DM
55287f5d1fdeSMatthew G. Knepley . values - The array of values
5529552f7358SJed Brown - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
5530552f7358SJed Brown 
55313813dfbdSMatthew G Knepley   Fortran Notes:
55327f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
55333813dfbdSMatthew G Knepley 
5534552f7358SJed Brown   Level: intermediate
5535552f7358SJed Brown 
5536552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure()
5537552f7358SJed Brown @*/
5538a6dfd86eSKarl Rupp PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
5539a6dfd86eSKarl Rupp {
5540552f7358SJed Brown   PetscScalar   *array;
55410298fd71SBarry Smith   PetscInt      *points = NULL;
5542552f7358SJed Brown   PetscInt       offsets[32];
5543b6ebb6e6SMatthew G. Knepley   PetscInt       depth, numFields, numPoints, off, dof, pStart, pEnd, p, q, f;
5544552f7358SJed Brown   PetscErrorCode ierr;
5545552f7358SJed Brown 
5546552f7358SJed Brown   PetscFunctionBegin;
5547552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5548552f7358SJed Brown   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
5549552f7358SJed Brown   if (!section) {
5550552f7358SJed Brown     ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
5551552f7358SJed Brown   }
5552b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5553552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5554b6ebb6e6SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
555582f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5556552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5557b6ebb6e6SMatthew G. Knepley   if (depth == 1 && numFields < 2 && mode == ADD_VALUES) {
5558b6ebb6e6SMatthew G. Knepley     const PetscInt *cone, *coneO;
5559b6ebb6e6SMatthew G. Knepley 
5560b6ebb6e6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
5561b6ebb6e6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
5562b6ebb6e6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
5563b6ebb6e6SMatthew G. Knepley     ierr = VecGetArray(v, &array);CHKERRQ(ierr);
5564b6ebb6e6SMatthew G. Knepley     for (p = 0, off = 0; p <= numPoints; ++p, off += dof) {
5565b6ebb6e6SMatthew G. Knepley       const PetscInt cp = !p ? point : cone[p-1];
5566b6ebb6e6SMatthew G. Knepley       const PetscInt o  = !p ? 0     : coneO[p-1];
5567b6ebb6e6SMatthew G. Knepley 
5568b6ebb6e6SMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;}
5569b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
5570b6ebb6e6SMatthew G. Knepley       /* ADD_VALUES */
5571b6ebb6e6SMatthew G. Knepley       {
5572b6ebb6e6SMatthew G. Knepley         const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5573b6ebb6e6SMatthew G. Knepley         PetscScalar    *a;
5574b6ebb6e6SMatthew G. Knepley         PetscInt        cdof, coff, cind = 0, k;
5575b6ebb6e6SMatthew G. Knepley 
5576b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr);
5577b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr);
5578b6ebb6e6SMatthew G. Knepley         a    = &array[coff];
5579b6ebb6e6SMatthew G. Knepley         if (!cdof) {
5580b6ebb6e6SMatthew G. Knepley           if (o >= 0) {
5581b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5582b6ebb6e6SMatthew G. Knepley               a[k] += values[off+k];
5583b6ebb6e6SMatthew G. Knepley             }
5584b6ebb6e6SMatthew G. Knepley           } else {
5585b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5586b6ebb6e6SMatthew G. Knepley               a[k] += values[off+dof-k-1];
5587b6ebb6e6SMatthew G. Knepley             }
5588b6ebb6e6SMatthew G. Knepley           }
5589b6ebb6e6SMatthew G. Knepley         } else {
5590b6ebb6e6SMatthew G. Knepley           ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr);
5591b6ebb6e6SMatthew G. Knepley           if (o >= 0) {
5592b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5593b6ebb6e6SMatthew G. Knepley               if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5594b6ebb6e6SMatthew G. Knepley               a[k] += values[off+k];
5595b6ebb6e6SMatthew G. Knepley             }
5596b6ebb6e6SMatthew G. Knepley           } else {
5597b6ebb6e6SMatthew G. Knepley             for (k = 0; k < dof; ++k) {
5598b6ebb6e6SMatthew G. Knepley               if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
5599b6ebb6e6SMatthew G. Knepley               a[k] += values[off+dof-k-1];
5600b6ebb6e6SMatthew G. Knepley             }
5601b6ebb6e6SMatthew G. Knepley           }
5602b6ebb6e6SMatthew G. Knepley         }
5603b6ebb6e6SMatthew G. Knepley       }
5604b6ebb6e6SMatthew G. Knepley     }
5605b6ebb6e6SMatthew G. Knepley     ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
5606b6ebb6e6SMatthew G. Knepley     PetscFunctionReturn(0);
5607b6ebb6e6SMatthew G. Knepley   }
5608552f7358SJed Brown   ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5609552f7358SJed Brown   /* Compress out points not in the section */
5610552f7358SJed Brown   for (p = 0, q = 0; p < numPoints*2; p += 2) {
5611552f7358SJed Brown     if ((points[p] >= pStart) && (points[p] < pEnd)) {
5612552f7358SJed Brown       points[q*2]   = points[p];
5613552f7358SJed Brown       points[q*2+1] = points[p+1];
5614552f7358SJed Brown       ++q;
5615552f7358SJed Brown     }
5616552f7358SJed Brown   }
5617552f7358SJed Brown   numPoints = q;
5618552f7358SJed Brown   for (p = 0; p < numPoints*2; p += 2) {
5619552f7358SJed Brown     PetscInt fdof;
5620552f7358SJed Brown 
5621552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
5622552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5623552f7358SJed Brown       offsets[f+1] += fdof;
5624552f7358SJed Brown     }
5625552f7358SJed Brown   }
56260d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
5627552f7358SJed Brown   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
5628552f7358SJed Brown   if (numFields) {
5629552f7358SJed Brown     switch (mode) {
5630552f7358SJed Brown     case INSERT_VALUES:
5631552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5632552f7358SJed Brown         PetscInt o = points[p+1];
5633552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, insert, PETSC_FALSE, o, values, array);
5634552f7358SJed Brown       } break;
5635552f7358SJed Brown     case INSERT_ALL_VALUES:
5636552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5637552f7358SJed Brown         PetscInt o = points[p+1];
5638552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, insert, PETSC_TRUE,  o, values, array);
5639552f7358SJed Brown       } break;
5640a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
5641a5e93ea8SMatthew G. Knepley       for (p = 0; p < numPoints*2; p += 2) {
5642a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
5643a5e93ea8SMatthew G. Knepley         updatePointFieldsBC_private(section, points[p], offsets, insert,  o, values, array);
5644a5e93ea8SMatthew G. Knepley       } break;
5645552f7358SJed Brown     case ADD_VALUES:
5646552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5647552f7358SJed Brown         PetscInt o = points[p+1];
5648552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, add,    PETSC_FALSE, o, values, array);
5649552f7358SJed Brown       } break;
5650552f7358SJed Brown     case ADD_ALL_VALUES:
5651552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
5652552f7358SJed Brown         PetscInt o = points[p+1];
5653552f7358SJed Brown         updatePointFields_private(section, points[p], offsets, add,    PETSC_TRUE,  o, values, array);
5654552f7358SJed Brown       } break;
5655552f7358SJed Brown     default:
565682f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
5657552f7358SJed Brown     }
5658552f7358SJed Brown   } else {
5659552f7358SJed Brown     switch (mode) {
5660552f7358SJed Brown     case INSERT_VALUES:
5661552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5662552f7358SJed Brown         PetscInt o = points[p+1];
5663552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5664552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array);
5665552f7358SJed Brown       } break;
5666552f7358SJed Brown     case INSERT_ALL_VALUES:
5667552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5668552f7358SJed Brown         PetscInt o = points[p+1];
5669552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5670552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_TRUE,  o, &values[off], array);
5671552f7358SJed Brown       } break;
5672a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
5673a5e93ea8SMatthew G. Knepley       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5674a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
5675a5e93ea8SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5676a5e93ea8SMatthew G. Knepley         updatePointBC_private(section, points[p], dof, insert,  o, &values[off], array);
5677a5e93ea8SMatthew G. Knepley       } break;
5678552f7358SJed Brown     case ADD_VALUES:
5679552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5680552f7358SJed Brown         PetscInt o = points[p+1];
5681552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5682552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_FALSE, o, &values[off], array);
5683552f7358SJed Brown       } break;
5684552f7358SJed Brown     case ADD_ALL_VALUES:
5685552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
5686552f7358SJed Brown         PetscInt o = points[p+1];
5687552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5688552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_TRUE,  o, &values[off], array);
5689552f7358SJed Brown       } break;
5690552f7358SJed Brown     default:
569182f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
5692552f7358SJed Brown     }
5693552f7358SJed Brown   }
5694552f7358SJed Brown   ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5695552f7358SJed Brown   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
5696552f7358SJed Brown   PetscFunctionReturn(0);
5697552f7358SJed Brown }
5698552f7358SJed Brown 
5699552f7358SJed Brown #undef __FUNCT__
5700e159ff95SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateClosureIndex"
5701e159ff95SMatthew G. Knepley /*@
5702e159ff95SMatthew G. Knepley   DMPlexCreateClosureIndex - Calculate an index for the given PetscSection for the closure operation on the DM
5703e159ff95SMatthew G. Knepley 
5704e159ff95SMatthew G. Knepley   Not collective
5705e159ff95SMatthew G. Knepley 
5706e159ff95SMatthew G. Knepley   Input Parameters:
5707e159ff95SMatthew G. Knepley + dm - The DM
5708e159ff95SMatthew G. Knepley - section - The section describing the layout in v, or NULL to use the default section
5709e159ff95SMatthew G. Knepley 
5710e159ff95SMatthew G. Knepley   Note:
5711e159ff95SMatthew G. Knepley   This should greatly improve the performance of the closure operations, at the cost of additional memory.
5712e159ff95SMatthew G. Knepley 
5713e159ff95SMatthew G. Knepley   Level: intermediate
5714e159ff95SMatthew G. Knepley 
5715e159ff95SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
5716e159ff95SMatthew G. Knepley @*/
5717e159ff95SMatthew G. Knepley PetscErrorCode DMPlexCreateClosureIndex(DM dm, PetscSection section)
5718e159ff95SMatthew G. Knepley {
5719e159ff95SMatthew G. Knepley   PetscSection   closureSection;
5720e159ff95SMatthew G. Knepley   IS             closureIS;
5721e159ff95SMatthew G. Knepley   PetscInt       offsets[32], *clIndices;
5722e159ff95SMatthew G. Knepley   PetscInt       depth, numFields, pStart, pEnd, point, clSize;
5723e159ff95SMatthew G. Knepley   PetscErrorCode ierr;
5724e159ff95SMatthew G. Knepley 
5725e159ff95SMatthew G. Knepley   PetscFunctionBegin;
5726e159ff95SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5727e159ff95SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
5728e159ff95SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5729e159ff95SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5730e159ff95SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
5731e159ff95SMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5732e159ff95SMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) section), &closureSection);CHKERRQ(ierr);
5733e159ff95SMatthew G. Knepley   ierr = PetscSectionSetChart(closureSection, pStart, pEnd);CHKERRQ(ierr);
5734e159ff95SMatthew G. Knepley   for (point = pStart; point < pEnd; ++point) {
5735e159ff95SMatthew G. Knepley     PetscInt *points = NULL, numPoints, p, dof, cldof = 0;
5736e159ff95SMatthew G. Knepley 
5737e159ff95SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5738e159ff95SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
5739e159ff95SMatthew G. Knepley       if ((points[p] >= pStart) && (points[p] < pEnd)) {
5740e159ff95SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5741e159ff95SMatthew G. Knepley         cldof += dof;
5742e159ff95SMatthew G. Knepley       }
5743e159ff95SMatthew G. Knepley     }
5744e159ff95SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5745e159ff95SMatthew G. Knepley     ierr = PetscSectionSetDof(closureSection, point, cldof);CHKERRQ(ierr);
5746e159ff95SMatthew G. Knepley   }
5747e159ff95SMatthew G. Knepley   ierr = PetscSectionSetUp(closureSection);CHKERRQ(ierr);
5748e159ff95SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(closureSection, &clSize);CHKERRQ(ierr);
5749e159ff95SMatthew G. Knepley   ierr = PetscMalloc(clSize * sizeof(PetscInt), &clIndices);CHKERRQ(ierr);
5750e159ff95SMatthew G. Knepley   for (point = pStart; point < pEnd; ++point) {
5751e159ff95SMatthew G. Knepley     PetscInt *points = NULL, numPoints, p, q, cldof, cloff, fdof, f;
5752e159ff95SMatthew G. Knepley 
5753e159ff95SMatthew G. Knepley     ierr = PetscSectionGetDof(closureSection, point, &cldof);CHKERRQ(ierr);
5754e159ff95SMatthew G. Knepley     ierr = PetscSectionGetOffset(closureSection, point, &cloff);CHKERRQ(ierr);
5755e159ff95SMatthew G. Knepley     ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5756e159ff95SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5757e159ff95SMatthew G. Knepley     /* Compress out points not in the section, and create field offsets */
5758e159ff95SMatthew G. Knepley     for (p = 0, q = 0; p < numPoints*2; p += 2) {
5759e159ff95SMatthew G. Knepley       if ((points[p] >= pStart) && (points[p] < pEnd)) {
5760e159ff95SMatthew G. Knepley         points[q*2]   = points[p];
5761e159ff95SMatthew G. Knepley         points[q*2+1] = points[p+1];
5762e159ff95SMatthew G. Knepley         for (f = 0; f < numFields; ++f) {
5763e159ff95SMatthew G. Knepley           ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5764e159ff95SMatthew G. Knepley           offsets[f+1] += fdof;
5765e159ff95SMatthew G. Knepley         }
5766e159ff95SMatthew G. Knepley         ++q;
5767e159ff95SMatthew G. Knepley       }
5768e159ff95SMatthew G. Knepley     }
5769e159ff95SMatthew G. Knepley     numPoints = q;
5770e159ff95SMatthew G. Knepley     for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
5771e159ff95SMatthew 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);
5772e159ff95SMatthew G. Knepley     /* Create indices */
5773e159ff95SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
5774e159ff95SMatthew G. Knepley       PetscInt o = points[p+1], dof, off, d;
5775e159ff95SMatthew G. Knepley 
5776e159ff95SMatthew G. Knepley       ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5777e159ff95SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, points[p], &off);CHKERRQ(ierr);
5778e159ff95SMatthew G. Knepley       if (numFields) {
5779e159ff95SMatthew G. Knepley         PetscInt fdof, foff, fcomp, f, c;
5780e159ff95SMatthew G. Knepley 
5781e159ff95SMatthew G. Knepley         for (f = 0, foff = 0; f < numFields; ++f) {
5782e159ff95SMatthew G. Knepley           ierr = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5783e159ff95SMatthew G. Knepley           if (o >= 0) {
5784e159ff95SMatthew G. Knepley             for (d = 0; d < fdof; ++d, ++offsets[f]) clIndices[cloff+offsets[f]] = off+foff+d;
5785e159ff95SMatthew G. Knepley           } else {
5786e159ff95SMatthew G. Knepley             ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5787e159ff95SMatthew G. Knepley             for (d = fdof/fcomp-1; d >= 0; --d) {
5788e159ff95SMatthew G. Knepley               for (c = 0; c < fcomp; ++c, ++offsets[f]) clIndices[cloff+offsets[f]] = off+foff+d*fcomp+c;
5789e159ff95SMatthew G. Knepley             }
5790e159ff95SMatthew G. Knepley           }
5791e159ff95SMatthew G. Knepley           foff += fdof;
5792e159ff95SMatthew G. Knepley         }
5793e159ff95SMatthew G. Knepley       } else {
5794e159ff95SMatthew G. Knepley         if (o >= 0) for (d = 0;     d < dof; ++d) clIndices[cloff+d] = off+d;
5795e159ff95SMatthew G. Knepley         else        for (d = dof-1; d >= 0;  --d) clIndices[cloff+d] = off+d;
5796e159ff95SMatthew G. Knepley       }
5797e159ff95SMatthew G. Knepley     }
5798e159ff95SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5799e159ff95SMatthew G. Knepley   }
5800e159ff95SMatthew G. Knepley   ierr = ISCreateGeneral(PETSC_COMM_SELF, clSize, clIndices, PETSC_OWN_POINTER, &closureIS);CHKERRQ(ierr);
5801e159ff95SMatthew G. Knepley   ierr = PetscSectionSetClosureIndex(section, (PetscObject) dm, closureSection, closureIS);
5802e159ff95SMatthew G. Knepley   PetscFunctionReturn(0);
5803e159ff95SMatthew G. Knepley }
5804e159ff95SMatthew G. Knepley 
5805e159ff95SMatthew G. Knepley #undef __FUNCT__
5806552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues"
58077c1f9639SMatthew G Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numIndices, const PetscInt indices[], const PetscScalar values[])
5808552f7358SJed Brown {
5809552f7358SJed Brown   PetscMPIInt    rank;
5810552f7358SJed Brown   PetscInt       i, j;
5811552f7358SJed Brown   PetscErrorCode ierr;
5812552f7358SJed Brown 
5813552f7358SJed Brown   PetscFunctionBegin;
581482f516ccSBarry Smith   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr);
581577a6746dSMatthew G Knepley   ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr);
5816552f7358SJed Brown   for (i = 0; i < numIndices; i++) {
581777a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat indices[%D] = %D\n", rank, i, indices[i]);CHKERRQ(ierr);
5818552f7358SJed Brown   }
5819552f7358SJed Brown   for (i = 0; i < numIndices; i++) {
582077a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr);
5821552f7358SJed Brown     for (j = 0; j < numIndices; j++) {
5822519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX)
582377a6746dSMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, " (%G,%G)", PetscRealPart(values[i*numIndices+j]), PetscImaginaryPart(values[i*numIndices+j]));CHKERRQ(ierr);
5824552f7358SJed Brown #else
582577a6746dSMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, " %G", values[i*numIndices+j]);CHKERRQ(ierr);
5826552f7358SJed Brown #endif
5827552f7358SJed Brown     }
582877a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
5829552f7358SJed Brown   }
5830552f7358SJed Brown   PetscFunctionReturn(0);
5831552f7358SJed Brown }
5832552f7358SJed Brown 
5833552f7358SJed Brown #undef __FUNCT__
5834552f7358SJed Brown #define __FUNCT__ "indicesPoint_private"
5835552f7358SJed Brown /* . off - The global offset of this point */
5836e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[])
5837a6dfd86eSKarl Rupp {
5838e6ccafaeSMatthew G Knepley   PetscInt        dof;    /* The number of unknowns on this point */
5839552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
5840552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
5841552f7358SJed Brown   PetscInt        cind = 0, k;
5842552f7358SJed Brown   PetscErrorCode  ierr;
5843552f7358SJed Brown 
5844552f7358SJed Brown   PetscFunctionBegin;
5845552f7358SJed Brown   ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
5846552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
5847552f7358SJed Brown   if (!cdof || setBC) {
5848552f7358SJed Brown     if (orientation >= 0) {
5849e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+k] = off+k;
5850552f7358SJed Brown     } else {
5851e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k;
5852552f7358SJed Brown     }
5853552f7358SJed Brown   } else {
5854552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
5855552f7358SJed Brown     if (orientation >= 0) {
5856552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5857552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
5858552f7358SJed Brown           /* Insert check for returning constrained indices */
5859e6ccafaeSMatthew G Knepley           indices[*loff+k] = -(off+k+1);
5860552f7358SJed Brown           ++cind;
5861552f7358SJed Brown         } else {
5862e6ccafaeSMatthew G Knepley           indices[*loff+k] = off+k-cind;
5863552f7358SJed Brown         }
5864552f7358SJed Brown       }
5865552f7358SJed Brown     } else {
5866552f7358SJed Brown       for (k = 0; k < dof; ++k) {
5867552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
5868552f7358SJed Brown           /* Insert check for returning constrained indices */
5869e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = -(off+k+1);
5870552f7358SJed Brown           ++cind;
5871552f7358SJed Brown         } else {
5872e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = off+k-cind;
5873552f7358SJed Brown         }
5874552f7358SJed Brown       }
5875552f7358SJed Brown     }
5876552f7358SJed Brown   }
5877e6ccafaeSMatthew G Knepley   *loff += dof;
5878552f7358SJed Brown   PetscFunctionReturn(0);
5879552f7358SJed Brown }
5880552f7358SJed Brown 
5881552f7358SJed Brown #undef __FUNCT__
5882552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private"
5883552f7358SJed Brown /* . off - The global offset of this point */
5884a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[])
5885a6dfd86eSKarl Rupp {
5886552f7358SJed Brown   PetscInt       numFields, foff, f;
5887552f7358SJed Brown   PetscErrorCode ierr;
5888552f7358SJed Brown 
5889552f7358SJed Brown   PetscFunctionBegin;
5890552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
5891552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
5892552f7358SJed Brown     PetscInt        fdof, fcomp, cfdof;
5893552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
5894552f7358SJed Brown     PetscInt        cind = 0, k, c;
5895552f7358SJed Brown 
5896552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
5897552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
5898552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr);
5899552f7358SJed Brown     if (!cfdof || setBC) {
5900552f7358SJed Brown       if (orientation >= 0) {
59010d644c17SKarl Rupp         for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k;
5902552f7358SJed Brown       } else {
5903552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5904552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5905552f7358SJed Brown             indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c;
5906552f7358SJed Brown           }
5907552f7358SJed Brown         }
5908552f7358SJed Brown       }
5909552f7358SJed Brown     } else {
5910552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
5911552f7358SJed Brown       if (orientation >= 0) {
5912552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
5913552f7358SJed Brown           if ((cind < cfdof) && (k == fcdofs[cind])) {
5914552f7358SJed Brown             indices[foffs[f]+k] = -(off+foff+k+1);
5915552f7358SJed Brown             ++cind;
5916552f7358SJed Brown           } else {
5917552f7358SJed Brown             indices[foffs[f]+k] = off+foff+k-cind;
5918552f7358SJed Brown           }
5919552f7358SJed Brown         }
5920552f7358SJed Brown       } else {
5921552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
5922552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
5923552f7358SJed Brown             if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) {
5924552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1);
5925552f7358SJed Brown               ++cind;
5926552f7358SJed Brown             } else {
5927552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind;
5928552f7358SJed Brown             }
5929552f7358SJed Brown           }
5930552f7358SJed Brown         }
5931552f7358SJed Brown       }
5932552f7358SJed Brown     }
5933552f7358SJed Brown     foff     += fdof - cfdof;
5934552f7358SJed Brown     foffs[f] += fdof;
5935552f7358SJed Brown   }
5936552f7358SJed Brown   PetscFunctionReturn(0);
5937552f7358SJed Brown }
5938552f7358SJed Brown 
5939552f7358SJed Brown #undef __FUNCT__
5940552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure"
59417f5d1fdeSMatthew G. Knepley /*@C
59427f5d1fdeSMatthew G. Knepley   DMPlexMatSetClosure - Set an array of the values on the closure of 'point'
59437f5d1fdeSMatthew G. Knepley 
59447f5d1fdeSMatthew G. Knepley   Not collective
59457f5d1fdeSMatthew G. Knepley 
59467f5d1fdeSMatthew G. Knepley   Input Parameters:
59477f5d1fdeSMatthew G. Knepley + dm - The DM
59483dc93601SMatthew G. Knepley . section - The section describing the layout in v
59493dc93601SMatthew G. Knepley . globalSection - The section describing the layout in v
59507f5d1fdeSMatthew G. Knepley . A - The matrix
59517f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM
59527f5d1fdeSMatthew G. Knepley . values - The array of values
59537f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
59547f5d1fdeSMatthew G. Knepley 
59557f5d1fdeSMatthew G. Knepley   Fortran Notes:
59567f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
59577f5d1fdeSMatthew G. Knepley 
59587f5d1fdeSMatthew G. Knepley   Level: intermediate
59597f5d1fdeSMatthew G. Knepley 
59607f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure()
59617f5d1fdeSMatthew G. Knepley @*/
59627c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
5963552f7358SJed Brown {
5964552f7358SJed Brown   DM_Plex       *mesh   = (DM_Plex*) dm->data;
59650298fd71SBarry Smith   PetscInt      *points = NULL;
5966552f7358SJed Brown   PetscInt      *indices;
5967552f7358SJed Brown   PetscInt       offsets[32];
5968552f7358SJed Brown   PetscInt       numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f;
5969552f7358SJed Brown   PetscErrorCode ierr;
5970552f7358SJed Brown 
5971552f7358SJed Brown   PetscFunctionBegin;
5972552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
59733dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
59743dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3);
59753dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 4);
5976552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
597782f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5978552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5979552f7358SJed Brown   ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
5980552f7358SJed Brown   /* Compress out points not in the section */
5981552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
5982552f7358SJed Brown   for (p = 0, q = 0; p < numPoints*2; p += 2) {
5983552f7358SJed Brown     if ((points[p] >= pStart) && (points[p] < pEnd)) {
5984552f7358SJed Brown       points[q*2]   = points[p];
5985552f7358SJed Brown       points[q*2+1] = points[p+1];
5986552f7358SJed Brown       ++q;
5987552f7358SJed Brown     }
5988552f7358SJed Brown   }
5989552f7358SJed Brown   numPoints = q;
5990552f7358SJed Brown   for (p = 0, numIndices = 0; p < numPoints*2; p += 2) {
5991552f7358SJed Brown     PetscInt fdof;
5992552f7358SJed Brown 
5993552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
5994552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
5995552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
5996552f7358SJed Brown       offsets[f+1] += fdof;
5997552f7358SJed Brown     }
5998552f7358SJed Brown     numIndices += dof;
5999552f7358SJed Brown   }
60000d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
60010d644c17SKarl Rupp 
600282f516ccSBarry Smith   if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices);
6003552f7358SJed Brown   ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
6004552f7358SJed Brown   if (numFields) {
6005552f7358SJed Brown     for (p = 0; p < numPoints*2; p += 2) {
6006552f7358SJed Brown       PetscInt o = points[p+1];
6007552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
6008552f7358SJed Brown       indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices);
6009552f7358SJed Brown     }
6010552f7358SJed Brown   } else {
6011e6ccafaeSMatthew G Knepley     for (p = 0, off = 0; p < numPoints*2; p += 2) {
6012552f7358SJed Brown       PetscInt o = points[p+1];
6013552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
6014e6ccafaeSMatthew G Knepley       indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices);
6015552f7358SJed Brown     }
6016552f7358SJed Brown   }
601777a6746dSMatthew G Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr);}
6018552f7358SJed Brown   ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode);
6019552f7358SJed Brown   if (ierr) {
6020552f7358SJed Brown     PetscMPIInt    rank;
6021552f7358SJed Brown     PetscErrorCode ierr2;
6022552f7358SJed Brown 
602382f516ccSBarry Smith     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
602477a6746dSMatthew G Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
602577a6746dSMatthew G Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, values);CHKERRQ(ierr2);
60266a415b8fSMatthew G Knepley     ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2);
6027552f7358SJed Brown     CHKERRQ(ierr);
6028552f7358SJed Brown   }
6029552f7358SJed Brown   ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
6030552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
6031552f7358SJed Brown   PetscFunctionReturn(0);
6032552f7358SJed Brown }
6033552f7358SJed Brown 
6034552f7358SJed Brown #undef __FUNCT__
6035770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds"
6036f96281f8SMatthew G. Knepley /*@
6037f96281f8SMatthew G. Knepley   DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid
6038f96281f8SMatthew G. Knepley 
6039f96281f8SMatthew G. Knepley   Input Parameter:
6040f96281f8SMatthew G. Knepley . dm - The DMPlex object
6041f96281f8SMatthew G. Knepley 
6042f96281f8SMatthew G. Knepley   Output Parameters:
6043f96281f8SMatthew G. Knepley + cMax - The first hybrid cell
6044f96281f8SMatthew G. Knepley . cMax - The first hybrid face
6045f96281f8SMatthew G. Knepley . cMax - The first hybrid edge
6046f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex
6047f96281f8SMatthew G. Knepley 
6048f96281f8SMatthew G. Knepley   Level: developer
6049f96281f8SMatthew G. Knepley 
6050f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh()
6051f96281f8SMatthew G. Knepley @*/
6052770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax)
6053552f7358SJed Brown {
6054552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
6055770b213bSMatthew G Knepley   PetscInt       dim;
6056770b213bSMatthew G Knepley   PetscErrorCode ierr;
6057552f7358SJed Brown 
6058552f7358SJed Brown   PetscFunctionBegin;
6059552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6060770b213bSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
6061770b213bSMatthew G Knepley   if (cMax) *cMax = mesh->hybridPointMax[dim];
6062770b213bSMatthew G Knepley   if (fMax) *fMax = mesh->hybridPointMax[dim-1];
6063770b213bSMatthew G Knepley   if (eMax) *eMax = mesh->hybridPointMax[1];
6064770b213bSMatthew G Knepley   if (vMax) *vMax = mesh->hybridPointMax[0];
6065552f7358SJed Brown   PetscFunctionReturn(0);
6066552f7358SJed Brown }
6067552f7358SJed Brown 
6068552f7358SJed Brown #undef __FUNCT__
6069770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds"
6070770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax)
6071552f7358SJed Brown {
6072552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
6073770b213bSMatthew G Knepley   PetscInt       dim;
6074770b213bSMatthew G Knepley   PetscErrorCode ierr;
6075552f7358SJed Brown 
6076552f7358SJed Brown   PetscFunctionBegin;
6077552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6078770b213bSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
6079770b213bSMatthew G Knepley   if (cMax >= 0) mesh->hybridPointMax[dim]   = cMax;
6080770b213bSMatthew G Knepley   if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax;
6081770b213bSMatthew G Knepley   if (eMax >= 0) mesh->hybridPointMax[1]     = eMax;
6082770b213bSMatthew G Knepley   if (vMax >= 0) mesh->hybridPointMax[0]     = vMax;
6083552f7358SJed Brown   PetscFunctionReturn(0);
6084552f7358SJed Brown }
6085552f7358SJed Brown 
6086552f7358SJed Brown #undef __FUNCT__
6087552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight"
6088552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight)
6089552f7358SJed Brown {
6090552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
6091552f7358SJed Brown 
6092552f7358SJed Brown   PetscFunctionBegin;
6093552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6094552f7358SJed Brown   PetscValidPointer(cellHeight, 2);
6095552f7358SJed Brown   *cellHeight = mesh->vtkCellHeight;
6096552f7358SJed Brown   PetscFunctionReturn(0);
6097552f7358SJed Brown }
6098552f7358SJed Brown 
6099552f7358SJed Brown #undef __FUNCT__
6100552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight"
6101552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight)
6102552f7358SJed Brown {
6103552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
6104552f7358SJed Brown 
6105552f7358SJed Brown   PetscFunctionBegin;
6106552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6107552f7358SJed Brown   mesh->vtkCellHeight = cellHeight;
6108552f7358SJed Brown   PetscFunctionReturn(0);
6109552f7358SJed Brown }
6110552f7358SJed Brown 
6111552f7358SJed Brown #undef __FUNCT__
6112552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private"
6113552f7358SJed Brown /* We can easily have a form that takes an IS instead */
6114552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering)
6115552f7358SJed Brown {
6116552f7358SJed Brown   PetscSection   section, globalSection;
6117552f7358SJed Brown   PetscInt      *numbers, p;
6118552f7358SJed Brown   PetscErrorCode ierr;
6119552f7358SJed Brown 
6120552f7358SJed Brown   PetscFunctionBegin;
612182f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
6122552f7358SJed Brown   ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr);
6123552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
6124552f7358SJed Brown     ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr);
6125552f7358SJed Brown   }
6126552f7358SJed Brown   ierr = PetscSectionSetUp(section);CHKERRQ(ierr);
6127552f7358SJed Brown   ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr);
6128552f7358SJed Brown   ierr = PetscMalloc((pEnd - pStart) * sizeof(PetscInt), &numbers);CHKERRQ(ierr);
6129552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
6130552f7358SJed Brown     ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr);
6131552f7358SJed Brown   }
613282f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr);
6133552f7358SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
6134552f7358SJed Brown   ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr);
6135552f7358SJed Brown   PetscFunctionReturn(0);
6136552f7358SJed Brown }
6137552f7358SJed Brown 
6138552f7358SJed Brown #undef __FUNCT__
6139552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering"
6140552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers)
6141552f7358SJed Brown {
6142552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
6143552f7358SJed Brown   PetscInt       cellHeight, cStart, cEnd, cMax;
6144552f7358SJed Brown   PetscErrorCode ierr;
6145552f7358SJed Brown 
6146552f7358SJed Brown   PetscFunctionBegin;
6147552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6148552f7358SJed Brown   if (!mesh->globalCellNumbers) {
6149552f7358SJed Brown     ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr);
6150552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
61510298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
61520d644c17SKarl Rupp     if (cMax >= 0) cEnd = PetscMin(cEnd, cMax);
6153552f7358SJed Brown     ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr);
6154552f7358SJed Brown   }
6155552f7358SJed Brown   *globalCellNumbers = mesh->globalCellNumbers;
6156552f7358SJed Brown   PetscFunctionReturn(0);
6157552f7358SJed Brown }
6158552f7358SJed Brown 
6159552f7358SJed Brown #undef __FUNCT__
6160552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering"
6161552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers)
6162552f7358SJed Brown {
6163552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
6164552f7358SJed Brown   PetscInt       vStart, vEnd, vMax;
6165552f7358SJed Brown   PetscErrorCode ierr;
6166552f7358SJed Brown 
6167552f7358SJed Brown   PetscFunctionBegin;
6168552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6169552f7358SJed Brown   if (!mesh->globalVertexNumbers) {
6170552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
61710298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr);
61720d644c17SKarl Rupp     if (vMax >= 0) vEnd = PetscMin(vEnd, vMax);
6173552f7358SJed Brown     ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr);
6174552f7358SJed Brown   }
6175552f7358SJed Brown   *globalVertexNumbers = mesh->globalVertexNumbers;
6176552f7358SJed Brown   PetscFunctionReturn(0);
6177552f7358SJed Brown }
6178552f7358SJed Brown 
6179552f7358SJed Brown 
6180552f7358SJed Brown #undef __FUNCT__
6181552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel"
6182552f7358SJed Brown /*@C
6183552f7358SJed Brown   PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using
6184552f7358SJed Brown   the local section and an SF describing the section point overlap.
6185552f7358SJed Brown 
6186552f7358SJed Brown   Input Parameters:
6187552f7358SJed Brown   + s - The PetscSection for the local field layout
6188552f7358SJed Brown   . sf - The SF describing parallel layout of the section points
6189552f7358SJed Brown   . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs
6190552f7358SJed Brown   . label - The label specifying the points
6191552f7358SJed Brown   - labelValue - The label stratum specifying the points
6192552f7358SJed Brown 
6193552f7358SJed Brown   Output Parameter:
6194552f7358SJed Brown   . gsection - The PetscSection for the global field layout
6195552f7358SJed Brown 
6196552f7358SJed Brown   Note: This gives negative sizes and offsets to points not owned by this process
6197552f7358SJed Brown 
6198552f7358SJed Brown   Level: developer
6199552f7358SJed Brown 
6200552f7358SJed Brown .seealso: PetscSectionCreate()
6201552f7358SJed Brown @*/
6202552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection)
6203552f7358SJed Brown {
62047ec39499SMatthew G. Knepley   PetscInt      *neg = NULL, *tmpOff = NULL;
6205552f7358SJed Brown   PetscInt       pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots;
6206552f7358SJed Brown   PetscErrorCode ierr;
6207552f7358SJed Brown 
6208552f7358SJed Brown   PetscFunctionBegin;
6209552f7358SJed Brown   ierr = PetscSectionCreate(s->atlasLayout.comm, gsection);CHKERRQ(ierr);
6210552f7358SJed Brown   ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr);
6211552f7358SJed Brown   ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr);
62127ec39499SMatthew G. Knepley   ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr);
62137ec39499SMatthew G. Knepley   if (nroots >= 0) {
62147ec39499SMatthew G. Knepley     if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart);
62157ec39499SMatthew G. Knepley     ierr = PetscMalloc(nroots * sizeof(PetscInt), &neg);CHKERRQ(ierr);
62167ec39499SMatthew G. Knepley     ierr = PetscMemzero(neg, nroots * sizeof(PetscInt));CHKERRQ(ierr);
62177ec39499SMatthew G. Knepley     if (nroots > pEnd-pStart) {
62187ec39499SMatthew G. Knepley       ierr = PetscMalloc(nroots * sizeof(PetscInt), &tmpOff);CHKERRQ(ierr);
62197ec39499SMatthew G. Knepley       ierr = PetscMemzero(tmpOff, nroots * sizeof(PetscInt));CHKERRQ(ierr);
62207ec39499SMatthew G. Knepley     } else {
62217ec39499SMatthew G. Knepley       tmpOff = &(*gsection)->atlasDof[-pStart];
62227ec39499SMatthew G. Knepley     }
62237ec39499SMatthew G. Knepley   }
6224552f7358SJed Brown   /* Mark ghost points with negative dof */
6225552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
6226552f7358SJed Brown     PetscInt value;
6227552f7358SJed Brown 
6228552f7358SJed Brown     ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr);
6229552f7358SJed Brown     if (value != labelValue) continue;
6230552f7358SJed Brown     ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr);
6231552f7358SJed Brown     ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr);
6232552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr);
6233552f7358SJed Brown     if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);}
62347ec39499SMatthew G. Knepley     if (neg) neg[p] = -(dof+1);
6235552f7358SJed Brown   }
6236552f7358SJed Brown   ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr);
6237552f7358SJed Brown   if (nroots >= 0) {
62387ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
62397ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
6240552f7358SJed Brown     if (nroots > pEnd-pStart) {
62417ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];}
6242552f7358SJed Brown     }
6243552f7358SJed Brown   }
6244552f7358SJed Brown   /* Calculate new sizes, get proccess offset, and calculate point offsets */
6245552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
6246552f7358SJed Brown     cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0;
6247552f7358SJed Brown     (*gsection)->atlasOff[p] = off;
6248552f7358SJed Brown     off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0;
6249552f7358SJed Brown   }
6250552f7358SJed Brown   ierr       = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, s->atlasLayout.comm);CHKERRQ(ierr);
6251552f7358SJed Brown   globalOff -= off;
6252552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
6253552f7358SJed Brown     (*gsection)->atlasOff[p] += globalOff;
62547ec39499SMatthew G. Knepley     if (neg) neg[p] = -((*gsection)->atlasOff[p]+1);
6255552f7358SJed Brown   }
6256552f7358SJed Brown   /* Put in negative offsets for ghost points */
6257552f7358SJed Brown   if (nroots >= 0) {
62587ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
62597ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
6260552f7358SJed Brown     if (nroots > pEnd-pStart) {
62617ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];}
6262552f7358SJed Brown     }
6263552f7358SJed Brown   }
62647ec39499SMatthew G. Knepley   if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);}
6265552f7358SJed Brown   ierr = PetscFree(neg);CHKERRQ(ierr);
6266552f7358SJed Brown   PetscFunctionReturn(0);
6267552f7358SJed Brown }
6268ca8062c8SMatthew G. Knepley 
6269ca8062c8SMatthew G. Knepley #undef __FUNCT__
6270ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry"
6271ca8062c8SMatthew G. Knepley /*@
6272ca8062c8SMatthew G. Knepley   DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric.
6273ca8062c8SMatthew G. Knepley 
6274ca8062c8SMatthew G. Knepley   Input Parameters:
6275ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
6276ca8062c8SMatthew G. Knepley 
6277ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
6278ca8062c8SMatthew G. Knepley 
6279ca8062c8SMatthew G. Knepley   Level: developer
6280ca8062c8SMatthew G. Knepley 
6281*9bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces()
6282ca8062c8SMatthew G. Knepley @*/
6283ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm)
6284ca8062c8SMatthew G. Knepley {
6285ca8062c8SMatthew G. Knepley   PetscSection    coneSection, supportSection;
6286ca8062c8SMatthew G. Knepley   const PetscInt *cone, *support;
6287ca8062c8SMatthew G. Knepley   PetscInt        coneSize, c, supportSize, s;
6288ca8062c8SMatthew G. Knepley   PetscInt        pStart, pEnd, p, csize, ssize;
6289ca8062c8SMatthew G. Knepley   PetscErrorCode  ierr;
6290ca8062c8SMatthew G. Knepley 
6291ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
6292ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6293ca8062c8SMatthew G. Knepley   ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr);
6294ca8062c8SMatthew G. Knepley   ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr);
6295ca8062c8SMatthew G. Knepley   /* Check that point p is found in the support of its cone points, and vice versa */
6296ca8062c8SMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
6297ca8062c8SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
6298ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
6299ca8062c8SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr);
6300ca8062c8SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
6301ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr);
6302ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr);
6303ca8062c8SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
6304ca8062c8SMatthew G. Knepley         if (support[s] == p) break;
6305ca8062c8SMatthew G. Knepley       }
6306ca8062c8SMatthew G. Knepley       if (s >= supportSize) {
6307ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);
6308ca8062c8SMatthew G. Knepley         for (s = 0; s < coneSize; ++s) {
6309ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);
6310ca8062c8SMatthew G. Knepley         }
6311ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6312ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);
6313ca8062c8SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
6314ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);
6315ca8062c8SMatthew G. Knepley         }
6316ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6317ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]);
6318ca8062c8SMatthew G. Knepley       }
6319ca8062c8SMatthew G. Knepley     }
6320ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
6321ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
6322ca8062c8SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
6323ca8062c8SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
6324ca8062c8SMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
6325ca8062c8SMatthew G. Knepley       for (c = 0; c < coneSize; ++c) {
6326ca8062c8SMatthew G. Knepley         if (cone[c] == p) break;
6327ca8062c8SMatthew G. Knepley       }
6328ca8062c8SMatthew G. Knepley       if (c >= coneSize) {
6329ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);
6330ca8062c8SMatthew G. Knepley         for (c = 0; c < supportSize; ++c) {
6331ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);
6332ca8062c8SMatthew G. Knepley         }
6333ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6334ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);
6335ca8062c8SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) {
6336ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);
6337ca8062c8SMatthew G. Knepley         }
6338ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
6339ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]);
6340ca8062c8SMatthew G. Knepley       }
6341ca8062c8SMatthew G. Knepley     }
6342ca8062c8SMatthew G. Knepley   }
6343ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr);
6344ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr);
6345ca8062c8SMatthew G. Knepley   if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize);
6346ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
6347ca8062c8SMatthew G. Knepley }
6348ca8062c8SMatthew G. Knepley 
6349ca8062c8SMatthew G. Knepley #undef __FUNCT__
6350ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton"
6351ca8062c8SMatthew G. Knepley /*@
6352ca8062c8SMatthew G. Knepley   DMPlexCheckSkeleton - Check that each cell has the correct number of vertices
6353ca8062c8SMatthew G. Knepley 
6354ca8062c8SMatthew G. Knepley   Input Parameters:
6355ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
6356ca8062c8SMatthew G. Knepley 
6357ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
6358ca8062c8SMatthew G. Knepley 
6359ca8062c8SMatthew G. Knepley   Level: developer
6360ca8062c8SMatthew G. Knepley 
6361*9bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces()
6362ca8062c8SMatthew G. Knepley @*/
6363ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex)
6364ca8062c8SMatthew G. Knepley {
6365ca8062c8SMatthew G. Knepley   DM             udm;
6366ca8062c8SMatthew G. Knepley   PetscInt       dim, numCorners, coneSize, cStart, cEnd, cMax, c;
6367ca8062c8SMatthew G. Knepley   PetscErrorCode ierr;
6368ca8062c8SMatthew G. Knepley 
6369ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
6370ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6371ca8062c8SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
6372ca8062c8SMatthew G. Knepley   switch (dim) {
6373ca8062c8SMatthew G. Knepley   case 2: numCorners = isSimplex ? 3 : 4; break;
6374ca8062c8SMatthew G. Knepley   case 3: numCorners = isSimplex ? 4 : 8; break;
6375ca8062c8SMatthew G. Knepley   default:
6376ca8062c8SMatthew G. Knepley     SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim);
6377ca8062c8SMatthew G. Knepley   }
6378ca8062c8SMatthew G. Knepley   ierr = DMPlexUninterpolate(dm, &udm);CHKERRQ(ierr);
6379ca8062c8SMatthew G. Knepley   ierr = PetscObjectSetOptionsPrefix((PetscObject) udm, "un_");CHKERRQ(ierr);
6380ca8062c8SMatthew G. Knepley   ierr = DMSetFromOptions(udm);CHKERRQ(ierr);
6381ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
6382ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
6383ca8062c8SMatthew G. Knepley   cMax = cMax >= 0 ? cMax : cEnd;
6384ca8062c8SMatthew G. Knepley   for (c = cStart; c < cMax; ++c) {
6385ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(udm, c, &coneSize);CHKERRQ(ierr);
6386ca8062c8SMatthew G. Knepley     if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has  %d vertices != %d", c, coneSize, numCorners);
6387ca8062c8SMatthew G. Knepley   }
6388ca8062c8SMatthew G. Knepley   ierr = DMDestroy(&udm);CHKERRQ(ierr);
6389ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
6390ca8062c8SMatthew G. Knepley }
6391*9bf0dad6SMatthew G. Knepley 
6392*9bf0dad6SMatthew G. Knepley #undef __FUNCT__
6393*9bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces"
6394*9bf0dad6SMatthew G. Knepley /*@
6395*9bf0dad6SMatthew G. Knepley   DMPlexCheckFaces - Check that the faces of each cell give a vertex order this is consistent with what we expect from the cell type
6396*9bf0dad6SMatthew G. Knepley 
6397*9bf0dad6SMatthew G. Knepley   Input Parameters:
6398*9bf0dad6SMatthew G. Knepley + dm - The DMPlex object
6399*9bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
6400*9bf0dad6SMatthew G. Knepley - cellHeight - Normally 0
6401*9bf0dad6SMatthew G. Knepley 
6402*9bf0dad6SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
6403*9bf0dad6SMatthew G. Knepley 
6404*9bf0dad6SMatthew G. Knepley   Level: developer
6405*9bf0dad6SMatthew G. Knepley 
6406*9bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton()
6407*9bf0dad6SMatthew G. Knepley @*/
6408*9bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight)
6409*9bf0dad6SMatthew G. Knepley {
6410*9bf0dad6SMatthew G. Knepley   PetscInt       dim, vStart, vEnd, cStart, cEnd, cMax, c;
6411*9bf0dad6SMatthew G. Knepley   PetscErrorCode ierr;
6412*9bf0dad6SMatthew G. Knepley 
6413*9bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
6414*9bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6415*9bf0dad6SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
6416*9bf0dad6SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
6417*9bf0dad6SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
6418*9bf0dad6SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
6419*9bf0dad6SMatthew G. Knepley   cMax = cMax >= 0 ? cMax : cEnd;
6420*9bf0dad6SMatthew G. Knepley   for (c = cStart; c < cMax; ++c) {
6421*9bf0dad6SMatthew G. Knepley     const PetscInt *cone, *ornt, *faces;
6422*9bf0dad6SMatthew G. Knepley     PetscInt        numFaces, faceSize, coneSize,f;
6423*9bf0dad6SMatthew G. Knepley     PetscInt       *closure = NULL, closureSize, cl, numCorners = 0;
6424*9bf0dad6SMatthew G. Knepley 
6425*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
6426*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
6427*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr);
6428*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
6429*9bf0dad6SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
6430*9bf0dad6SMatthew G. Knepley       const PetscInt p = closure[cl];
6431*9bf0dad6SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p;
6432*9bf0dad6SMatthew G. Knepley     }
6433*9bf0dad6SMatthew G. Knepley     ierr = DMPlexGetRawFaces_Internal(dm, dim, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
6434*9bf0dad6SMatthew G. Knepley     if (coneSize != numFaces) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has %d faces but should have %d", c, coneSize, numFaces);
6435*9bf0dad6SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
6436*9bf0dad6SMatthew G. Knepley       PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v;
6437*9bf0dad6SMatthew G. Knepley 
6438*9bf0dad6SMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
6439*9bf0dad6SMatthew G. Knepley       for (cl = 0; cl < fclosureSize*2; cl += 2) {
6440*9bf0dad6SMatthew G. Knepley         const PetscInt p = fclosure[cl];
6441*9bf0dad6SMatthew G. Knepley         if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p;
6442*9bf0dad6SMatthew G. Knepley       }
6443*9bf0dad6SMatthew G. Knepley       if (fnumCorners != faceSize) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d of cell %d has %d vertices but should have %d", cone[f], c, fnumCorners, faceSize);
6444*9bf0dad6SMatthew G. Knepley       for (v = 0; v < fnumCorners; ++v) {
6445*9bf0dad6SMatthew G. Knepley         if (fclosure[v] != faces[f*faceSize+v]) SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d of cell %d vertex %d, %d != %d", cone[f], c, v, fclosure[v], faces[f*faceSize+v]);
6446*9bf0dad6SMatthew G. Knepley       }
6447*9bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
6448*9bf0dad6SMatthew G. Knepley     }
6449*9bf0dad6SMatthew G. Knepley     ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
6450*9bf0dad6SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
6451*9bf0dad6SMatthew G. Knepley   }
6452*9bf0dad6SMatthew G. Knepley   PetscFunctionReturn(0);
6453*9bf0dad6SMatthew G. Knepley }
6454