xref: /petsc/src/dm/impls/plex/plex.c (revision f8f126e8cf3a906b719c11beaa71cd5a5aeedbdd)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
2552f7358SJed Brown #include <../src/sys/utils/hash.h>
3d53a3d6fSBarry Smith #include <petsc-private/isimpl.h>
40c312b8eSJed Brown #include <petscsf.h>
5552f7358SJed Brown 
6552f7358SJed Brown /* Logging support */
71337e6e5SMatthew G. Knepley PetscLogEvent DMPLEX_Interpolate, DMPLEX_Partition, DMPLEX_Distribute, DMPLEX_DistributeCones, DMPLEX_DistributeLabels, DMPLEX_DistributeSF, DMPLEX_DistributeField, DMPLEX_DistributeData, DMPLEX_Stratify, DMPLEX_Preallocate, DMPLEX_ResidualFEM, DMPLEX_JacobianFEM;
8552f7358SJed Brown 
95a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_Seq(Vec, PetscViewer);
105a576424SJed Brown PETSC_EXTERN PetscErrorCode VecView_MPI(Vec, PetscViewer);
11552f7358SJed Brown 
12552f7358SJed Brown #undef __FUNCT__
13552f7358SJed Brown #define __FUNCT__ "VecView_Plex_Local"
14552f7358SJed Brown PetscErrorCode VecView_Plex_Local(Vec v, PetscViewer viewer)
15552f7358SJed Brown {
16552f7358SJed Brown   DM             dm;
17552f7358SJed Brown   PetscBool      isvtk;
18552f7358SJed Brown   PetscErrorCode ierr;
19552f7358SJed Brown 
20552f7358SJed Brown   PetscFunctionBegin;
21552f7358SJed Brown   ierr = VecGetDM(v, &dm);CHKERRQ(ierr);
2282f516ccSBarry Smith   if (!dm) SETERRQ(PetscObjectComm((PetscObject)v), PETSC_ERR_ARG_WRONG, "Vector not generated from a DM");
23552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERVTK, &isvtk);CHKERRQ(ierr);
24552f7358SJed Brown   if (isvtk) {
25552f7358SJed Brown     PetscViewerVTKFieldType ft = PETSC_VTK_POINT_FIELD;
26552f7358SJed Brown     PetscSection            section;
27552f7358SJed Brown     PetscInt                dim, pStart, pEnd, cStart, fStart, vStart, cdof = 0, fdof = 0, vdof = 0;
28552f7358SJed Brown 
29552f7358SJed Brown     ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
30552f7358SJed Brown     ierr = DMGetDefaultSection(dm, &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);}
2226712e2f1SBarry Smith         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*PetscRealPart(coords[off+d])));CHKERRQ(ierr);
223552f7358SJed Brown       }
224552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", v, rank, colors[rank%numColors], v);CHKERRQ(ierr);
225552f7358SJed Brown     }
226552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
227552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
228552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr);
229552f7358SJed Brown     /* Plot edges */
230552f7358SJed Brown     ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
231552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\path\n");CHKERRQ(ierr);
232552f7358SJed Brown     if (depth > 1) {ierr = DMPlexGetDepthStratum(dm, 1, &eStart, &eEnd);CHKERRQ(ierr);}
233552f7358SJed Brown     for (e = eStart; e < eEnd; ++e) {
234552f7358SJed Brown       const PetscInt *cone;
235552f7358SJed Brown       PetscInt        coneSize, offA, offB, dof, d;
236552f7358SJed Brown 
237552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, e, &coneSize);CHKERRQ(ierr);
23882f516ccSBarry Smith       if (coneSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Edge %d cone should have two vertices, not %d", e, coneSize);
239552f7358SJed Brown       ierr = DMPlexGetCone(dm, e, &cone);CHKERRQ(ierr);
240552f7358SJed Brown       ierr = PetscSectionGetDof(coordSection, cone[0], &dof);CHKERRQ(ierr);
241552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, cone[0], &offA);CHKERRQ(ierr);
242552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, cone[1], &offB);CHKERRQ(ierr);
243552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(");CHKERRQ(ierr);
244552f7358SJed Brown       for (d = 0; d < dof; ++d) {
245552f7358SJed Brown         if (d > 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, ",");CHKERRQ(ierr);}
2466712e2f1SBarry Smith         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "%g", (double)(scale*0.5*PetscRealPart(coords[offA+d]+coords[offB+d])));CHKERRQ(ierr);
247552f7358SJed Brown       }
248552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, ") node(%D_%D) [draw,shape=circle,color=%s] {%D} --\n", e, rank, colors[rank%numColors], e);CHKERRQ(ierr);
249552f7358SJed Brown     }
250552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
251552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
252552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "(0,0);\n");CHKERRQ(ierr);
253552f7358SJed Brown     /* Plot cells */
254552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
255552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
2560298fd71SBarry Smith       PetscInt *closure = NULL;
257552f7358SJed Brown       PetscInt  closureSize, firstPoint = -1;
258552f7358SJed Brown 
259552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
260552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, "\\draw[color=%s] ", colors[rank%numColors]);CHKERRQ(ierr);
261552f7358SJed Brown       for (p = 0; p < closureSize*2; p += 2) {
262552f7358SJed Brown         const PetscInt point = closure[p];
263552f7358SJed Brown 
264552f7358SJed Brown         if ((point < vStart) || (point >= vEnd)) continue;
265552f7358SJed Brown         if (firstPoint >= 0) {ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- ");CHKERRQ(ierr);}
266552f7358SJed Brown         ierr = PetscViewerASCIISynchronizedPrintf(viewer, "(%D_%D)", point, rank);CHKERRQ(ierr);
267552f7358SJed Brown         if (firstPoint < 0) firstPoint = point;
268552f7358SJed Brown       }
269552f7358SJed Brown       /* Why doesn't this work? ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- cycle;\n");CHKERRQ(ierr); */
270552f7358SJed Brown       ierr = PetscViewerASCIISynchronizedPrintf(viewer, " -- (%D_%D);\n", firstPoint, rank);CHKERRQ(ierr);
271552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
272552f7358SJed Brown     }
273552f7358SJed Brown     ierr = PetscViewerFlush(viewer);CHKERRQ(ierr);
274552f7358SJed Brown     ierr = PetscViewerASCIIPrintf(viewer, "\\end{tikzpicture}\n\\end{center}\n");CHKERRQ(ierr);
275770b213bSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\\end{document}\n", name);CHKERRQ(ierr);
276552f7358SJed Brown   } else {
27782f516ccSBarry Smith     MPI_Comm    comm;
278834065abSMatthew G. Knepley     PetscInt   *sizes, *hybsizes;
279834065abSMatthew G. Knepley     PetscInt    locDepth, depth, dim, d, pMax[4];
280552f7358SJed Brown     PetscInt    pStart, pEnd, p;
281a57dd577SMatthew G Knepley     PetscInt    numLabels, l;
2821143a3c0SMatthew G. Knepley     const char *name;
283552f7358SJed Brown     PetscMPIInt size;
284552f7358SJed Brown 
28582f516ccSBarry Smith     ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
286552f7358SJed Brown     ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr);
287552f7358SJed Brown     ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2885f64d76eSMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) dm, &name);CHKERRQ(ierr);
2891143a3c0SMatthew G. Knepley     if (name) {ierr = PetscViewerASCIIPrintf(viewer, "%s in %D dimensions:\n", name, dim);CHKERRQ(ierr);}
2901143a3c0SMatthew G. Knepley     else      {ierr = PetscViewerASCIIPrintf(viewer, "Mesh in %D dimensions:\n", dim);CHKERRQ(ierr);}
291552f7358SJed Brown     ierr = DMPlexGetDepth(dm, &locDepth);CHKERRQ(ierr);
292552f7358SJed Brown     ierr = MPI_Allreduce(&locDepth, &depth, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
293834065abSMatthew G. Knepley     ierr = DMPlexGetHybridBounds(dm, &pMax[depth], &pMax[depth-1], &pMax[1], &pMax[0]);CHKERRQ(ierr);
294dcca6d9dSJed Brown     ierr = PetscMalloc2(size,&sizes,size,&hybsizes);CHKERRQ(ierr);
295552f7358SJed Brown     if (depth == 1) {
296552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr);
297552f7358SJed Brown       pEnd = pEnd - pStart;
298552f7358SJed Brown       ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
299552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", 0);CHKERRQ(ierr);
300552f7358SJed Brown       for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
301552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
302552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);CHKERRQ(ierr);
303552f7358SJed Brown       pEnd = pEnd - pStart;
304552f7358SJed Brown       ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
305552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", dim);CHKERRQ(ierr);
306552f7358SJed Brown       for (p = 0; p < size; ++p) {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
307552f7358SJed Brown       ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
308552f7358SJed Brown     } else {
309552f7358SJed Brown       for (d = 0; d <= dim; d++) {
310552f7358SJed Brown         ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
311834065abSMatthew G. Knepley         pEnd    -= pStart;
312834065abSMatthew G. Knepley         pMax[d] -= pStart;
313552f7358SJed Brown         ierr = MPI_Gather(&pEnd, 1, MPIU_INT, sizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
314834065abSMatthew G. Knepley         ierr = MPI_Gather(&pMax[d], 1, MPIU_INT, hybsizes, 1, MPIU_INT, 0, comm);CHKERRQ(ierr);
315552f7358SJed Brown         ierr = PetscViewerASCIIPrintf(viewer, "  %D-cells:", d);CHKERRQ(ierr);
316834065abSMatthew G. Knepley         for (p = 0; p < size; ++p) {
317834065abSMatthew G. Knepley           if (hybsizes[p] >= 0) {ierr = PetscViewerASCIIPrintf(viewer, " %D (%D)", sizes[p], sizes[p] - hybsizes[p]);CHKERRQ(ierr);}
318834065abSMatthew G. Knepley           else                  {ierr = PetscViewerASCIIPrintf(viewer, " %D", sizes[p]);CHKERRQ(ierr);}
319834065abSMatthew G. Knepley         }
320552f7358SJed Brown         ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
321552f7358SJed Brown       }
322552f7358SJed Brown     }
323834065abSMatthew G. Knepley     ierr = PetscFree2(sizes,hybsizes);CHKERRQ(ierr);
324a57dd577SMatthew G Knepley     ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
325a57dd577SMatthew G Knepley     if (numLabels) {ierr = PetscViewerASCIIPrintf(viewer, "Labels:\n");CHKERRQ(ierr);}
326a57dd577SMatthew G Knepley     for (l = 0; l < numLabels; ++l) {
327a57dd577SMatthew G Knepley       DMLabel         label;
328a57dd577SMatthew G Knepley       const char     *name;
329a57dd577SMatthew G Knepley       IS              valueIS;
330a57dd577SMatthew G Knepley       const PetscInt *values;
331a57dd577SMatthew G Knepley       PetscInt        numValues, v;
332a57dd577SMatthew G Knepley 
333a57dd577SMatthew G Knepley       ierr = DMPlexGetLabelName(dm, l, &name);CHKERRQ(ierr);
334a57dd577SMatthew G Knepley       ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
335a57dd577SMatthew G Knepley       ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
336a57dd577SMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, "  %s: %d strata of sizes (", name, numValues);CHKERRQ(ierr);
337a57dd577SMatthew G Knepley       ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
338a57dd577SMatthew G Knepley       ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
339a57dd577SMatthew G Knepley       for (v = 0; v < numValues; ++v) {
340a57dd577SMatthew G Knepley         PetscInt size;
341a57dd577SMatthew G Knepley 
342a57dd577SMatthew G Knepley         ierr = DMLabelGetStratumSize(label, values[v], &size);CHKERRQ(ierr);
343a57dd577SMatthew G Knepley         if (v > 0) {ierr = PetscViewerASCIIPrintf(viewer, ", ");CHKERRQ(ierr);}
344a57dd577SMatthew G Knepley         ierr = PetscViewerASCIIPrintf(viewer, "%d", size);CHKERRQ(ierr);
345a57dd577SMatthew G Knepley       }
346a57dd577SMatthew G Knepley       ierr = PetscViewerASCIIPrintf(viewer, ")\n");CHKERRQ(ierr);
347a57dd577SMatthew G Knepley       ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
3484d41221fSMatthew G Knepley       ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
349a57dd577SMatthew G Knepley     }
350552f7358SJed Brown   }
351552f7358SJed Brown   PetscFunctionReturn(0);
352552f7358SJed Brown }
353552f7358SJed Brown 
354552f7358SJed Brown #undef __FUNCT__
355552f7358SJed Brown #define __FUNCT__ "DMView_Plex"
356552f7358SJed Brown PetscErrorCode DMView_Plex(DM dm, PetscViewer viewer)
357552f7358SJed Brown {
358552f7358SJed Brown   PetscBool      iascii, isbinary;
359552f7358SJed Brown   PetscErrorCode ierr;
360552f7358SJed Brown 
361552f7358SJed Brown   PetscFunctionBegin;
362552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
363552f7358SJed Brown   PetscValidHeaderSpecific(viewer, PETSC_VIEWER_CLASSID, 2);
364552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERASCII, &iascii);CHKERRQ(ierr);
365552f7358SJed Brown   ierr = PetscObjectTypeCompare((PetscObject) viewer, PETSCVIEWERBINARY, &isbinary);CHKERRQ(ierr);
366552f7358SJed Brown   if (iascii) {
367552f7358SJed Brown     ierr = DMPlexView_Ascii(dm, viewer);CHKERRQ(ierr);
368552f7358SJed Brown #if 0
369552f7358SJed Brown   } else if (isbinary) {
370552f7358SJed Brown     ierr = DMPlexView_Binary(dm, viewer);CHKERRQ(ierr);
371552f7358SJed Brown #endif
37211aeaf0aSBarry Smith   }
373552f7358SJed Brown   PetscFunctionReturn(0);
374552f7358SJed Brown }
375552f7358SJed Brown 
376552f7358SJed Brown #undef __FUNCT__
3776c73c22cSMatthew G. Knepley #define __FUNCT__ "BoundaryDestroy"
3786c73c22cSMatthew G. Knepley static PetscErrorCode BoundaryDestroy(DMBoundary *boundary)
3796c73c22cSMatthew G. Knepley {
3806c73c22cSMatthew G. Knepley   DMBoundary     b, next;
3816c73c22cSMatthew G. Knepley   PetscErrorCode ierr;
3826c73c22cSMatthew G. Knepley 
3836c73c22cSMatthew G. Knepley   PetscFunctionBeginUser;
3846c73c22cSMatthew G. Knepley   if (!boundary) PetscFunctionReturn(0);
3856c73c22cSMatthew G. Knepley   b = *boundary;
3866c73c22cSMatthew G. Knepley   *boundary = NULL;
3876c73c22cSMatthew G. Knepley   for (; b; b = next) {
3886c73c22cSMatthew G. Knepley     next = b->next;
3896c73c22cSMatthew G. Knepley     ierr = PetscFree(b->ids);CHKERRQ(ierr);
3906c73c22cSMatthew G. Knepley     ierr = PetscFree(b->name);CHKERRQ(ierr);
3916c73c22cSMatthew G. Knepley     ierr = PetscFree(b);CHKERRQ(ierr);
3926c73c22cSMatthew G. Knepley   }
3936c73c22cSMatthew G. Knepley   PetscFunctionReturn(0);
3946c73c22cSMatthew G. Knepley }
3956c73c22cSMatthew G. Knepley 
3966c73c22cSMatthew G. Knepley #undef __FUNCT__
397552f7358SJed Brown #define __FUNCT__ "DMDestroy_Plex"
398552f7358SJed Brown PetscErrorCode DMDestroy_Plex(DM dm)
399552f7358SJed Brown {
400552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
401552f7358SJed Brown   DMLabel        next  = mesh->labels;
402552f7358SJed Brown   PetscErrorCode ierr;
403552f7358SJed Brown 
404552f7358SJed Brown   PetscFunctionBegin;
4050d644c17SKarl Rupp   if (--mesh->refct > 0) PetscFunctionReturn(0);
406552f7358SJed Brown   ierr = PetscSectionDestroy(&mesh->coneSection);CHKERRQ(ierr);
407552f7358SJed Brown   ierr = PetscFree(mesh->cones);CHKERRQ(ierr);
408552f7358SJed Brown   ierr = PetscFree(mesh->coneOrientations);CHKERRQ(ierr);
409552f7358SJed Brown   ierr = PetscSectionDestroy(&mesh->supportSection);CHKERRQ(ierr);
410552f7358SJed Brown   ierr = PetscFree(mesh->supports);CHKERRQ(ierr);
411552f7358SJed Brown   ierr = PetscFree(mesh->facesTmp);CHKERRQ(ierr);
412552f7358SJed Brown   while (next) {
413552f7358SJed Brown     DMLabel tmp = next->next;
414552f7358SJed Brown 
415552f7358SJed Brown     ierr = DMLabelDestroy(&next);CHKERRQ(ierr);
416552f7358SJed Brown     next = tmp;
417552f7358SJed Brown   }
4183913d7c8SMatthew G. Knepley   ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr);
419a89082eeSMatthew G Knepley   ierr = DMLabelDestroy(&mesh->subpointMap);CHKERRQ(ierr);
420552f7358SJed Brown   ierr = ISDestroy(&mesh->globalVertexNumbers);CHKERRQ(ierr);
421552f7358SJed Brown   ierr = ISDestroy(&mesh->globalCellNumbers);CHKERRQ(ierr);
4226c73c22cSMatthew G. Knepley   ierr = BoundaryDestroy(&mesh->boundary);CHKERRQ(ierr);
423552f7358SJed Brown   /* This was originally freed in DMDestroy(), but that prevents reference counting of backend objects */
424552f7358SJed Brown   ierr = PetscFree(mesh);CHKERRQ(ierr);
425552f7358SJed Brown   PetscFunctionReturn(0);
426552f7358SJed Brown }
427552f7358SJed Brown 
428552f7358SJed Brown #undef __FUNCT__
429552f7358SJed Brown #define __FUNCT__ "DMCreateMatrix_Plex"
430b412c318SBarry Smith PetscErrorCode DMCreateMatrix_Plex(DM dm, Mat *J)
431552f7358SJed Brown {
432552f7358SJed Brown   PetscSection   section, sectionGlobal;
433552f7358SJed Brown   PetscInt       bs = -1;
434552f7358SJed Brown   PetscInt       localSize;
43589545effSMatthew G. Knepley   PetscBool      isShell, isBlock, isSeqBlock, isMPIBlock, isSymBlock, isSymSeqBlock, isSymMPIBlock;
436552f7358SJed Brown   PetscErrorCode ierr;
437b412c318SBarry Smith   MatType        mtype;
438552f7358SJed Brown 
439552f7358SJed Brown   PetscFunctionBegin;
440607a6623SBarry Smith   ierr = MatInitializePackage();CHKERRQ(ierr);
441b412c318SBarry Smith   mtype = dm->mattype;
442552f7358SJed Brown   ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);
443552f7358SJed Brown   ierr = DMGetDefaultGlobalSection(dm, &sectionGlobal);CHKERRQ(ierr);
444552f7358SJed Brown   /* ierr = PetscSectionGetStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr); */
445552f7358SJed Brown   ierr = PetscSectionGetConstrainedStorageSize(sectionGlobal, &localSize);CHKERRQ(ierr);
44682f516ccSBarry Smith   ierr = MatCreate(PetscObjectComm((PetscObject)dm), J);CHKERRQ(ierr);
447552f7358SJed Brown   ierr = MatSetSizes(*J, localSize, localSize, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
448552f7358SJed Brown   ierr = MatSetType(*J, mtype);CHKERRQ(ierr);
449552f7358SJed Brown   ierr = MatSetFromOptions(*J);CHKERRQ(ierr);
450552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSHELL, &isShell);CHKERRQ(ierr);
451552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATBAIJ, &isBlock);CHKERRQ(ierr);
452552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQBAIJ, &isSeqBlock);CHKERRQ(ierr);
453552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPIBAIJ, &isMPIBlock);CHKERRQ(ierr);
454552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSBAIJ, &isSymBlock);CHKERRQ(ierr);
455552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATSEQSBAIJ, &isSymSeqBlock);CHKERRQ(ierr);
456552f7358SJed Brown   ierr = PetscStrcmp(mtype, MATMPISBAIJ, &isSymMPIBlock);CHKERRQ(ierr);
457552f7358SJed Brown   if (!isShell) {
458552f7358SJed Brown     PetscBool fillMatrix = (PetscBool) !dm->prealloc_only;
4592a28c762SMatthew G Knepley     PetscInt *dnz, *onz, *dnzu, *onzu, bsLocal, bsMax, bsMin;
460552f7358SJed Brown 
461552f7358SJed Brown     if (bs < 0) {
462552f7358SJed Brown       if (isBlock || isSeqBlock || isMPIBlock || isSymBlock || isSymSeqBlock || isSymMPIBlock) {
463fad22124SMatthew G Knepley         PetscInt pStart, pEnd, p, dof, cdof;
464552f7358SJed Brown 
465552f7358SJed Brown         ierr = PetscSectionGetChart(sectionGlobal, &pStart, &pEnd);CHKERRQ(ierr);
466552f7358SJed Brown         for (p = pStart; p < pEnd; ++p) {
467552f7358SJed Brown           ierr = PetscSectionGetDof(sectionGlobal, p, &dof);CHKERRQ(ierr);
468fad22124SMatthew G Knepley           ierr = PetscSectionGetConstraintDof(sectionGlobal, p, &cdof);CHKERRQ(ierr);
469fad22124SMatthew G Knepley           if (dof-cdof) {
4702a28c762SMatthew G Knepley             if (bs < 0) {
471fad22124SMatthew G Knepley               bs = dof-cdof;
472fad22124SMatthew G Knepley             } else if (bs != dof-cdof) {
4732a28c762SMatthew G Knepley               /* Layout does not admit a pointwise block size */
4742a28c762SMatthew G Knepley               bs = 1;
475552f7358SJed Brown               break;
476552f7358SJed Brown             }
477552f7358SJed Brown           }
4782a28c762SMatthew G Knepley         }
4792a28c762SMatthew G Knepley         /* Must have same blocksize on all procs (some might have no points) */
4802a28c762SMatthew G Knepley         bsLocal = bs;
48182f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMax, 1, MPIU_INT, MPI_MAX, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
4822a28c762SMatthew G Knepley         bsLocal = bs < 0 ? bsMax : bs;
48382f516ccSBarry Smith         ierr = MPI_Allreduce(&bsLocal, &bsMin, 1, MPIU_INT, MPI_MIN, PetscObjectComm((PetscObject)dm));CHKERRQ(ierr);
4842a28c762SMatthew G Knepley         if (bsMin != bsMax) {
4852a28c762SMatthew G Knepley           bs = 1;
4862a28c762SMatthew G Knepley         } else {
4872a28c762SMatthew G Knepley           bs = bsMax;
4882a28c762SMatthew G Knepley         }
489552f7358SJed Brown       } else {
490552f7358SJed Brown         bs = 1;
491552f7358SJed Brown       }
492552f7358SJed Brown     }
4931795a4d1SJed Brown     ierr = PetscCalloc4(localSize/bs, &dnz, localSize/bs, &onz, localSize/bs, &dnzu, localSize/bs, &onzu);CHKERRQ(ierr);
494552f7358SJed Brown     ierr = DMPlexPreallocateOperator(dm, bs, section, sectionGlobal, dnz, onz, dnzu, onzu, *J, fillMatrix);CHKERRQ(ierr);
495552f7358SJed Brown     ierr = PetscFree4(dnz, onz, dnzu, onzu);CHKERRQ(ierr);
496552f7358SJed Brown   }
497552f7358SJed Brown   PetscFunctionReturn(0);
498552f7358SJed Brown }
499552f7358SJed Brown 
500552f7358SJed Brown #undef __FUNCT__
501552f7358SJed Brown #define __FUNCT__ "DMPlexGetDimension"
502552f7358SJed Brown /*@
503552f7358SJed Brown   DMPlexGetDimension - Return the topological mesh dimension
504552f7358SJed Brown 
505552f7358SJed Brown   Not collective
506552f7358SJed Brown 
507552f7358SJed Brown   Input Parameter:
508552f7358SJed Brown . mesh - The DMPlex
509552f7358SJed Brown 
510552f7358SJed Brown   Output Parameter:
511552f7358SJed Brown . dim - The topological mesh dimension
512552f7358SJed Brown 
513552f7358SJed Brown   Level: beginner
514552f7358SJed Brown 
515552f7358SJed Brown .seealso: DMPlexCreate()
516552f7358SJed Brown @*/
517552f7358SJed Brown PetscErrorCode DMPlexGetDimension(DM dm, PetscInt *dim)
518552f7358SJed Brown {
519552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
520552f7358SJed Brown 
521552f7358SJed Brown   PetscFunctionBegin;
522552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
523552f7358SJed Brown   PetscValidPointer(dim, 2);
524552f7358SJed Brown   *dim = mesh->dim;
525552f7358SJed Brown   PetscFunctionReturn(0);
526552f7358SJed Brown }
527552f7358SJed Brown 
528552f7358SJed Brown #undef __FUNCT__
529552f7358SJed Brown #define __FUNCT__ "DMPlexSetDimension"
530552f7358SJed Brown /*@
531552f7358SJed Brown   DMPlexSetDimension - Set the topological mesh dimension
532552f7358SJed Brown 
533552f7358SJed Brown   Collective on mesh
534552f7358SJed Brown 
535552f7358SJed Brown   Input Parameters:
536552f7358SJed Brown + mesh - The DMPlex
537552f7358SJed Brown - dim - The topological mesh dimension
538552f7358SJed Brown 
539552f7358SJed Brown   Level: beginner
540552f7358SJed Brown 
541552f7358SJed Brown .seealso: DMPlexCreate()
542552f7358SJed Brown @*/
543552f7358SJed Brown PetscErrorCode DMPlexSetDimension(DM dm, PetscInt dim)
544552f7358SJed Brown {
545552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
546552f7358SJed Brown 
547552f7358SJed Brown   PetscFunctionBegin;
548552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
549552f7358SJed Brown   PetscValidLogicalCollectiveInt(dm, dim, 2);
550552f7358SJed Brown   mesh->dim = dim;
551552f7358SJed Brown   PetscFunctionReturn(0);
552552f7358SJed Brown }
553552f7358SJed Brown 
554552f7358SJed Brown #undef __FUNCT__
555552f7358SJed Brown #define __FUNCT__ "DMPlexGetChart"
556552f7358SJed Brown /*@
557552f7358SJed Brown   DMPlexGetChart - Return the interval for all mesh points [pStart, pEnd)
558552f7358SJed Brown 
559552f7358SJed Brown   Not collective
560552f7358SJed Brown 
561552f7358SJed Brown   Input Parameter:
562552f7358SJed Brown . mesh - The DMPlex
563552f7358SJed Brown 
564552f7358SJed Brown   Output Parameters:
565552f7358SJed Brown + pStart - The first mesh point
566552f7358SJed Brown - pEnd   - The upper bound for mesh points
567552f7358SJed Brown 
568552f7358SJed Brown   Level: beginner
569552f7358SJed Brown 
570552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart()
571552f7358SJed Brown @*/
572552f7358SJed Brown PetscErrorCode DMPlexGetChart(DM dm, PetscInt *pStart, PetscInt *pEnd)
573552f7358SJed Brown {
574552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
575552f7358SJed Brown   PetscErrorCode ierr;
576552f7358SJed Brown 
577552f7358SJed Brown   PetscFunctionBegin;
578552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
579552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
580552f7358SJed Brown   PetscFunctionReturn(0);
581552f7358SJed Brown }
582552f7358SJed Brown 
583552f7358SJed Brown #undef __FUNCT__
584552f7358SJed Brown #define __FUNCT__ "DMPlexSetChart"
585552f7358SJed Brown /*@
586552f7358SJed Brown   DMPlexSetChart - Set the interval for all mesh points [pStart, pEnd)
587552f7358SJed Brown 
588552f7358SJed Brown   Not collective
589552f7358SJed Brown 
590552f7358SJed Brown   Input Parameters:
591552f7358SJed Brown + mesh - The DMPlex
592552f7358SJed Brown . pStart - The first mesh point
593552f7358SJed Brown - pEnd   - The upper bound for mesh points
594552f7358SJed Brown 
595552f7358SJed Brown   Output Parameters:
596552f7358SJed Brown 
597552f7358SJed Brown   Level: beginner
598552f7358SJed Brown 
599552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetChart()
600552f7358SJed Brown @*/
601552f7358SJed Brown PetscErrorCode DMPlexSetChart(DM dm, PetscInt pStart, PetscInt pEnd)
602552f7358SJed Brown {
603552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
604552f7358SJed Brown   PetscErrorCode ierr;
605552f7358SJed Brown 
606552f7358SJed Brown   PetscFunctionBegin;
607552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
608552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->coneSection, pStart, pEnd);CHKERRQ(ierr);
609552f7358SJed Brown   ierr = PetscSectionSetChart(mesh->supportSection, pStart, pEnd);CHKERRQ(ierr);
610552f7358SJed Brown   PetscFunctionReturn(0);
611552f7358SJed Brown }
612552f7358SJed Brown 
613552f7358SJed Brown #undef __FUNCT__
614552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSize"
615552f7358SJed Brown /*@
616552f7358SJed Brown   DMPlexGetConeSize - Return the number of in-edges for this point in the Sieve DAG
617552f7358SJed Brown 
618552f7358SJed Brown   Not collective
619552f7358SJed Brown 
620552f7358SJed Brown   Input Parameters:
621552f7358SJed Brown + mesh - The DMPlex
622552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
623552f7358SJed Brown 
624552f7358SJed Brown   Output Parameter:
625552f7358SJed Brown . size - The cone size for point p
626552f7358SJed Brown 
627552f7358SJed Brown   Level: beginner
628552f7358SJed Brown 
629552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
630552f7358SJed Brown @*/
631552f7358SJed Brown PetscErrorCode DMPlexGetConeSize(DM dm, PetscInt p, PetscInt *size)
632552f7358SJed Brown {
633552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
634552f7358SJed Brown   PetscErrorCode ierr;
635552f7358SJed Brown 
636552f7358SJed Brown   PetscFunctionBegin;
637552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
638552f7358SJed Brown   PetscValidPointer(size, 3);
639552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
640552f7358SJed Brown   PetscFunctionReturn(0);
641552f7358SJed Brown }
642552f7358SJed Brown 
643552f7358SJed Brown #undef __FUNCT__
644552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeSize"
645552f7358SJed Brown /*@
646552f7358SJed Brown   DMPlexSetConeSize - Set the number of in-edges for this point in the Sieve DAG
647552f7358SJed Brown 
648552f7358SJed Brown   Not collective
649552f7358SJed Brown 
650552f7358SJed Brown   Input Parameters:
651552f7358SJed Brown + mesh - The DMPlex
652552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
653552f7358SJed Brown - size - The cone size for point p
654552f7358SJed Brown 
655552f7358SJed Brown   Output Parameter:
656552f7358SJed Brown 
657552f7358SJed Brown   Note:
658552f7358SJed Brown   This should be called after DMPlexSetChart().
659552f7358SJed Brown 
660552f7358SJed Brown   Level: beginner
661552f7358SJed Brown 
662552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeSize(), DMPlexSetChart()
663552f7358SJed Brown @*/
664552f7358SJed Brown PetscErrorCode DMPlexSetConeSize(DM dm, PetscInt p, PetscInt size)
665552f7358SJed Brown {
666552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
667552f7358SJed Brown   PetscErrorCode ierr;
668552f7358SJed Brown 
669552f7358SJed Brown   PetscFunctionBegin;
670552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
671552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->coneSection, p, size);CHKERRQ(ierr);
6720d644c17SKarl Rupp 
673552f7358SJed Brown   mesh->maxConeSize = PetscMax(mesh->maxConeSize, size);
674552f7358SJed Brown   PetscFunctionReturn(0);
675552f7358SJed Brown }
676552f7358SJed Brown 
677552f7358SJed Brown #undef __FUNCT__
678552f7358SJed Brown #define __FUNCT__ "DMPlexGetCone"
679552f7358SJed Brown /*@C
680552f7358SJed Brown   DMPlexGetCone - Return the points on the in-edges for this point in the Sieve DAG
681552f7358SJed Brown 
682552f7358SJed Brown   Not collective
683552f7358SJed Brown 
684552f7358SJed Brown   Input Parameters:
685552f7358SJed Brown + mesh - The DMPlex
686552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
687552f7358SJed Brown 
688552f7358SJed Brown   Output Parameter:
689552f7358SJed Brown . cone - An array of points which are on the in-edges for point p
690552f7358SJed Brown 
691552f7358SJed Brown   Level: beginner
692552f7358SJed Brown 
6933813dfbdSMatthew G Knepley   Fortran Notes:
6943813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
6953813dfbdSMatthew G Knepley   include petsc.h90 in your code.
6963813dfbdSMatthew G Knepley 
6973813dfbdSMatthew G Knepley   You must also call DMPlexRestoreCone() after you finish using the returned array.
698552f7358SJed Brown 
699552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart()
700552f7358SJed Brown @*/
701552f7358SJed Brown PetscErrorCode DMPlexGetCone(DM dm, PetscInt p, const PetscInt *cone[])
702552f7358SJed Brown {
703552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
704552f7358SJed Brown   PetscInt       off;
705552f7358SJed Brown   PetscErrorCode ierr;
706552f7358SJed Brown 
707552f7358SJed Brown   PetscFunctionBegin;
708552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
709552f7358SJed Brown   PetscValidPointer(cone, 3);
710552f7358SJed Brown   ierr  = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
711552f7358SJed Brown   *cone = &mesh->cones[off];
712552f7358SJed Brown   PetscFunctionReturn(0);
713552f7358SJed Brown }
714552f7358SJed Brown 
715552f7358SJed Brown #undef __FUNCT__
716552f7358SJed Brown #define __FUNCT__ "DMPlexSetCone"
717552f7358SJed Brown /*@
718552f7358SJed Brown   DMPlexSetCone - Set the points on the in-edges for this point in the Sieve DAG
719552f7358SJed Brown 
720552f7358SJed Brown   Not collective
721552f7358SJed Brown 
722552f7358SJed Brown   Input Parameters:
723552f7358SJed Brown + mesh - The DMPlex
724552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
725552f7358SJed Brown - cone - An array of points which are on the in-edges for point p
726552f7358SJed Brown 
727552f7358SJed Brown   Output Parameter:
728552f7358SJed Brown 
729552f7358SJed Brown   Note:
730552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
731552f7358SJed Brown 
732552f7358SJed Brown   Level: beginner
733552f7358SJed Brown 
734552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
735552f7358SJed Brown @*/
736552f7358SJed Brown PetscErrorCode DMPlexSetCone(DM dm, PetscInt p, const PetscInt cone[])
737552f7358SJed Brown {
738552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
739552f7358SJed Brown   PetscInt       pStart, pEnd;
740552f7358SJed Brown   PetscInt       dof, off, c;
741552f7358SJed Brown   PetscErrorCode ierr;
742552f7358SJed Brown 
743552f7358SJed Brown   PetscFunctionBegin;
744552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
745552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
746552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
747552f7358SJed Brown   if (dof) PetscValidPointer(cone, 3);
748552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
74982f516ccSBarry 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);
750552f7358SJed Brown   for (c = 0; c < dof; ++c) {
75182f516ccSBarry 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);
752552f7358SJed Brown     mesh->cones[off+c] = cone[c];
753552f7358SJed Brown   }
754552f7358SJed Brown   PetscFunctionReturn(0);
755552f7358SJed Brown }
756552f7358SJed Brown 
757552f7358SJed Brown #undef __FUNCT__
758552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientation"
759552f7358SJed Brown /*@C
760552f7358SJed Brown   DMPlexGetConeOrientation - Return the orientations on the in-edges for this point in the Sieve DAG
761552f7358SJed Brown 
762552f7358SJed Brown   Not collective
763552f7358SJed Brown 
764552f7358SJed Brown   Input Parameters:
765552f7358SJed Brown + mesh - The DMPlex
766552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
767552f7358SJed Brown 
768552f7358SJed Brown   Output Parameter:
769552f7358SJed Brown . coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
770552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
771552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
772552f7358SJed Brown                     the index of the cone point on which to start.
773552f7358SJed Brown 
774552f7358SJed Brown   Level: beginner
775552f7358SJed Brown 
7763813dfbdSMatthew G Knepley   Fortran Notes:
7773813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
7783813dfbdSMatthew G Knepley   include petsc.h90 in your code.
7793813dfbdSMatthew G Knepley 
7803813dfbdSMatthew G Knepley   You must also call DMPlexRestoreConeOrientation() after you finish using the returned array.
781552f7358SJed Brown 
782552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetCone(), DMPlexSetCone(), DMPlexSetChart()
783552f7358SJed Brown @*/
784552f7358SJed Brown PetscErrorCode DMPlexGetConeOrientation(DM dm, PetscInt p, const PetscInt *coneOrientation[])
785552f7358SJed Brown {
786552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
787552f7358SJed Brown   PetscInt       off;
788552f7358SJed Brown   PetscErrorCode ierr;
789552f7358SJed Brown 
790552f7358SJed Brown   PetscFunctionBegin;
791552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
792552f7358SJed Brown #if defined(PETSC_USE_DEBUG)
793552f7358SJed Brown   {
794552f7358SJed Brown     PetscInt dof;
795552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
796552f7358SJed Brown     if (dof) PetscValidPointer(coneOrientation, 3);
797552f7358SJed Brown   }
798552f7358SJed Brown #endif
799552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
8000d644c17SKarl Rupp 
801552f7358SJed Brown   *coneOrientation = &mesh->coneOrientations[off];
802552f7358SJed Brown   PetscFunctionReturn(0);
803552f7358SJed Brown }
804552f7358SJed Brown 
805552f7358SJed Brown #undef __FUNCT__
806552f7358SJed Brown #define __FUNCT__ "DMPlexSetConeOrientation"
807552f7358SJed Brown /*@
808552f7358SJed Brown   DMPlexSetConeOrientation - Set the orientations on the in-edges for this point in the Sieve DAG
809552f7358SJed Brown 
810552f7358SJed Brown   Not collective
811552f7358SJed Brown 
812552f7358SJed Brown   Input Parameters:
813552f7358SJed Brown + mesh - The DMPlex
814552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
815552f7358SJed Brown - coneOrientation - An array of orientations which are on the in-edges for point p. An orientation is an
816552f7358SJed Brown                     integer giving the prescription for cone traversal. If it is negative, the cone is
817552f7358SJed Brown                     traversed in the opposite direction. Its value 'o', or if negative '-(o+1)', gives
818552f7358SJed Brown                     the index of the cone point on which to start.
819552f7358SJed Brown 
820552f7358SJed Brown   Output Parameter:
821552f7358SJed Brown 
822552f7358SJed Brown   Note:
823552f7358SJed Brown   This should be called after all calls to DMPlexSetConeSize() and DMSetUp().
824552f7358SJed Brown 
825552f7358SJed Brown   Level: beginner
826552f7358SJed Brown 
827552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetConeOrientation(), DMPlexSetCone(), DMPlexSetChart(), DMPlexSetConeSize(), DMSetUp()
828552f7358SJed Brown @*/
829552f7358SJed Brown PetscErrorCode DMPlexSetConeOrientation(DM dm, PetscInt p, const PetscInt coneOrientation[])
830552f7358SJed Brown {
831552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
832552f7358SJed Brown   PetscInt       pStart, pEnd;
833552f7358SJed Brown   PetscInt       dof, off, c;
834552f7358SJed Brown   PetscErrorCode ierr;
835552f7358SJed Brown 
836552f7358SJed Brown   PetscFunctionBegin;
837552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
838552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
839552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
840552f7358SJed Brown   if (dof) PetscValidPointer(coneOrientation, 3);
841552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
84282f516ccSBarry 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);
843552f7358SJed Brown   for (c = 0; c < dof; ++c) {
844552f7358SJed Brown     PetscInt cdof, o = coneOrientation[c];
845552f7358SJed Brown 
846552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, mesh->cones[off+c], &cdof);CHKERRQ(ierr);
84782f516ccSBarry 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);
848552f7358SJed Brown     mesh->coneOrientations[off+c] = o;
849552f7358SJed Brown   }
850552f7358SJed Brown   PetscFunctionReturn(0);
851552f7358SJed Brown }
852552f7358SJed Brown 
853552f7358SJed Brown #undef __FUNCT__
854552f7358SJed Brown #define __FUNCT__ "DMPlexInsertCone"
855552f7358SJed Brown PetscErrorCode DMPlexInsertCone(DM dm, PetscInt p, PetscInt conePos, PetscInt conePoint)
856552f7358SJed Brown {
857552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
858552f7358SJed Brown   PetscInt       pStart, pEnd;
859552f7358SJed Brown   PetscInt       dof, off;
860552f7358SJed Brown   PetscErrorCode ierr;
861552f7358SJed Brown 
862552f7358SJed Brown   PetscFunctionBegin;
863552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
864552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
86582f516ccSBarry 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);
86682f516ccSBarry 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);
86777c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
86877c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
86977c88f5bSMatthew 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);
870552f7358SJed Brown   mesh->cones[off+conePos] = conePoint;
871552f7358SJed Brown   PetscFunctionReturn(0);
872552f7358SJed Brown }
873552f7358SJed Brown 
874552f7358SJed Brown #undef __FUNCT__
87577c88f5bSMatthew G Knepley #define __FUNCT__ "DMPlexInsertConeOrientation"
87677c88f5bSMatthew G Knepley PetscErrorCode DMPlexInsertConeOrientation(DM dm, PetscInt p, PetscInt conePos, PetscInt coneOrientation)
87777c88f5bSMatthew G Knepley {
87877c88f5bSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
87977c88f5bSMatthew G Knepley   PetscInt       pStart, pEnd;
88077c88f5bSMatthew G Knepley   PetscInt       dof, off;
88177c88f5bSMatthew G Knepley   PetscErrorCode ierr;
88277c88f5bSMatthew G Knepley 
88377c88f5bSMatthew G Knepley   PetscFunctionBegin;
88477c88f5bSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
88577c88f5bSMatthew G Knepley   ierr = PetscSectionGetChart(mesh->coneSection, &pStart, &pEnd);CHKERRQ(ierr);
88677c88f5bSMatthew 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);
88777c88f5bSMatthew G Knepley   ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
88877c88f5bSMatthew G Knepley   ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
88977c88f5bSMatthew 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);
89077c88f5bSMatthew G Knepley   mesh->coneOrientations[off+conePos] = coneOrientation;
89177c88f5bSMatthew G Knepley   PetscFunctionReturn(0);
89277c88f5bSMatthew G Knepley }
89377c88f5bSMatthew G Knepley 
89477c88f5bSMatthew G Knepley #undef __FUNCT__
895552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupportSize"
896552f7358SJed Brown /*@
897552f7358SJed Brown   DMPlexGetSupportSize - Return the number of out-edges for this point in the Sieve DAG
898552f7358SJed Brown 
899552f7358SJed Brown   Not collective
900552f7358SJed Brown 
901552f7358SJed Brown   Input Parameters:
902552f7358SJed Brown + mesh - The DMPlex
903552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
904552f7358SJed Brown 
905552f7358SJed Brown   Output Parameter:
906552f7358SJed Brown . size - The support size for point p
907552f7358SJed Brown 
908552f7358SJed Brown   Level: beginner
909552f7358SJed Brown 
910552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart(), DMPlexGetConeSize()
911552f7358SJed Brown @*/
912552f7358SJed Brown PetscErrorCode DMPlexGetSupportSize(DM dm, PetscInt p, PetscInt *size)
913552f7358SJed Brown {
914552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
915552f7358SJed Brown   PetscErrorCode ierr;
916552f7358SJed Brown 
917552f7358SJed Brown   PetscFunctionBegin;
918552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
919552f7358SJed Brown   PetscValidPointer(size, 3);
920552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
921552f7358SJed Brown   PetscFunctionReturn(0);
922552f7358SJed Brown }
923552f7358SJed Brown 
924552f7358SJed Brown #undef __FUNCT__
925552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupportSize"
926552f7358SJed Brown /*@
927552f7358SJed Brown   DMPlexSetSupportSize - Set the number of out-edges for this point in the Sieve DAG
928552f7358SJed Brown 
929552f7358SJed Brown   Not collective
930552f7358SJed Brown 
931552f7358SJed Brown   Input Parameters:
932552f7358SJed Brown + mesh - The DMPlex
933552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
934552f7358SJed Brown - size - The support size for point p
935552f7358SJed Brown 
936552f7358SJed Brown   Output Parameter:
937552f7358SJed Brown 
938552f7358SJed Brown   Note:
939552f7358SJed Brown   This should be called after DMPlexSetChart().
940552f7358SJed Brown 
941552f7358SJed Brown   Level: beginner
942552f7358SJed Brown 
943552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupportSize(), DMPlexSetChart()
944552f7358SJed Brown @*/
945552f7358SJed Brown PetscErrorCode DMPlexSetSupportSize(DM dm, PetscInt p, PetscInt size)
946552f7358SJed Brown {
947552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
948552f7358SJed Brown   PetscErrorCode ierr;
949552f7358SJed Brown 
950552f7358SJed Brown   PetscFunctionBegin;
951552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
952552f7358SJed Brown   ierr = PetscSectionSetDof(mesh->supportSection, p, size);CHKERRQ(ierr);
9530d644c17SKarl Rupp 
954552f7358SJed Brown   mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, size);
955552f7358SJed Brown   PetscFunctionReturn(0);
956552f7358SJed Brown }
957552f7358SJed Brown 
958552f7358SJed Brown #undef __FUNCT__
959552f7358SJed Brown #define __FUNCT__ "DMPlexGetSupport"
960552f7358SJed Brown /*@C
961552f7358SJed Brown   DMPlexGetSupport - Return the points on the out-edges for this point in the Sieve DAG
962552f7358SJed Brown 
963552f7358SJed Brown   Not collective
964552f7358SJed Brown 
965552f7358SJed Brown   Input Parameters:
966552f7358SJed Brown + mesh - The DMPlex
967552f7358SJed Brown - p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
968552f7358SJed Brown 
969552f7358SJed Brown   Output Parameter:
970552f7358SJed Brown . support - An array of points which are on the out-edges for point p
971552f7358SJed Brown 
972552f7358SJed Brown   Level: beginner
973552f7358SJed Brown 
9743813dfbdSMatthew G Knepley   Fortran Notes:
9753813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
9763813dfbdSMatthew G Knepley   include petsc.h90 in your code.
9773813dfbdSMatthew G Knepley 
9783813dfbdSMatthew G Knepley   You must also call DMPlexRestoreSupport() after you finish using the returned array.
9793813dfbdSMatthew G Knepley 
980552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
981552f7358SJed Brown @*/
982552f7358SJed Brown PetscErrorCode DMPlexGetSupport(DM dm, PetscInt p, const PetscInt *support[])
983552f7358SJed Brown {
984552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
985552f7358SJed Brown   PetscInt       off;
986552f7358SJed Brown   PetscErrorCode ierr;
987552f7358SJed Brown 
988552f7358SJed Brown   PetscFunctionBegin;
989552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
990552f7358SJed Brown   PetscValidPointer(support, 3);
991552f7358SJed Brown   ierr     = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
992552f7358SJed Brown   *support = &mesh->supports[off];
993552f7358SJed Brown   PetscFunctionReturn(0);
994552f7358SJed Brown }
995552f7358SJed Brown 
996552f7358SJed Brown #undef __FUNCT__
997552f7358SJed Brown #define __FUNCT__ "DMPlexSetSupport"
998552f7358SJed Brown /*@
999552f7358SJed Brown   DMPlexSetSupport - Set the points on the out-edges for this point in the Sieve DAG
1000552f7358SJed Brown 
1001552f7358SJed Brown   Not collective
1002552f7358SJed Brown 
1003552f7358SJed Brown   Input Parameters:
1004552f7358SJed Brown + mesh - The DMPlex
1005552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1006552f7358SJed Brown - support - An array of points which are on the in-edges for point p
1007552f7358SJed Brown 
1008552f7358SJed Brown   Output Parameter:
1009552f7358SJed Brown 
1010552f7358SJed Brown   Note:
1011552f7358SJed Brown   This should be called after all calls to DMPlexSetSupportSize() and DMSetUp().
1012552f7358SJed Brown 
1013552f7358SJed Brown   Level: beginner
1014552f7358SJed Brown 
1015552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexGetSupport(), DMPlexSetChart(), DMPlexSetSupportSize(), DMSetUp()
1016552f7358SJed Brown @*/
1017552f7358SJed Brown PetscErrorCode DMPlexSetSupport(DM dm, PetscInt p, const PetscInt support[])
1018552f7358SJed Brown {
1019552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1020552f7358SJed Brown   PetscInt       pStart, pEnd;
1021552f7358SJed Brown   PetscInt       dof, off, c;
1022552f7358SJed Brown   PetscErrorCode ierr;
1023552f7358SJed Brown 
1024552f7358SJed Brown   PetscFunctionBegin;
1025552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1026552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1027552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1028552f7358SJed Brown   if (dof) PetscValidPointer(support, 3);
1029552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
103082f516ccSBarry 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);
1031552f7358SJed Brown   for (c = 0; c < dof; ++c) {
103282f516ccSBarry 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);
1033552f7358SJed Brown     mesh->supports[off+c] = support[c];
1034552f7358SJed Brown   }
1035552f7358SJed Brown   PetscFunctionReturn(0);
1036552f7358SJed Brown }
1037552f7358SJed Brown 
1038552f7358SJed Brown #undef __FUNCT__
1039552f7358SJed Brown #define __FUNCT__ "DMPlexInsertSupport"
1040552f7358SJed Brown PetscErrorCode DMPlexInsertSupport(DM dm, PetscInt p, PetscInt supportPos, PetscInt supportPoint)
1041552f7358SJed Brown {
1042552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1043552f7358SJed Brown   PetscInt       pStart, pEnd;
1044552f7358SJed Brown   PetscInt       dof, off;
1045552f7358SJed Brown   PetscErrorCode ierr;
1046552f7358SJed Brown 
1047552f7358SJed Brown   PetscFunctionBegin;
1048552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1049552f7358SJed Brown   ierr = PetscSectionGetChart(mesh->supportSection, &pStart, &pEnd);CHKERRQ(ierr);
1050552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
1051552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, p, &off);CHKERRQ(ierr);
105282f516ccSBarry 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);
105382f516ccSBarry 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);
105482f516ccSBarry 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);
1055552f7358SJed Brown   mesh->supports[off+supportPos] = supportPoint;
1056552f7358SJed Brown   PetscFunctionReturn(0);
1057552f7358SJed Brown }
1058552f7358SJed Brown 
1059552f7358SJed Brown #undef __FUNCT__
1060552f7358SJed Brown #define __FUNCT__ "DMPlexGetTransitiveClosure"
1061552f7358SJed Brown /*@C
1062552f7358SJed Brown   DMPlexGetTransitiveClosure - Return the points on the transitive closure of the in-edges or out-edges for this point in the Sieve DAG
1063552f7358SJed Brown 
1064552f7358SJed Brown   Not collective
1065552f7358SJed Brown 
1066552f7358SJed Brown   Input Parameters:
1067552f7358SJed Brown + mesh - The DMPlex
1068552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1069552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
10700298fd71SBarry Smith - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
1071552f7358SJed Brown 
1072552f7358SJed Brown   Output Parameters:
1073552f7358SJed Brown + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
1074552f7358SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
1075552f7358SJed Brown 
1076552f7358SJed Brown   Note:
10770298fd71SBarry Smith   If using internal storage (points is NULL on input), each call overwrites the last output.
1078552f7358SJed Brown 
10793813dfbdSMatthew G Knepley   Fortran Notes:
10803813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
10813813dfbdSMatthew G Knepley   include petsc.h90 in your code.
10823813dfbdSMatthew G Knepley 
10833813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
10843813dfbdSMatthew G Knepley 
1085552f7358SJed Brown   Level: beginner
1086552f7358SJed Brown 
1087552f7358SJed Brown .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1088552f7358SJed Brown @*/
1089552f7358SJed Brown PetscErrorCode DMPlexGetTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1090552f7358SJed Brown {
1091552f7358SJed Brown   DM_Plex        *mesh = (DM_Plex*) dm->data;
1092552f7358SJed Brown   PetscInt       *closure, *fifo;
10930298fd71SBarry Smith   const PetscInt *tmp = NULL, *tmpO = NULL;
1094552f7358SJed Brown   PetscInt        tmpSize, t;
1095552f7358SJed Brown   PetscInt        depth       = 0, maxSize;
1096552f7358SJed Brown   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
1097552f7358SJed Brown   PetscErrorCode  ierr;
1098552f7358SJed Brown 
1099552f7358SJed Brown   PetscFunctionBegin;
1100552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1101552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1102552f7358SJed Brown   /* This is only 1-level */
1103552f7358SJed Brown   if (useCone) {
1104552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
1105552f7358SJed Brown     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
1106552f7358SJed Brown     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
1107552f7358SJed Brown   } else {
1108552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
1109552f7358SJed Brown     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
1110552f7358SJed Brown   }
1111bfbcdd7aSMatthew G. Knepley   if (depth == 1) {
1112bfbcdd7aSMatthew G. Knepley     if (*points) {
1113bfbcdd7aSMatthew G. Knepley       closure = *points;
1114bfbcdd7aSMatthew G. Knepley     } else {
1115bfbcdd7aSMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
1116bfbcdd7aSMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1117bfbcdd7aSMatthew G. Knepley     }
1118bfbcdd7aSMatthew G. Knepley     closure[0] = p; closure[1] = 0;
1119bfbcdd7aSMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
1120bfbcdd7aSMatthew G. Knepley       closure[closureSize]   = tmp[t];
1121bfbcdd7aSMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[t] : 0;
1122bfbcdd7aSMatthew G. Knepley     }
1123bfbcdd7aSMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
1124bfbcdd7aSMatthew G. Knepley     if (points)    *points    = closure;
1125bfbcdd7aSMatthew G. Knepley     PetscFunctionReturn(0);
1126bfbcdd7aSMatthew G. Knepley   }
1127bfbcdd7aSMatthew G. Knepley   maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1);
1128bfbcdd7aSMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1129bfbcdd7aSMatthew G. Knepley   if (*points) {
1130bfbcdd7aSMatthew G. Knepley     closure = *points;
1131bfbcdd7aSMatthew G. Knepley   } else {
1132bfbcdd7aSMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
1133bfbcdd7aSMatthew G. Knepley   }
1134bfbcdd7aSMatthew G. Knepley   closure[0] = p; closure[1] = 0;
1135552f7358SJed Brown   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
1136552f7358SJed Brown     const PetscInt cp = tmp[t];
1137552f7358SJed Brown     const PetscInt co = tmpO ? tmpO[t] : 0;
1138552f7358SJed Brown 
1139552f7358SJed Brown     closure[closureSize]   = cp;
1140552f7358SJed Brown     closure[closureSize+1] = co;
1141552f7358SJed Brown     fifo[fifoSize]         = cp;
1142552f7358SJed Brown     fifo[fifoSize+1]       = co;
1143552f7358SJed Brown   }
1144bfbcdd7aSMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
1145552f7358SJed Brown   while (fifoSize - fifoStart) {
1146552f7358SJed Brown     const PetscInt q   = fifo[fifoStart];
1147552f7358SJed Brown     const PetscInt o   = fifo[fifoStart+1];
1148552f7358SJed Brown     const PetscInt rev = o >= 0 ? 0 : 1;
1149552f7358SJed Brown     const PetscInt off = rev ? -(o+1) : o;
1150552f7358SJed Brown 
1151552f7358SJed Brown     if (useCone) {
1152552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
1153552f7358SJed Brown       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
1154552f7358SJed Brown       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
1155552f7358SJed Brown     } else {
1156552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
1157552f7358SJed Brown       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
11580298fd71SBarry Smith       tmpO = NULL;
1159552f7358SJed Brown     }
1160552f7358SJed Brown     for (t = 0; t < tmpSize; ++t) {
1161552f7358SJed Brown       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
1162552f7358SJed Brown       const PetscInt cp = tmp[i];
11632e1b13c2SMatthew 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. */
11642e1b13c2SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
11652e1b13c2SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
11662e1b13c2SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
1167552f7358SJed Brown       PetscInt       c;
1168552f7358SJed Brown 
11692e1b13c2SMatthew G. Knepley       if (rev) {
11702e1b13c2SMatthew G. Knepley         PetscInt childSize, coff;
11712e1b13c2SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
11722e1b13c2SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
11732e1b13c2SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
11742e1b13c2SMatthew G. Knepley       }
1175552f7358SJed Brown       /* Check for duplicate */
1176552f7358SJed Brown       for (c = 0; c < closureSize; c += 2) {
1177552f7358SJed Brown         if (closure[c] == cp) break;
1178552f7358SJed Brown       }
1179552f7358SJed Brown       if (c == closureSize) {
1180552f7358SJed Brown         closure[closureSize]   = cp;
1181552f7358SJed Brown         closure[closureSize+1] = co;
1182552f7358SJed Brown         fifo[fifoSize]         = cp;
1183552f7358SJed Brown         fifo[fifoSize+1]       = co;
1184552f7358SJed Brown         closureSize           += 2;
1185552f7358SJed Brown         fifoSize              += 2;
1186552f7358SJed Brown       }
1187552f7358SJed Brown     }
1188552f7358SJed Brown     fifoStart += 2;
1189552f7358SJed Brown   }
1190552f7358SJed Brown   if (numPoints) *numPoints = closureSize/2;
1191552f7358SJed Brown   if (points)    *points    = closure;
1192552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
1193552f7358SJed Brown   PetscFunctionReturn(0);
1194552f7358SJed Brown }
1195552f7358SJed Brown 
1196552f7358SJed Brown #undef __FUNCT__
11979bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexGetTransitiveClosure_Internal"
11989bf0dad6SMatthew G. Knepley /*@C
11999bf0dad6SMatthew 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
12009bf0dad6SMatthew G. Knepley 
12019bf0dad6SMatthew G. Knepley   Not collective
12029bf0dad6SMatthew G. Knepley 
12039bf0dad6SMatthew G. Knepley   Input Parameters:
12049bf0dad6SMatthew G. Knepley + mesh - The DMPlex
12059bf0dad6SMatthew G. Knepley . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
12069bf0dad6SMatthew G. Knepley . orientation - The orientation of the point
12079bf0dad6SMatthew G. Knepley . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
12089bf0dad6SMatthew G. Knepley - points - If points is NULL on input, internal storage will be returned, otherwise the provided array is used
12099bf0dad6SMatthew G. Knepley 
12109bf0dad6SMatthew G. Knepley   Output Parameters:
12119bf0dad6SMatthew G. Knepley + numPoints - The number of points in the closure, so points[] is of size 2*numPoints
12129bf0dad6SMatthew G. Knepley - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...]
12139bf0dad6SMatthew G. Knepley 
12149bf0dad6SMatthew G. Knepley   Note:
12159bf0dad6SMatthew G. Knepley   If using internal storage (points is NULL on input), each call overwrites the last output.
12169bf0dad6SMatthew G. Knepley 
12179bf0dad6SMatthew G. Knepley   Fortran Notes:
12189bf0dad6SMatthew G. Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
12199bf0dad6SMatthew G. Knepley   include petsc.h90 in your code.
12209bf0dad6SMatthew G. Knepley 
12219bf0dad6SMatthew G. Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
12229bf0dad6SMatthew G. Knepley 
12239bf0dad6SMatthew G. Knepley   Level: beginner
12249bf0dad6SMatthew G. Knepley 
12259bf0dad6SMatthew G. Knepley .seealso: DMPlexRestoreTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
12269bf0dad6SMatthew G. Knepley @*/
12279bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexGetTransitiveClosure_Internal(DM dm, PetscInt p, PetscInt ornt, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
12289bf0dad6SMatthew G. Knepley {
12299bf0dad6SMatthew G. Knepley   DM_Plex        *mesh = (DM_Plex*) dm->data;
12309bf0dad6SMatthew G. Knepley   PetscInt       *closure, *fifo;
12319bf0dad6SMatthew G. Knepley   const PetscInt *tmp = NULL, *tmpO = NULL;
12329bf0dad6SMatthew G. Knepley   PetscInt        tmpSize, t;
12339bf0dad6SMatthew G. Knepley   PetscInt        depth       = 0, maxSize;
12349bf0dad6SMatthew G. Knepley   PetscInt        closureSize = 2, fifoSize = 0, fifoStart = 0;
12359bf0dad6SMatthew G. Knepley   PetscErrorCode  ierr;
12369bf0dad6SMatthew G. Knepley 
12379bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
12389bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
12399bf0dad6SMatthew G. Knepley   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
12409bf0dad6SMatthew G. Knepley   /* This is only 1-level */
12419bf0dad6SMatthew G. Knepley   if (useCone) {
12429bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &tmpSize);CHKERRQ(ierr);
12439bf0dad6SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &tmp);CHKERRQ(ierr);
12449bf0dad6SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, p, &tmpO);CHKERRQ(ierr);
12459bf0dad6SMatthew G. Knepley   } else {
12469bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &tmpSize);CHKERRQ(ierr);
12479bf0dad6SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &tmp);CHKERRQ(ierr);
12489bf0dad6SMatthew G. Knepley   }
12499bf0dad6SMatthew G. Knepley   if (depth == 1) {
12509bf0dad6SMatthew G. Knepley     if (*points) {
12519bf0dad6SMatthew G. Knepley       closure = *points;
12529bf0dad6SMatthew G. Knepley     } else {
12539bf0dad6SMatthew G. Knepley       maxSize = 2*(PetscMax(mesh->maxConeSize, mesh->maxSupportSize)+1);
12549bf0dad6SMatthew G. Knepley       ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
12559bf0dad6SMatthew G. Knepley     }
12569bf0dad6SMatthew G. Knepley     closure[0] = p; closure[1] = ornt;
12579bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t, closureSize += 2) {
12589bf0dad6SMatthew G. Knepley       const PetscInt i = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
12599bf0dad6SMatthew G. Knepley       closure[closureSize]   = tmp[i];
12609bf0dad6SMatthew G. Knepley       closure[closureSize+1] = tmpO ? tmpO[i] : 0;
12619bf0dad6SMatthew G. Knepley     }
12629bf0dad6SMatthew G. Knepley     if (numPoints) *numPoints = closureSize/2;
12639bf0dad6SMatthew G. Knepley     if (points)    *points    = closure;
12649bf0dad6SMatthew G. Knepley     PetscFunctionReturn(0);
12659bf0dad6SMatthew G. Knepley   }
12669bf0dad6SMatthew G. Knepley   maxSize = 2*PetscMax(PetscMax(PetscPowInt(mesh->maxConeSize,depth+1),PetscPowInt(mesh->maxSupportSize,depth+1)),depth+1);
12679bf0dad6SMatthew G. Knepley   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
12689bf0dad6SMatthew G. Knepley   if (*points) {
12699bf0dad6SMatthew G. Knepley     closure = *points;
12709bf0dad6SMatthew G. Knepley   } else {
12719bf0dad6SMatthew G. Knepley     ierr = DMGetWorkArray(dm, maxSize, PETSC_INT, &closure);CHKERRQ(ierr);
12729bf0dad6SMatthew G. Knepley   }
12739bf0dad6SMatthew G. Knepley   closure[0] = p; closure[1] = ornt;
12749bf0dad6SMatthew G. Knepley   for (t = 0; t < tmpSize; ++t, closureSize += 2, fifoSize += 2) {
12759bf0dad6SMatthew G. Knepley     const PetscInt i  = ornt >= 0 ? (t+ornt)%tmpSize : (-(ornt+1) + tmpSize-t)%tmpSize;
12769bf0dad6SMatthew G. Knepley     const PetscInt cp = tmp[i];
12779bf0dad6SMatthew G. Knepley     PetscInt       co = tmpO ? tmpO[i] : 0;
12789bf0dad6SMatthew G. Knepley 
12799bf0dad6SMatthew G. Knepley     if (ornt < 0) {
12809bf0dad6SMatthew G. Knepley       PetscInt childSize, coff;
12819bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
12829bf0dad6SMatthew G. Knepley       coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
12839bf0dad6SMatthew G. Knepley       co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
12849bf0dad6SMatthew G. Knepley     }
12859bf0dad6SMatthew G. Knepley     closure[closureSize]   = cp;
12869bf0dad6SMatthew G. Knepley     closure[closureSize+1] = co;
12879bf0dad6SMatthew G. Knepley     fifo[fifoSize]         = cp;
12889bf0dad6SMatthew G. Knepley     fifo[fifoSize+1]       = co;
12899bf0dad6SMatthew G. Knepley   }
12909bf0dad6SMatthew G. Knepley   /* Should kick out early when depth is reached, rather than checking all vertices for empty cones */
12919bf0dad6SMatthew G. Knepley   while (fifoSize - fifoStart) {
12929bf0dad6SMatthew G. Knepley     const PetscInt q   = fifo[fifoStart];
12939bf0dad6SMatthew G. Knepley     const PetscInt o   = fifo[fifoStart+1];
12949bf0dad6SMatthew G. Knepley     const PetscInt rev = o >= 0 ? 0 : 1;
12959bf0dad6SMatthew G. Knepley     const PetscInt off = rev ? -(o+1) : o;
12969bf0dad6SMatthew G. Knepley 
12979bf0dad6SMatthew G. Knepley     if (useCone) {
12989bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, q, &tmpSize);CHKERRQ(ierr);
12999bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, q, &tmp);CHKERRQ(ierr);
13009bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, q, &tmpO);CHKERRQ(ierr);
13019bf0dad6SMatthew G. Knepley     } else {
13029bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, q, &tmpSize);CHKERRQ(ierr);
13039bf0dad6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, q, &tmp);CHKERRQ(ierr);
13049bf0dad6SMatthew G. Knepley       tmpO = NULL;
13059bf0dad6SMatthew G. Knepley     }
13069bf0dad6SMatthew G. Knepley     for (t = 0; t < tmpSize; ++t) {
13079bf0dad6SMatthew G. Knepley       const PetscInt i  = ((rev ? tmpSize-t : t) + off)%tmpSize;
13089bf0dad6SMatthew G. Knepley       const PetscInt cp = tmp[i];
13099bf0dad6SMatthew 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. */
13109bf0dad6SMatthew G. Knepley       /* HACK: It is worse to get the size here, than to change the interpretation of -(*+1)
13119bf0dad6SMatthew G. Knepley        const PetscInt co = tmpO ? (rev ? -(tmpO[i]+1) : tmpO[i]) : 0; */
13129bf0dad6SMatthew G. Knepley       PetscInt       co = tmpO ? tmpO[i] : 0;
13139bf0dad6SMatthew G. Knepley       PetscInt       c;
13149bf0dad6SMatthew G. Knepley 
13159bf0dad6SMatthew G. Knepley       if (rev) {
13169bf0dad6SMatthew G. Knepley         PetscInt childSize, coff;
13179bf0dad6SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, cp, &childSize);CHKERRQ(ierr);
13189bf0dad6SMatthew G. Knepley         coff = tmpO[i] < 0 ? -(tmpO[i]+1) : tmpO[i];
13199bf0dad6SMatthew G. Knepley         co   = childSize ? -(((coff+childSize-1)%childSize)+1) : 0;
13209bf0dad6SMatthew G. Knepley       }
13219bf0dad6SMatthew G. Knepley       /* Check for duplicate */
13229bf0dad6SMatthew G. Knepley       for (c = 0; c < closureSize; c += 2) {
13239bf0dad6SMatthew G. Knepley         if (closure[c] == cp) break;
13249bf0dad6SMatthew G. Knepley       }
13259bf0dad6SMatthew G. Knepley       if (c == closureSize) {
13269bf0dad6SMatthew G. Knepley         closure[closureSize]   = cp;
13279bf0dad6SMatthew G. Knepley         closure[closureSize+1] = co;
13289bf0dad6SMatthew G. Knepley         fifo[fifoSize]         = cp;
13299bf0dad6SMatthew G. Knepley         fifo[fifoSize+1]       = co;
13309bf0dad6SMatthew G. Knepley         closureSize           += 2;
13319bf0dad6SMatthew G. Knepley         fifoSize              += 2;
13329bf0dad6SMatthew G. Knepley       }
13339bf0dad6SMatthew G. Knepley     }
13349bf0dad6SMatthew G. Knepley     fifoStart += 2;
13359bf0dad6SMatthew G. Knepley   }
13369bf0dad6SMatthew G. Knepley   if (numPoints) *numPoints = closureSize/2;
13379bf0dad6SMatthew G. Knepley   if (points)    *points    = closure;
13389bf0dad6SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxSize, PETSC_INT, &fifo);CHKERRQ(ierr);
13399bf0dad6SMatthew G. Knepley   PetscFunctionReturn(0);
13409bf0dad6SMatthew G. Knepley }
13419bf0dad6SMatthew G. Knepley 
13429bf0dad6SMatthew G. Knepley #undef __FUNCT__
1343552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreTransitiveClosure"
1344552f7358SJed Brown /*@C
1345552f7358SJed 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
1346552f7358SJed Brown 
1347552f7358SJed Brown   Not collective
1348552f7358SJed Brown 
1349552f7358SJed Brown   Input Parameters:
1350552f7358SJed Brown + mesh - The DMPlex
1351552f7358SJed Brown . p - The Sieve point, which must lie in the chart set with DMPlexSetChart()
1352552f7358SJed Brown . useCone - PETSC_TRUE for in-edges,  otherwise use out-edges
1353e5c84f05SJed Brown . numPoints - The number of points in the closure, so points[] is of size 2*numPoints, zeroed on exit
1354e5c84f05SJed Brown - points - The points and point orientations, interleaved as pairs [p0, o0, p1, o1, ...], zeroed on exit
1355552f7358SJed Brown 
1356552f7358SJed Brown   Note:
13570298fd71SBarry Smith   If not using internal storage (points is not NULL on input), this call is unnecessary
1358552f7358SJed Brown 
13593813dfbdSMatthew G Knepley   Fortran Notes:
13603813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
13613813dfbdSMatthew G Knepley   include petsc.h90 in your code.
13623813dfbdSMatthew G Knepley 
13633813dfbdSMatthew G Knepley   The numPoints argument is not present in the Fortran 90 binding since it is internal to the array.
13643813dfbdSMatthew G Knepley 
1365552f7358SJed Brown   Level: beginner
1366552f7358SJed Brown 
1367552f7358SJed Brown .seealso: DMPlexGetTransitiveClosure(), DMPlexCreate(), DMPlexSetCone(), DMPlexSetChart(), DMPlexGetCone()
1368552f7358SJed Brown @*/
1369552f7358SJed Brown PetscErrorCode DMPlexRestoreTransitiveClosure(DM dm, PetscInt p, PetscBool useCone, PetscInt *numPoints, PetscInt *points[])
1370552f7358SJed Brown {
1371552f7358SJed Brown   PetscErrorCode ierr;
1372552f7358SJed Brown 
1373552f7358SJed Brown   PetscFunctionBegin;
1374552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1375e5c84f05SJed Brown   if (numPoints) PetscValidIntPointer(numPoints,4);
1376e5c84f05SJed Brown   if (points) PetscValidPointer(points,5);
1377552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, points);CHKERRQ(ierr);
13784ff43b2cSJed Brown   if (numPoints) *numPoints = 0;
1379552f7358SJed Brown   PetscFunctionReturn(0);
1380552f7358SJed Brown }
1381552f7358SJed Brown 
1382552f7358SJed Brown #undef __FUNCT__
1383552f7358SJed Brown #define __FUNCT__ "DMPlexGetMaxSizes"
1384552f7358SJed Brown /*@
1385552f7358SJed Brown   DMPlexGetMaxSizes - Return the maximum number of in-edges (cone) and out-edges (support) for any point in the Sieve DAG
1386552f7358SJed Brown 
1387552f7358SJed Brown   Not collective
1388552f7358SJed Brown 
1389552f7358SJed Brown   Input Parameter:
1390552f7358SJed Brown . mesh - The DMPlex
1391552f7358SJed Brown 
1392552f7358SJed Brown   Output Parameters:
1393552f7358SJed Brown + maxConeSize - The maximum number of in-edges
1394552f7358SJed Brown - maxSupportSize - The maximum number of out-edges
1395552f7358SJed Brown 
1396552f7358SJed Brown   Level: beginner
1397552f7358SJed Brown 
1398552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetConeSize(), DMPlexSetChart()
1399552f7358SJed Brown @*/
1400552f7358SJed Brown PetscErrorCode DMPlexGetMaxSizes(DM dm, PetscInt *maxConeSize, PetscInt *maxSupportSize)
1401552f7358SJed Brown {
1402552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
1403552f7358SJed Brown 
1404552f7358SJed Brown   PetscFunctionBegin;
1405552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1406552f7358SJed Brown   if (maxConeSize)    *maxConeSize    = mesh->maxConeSize;
1407552f7358SJed Brown   if (maxSupportSize) *maxSupportSize = mesh->maxSupportSize;
1408552f7358SJed Brown   PetscFunctionReturn(0);
1409552f7358SJed Brown }
1410552f7358SJed Brown 
1411552f7358SJed Brown #undef __FUNCT__
1412552f7358SJed Brown #define __FUNCT__ "DMSetUp_Plex"
1413552f7358SJed Brown PetscErrorCode DMSetUp_Plex(DM dm)
1414552f7358SJed Brown {
1415552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1416552f7358SJed Brown   PetscInt       size;
1417552f7358SJed Brown   PetscErrorCode ierr;
1418552f7358SJed Brown 
1419552f7358SJed Brown   PetscFunctionBegin;
1420552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1421552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->coneSection);CHKERRQ(ierr);
1422552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->coneSection, &size);CHKERRQ(ierr);
14231795a4d1SJed Brown   ierr = PetscMalloc1(size, &mesh->cones);CHKERRQ(ierr);
14241795a4d1SJed Brown   ierr = PetscCalloc1(size, &mesh->coneOrientations);CHKERRQ(ierr);
1425552f7358SJed Brown   if (mesh->maxSupportSize) {
1426552f7358SJed Brown     ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1427552f7358SJed Brown     ierr = PetscSectionGetStorageSize(mesh->supportSection, &size);CHKERRQ(ierr);
14281795a4d1SJed Brown     ierr = PetscMalloc1(size, &mesh->supports);CHKERRQ(ierr);
1429552f7358SJed Brown   }
1430552f7358SJed Brown   PetscFunctionReturn(0);
1431552f7358SJed Brown }
1432552f7358SJed Brown 
1433552f7358SJed Brown #undef __FUNCT__
1434552f7358SJed Brown #define __FUNCT__ "DMCreateSubDM_Plex"
1435552f7358SJed Brown PetscErrorCode DMCreateSubDM_Plex(DM dm, PetscInt numFields, PetscInt fields[], IS *is, DM *subdm)
1436552f7358SJed Brown {
1437552f7358SJed Brown   PetscErrorCode ierr;
1438552f7358SJed Brown 
1439552f7358SJed Brown   PetscFunctionBegin;
14404d9407bcSMatthew G. Knepley   if (subdm) {ierr = DMClone(dm, subdm);CHKERRQ(ierr);}
14414d9407bcSMatthew G. Knepley   ierr = DMCreateSubDM_Section_Private(dm, numFields, fields, is, subdm);CHKERRQ(ierr);
1442552f7358SJed Brown   PetscFunctionReturn(0);
1443552f7358SJed Brown }
1444552f7358SJed Brown 
1445552f7358SJed Brown #undef __FUNCT__
1446552f7358SJed Brown #define __FUNCT__ "DMPlexSymmetrize"
1447552f7358SJed Brown /*@
1448552f7358SJed Brown   DMPlexSymmetrize - Creates support (out-edge) information from cone (in-edge) inoformation
1449552f7358SJed Brown 
1450552f7358SJed Brown   Not collective
1451552f7358SJed Brown 
1452552f7358SJed Brown   Input Parameter:
1453552f7358SJed Brown . mesh - The DMPlex
1454552f7358SJed Brown 
1455552f7358SJed Brown   Output Parameter:
1456552f7358SJed Brown 
1457552f7358SJed Brown   Note:
1458552f7358SJed Brown   This should be called after all calls to DMPlexSetCone()
1459552f7358SJed Brown 
1460552f7358SJed Brown   Level: beginner
1461552f7358SJed Brown 
1462552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSetChart(), DMPlexSetConeSize(), DMPlexSetCone()
1463552f7358SJed Brown @*/
1464552f7358SJed Brown PetscErrorCode DMPlexSymmetrize(DM dm)
1465552f7358SJed Brown {
1466552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1467552f7358SJed Brown   PetscInt      *offsets;
1468552f7358SJed Brown   PetscInt       supportSize;
1469552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1470552f7358SJed Brown   PetscErrorCode ierr;
1471552f7358SJed Brown 
1472552f7358SJed Brown   PetscFunctionBegin;
1473552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
147482f516ccSBarry Smith   if (mesh->supports) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONGSTATE, "Supports were already setup in this DMPlex");
1475552f7358SJed Brown   /* Calculate support sizes */
1476552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1477552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1478552f7358SJed Brown     PetscInt dof, off, c;
1479552f7358SJed Brown 
1480552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1481552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1482552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1483552f7358SJed Brown       ierr = PetscSectionAddDof(mesh->supportSection, mesh->cones[c], 1);CHKERRQ(ierr);
1484552f7358SJed Brown     }
1485552f7358SJed Brown   }
1486552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1487552f7358SJed Brown     PetscInt dof;
1488552f7358SJed Brown 
1489552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, p, &dof);CHKERRQ(ierr);
14900d644c17SKarl Rupp 
1491552f7358SJed Brown     mesh->maxSupportSize = PetscMax(mesh->maxSupportSize, dof);
1492552f7358SJed Brown   }
1493552f7358SJed Brown   ierr = PetscSectionSetUp(mesh->supportSection);CHKERRQ(ierr);
1494552f7358SJed Brown   /* Calculate supports */
1495552f7358SJed Brown   ierr = PetscSectionGetStorageSize(mesh->supportSection, &supportSize);CHKERRQ(ierr);
14961795a4d1SJed Brown   ierr = PetscMalloc1(supportSize, &mesh->supports);CHKERRQ(ierr);
14971795a4d1SJed Brown   ierr = PetscCalloc1(pEnd - pStart, &offsets);CHKERRQ(ierr);
1498552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1499552f7358SJed Brown     PetscInt dof, off, c;
1500552f7358SJed Brown 
1501552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, p, &dof);CHKERRQ(ierr);
1502552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, p, &off);CHKERRQ(ierr);
1503552f7358SJed Brown     for (c = off; c < off+dof; ++c) {
1504552f7358SJed Brown       const PetscInt q = mesh->cones[c];
1505552f7358SJed Brown       PetscInt       offS;
1506552f7358SJed Brown 
1507552f7358SJed Brown       ierr = PetscSectionGetOffset(mesh->supportSection, q, &offS);CHKERRQ(ierr);
15080d644c17SKarl Rupp 
1509552f7358SJed Brown       mesh->supports[offS+offsets[q]] = p;
1510552f7358SJed Brown       ++offsets[q];
1511552f7358SJed Brown     }
1512552f7358SJed Brown   }
1513552f7358SJed Brown   ierr = PetscFree(offsets);CHKERRQ(ierr);
1514552f7358SJed Brown   PetscFunctionReturn(0);
1515552f7358SJed Brown }
1516552f7358SJed Brown 
1517552f7358SJed Brown #undef __FUNCT__
1518552f7358SJed Brown #define __FUNCT__ "DMPlexStratify"
1519552f7358SJed Brown /*@
1520552f7358SJed Brown   DMPlexStratify - The Sieve DAG for most topologies is a graded poset (http://en.wikipedia.org/wiki/Graded_poset), and
1521552f7358SJed Brown   can be illustrated by Hasse Diagram (a http://en.wikipedia.org/wiki/Hasse_diagram). The strata group all points of the
1522552f7358SJed Brown   same grade, and this function calculates the strata. This grade can be seen as the height (or depth) of the point in
1523552f7358SJed Brown   the DAG.
1524552f7358SJed Brown 
1525552f7358SJed Brown   Not collective
1526552f7358SJed Brown 
1527552f7358SJed Brown   Input Parameter:
1528552f7358SJed Brown . mesh - The DMPlex
1529552f7358SJed Brown 
1530552f7358SJed Brown   Output Parameter:
1531552f7358SJed Brown 
1532552f7358SJed Brown   Notes:
1533552f7358SJed Brown   The normal association for the point grade is element dimension (or co-dimension). For instance, all vertices would
1534552f7358SJed Brown   have depth 0, and all edges depth 1. Likewise, all cells heights would have height 0, and all faces height 1.
1535552f7358SJed Brown 
1536552f7358SJed Brown   This should be called after all calls to DMPlexSymmetrize()
1537552f7358SJed Brown 
1538552f7358SJed Brown   Level: beginner
1539552f7358SJed Brown 
1540552f7358SJed Brown .seealso: DMPlexCreate(), DMPlexSymmetrize()
1541552f7358SJed Brown @*/
1542552f7358SJed Brown PetscErrorCode DMPlexStratify(DM dm)
1543552f7358SJed Brown {
1544aa50250dSMatthew G. Knepley   DMLabel        label;
1545552f7358SJed Brown   PetscInt       pStart, pEnd, p;
1546552f7358SJed Brown   PetscInt       numRoots = 0, numLeaves = 0;
1547552f7358SJed Brown   PetscErrorCode ierr;
1548552f7358SJed Brown 
1549552f7358SJed Brown   PetscFunctionBegin;
1550552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1551552f7358SJed Brown   ierr = PetscLogEventBegin(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1552552f7358SJed Brown   /* Calculate depth */
1553aa50250dSMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
1554aa50250dSMatthew G. Knepley   ierr = DMPlexCreateLabel(dm, "depth");CHKERRQ(ierr);
1555aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
1556552f7358SJed Brown   /* Initialize roots and count leaves */
1557552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
1558552f7358SJed Brown     PetscInt coneSize, supportSize;
1559552f7358SJed Brown 
1560552f7358SJed Brown     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1561552f7358SJed Brown     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1562552f7358SJed Brown     if (!coneSize && supportSize) {
1563552f7358SJed Brown       ++numRoots;
1564aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1565552f7358SJed Brown     } else if (!supportSize && coneSize) {
1566552f7358SJed Brown       ++numLeaves;
1567552f7358SJed Brown     } else if (!supportSize && !coneSize) {
1568552f7358SJed Brown       /* Isolated points */
1569aa50250dSMatthew G. Knepley       ierr = DMLabelSetValue(label, p, 0);CHKERRQ(ierr);
1570552f7358SJed Brown     }
1571552f7358SJed Brown   }
1572552f7358SJed Brown   if (numRoots + numLeaves == (pEnd - pStart)) {
1573552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
1574552f7358SJed Brown       PetscInt coneSize, supportSize;
1575552f7358SJed Brown 
1576552f7358SJed Brown       ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
1577552f7358SJed Brown       ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
1578552f7358SJed Brown       if (!supportSize && coneSize) {
1579aa50250dSMatthew G. Knepley         ierr = DMLabelSetValue(label, p, 1);CHKERRQ(ierr);
1580552f7358SJed Brown       }
1581552f7358SJed Brown     }
1582552f7358SJed Brown   } else {
158374ef644bSMatthew G. Knepley     IS       pointIS;
158474ef644bSMatthew G. Knepley     PetscInt numPoints = 0, level = 0;
1585552f7358SJed Brown 
158674ef644bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
158774ef644bSMatthew G. Knepley     if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
158874ef644bSMatthew G. Knepley     while (numPoints) {
158974ef644bSMatthew G. Knepley       const PetscInt *points;
159074ef644bSMatthew G. Knepley       const PetscInt  newLevel = level+1;
159174ef644bSMatthew G. Knepley 
159274ef644bSMatthew G. Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
159374ef644bSMatthew G. Knepley       for (p = 0; p < numPoints; ++p) {
159474ef644bSMatthew G. Knepley         const PetscInt  point = points[p];
159574ef644bSMatthew G. Knepley         const PetscInt *support;
159674ef644bSMatthew G. Knepley         PetscInt        supportSize, s;
159774ef644bSMatthew G. Knepley 
159874ef644bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
159974ef644bSMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
160074ef644bSMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
160174ef644bSMatthew G. Knepley           ierr = DMLabelSetValue(label, support[s], newLevel);CHKERRQ(ierr);
1602552f7358SJed Brown         }
1603552f7358SJed Brown       }
16045edfc765SMatthew G. Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
160574ef644bSMatthew G. Knepley       ++level;
160674ef644bSMatthew G. Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
160774ef644bSMatthew G. Knepley       ierr = DMLabelGetStratumIS(label, level, &pointIS);CHKERRQ(ierr);
160874ef644bSMatthew G. Knepley       if (pointIS) {ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);}
160974ef644bSMatthew G. Knepley       else         {numPoints = 0;}
161074ef644bSMatthew G. Knepley     }
161174ef644bSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
161274ef644bSMatthew G. Knepley   }
1613552f7358SJed Brown   ierr = PetscLogEventEnd(DMPLEX_Stratify,dm,0,0,0);CHKERRQ(ierr);
1614552f7358SJed Brown   PetscFunctionReturn(0);
1615552f7358SJed Brown }
1616552f7358SJed Brown 
1617552f7358SJed Brown #undef __FUNCT__
1618552f7358SJed Brown #define __FUNCT__ "DMPlexGetJoin"
1619552f7358SJed Brown /*@C
1620552f7358SJed Brown   DMPlexGetJoin - Get an array for the join of the set of points
1621552f7358SJed Brown 
1622552f7358SJed Brown   Not Collective
1623552f7358SJed Brown 
1624552f7358SJed Brown   Input Parameters:
1625552f7358SJed Brown + dm - The DMPlex object
1626552f7358SJed Brown . numPoints - The number of input points for the join
1627552f7358SJed Brown - points - The input points
1628552f7358SJed Brown 
1629552f7358SJed Brown   Output Parameters:
1630552f7358SJed Brown + numCoveredPoints - The number of points in the join
1631552f7358SJed Brown - coveredPoints - The points in the join
1632552f7358SJed Brown 
1633552f7358SJed Brown   Level: intermediate
1634552f7358SJed Brown 
1635552f7358SJed Brown   Note: Currently, this is restricted to a single level join
1636552f7358SJed Brown 
16373813dfbdSMatthew G Knepley   Fortran Notes:
16383813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
16393813dfbdSMatthew G Knepley   include petsc.h90 in your code.
16403813dfbdSMatthew G Knepley 
16413813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
16423813dfbdSMatthew G Knepley 
1643552f7358SJed Brown .keywords: mesh
1644552f7358SJed Brown .seealso: DMPlexRestoreJoin(), DMPlexGetMeet()
1645552f7358SJed Brown @*/
1646552f7358SJed Brown PetscErrorCode DMPlexGetJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1647552f7358SJed Brown {
1648552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1649552f7358SJed Brown   PetscInt      *join[2];
1650552f7358SJed Brown   PetscInt       joinSize, i = 0;
1651552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1652552f7358SJed Brown   PetscErrorCode ierr;
1653552f7358SJed Brown 
1654552f7358SJed Brown   PetscFunctionBegin;
1655552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1656552f7358SJed Brown   PetscValidPointer(points, 2);
1657552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1658552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1659552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1660552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1661552f7358SJed Brown   /* Copy in support of first point */
1662552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->supportSection, points[0], &dof);CHKERRQ(ierr);
1663552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->supportSection, points[0], &off);CHKERRQ(ierr);
1664552f7358SJed Brown   for (joinSize = 0; joinSize < dof; ++joinSize) {
1665552f7358SJed Brown     join[i][joinSize] = mesh->supports[off+joinSize];
1666552f7358SJed Brown   }
1667552f7358SJed Brown   /* Check each successive support */
1668552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1669552f7358SJed Brown     PetscInt newJoinSize = 0;
1670552f7358SJed Brown 
1671552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->supportSection, points[p], &dof);CHKERRQ(ierr);
1672552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->supportSection, points[p], &off);CHKERRQ(ierr);
1673552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1674552f7358SJed Brown       const PetscInt point = mesh->supports[off+c];
1675552f7358SJed Brown 
1676552f7358SJed Brown       for (m = 0; m < joinSize; ++m) {
1677552f7358SJed Brown         if (point == join[i][m]) {
1678552f7358SJed Brown           join[1-i][newJoinSize++] = point;
1679552f7358SJed Brown           break;
1680552f7358SJed Brown         }
1681552f7358SJed Brown       }
1682552f7358SJed Brown     }
1683552f7358SJed Brown     joinSize = newJoinSize;
1684552f7358SJed Brown     i        = 1-i;
1685552f7358SJed Brown   }
1686552f7358SJed Brown   *numCoveredPoints = joinSize;
1687552f7358SJed Brown   *coveredPoints    = join[i];
1688552f7358SJed Brown   ierr              = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1689552f7358SJed Brown   PetscFunctionReturn(0);
1690552f7358SJed Brown }
1691552f7358SJed Brown 
1692552f7358SJed Brown #undef __FUNCT__
1693552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreJoin"
1694552f7358SJed Brown /*@C
1695552f7358SJed Brown   DMPlexRestoreJoin - Restore an array for the join of the set of points
1696552f7358SJed Brown 
1697552f7358SJed Brown   Not Collective
1698552f7358SJed Brown 
1699552f7358SJed Brown   Input Parameters:
1700552f7358SJed Brown + dm - The DMPlex object
1701552f7358SJed Brown . numPoints - The number of input points for the join
1702552f7358SJed Brown - points - The input points
1703552f7358SJed Brown 
1704552f7358SJed Brown   Output Parameters:
1705552f7358SJed Brown + numCoveredPoints - The number of points in the join
1706552f7358SJed Brown - coveredPoints - The points in the join
1707552f7358SJed Brown 
17083813dfbdSMatthew G Knepley   Fortran Notes:
17093813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
17103813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17113813dfbdSMatthew G Knepley 
17123813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17133813dfbdSMatthew G Knepley 
1714552f7358SJed Brown   Level: intermediate
1715552f7358SJed Brown 
1716552f7358SJed Brown .keywords: mesh
1717552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexGetFullJoin(), DMPlexGetMeet()
1718552f7358SJed Brown @*/
1719552f7358SJed Brown PetscErrorCode DMPlexRestoreJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1720552f7358SJed Brown {
1721552f7358SJed Brown   PetscErrorCode ierr;
1722552f7358SJed Brown 
1723552f7358SJed Brown   PetscFunctionBegin;
1724552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1725d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
1726d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
1727d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints, 5);
1728552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1729d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
1730552f7358SJed Brown   PetscFunctionReturn(0);
1731552f7358SJed Brown }
1732552f7358SJed Brown 
1733552f7358SJed Brown #undef __FUNCT__
1734552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullJoin"
1735552f7358SJed Brown /*@C
1736552f7358SJed Brown   DMPlexGetFullJoin - Get an array for the join of the set of points
1737552f7358SJed Brown 
1738552f7358SJed Brown   Not Collective
1739552f7358SJed Brown 
1740552f7358SJed Brown   Input Parameters:
1741552f7358SJed Brown + dm - The DMPlex object
1742552f7358SJed Brown . numPoints - The number of input points for the join
1743552f7358SJed Brown - points - The input points
1744552f7358SJed Brown 
1745552f7358SJed Brown   Output Parameters:
1746552f7358SJed Brown + numCoveredPoints - The number of points in the join
1747552f7358SJed Brown - coveredPoints - The points in the join
1748552f7358SJed Brown 
17493813dfbdSMatthew G Knepley   Fortran Notes:
17503813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
17513813dfbdSMatthew G Knepley   include petsc.h90 in your code.
17523813dfbdSMatthew G Knepley 
17533813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
17543813dfbdSMatthew G Knepley 
1755552f7358SJed Brown   Level: intermediate
1756552f7358SJed Brown 
1757552f7358SJed Brown .keywords: mesh
1758552f7358SJed Brown .seealso: DMPlexGetJoin(), DMPlexRestoreJoin(), DMPlexGetMeet()
1759552f7358SJed Brown @*/
1760552f7358SJed Brown PetscErrorCode DMPlexGetFullJoin(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1761552f7358SJed Brown {
1762552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1763552f7358SJed Brown   PetscInt      *offsets, **closures;
1764552f7358SJed Brown   PetscInt      *join[2];
1765552f7358SJed Brown   PetscInt       depth = 0, maxSize, joinSize = 0, i = 0;
1766552f7358SJed Brown   PetscInt       p, d, c, m;
1767552f7358SJed Brown   PetscErrorCode ierr;
1768552f7358SJed Brown 
1769552f7358SJed Brown   PetscFunctionBegin;
1770552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1771552f7358SJed Brown   PetscValidPointer(points, 2);
1772552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1773552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1774552f7358SJed Brown 
1775552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
17761795a4d1SJed Brown   ierr    = PetscCalloc1(numPoints, &closures);CHKERRQ(ierr);
1777552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1778e7b80042SMatthew G. Knepley   maxSize = PetscPowInt(mesh->maxSupportSize,depth+1);
1779552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[0]);CHKERRQ(ierr);
1780552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &join[1]);CHKERRQ(ierr);
1781552f7358SJed Brown 
1782552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
1783552f7358SJed Brown     PetscInt closureSize;
1784552f7358SJed Brown 
1785552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closures[p]);CHKERRQ(ierr);
17860d644c17SKarl Rupp 
1787552f7358SJed Brown     offsets[p*(depth+2)+0] = 0;
1788552f7358SJed Brown     for (d = 0; d < depth+1; ++d) {
1789552f7358SJed Brown       PetscInt pStart, pEnd, i;
1790552f7358SJed Brown 
1791552f7358SJed Brown       ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
1792552f7358SJed Brown       for (i = offsets[p*(depth+2)+d]; i < closureSize; ++i) {
1793552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
1794552f7358SJed Brown           offsets[p*(depth+2)+d+1] = i;
1795552f7358SJed Brown           break;
1796552f7358SJed Brown         }
1797552f7358SJed Brown       }
1798552f7358SJed Brown       if (i == closureSize) offsets[p*(depth+2)+d+1] = i;
1799552f7358SJed Brown     }
180082f516ccSBarry 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);
1801552f7358SJed Brown   }
1802552f7358SJed Brown   for (d = 0; d < depth+1; ++d) {
1803552f7358SJed Brown     PetscInt dof;
1804552f7358SJed Brown 
1805552f7358SJed Brown     /* Copy in support of first point */
1806552f7358SJed Brown     dof = offsets[d+1] - offsets[d];
1807552f7358SJed Brown     for (joinSize = 0; joinSize < dof; ++joinSize) {
1808552f7358SJed Brown       join[i][joinSize] = closures[0][(offsets[d]+joinSize)*2];
1809552f7358SJed Brown     }
1810552f7358SJed Brown     /* Check each successive cone */
1811552f7358SJed Brown     for (p = 1; p < numPoints && joinSize; ++p) {
1812552f7358SJed Brown       PetscInt newJoinSize = 0;
1813552f7358SJed Brown 
1814552f7358SJed Brown       dof = offsets[p*(depth+2)+d+1] - offsets[p*(depth+2)+d];
1815552f7358SJed Brown       for (c = 0; c < dof; ++c) {
1816552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(depth+2)+d]+c)*2];
1817552f7358SJed Brown 
1818552f7358SJed Brown         for (m = 0; m < joinSize; ++m) {
1819552f7358SJed Brown           if (point == join[i][m]) {
1820552f7358SJed Brown             join[1-i][newJoinSize++] = point;
1821552f7358SJed Brown             break;
1822552f7358SJed Brown           }
1823552f7358SJed Brown         }
1824552f7358SJed Brown       }
1825552f7358SJed Brown       joinSize = newJoinSize;
1826552f7358SJed Brown       i        = 1-i;
1827552f7358SJed Brown     }
1828552f7358SJed Brown     if (joinSize) break;
1829552f7358SJed Brown   }
1830552f7358SJed Brown   *numCoveredPoints = joinSize;
1831552f7358SJed Brown   *coveredPoints    = join[i];
1832552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
18330298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, NULL, &closures[p]);CHKERRQ(ierr);
1834552f7358SJed Brown   }
1835552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
1836552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(depth+2), PETSC_INT, &offsets);CHKERRQ(ierr);
1837552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxSupportSize, PETSC_INT, &join[1-i]);CHKERRQ(ierr);
1838552f7358SJed Brown   PetscFunctionReturn(0);
1839552f7358SJed Brown }
1840552f7358SJed Brown 
1841552f7358SJed Brown #undef __FUNCT__
1842552f7358SJed Brown #define __FUNCT__ "DMPlexGetMeet"
1843552f7358SJed Brown /*@C
1844552f7358SJed Brown   DMPlexGetMeet - Get an array for the meet of the set of points
1845552f7358SJed Brown 
1846552f7358SJed Brown   Not Collective
1847552f7358SJed Brown 
1848552f7358SJed Brown   Input Parameters:
1849552f7358SJed Brown + dm - The DMPlex object
1850552f7358SJed Brown . numPoints - The number of input points for the meet
1851552f7358SJed Brown - points - The input points
1852552f7358SJed Brown 
1853552f7358SJed Brown   Output Parameters:
1854552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1855552f7358SJed Brown - coveredPoints - The points in the meet
1856552f7358SJed Brown 
1857552f7358SJed Brown   Level: intermediate
1858552f7358SJed Brown 
1859552f7358SJed Brown   Note: Currently, this is restricted to a single level meet
1860552f7358SJed Brown 
18613813dfbdSMatthew G Knepley   Fortran Notes:
18623813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
18633813dfbdSMatthew G Knepley   include petsc.h90 in your code.
18643813dfbdSMatthew G Knepley 
18653813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
18663813dfbdSMatthew G Knepley 
1867552f7358SJed Brown .keywords: mesh
1868552f7358SJed Brown .seealso: DMPlexRestoreMeet(), DMPlexGetJoin()
1869552f7358SJed Brown @*/
1870552f7358SJed Brown PetscErrorCode DMPlexGetMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveringPoints, const PetscInt **coveringPoints)
1871552f7358SJed Brown {
1872552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1873552f7358SJed Brown   PetscInt      *meet[2];
1874552f7358SJed Brown   PetscInt       meetSize, i = 0;
1875552f7358SJed Brown   PetscInt       dof, off, p, c, m;
1876552f7358SJed Brown   PetscErrorCode ierr;
1877552f7358SJed Brown 
1878552f7358SJed Brown   PetscFunctionBegin;
1879552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1880552f7358SJed Brown   PetscValidPointer(points, 2);
1881552f7358SJed Brown   PetscValidPointer(numCoveringPoints, 3);
1882552f7358SJed Brown   PetscValidPointer(coveringPoints, 4);
1883552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
1884552f7358SJed Brown   ierr = DMGetWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
1885552f7358SJed Brown   /* Copy in cone of first point */
1886552f7358SJed Brown   ierr = PetscSectionGetDof(mesh->coneSection, points[0], &dof);CHKERRQ(ierr);
1887552f7358SJed Brown   ierr = PetscSectionGetOffset(mesh->coneSection, points[0], &off);CHKERRQ(ierr);
1888552f7358SJed Brown   for (meetSize = 0; meetSize < dof; ++meetSize) {
1889552f7358SJed Brown     meet[i][meetSize] = mesh->cones[off+meetSize];
1890552f7358SJed Brown   }
1891552f7358SJed Brown   /* Check each successive cone */
1892552f7358SJed Brown   for (p = 1; p < numPoints; ++p) {
1893552f7358SJed Brown     PetscInt newMeetSize = 0;
1894552f7358SJed Brown 
1895552f7358SJed Brown     ierr = PetscSectionGetDof(mesh->coneSection, points[p], &dof);CHKERRQ(ierr);
1896552f7358SJed Brown     ierr = PetscSectionGetOffset(mesh->coneSection, points[p], &off);CHKERRQ(ierr);
1897552f7358SJed Brown     for (c = 0; c < dof; ++c) {
1898552f7358SJed Brown       const PetscInt point = mesh->cones[off+c];
1899552f7358SJed Brown 
1900552f7358SJed Brown       for (m = 0; m < meetSize; ++m) {
1901552f7358SJed Brown         if (point == meet[i][m]) {
1902552f7358SJed Brown           meet[1-i][newMeetSize++] = point;
1903552f7358SJed Brown           break;
1904552f7358SJed Brown         }
1905552f7358SJed Brown       }
1906552f7358SJed Brown     }
1907552f7358SJed Brown     meetSize = newMeetSize;
1908552f7358SJed Brown     i        = 1-i;
1909552f7358SJed Brown   }
1910552f7358SJed Brown   *numCoveringPoints = meetSize;
1911552f7358SJed Brown   *coveringPoints    = meet[i];
1912552f7358SJed Brown   ierr               = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
1913552f7358SJed Brown   PetscFunctionReturn(0);
1914552f7358SJed Brown }
1915552f7358SJed Brown 
1916552f7358SJed Brown #undef __FUNCT__
1917552f7358SJed Brown #define __FUNCT__ "DMPlexRestoreMeet"
1918552f7358SJed Brown /*@C
1919552f7358SJed Brown   DMPlexRestoreMeet - Restore an array for the meet of the set of points
1920552f7358SJed Brown 
1921552f7358SJed Brown   Not Collective
1922552f7358SJed Brown 
1923552f7358SJed Brown   Input Parameters:
1924552f7358SJed Brown + dm - The DMPlex object
1925552f7358SJed Brown . numPoints - The number of input points for the meet
1926552f7358SJed Brown - points - The input points
1927552f7358SJed Brown 
1928552f7358SJed Brown   Output Parameters:
1929552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1930552f7358SJed Brown - coveredPoints - The points in the meet
1931552f7358SJed Brown 
1932552f7358SJed Brown   Level: intermediate
1933552f7358SJed Brown 
19343813dfbdSMatthew G Knepley   Fortran Notes:
19353813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
19363813dfbdSMatthew G Knepley   include petsc.h90 in your code.
19373813dfbdSMatthew G Knepley 
19383813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
19393813dfbdSMatthew G Knepley 
1940552f7358SJed Brown .keywords: mesh
1941552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexGetFullMeet(), DMPlexGetJoin()
1942552f7358SJed Brown @*/
1943552f7358SJed Brown PetscErrorCode DMPlexRestoreMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1944552f7358SJed Brown {
1945552f7358SJed Brown   PetscErrorCode ierr;
1946552f7358SJed Brown 
1947552f7358SJed Brown   PetscFunctionBegin;
1948552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1949d7902bd2SMatthew G. Knepley   if (points) PetscValidIntPointer(points,3);
1950d7902bd2SMatthew G. Knepley   if (numCoveredPoints) PetscValidIntPointer(numCoveredPoints,4);
1951d7902bd2SMatthew G. Knepley   PetscValidPointer(coveredPoints,5);
1952552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, 0, PETSC_INT, (void*) coveredPoints);CHKERRQ(ierr);
1953d7902bd2SMatthew G. Knepley   if (numCoveredPoints) *numCoveredPoints = 0;
1954552f7358SJed Brown   PetscFunctionReturn(0);
1955552f7358SJed Brown }
1956552f7358SJed Brown 
1957552f7358SJed Brown #undef __FUNCT__
1958552f7358SJed Brown #define __FUNCT__ "DMPlexGetFullMeet"
1959552f7358SJed Brown /*@C
1960552f7358SJed Brown   DMPlexGetFullMeet - Get an array for the meet of the set of points
1961552f7358SJed Brown 
1962552f7358SJed Brown   Not Collective
1963552f7358SJed Brown 
1964552f7358SJed Brown   Input Parameters:
1965552f7358SJed Brown + dm - The DMPlex object
1966552f7358SJed Brown . numPoints - The number of input points for the meet
1967552f7358SJed Brown - points - The input points
1968552f7358SJed Brown 
1969552f7358SJed Brown   Output Parameters:
1970552f7358SJed Brown + numCoveredPoints - The number of points in the meet
1971552f7358SJed Brown - coveredPoints - The points in the meet
1972552f7358SJed Brown 
1973552f7358SJed Brown   Level: intermediate
1974552f7358SJed Brown 
19753813dfbdSMatthew G Knepley   Fortran Notes:
19763813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
19773813dfbdSMatthew G Knepley   include petsc.h90 in your code.
19783813dfbdSMatthew G Knepley 
19793813dfbdSMatthew G Knepley   The numCoveredPoints argument is not present in the Fortran 90 binding since it is internal to the array.
19803813dfbdSMatthew G Knepley 
1981552f7358SJed Brown .keywords: mesh
1982552f7358SJed Brown .seealso: DMPlexGetMeet(), DMPlexRestoreMeet(), DMPlexGetJoin()
1983552f7358SJed Brown @*/
1984552f7358SJed Brown PetscErrorCode DMPlexGetFullMeet(DM dm, PetscInt numPoints, const PetscInt points[], PetscInt *numCoveredPoints, const PetscInt **coveredPoints)
1985552f7358SJed Brown {
1986552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
1987552f7358SJed Brown   PetscInt      *offsets, **closures;
1988552f7358SJed Brown   PetscInt      *meet[2];
1989552f7358SJed Brown   PetscInt       height = 0, maxSize, meetSize = 0, i = 0;
1990552f7358SJed Brown   PetscInt       p, h, c, m;
1991552f7358SJed Brown   PetscErrorCode ierr;
1992552f7358SJed Brown 
1993552f7358SJed Brown   PetscFunctionBegin;
1994552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1995552f7358SJed Brown   PetscValidPointer(points, 2);
1996552f7358SJed Brown   PetscValidPointer(numCoveredPoints, 3);
1997552f7358SJed Brown   PetscValidPointer(coveredPoints, 4);
1998552f7358SJed Brown 
1999552f7358SJed Brown   ierr    = DMPlexGetDepth(dm, &height);CHKERRQ(ierr);
2000785e854fSJed Brown   ierr    = PetscMalloc1(numPoints, &closures);CHKERRQ(ierr);
2001552f7358SJed Brown   ierr    = DMGetWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
2002e7b80042SMatthew G. Knepley   maxSize = PetscPowInt(mesh->maxConeSize,height+1);
2003552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[0]);CHKERRQ(ierr);
2004552f7358SJed Brown   ierr    = DMGetWorkArray(dm, maxSize, PETSC_INT, &meet[1]);CHKERRQ(ierr);
2005552f7358SJed Brown 
2006552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
2007552f7358SJed Brown     PetscInt closureSize;
2008552f7358SJed Brown 
2009552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closures[p]);CHKERRQ(ierr);
20100d644c17SKarl Rupp 
2011552f7358SJed Brown     offsets[p*(height+2)+0] = 0;
2012552f7358SJed Brown     for (h = 0; h < height+1; ++h) {
2013552f7358SJed Brown       PetscInt pStart, pEnd, i;
2014552f7358SJed Brown 
2015552f7358SJed Brown       ierr = DMPlexGetHeightStratum(dm, h, &pStart, &pEnd);CHKERRQ(ierr);
2016552f7358SJed Brown       for (i = offsets[p*(height+2)+h]; i < closureSize; ++i) {
2017552f7358SJed Brown         if ((pStart > closures[p][i*2]) || (pEnd <= closures[p][i*2])) {
2018552f7358SJed Brown           offsets[p*(height+2)+h+1] = i;
2019552f7358SJed Brown           break;
2020552f7358SJed Brown         }
2021552f7358SJed Brown       }
2022552f7358SJed Brown       if (i == closureSize) offsets[p*(height+2)+h+1] = i;
2023552f7358SJed Brown     }
202482f516ccSBarry 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);
2025552f7358SJed Brown   }
2026552f7358SJed Brown   for (h = 0; h < height+1; ++h) {
2027552f7358SJed Brown     PetscInt dof;
2028552f7358SJed Brown 
2029552f7358SJed Brown     /* Copy in cone of first point */
2030552f7358SJed Brown     dof = offsets[h+1] - offsets[h];
2031552f7358SJed Brown     for (meetSize = 0; meetSize < dof; ++meetSize) {
2032552f7358SJed Brown       meet[i][meetSize] = closures[0][(offsets[h]+meetSize)*2];
2033552f7358SJed Brown     }
2034552f7358SJed Brown     /* Check each successive cone */
2035552f7358SJed Brown     for (p = 1; p < numPoints && meetSize; ++p) {
2036552f7358SJed Brown       PetscInt newMeetSize = 0;
2037552f7358SJed Brown 
2038552f7358SJed Brown       dof = offsets[p*(height+2)+h+1] - offsets[p*(height+2)+h];
2039552f7358SJed Brown       for (c = 0; c < dof; ++c) {
2040552f7358SJed Brown         const PetscInt point = closures[p][(offsets[p*(height+2)+h]+c)*2];
2041552f7358SJed Brown 
2042552f7358SJed Brown         for (m = 0; m < meetSize; ++m) {
2043552f7358SJed Brown           if (point == meet[i][m]) {
2044552f7358SJed Brown             meet[1-i][newMeetSize++] = point;
2045552f7358SJed Brown             break;
2046552f7358SJed Brown           }
2047552f7358SJed Brown         }
2048552f7358SJed Brown       }
2049552f7358SJed Brown       meetSize = newMeetSize;
2050552f7358SJed Brown       i        = 1-i;
2051552f7358SJed Brown     }
2052552f7358SJed Brown     if (meetSize) break;
2053552f7358SJed Brown   }
2054552f7358SJed Brown   *numCoveredPoints = meetSize;
2055552f7358SJed Brown   *coveredPoints    = meet[i];
2056552f7358SJed Brown   for (p = 0; p < numPoints; ++p) {
20570298fd71SBarry Smith     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, NULL, &closures[p]);CHKERRQ(ierr);
2058552f7358SJed Brown   }
2059552f7358SJed Brown   ierr = PetscFree(closures);CHKERRQ(ierr);
2060552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numPoints*(height+2), PETSC_INT, &offsets);CHKERRQ(ierr);
2061552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, mesh->maxConeSize, PETSC_INT, &meet[1-i]);CHKERRQ(ierr);
2062552f7358SJed Brown   PetscFunctionReturn(0);
2063552f7358SJed Brown }
2064552f7358SJed Brown 
2065552f7358SJed Brown #undef __FUNCT__
20664e3744c5SMatthew G. Knepley #define __FUNCT__ "DMPlexEqual"
20674e3744c5SMatthew G. Knepley /*@C
20684e3744c5SMatthew G. Knepley   DMPlexEqual - Determine if two DMs have the same topology
20694e3744c5SMatthew G. Knepley 
20704e3744c5SMatthew G. Knepley   Not Collective
20714e3744c5SMatthew G. Knepley 
20724e3744c5SMatthew G. Knepley   Input Parameters:
20734e3744c5SMatthew G. Knepley + dmA - A DMPlex object
20744e3744c5SMatthew G. Knepley - dmB - A DMPlex object
20754e3744c5SMatthew G. Knepley 
20764e3744c5SMatthew G. Knepley   Output Parameters:
20774e3744c5SMatthew G. Knepley . equal - PETSC_TRUE if the topologies are identical
20784e3744c5SMatthew G. Knepley 
20794e3744c5SMatthew G. Knepley   Level: intermediate
20804e3744c5SMatthew G. Knepley 
20814e3744c5SMatthew G. Knepley   Notes:
20824e3744c5SMatthew G. Knepley   We are not solving graph isomorphism, so we do not permutation.
20834e3744c5SMatthew G. Knepley 
20844e3744c5SMatthew G. Knepley .keywords: mesh
20854e3744c5SMatthew G. Knepley .seealso: DMPlexGetCone()
20864e3744c5SMatthew G. Knepley @*/
20874e3744c5SMatthew G. Knepley PetscErrorCode DMPlexEqual(DM dmA, DM dmB, PetscBool *equal)
20884e3744c5SMatthew G. Knepley {
20894e3744c5SMatthew G. Knepley   PetscInt       depth, depthB, pStart, pEnd, pStartB, pEndB, p;
20904e3744c5SMatthew G. Knepley   PetscErrorCode ierr;
20914e3744c5SMatthew G. Knepley 
20924e3744c5SMatthew G. Knepley   PetscFunctionBegin;
20934e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmA, DM_CLASSID, 1);
20944e3744c5SMatthew G. Knepley   PetscValidHeaderSpecific(dmB, DM_CLASSID, 2);
20954e3744c5SMatthew G. Knepley   PetscValidPointer(equal, 3);
20964e3744c5SMatthew G. Knepley 
20974e3744c5SMatthew G. Knepley   *equal = PETSC_FALSE;
20984e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmA, &depth);CHKERRQ(ierr);
20994e3744c5SMatthew G. Knepley   ierr = DMPlexGetDepth(dmB, &depthB);CHKERRQ(ierr);
21004e3744c5SMatthew G. Knepley   if (depth != depthB) PetscFunctionReturn(0);
21014e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmA, &pStart,  &pEnd);CHKERRQ(ierr);
21024e3744c5SMatthew G. Knepley   ierr = DMPlexGetChart(dmB, &pStartB, &pEndB);CHKERRQ(ierr);
21034e3744c5SMatthew G. Knepley   if ((pStart != pStartB) || (pEnd != pEndB)) PetscFunctionReturn(0);
21044e3744c5SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
21054e3744c5SMatthew G. Knepley     const PetscInt *cone, *coneB, *ornt, *orntB, *support, *supportB;
21064e3744c5SMatthew G. Knepley     PetscInt        coneSize, coneSizeB, c, supportSize, supportSizeB, s;
21074e3744c5SMatthew G. Knepley 
21084e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmA, p, &coneSize);CHKERRQ(ierr);
21094e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmA, p, &cone);CHKERRQ(ierr);
21104e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmA, p, &ornt);CHKERRQ(ierr);
21114e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeSize(dmB, p, &coneSizeB);CHKERRQ(ierr);
21124e3744c5SMatthew G. Knepley     ierr = DMPlexGetCone(dmB, p, &coneB);CHKERRQ(ierr);
21134e3744c5SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dmB, p, &orntB);CHKERRQ(ierr);
21144e3744c5SMatthew G. Knepley     if (coneSize != coneSizeB) PetscFunctionReturn(0);
21154e3744c5SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
21164e3744c5SMatthew G. Knepley       if (cone[c] != coneB[c]) PetscFunctionReturn(0);
21174e3744c5SMatthew G. Knepley       if (ornt[c] != orntB[c]) PetscFunctionReturn(0);
21184e3744c5SMatthew G. Knepley     }
21194e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmA, p, &supportSize);CHKERRQ(ierr);
21204e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmA, p, &support);CHKERRQ(ierr);
21214e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmB, p, &supportSizeB);CHKERRQ(ierr);
21224e3744c5SMatthew G. Knepley     ierr = DMPlexGetSupport(dmB, p, &supportB);CHKERRQ(ierr);
21234e3744c5SMatthew G. Knepley     if (supportSize != supportSizeB) PetscFunctionReturn(0);
21244e3744c5SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
21254e3744c5SMatthew G. Knepley       if (support[s] != supportB[s]) PetscFunctionReturn(0);
21264e3744c5SMatthew G. Knepley     }
21274e3744c5SMatthew G. Knepley   }
21284e3744c5SMatthew G. Knepley   *equal = PETSC_TRUE;
21294e3744c5SMatthew G. Knepley   PetscFunctionReturn(0);
21304e3744c5SMatthew G. Knepley }
21314e3744c5SMatthew G. Knepley 
21324e3744c5SMatthew G. Knepley #undef __FUNCT__
213318ad9376SMatthew G. Knepley #define __FUNCT__ "DMPlexGetNumFaceVertices"
213418ad9376SMatthew G. Knepley PetscErrorCode DMPlexGetNumFaceVertices(DM dm, PetscInt cellDim, PetscInt numCorners, PetscInt *numFaceVertices)
2135a6dfd86eSKarl Rupp {
213682f516ccSBarry Smith   MPI_Comm       comm;
2137552f7358SJed Brown   PetscErrorCode ierr;
2138552f7358SJed Brown 
2139552f7358SJed Brown   PetscFunctionBegin;
214082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2141552f7358SJed Brown   PetscValidPointer(numFaceVertices,3);
2142552f7358SJed Brown   switch (cellDim) {
2143552f7358SJed Brown   case 0:
2144552f7358SJed Brown     *numFaceVertices = 0;
2145552f7358SJed Brown     break;
2146552f7358SJed Brown   case 1:
2147552f7358SJed Brown     *numFaceVertices = 1;
2148552f7358SJed Brown     break;
2149552f7358SJed Brown   case 2:
2150552f7358SJed Brown     switch (numCorners) {
215119436ca2SJed Brown     case 3: /* triangle */
215219436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2153552f7358SJed Brown       break;
215419436ca2SJed Brown     case 4: /* quadrilateral */
215519436ca2SJed Brown       *numFaceVertices = 2; /* Edge has 2 vertices */
2156552f7358SJed Brown       break;
215719436ca2SJed Brown     case 6: /* quadratic triangle, tri and quad cohesive Lagrange cells */
215819436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2159552f7358SJed Brown       break;
216019436ca2SJed Brown     case 9: /* quadratic quadrilateral, quadratic quad cohesive Lagrange cells */
216119436ca2SJed Brown       *numFaceVertices = 3; /* Edge has 3 vertices */
2162552f7358SJed Brown       break;
2163552f7358SJed Brown     default:
2164552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2165552f7358SJed Brown     }
2166552f7358SJed Brown     break;
2167552f7358SJed Brown   case 3:
2168552f7358SJed Brown     switch (numCorners) {
216919436ca2SJed Brown     case 4: /* tetradehdron */
217019436ca2SJed Brown       *numFaceVertices = 3; /* Face has 3 vertices */
2171552f7358SJed Brown       break;
217219436ca2SJed Brown     case 6: /* tet cohesive cells */
217319436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2174552f7358SJed Brown       break;
217519436ca2SJed Brown     case 8: /* hexahedron */
217619436ca2SJed Brown       *numFaceVertices = 4; /* Face has 4 vertices */
2177552f7358SJed Brown       break;
217819436ca2SJed Brown     case 9: /* tet cohesive Lagrange cells */
217919436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2180552f7358SJed Brown       break;
218119436ca2SJed Brown     case 10: /* quadratic tetrahedron */
218219436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2183552f7358SJed Brown       break;
218419436ca2SJed Brown     case 12: /* hex cohesive Lagrange cells */
218519436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2186552f7358SJed Brown       break;
218719436ca2SJed Brown     case 18: /* quadratic tet cohesive Lagrange cells */
218819436ca2SJed Brown       *numFaceVertices = 6; /* Face has 6 vertices */
2189552f7358SJed Brown       break;
219019436ca2SJed Brown     case 27: /* quadratic hexahedron, quadratic hex cohesive Lagrange cells */
219119436ca2SJed Brown       *numFaceVertices = 9; /* Face has 9 vertices */
2192552f7358SJed Brown       break;
2193552f7358SJed Brown     default:
2194552f7358SJed Brown       SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid number of face corners %d for dimension %d", numCorners, cellDim);
2195552f7358SJed Brown     }
2196552f7358SJed Brown     break;
2197552f7358SJed Brown   default:
2198552f7358SJed Brown     SETERRQ1(comm, PETSC_ERR_ARG_OUTOFRANGE, "Invalid cell dimension %d", cellDim);
2199552f7358SJed Brown   }
2200552f7358SJed Brown   PetscFunctionReturn(0);
2201552f7358SJed Brown }
2202552f7358SJed Brown 
2203552f7358SJed Brown #undef __FUNCT__
2204d27a0f52SMatthew G. Knepley #define __FUNCT__ "DMPlexOrient"
2205d27a0f52SMatthew G. Knepley /* Trys to give the mesh a consistent orientation */
2206d27a0f52SMatthew G. Knepley PetscErrorCode DMPlexOrient(DM dm)
2207d27a0f52SMatthew G. Knepley {
2208a1b4d4a2SMatthew G. Knepley   PetscBT        seenCells, flippedCells, seenFaces;
2209a1b4d4a2SMatthew G. Knepley   PetscInt      *faceFIFO, fTop, fBottom;
2210a1b4d4a2SMatthew G. Knepley   PetscInt       dim, h, cStart, cEnd, c, fStart, fEnd, face, maxConeSize, *revcone, *revconeO;
2211d27a0f52SMatthew G. Knepley   PetscErrorCode ierr;
2212d27a0f52SMatthew G. Knepley 
2213d27a0f52SMatthew G. Knepley   PetscFunctionBegin;
2214d27a0f52SMatthew G. Knepley   /* Truth Table
2215d27a0f52SMatthew G. Knepley      mismatch    flips   do action   mismatch   flipA ^ flipB   action
2216d27a0f52SMatthew G. Knepley          F       0 flips     no         F             F           F
2217d27a0f52SMatthew G. Knepley          F       1 flip      yes        F             T           T
2218d27a0f52SMatthew G. Knepley          F       2 flips     no         T             F           T
2219d27a0f52SMatthew G. Knepley          T       0 flips     yes        T             T           F
2220d27a0f52SMatthew G. Knepley          T       1 flip      no
2221d27a0f52SMatthew G. Knepley          T       2 flips     yes
2222d27a0f52SMatthew G. Knepley   */
2223a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2224d27a0f52SMatthew G. Knepley   ierr = DMPlexGetVTKCellHeight(dm, &h);CHKERRQ(ierr);
2225a1b4d4a2SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h,   &cStart, &cEnd);CHKERRQ(ierr);
2226d27a0f52SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, h+1, &fStart, &fEnd);CHKERRQ(ierr);
2227a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &seenCells);CHKERRQ(ierr);
2228a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, seenCells);CHKERRQ(ierr);
2229a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(cEnd - cStart, &flippedCells);CHKERRQ(ierr);
2230a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(cEnd - cStart, flippedCells);CHKERRQ(ierr);
2231a1b4d4a2SMatthew G. Knepley   ierr = PetscBTCreate(fEnd - fStart, &seenFaces);CHKERRQ(ierr);
2232a1b4d4a2SMatthew G. Knepley   ierr = PetscBTMemzero(fEnd - fStart, seenFaces);CHKERRQ(ierr);
2233785e854fSJed Brown   ierr = PetscMalloc1((fEnd - fStart), &faceFIFO);CHKERRQ(ierr);
2234a1b4d4a2SMatthew G. Knepley   fTop = fBottom = 0;
2235a1b4d4a2SMatthew G. Knepley   /* Initialize FIFO with first cell */
2236defeeaeaSMatthew G. Knepley   if (cEnd > cStart) {
2237a1b4d4a2SMatthew G. Knepley     const PetscInt *cone;
2238a1b4d4a2SMatthew G. Knepley     PetscInt        coneSize;
2239a1b4d4a2SMatthew G. Knepley 
2240a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cStart, &coneSize);CHKERRQ(ierr);
2241a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, cStart, &cone);CHKERRQ(ierr);
2242a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
2243a1b4d4a2SMatthew G. Knepley       faceFIFO[fBottom++] = cone[c];
2244a1b4d4a2SMatthew G. Knepley       ierr = PetscBTSet(seenFaces, cone[c]-fStart);CHKERRQ(ierr);
2245a1b4d4a2SMatthew G. Knepley     }
2246a1b4d4a2SMatthew G. Knepley   }
2247a1b4d4a2SMatthew G. Knepley   /* Consider each face in FIFO */
2248a1b4d4a2SMatthew G. Knepley   while (fTop < fBottom) {
2249d27a0f52SMatthew G. Knepley     const PetscInt *support, *coneA, *coneB, *coneOA, *coneOB;
2250a1b4d4a2SMatthew G. Knepley     PetscInt        supportSize, coneSizeA, coneSizeB, posA = -1, posB = -1;
2251d27a0f52SMatthew G. Knepley     PetscInt        seenA, flippedA, seenB, flippedB, mismatch;
2252d27a0f52SMatthew G. Knepley 
2253a1b4d4a2SMatthew G. Knepley     face = faceFIFO[fTop++];
2254a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2255a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2256d27a0f52SMatthew G. Knepley     if (supportSize < 2) continue;
2257d27a0f52SMatthew G. Knepley     if (supportSize != 2) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Faces should separate only two cells, not %d", supportSize);
2258a1b4d4a2SMatthew G. Knepley     seenA    = PetscBTLookup(seenCells,    support[0]-cStart);
225986cff514SMatthew G. Knepley     flippedA = PetscBTLookup(flippedCells, support[0]-cStart) ? 1 : 0;
2260a1b4d4a2SMatthew G. Knepley     seenB    = PetscBTLookup(seenCells,    support[1]-cStart);
226186cff514SMatthew G. Knepley     flippedB = PetscBTLookup(flippedCells, support[1]-cStart) ? 1 : 0;
2262d27a0f52SMatthew G. Knepley 
2263d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[0], &coneSizeA);CHKERRQ(ierr);
2264d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, support[1], &coneSizeB);CHKERRQ(ierr);
2265d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[0], &coneA);CHKERRQ(ierr);
2266d27a0f52SMatthew G. Knepley     ierr = DMPlexGetCone(dm, support[1], &coneB);CHKERRQ(ierr);
2267d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[0], &coneOA);CHKERRQ(ierr);
2268d27a0f52SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, support[1], &coneOB);CHKERRQ(ierr);
2269a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeA; ++c) {
2270a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneA[c]-fStart)) {
2271a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneA[c];
2272a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneA[c]-fStart);CHKERRQ(ierr);
2273a1b4d4a2SMatthew G. Knepley       }
2274a1b4d4a2SMatthew G. Knepley       if (coneA[c] == face) posA = c;
2275a1b4d4a2SMatthew 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);
2276a1b4d4a2SMatthew G. Knepley     }
2277a1b4d4a2SMatthew 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]);
2278a1b4d4a2SMatthew G. Knepley     for (c = 0; c < coneSizeB; ++c) {
2279a1b4d4a2SMatthew G. Knepley       if (!PetscBTLookup(seenFaces, coneB[c]-fStart)) {
2280a1b4d4a2SMatthew G. Knepley         faceFIFO[fBottom++] = coneB[c];
2281a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(seenFaces, coneB[c]-fStart);CHKERRQ(ierr);
2282a1b4d4a2SMatthew G. Knepley       }
2283a1b4d4a2SMatthew G. Knepley       if (coneB[c] == face) posB = c;
2284a1b4d4a2SMatthew 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);
2285a1b4d4a2SMatthew G. Knepley     }
2286a1b4d4a2SMatthew 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]);
2287d27a0f52SMatthew G. Knepley 
2288d27a0f52SMatthew G. Knepley     if (dim == 1) {
2289d27a0f52SMatthew G. Knepley       mismatch = posA == posB;
2290d27a0f52SMatthew G. Knepley     } else {
2291d27a0f52SMatthew G. Knepley       mismatch = coneOA[posA] == coneOB[posB];
2292d27a0f52SMatthew G. Knepley     }
2293d27a0f52SMatthew G. Knepley 
2294d27a0f52SMatthew G. Knepley     if (mismatch ^ (flippedA ^ flippedB)) {
2295d27a0f52SMatthew 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]);
2296d27a0f52SMatthew G. Knepley       if (!seenA && !flippedA) {
2297a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[0]-cStart);CHKERRQ(ierr);
2298d27a0f52SMatthew G. Knepley       } else if (!seenB && !flippedB) {
2299a1b4d4a2SMatthew G. Knepley         ierr = PetscBTSet(flippedCells, support[1]-cStart);CHKERRQ(ierr);
2300d27a0f52SMatthew G. Knepley       } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
230186cff514SMatthew 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");
2302a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[0]-cStart);CHKERRQ(ierr);
2303a1b4d4a2SMatthew G. Knepley     ierr = PetscBTSet(seenCells, support[1]-cStart);CHKERRQ(ierr);
2304d27a0f52SMatthew G. Knepley   }
2305fedde076SMatthew G. Knepley   /* Now all subdomains are oriented, but we need a consistent parallel orientation */
2306fedde076SMatthew G. Knepley   {
2307fedde076SMatthew G. Knepley     /* Find a representative face (edge) separating pairs of procs */
2308fedde076SMatthew G. Knepley     PetscSF            sf;
2309fedde076SMatthew G. Knepley     const PetscInt    *lpoints;
2310fedde076SMatthew G. Knepley     const PetscSFNode *rpoints;
231113048561SMatthew G. Knepley     PetscInt          *neighbors, *nranks;
2312fedde076SMatthew G. Knepley     PetscInt           numLeaves, numRoots, numNeighbors = 0, l, n;
2313a1b4d4a2SMatthew G. Knepley 
2314fedde076SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
2315fedde076SMatthew G. Knepley     ierr = PetscSFGetGraph(sf, &numRoots, &numLeaves, &lpoints, &rpoints);CHKERRQ(ierr);
2316fedde076SMatthew G. Knepley     if (numLeaves >= 0) {
231762ad4a6aSMatthew G. Knepley       const PetscInt *cone, *ornt, *support;
231862ad4a6aSMatthew G. Knepley       PetscInt        coneSize, supportSize;
231962ad4a6aSMatthew G. Knepley       int            *rornt, *lornt; /* PetscSF cannot handle smaller than int */
232013048561SMatthew G. Knepley       PetscBool      *match, flipped = PETSC_FALSE;
232162ad4a6aSMatthew G. Knepley 
2322fedde076SMatthew G. Knepley       ierr = PetscMalloc1(numLeaves,&neighbors);CHKERRQ(ierr);
2323fedde076SMatthew G. Knepley       /* I know this is p^2 time in general, but for bounded degree its alright */
2324fedde076SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2325fedde076SMatthew G. Knepley         const PetscInt face = lpoints[l];
2326fedde076SMatthew G. Knepley         if ((face >= fStart) && (face < fEnd)) {
2327fedde076SMatthew G. Knepley           const PetscInt rank = rpoints[l].rank;
2328fedde076SMatthew G. Knepley           for (n = 0; n < numNeighbors; ++n) if (rank == rpoints[neighbors[n]].rank) break;
2329fedde076SMatthew G. Knepley           if (n >= numNeighbors) {
2330fedde076SMatthew G. Knepley             PetscInt supportSize;
2331fedde076SMatthew G. Knepley             ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2332fedde076SMatthew G. Knepley             if (supportSize != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Boundary faces should see one cell, not %d", supportSize);
2333fedde076SMatthew G. Knepley             neighbors[numNeighbors++] = l;
2334fedde076SMatthew G. Knepley           }
2335fedde076SMatthew G. Knepley         }
2336fedde076SMatthew G. Knepley       }
233713048561SMatthew G. Knepley       ierr = PetscCalloc4(numNeighbors,&match,numNeighbors,&nranks,numRoots,&rornt,numRoots,&lornt);CHKERRQ(ierr);
2338fedde076SMatthew G. Knepley       for (face = fStart; face < fEnd; ++face) {
2339fedde076SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
2340fedde076SMatthew G. Knepley         if (supportSize != 1) continue;
2341fedde076SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
2342fedde076SMatthew G. Knepley 
2343fedde076SMatthew G. Knepley         ierr = DMPlexGetCone(dm, support[0], &cone);CHKERRQ(ierr);
234462ad4a6aSMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, support[0], &coneSize);CHKERRQ(ierr);
2345fedde076SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(dm, support[0], &ornt);CHKERRQ(ierr);
2346fedde076SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) if (cone[c] == face) break;
23475b7033fcSMatthew G. Knepley         if (dim == 1) {
23485b7033fcSMatthew G. Knepley           /* Use cone position instead, shifted to -1 or 1 */
23495b7033fcSMatthew G. Knepley           rornt[face] = c*2-1;
23505b7033fcSMatthew G. Knepley         } else {
2351fedde076SMatthew G. Knepley           if (PetscBTLookup(flippedCells, support[0]-cStart)) rornt[face] = ornt[c] < 0 ? -1 :  1;
2352fedde076SMatthew G. Knepley           else                                                rornt[face] = ornt[c] < 0 ?  1 : -1;
2353fedde076SMatthew G. Knepley         }
23545b7033fcSMatthew G. Knepley       }
2355fedde076SMatthew G. Knepley       /* Mark each edge with match or nomatch */
2356fedde076SMatthew G. Knepley       ierr = PetscSFBcastBegin(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr);
2357fedde076SMatthew G. Knepley       ierr = PetscSFBcastEnd(sf, MPI_INT, rornt, lornt);CHKERRQ(ierr);
2358fedde076SMatthew G. Knepley       for (n = 0; n < numNeighbors; ++n) {
2359fedde076SMatthew G. Knepley         const PetscInt face = lpoints[neighbors[n]];
2360fedde076SMatthew G. Knepley 
236113048561SMatthew G. Knepley         if (rornt[face]*lornt[face] < 0) match[n] = PETSC_TRUE;
236213048561SMatthew G. Knepley         else                             match[n] = PETSC_FALSE;
236313048561SMatthew G. Knepley         nranks[n] = rpoints[neighbors[n]].rank;
2364fedde076SMatthew G. Knepley       }
236513048561SMatthew G. Knepley       /* Collect the graph on 0 */
236613048561SMatthew G. Knepley       {
236713048561SMatthew G. Knepley         MPI_Comm     comm = PetscObjectComm((PetscObject) sf);
236813048561SMatthew G. Knepley         PetscBT      seenProcs, flippedProcs;
236913048561SMatthew G. Knepley         PetscInt    *procFIFO, pTop, pBottom;
237013048561SMatthew G. Knepley         PetscInt    *adj = NULL;
237113048561SMatthew G. Knepley         PetscBool   *val = NULL;
237213048561SMatthew G. Knepley         PetscMPIInt *recvcounts = NULL, *displs = NULL, p;
237313048561SMatthew G. Knepley         PetscMPIInt  N = numNeighbors, numProcs = 0, rank;
237413048561SMatthew G. Knepley         PetscInt     debug = 0;
237513048561SMatthew G. Knepley 
237613048561SMatthew G. Knepley         ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
237713048561SMatthew G. Knepley         if (!rank) {ierr = MPI_Comm_size(comm, &numProcs);CHKERRQ(ierr);}
237813048561SMatthew G. Knepley         ierr = PetscCalloc2(numProcs,&recvcounts,numProcs+1,&displs);CHKERRQ(ierr);
237913048561SMatthew G. Knepley         ierr = MPI_Gather(&N, 1, MPI_INT, recvcounts, 1, MPI_INT, 0, comm);CHKERRQ(ierr);
238013048561SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
238113048561SMatthew G. Knepley           displs[p+1] = displs[p] + recvcounts[p];
238213048561SMatthew G. Knepley         }
238313048561SMatthew G. Knepley         if (!rank) {ierr = PetscMalloc2(displs[numProcs],&adj,displs[numProcs],&val);CHKERRQ(ierr);}
238413048561SMatthew G. Knepley         ierr = MPI_Gatherv(nranks, numNeighbors, MPIU_INT, adj, recvcounts, displs, MPIU_INT, 0, comm);CHKERRQ(ierr);
238513048561SMatthew G. Knepley         ierr = MPI_Gatherv(match, numNeighbors, MPIU_BOOL, val, recvcounts, displs, MPIU_BOOL, 0, comm);CHKERRQ(ierr);
238613048561SMatthew G. Knepley         if (debug) {
238713048561SMatthew G. Knepley           for (p = 0; p < numProcs; ++p) {
238813048561SMatthew G. Knepley             ierr = PetscPrintf(comm, "Proc %d:\n", p);
238913048561SMatthew G. Knepley             for (n = 0; n < recvcounts[p]; ++n) {
239013048561SMatthew G. Knepley               ierr = PetscPrintf(comm, "  edge %d (%d):\n", adj[displs[p]+n], val[displs[p]+n]);
239113048561SMatthew G. Knepley             }
239213048561SMatthew G. Knepley           }
239313048561SMatthew G. Knepley         }
239413048561SMatthew G. Knepley         ierr = PetscBTCreate(numProcs, &seenProcs);CHKERRQ(ierr);
239513048561SMatthew G. Knepley         ierr = PetscBTMemzero(numProcs, seenProcs);CHKERRQ(ierr);
239613048561SMatthew G. Knepley         ierr = PetscBTCreate(numProcs, &flippedProcs);CHKERRQ(ierr);
239713048561SMatthew G. Knepley         ierr = PetscBTMemzero(numProcs, flippedProcs);CHKERRQ(ierr);
239813048561SMatthew G. Knepley         ierr = PetscMalloc1(numProcs,&procFIFO);CHKERRQ(ierr);
239913048561SMatthew G. Knepley         pTop = pBottom = 0;
240013048561SMatthew G. Knepley         for (p = 0; p < numProcs; ++p) {
240113048561SMatthew G. Knepley           if (PetscBTLookup(seenProcs, p)) continue;
240213048561SMatthew G. Knepley           /* Initialize FIFO with next proc */
240313048561SMatthew G. Knepley           procFIFO[pBottom++] = p;
240413048561SMatthew G. Knepley           ierr = PetscBTSet(seenProcs, p);CHKERRQ(ierr);
240513048561SMatthew G. Knepley           /* Consider each proc in FIFO */
240613048561SMatthew G. Knepley           while (pTop < pBottom) {
240713048561SMatthew G. Knepley             PetscInt proc, nproc, seen, flippedA, flippedB, mismatch;
240813048561SMatthew G. Knepley 
240913048561SMatthew G. Knepley             proc     = procFIFO[pTop++];
241013048561SMatthew G. Knepley             flippedA = PetscBTLookup(flippedProcs, proc) ? 1 : 0;
241113048561SMatthew G. Knepley             /* Loop over neighboring procs */
241213048561SMatthew G. Knepley             for (n = 0; n < recvcounts[proc]; ++n) {
241313048561SMatthew G. Knepley               nproc    = adj[displs[proc]+n];
241413048561SMatthew G. Knepley               mismatch = val[displs[proc]+n] ? 0 : 1;
241513048561SMatthew G. Knepley               seen     = PetscBTLookup(seenProcs, nproc);
241613048561SMatthew G. Knepley               flippedB = PetscBTLookup(flippedProcs, nproc) ? 1 : 0;
241713048561SMatthew G. Knepley 
241813048561SMatthew G. Knepley               if (mismatch ^ (flippedA ^ flippedB)) {
241913048561SMatthew G. Knepley                 if (seen) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Previously seen procs %d and %d do not match: Fault mesh is non-orientable", proc, nproc);
242013048561SMatthew G. Knepley                 if (!flippedB) {
242113048561SMatthew G. Knepley                   ierr = PetscBTSet(flippedProcs, nproc);CHKERRQ(ierr);
242213048561SMatthew G. Knepley               } else SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Inconsistent mesh orientation: Fault mesh is non-orientable");
242313048561SMatthew 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");
242413048561SMatthew G. Knepley               if (!seen) {
242513048561SMatthew G. Knepley                 procFIFO[pBottom++] = nproc;
242613048561SMatthew G. Knepley                 ierr = PetscBTSet(seenProcs, nproc);CHKERRQ(ierr);
242713048561SMatthew G. Knepley               }
242813048561SMatthew G. Knepley             }
242913048561SMatthew G. Knepley           }
243013048561SMatthew G. Knepley         }
243113048561SMatthew G. Knepley         ierr = PetscFree(procFIFO);CHKERRQ(ierr);
243213048561SMatthew G. Knepley 
243313048561SMatthew G. Knepley         ierr = PetscFree2(recvcounts,displs);CHKERRQ(ierr);
243413048561SMatthew G. Knepley         ierr = PetscFree2(adj,val);CHKERRQ(ierr);
243513048561SMatthew G. Knepley         {
243613048561SMatthew G. Knepley           PetscBool *flips;
243713048561SMatthew G. Knepley 
243813048561SMatthew G. Knepley           ierr = PetscMalloc1(numProcs,&flips);CHKERRQ(ierr);
243913048561SMatthew G. Knepley           for (p = 0; p < numProcs; ++p) {
244013048561SMatthew G. Knepley             flips[p] = PetscBTLookup(flippedProcs, p) ? PETSC_TRUE : PETSC_FALSE;
244113048561SMatthew G. Knepley             if (debug && flips[p]) {ierr = PetscPrintf(comm, "Flipping Proc %d:\n", p);}
244213048561SMatthew G. Knepley           }
244313048561SMatthew G. Knepley           ierr = MPI_Scatter(flips, 1, MPIU_BOOL, &flipped, 1, MPIU_BOOL, 0, comm);CHKERRQ(ierr);
244413048561SMatthew G. Knepley           ierr = PetscFree(flips);CHKERRQ(ierr);
244513048561SMatthew G. Knepley         }
244613048561SMatthew G. Knepley         ierr = PetscBTDestroy(&seenProcs);CHKERRQ(ierr);
244713048561SMatthew G. Knepley         ierr = PetscBTDestroy(&flippedProcs);CHKERRQ(ierr);
244813048561SMatthew G. Knepley       }
244913048561SMatthew G. Knepley       ierr = PetscFree4(match,nranks,rornt,lornt);CHKERRQ(ierr);
2450fedde076SMatthew G. Knepley       ierr = PetscFree(neighbors);CHKERRQ(ierr);
245113048561SMatthew G. Knepley       if (flipped) {for (c = cStart; c < cEnd; ++c) {ierr = PetscBTNegate(flippedCells, c-cStart);CHKERRQ(ierr);}}
2452fedde076SMatthew G. Knepley     }
2453fedde076SMatthew G. Knepley   }
2454fedde076SMatthew G. Knepley   /* Reverse flipped cells in the mesh */
2455d27a0f52SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2456d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2457d27a0f52SMatthew G. Knepley   ierr = DMGetWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2458a1b4d4a2SMatthew G. Knepley   for (c = cStart; c < cEnd; ++c) {
2459f4e909fcSMatthew G. Knepley     const PetscInt *cone, *coneO, *support;
2460f4e909fcSMatthew G. Knepley     PetscInt        coneSize, supportSize, faceSize, cp, sp;
2461d27a0f52SMatthew G. Knepley 
2462a1b4d4a2SMatthew G. Knepley     if (!PetscBTLookup(flippedCells, c-cStart)) continue;
2463a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2464a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2465a1b4d4a2SMatthew G. Knepley     ierr = DMPlexGetConeOrientation(dm, c, &coneO);CHKERRQ(ierr);
2466a1b4d4a2SMatthew G. Knepley     for (cp = 0; cp < coneSize; ++cp) {
2467a1b4d4a2SMatthew G. Knepley       const PetscInt rcp = coneSize-cp-1;
2468a1b4d4a2SMatthew G. Knepley 
2469a1b4d4a2SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, cone[rcp], &faceSize);CHKERRQ(ierr);
2470a1b4d4a2SMatthew G. Knepley       revcone[cp]  = cone[rcp];
2471a1b4d4a2SMatthew G. Knepley       revconeO[cp] = coneO[rcp] >= 0 ? -(faceSize-coneO[rcp]) : faceSize+coneO[rcp];
2472d27a0f52SMatthew G. Knepley     }
2473a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetCone(dm, c, revcone);CHKERRQ(ierr);
2474a1b4d4a2SMatthew G. Knepley     ierr = DMPlexSetConeOrientation(dm, c, revconeO);CHKERRQ(ierr);
2475f4e909fcSMatthew G. Knepley     /* Reverse orientations of support */
2476f4e909fcSMatthew G. Knepley     faceSize = coneSize;
2477f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, c, &supportSize);CHKERRQ(ierr);
2478f4e909fcSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, c, &support);CHKERRQ(ierr);
2479f4e909fcSMatthew G. Knepley     for (sp = 0; sp < supportSize; ++sp) {
2480f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[sp], &coneSize);CHKERRQ(ierr);
2481f4e909fcSMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[sp], &cone);CHKERRQ(ierr);
2482f4e909fcSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, support[sp], &coneO);CHKERRQ(ierr);
2483f4e909fcSMatthew G. Knepley       for (cp = 0; cp < coneSize; ++cp) {
2484f4e909fcSMatthew G. Knepley         if (cone[cp] != c) continue;
2485f4e909fcSMatthew G. Knepley         ierr = DMPlexInsertConeOrientation(dm, support[sp], cp, coneO[cp] >= 0 ? -(faceSize-coneO[cp]) : faceSize+coneO[cp]);CHKERRQ(ierr);
2486f4e909fcSMatthew G. Knepley       }
2487f4e909fcSMatthew G. Knepley     }
2488d27a0f52SMatthew G. Knepley   }
2489d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revcone);CHKERRQ(ierr);
2490d27a0f52SMatthew G. Knepley   ierr = DMRestoreWorkArray(dm, maxConeSize, PETSC_INT, &revconeO);CHKERRQ(ierr);
2491d27a0f52SMatthew G. Knepley   ierr = PetscBTDestroy(&seenCells);CHKERRQ(ierr);
2492a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&flippedCells);CHKERRQ(ierr);
2493a1b4d4a2SMatthew G. Knepley   ierr = PetscBTDestroy(&seenFaces);CHKERRQ(ierr);
2494a1b4d4a2SMatthew G. Knepley   ierr = PetscFree(faceFIFO);CHKERRQ(ierr);
2495d27a0f52SMatthew G. Knepley   PetscFunctionReturn(0);
2496d27a0f52SMatthew G. Knepley }
2497d27a0f52SMatthew G. Knepley 
2498d27a0f52SMatthew G. Knepley #undef __FUNCT__
24999db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCell"
25009db3b87dSMatthew G. Knepley /*@C
25019db3b87dSMatthew G. Knepley   DMPlexInvertCell - This flips tetrahedron and hexahedron orientation since Plex stores them internally with outward normals. Other cells are left untouched.
25029db3b87dSMatthew G. Knepley 
25039db3b87dSMatthew G. Knepley   Input Parameters:
25049db3b87dSMatthew G. Knepley + numCorners - The number of vertices in a cell
25059db3b87dSMatthew G. Knepley - cone - The incoming cone
25069db3b87dSMatthew G. Knepley 
25079db3b87dSMatthew G. Knepley   Output Parameter:
25089db3b87dSMatthew G. Knepley . cone - The inverted cone (in-place)
25099db3b87dSMatthew G. Knepley 
25109db3b87dSMatthew G. Knepley   Level: developer
25119db3b87dSMatthew G. Knepley 
25129db3b87dSMatthew G. Knepley .seealso: DMPlexGenerate()
25139db3b87dSMatthew G. Knepley @*/
25149db3b87dSMatthew G. Knepley PetscErrorCode DMPlexInvertCell(PetscInt dim, PetscInt numCorners, int cone[])
25152e1b13c2SMatthew G. Knepley {
25169db3b87dSMatthew G. Knepley   int tmpc;
25172e1b13c2SMatthew G. Knepley 
25182e1b13c2SMatthew G. Knepley   PetscFunctionBegin;
25199db3b87dSMatthew G. Knepley   if (dim != 3) PetscFunctionReturn(0);
25209db3b87dSMatthew G. Knepley   switch (numCorners) {
25219db3b87dSMatthew G. Knepley   case 4:
25221885f254SMatthew G. Knepley     tmpc    = cone[0];
25231885f254SMatthew G. Knepley     cone[0] = cone[1];
25241885f254SMatthew G. Knepley     cone[1] = tmpc;
25259db3b87dSMatthew G. Knepley     break;
25269db3b87dSMatthew G. Knepley   case 8:
25279db3b87dSMatthew G. Knepley     tmpc    = cone[1];
25289db3b87dSMatthew G. Knepley     cone[1] = cone[3];
25299db3b87dSMatthew G. Knepley     cone[3] = tmpc;
25309db3b87dSMatthew G. Knepley     break;
25319db3b87dSMatthew G. Knepley   default: break;
25329db3b87dSMatthew G. Knepley   }
25339db3b87dSMatthew G. Knepley   PetscFunctionReturn(0);
25349db3b87dSMatthew G. Knepley }
25359db3b87dSMatthew G. Knepley 
25369db3b87dSMatthew G. Knepley #undef __FUNCT__
25379db3b87dSMatthew G. Knepley #define __FUNCT__ "DMPlexInvertCells_Internal"
25389db3b87dSMatthew G. Knepley /* This is to fix the tetrahedron orientation from TetGen */
25399db3b87dSMatthew G. Knepley PETSC_UNUSED static PetscErrorCode DMPlexInvertCells_Internal(PetscInt dim, PetscInt numCells, PetscInt numCorners, int cells[])
25409db3b87dSMatthew G. Knepley {
25419db3b87dSMatthew G. Knepley   PetscInt       bound = numCells*numCorners, coff;
25429db3b87dSMatthew G. Knepley   PetscErrorCode ierr;
25439db3b87dSMatthew G. Knepley 
25449db3b87dSMatthew G. Knepley   PetscFunctionBegin;
25459db3b87dSMatthew G. Knepley   for (coff = 0; coff < bound; coff += numCorners) {
25469db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCell(dim, numCorners, &cells[coff]);CHKERRQ(ierr);
25472e1b13c2SMatthew G. Knepley   }
25482e1b13c2SMatthew G. Knepley   PetscFunctionReturn(0);
25492e1b13c2SMatthew G. Knepley }
25502e1b13c2SMatthew G. Knepley 
2551519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
2552552f7358SJed Brown #include <triangle.h>
2553552f7358SJed Brown 
2554552f7358SJed Brown #undef __FUNCT__
2555552f7358SJed Brown #define __FUNCT__ "InitInput_Triangle"
25560adebc6cSBarry Smith PetscErrorCode InitInput_Triangle(struct triangulateio *inputCtx)
25570adebc6cSBarry Smith {
2558552f7358SJed Brown   PetscFunctionBegin;
2559552f7358SJed Brown   inputCtx->numberofpoints             = 0;
2560552f7358SJed Brown   inputCtx->numberofpointattributes    = 0;
25610298fd71SBarry Smith   inputCtx->pointlist                  = NULL;
25620298fd71SBarry Smith   inputCtx->pointattributelist         = NULL;
25630298fd71SBarry Smith   inputCtx->pointmarkerlist            = NULL;
2564552f7358SJed Brown   inputCtx->numberofsegments           = 0;
25650298fd71SBarry Smith   inputCtx->segmentlist                = NULL;
25660298fd71SBarry Smith   inputCtx->segmentmarkerlist          = NULL;
2567552f7358SJed Brown   inputCtx->numberoftriangleattributes = 0;
25680298fd71SBarry Smith   inputCtx->trianglelist               = NULL;
2569552f7358SJed Brown   inputCtx->numberofholes              = 0;
25700298fd71SBarry Smith   inputCtx->holelist                   = NULL;
2571552f7358SJed Brown   inputCtx->numberofregions            = 0;
25720298fd71SBarry Smith   inputCtx->regionlist                 = NULL;
2573552f7358SJed Brown   PetscFunctionReturn(0);
2574552f7358SJed Brown }
2575552f7358SJed Brown 
2576552f7358SJed Brown #undef __FUNCT__
2577552f7358SJed Brown #define __FUNCT__ "InitOutput_Triangle"
25780adebc6cSBarry Smith PetscErrorCode InitOutput_Triangle(struct triangulateio *outputCtx)
25790adebc6cSBarry Smith {
2580552f7358SJed Brown   PetscFunctionBegin;
2581552f7358SJed Brown   outputCtx->numberofpoints        = 0;
25820298fd71SBarry Smith   outputCtx->pointlist             = NULL;
25830298fd71SBarry Smith   outputCtx->pointattributelist    = NULL;
25840298fd71SBarry Smith   outputCtx->pointmarkerlist       = NULL;
2585552f7358SJed Brown   outputCtx->numberoftriangles     = 0;
25860298fd71SBarry Smith   outputCtx->trianglelist          = NULL;
25870298fd71SBarry Smith   outputCtx->triangleattributelist = NULL;
25880298fd71SBarry Smith   outputCtx->neighborlist          = NULL;
25890298fd71SBarry Smith   outputCtx->segmentlist           = NULL;
25900298fd71SBarry Smith   outputCtx->segmentmarkerlist     = NULL;
2591552f7358SJed Brown   outputCtx->numberofedges         = 0;
25920298fd71SBarry Smith   outputCtx->edgelist              = NULL;
25930298fd71SBarry Smith   outputCtx->edgemarkerlist        = NULL;
2594552f7358SJed Brown   PetscFunctionReturn(0);
2595552f7358SJed Brown }
2596552f7358SJed Brown 
2597552f7358SJed Brown #undef __FUNCT__
2598552f7358SJed Brown #define __FUNCT__ "FiniOutput_Triangle"
25990adebc6cSBarry Smith PetscErrorCode FiniOutput_Triangle(struct triangulateio *outputCtx)
26000adebc6cSBarry Smith {
2601552f7358SJed Brown   PetscFunctionBegin;
260223b0c128SMatthew G. Knepley   free(outputCtx->pointlist);
2603552f7358SJed Brown   free(outputCtx->pointmarkerlist);
260423b0c128SMatthew G. Knepley   free(outputCtx->segmentlist);
260523b0c128SMatthew G. Knepley   free(outputCtx->segmentmarkerlist);
2606552f7358SJed Brown   free(outputCtx->edgelist);
2607552f7358SJed Brown   free(outputCtx->edgemarkerlist);
2608552f7358SJed Brown   free(outputCtx->trianglelist);
2609552f7358SJed Brown   free(outputCtx->neighborlist);
2610552f7358SJed Brown   PetscFunctionReturn(0);
2611552f7358SJed Brown }
2612552f7358SJed Brown 
2613552f7358SJed Brown #undef __FUNCT__
2614552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Triangle"
2615552f7358SJed Brown PetscErrorCode DMPlexGenerate_Triangle(DM boundary, PetscBool interpolate, DM *dm)
2616552f7358SJed Brown {
261782f516ccSBarry Smith   MPI_Comm             comm;
2618552f7358SJed Brown   PetscInt             dim              = 2;
2619552f7358SJed Brown   const PetscBool      createConvexHull = PETSC_FALSE;
2620552f7358SJed Brown   const PetscBool      constrained      = PETSC_FALSE;
2621552f7358SJed Brown   struct triangulateio in;
2622552f7358SJed Brown   struct triangulateio out;
2623552f7358SJed Brown   PetscInt             vStart, vEnd, v, eStart, eEnd, e;
2624552f7358SJed Brown   PetscMPIInt          rank;
2625552f7358SJed Brown   PetscErrorCode       ierr;
2626552f7358SJed Brown 
2627552f7358SJed Brown   PetscFunctionBegin;
262882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
2629552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
2630552f7358SJed Brown   ierr = InitInput_Triangle(&in);CHKERRQ(ierr);
2631552f7358SJed Brown   ierr = InitOutput_Triangle(&out);CHKERRQ(ierr);
2632552f7358SJed Brown   ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
26330d644c17SKarl Rupp 
2634552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
2635552f7358SJed Brown   if (in.numberofpoints > 0) {
2636552f7358SJed Brown     PetscSection coordSection;
2637552f7358SJed Brown     Vec          coordinates;
2638552f7358SJed Brown     PetscScalar *array;
2639552f7358SJed Brown 
2640785e854fSJed Brown     ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr);
2641785e854fSJed Brown     ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr);
2642552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
264369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
2644552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
2645552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
2646552f7358SJed Brown       const PetscInt idx = v - vStart;
2647552f7358SJed Brown       PetscInt       off, d;
2648552f7358SJed Brown 
2649552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
2650552f7358SJed Brown       for (d = 0; d < dim; ++d) {
2651552f7358SJed Brown         in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
2652552f7358SJed Brown       }
2653552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
2654552f7358SJed Brown     }
2655552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
2656552f7358SJed Brown   }
2657552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &eStart, &eEnd);CHKERRQ(ierr);
2658552f7358SJed Brown   in.numberofsegments = eEnd - eStart;
2659552f7358SJed Brown   if (in.numberofsegments > 0) {
2660785e854fSJed Brown     ierr = PetscMalloc1(in.numberofsegments*2, &in.segmentlist);CHKERRQ(ierr);
2661785e854fSJed Brown     ierr = PetscMalloc1(in.numberofsegments, &in.segmentmarkerlist);CHKERRQ(ierr);
2662552f7358SJed Brown     for (e = eStart; e < eEnd; ++e) {
2663552f7358SJed Brown       const PetscInt  idx = e - eStart;
2664552f7358SJed Brown       const PetscInt *cone;
2665552f7358SJed Brown 
2666552f7358SJed Brown       ierr = DMPlexGetCone(boundary, e, &cone);CHKERRQ(ierr);
26670d644c17SKarl Rupp 
2668552f7358SJed Brown       in.segmentlist[idx*2+0] = cone[0] - vStart;
2669552f7358SJed Brown       in.segmentlist[idx*2+1] = cone[1] - vStart;
26700d644c17SKarl Rupp 
2671552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", e, &in.segmentmarkerlist[idx]);CHKERRQ(ierr);
2672552f7358SJed Brown     }
2673552f7358SJed Brown   }
2674552f7358SJed Brown #if 0 /* Do not currently support holes */
2675552f7358SJed Brown   PetscReal *holeCoords;
2676552f7358SJed Brown   PetscInt   h, d;
2677552f7358SJed Brown 
2678552f7358SJed Brown   ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr);
2679552f7358SJed Brown   if (in.numberofholes > 0) {
2680785e854fSJed Brown     ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr);
2681552f7358SJed Brown     for (h = 0; h < in.numberofholes; ++h) {
2682552f7358SJed Brown       for (d = 0; d < dim; ++d) {
2683552f7358SJed Brown         in.holelist[h*dim+d] = holeCoords[h*dim+d];
2684552f7358SJed Brown       }
2685552f7358SJed Brown     }
2686552f7358SJed Brown   }
2687552f7358SJed Brown #endif
2688552f7358SJed Brown   if (!rank) {
2689552f7358SJed Brown     char args[32];
2690552f7358SJed Brown 
2691552f7358SJed Brown     /* Take away 'Q' for verbose output */
2692552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr);
2693552f7358SJed Brown     if (createConvexHull) {
2694552f7358SJed Brown       ierr = PetscStrcat(args, "c");CHKERRQ(ierr);
2695552f7358SJed Brown     }
2696552f7358SJed Brown     if (constrained) {
2697552f7358SJed Brown       ierr = PetscStrcpy(args, "zepDQ");CHKERRQ(ierr);
2698552f7358SJed Brown     }
26990298fd71SBarry Smith     triangulate(args, &in, &out, NULL);
2700552f7358SJed Brown   }
2701552f7358SJed Brown   ierr = PetscFree(in.pointlist);CHKERRQ(ierr);
2702552f7358SJed Brown   ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr);
2703552f7358SJed Brown   ierr = PetscFree(in.segmentlist);CHKERRQ(ierr);
2704552f7358SJed Brown   ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr);
2705552f7358SJed Brown   ierr = PetscFree(in.holelist);CHKERRQ(ierr);
2706552f7358SJed Brown 
2707552f7358SJed Brown   {
2708552f7358SJed Brown     const PetscInt numCorners  = 3;
2709552f7358SJed Brown     const PetscInt numCells    = out.numberoftriangles;
2710552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
2711552f7358SJed Brown     const int     *cells      = out.trianglelist;
2712552f7358SJed Brown     const double  *meshCoords = out.pointlist;
2713552f7358SJed Brown 
27140fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
2715552f7358SJed Brown     /* Set labels */
2716552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
2717552f7358SJed Brown       if (out.pointmarkerlist[v]) {
2718552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
2719552f7358SJed Brown       }
2720552f7358SJed Brown     }
2721552f7358SJed Brown     if (interpolate) {
2722552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
2723552f7358SJed Brown         if (out.edgemarkerlist[e]) {
2724552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
2725552f7358SJed Brown           const PetscInt *edges;
2726552f7358SJed Brown           PetscInt        numEdges;
2727552f7358SJed Brown 
2728552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
2729552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
2730552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
2731552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
2732552f7358SJed Brown         }
2733552f7358SJed Brown       }
2734552f7358SJed Brown     }
2735552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
2736552f7358SJed Brown   }
2737552f7358SJed Brown #if 0 /* Do not currently support holes */
2738552f7358SJed Brown   ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr);
2739552f7358SJed Brown #endif
2740552f7358SJed Brown   ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr);
2741552f7358SJed Brown   PetscFunctionReturn(0);
2742552f7358SJed Brown }
2743552f7358SJed Brown 
2744552f7358SJed Brown #undef __FUNCT__
2745552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Triangle"
2746552f7358SJed Brown PetscErrorCode DMPlexRefine_Triangle(DM dm, double *maxVolumes, DM *dmRefined)
2747552f7358SJed Brown {
274882f516ccSBarry Smith   MPI_Comm             comm;
2749552f7358SJed Brown   PetscInt             dim  = 2;
2750552f7358SJed Brown   struct triangulateio in;
2751552f7358SJed Brown   struct triangulateio out;
2752552f7358SJed Brown   PetscInt             vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
2753552f7358SJed Brown   PetscMPIInt          rank;
2754552f7358SJed Brown   PetscErrorCode       ierr;
2755552f7358SJed Brown 
2756552f7358SJed Brown   PetscFunctionBegin;
275782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2758552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
2759552f7358SJed Brown   ierr = InitInput_Triangle(&in);CHKERRQ(ierr);
2760552f7358SJed Brown   ierr = InitOutput_Triangle(&out);CHKERRQ(ierr);
2761552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2762552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
2763552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
27640d644c17SKarl Rupp 
2765552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
2766552f7358SJed Brown   if (in.numberofpoints > 0) {
2767552f7358SJed Brown     PetscSection coordSection;
2768552f7358SJed Brown     Vec          coordinates;
2769552f7358SJed Brown     PetscScalar *array;
2770552f7358SJed Brown 
2771785e854fSJed Brown     ierr = PetscMalloc1(in.numberofpoints*dim, &in.pointlist);CHKERRQ(ierr);
2772785e854fSJed Brown     ierr = PetscMalloc1(in.numberofpoints, &in.pointmarkerlist);CHKERRQ(ierr);
2773552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
277469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2775552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
2776552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
2777552f7358SJed Brown       const PetscInt idx = v - vStart;
2778552f7358SJed Brown       PetscInt       off, d;
2779552f7358SJed Brown 
2780552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
2781552f7358SJed Brown       for (d = 0; d < dim; ++d) {
2782552f7358SJed Brown         in.pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
2783552f7358SJed Brown       }
2784552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
2785552f7358SJed Brown     }
2786552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
2787552f7358SJed Brown   }
2788552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
27890d644c17SKarl Rupp 
2790552f7358SJed Brown   in.numberofcorners   = 3;
2791552f7358SJed Brown   in.numberoftriangles = cEnd - cStart;
27920d644c17SKarl Rupp 
2793552f7358SJed Brown   in.trianglearealist  = (double*) maxVolumes;
2794552f7358SJed Brown   if (in.numberoftriangles > 0) {
2795785e854fSJed Brown     ierr = PetscMalloc1(in.numberoftriangles*in.numberofcorners, &in.trianglelist);CHKERRQ(ierr);
2796552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
2797552f7358SJed Brown       const PetscInt idx      = c - cStart;
27980298fd71SBarry Smith       PetscInt      *closure = NULL;
2799552f7358SJed Brown       PetscInt       closureSize;
2800552f7358SJed Brown 
2801552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2802552f7358SJed 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);
2803552f7358SJed Brown       for (v = 0; v < 3; ++v) {
2804552f7358SJed Brown         in.trianglelist[idx*in.numberofcorners + v] = closure[(v+closureSize-3)*2] - vStart;
2805552f7358SJed Brown       }
2806552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2807552f7358SJed Brown     }
2808552f7358SJed Brown   }
2809552f7358SJed Brown   /* TODO: Segment markers are missing on input */
2810552f7358SJed Brown #if 0 /* Do not currently support holes */
2811552f7358SJed Brown   PetscReal *holeCoords;
2812552f7358SJed Brown   PetscInt   h, d;
2813552f7358SJed Brown 
2814552f7358SJed Brown   ierr = DMPlexGetHoles(boundary, &in.numberofholes, &holeCords);CHKERRQ(ierr);
2815552f7358SJed Brown   if (in.numberofholes > 0) {
2816785e854fSJed Brown     ierr = PetscMalloc1(in.numberofholes*dim, &in.holelist);CHKERRQ(ierr);
2817552f7358SJed Brown     for (h = 0; h < in.numberofholes; ++h) {
2818552f7358SJed Brown       for (d = 0; d < dim; ++d) {
2819552f7358SJed Brown         in.holelist[h*dim+d] = holeCoords[h*dim+d];
2820552f7358SJed Brown       }
2821552f7358SJed Brown     }
2822552f7358SJed Brown   }
2823552f7358SJed Brown #endif
2824552f7358SJed Brown   if (!rank) {
2825552f7358SJed Brown     char args[32];
2826552f7358SJed Brown 
2827552f7358SJed Brown     /* Take away 'Q' for verbose output */
2828552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQra");CHKERRQ(ierr);
28290298fd71SBarry Smith     triangulate(args, &in, &out, NULL);
2830552f7358SJed Brown   }
2831552f7358SJed Brown   ierr = PetscFree(in.pointlist);CHKERRQ(ierr);
2832552f7358SJed Brown   ierr = PetscFree(in.pointmarkerlist);CHKERRQ(ierr);
2833552f7358SJed Brown   ierr = PetscFree(in.segmentlist);CHKERRQ(ierr);
2834552f7358SJed Brown   ierr = PetscFree(in.segmentmarkerlist);CHKERRQ(ierr);
2835552f7358SJed Brown   ierr = PetscFree(in.trianglelist);CHKERRQ(ierr);
2836552f7358SJed Brown 
2837552f7358SJed Brown   {
2838552f7358SJed Brown     const PetscInt numCorners  = 3;
2839552f7358SJed Brown     const PetscInt numCells    = out.numberoftriangles;
2840552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
2841552f7358SJed Brown     const int     *cells      = out.trianglelist;
2842552f7358SJed Brown     const double  *meshCoords = out.pointlist;
2843552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
2844552f7358SJed Brown 
28450fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
2846552f7358SJed Brown     /* Set labels */
2847552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
2848552f7358SJed Brown       if (out.pointmarkerlist[v]) {
2849552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
2850552f7358SJed Brown       }
2851552f7358SJed Brown     }
2852552f7358SJed Brown     if (interpolate) {
2853552f7358SJed Brown       PetscInt e;
2854552f7358SJed Brown 
2855552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
2856552f7358SJed Brown         if (out.edgemarkerlist[e]) {
2857552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
2858552f7358SJed Brown           const PetscInt *edges;
2859552f7358SJed Brown           PetscInt        numEdges;
2860552f7358SJed Brown 
2861552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
2862552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
2863552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
2864552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
2865552f7358SJed Brown         }
2866552f7358SJed Brown       }
2867552f7358SJed Brown     }
2868552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
2869552f7358SJed Brown   }
2870552f7358SJed Brown #if 0 /* Do not currently support holes */
2871552f7358SJed Brown   ierr = DMPlexCopyHoles(*dm, boundary);CHKERRQ(ierr);
2872552f7358SJed Brown #endif
2873552f7358SJed Brown   ierr = FiniOutput_Triangle(&out);CHKERRQ(ierr);
2874552f7358SJed Brown   PetscFunctionReturn(0);
2875552f7358SJed Brown }
2876552f7358SJed Brown #endif
2877552f7358SJed Brown 
2878519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
2879552f7358SJed Brown #include <tetgen.h>
2880552f7358SJed Brown #undef __FUNCT__
2881552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_Tetgen"
2882552f7358SJed Brown PetscErrorCode DMPlexGenerate_Tetgen(DM boundary, PetscBool interpolate, DM *dm)
2883552f7358SJed Brown {
288482f516ccSBarry Smith   MPI_Comm       comm;
2885552f7358SJed Brown   const PetscInt dim  = 3;
2886552f7358SJed Brown   ::tetgenio     in;
2887552f7358SJed Brown   ::tetgenio     out;
2888552f7358SJed Brown   PetscInt       vStart, vEnd, v, fStart, fEnd, f;
2889552f7358SJed Brown   PetscMPIInt    rank;
2890552f7358SJed Brown   PetscErrorCode ierr;
2891552f7358SJed Brown 
2892552f7358SJed Brown   PetscFunctionBegin;
289382f516ccSBarry Smith   ierr              = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
2894552f7358SJed Brown   ierr              = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
2895552f7358SJed Brown   ierr              = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
2896552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
2897552f7358SJed Brown   if (in.numberofpoints > 0) {
2898552f7358SJed Brown     PetscSection coordSection;
2899552f7358SJed Brown     Vec          coordinates;
2900552f7358SJed Brown     PetscScalar *array;
2901552f7358SJed Brown 
2902552f7358SJed Brown     in.pointlist       = new double[in.numberofpoints*dim];
2903552f7358SJed Brown     in.pointmarkerlist = new int[in.numberofpoints];
29040d644c17SKarl Rupp 
2905552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
290669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
2907552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
2908552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
2909552f7358SJed Brown       const PetscInt idx = v - vStart;
2910552f7358SJed Brown       PetscInt       off, d;
2911552f7358SJed Brown 
2912552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
29130d644c17SKarl Rupp       for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d];
2914552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
2915552f7358SJed Brown     }
2916552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
2917552f7358SJed Brown   }
2918552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr);
29190d644c17SKarl Rupp 
2920552f7358SJed Brown   in.numberoffacets = fEnd - fStart;
2921552f7358SJed Brown   if (in.numberoffacets > 0) {
2922552f7358SJed Brown     in.facetlist       = new tetgenio::facet[in.numberoffacets];
2923552f7358SJed Brown     in.facetmarkerlist = new int[in.numberoffacets];
2924552f7358SJed Brown     for (f = fStart; f < fEnd; ++f) {
2925552f7358SJed Brown       const PetscInt idx     = f - fStart;
29260298fd71SBarry Smith       PetscInt      *points = NULL, numPoints, p, numVertices = 0, v;
2927552f7358SJed Brown 
2928552f7358SJed Brown       in.facetlist[idx].numberofpolygons = 1;
2929552f7358SJed Brown       in.facetlist[idx].polygonlist      = new tetgenio::polygon[in.facetlist[idx].numberofpolygons];
2930552f7358SJed Brown       in.facetlist[idx].numberofholes    = 0;
2931552f7358SJed Brown       in.facetlist[idx].holelist         = NULL;
2932552f7358SJed Brown 
2933552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
2934552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
2935552f7358SJed Brown         const PetscInt point = points[p];
29360d644c17SKarl Rupp         if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point;
2937552f7358SJed Brown       }
2938552f7358SJed Brown 
2939552f7358SJed Brown       tetgenio::polygon *poly = in.facetlist[idx].polygonlist;
2940552f7358SJed Brown       poly->numberofvertices = numVertices;
2941552f7358SJed Brown       poly->vertexlist       = new int[poly->numberofvertices];
2942552f7358SJed Brown       for (v = 0; v < numVertices; ++v) {
2943552f7358SJed Brown         const PetscInt vIdx = points[v] - vStart;
2944552f7358SJed Brown         poly->vertexlist[v] = vIdx;
2945552f7358SJed Brown       }
2946552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", f, &in.facetmarkerlist[idx]);CHKERRQ(ierr);
2947552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
2948552f7358SJed Brown     }
2949552f7358SJed Brown   }
2950552f7358SJed Brown   if (!rank) {
2951552f7358SJed Brown     char args[32];
2952552f7358SJed Brown 
2953552f7358SJed Brown     /* Take away 'Q' for verbose output */
2954552f7358SJed Brown     ierr = PetscStrcpy(args, "pqezQ");CHKERRQ(ierr);
2955552f7358SJed Brown     ::tetrahedralize(args, &in, &out);
2956552f7358SJed Brown   }
2957552f7358SJed Brown   {
2958552f7358SJed Brown     const PetscInt numCorners  = 4;
2959552f7358SJed Brown     const PetscInt numCells    = out.numberoftetrahedra;
2960552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
2961552f7358SJed Brown     const double   *meshCoords = out.pointlist;
29621d4b4d7bSJed Brown     int            *cells      = out.tetrahedronlist;
2963552f7358SJed Brown 
29649db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
29650fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
2966552f7358SJed Brown     /* Set labels */
2967552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
2968552f7358SJed Brown       if (out.pointmarkerlist[v]) {
2969552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
2970552f7358SJed Brown       }
2971552f7358SJed Brown     }
2972552f7358SJed Brown     if (interpolate) {
2973552f7358SJed Brown       PetscInt e;
2974552f7358SJed Brown 
2975552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
2976552f7358SJed Brown         if (out.edgemarkerlist[e]) {
2977552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
2978552f7358SJed Brown           const PetscInt *edges;
2979552f7358SJed Brown           PetscInt        numEdges;
2980552f7358SJed Brown 
2981552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
2982552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
2983552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
2984552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
2985552f7358SJed Brown         }
2986552f7358SJed Brown       }
2987552f7358SJed Brown       for (f = 0; f < out.numberoftrifaces; f++) {
2988552f7358SJed Brown         if (out.trifacemarkerlist[f]) {
2989552f7358SJed Brown           const PetscInt  vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells};
2990552f7358SJed Brown           const PetscInt *faces;
2991552f7358SJed Brown           PetscInt        numFaces;
2992552f7358SJed Brown 
2993552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
2994552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
2995552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr);
2996552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
2997552f7358SJed Brown         }
2998552f7358SJed Brown       }
2999552f7358SJed Brown     }
3000552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
3001552f7358SJed Brown   }
3002552f7358SJed Brown   PetscFunctionReturn(0);
3003552f7358SJed Brown }
3004552f7358SJed Brown 
3005552f7358SJed Brown #undef __FUNCT__
3006552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_Tetgen"
3007552f7358SJed Brown PetscErrorCode DMPlexRefine_Tetgen(DM dm, double *maxVolumes, DM *dmRefined)
3008552f7358SJed Brown {
300982f516ccSBarry Smith   MPI_Comm       comm;
3010552f7358SJed Brown   const PetscInt dim  = 3;
3011552f7358SJed Brown   ::tetgenio     in;
3012552f7358SJed Brown   ::tetgenio     out;
3013552f7358SJed Brown   PetscInt       vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
3014552f7358SJed Brown   PetscMPIInt    rank;
3015552f7358SJed Brown   PetscErrorCode ierr;
3016552f7358SJed Brown 
3017552f7358SJed Brown   PetscFunctionBegin;
301882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
3019552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3020552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3021552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
3022552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
30230d644c17SKarl Rupp 
3024552f7358SJed Brown   in.numberofpoints = vEnd - vStart;
3025552f7358SJed Brown   if (in.numberofpoints > 0) {
3026552f7358SJed Brown     PetscSection coordSection;
3027552f7358SJed Brown     Vec          coordinates;
3028552f7358SJed Brown     PetscScalar *array;
3029552f7358SJed Brown 
3030552f7358SJed Brown     in.pointlist       = new double[in.numberofpoints*dim];
3031552f7358SJed Brown     in.pointmarkerlist = new int[in.numberofpoints];
30320d644c17SKarl Rupp 
3033552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
303469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3035552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3036552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3037552f7358SJed Brown       const PetscInt idx = v - vStart;
3038552f7358SJed Brown       PetscInt       off, d;
3039552f7358SJed Brown 
3040552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
30410d644c17SKarl Rupp       for (d = 0; d < dim; ++d) in.pointlist[idx*dim + d] = array[off+d];
3042552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &in.pointmarkerlist[idx]);CHKERRQ(ierr);
3043552f7358SJed Brown     }
3044552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3045552f7358SJed Brown   }
3046552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
30470d644c17SKarl Rupp 
3048552f7358SJed Brown   in.numberofcorners       = 4;
3049552f7358SJed Brown   in.numberoftetrahedra    = cEnd - cStart;
3050552f7358SJed Brown   in.tetrahedronvolumelist = (double*) maxVolumes;
3051552f7358SJed Brown   if (in.numberoftetrahedra > 0) {
3052552f7358SJed Brown     in.tetrahedronlist = new int[in.numberoftetrahedra*in.numberofcorners];
3053552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3054552f7358SJed Brown       const PetscInt idx      = c - cStart;
30550298fd71SBarry Smith       PetscInt      *closure = NULL;
3056552f7358SJed Brown       PetscInt       closureSize;
3057552f7358SJed Brown 
3058552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3059552f7358SJed 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);
3060552f7358SJed Brown       for (v = 0; v < 4; ++v) {
3061552f7358SJed Brown         in.tetrahedronlist[idx*in.numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart;
3062552f7358SJed Brown       }
3063552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3064552f7358SJed Brown     }
3065552f7358SJed Brown   }
306619436ca2SJed Brown   /* TODO: Put in boundary faces with markers */
3067552f7358SJed Brown   if (!rank) {
3068552f7358SJed Brown     char args[32];
3069552f7358SJed Brown 
3070552f7358SJed Brown     /* Take away 'Q' for verbose output */
307119436ca2SJed Brown     /*ierr = PetscStrcpy(args, "qezQra");CHKERRQ(ierr); */
3072552f7358SJed Brown     ierr = PetscStrcpy(args, "qezraVVVV");CHKERRQ(ierr);
3073552f7358SJed Brown     ::tetrahedralize(args, &in, &out);
3074552f7358SJed Brown   }
3075552f7358SJed Brown   in.tetrahedronvolumelist = NULL;
3076552f7358SJed Brown 
3077552f7358SJed Brown   {
3078552f7358SJed Brown     const PetscInt numCorners  = 4;
3079552f7358SJed Brown     const PetscInt numCells    = out.numberoftetrahedra;
3080552f7358SJed Brown     const PetscInt numVertices = out.numberofpoints;
3081552f7358SJed Brown     const double   *meshCoords = out.pointlist;
30821d4b4d7bSJed Brown     int            *cells      = out.tetrahedronlist;
30831d4b4d7bSJed Brown 
3084552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
3085552f7358SJed Brown 
30869db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
30870fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
3088552f7358SJed Brown     /* Set labels */
3089552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3090552f7358SJed Brown       if (out.pointmarkerlist[v]) {
3091552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out.pointmarkerlist[v]);CHKERRQ(ierr);
3092552f7358SJed Brown       }
3093552f7358SJed Brown     }
3094552f7358SJed Brown     if (interpolate) {
3095552f7358SJed Brown       PetscInt e, f;
3096552f7358SJed Brown 
3097552f7358SJed Brown       for (e = 0; e < out.numberofedges; e++) {
3098552f7358SJed Brown         if (out.edgemarkerlist[e]) {
3099552f7358SJed Brown           const PetscInt  vertices[2] = {out.edgelist[e*2+0]+numCells, out.edgelist[e*2+1]+numCells};
3100552f7358SJed Brown           const PetscInt *edges;
3101552f7358SJed Brown           PetscInt        numEdges;
3102552f7358SJed Brown 
3103552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3104552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3105552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out.edgemarkerlist[e]);CHKERRQ(ierr);
3106552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3107552f7358SJed Brown         }
3108552f7358SJed Brown       }
3109552f7358SJed Brown       for (f = 0; f < out.numberoftrifaces; f++) {
3110552f7358SJed Brown         if (out.trifacemarkerlist[f]) {
3111552f7358SJed Brown           const PetscInt  vertices[3] = {out.trifacelist[f*3+0]+numCells, out.trifacelist[f*3+1]+numCells, out.trifacelist[f*3+2]+numCells};
3112552f7358SJed Brown           const PetscInt *faces;
3113552f7358SJed Brown           PetscInt        numFaces;
3114552f7358SJed Brown 
3115552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3116552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
3117552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out.trifacemarkerlist[f]);CHKERRQ(ierr);
3118552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3119552f7358SJed Brown         }
3120552f7358SJed Brown       }
3121552f7358SJed Brown     }
3122552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
3123552f7358SJed Brown   }
3124552f7358SJed Brown   PetscFunctionReturn(0);
3125552f7358SJed Brown }
3126552f7358SJed Brown #endif
3127552f7358SJed Brown 
3128519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
3129aaa7dc30SBarry Smith #include <ctetgen.h>
3130552f7358SJed Brown 
3131552f7358SJed Brown #undef __FUNCT__
3132552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate_CTetgen"
3133552f7358SJed Brown PetscErrorCode DMPlexGenerate_CTetgen(DM boundary, PetscBool interpolate, DM *dm)
3134552f7358SJed Brown {
313582f516ccSBarry Smith   MPI_Comm       comm;
3136552f7358SJed Brown   const PetscInt dim  = 3;
3137552f7358SJed Brown   PLC           *in, *out;
3138552f7358SJed Brown   PetscInt       verbose = 0, vStart, vEnd, v, fStart, fEnd, f;
3139552f7358SJed Brown   PetscMPIInt    rank;
3140552f7358SJed Brown   PetscErrorCode ierr;
3141552f7358SJed Brown 
3142552f7358SJed Brown   PetscFunctionBegin;
314382f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)boundary,&comm);CHKERRQ(ierr);
31440298fd71SBarry Smith   ierr = PetscOptionsGetInt(((PetscObject) boundary)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr);
3145552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3146552f7358SJed Brown   ierr = DMPlexGetDepthStratum(boundary, 0, &vStart, &vEnd);CHKERRQ(ierr);
3147552f7358SJed Brown   ierr = PLCCreate(&in);CHKERRQ(ierr);
3148552f7358SJed Brown   ierr = PLCCreate(&out);CHKERRQ(ierr);
31490d644c17SKarl Rupp 
3150552f7358SJed Brown   in->numberofpoints = vEnd - vStart;
3151552f7358SJed Brown   if (in->numberofpoints > 0) {
3152552f7358SJed Brown     PetscSection coordSection;
3153552f7358SJed Brown     Vec          coordinates;
3154552f7358SJed Brown     PetscScalar *array;
3155552f7358SJed Brown 
3156785e854fSJed Brown     ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr);
3157785e854fSJed Brown     ierr = PetscMalloc1(in->numberofpoints,       &in->pointmarkerlist);CHKERRQ(ierr);
3158552f7358SJed Brown     ierr = DMGetCoordinatesLocal(boundary, &coordinates);CHKERRQ(ierr);
315969d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(boundary, &coordSection);CHKERRQ(ierr);
3160552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3161552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3162552f7358SJed Brown       const PetscInt idx = v - vStart;
3163552f7358SJed Brown       PetscInt       off, d, m;
3164552f7358SJed Brown 
3165552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3166552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3167552f7358SJed Brown         in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3168552f7358SJed Brown       }
3169552f7358SJed Brown       ierr = DMPlexGetLabelValue(boundary, "marker", v, &m);CHKERRQ(ierr);
31700d644c17SKarl Rupp 
3171552f7358SJed Brown       in->pointmarkerlist[idx] = (int) m;
3172552f7358SJed Brown     }
3173552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3174552f7358SJed Brown   }
3175552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(boundary, 0, &fStart, &fEnd);CHKERRQ(ierr);
31760d644c17SKarl Rupp 
3177552f7358SJed Brown   in->numberoffacets = fEnd - fStart;
3178552f7358SJed Brown   if (in->numberoffacets > 0) {
3179785e854fSJed Brown     ierr = PetscMalloc1(in->numberoffacets, &in->facetlist);CHKERRQ(ierr);
3180785e854fSJed Brown     ierr = PetscMalloc1(in->numberoffacets,   &in->facetmarkerlist);CHKERRQ(ierr);
3181552f7358SJed Brown     for (f = fStart; f < fEnd; ++f) {
3182552f7358SJed Brown       const PetscInt idx     = f - fStart;
31830298fd71SBarry Smith       PetscInt      *points = NULL, numPoints, p, numVertices = 0, v, m;
3184552f7358SJed Brown       polygon       *poly;
3185552f7358SJed Brown 
3186552f7358SJed Brown       in->facetlist[idx].numberofpolygons = 1;
31870d644c17SKarl Rupp 
3188785e854fSJed Brown       ierr = PetscMalloc1(in->facetlist[idx].numberofpolygons, &in->facetlist[idx].polygonlist);CHKERRQ(ierr);
31890d644c17SKarl Rupp 
3190552f7358SJed Brown       in->facetlist[idx].numberofholes    = 0;
31910298fd71SBarry Smith       in->facetlist[idx].holelist         = NULL;
3192552f7358SJed Brown 
3193552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3194552f7358SJed Brown       for (p = 0; p < numPoints*2; p += 2) {
3195552f7358SJed Brown         const PetscInt point = points[p];
31960d644c17SKarl Rupp         if ((point >= vStart) && (point < vEnd)) points[numVertices++] = point;
3197552f7358SJed Brown       }
3198552f7358SJed Brown 
3199552f7358SJed Brown       poly                   = in->facetlist[idx].polygonlist;
3200552f7358SJed Brown       poly->numberofvertices = numVertices;
3201785e854fSJed Brown       ierr                   = PetscMalloc1(poly->numberofvertices, &poly->vertexlist);CHKERRQ(ierr);
3202552f7358SJed Brown       for (v = 0; v < numVertices; ++v) {
3203552f7358SJed Brown         const PetscInt vIdx = points[v] - vStart;
3204552f7358SJed Brown         poly->vertexlist[v] = vIdx;
3205552f7358SJed Brown       }
3206552f7358SJed Brown       ierr                     = DMPlexGetLabelValue(boundary, "marker", f, &m);CHKERRQ(ierr);
3207552f7358SJed Brown       in->facetmarkerlist[idx] = (int) m;
3208552f7358SJed Brown       ierr                     = DMPlexRestoreTransitiveClosure(boundary, f, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
3209552f7358SJed Brown     }
3210552f7358SJed Brown   }
3211552f7358SJed Brown   if (!rank) {
3212552f7358SJed Brown     TetGenOpts t;
3213552f7358SJed Brown 
3214552f7358SJed Brown     ierr        = TetGenOptsInitialize(&t);CHKERRQ(ierr);
3215552f7358SJed Brown     t.in        = boundary; /* Should go away */
3216552f7358SJed Brown     t.plc       = 1;
3217552f7358SJed Brown     t.quality   = 1;
3218552f7358SJed Brown     t.edgesout  = 1;
3219552f7358SJed Brown     t.zeroindex = 1;
3220552f7358SJed Brown     t.quiet     = 1;
3221552f7358SJed Brown     t.verbose   = verbose;
3222552f7358SJed Brown     ierr        = TetGenCheckOpts(&t);CHKERRQ(ierr);
3223552f7358SJed Brown     ierr        = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr);
3224552f7358SJed Brown   }
3225552f7358SJed Brown   {
3226552f7358SJed Brown     const PetscInt numCorners  = 4;
3227552f7358SJed Brown     const PetscInt numCells    = out->numberoftetrahedra;
3228552f7358SJed Brown     const PetscInt numVertices = out->numberofpoints;
3229552f7358SJed Brown     const double   *meshCoords = out->pointlist;
32301d4b4d7bSJed Brown     int            *cells      = out->tetrahedronlist;
3231552f7358SJed Brown 
32329db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
32330fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dm);CHKERRQ(ierr);
3234552f7358SJed Brown     /* Set labels */
3235552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3236552f7358SJed Brown       if (out->pointmarkerlist[v]) {
3237552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dm, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr);
3238552f7358SJed Brown       }
3239552f7358SJed Brown     }
3240552f7358SJed Brown     if (interpolate) {
3241552f7358SJed Brown       PetscInt e;
3242552f7358SJed Brown 
3243552f7358SJed Brown       for (e = 0; e < out->numberofedges; e++) {
3244552f7358SJed Brown         if (out->edgemarkerlist[e]) {
3245552f7358SJed Brown           const PetscInt  vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells};
3246552f7358SJed Brown           const PetscInt *edges;
3247552f7358SJed Brown           PetscInt        numEdges;
3248552f7358SJed Brown 
3249552f7358SJed Brown           ierr = DMPlexGetJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3250552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3251552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr);
3252552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3253552f7358SJed Brown         }
3254552f7358SJed Brown       }
3255552f7358SJed Brown       for (f = 0; f < out->numberoftrifaces; f++) {
3256552f7358SJed Brown         if (out->trifacemarkerlist[f]) {
3257552f7358SJed Brown           const PetscInt  vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells};
3258552f7358SJed Brown           const PetscInt *faces;
3259552f7358SJed Brown           PetscInt        numFaces;
3260552f7358SJed Brown 
3261552f7358SJed Brown           ierr = DMPlexGetFullJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3262552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
3263552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dm, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr);
3264552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dm, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3265552f7358SJed Brown         }
3266552f7358SJed Brown       }
3267552f7358SJed Brown     }
3268552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dm, PETSC_FALSE);CHKERRQ(ierr);
3269552f7358SJed Brown   }
3270552f7358SJed Brown 
3271552f7358SJed Brown   ierr = PLCDestroy(&in);CHKERRQ(ierr);
3272552f7358SJed Brown   ierr = PLCDestroy(&out);CHKERRQ(ierr);
3273552f7358SJed Brown   PetscFunctionReturn(0);
3274552f7358SJed Brown }
3275552f7358SJed Brown 
3276552f7358SJed Brown #undef __FUNCT__
3277552f7358SJed Brown #define __FUNCT__ "DMPlexRefine_CTetgen"
3278552f7358SJed Brown PetscErrorCode DMPlexRefine_CTetgen(DM dm, PetscReal *maxVolumes, DM *dmRefined)
3279552f7358SJed Brown {
328082f516ccSBarry Smith   MPI_Comm       comm;
3281552f7358SJed Brown   const PetscInt dim  = 3;
3282552f7358SJed Brown   PLC           *in, *out;
3283552f7358SJed Brown   PetscInt       verbose = 0, vStart, vEnd, v, cStart, cEnd, c, depth, depthGlobal;
3284552f7358SJed Brown   PetscMPIInt    rank;
3285552f7358SJed Brown   PetscErrorCode ierr;
3286552f7358SJed Brown 
3287552f7358SJed Brown   PetscFunctionBegin;
328882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
32890298fd71SBarry Smith   ierr = PetscOptionsGetInt(((PetscObject) dm)->prefix, "-ctetgen_verbose", &verbose, NULL);CHKERRQ(ierr);
3290552f7358SJed Brown   ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr);
3291552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3292552f7358SJed Brown   ierr = MPI_Allreduce(&depth, &depthGlobal, 1, MPIU_INT, MPI_MAX, comm);CHKERRQ(ierr);
3293552f7358SJed Brown   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
3294552f7358SJed Brown   ierr = PLCCreate(&in);CHKERRQ(ierr);
3295552f7358SJed Brown   ierr = PLCCreate(&out);CHKERRQ(ierr);
32960d644c17SKarl Rupp 
3297552f7358SJed Brown   in->numberofpoints = vEnd - vStart;
3298552f7358SJed Brown   if (in->numberofpoints > 0) {
3299552f7358SJed Brown     PetscSection coordSection;
3300552f7358SJed Brown     Vec          coordinates;
3301552f7358SJed Brown     PetscScalar *array;
3302552f7358SJed Brown 
3303785e854fSJed Brown     ierr = PetscMalloc1(in->numberofpoints*dim, &in->pointlist);CHKERRQ(ierr);
3304785e854fSJed Brown     ierr = PetscMalloc1(in->numberofpoints,       &in->pointmarkerlist);CHKERRQ(ierr);
3305552f7358SJed Brown     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
330669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3307552f7358SJed Brown     ierr = VecGetArray(coordinates, &array);CHKERRQ(ierr);
3308552f7358SJed Brown     for (v = vStart; v < vEnd; ++v) {
3309552f7358SJed Brown       const PetscInt idx = v - vStart;
3310552f7358SJed Brown       PetscInt       off, d, m;
3311552f7358SJed Brown 
3312552f7358SJed Brown       ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3313552f7358SJed Brown       for (d = 0; d < dim; ++d) {
3314552f7358SJed Brown         in->pointlist[idx*dim + d] = PetscRealPart(array[off+d]);
3315552f7358SJed Brown       }
3316552f7358SJed Brown       ierr = DMPlexGetLabelValue(dm, "marker", v, &m);CHKERRQ(ierr);
33170d644c17SKarl Rupp 
3318552f7358SJed Brown       in->pointmarkerlist[idx] = (int) m;
3319552f7358SJed Brown     }
3320552f7358SJed Brown     ierr = VecRestoreArray(coordinates, &array);CHKERRQ(ierr);
3321552f7358SJed Brown   }
3322552f7358SJed Brown   ierr  = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
33230d644c17SKarl Rupp 
3324552f7358SJed Brown   in->numberofcorners       = 4;
3325552f7358SJed Brown   in->numberoftetrahedra    = cEnd - cStart;
3326552f7358SJed Brown   in->tetrahedronvolumelist = maxVolumes;
3327552f7358SJed Brown   if (in->numberoftetrahedra > 0) {
3328785e854fSJed Brown     ierr = PetscMalloc1(in->numberoftetrahedra*in->numberofcorners, &in->tetrahedronlist);CHKERRQ(ierr);
3329552f7358SJed Brown     for (c = cStart; c < cEnd; ++c) {
3330552f7358SJed Brown       const PetscInt idx      = c - cStart;
33310298fd71SBarry Smith       PetscInt      *closure = NULL;
3332552f7358SJed Brown       PetscInt       closureSize;
3333552f7358SJed Brown 
3334552f7358SJed Brown       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3335552f7358SJed 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);
3336552f7358SJed Brown       for (v = 0; v < 4; ++v) {
3337552f7358SJed Brown         in->tetrahedronlist[idx*in->numberofcorners + v] = closure[(v+closureSize-4)*2] - vStart;
3338552f7358SJed Brown       }
3339552f7358SJed Brown       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
3340552f7358SJed Brown     }
3341552f7358SJed Brown   }
3342552f7358SJed Brown   if (!rank) {
3343552f7358SJed Brown     TetGenOpts t;
3344552f7358SJed Brown 
3345552f7358SJed Brown     ierr = TetGenOptsInitialize(&t);CHKERRQ(ierr);
33460d644c17SKarl Rupp 
3347552f7358SJed Brown     t.in        = dm; /* Should go away */
3348552f7358SJed Brown     t.refine    = 1;
3349552f7358SJed Brown     t.varvolume = 1;
3350552f7358SJed Brown     t.quality   = 1;
3351552f7358SJed Brown     t.edgesout  = 1;
3352552f7358SJed Brown     t.zeroindex = 1;
3353552f7358SJed Brown     t.quiet     = 1;
3354552f7358SJed Brown     t.verbose   = verbose; /* Change this */
33550d644c17SKarl Rupp 
3356552f7358SJed Brown     ierr = TetGenCheckOpts(&t);CHKERRQ(ierr);
3357552f7358SJed Brown     ierr = TetGenTetrahedralize(&t, in, out);CHKERRQ(ierr);
3358552f7358SJed Brown   }
3359552f7358SJed Brown   {
3360552f7358SJed Brown     const PetscInt numCorners  = 4;
3361552f7358SJed Brown     const PetscInt numCells    = out->numberoftetrahedra;
3362552f7358SJed Brown     const PetscInt numVertices = out->numberofpoints;
3363552f7358SJed Brown     const double   *meshCoords = out->pointlist;
33641d4b4d7bSJed Brown     int            *cells      = out->tetrahedronlist;
3365552f7358SJed Brown     PetscBool      interpolate = depthGlobal > 1 ? PETSC_TRUE : PETSC_FALSE;
3366552f7358SJed Brown 
33679db3b87dSMatthew G. Knepley     ierr = DMPlexInvertCells_Internal(dim, numCells, numCorners, cells);CHKERRQ(ierr);
33680fde5641SMatthew G Knepley     ierr = DMPlexCreateFromCellList(comm, dim, numCells, numVertices, numCorners, interpolate, cells, dim, meshCoords, dmRefined);CHKERRQ(ierr);
3369552f7358SJed Brown     /* Set labels */
3370552f7358SJed Brown     for (v = 0; v < numVertices; ++v) {
3371552f7358SJed Brown       if (out->pointmarkerlist[v]) {
3372552f7358SJed Brown         ierr = DMPlexSetLabelValue(*dmRefined, "marker", v+numCells, out->pointmarkerlist[v]);CHKERRQ(ierr);
3373552f7358SJed Brown       }
3374552f7358SJed Brown     }
3375552f7358SJed Brown     if (interpolate) {
3376552f7358SJed Brown       PetscInt e, f;
3377552f7358SJed Brown 
3378552f7358SJed Brown       for (e = 0; e < out->numberofedges; e++) {
3379552f7358SJed Brown         if (out->edgemarkerlist[e]) {
3380552f7358SJed Brown           const PetscInt  vertices[2] = {out->edgelist[e*2+0]+numCells, out->edgelist[e*2+1]+numCells};
3381552f7358SJed Brown           const PetscInt *edges;
3382552f7358SJed Brown           PetscInt        numEdges;
3383552f7358SJed Brown 
3384552f7358SJed Brown           ierr = DMPlexGetJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3385552f7358SJed Brown           if (numEdges != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Two vertices must cover only one edge, not %D", numEdges);
3386552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", edges[0], out->edgemarkerlist[e]);CHKERRQ(ierr);
3387552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 2, vertices, &numEdges, &edges);CHKERRQ(ierr);
3388552f7358SJed Brown         }
3389552f7358SJed Brown       }
3390552f7358SJed Brown       for (f = 0; f < out->numberoftrifaces; f++) {
3391552f7358SJed Brown         if (out->trifacemarkerlist[f]) {
3392552f7358SJed Brown           const PetscInt  vertices[3] = {out->trifacelist[f*3+0]+numCells, out->trifacelist[f*3+1]+numCells, out->trifacelist[f*3+2]+numCells};
3393552f7358SJed Brown           const PetscInt *faces;
3394552f7358SJed Brown           PetscInt        numFaces;
3395552f7358SJed Brown 
3396552f7358SJed Brown           ierr = DMPlexGetFullJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3397552f7358SJed Brown           if (numFaces != 1) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Three vertices must cover only one face, not %D", numFaces);
3398552f7358SJed Brown           ierr = DMPlexSetLabelValue(*dmRefined, "marker", faces[0], out->trifacemarkerlist[f]);CHKERRQ(ierr);
3399552f7358SJed Brown           ierr = DMPlexRestoreJoin(*dmRefined, 3, vertices, &numFaces, &faces);CHKERRQ(ierr);
3400552f7358SJed Brown         }
3401552f7358SJed Brown       }
3402552f7358SJed Brown     }
3403552f7358SJed Brown     ierr = DMPlexSetRefinementUniform(*dmRefined, PETSC_FALSE);CHKERRQ(ierr);
3404552f7358SJed Brown   }
3405552f7358SJed Brown   ierr = PLCDestroy(&in);CHKERRQ(ierr);
3406552f7358SJed Brown   ierr = PLCDestroy(&out);CHKERRQ(ierr);
3407552f7358SJed Brown   PetscFunctionReturn(0);
3408552f7358SJed Brown }
3409552f7358SJed Brown #endif
3410552f7358SJed Brown 
3411552f7358SJed Brown #undef __FUNCT__
3412552f7358SJed Brown #define __FUNCT__ "DMPlexGenerate"
3413552f7358SJed Brown /*@C
3414552f7358SJed Brown   DMPlexGenerate - Generates a mesh.
3415552f7358SJed Brown 
3416552f7358SJed Brown   Not Collective
3417552f7358SJed Brown 
3418552f7358SJed Brown   Input Parameters:
3419552f7358SJed Brown + boundary - The DMPlex boundary object
3420552f7358SJed Brown . name - The mesh generation package name
3421552f7358SJed Brown - interpolate - Flag to create intermediate mesh elements
3422552f7358SJed Brown 
3423552f7358SJed Brown   Output Parameter:
3424552f7358SJed Brown . mesh - The DMPlex object
3425552f7358SJed Brown 
3426552f7358SJed Brown   Level: intermediate
3427552f7358SJed Brown 
3428552f7358SJed Brown .keywords: mesh, elements
3429552f7358SJed Brown .seealso: DMPlexCreate(), DMRefine()
3430552f7358SJed Brown @*/
3431552f7358SJed Brown PetscErrorCode DMPlexGenerate(DM boundary, const char name[], PetscBool interpolate, DM *mesh)
3432552f7358SJed Brown {
3433552f7358SJed Brown   PetscInt       dim;
3434552f7358SJed Brown   char           genname[1024];
3435552f7358SJed Brown   PetscBool      isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg;
3436552f7358SJed Brown   PetscErrorCode ierr;
3437552f7358SJed Brown 
3438552f7358SJed Brown   PetscFunctionBegin;
3439552f7358SJed Brown   PetscValidHeaderSpecific(boundary, DM_CLASSID, 1);
3440552f7358SJed Brown   PetscValidLogicalCollectiveBool(boundary, interpolate, 2);
3441552f7358SJed Brown   ierr = DMPlexGetDimension(boundary, &dim);CHKERRQ(ierr);
3442552f7358SJed Brown   ierr = PetscOptionsGetString(((PetscObject) boundary)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr);
34430d644c17SKarl Rupp   if (flg) name = genname;
3444552f7358SJed Brown   if (name) {
3445552f7358SJed Brown     ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr);
3446552f7358SJed Brown     ierr = PetscStrcmp(name, "tetgen",   &isTetgen);CHKERRQ(ierr);
3447552f7358SJed Brown     ierr = PetscStrcmp(name, "ctetgen",  &isCTetgen);CHKERRQ(ierr);
3448552f7358SJed Brown   }
3449552f7358SJed Brown   switch (dim) {
3450552f7358SJed Brown   case 1:
3451552f7358SJed Brown     if (!name || isTriangle) {
3452519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
3453552f7358SJed Brown       ierr = DMPlexGenerate_Triangle(boundary, interpolate, mesh);CHKERRQ(ierr);
3454552f7358SJed Brown #else
345582f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation needs external package support.\nPlease reconfigure with --download-triangle.");
3456552f7358SJed Brown #endif
345782f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name);
3458552f7358SJed Brown     break;
3459552f7358SJed Brown   case 2:
3460552f7358SJed Brown     if (!name || isCTetgen) {
3461519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
3462552f7358SJed Brown       ierr = DMPlexGenerate_CTetgen(boundary, interpolate, mesh);CHKERRQ(ierr);
3463552f7358SJed Brown #else
346482f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen.");
3465552f7358SJed Brown #endif
3466552f7358SJed Brown     } else if (isTetgen) {
3467519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
3468552f7358SJed Brown       ierr = DMPlexGenerate_Tetgen(boundary, interpolate, mesh);CHKERRQ(ierr);
3469552f7358SJed Brown #else
347082f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen.");
3471552f7358SJed Brown #endif
347282f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name);
3473552f7358SJed Brown     break;
3474552f7358SJed Brown   default:
347582f516ccSBarry Smith     SETERRQ1(PetscObjectComm((PetscObject)boundary), PETSC_ERR_SUP, "Mesh generation for a dimension %d boundary is not supported.", dim);
3476552f7358SJed Brown   }
3477552f7358SJed Brown   PetscFunctionReturn(0);
3478552f7358SJed Brown }
3479552f7358SJed Brown 
3480552f7358SJed Brown #undef __FUNCT__
3481552f7358SJed Brown #define __FUNCT__ "DMRefine_Plex"
3482552f7358SJed Brown PetscErrorCode DMRefine_Plex(DM dm, MPI_Comm comm, DM *dmRefined)
3483552f7358SJed Brown {
3484552f7358SJed Brown   PetscReal      refinementLimit;
3485552f7358SJed Brown   PetscInt       dim, cStart, cEnd;
34860298fd71SBarry Smith   char           genname[1024], *name = NULL;
3487552f7358SJed Brown   PetscBool      isUniform, isTriangle = PETSC_FALSE, isTetgen = PETSC_FALSE, isCTetgen = PETSC_FALSE, flg;
3488552f7358SJed Brown   PetscErrorCode ierr;
3489552f7358SJed Brown 
3490552f7358SJed Brown   PetscFunctionBegin;
3491552f7358SJed Brown   ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr);
3492552f7358SJed Brown   if (isUniform) {
3493552f7358SJed Brown     CellRefiner cellRefiner;
3494552f7358SJed Brown 
3495509c9b89SMatthew G. Knepley     ierr = DMPlexGetCellRefiner_Internal(dm, &cellRefiner);CHKERRQ(ierr);
3496509c9b89SMatthew G. Knepley     ierr = DMPlexRefineUniform_Internal(dm, cellRefiner, dmRefined);CHKERRQ(ierr);
3497552f7358SJed Brown     PetscFunctionReturn(0);
3498552f7358SJed Brown   }
3499552f7358SJed Brown   ierr = DMPlexGetRefinementLimit(dm, &refinementLimit);CHKERRQ(ierr);
3500552f7358SJed Brown   if (refinementLimit == 0.0) PetscFunctionReturn(0);
3501552f7358SJed Brown   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
3502552f7358SJed Brown   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
3503552f7358SJed Brown   ierr = PetscOptionsGetString(((PetscObject) dm)->prefix, "-dm_plex_generator", genname, 1024, &flg);CHKERRQ(ierr);
35040d644c17SKarl Rupp   if (flg) name = genname;
3505552f7358SJed Brown   if (name) {
3506552f7358SJed Brown     ierr = PetscStrcmp(name, "triangle", &isTriangle);CHKERRQ(ierr);
3507552f7358SJed Brown     ierr = PetscStrcmp(name, "tetgen",   &isTetgen);CHKERRQ(ierr);
3508552f7358SJed Brown     ierr = PetscStrcmp(name, "ctetgen",  &isCTetgen);CHKERRQ(ierr);
3509552f7358SJed Brown   }
3510552f7358SJed Brown   switch (dim) {
3511552f7358SJed Brown   case 2:
3512552f7358SJed Brown     if (!name || isTriangle) {
3513519f805aSKarl Rupp #if defined(PETSC_HAVE_TRIANGLE)
3514552f7358SJed Brown       double  *maxVolumes;
3515552f7358SJed Brown       PetscInt c;
3516552f7358SJed Brown 
3517785e854fSJed Brown       ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr);
35180d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
3519552f7358SJed Brown       ierr = DMPlexRefine_Triangle(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
35206b0a3334SMatthew G. Knepley       ierr = PetscFree(maxVolumes);CHKERRQ(ierr);
3521552f7358SJed Brown #else
352282f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement needs external package support.\nPlease reconfigure with --download-triangle.");
3523552f7358SJed Brown #endif
352482f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 2D mesh generation package %s", name);
3525552f7358SJed Brown     break;
3526552f7358SJed Brown   case 3:
3527552f7358SJed Brown     if (!name || isCTetgen) {
3528519f805aSKarl Rupp #if defined(PETSC_HAVE_CTETGEN)
3529552f7358SJed Brown       PetscReal *maxVolumes;
3530552f7358SJed Brown       PetscInt   c;
3531552f7358SJed Brown 
3532785e854fSJed Brown       ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr);
35330d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
3534552f7358SJed Brown       ierr = DMPlexRefine_CTetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
3535552f7358SJed Brown #else
353682f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "CTetgen needs external package support.\nPlease reconfigure with --download-ctetgen.");
3537552f7358SJed Brown #endif
3538552f7358SJed Brown     } else if (isTetgen) {
3539519f805aSKarl Rupp #if defined(PETSC_HAVE_TETGEN)
3540552f7358SJed Brown       double  *maxVolumes;
3541552f7358SJed Brown       PetscInt c;
3542552f7358SJed Brown 
3543785e854fSJed Brown       ierr = PetscMalloc1((cEnd - cStart), &maxVolumes);CHKERRQ(ierr);
35440d644c17SKarl Rupp       for (c = 0; c < cEnd-cStart; ++c) maxVolumes[c] = refinementLimit;
3545552f7358SJed Brown       ierr = DMPlexRefine_Tetgen(dm, maxVolumes, dmRefined);CHKERRQ(ierr);
3546552f7358SJed Brown #else
354782f516ccSBarry Smith       SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Tetgen needs external package support.\nPlease reconfigure with --with-c-language=cxx --download-tetgen.");
3548552f7358SJed Brown #endif
354982f516ccSBarry Smith     } else SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Unknown 3D mesh generation package %s", name);
3550552f7358SJed Brown     break;
3551552f7358SJed Brown   default:
355282f516ccSBarry Smith     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_SUP, "Mesh refinement in dimension %d is not supported.", dim);
3553552f7358SJed Brown   }
3554552f7358SJed Brown   PetscFunctionReturn(0);
3555552f7358SJed Brown }
3556552f7358SJed Brown 
3557552f7358SJed Brown #undef __FUNCT__
35580a6ba040SMatthew G. Knepley #define __FUNCT__ "DMRefineHierarchy_Plex"
35590a6ba040SMatthew G. Knepley PetscErrorCode DMRefineHierarchy_Plex(DM dm, PetscInt nlevels, DM dmRefined[])
35600a6ba040SMatthew G. Knepley {
35610a6ba040SMatthew G. Knepley   DM             cdm = dm;
35620a6ba040SMatthew G. Knepley   PetscInt       r;
35630a6ba040SMatthew G. Knepley   PetscBool      isUniform;
35640a6ba040SMatthew G. Knepley   PetscErrorCode ierr;
35650a6ba040SMatthew G. Knepley 
35660a6ba040SMatthew G. Knepley   PetscFunctionBegin;
35670a6ba040SMatthew G. Knepley   ierr = DMPlexGetRefinementUniform(dm, &isUniform);CHKERRQ(ierr);
35680a6ba040SMatthew G. Knepley   if (!isUniform) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Non-uniform refinement is incompatible with the hierarchy");
35690a6ba040SMatthew G. Knepley   for (r = 0; r < nlevels; ++r) {
35700a6ba040SMatthew G. Knepley     CellRefiner cellRefiner;
35710a6ba040SMatthew G. Knepley 
35720a6ba040SMatthew G. Knepley     ierr = DMPlexGetCellRefiner_Internal(cdm, &cellRefiner);CHKERRQ(ierr);
35730a6ba040SMatthew G. Knepley     ierr = DMPlexRefineUniform_Internal(cdm, cellRefiner, &dmRefined[r]);CHKERRQ(ierr);
35740a6ba040SMatthew G. Knepley     ierr = DMPlexSetCoarseDM(dmRefined[r], cdm);CHKERRQ(ierr);
35750a6ba040SMatthew G. Knepley     cdm  = dmRefined[r];
35760a6ba040SMatthew G. Knepley   }
35770a6ba040SMatthew G. Knepley   PetscFunctionReturn(0);
35780a6ba040SMatthew G. Knepley }
35790a6ba040SMatthew G. Knepley 
35800a6ba040SMatthew G. Knepley #undef __FUNCT__
35810a6ba040SMatthew G. Knepley #define __FUNCT__ "DMCoarsen_Plex"
35820a6ba040SMatthew G. Knepley PetscErrorCode DMCoarsen_Plex(DM dm, MPI_Comm comm, DM *dmCoarsened)
35830a6ba040SMatthew G. Knepley {
35840a6ba040SMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
3585549a8adaSMatthew G. Knepley   PetscErrorCode ierr;
35860a6ba040SMatthew G. Knepley 
35870a6ba040SMatthew G. Knepley   PetscFunctionBegin;
3588549a8adaSMatthew G. Knepley   ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr);
35890a6ba040SMatthew G. Knepley   *dmCoarsened = mesh->coarseMesh;
35900a6ba040SMatthew G. Knepley   PetscFunctionReturn(0);
35910a6ba040SMatthew G. Knepley }
35920a6ba040SMatthew G. Knepley 
35930a6ba040SMatthew G. Knepley #undef __FUNCT__
3594aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepthLabel"
3595552f7358SJed Brown /*@
3596aa50250dSMatthew G. Knepley   DMPlexGetDepthLabel - Get the DMLabel recording the depth of each point
3597552f7358SJed Brown 
3598552f7358SJed Brown   Not Collective
3599552f7358SJed Brown 
3600aa50250dSMatthew G. Knepley   Input Parameter:
3601552f7358SJed Brown . dm    - The DMPlex object
3602552f7358SJed Brown 
3603aa50250dSMatthew G. Knepley   Output Parameter:
3604aa50250dSMatthew G. Knepley . depthLabel - The DMLabel recording point depth
3605552f7358SJed Brown 
3606552f7358SJed Brown   Level: developer
3607552f7358SJed Brown 
3608aa50250dSMatthew G. Knepley .keywords: mesh, points
3609aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepth(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
3610aa50250dSMatthew G. Knepley @*/
3611aa50250dSMatthew G. Knepley PetscErrorCode DMPlexGetDepthLabel(DM dm, DMLabel *depthLabel)
3612aa50250dSMatthew G. Knepley {
3613aa50250dSMatthew G. Knepley   DM_Plex       *mesh = (DM_Plex*) dm->data;
3614aa50250dSMatthew G. Knepley   PetscErrorCode ierr;
3615aa50250dSMatthew G. Knepley 
3616aa50250dSMatthew G. Knepley   PetscFunctionBegin;
3617aa50250dSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3618aa50250dSMatthew G. Knepley   PetscValidPointer(depthLabel, 2);
361963d1a920SMatthew G. Knepley   if (!mesh->depthLabel) {ierr = DMPlexGetLabel(dm, "depth", &mesh->depthLabel);CHKERRQ(ierr);}
3620aa50250dSMatthew G. Knepley   *depthLabel = mesh->depthLabel;
3621aa50250dSMatthew G. Knepley   PetscFunctionReturn(0);
3622aa50250dSMatthew G. Knepley }
3623aa50250dSMatthew G. Knepley 
3624aa50250dSMatthew G. Knepley #undef __FUNCT__
3625aa50250dSMatthew G. Knepley #define __FUNCT__ "DMPlexGetDepth"
3626aa50250dSMatthew G. Knepley /*@
3627aa50250dSMatthew G. Knepley   DMPlexGetDepth - Get the depth of the DAG representing this mesh
3628aa50250dSMatthew G. Knepley 
3629aa50250dSMatthew G. Knepley   Not Collective
3630aa50250dSMatthew G. Knepley 
3631aa50250dSMatthew G. Knepley   Input Parameter:
3632aa50250dSMatthew G. Knepley . dm    - The DMPlex object
3633aa50250dSMatthew G. Knepley 
3634aa50250dSMatthew G. Knepley   Output Parameter:
3635aa50250dSMatthew G. Knepley . depth - The number of strata (breadth first levels) in the DAG
3636aa50250dSMatthew G. Knepley 
3637aa50250dSMatthew G. Knepley   Level: developer
3638552f7358SJed Brown 
3639552f7358SJed Brown .keywords: mesh, points
3640aa50250dSMatthew G. Knepley .seealso: DMPlexGetDepthLabel(), DMPlexGetHeightStratum(), DMPlexGetDepthStratum()
3641552f7358SJed Brown @*/
3642552f7358SJed Brown PetscErrorCode DMPlexGetDepth(DM dm, PetscInt *depth)
3643552f7358SJed Brown {
3644aa50250dSMatthew G. Knepley   DMLabel        label;
3645aa50250dSMatthew G. Knepley   PetscInt       d = 0;
3646552f7358SJed Brown   PetscErrorCode ierr;
3647552f7358SJed Brown 
3648552f7358SJed Brown   PetscFunctionBegin;
3649552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3650552f7358SJed Brown   PetscValidPointer(depth, 2);
3651aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
3652aa50250dSMatthew G. Knepley   if (label) {ierr = DMLabelGetNumValues(label, &d);CHKERRQ(ierr);}
3653552f7358SJed Brown   *depth = d-1;
3654552f7358SJed Brown   PetscFunctionReturn(0);
3655552f7358SJed Brown }
3656552f7358SJed Brown 
3657552f7358SJed Brown #undef __FUNCT__
3658552f7358SJed Brown #define __FUNCT__ "DMPlexGetDepthStratum"
3659552f7358SJed Brown /*@
3660552f7358SJed Brown   DMPlexGetDepthStratum - Get the bounds [start, end) for all points at a certain depth.
3661552f7358SJed Brown 
3662552f7358SJed Brown   Not Collective
3663552f7358SJed Brown 
3664552f7358SJed Brown   Input Parameters:
3665552f7358SJed Brown + dm           - The DMPlex object
3666552f7358SJed Brown - stratumValue - The requested depth
3667552f7358SJed Brown 
3668552f7358SJed Brown   Output Parameters:
3669552f7358SJed Brown + start - The first point at this depth
3670552f7358SJed Brown - end   - One beyond the last point at this depth
3671552f7358SJed Brown 
3672552f7358SJed Brown   Level: developer
3673552f7358SJed Brown 
3674552f7358SJed Brown .keywords: mesh, points
3675552f7358SJed Brown .seealso: DMPlexGetHeightStratum(), DMPlexGetDepth()
3676552f7358SJed Brown @*/
36770adebc6cSBarry Smith PetscErrorCode DMPlexGetDepthStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
36780adebc6cSBarry Smith {
3679aa50250dSMatthew G. Knepley   DMLabel        label;
368063d1a920SMatthew G. Knepley   PetscInt       pStart, pEnd;
3681552f7358SJed Brown   PetscErrorCode ierr;
3682552f7358SJed Brown 
3683552f7358SJed Brown   PetscFunctionBegin;
3684552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
368563d1a920SMatthew G. Knepley   if (start) {PetscValidPointer(start, 3); *start = 0;}
368663d1a920SMatthew G. Knepley   if (end)   {PetscValidPointer(end,   4); *end   = 0;}
3687552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
36880d644c17SKarl Rupp   if (pStart == pEnd) PetscFunctionReturn(0);
368963d1a920SMatthew G. Knepley   if (stratumValue < 0) {
369063d1a920SMatthew G. Knepley     if (start) *start = pStart;
369163d1a920SMatthew G. Knepley     if (end)   *end   = pEnd;
369263d1a920SMatthew G. Knepley     PetscFunctionReturn(0);
3693552f7358SJed Brown   }
3694aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
369563d1a920SMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");
369663d1a920SMatthew G. Knepley   ierr = DMLabelGetStratumBounds(label, stratumValue, start, end);CHKERRQ(ierr);
3697552f7358SJed Brown   PetscFunctionReturn(0);
3698552f7358SJed Brown }
3699552f7358SJed Brown 
3700552f7358SJed Brown #undef __FUNCT__
3701552f7358SJed Brown #define __FUNCT__ "DMPlexGetHeightStratum"
3702552f7358SJed Brown /*@
3703552f7358SJed Brown   DMPlexGetHeightStratum - Get the bounds [start, end) for all points at a certain height.
3704552f7358SJed Brown 
3705552f7358SJed Brown   Not Collective
3706552f7358SJed Brown 
3707552f7358SJed Brown   Input Parameters:
3708552f7358SJed Brown + dm           - The DMPlex object
3709552f7358SJed Brown - stratumValue - The requested height
3710552f7358SJed Brown 
3711552f7358SJed Brown   Output Parameters:
3712552f7358SJed Brown + start - The first point at this height
3713552f7358SJed Brown - end   - One beyond the last point at this height
3714552f7358SJed Brown 
3715552f7358SJed Brown   Level: developer
3716552f7358SJed Brown 
3717552f7358SJed Brown .keywords: mesh, points
3718552f7358SJed Brown .seealso: DMPlexGetDepthStratum(), DMPlexGetDepth()
3719552f7358SJed Brown @*/
37200adebc6cSBarry Smith PetscErrorCode DMPlexGetHeightStratum(DM dm, PetscInt stratumValue, PetscInt *start, PetscInt *end)
37210adebc6cSBarry Smith {
3722aa50250dSMatthew G. Knepley   DMLabel        label;
372363d1a920SMatthew G. Knepley   PetscInt       depth, pStart, pEnd;
3724552f7358SJed Brown   PetscErrorCode ierr;
3725552f7358SJed Brown 
3726552f7358SJed Brown   PetscFunctionBegin;
3727552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
372863d1a920SMatthew G. Knepley   if (start) {PetscValidPointer(start, 3); *start = 0;}
372963d1a920SMatthew G. Knepley   if (end)   {PetscValidPointer(end,   4); *end   = 0;}
3730552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
37310d644c17SKarl Rupp   if (pStart == pEnd) PetscFunctionReturn(0);
373263d1a920SMatthew G. Knepley   if (stratumValue < 0) {
373363d1a920SMatthew G. Knepley     if (start) *start = pStart;
373463d1a920SMatthew G. Knepley     if (end)   *end   = pEnd;
373563d1a920SMatthew G. Knepley     PetscFunctionReturn(0);
3736552f7358SJed Brown   }
3737aa50250dSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &label);CHKERRQ(ierr);
3738aa50250dSMatthew G. Knepley   if (!label) SETERRQ(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_WRONG, "No label named depth was found");CHKERRQ(ierr);
373963d1a920SMatthew G. Knepley   ierr = DMLabelGetNumValues(label, &depth);CHKERRQ(ierr);
374063d1a920SMatthew G. Knepley   ierr = DMLabelGetStratumBounds(label, depth-1-stratumValue, start, end);CHKERRQ(ierr);
3741552f7358SJed Brown   PetscFunctionReturn(0);
3742552f7358SJed Brown }
3743552f7358SJed Brown 
3744552f7358SJed Brown #undef __FUNCT__
3745552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionInitial"
3746552f7358SJed Brown /* Set the number of dof on each point and separate by fields */
3747a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionInitial(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscSection *section)
3748a6dfd86eSKarl Rupp {
3749552f7358SJed Brown   PetscInt      *numDofTot;
3750916f0f19SMatthew G. Knepley   PetscInt       depth, pStart = 0, pEnd = 0;
3751916f0f19SMatthew G. Knepley   PetscInt       p, d, dep, f;
3752552f7358SJed Brown   PetscErrorCode ierr;
3753552f7358SJed Brown 
3754552f7358SJed Brown   PetscFunctionBegin;
3755785e854fSJed Brown   ierr = PetscMalloc1((dim+1), &numDofTot);CHKERRQ(ierr);
3756552f7358SJed Brown   for (d = 0; d <= dim; ++d) {
3757552f7358SJed Brown     numDofTot[d] = 0;
37580d644c17SKarl Rupp     for (f = 0; f < numFields; ++f) numDofTot[d] += numDof[f*(dim+1)+d];
3759552f7358SJed Brown   }
376082f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), section);CHKERRQ(ierr);
3761552f7358SJed Brown   if (numFields > 0) {
3762552f7358SJed Brown     ierr = PetscSectionSetNumFields(*section, numFields);CHKERRQ(ierr);
3763552f7358SJed Brown     if (numComp) {
3764552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3765552f7358SJed Brown         ierr = PetscSectionSetFieldComponents(*section, f, numComp[f]);CHKERRQ(ierr);
3766552f7358SJed Brown       }
3767552f7358SJed Brown     }
3768552f7358SJed Brown   }
3769552f7358SJed Brown   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3770552f7358SJed Brown   ierr = PetscSectionSetChart(*section, pStart, pEnd);CHKERRQ(ierr);
3771916f0f19SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3772916f0f19SMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
3773916f0f19SMatthew G. Knepley     d    = dim == depth ? dep : (!dep ? 0 : dim);
3774916f0f19SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, dep, &pStart, &pEnd);CHKERRQ(ierr);
3775552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
3776552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3777552f7358SJed Brown         ierr = PetscSectionSetFieldDof(*section, p, f, numDof[f*(dim+1)+d]);CHKERRQ(ierr);
3778552f7358SJed Brown       }
3779552f7358SJed Brown       ierr = PetscSectionSetDof(*section, p, numDofTot[d]);CHKERRQ(ierr);
3780552f7358SJed Brown     }
3781552f7358SJed Brown   }
3782552f7358SJed Brown   ierr = PetscFree(numDofTot);CHKERRQ(ierr);
3783552f7358SJed Brown   PetscFunctionReturn(0);
3784552f7358SJed Brown }
3785552f7358SJed Brown 
3786552f7358SJed Brown #undef __FUNCT__
3787552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCDof"
3788552f7358SJed Brown /* Set the number of dof on each point and separate by fields
3789552f7358SJed Brown    If constDof is PETSC_DETERMINE, constrain every dof on the point
3790552f7358SJed Brown */
3791a6dfd86eSKarl Rupp PetscErrorCode DMPlexCreateSectionBCDof(DM dm, PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], PetscInt constDof, PetscSection section)
3792a6dfd86eSKarl Rupp {
3793552f7358SJed Brown   PetscInt       numFields;
3794552f7358SJed Brown   PetscInt       bc;
3795552f7358SJed Brown   PetscErrorCode ierr;
3796552f7358SJed Brown 
3797552f7358SJed Brown   PetscFunctionBegin;
3798552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3799552f7358SJed Brown   for (bc = 0; bc < numBC; ++bc) {
3800552f7358SJed Brown     PetscInt        field = 0;
3801552f7358SJed Brown     const PetscInt *idx;
3802552f7358SJed Brown     PetscInt        n, i;
3803552f7358SJed Brown 
38040d644c17SKarl Rupp     if (numFields) field = bcField[bc];
3805552f7358SJed Brown     ierr = ISGetLocalSize(bcPoints[bc], &n);CHKERRQ(ierr);
3806552f7358SJed Brown     ierr = ISGetIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
3807552f7358SJed Brown     for (i = 0; i < n; ++i) {
3808552f7358SJed Brown       const PetscInt p        = idx[i];
3809552f7358SJed Brown       PetscInt       numConst = constDof;
3810552f7358SJed Brown 
3811552f7358SJed Brown       /* Constrain every dof on the point */
3812552f7358SJed Brown       if (numConst < 0) {
3813552f7358SJed Brown         if (numFields) {
3814552f7358SJed Brown           ierr = PetscSectionGetFieldDof(section, p, field, &numConst);CHKERRQ(ierr);
3815552f7358SJed Brown         } else {
3816552f7358SJed Brown           ierr = PetscSectionGetDof(section, p, &numConst);CHKERRQ(ierr);
3817552f7358SJed Brown         }
3818552f7358SJed Brown       }
3819552f7358SJed Brown       if (numFields) {
3820552f7358SJed Brown         ierr = PetscSectionAddFieldConstraintDof(section, p, field, numConst);CHKERRQ(ierr);
3821552f7358SJed Brown       }
3822552f7358SJed Brown       ierr = PetscSectionAddConstraintDof(section, p, numConst);CHKERRQ(ierr);
3823552f7358SJed Brown     }
3824552f7358SJed Brown     ierr = ISRestoreIndices(bcPoints[bc], &idx);CHKERRQ(ierr);
3825552f7358SJed Brown   }
3826552f7358SJed Brown   PetscFunctionReturn(0);
3827552f7358SJed Brown }
3828552f7358SJed Brown 
3829552f7358SJed Brown #undef __FUNCT__
3830552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesAll"
3831552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
38320adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesAll(DM dm, PetscSection section)
38330adebc6cSBarry Smith {
3834552f7358SJed Brown   PetscInt      *maxConstraints;
3835552f7358SJed Brown   PetscInt       numFields, f, pStart = 0, pEnd = 0, p;
3836552f7358SJed Brown   PetscErrorCode ierr;
3837552f7358SJed Brown 
3838552f7358SJed Brown   PetscFunctionBegin;
3839552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3840552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3841785e854fSJed Brown   ierr = PetscMalloc1((numFields+1), &maxConstraints);CHKERRQ(ierr);
38420d644c17SKarl Rupp   for (f = 0; f <= numFields; ++f) maxConstraints[f] = 0;
3843552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
3844552f7358SJed Brown     PetscInt cdof;
3845552f7358SJed Brown 
3846552f7358SJed Brown     if (numFields) {
3847552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3848552f7358SJed Brown         ierr              = PetscSectionGetFieldConstraintDof(section, p, f, &cdof);CHKERRQ(ierr);
3849552f7358SJed Brown         maxConstraints[f] = PetscMax(maxConstraints[f], cdof);
3850552f7358SJed Brown       }
3851552f7358SJed Brown     } else {
3852552f7358SJed Brown       ierr              = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3853552f7358SJed Brown       maxConstraints[0] = PetscMax(maxConstraints[0], cdof);
3854552f7358SJed Brown     }
3855552f7358SJed Brown   }
3856552f7358SJed Brown   for (f = 0; f < numFields; ++f) {
3857552f7358SJed Brown     maxConstraints[numFields] += maxConstraints[f];
3858552f7358SJed Brown   }
3859552f7358SJed Brown   if (maxConstraints[numFields]) {
3860552f7358SJed Brown     PetscInt *indices;
3861552f7358SJed Brown 
3862785e854fSJed Brown     ierr = PetscMalloc1(maxConstraints[numFields], &indices);CHKERRQ(ierr);
3863552f7358SJed Brown     for (p = pStart; p < pEnd; ++p) {
3864552f7358SJed Brown       PetscInt cdof, d;
3865552f7358SJed Brown 
3866552f7358SJed Brown       ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3867552f7358SJed Brown       if (cdof) {
3868552f7358SJed 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]);
3869552f7358SJed Brown         if (numFields) {
3870552f7358SJed Brown           PetscInt numConst = 0, foff = 0;
3871552f7358SJed Brown 
3872552f7358SJed Brown           for (f = 0; f < numFields; ++f) {
3873552f7358SJed Brown             PetscInt cfdof, fdof;
3874552f7358SJed Brown 
3875552f7358SJed Brown             ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3876552f7358SJed Brown             ierr = PetscSectionGetFieldConstraintDof(section, p, f, &cfdof);CHKERRQ(ierr);
3877552f7358SJed Brown             /* Change constraint numbering from absolute local dof number to field relative local dof number */
38780d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] = d;
3879552f7358SJed Brown             ierr = PetscSectionSetFieldConstraintIndices(section, p, f, &indices[numConst]);CHKERRQ(ierr);
38800d644c17SKarl Rupp             for (d = 0; d < cfdof; ++d) indices[numConst+d] += foff;
3881552f7358SJed Brown             numConst += cfdof;
3882552f7358SJed Brown             foff     += fdof;
3883552f7358SJed Brown           }
3884552f7358SJed Brown           if (cdof != numConst) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
3885552f7358SJed Brown         } else {
38860d644c17SKarl Rupp           for (d = 0; d < cdof; ++d) indices[d] = d;
3887552f7358SJed Brown         }
3888552f7358SJed Brown         ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3889552f7358SJed Brown       }
3890552f7358SJed Brown     }
3891552f7358SJed Brown     ierr = PetscFree(indices);CHKERRQ(ierr);
3892552f7358SJed Brown   }
3893552f7358SJed Brown   ierr = PetscFree(maxConstraints);CHKERRQ(ierr);
3894552f7358SJed Brown   PetscFunctionReturn(0);
3895552f7358SJed Brown }
3896552f7358SJed Brown 
3897552f7358SJed Brown #undef __FUNCT__
3898552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndicesField"
3899552f7358SJed Brown /* Set the constrained field indices on each point */
39000adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndicesField(DM dm, PetscInt field, IS bcPoints, IS constraintIndices, PetscSection section)
39010adebc6cSBarry Smith {
3902552f7358SJed Brown   const PetscInt *points, *indices;
3903552f7358SJed Brown   PetscInt        numFields, maxDof, numPoints, p, numConstraints;
3904552f7358SJed Brown   PetscErrorCode  ierr;
3905552f7358SJed Brown 
3906552f7358SJed Brown   PetscFunctionBegin;
3907552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
3908552f7358SJed 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);
3909552f7358SJed Brown 
3910552f7358SJed Brown   ierr = ISGetLocalSize(bcPoints, &numPoints);CHKERRQ(ierr);
3911552f7358SJed Brown   ierr = ISGetIndices(bcPoints, &points);CHKERRQ(ierr);
3912552f7358SJed Brown   if (!constraintIndices) {
3913552f7358SJed Brown     PetscInt *idx, i;
3914552f7358SJed Brown 
3915552f7358SJed Brown     ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3916785e854fSJed Brown     ierr = PetscMalloc1(maxDof, &idx);CHKERRQ(ierr);
39170d644c17SKarl Rupp     for (i = 0; i < maxDof; ++i) idx[i] = i;
3918552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
3919552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, idx);CHKERRQ(ierr);
3920552f7358SJed Brown     }
3921552f7358SJed Brown     ierr = PetscFree(idx);CHKERRQ(ierr);
3922552f7358SJed Brown   } else {
3923552f7358SJed Brown     ierr = ISGetLocalSize(constraintIndices, &numConstraints);CHKERRQ(ierr);
3924552f7358SJed Brown     ierr = ISGetIndices(constraintIndices, &indices);CHKERRQ(ierr);
3925552f7358SJed Brown     for (p = 0; p < numPoints; ++p) {
3926552f7358SJed Brown       PetscInt fcdof;
3927552f7358SJed Brown 
3928552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintDof(section, points[p], field, &fcdof);CHKERRQ(ierr);
392982f516ccSBarry 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);
3930552f7358SJed Brown       ierr = PetscSectionSetFieldConstraintIndices(section, points[p], field, indices);CHKERRQ(ierr);
3931552f7358SJed Brown     }
3932552f7358SJed Brown     ierr = ISRestoreIndices(constraintIndices, &indices);CHKERRQ(ierr);
3933552f7358SJed Brown   }
3934552f7358SJed Brown   ierr = ISRestoreIndices(bcPoints, &points);CHKERRQ(ierr);
3935552f7358SJed Brown   PetscFunctionReturn(0);
3936552f7358SJed Brown }
3937552f7358SJed Brown 
3938552f7358SJed Brown #undef __FUNCT__
3939552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSectionBCIndices"
3940552f7358SJed Brown /* Set the constrained indices on each point and separate by fields */
39410adebc6cSBarry Smith PetscErrorCode DMPlexCreateSectionBCIndices(DM dm, PetscSection section)
39420adebc6cSBarry Smith {
3943552f7358SJed Brown   PetscInt      *indices;
3944552f7358SJed Brown   PetscInt       numFields, maxDof, f, pStart = 0, pEnd = 0, p;
3945552f7358SJed Brown   PetscErrorCode ierr;
3946552f7358SJed Brown 
3947552f7358SJed Brown   PetscFunctionBegin;
3948552f7358SJed Brown   ierr = PetscSectionGetMaxDof(section, &maxDof);CHKERRQ(ierr);
3949785e854fSJed Brown   ierr = PetscMalloc1(maxDof, &indices);CHKERRQ(ierr);
3950552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
395182f516ccSBarry Smith   if (!numFields) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "This function only works after users have set field constraint indices.");
3952552f7358SJed Brown   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
3953552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
3954552f7358SJed Brown     PetscInt cdof, d;
3955552f7358SJed Brown 
3956552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(section, p, &cdof);CHKERRQ(ierr);
3957552f7358SJed Brown     if (cdof) {
3958552f7358SJed Brown       PetscInt numConst = 0, foff = 0;
3959552f7358SJed Brown 
3960552f7358SJed Brown       for (f = 0; f < numFields; ++f) {
3961552f7358SJed Brown         const PetscInt *fcind;
3962552f7358SJed Brown         PetscInt        fdof, fcdof;
3963552f7358SJed Brown 
3964552f7358SJed Brown         ierr = PetscSectionGetFieldDof(section, p, f, &fdof);CHKERRQ(ierr);
3965552f7358SJed Brown         ierr = PetscSectionGetFieldConstraintDof(section, p, f, &fcdof);CHKERRQ(ierr);
3966552f7358SJed Brown         if (fcdof) {ierr = PetscSectionGetFieldConstraintIndices(section, p, f, &fcind);CHKERRQ(ierr);}
3967552f7358SJed Brown         /* Change constraint numbering from field relative local dof number to absolute local dof number */
39680d644c17SKarl Rupp         for (d = 0; d < fcdof; ++d) indices[numConst+d] = fcind[d]+foff;
3969552f7358SJed Brown         foff     += fdof;
3970552f7358SJed Brown         numConst += fcdof;
3971552f7358SJed Brown       }
397282f516ccSBarry Smith       if (cdof != numConst) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_LIB, "Total number of field constraints %D should be %D", numConst, cdof);
3973552f7358SJed Brown       ierr = PetscSectionSetConstraintIndices(section, p, indices);CHKERRQ(ierr);
3974552f7358SJed Brown     }
3975552f7358SJed Brown   }
3976552f7358SJed Brown   ierr = PetscFree(indices);CHKERRQ(ierr);
3977552f7358SJed Brown   PetscFunctionReturn(0);
3978552f7358SJed Brown }
3979552f7358SJed Brown 
3980552f7358SJed Brown #undef __FUNCT__
3981552f7358SJed Brown #define __FUNCT__ "DMPlexCreateSection"
3982552f7358SJed Brown /*@C
3983552f7358SJed Brown   DMPlexCreateSection - Create a PetscSection based upon the dof layout specification provided.
3984552f7358SJed Brown 
3985552f7358SJed Brown   Not Collective
3986552f7358SJed Brown 
3987552f7358SJed Brown   Input Parameters:
3988552f7358SJed Brown + dm        - The DMPlex object
3989552f7358SJed Brown . dim       - The spatial dimension of the problem
3990552f7358SJed Brown . numFields - The number of fields in the problem
3991552f7358SJed Brown . numComp   - An array of size numFields that holds the number of components for each field
3992552f7358SJed 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
3993552f7358SJed Brown . numBC     - The number of boundary conditions
3994552f7358SJed Brown . bcField   - An array of size numBC giving the field number for each boundry condition
3995*f8f126e8SMatthew G. Knepley . bcPoints  - An array of size numBC giving an IS holding the sieve points to which each boundary condition applies
3996*f8f126e8SMatthew G. Knepley - perm      - Optional permutation of the chart, or NULL
3997552f7358SJed Brown 
3998552f7358SJed Brown   Output Parameter:
3999552f7358SJed Brown . section - The PetscSection object
4000552f7358SJed Brown 
4001552f7358SJed 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
4002*f8f126e8SMatthew G. Knepley   number of dof for field 0 on each edge.
4003*f8f126e8SMatthew G. Knepley 
4004*f8f126e8SMatthew G. Knepley   The chart permutation is the same one set using PetscSectionSetPermutation()
4005552f7358SJed Brown 
4006552f7358SJed Brown   Level: developer
4007552f7358SJed Brown 
40083813dfbdSMatthew G Knepley   Fortran Notes:
40093813dfbdSMatthew G Knepley   A Fortran 90 version is available as DMPlexCreateSectionF90()
40103813dfbdSMatthew G Knepley 
4011552f7358SJed Brown .keywords: mesh, elements
4012*f8f126e8SMatthew G. Knepley .seealso: DMPlexCreate(), PetscSectionCreate(), PetscSectionSetPermutation()
4013552f7358SJed Brown @*/
4014*f8f126e8SMatthew G. Knepley PetscErrorCode DMPlexCreateSection(DM dm, PetscInt dim, PetscInt numFields,const PetscInt numComp[],const PetscInt numDof[], PetscInt numBC,const PetscInt bcField[],const IS bcPoints[], IS perm, PetscSection *section)
4015a6dfd86eSKarl Rupp {
4016552f7358SJed Brown   PetscErrorCode ierr;
4017552f7358SJed Brown 
4018552f7358SJed Brown   PetscFunctionBegin;
4019552f7358SJed Brown   ierr = DMPlexCreateSectionInitial(dm, dim, numFields, numComp, numDof, section);CHKERRQ(ierr);
4020552f7358SJed Brown   ierr = DMPlexCreateSectionBCDof(dm, numBC, bcField, bcPoints, PETSC_DETERMINE, *section);CHKERRQ(ierr);
4021*f8f126e8SMatthew G. Knepley   if (perm) {ierr = PetscSectionSetPermutation(*section, perm);CHKERRQ(ierr);}
4022552f7358SJed Brown   ierr = PetscSectionSetUp(*section);CHKERRQ(ierr);
4023552f7358SJed Brown   if (numBC) {ierr = DMPlexCreateSectionBCIndicesAll(dm, *section);CHKERRQ(ierr);}
4024ce1779c8SBarry Smith   ierr = PetscSectionViewFromOptions(*section,NULL,"-section_view");CHKERRQ(ierr);
4025552f7358SJed Brown   PetscFunctionReturn(0);
4026552f7358SJed Brown }
4027552f7358SJed Brown 
4028552f7358SJed Brown #undef __FUNCT__
4029552f7358SJed Brown #define __FUNCT__ "DMCreateCoordinateDM_Plex"
40300adebc6cSBarry Smith PetscErrorCode DMCreateCoordinateDM_Plex(DM dm, DM *cdm)
40310adebc6cSBarry Smith {
4032552f7358SJed Brown   PetscSection   section;
4033552f7358SJed Brown   PetscErrorCode ierr;
4034552f7358SJed Brown 
4035552f7358SJed Brown   PetscFunctionBegin;
403638221697SMatthew G. Knepley   ierr = DMClone(dm, cdm);CHKERRQ(ierr);
403782f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
4038552f7358SJed Brown   ierr = DMSetDefaultSection(*cdm, section);CHKERRQ(ierr);
40391d799100SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
4040552f7358SJed Brown   PetscFunctionReturn(0);
4041552f7358SJed Brown }
4042552f7358SJed Brown 
4043552f7358SJed Brown #undef __FUNCT__
4044552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeSection"
40450adebc6cSBarry Smith PetscErrorCode DMPlexGetConeSection(DM dm, PetscSection *section)
40460adebc6cSBarry Smith {
4047552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
4048552f7358SJed Brown 
4049552f7358SJed Brown   PetscFunctionBegin;
4050552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4051552f7358SJed Brown   if (section) *section = mesh->coneSection;
4052552f7358SJed Brown   PetscFunctionReturn(0);
4053552f7358SJed Brown }
4054552f7358SJed Brown 
4055552f7358SJed Brown #undef __FUNCT__
40568cb4d582SMatthew G. Knepley #define __FUNCT__ "DMPlexGetSupportSection"
40578cb4d582SMatthew G. Knepley PetscErrorCode DMPlexGetSupportSection(DM dm, PetscSection *section)
40588cb4d582SMatthew G. Knepley {
40598cb4d582SMatthew G. Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
40608cb4d582SMatthew G. Knepley 
40618cb4d582SMatthew G. Knepley   PetscFunctionBegin;
40628cb4d582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
40638cb4d582SMatthew G. Knepley   if (section) *section = mesh->supportSection;
40648cb4d582SMatthew G. Knepley   PetscFunctionReturn(0);
40658cb4d582SMatthew G. Knepley }
40668cb4d582SMatthew G. Knepley 
40678cb4d582SMatthew G. Knepley #undef __FUNCT__
4068552f7358SJed Brown #define __FUNCT__ "DMPlexGetCones"
4069a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetCones(DM dm, PetscInt *cones[])
4070a6dfd86eSKarl Rupp {
4071552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
4072552f7358SJed Brown 
4073552f7358SJed Brown   PetscFunctionBegin;
4074552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4075552f7358SJed Brown   if (cones) *cones = mesh->cones;
4076552f7358SJed Brown   PetscFunctionReturn(0);
4077552f7358SJed Brown }
4078552f7358SJed Brown 
4079552f7358SJed Brown #undef __FUNCT__
4080552f7358SJed Brown #define __FUNCT__ "DMPlexGetConeOrientations"
4081a6dfd86eSKarl Rupp PetscErrorCode DMPlexGetConeOrientations(DM dm, PetscInt *coneOrientations[])
4082a6dfd86eSKarl Rupp {
4083552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
4084552f7358SJed Brown 
4085552f7358SJed Brown   PetscFunctionBegin;
4086552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4087552f7358SJed Brown   if (coneOrientations) *coneOrientations = mesh->coneOrientations;
4088552f7358SJed Brown   PetscFunctionReturn(0);
4089552f7358SJed Brown }
4090552f7358SJed Brown 
4091552f7358SJed Brown /******************************** FEM Support **********************************/
4092552f7358SJed Brown 
4093552f7358SJed Brown #undef __FUNCT__
40941a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Depth1_Static"
40951a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Depth1_Static(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
4096a6dfd86eSKarl Rupp {
4097552f7358SJed Brown   PetscScalar    *array, *vArray;
4098d9917b9dSMatthew G. Knepley   const PetscInt *cone, *coneO;
40991a271a75SMatthew G. Knepley   PetscInt        pStart, pEnd, p, numPoints, size = 0, offset = 0;
4100552f7358SJed Brown   PetscErrorCode  ierr;
4101552f7358SJed Brown 
41021b406b76SMatthew G. Knepley   PetscFunctionBeginHot;
41032a3aaacfSMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
41045a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
41055a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
41065a1bb5cfSMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
41073f7cbbe7SMatthew G. Knepley   if (!values || !*values) {
41089df71ca4SMatthew G. Knepley     if ((point >= pStart) && (point < pEnd)) {
41099df71ca4SMatthew G. Knepley       PetscInt dof;
4110d9917b9dSMatthew G. Knepley 
41119df71ca4SMatthew G. Knepley       ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
41129df71ca4SMatthew G. Knepley       size += dof;
41139df71ca4SMatthew G. Knepley     }
41149df71ca4SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
41159df71ca4SMatthew G. Knepley       const PetscInt cp = cone[p];
41162a3aaacfSMatthew G. Knepley       PetscInt       dof;
41175a1bb5cfSMatthew G. Knepley 
41185a1bb5cfSMatthew G. Knepley       if ((cp < pStart) || (cp >= pEnd)) continue;
41192a3aaacfSMatthew G. Knepley       ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
41205a1bb5cfSMatthew G. Knepley       size += dof;
41215a1bb5cfSMatthew G. Knepley     }
41223f7cbbe7SMatthew G. Knepley     if (!values) {
41233f7cbbe7SMatthew G. Knepley       if (csize) *csize = size;
41243f7cbbe7SMatthew G. Knepley       PetscFunctionReturn(0);
41253f7cbbe7SMatthew G. Knepley     }
41265a1bb5cfSMatthew G. Knepley     ierr = DMGetWorkArray(dm, size, PETSC_SCALAR, &array);CHKERRQ(ierr);
4127982e9ed1SMatthew G. Knepley   } else {
4128982e9ed1SMatthew G. Knepley     array = *values;
4129982e9ed1SMatthew G. Knepley   }
41309df71ca4SMatthew G. Knepley   size = 0;
41315a1bb5cfSMatthew G. Knepley   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
41329df71ca4SMatthew G. Knepley   if ((point >= pStart) && (point < pEnd)) {
41339df71ca4SMatthew G. Knepley     PetscInt     dof, off, d;
41349df71ca4SMatthew G. Knepley     PetscScalar *varr;
4135d9917b9dSMatthew G. Knepley 
41369df71ca4SMatthew G. Knepley     ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
41379df71ca4SMatthew G. Knepley     ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
41389df71ca4SMatthew G. Knepley     varr = &vArray[off];
41391a271a75SMatthew G. Knepley     for (d = 0; d < dof; ++d, ++offset) {
41401a271a75SMatthew G. Knepley       array[offset] = varr[d];
41419df71ca4SMatthew G. Knepley     }
41429df71ca4SMatthew G. Knepley     size += dof;
41439df71ca4SMatthew G. Knepley   }
41449df71ca4SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
41459df71ca4SMatthew G. Knepley     const PetscInt cp = cone[p];
41469df71ca4SMatthew G. Knepley     PetscInt       o  = coneO[p];
41475a1bb5cfSMatthew G. Knepley     PetscInt       dof, off, d;
41485a1bb5cfSMatthew G. Knepley     PetscScalar   *varr;
41495a1bb5cfSMatthew G. Knepley 
415052ed52e8SMatthew G. Knepley     if ((cp < pStart) || (cp >= pEnd)) continue;
41515a1bb5cfSMatthew G. Knepley     ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
41525a1bb5cfSMatthew G. Knepley     ierr = PetscSectionGetOffset(section, cp, &off);CHKERRQ(ierr);
41535a1bb5cfSMatthew G. Knepley     varr = &vArray[off];
41545a1bb5cfSMatthew G. Knepley     if (o >= 0) {
41551a271a75SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offset) {
41561a271a75SMatthew G. Knepley         array[offset] = varr[d];
41575a1bb5cfSMatthew G. Knepley       }
41585a1bb5cfSMatthew G. Knepley     } else {
41591a271a75SMatthew G. Knepley       for (d = dof-1; d >= 0; --d, ++offset) {
41601a271a75SMatthew G. Knepley         array[offset] = varr[d];
41615a1bb5cfSMatthew G. Knepley       }
41625a1bb5cfSMatthew G. Knepley     }
41639df71ca4SMatthew G. Knepley     size += dof;
41645a1bb5cfSMatthew G. Knepley   }
41655a1bb5cfSMatthew G. Knepley   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
41669df71ca4SMatthew G. Knepley   if (!*values) {
41675a1bb5cfSMatthew G. Knepley     if (csize) *csize = size;
41685a1bb5cfSMatthew G. Knepley     *values = array;
41699df71ca4SMatthew G. Knepley   } else {
41709df71ca4SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
41718c312ff3SMatthew G. Knepley     *csize = size;
41729df71ca4SMatthew G. Knepley   }
41735a1bb5cfSMatthew G. Knepley   PetscFunctionReturn(0);
41745a1bb5cfSMatthew G. Knepley }
4175d9917b9dSMatthew G. Knepley 
4176d9917b9dSMatthew G. Knepley #undef __FUNCT__
41771a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Static"
41781a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], const PetscScalar vArray[], PetscInt *size, PetscScalar array[])
41791a271a75SMatthew G. Knepley {
41801a271a75SMatthew G. Knepley   PetscInt       offset = 0, p;
41811a271a75SMatthew G. Knepley   PetscErrorCode ierr;
41821a271a75SMatthew G. Knepley 
41831a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
4184fe02ba77SJed Brown   *size = 0;
41851a271a75SMatthew G. Knepley   for (p = 0; p < numPoints*2; p += 2) {
41861a271a75SMatthew G. Knepley     const PetscInt point = points[p];
41871a271a75SMatthew G. Knepley     const PetscInt o     = points[p+1];
41881a271a75SMatthew G. Knepley     PetscInt       dof, off, d;
41891a271a75SMatthew G. Knepley     const PetscScalar *varr;
41901a271a75SMatthew G. Knepley 
41911a271a75SMatthew G. Knepley     ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
41921a271a75SMatthew G. Knepley     ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
41931a271a75SMatthew G. Knepley     varr = &vArray[off];
41941a271a75SMatthew G. Knepley     if (o >= 0) {
41951a271a75SMatthew G. Knepley       for (d = 0; d < dof; ++d, ++offset)    array[offset] = varr[d];
41961a271a75SMatthew G. Knepley     } else {
41971a271a75SMatthew G. Knepley       for (d = dof-1; d >= 0; --d, ++offset) array[offset] = varr[d];
41981a271a75SMatthew G. Knepley     }
41991a271a75SMatthew G. Knepley   }
42001a271a75SMatthew G. Knepley   *size = offset;
42011a271a75SMatthew G. Knepley   PetscFunctionReturn(0);
42021a271a75SMatthew G. Knepley }
42031a271a75SMatthew G. Knepley 
42041a271a75SMatthew G. Knepley #undef __FUNCT__
42051a271a75SMatthew G. Knepley #define __FUNCT__ "DMPlexVecGetClosure_Fields_Static"
42061a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecGetClosure_Fields_Static(PetscSection section, PetscInt numPoints, const PetscInt points[], PetscInt numFields, const PetscScalar vArray[], PetscInt *size, PetscScalar array[])
42071a271a75SMatthew G. Knepley {
42081a271a75SMatthew G. Knepley   PetscInt       offset = 0, f;
42091a271a75SMatthew G. Knepley   PetscErrorCode ierr;
42101a271a75SMatthew G. Knepley 
42111a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
4212fe02ba77SJed Brown   *size = 0;
42131a271a75SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
42141a271a75SMatthew G. Knepley     PetscInt fcomp, p;
42151a271a75SMatthew G. Knepley 
42161a271a75SMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
42171a271a75SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
42181a271a75SMatthew G. Knepley       const PetscInt point = points[p];
42191a271a75SMatthew G. Knepley       const PetscInt o     = points[p+1];
42201a271a75SMatthew G. Knepley       PetscInt       fdof, foff, d, c;
42211a271a75SMatthew G. Knepley       const PetscScalar *varr;
42221a271a75SMatthew G. Knepley 
42231a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
42241a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
42251a271a75SMatthew G. Knepley       varr = &vArray[foff];
42261a271a75SMatthew G. Knepley       if (o >= 0) {
42271a271a75SMatthew G. Knepley         for (d = 0; d < fdof; ++d, ++offset) array[offset] = varr[d];
42281a271a75SMatthew G. Knepley       } else {
42291a271a75SMatthew G. Knepley         for (d = fdof/fcomp-1; d >= 0; --d) {
42301a271a75SMatthew G. Knepley           for (c = 0; c < fcomp; ++c, ++offset) {
42311a271a75SMatthew G. Knepley             array[offset] = varr[d*fcomp+c];
42321a271a75SMatthew G. Knepley           }
42331a271a75SMatthew G. Knepley         }
42341a271a75SMatthew G. Knepley       }
42351a271a75SMatthew G. Knepley     }
42361a271a75SMatthew G. Knepley   }
42371a271a75SMatthew G. Knepley   *size = offset;
42381a271a75SMatthew G. Knepley   PetscFunctionReturn(0);
42391a271a75SMatthew G. Knepley }
42401a271a75SMatthew G. Knepley 
42411a271a75SMatthew G. Knepley #undef __FUNCT__
4242552f7358SJed Brown #define __FUNCT__ "DMPlexVecGetClosure"
4243552f7358SJed Brown /*@C
4244552f7358SJed Brown   DMPlexVecGetClosure - Get an array of the values on the closure of 'point'
4245552f7358SJed Brown 
4246552f7358SJed Brown   Not collective
4247552f7358SJed Brown 
4248552f7358SJed Brown   Input Parameters:
4249552f7358SJed Brown + dm - The DM
4250552f7358SJed Brown . section - The section describing the layout in v, or NULL to use the default section
4251552f7358SJed Brown . v - The local vector
4252552f7358SJed Brown - point - The sieve point in the DM
4253552f7358SJed Brown 
4254552f7358SJed Brown   Output Parameters:
4255552f7358SJed Brown + csize - The number of values in the closure, or NULL
4256552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
4257552f7358SJed Brown 
4258552f7358SJed Brown   Fortran Notes:
4259552f7358SJed Brown   Since it returns an array, this routine is only available in Fortran 90, and you must
4260552f7358SJed Brown   include petsc.h90 in your code.
4261552f7358SJed Brown 
4262552f7358SJed Brown   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
4263552f7358SJed Brown 
4264552f7358SJed Brown   Level: intermediate
4265552f7358SJed Brown 
4266552f7358SJed Brown .seealso DMPlexVecRestoreClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
4267552f7358SJed Brown @*/
4268552f7358SJed Brown PetscErrorCode DMPlexVecGetClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
4269552f7358SJed Brown {
4270552f7358SJed Brown   PetscSection    clSection;
4271d9917b9dSMatthew G. Knepley   IS              clPoints;
4272552f7358SJed Brown   PetscScalar    *array, *vArray;
4273552f7358SJed Brown   PetscInt       *points = NULL;
4274d9917b9dSMatthew G. Knepley   const PetscInt *clp;
42751a271a75SMatthew G. Knepley   PetscInt        depth, numFields, numPoints, size;
4276552f7358SJed Brown   PetscErrorCode  ierr;
4277552f7358SJed Brown 
4278d9917b9dSMatthew G. Knepley   PetscFunctionBeginHot;
4279552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4280552f7358SJed Brown   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
42811a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
42821a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
4283552f7358SJed Brown   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
4284552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4285552f7358SJed Brown   if (depth == 1 && numFields < 2) {
42861a271a75SMatthew G. Knepley     ierr = DMPlexVecGetClosure_Depth1_Static(dm, section, v, point, csize, values);CHKERRQ(ierr);
4287552f7358SJed Brown     PetscFunctionReturn(0);
4288552f7358SJed Brown   }
42891a271a75SMatthew G. Knepley   /* Get points */
4290d9917b9dSMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
4291d9917b9dSMatthew G. Knepley   if (!clPoints) {
42921a271a75SMatthew G. Knepley     PetscInt pStart, pEnd, p, q;
4293552f7358SJed Brown 
42941a271a75SMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4295552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4296552f7358SJed Brown     /* Compress out points not in the section */
4297552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
4298552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
4299552f7358SJed Brown         points[q*2]   = points[p];
4300552f7358SJed Brown         points[q*2+1] = points[p+1];
4301552f7358SJed Brown         ++q;
4302552f7358SJed Brown       }
4303552f7358SJed Brown     }
4304552f7358SJed Brown     numPoints = q;
4305d9917b9dSMatthew G. Knepley   } else {
4306d9917b9dSMatthew G. Knepley     PetscInt dof, off;
4307552f7358SJed Brown 
4308d9917b9dSMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
4309d9917b9dSMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
4310d9917b9dSMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
43111a271a75SMatthew G. Knepley     numPoints = dof/2;
4312d9917b9dSMatthew G. Knepley     points    = (PetscInt *) &clp[off];
4313552f7358SJed Brown   }
43141a271a75SMatthew G. Knepley   /* Get array */
4315552f7358SJed Brown   if (!values || !*values) {
43161a271a75SMatthew G. Knepley     PetscInt asize = 0, dof, p;
4317552f7358SJed Brown 
43181a271a75SMatthew G. Knepley     for (p = 0; p < numPoints*2; p += 2) {
4319552f7358SJed Brown       ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
43201a271a75SMatthew G. Knepley       asize += dof;
4321552f7358SJed Brown     }
4322bd6c0d32SMatthew G. Knepley     if (!values) {
4323d9917b9dSMatthew G. Knepley       if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
43241a271a75SMatthew G. Knepley       else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
43251a271a75SMatthew G. Knepley       if (csize) *csize = asize;
4326bd6c0d32SMatthew G. Knepley       PetscFunctionReturn(0);
4327bd6c0d32SMatthew G. Knepley     }
43281a271a75SMatthew G. Knepley     ierr = DMGetWorkArray(dm, asize, PETSC_SCALAR, &array);CHKERRQ(ierr);
4329d0f6b257SMatthew G. Knepley   } else {
4330d0f6b257SMatthew G. Knepley     array = *values;
4331d0f6b257SMatthew G. Knepley   }
4332552f7358SJed Brown   ierr = VecGetArray(v, &vArray);CHKERRQ(ierr);
43331a271a75SMatthew G. Knepley   /* Get values */
4334ef90cfe2SMatthew G. Knepley   if (numFields > 0) {ierr = DMPlexVecGetClosure_Fields_Static(section, numPoints, points, numFields, vArray, &size, array);CHKERRQ(ierr);}
43351a271a75SMatthew G. Knepley   else               {ierr = DMPlexVecGetClosure_Static(section, numPoints, points, vArray, &size, array);CHKERRQ(ierr);}
43361a271a75SMatthew G. Knepley   /* Cleanup points */
43371a271a75SMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
43381a271a75SMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
43391a271a75SMatthew G. Knepley   /* Cleanup array */
4340552f7358SJed Brown   ierr = VecRestoreArray(v, &vArray);CHKERRQ(ierr);
4341d0f6b257SMatthew G. Knepley   if (!*values) {
4342552f7358SJed Brown     if (csize) *csize = size;
4343552f7358SJed Brown     *values = array;
4344d0f6b257SMatthew G. Knepley   } else {
4345d0f6b257SMatthew G. Knepley     if (size > *csize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Size of input array %d < actual size %d", *csize, size);
4346d0f6b257SMatthew G. Knepley     *csize = size;
4347d0f6b257SMatthew G. Knepley   }
4348552f7358SJed Brown   PetscFunctionReturn(0);
4349552f7358SJed Brown }
4350552f7358SJed Brown 
4351552f7358SJed Brown #undef __FUNCT__
4352552f7358SJed Brown #define __FUNCT__ "DMPlexVecRestoreClosure"
4353552f7358SJed Brown /*@C
4354552f7358SJed Brown   DMPlexVecRestoreClosure - Restore the array of the values on the closure of 'point'
4355552f7358SJed Brown 
4356552f7358SJed Brown   Not collective
4357552f7358SJed Brown 
4358552f7358SJed Brown   Input Parameters:
4359552f7358SJed Brown + dm - The DM
43600298fd71SBarry Smith . section - The section describing the layout in v, or NULL to use the default section
4361552f7358SJed Brown . v - The local vector
4362552f7358SJed Brown . point - The sieve point in the DM
43630298fd71SBarry Smith . csize - The number of values in the closure, or NULL
4364552f7358SJed Brown - values - The array of values, which is a borrowed array and should not be freed
4365552f7358SJed Brown 
43663813dfbdSMatthew G Knepley   Fortran Notes:
43673813dfbdSMatthew G Knepley   Since it returns an array, this routine is only available in Fortran 90, and you must
43683813dfbdSMatthew G Knepley   include petsc.h90 in your code.
43693813dfbdSMatthew G Knepley 
43703813dfbdSMatthew G Knepley   The csize argument is not present in the Fortran 90 binding since it is internal to the array.
43713813dfbdSMatthew G Knepley 
4372552f7358SJed Brown   Level: intermediate
4373552f7358SJed Brown 
4374552f7358SJed Brown .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure(), DMPlexMatSetClosure()
4375552f7358SJed Brown @*/
43767c1f9639SMatthew G Knepley PetscErrorCode DMPlexVecRestoreClosure(DM dm, PetscSection section, Vec v, PetscInt point, PetscInt *csize, PetscScalar *values[])
4377a6dfd86eSKarl Rupp {
4378552f7358SJed Brown   PetscInt       size = 0;
4379552f7358SJed Brown   PetscErrorCode ierr;
4380552f7358SJed Brown 
4381552f7358SJed Brown   PetscFunctionBegin;
4382552f7358SJed Brown   /* Should work without recalculating size */
4383552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, size, PETSC_SCALAR, (void*) values);CHKERRQ(ierr);
4384552f7358SJed Brown   PetscFunctionReturn(0);
4385552f7358SJed Brown }
4386552f7358SJed Brown 
4387552f7358SJed Brown PETSC_STATIC_INLINE void add   (PetscScalar *x, PetscScalar y) {*x += y;}
4388552f7358SJed Brown PETSC_STATIC_INLINE void insert(PetscScalar *x, PetscScalar y) {*x  = y;}
4389552f7358SJed Brown 
4390552f7358SJed Brown #undef __FUNCT__
4391552f7358SJed Brown #define __FUNCT__ "updatePoint_private"
43921a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePoint_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, PetscInt orientation, const PetscScalar values[], PetscScalar array[])
4393552f7358SJed Brown {
4394552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
4395552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
4396552f7358SJed Brown   PetscScalar    *a;
4397552f7358SJed Brown   PetscInt        off, cind = 0, k;
4398552f7358SJed Brown   PetscErrorCode  ierr;
4399552f7358SJed Brown 
4400552f7358SJed Brown   PetscFunctionBegin;
4401552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
4402552f7358SJed Brown   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
4403552f7358SJed Brown   a    = &array[off];
4404552f7358SJed Brown   if (!cdof || setBC) {
4405552f7358SJed Brown     if (orientation >= 0) {
4406552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4407552f7358SJed Brown         fuse(&a[k], values[k]);
4408552f7358SJed Brown       }
4409552f7358SJed Brown     } else {
4410552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4411552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
4412552f7358SJed Brown       }
4413552f7358SJed Brown     }
4414552f7358SJed Brown   } else {
4415552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
4416552f7358SJed Brown     if (orientation >= 0) {
4417552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4418552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
4419552f7358SJed Brown         fuse(&a[k], values[k]);
4420552f7358SJed Brown       }
4421552f7358SJed Brown     } else {
4422552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4423552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
4424552f7358SJed Brown         fuse(&a[k], values[dof-k-1]);
4425552f7358SJed Brown       }
4426552f7358SJed Brown     }
4427552f7358SJed Brown   }
4428552f7358SJed Brown   PetscFunctionReturn(0);
4429552f7358SJed Brown }
4430552f7358SJed Brown 
4431552f7358SJed Brown #undef __FUNCT__
4432a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointBC_private"
44331a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointBC_private(PetscSection section, PetscInt point, PetscInt dof, void (*fuse)(PetscScalar*, PetscScalar), PetscInt orientation, const PetscScalar values[], PetscScalar array[])
4434a5e93ea8SMatthew G. Knepley {
4435a5e93ea8SMatthew G. Knepley   PetscInt        cdof;   /* The number of constraints on this point */
4436a5e93ea8SMatthew G. Knepley   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
4437a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
4438a5e93ea8SMatthew G. Knepley   PetscInt        off, cind = 0, k;
4439a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
4440a5e93ea8SMatthew G. Knepley 
4441a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
4442a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
4443a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetOffset(section, point, &off);CHKERRQ(ierr);
4444a5e93ea8SMatthew G. Knepley   a    = &array[off];
4445a5e93ea8SMatthew G. Knepley   if (cdof) {
4446a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
4447a5e93ea8SMatthew G. Knepley     if (orientation >= 0) {
4448a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
4449a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
4450a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[k]);
4451a5e93ea8SMatthew G. Knepley           ++cind;
4452a5e93ea8SMatthew G. Knepley         }
4453a5e93ea8SMatthew G. Knepley       }
4454a5e93ea8SMatthew G. Knepley     } else {
4455a5e93ea8SMatthew G. Knepley       for (k = 0; k < dof; ++k) {
4456a5e93ea8SMatthew G. Knepley         if ((cind < cdof) && (k == cdofs[cind])) {
4457a5e93ea8SMatthew G. Knepley           fuse(&a[k], values[dof-k-1]);
4458a5e93ea8SMatthew G. Knepley           ++cind;
4459a5e93ea8SMatthew G. Knepley         }
4460a5e93ea8SMatthew G. Knepley       }
4461a5e93ea8SMatthew G. Knepley     }
4462a5e93ea8SMatthew G. Knepley   }
4463a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
4464a5e93ea8SMatthew G. Knepley }
4465a5e93ea8SMatthew G. Knepley 
4466a5e93ea8SMatthew G. Knepley #undef __FUNCT__
4467552f7358SJed Brown #define __FUNCT__ "updatePointFields_private"
44681a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFields_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), PetscBool setBC, const PetscScalar values[], PetscInt *offset, PetscScalar array[])
4469a6dfd86eSKarl Rupp {
4470552f7358SJed Brown   PetscScalar    *a;
44711a271a75SMatthew G. Knepley   PetscInt        fdof, foff, fcdof, foffset = *offset;
44721a271a75SMatthew G. Knepley   const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
44731a271a75SMatthew G. Knepley   PetscInt        cind = 0, k, c;
4474552f7358SJed Brown   PetscErrorCode  ierr;
4475552f7358SJed Brown 
4476552f7358SJed Brown   PetscFunctionBegin;
4477552f7358SJed Brown   ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
4478552f7358SJed Brown   ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
44791a271a75SMatthew G. Knepley   ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
44801a271a75SMatthew G. Knepley   a    = &array[foff];
4481552f7358SJed Brown   if (!fcdof || setBC) {
44821a271a75SMatthew G. Knepley     if (o >= 0) {
44831a271a75SMatthew G. Knepley       for (k = 0; k < fdof; ++k) fuse(&a[k], values[foffset+k]);
4484552f7358SJed Brown     } else {
4485552f7358SJed Brown       for (k = fdof/fcomp-1; k >= 0; --k) {
4486552f7358SJed Brown         for (c = 0; c < fcomp; ++c) {
44871a271a75SMatthew G. Knepley           fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
4488552f7358SJed Brown         }
4489552f7358SJed Brown       }
4490552f7358SJed Brown     }
4491552f7358SJed Brown   } else {
4492552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
44931a271a75SMatthew G. Knepley     if (o >= 0) {
4494552f7358SJed Brown       for (k = 0; k < fdof; ++k) {
4495552f7358SJed Brown         if ((cind < fcdof) && (k == fcdofs[cind])) {++cind; continue;}
44961a271a75SMatthew G. Knepley         fuse(&a[k], values[foffset+k]);
4497552f7358SJed Brown       }
4498552f7358SJed Brown     } else {
4499552f7358SJed Brown       for (k = fdof/fcomp-1; k >= 0; --k) {
4500552f7358SJed Brown         for (c = 0; c < fcomp; ++c) {
4501552f7358SJed Brown           if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {++cind; continue;}
45021a271a75SMatthew G. Knepley           fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
4503552f7358SJed Brown         }
4504552f7358SJed Brown       }
4505552f7358SJed Brown     }
4506552f7358SJed Brown   }
45071a271a75SMatthew G. Knepley   *offset += fdof;
4508552f7358SJed Brown   PetscFunctionReturn(0);
4509552f7358SJed Brown }
4510552f7358SJed Brown 
4511552f7358SJed Brown #undef __FUNCT__
4512a5e93ea8SMatthew G. Knepley #define __FUNCT__ "updatePointFieldsBC_private"
45131a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode updatePointFieldsBC_private(PetscSection section, PetscInt point, PetscInt o, PetscInt f, PetscInt fcomp, void (*fuse)(PetscScalar*, PetscScalar), const PetscScalar values[], PetscInt *offset, PetscScalar array[])
4514a5e93ea8SMatthew G. Knepley {
4515a5e93ea8SMatthew G. Knepley   PetscScalar    *a;
45161a271a75SMatthew G. Knepley   PetscInt        fdof, foff, fcdof, foffset = *offset;
45171a271a75SMatthew G. Knepley   const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
45181a271a75SMatthew G. Knepley   PetscInt        cind = 0, k, c;
4519a5e93ea8SMatthew G. Knepley   PetscErrorCode  ierr;
4520a5e93ea8SMatthew G. Knepley 
4521a5e93ea8SMatthew G. Knepley   PetscFunctionBegin;
4522a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
4523a5e93ea8SMatthew G. Knepley   ierr = PetscSectionGetFieldConstraintDof(section, point, f, &fcdof);CHKERRQ(ierr);
45241a271a75SMatthew G. Knepley   ierr = PetscSectionGetFieldOffset(section, point, f, &foff);CHKERRQ(ierr);
45251a271a75SMatthew G. Knepley   a    = &array[foff];
4526a5e93ea8SMatthew G. Knepley   if (fcdof) {
4527a5e93ea8SMatthew G. Knepley     ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
45281a271a75SMatthew G. Knepley     if (o >= 0) {
4529a5e93ea8SMatthew G. Knepley       for (k = 0; k < fdof; ++k) {
4530a5e93ea8SMatthew G. Knepley         if ((cind < fcdof) && (k == fcdofs[cind])) {
45311a271a75SMatthew G. Knepley           fuse(&a[k], values[foffset+k]);
4532a5e93ea8SMatthew G. Knepley           ++cind;
4533a5e93ea8SMatthew G. Knepley         }
4534a5e93ea8SMatthew G. Knepley       }
4535a5e93ea8SMatthew G. Knepley     } else {
4536a5e93ea8SMatthew G. Knepley       for (k = fdof/fcomp-1; k >= 0; --k) {
4537a5e93ea8SMatthew G. Knepley         for (c = 0; c < fcomp; ++c) {
4538a5e93ea8SMatthew G. Knepley           if ((cind < fcdof) && (k*fcomp+c == fcdofs[cind])) {
45391a271a75SMatthew G. Knepley             fuse(&a[(fdof/fcomp-1-k)*fcomp+c], values[foffset+k*fcomp+c]);
4540a5e93ea8SMatthew G. Knepley             ++cind;
4541a5e93ea8SMatthew G. Knepley           }
4542a5e93ea8SMatthew G. Knepley         }
4543a5e93ea8SMatthew G. Knepley       }
4544a5e93ea8SMatthew G. Knepley     }
4545a5e93ea8SMatthew G. Knepley   }
45461a271a75SMatthew G. Knepley   *offset += fdof;
4547a5e93ea8SMatthew G. Knepley   PetscFunctionReturn(0);
4548a5e93ea8SMatthew G. Knepley }
4549a5e93ea8SMatthew G. Knepley 
4550a5e93ea8SMatthew G. Knepley #undef __FUNCT__
45511b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure_Static"
45521a271a75SMatthew G. Knepley PETSC_STATIC_INLINE PetscErrorCode DMPlexVecSetClosure_Static(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
4553a6dfd86eSKarl Rupp {
4554552f7358SJed Brown   PetscScalar    *array;
45551b406b76SMatthew G. Knepley   const PetscInt *cone, *coneO;
45561b406b76SMatthew G. Knepley   PetscInt        pStart, pEnd, p, numPoints, off, dof;
4557552f7358SJed Brown   PetscErrorCode  ierr;
4558552f7358SJed Brown 
45591b406b76SMatthew G. Knepley   PetscFunctionBeginHot;
4560b6ebb6e6SMatthew G. Knepley   ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4561b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, point, &numPoints);CHKERRQ(ierr);
4562b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
4563b6ebb6e6SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, point, &coneO);CHKERRQ(ierr);
4564b6ebb6e6SMatthew G. Knepley   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
4565b6ebb6e6SMatthew G. Knepley   for (p = 0, off = 0; p <= numPoints; ++p, off += dof) {
4566b6ebb6e6SMatthew G. Knepley     const PetscInt cp = !p ? point : cone[p-1];
4567b6ebb6e6SMatthew G. Knepley     const PetscInt o  = !p ? 0     : coneO[p-1];
4568b6ebb6e6SMatthew G. Knepley 
4569b6ebb6e6SMatthew G. Knepley     if ((cp < pStart) || (cp >= pEnd)) {dof = 0; continue;}
4570b6ebb6e6SMatthew G. Knepley     ierr = PetscSectionGetDof(section, cp, &dof);CHKERRQ(ierr);
4571b6ebb6e6SMatthew G. Knepley     /* ADD_VALUES */
4572b6ebb6e6SMatthew G. Knepley     {
4573b6ebb6e6SMatthew G. Knepley       const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
4574b6ebb6e6SMatthew G. Knepley       PetscScalar    *a;
4575b6ebb6e6SMatthew G. Knepley       PetscInt        cdof, coff, cind = 0, k;
4576b6ebb6e6SMatthew G. Knepley 
4577b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetConstraintDof(section, cp, &cdof);CHKERRQ(ierr);
4578b6ebb6e6SMatthew G. Knepley       ierr = PetscSectionGetOffset(section, cp, &coff);CHKERRQ(ierr);
4579b6ebb6e6SMatthew G. Knepley       a    = &array[coff];
4580b6ebb6e6SMatthew G. Knepley       if (!cdof) {
4581b6ebb6e6SMatthew G. Knepley         if (o >= 0) {
4582b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
4583b6ebb6e6SMatthew G. Knepley             a[k] += values[off+k];
4584b6ebb6e6SMatthew G. Knepley           }
4585b6ebb6e6SMatthew G. Knepley         } else {
4586b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
4587b6ebb6e6SMatthew G. Knepley             a[k] += values[off+dof-k-1];
4588b6ebb6e6SMatthew G. Knepley           }
4589b6ebb6e6SMatthew G. Knepley         }
4590b6ebb6e6SMatthew G. Knepley       } else {
4591b6ebb6e6SMatthew G. Knepley         ierr = PetscSectionGetConstraintIndices(section, cp, &cdofs);CHKERRQ(ierr);
4592b6ebb6e6SMatthew G. Knepley         if (o >= 0) {
4593b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
4594b6ebb6e6SMatthew G. Knepley             if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
4595b6ebb6e6SMatthew G. Knepley             a[k] += values[off+k];
4596b6ebb6e6SMatthew G. Knepley           }
4597b6ebb6e6SMatthew G. Knepley         } else {
4598b6ebb6e6SMatthew G. Knepley           for (k = 0; k < dof; ++k) {
4599b6ebb6e6SMatthew G. Knepley             if ((cind < cdof) && (k == cdofs[cind])) {++cind; continue;}
4600b6ebb6e6SMatthew G. Knepley             a[k] += values[off+dof-k-1];
4601b6ebb6e6SMatthew G. Knepley           }
4602b6ebb6e6SMatthew G. Knepley         }
4603b6ebb6e6SMatthew G. Knepley       }
4604b6ebb6e6SMatthew G. Knepley     }
4605b6ebb6e6SMatthew G. Knepley   }
4606b6ebb6e6SMatthew G. Knepley   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
4607b6ebb6e6SMatthew G. Knepley   PetscFunctionReturn(0);
4608b6ebb6e6SMatthew G. Knepley }
46091b406b76SMatthew G. Knepley 
46101b406b76SMatthew G. Knepley #undef __FUNCT__
46111b406b76SMatthew G. Knepley #define __FUNCT__ "DMPlexVecSetClosure"
46121b406b76SMatthew G. Knepley /*@C
46131b406b76SMatthew G. Knepley   DMPlexVecSetClosure - Set an array of the values on the closure of 'point'
46141b406b76SMatthew G. Knepley 
46151b406b76SMatthew G. Knepley   Not collective
46161b406b76SMatthew G. Knepley 
46171b406b76SMatthew G. Knepley   Input Parameters:
46181b406b76SMatthew G. Knepley + dm - The DM
46191b406b76SMatthew G. Knepley . section - The section describing the layout in v, or NULL to use the default section
46201b406b76SMatthew G. Knepley . v - The local vector
46211b406b76SMatthew G. Knepley . point - The sieve point in the DM
46221b406b76SMatthew G. Knepley . values - The array of values
46231b406b76SMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
46241b406b76SMatthew G. Knepley 
46251b406b76SMatthew G. Knepley   Fortran Notes:
46261b406b76SMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
46271b406b76SMatthew G. Knepley 
46281b406b76SMatthew G. Knepley   Level: intermediate
46291b406b76SMatthew G. Knepley 
46301b406b76SMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexMatSetClosure()
46311b406b76SMatthew G. Knepley @*/
46321b406b76SMatthew G. Knepley PetscErrorCode DMPlexVecSetClosure(DM dm, PetscSection section, Vec v, PetscInt point, const PetscScalar values[], InsertMode mode)
46331b406b76SMatthew G. Knepley {
46341b406b76SMatthew G. Knepley   PetscSection    clSection;
46351b406b76SMatthew G. Knepley   IS              clPoints;
46361b406b76SMatthew G. Knepley   PetscScalar    *array;
46371b406b76SMatthew G. Knepley   PetscInt       *points = NULL;
46381b406b76SMatthew G. Knepley   const PetscInt *clp;
46391a271a75SMatthew G. Knepley   PetscInt        depth, numFields, numPoints, p;
46401b406b76SMatthew G. Knepley   PetscErrorCode  ierr;
46411b406b76SMatthew G. Knepley 
46421a271a75SMatthew G. Knepley   PetscFunctionBeginHot;
46431b406b76SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
46441b406b76SMatthew G. Knepley   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
46451a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
46461a271a75SMatthew G. Knepley   PetscValidHeaderSpecific(v, VEC_CLASSID, 3);
46471b406b76SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
46481b406b76SMatthew G. Knepley   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
46491b406b76SMatthew G. Knepley   if (depth == 1 && numFields < 2 && mode == ADD_VALUES) {
46501a271a75SMatthew G. Knepley     ierr = DMPlexVecSetClosure_Static(dm, section, v, point, values, mode);CHKERRQ(ierr);
46511b406b76SMatthew G. Knepley     PetscFunctionReturn(0);
46521b406b76SMatthew G. Knepley   }
46531a271a75SMatthew G. Knepley   /* Get points */
46541b406b76SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
46551b406b76SMatthew G. Knepley   if (!clPoints) {
46561a271a75SMatthew G. Knepley     PetscInt pStart, pEnd, q;
46571a271a75SMatthew G. Knepley 
46581a271a75SMatthew G. Knepley     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4659552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4660552f7358SJed Brown     /* Compress out points not in the section */
4661552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
4662552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
4663552f7358SJed Brown         points[q*2]   = points[p];
4664552f7358SJed Brown         points[q*2+1] = points[p+1];
4665552f7358SJed Brown         ++q;
4666552f7358SJed Brown       }
4667552f7358SJed Brown     }
4668552f7358SJed Brown     numPoints = q;
46691b406b76SMatthew G. Knepley   } else {
46701b406b76SMatthew G. Knepley     PetscInt dof, off;
4671552f7358SJed Brown 
46721b406b76SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
46731b406b76SMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
46741b406b76SMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
46751a271a75SMatthew G. Knepley     numPoints = dof/2;
46761b406b76SMatthew G. Knepley     points    = (PetscInt *) &clp[off];
4677552f7358SJed Brown   }
46781a271a75SMatthew G. Knepley   /* Get array */
4679552f7358SJed Brown   ierr = VecGetArray(v, &array);CHKERRQ(ierr);
46801a271a75SMatthew G. Knepley   /* Get values */
4681ef90cfe2SMatthew G. Knepley   if (numFields > 0) {
46821a271a75SMatthew G. Knepley     PetscInt offset = 0, fcomp, f;
4683552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
46841a271a75SMatthew G. Knepley       ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
4685552f7358SJed Brown       switch (mode) {
4686552f7358SJed Brown       case INSERT_VALUES:
4687552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
46881a271a75SMatthew G. Knepley           const PetscInt point = points[p];
46891a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
46901a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_FALSE, values, &offset, array);
4691552f7358SJed Brown         } break;
4692552f7358SJed Brown       case INSERT_ALL_VALUES:
4693552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
46941a271a75SMatthew G. Knepley           const PetscInt point = points[p];
46951a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
46961a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, insert, PETSC_TRUE, values, &offset, array);
4697552f7358SJed Brown         } break;
4698a5e93ea8SMatthew G. Knepley       case INSERT_BC_VALUES:
4699a5e93ea8SMatthew G. Knepley         for (p = 0; p < numPoints*2; p += 2) {
47001a271a75SMatthew G. Knepley           const PetscInt point = points[p];
47011a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
47021a271a75SMatthew G. Knepley           updatePointFieldsBC_private(section, point, o, f, fcomp, insert, values, &offset, array);
4703a5e93ea8SMatthew G. Knepley         } break;
4704552f7358SJed Brown       case ADD_VALUES:
4705552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
47061a271a75SMatthew G. Knepley           const PetscInt point = points[p];
47071a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
47081a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, add, PETSC_FALSE, values, &offset, array);
4709552f7358SJed Brown         } break;
4710552f7358SJed Brown       case ADD_ALL_VALUES:
4711552f7358SJed Brown         for (p = 0; p < numPoints*2; p += 2) {
47121a271a75SMatthew G. Knepley           const PetscInt point = points[p];
47131a271a75SMatthew G. Knepley           const PetscInt o     = points[p+1];
47141a271a75SMatthew G. Knepley           updatePointFields_private(section, point, o, f, fcomp, add, PETSC_TRUE, values, &offset, array);
4715552f7358SJed Brown         } break;
4716552f7358SJed Brown       default:
471782f516ccSBarry Smith         SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
4718552f7358SJed Brown       }
47191a271a75SMatthew G. Knepley     }
4720552f7358SJed Brown   } else {
47211a271a75SMatthew G. Knepley     PetscInt dof, off;
47221a271a75SMatthew G. Knepley 
4723552f7358SJed Brown     switch (mode) {
4724552f7358SJed Brown     case INSERT_VALUES:
4725552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
4726552f7358SJed Brown         PetscInt o = points[p+1];
4727552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4728552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_FALSE, o, &values[off], array);
4729552f7358SJed Brown       } break;
4730552f7358SJed Brown     case INSERT_ALL_VALUES:
4731552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
4732552f7358SJed Brown         PetscInt o = points[p+1];
4733552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4734552f7358SJed Brown         updatePoint_private(section, points[p], dof, insert, PETSC_TRUE,  o, &values[off], array);
4735552f7358SJed Brown       } break;
4736a5e93ea8SMatthew G. Knepley     case INSERT_BC_VALUES:
4737a5e93ea8SMatthew G. Knepley       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
4738a5e93ea8SMatthew G. Knepley         PetscInt o = points[p+1];
4739a5e93ea8SMatthew G. Knepley         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4740a5e93ea8SMatthew G. Knepley         updatePointBC_private(section, points[p], dof, insert,  o, &values[off], array);
4741a5e93ea8SMatthew G. Knepley       } break;
4742552f7358SJed Brown     case ADD_VALUES:
4743552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
4744552f7358SJed Brown         PetscInt o = points[p+1];
4745552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4746552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_FALSE, o, &values[off], array);
4747552f7358SJed Brown       } break;
4748552f7358SJed Brown     case ADD_ALL_VALUES:
4749552f7358SJed Brown       for (p = 0, off = 0; p < numPoints*2; p += 2, off += dof) {
4750552f7358SJed Brown         PetscInt o = points[p+1];
4751552f7358SJed Brown         ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4752552f7358SJed Brown         updatePoint_private(section, points[p], dof, add,    PETSC_TRUE,  o, &values[off], array);
4753552f7358SJed Brown       } break;
4754552f7358SJed Brown     default:
475582f516ccSBarry Smith       SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Invalid insert mode %D", mode);
4756552f7358SJed Brown     }
4757552f7358SJed Brown   }
47581a271a75SMatthew G. Knepley   /* Cleanup points */
47591a271a75SMatthew G. Knepley   if (!clPoints) {ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);}
47601a271a75SMatthew G. Knepley   else           {ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);}
47611a271a75SMatthew G. Knepley   /* Cleanup array */
4762552f7358SJed Brown   ierr = VecRestoreArray(v, &array);CHKERRQ(ierr);
4763552f7358SJed Brown   PetscFunctionReturn(0);
4764552f7358SJed Brown }
4765552f7358SJed Brown 
4766552f7358SJed Brown #undef __FUNCT__
4767552f7358SJed Brown #define __FUNCT__ "DMPlexPrintMatSetValues"
4768b0ecff45SMatthew G. Knepley PetscErrorCode DMPlexPrintMatSetValues(PetscViewer viewer, Mat A, PetscInt point, PetscInt numRIndices, const PetscInt rindices[], PetscInt numCIndices, const PetscInt cindices[], const PetscScalar values[])
4769552f7358SJed Brown {
4770552f7358SJed Brown   PetscMPIInt    rank;
4771552f7358SJed Brown   PetscInt       i, j;
4772552f7358SJed Brown   PetscErrorCode ierr;
4773552f7358SJed Brown 
4774552f7358SJed Brown   PetscFunctionBegin;
477582f516ccSBarry Smith   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr);
477677a6746dSMatthew G Knepley   ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat for sieve point %D\n", rank, point);CHKERRQ(ierr);
4777b0ecff45SMatthew G. Knepley   for (i = 0; i < numRIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat row indices[%D] = %D\n", rank, i, rindices[i]);CHKERRQ(ierr);}
4778b0ecff45SMatthew G. Knepley   for (i = 0; i < numCIndices; i++) {ierr = PetscViewerASCIIPrintf(viewer, "[%D]mat col indices[%D] = %D\n", rank, i, cindices[i]);CHKERRQ(ierr);}
4779b0ecff45SMatthew G. Knepley   numCIndices = numCIndices ? numCIndices : numRIndices;
4780b0ecff45SMatthew G. Knepley   for (i = 0; i < numRIndices; i++) {
478177a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "[%D]", rank);CHKERRQ(ierr);
4782b0ecff45SMatthew G. Knepley     for (j = 0; j < numCIndices; j++) {
4783519f805aSKarl Rupp #if defined(PETSC_USE_COMPLEX)
47847eba1a17SMatthew G. Knepley       ierr = PetscViewerASCIIPrintf(viewer, " (%g,%g)", (double)PetscRealPart(values[i*numCIndices+j]), (double)PetscImaginaryPart(values[i*numCIndices+j]));CHKERRQ(ierr);
4785552f7358SJed Brown #else
4786b0ecff45SMatthew G. Knepley       ierr = PetscViewerASCIIPrintf(viewer, " %g", (double)values[i*numCIndices+j]);CHKERRQ(ierr);
4787552f7358SJed Brown #endif
4788552f7358SJed Brown     }
478977a6746dSMatthew G Knepley     ierr = PetscViewerASCIIPrintf(viewer, "\n");CHKERRQ(ierr);
4790552f7358SJed Brown   }
4791552f7358SJed Brown   PetscFunctionReturn(0);
4792552f7358SJed Brown }
4793552f7358SJed Brown 
4794552f7358SJed Brown #undef __FUNCT__
4795552f7358SJed Brown #define __FUNCT__ "indicesPoint_private"
4796552f7358SJed Brown /* . off - The global offset of this point */
4797e6ccafaeSMatthew G Knepley PetscErrorCode indicesPoint_private(PetscSection section, PetscInt point, PetscInt off, PetscInt *loff, PetscBool setBC, PetscInt orientation, PetscInt indices[])
4798a6dfd86eSKarl Rupp {
4799e6ccafaeSMatthew G Knepley   PetscInt        dof;    /* The number of unknowns on this point */
4800552f7358SJed Brown   PetscInt        cdof;   /* The number of constraints on this point */
4801552f7358SJed Brown   const PetscInt *cdofs; /* The indices of the constrained dofs on this point */
4802552f7358SJed Brown   PetscInt        cind = 0, k;
4803552f7358SJed Brown   PetscErrorCode  ierr;
4804552f7358SJed Brown 
4805552f7358SJed Brown   PetscFunctionBegin;
4806552f7358SJed Brown   ierr = PetscSectionGetDof(section, point, &dof);CHKERRQ(ierr);
4807552f7358SJed Brown   ierr = PetscSectionGetConstraintDof(section, point, &cdof);CHKERRQ(ierr);
4808552f7358SJed Brown   if (!cdof || setBC) {
4809552f7358SJed Brown     if (orientation >= 0) {
4810e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+k] = off+k;
4811552f7358SJed Brown     } else {
4812e6ccafaeSMatthew G Knepley       for (k = 0; k < dof; ++k) indices[*loff+dof-k-1] = off+k;
4813552f7358SJed Brown     }
4814552f7358SJed Brown   } else {
4815552f7358SJed Brown     ierr = PetscSectionGetConstraintIndices(section, point, &cdofs);CHKERRQ(ierr);
4816552f7358SJed Brown     if (orientation >= 0) {
4817552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4818552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
4819552f7358SJed Brown           /* Insert check for returning constrained indices */
4820e6ccafaeSMatthew G Knepley           indices[*loff+k] = -(off+k+1);
4821552f7358SJed Brown           ++cind;
4822552f7358SJed Brown         } else {
4823e6ccafaeSMatthew G Knepley           indices[*loff+k] = off+k-cind;
4824552f7358SJed Brown         }
4825552f7358SJed Brown       }
4826552f7358SJed Brown     } else {
4827552f7358SJed Brown       for (k = 0; k < dof; ++k) {
4828552f7358SJed Brown         if ((cind < cdof) && (k == cdofs[cind])) {
4829552f7358SJed Brown           /* Insert check for returning constrained indices */
4830e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = -(off+k+1);
4831552f7358SJed Brown           ++cind;
4832552f7358SJed Brown         } else {
4833e6ccafaeSMatthew G Knepley           indices[*loff+dof-k-1] = off+k-cind;
4834552f7358SJed Brown         }
4835552f7358SJed Brown       }
4836552f7358SJed Brown     }
4837552f7358SJed Brown   }
4838e6ccafaeSMatthew G Knepley   *loff += dof;
4839552f7358SJed Brown   PetscFunctionReturn(0);
4840552f7358SJed Brown }
4841552f7358SJed Brown 
4842552f7358SJed Brown #undef __FUNCT__
4843552f7358SJed Brown #define __FUNCT__ "indicesPointFields_private"
4844552f7358SJed Brown /* . off - The global offset of this point */
4845a6dfd86eSKarl Rupp PetscErrorCode indicesPointFields_private(PetscSection section, PetscInt point, PetscInt off, PetscInt foffs[], PetscBool setBC, PetscInt orientation, PetscInt indices[])
4846a6dfd86eSKarl Rupp {
4847552f7358SJed Brown   PetscInt       numFields, foff, f;
4848552f7358SJed Brown   PetscErrorCode ierr;
4849552f7358SJed Brown 
4850552f7358SJed Brown   PetscFunctionBegin;
4851552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
4852552f7358SJed Brown   for (f = 0, foff = 0; f < numFields; ++f) {
4853552f7358SJed Brown     PetscInt        fdof, fcomp, cfdof;
4854552f7358SJed Brown     const PetscInt *fcdofs; /* The indices of the constrained dofs for field f on this point */
4855552f7358SJed Brown     PetscInt        cind = 0, k, c;
4856552f7358SJed Brown 
4857552f7358SJed Brown     ierr = PetscSectionGetFieldComponents(section, f, &fcomp);CHKERRQ(ierr);
4858552f7358SJed Brown     ierr = PetscSectionGetFieldDof(section, point, f, &fdof);CHKERRQ(ierr);
4859552f7358SJed Brown     ierr = PetscSectionGetFieldConstraintDof(section, point, f, &cfdof);CHKERRQ(ierr);
4860552f7358SJed Brown     if (!cfdof || setBC) {
4861552f7358SJed Brown       if (orientation >= 0) {
48620d644c17SKarl Rupp         for (k = 0; k < fdof; ++k) indices[foffs[f]+k] = off+foff+k;
4863552f7358SJed Brown       } else {
4864552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
4865552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
4866552f7358SJed Brown             indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c;
4867552f7358SJed Brown           }
4868552f7358SJed Brown         }
4869552f7358SJed Brown       }
4870552f7358SJed Brown     } else {
4871552f7358SJed Brown       ierr = PetscSectionGetFieldConstraintIndices(section, point, f, &fcdofs);CHKERRQ(ierr);
4872552f7358SJed Brown       if (orientation >= 0) {
4873552f7358SJed Brown         for (k = 0; k < fdof; ++k) {
4874552f7358SJed Brown           if ((cind < cfdof) && (k == fcdofs[cind])) {
4875552f7358SJed Brown             indices[foffs[f]+k] = -(off+foff+k+1);
4876552f7358SJed Brown             ++cind;
4877552f7358SJed Brown           } else {
4878552f7358SJed Brown             indices[foffs[f]+k] = off+foff+k-cind;
4879552f7358SJed Brown           }
4880552f7358SJed Brown         }
4881552f7358SJed Brown       } else {
4882552f7358SJed Brown         for (k = fdof/fcomp-1; k >= 0; --k) {
4883552f7358SJed Brown           for (c = 0; c < fcomp; ++c) {
4884552f7358SJed Brown             if ((cind < cfdof) && ((fdof/fcomp-1-k)*fcomp+c == fcdofs[cind])) {
4885552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = -(off+foff+(fdof/fcomp-1-k)*fcomp+c+1);
4886552f7358SJed Brown               ++cind;
4887552f7358SJed Brown             } else {
4888552f7358SJed Brown               indices[foffs[f]+k*fcomp+c] = off+foff+(fdof/fcomp-1-k)*fcomp+c-cind;
4889552f7358SJed Brown             }
4890552f7358SJed Brown           }
4891552f7358SJed Brown         }
4892552f7358SJed Brown       }
4893552f7358SJed Brown     }
4894552f7358SJed Brown     foff     += fdof - cfdof;
4895552f7358SJed Brown     foffs[f] += fdof;
4896552f7358SJed Brown   }
4897552f7358SJed Brown   PetscFunctionReturn(0);
4898552f7358SJed Brown }
4899552f7358SJed Brown 
4900552f7358SJed Brown #undef __FUNCT__
4901552f7358SJed Brown #define __FUNCT__ "DMPlexMatSetClosure"
49027f5d1fdeSMatthew G. Knepley /*@C
49037f5d1fdeSMatthew G. Knepley   DMPlexMatSetClosure - Set an array of the values on the closure of 'point'
49047f5d1fdeSMatthew G. Knepley 
49057f5d1fdeSMatthew G. Knepley   Not collective
49067f5d1fdeSMatthew G. Knepley 
49077f5d1fdeSMatthew G. Knepley   Input Parameters:
49087f5d1fdeSMatthew G. Knepley + dm - The DM
4909ebd6d717SJed Brown . section - The section describing the layout in v, or NULL to use the default section
4910ebd6d717SJed Brown . globalSection - The section describing the layout in v, or NULL to use the default global section
49117f5d1fdeSMatthew G. Knepley . A - The matrix
49127f5d1fdeSMatthew G. Knepley . point - The sieve point in the DM
49137f5d1fdeSMatthew G. Knepley . values - The array of values
49147f5d1fdeSMatthew G. Knepley - mode - The insert mode, where INSERT_ALL_VALUES and ADD_ALL_VALUES also overwrite boundary conditions
49157f5d1fdeSMatthew G. Knepley 
49167f5d1fdeSMatthew G. Knepley   Fortran Notes:
49177f5d1fdeSMatthew G. Knepley   This routine is only available in Fortran 90, and you must include petsc.h90 in your code.
49187f5d1fdeSMatthew G. Knepley 
49197f5d1fdeSMatthew G. Knepley   Level: intermediate
49207f5d1fdeSMatthew G. Knepley 
49217f5d1fdeSMatthew G. Knepley .seealso DMPlexVecGetClosure(), DMPlexVecSetClosure()
49227f5d1fdeSMatthew G. Knepley @*/
49237c1f9639SMatthew G Knepley PetscErrorCode DMPlexMatSetClosure(DM dm, PetscSection section, PetscSection globalSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
4924552f7358SJed Brown {
4925552f7358SJed Brown   DM_Plex        *mesh   = (DM_Plex*) dm->data;
49261b406b76SMatthew G. Knepley   PetscSection    clSection;
49271b406b76SMatthew G. Knepley   IS              clPoints;
49280298fd71SBarry Smith   PetscInt       *points = NULL;
49291b406b76SMatthew G. Knepley   const PetscInt *clp;
4930552f7358SJed Brown   PetscInt       *indices;
4931552f7358SJed Brown   PetscInt        offsets[32];
4932552f7358SJed Brown   PetscInt        numFields, numPoints, numIndices, dof, off, globalOff, pStart, pEnd, p, q, f;
4933552f7358SJed Brown   PetscErrorCode  ierr;
4934552f7358SJed Brown 
4935552f7358SJed Brown   PetscFunctionBegin;
4936552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
4937ebd6d717SJed Brown   if (!section) {ierr = DMGetDefaultSection(dm, &section);CHKERRQ(ierr);}
49383dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(section, PETSC_SECTION_CLASSID, 2);
4939ebd6d717SJed Brown   if (!globalSection) {ierr = DMGetDefaultGlobalSection(dm, &globalSection);CHKERRQ(ierr);}
49403dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(globalSection, PETSC_SECTION_CLASSID, 3);
49413dc93601SMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 4);
4942552f7358SJed Brown   ierr = PetscSectionGetNumFields(section, &numFields);CHKERRQ(ierr);
494382f516ccSBarry Smith   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
4944552f7358SJed Brown   ierr = PetscMemzero(offsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
49451b406b76SMatthew G. Knepley   ierr = PetscSectionGetClosureIndex(section, (PetscObject) dm, &clSection, &clPoints);CHKERRQ(ierr);
49461b406b76SMatthew G. Knepley   if (!clPoints) {
4947552f7358SJed Brown     ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
4948552f7358SJed Brown     /* Compress out points not in the section */
4949552f7358SJed Brown     ierr = PetscSectionGetChart(section, &pStart, &pEnd);CHKERRQ(ierr);
4950552f7358SJed Brown     for (p = 0, q = 0; p < numPoints*2; p += 2) {
4951552f7358SJed Brown       if ((points[p] >= pStart) && (points[p] < pEnd)) {
4952552f7358SJed Brown         points[q*2]   = points[p];
4953552f7358SJed Brown         points[q*2+1] = points[p+1];
4954552f7358SJed Brown         ++q;
4955552f7358SJed Brown       }
4956552f7358SJed Brown     }
4957552f7358SJed Brown     numPoints = q;
49581b406b76SMatthew G. Knepley   } else {
49591b406b76SMatthew G. Knepley     PetscInt dof, off;
49601b406b76SMatthew G. Knepley 
49611b406b76SMatthew G. Knepley     ierr = PetscSectionGetDof(clSection, point, &dof);CHKERRQ(ierr);
49621b406b76SMatthew G. Knepley     numPoints = dof/2;
49631b406b76SMatthew G. Knepley     ierr = PetscSectionGetOffset(clSection, point, &off);CHKERRQ(ierr);
49641b406b76SMatthew G. Knepley     ierr = ISGetIndices(clPoints, &clp);CHKERRQ(ierr);
49651b406b76SMatthew G. Knepley     points = (PetscInt *) &clp[off];
49661b406b76SMatthew G. Knepley   }
4967552f7358SJed Brown   for (p = 0, numIndices = 0; p < numPoints*2; p += 2) {
4968552f7358SJed Brown     PetscInt fdof;
4969552f7358SJed Brown 
4970552f7358SJed Brown     ierr = PetscSectionGetDof(section, points[p], &dof);CHKERRQ(ierr);
4971552f7358SJed Brown     for (f = 0; f < numFields; ++f) {
4972552f7358SJed Brown       ierr          = PetscSectionGetFieldDof(section, points[p], f, &fdof);CHKERRQ(ierr);
4973552f7358SJed Brown       offsets[f+1] += fdof;
4974552f7358SJed Brown     }
4975552f7358SJed Brown     numIndices += dof;
4976552f7358SJed Brown   }
49770d644c17SKarl Rupp   for (f = 1; f < numFields; ++f) offsets[f+1] += offsets[f];
49780d644c17SKarl Rupp 
497982f516ccSBarry Smith   if (numFields && offsets[numFields] != numIndices) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", offsets[numFields], numIndices);
4980552f7358SJed Brown   ierr = DMGetWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
4981552f7358SJed Brown   if (numFields) {
4982552f7358SJed Brown     for (p = 0; p < numPoints*2; p += 2) {
4983552f7358SJed Brown       PetscInt o = points[p+1];
4984552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
4985552f7358SJed Brown       indicesPointFields_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, offsets, PETSC_FALSE, o, indices);
4986552f7358SJed Brown     }
4987552f7358SJed Brown   } else {
4988e6ccafaeSMatthew G Knepley     for (p = 0, off = 0; p < numPoints*2; p += 2) {
4989552f7358SJed Brown       PetscInt o = points[p+1];
4990552f7358SJed Brown       ierr = PetscSectionGetOffset(globalSection, points[p], &globalOff);CHKERRQ(ierr);
4991e6ccafaeSMatthew G Knepley       indicesPoint_private(section, points[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, indices);
4992552f7358SJed Brown     }
4993552f7358SJed Brown   }
4994b0ecff45SMatthew G. Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr);}
4995552f7358SJed Brown   ierr = MatSetValues(A, numIndices, indices, numIndices, indices, values, mode);
4996552f7358SJed Brown   if (ierr) {
4997552f7358SJed Brown     PetscMPIInt    rank;
4998552f7358SJed Brown     PetscErrorCode ierr2;
4999552f7358SJed Brown 
500082f516ccSBarry Smith     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
500177a6746dSMatthew G Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
5002b0ecff45SMatthew G. Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numIndices, indices, 0, NULL, values);CHKERRQ(ierr2);
50036a415b8fSMatthew G Knepley     ierr2 = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr2);
5004552f7358SJed Brown     CHKERRQ(ierr);
5005552f7358SJed Brown   }
50061b406b76SMatthew G. Knepley   if (!clPoints) {
5007552f7358SJed Brown     ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &numPoints, &points);CHKERRQ(ierr);
50081b406b76SMatthew G. Knepley   } else {
50091b406b76SMatthew G. Knepley     ierr = ISRestoreIndices(clPoints, &clp);CHKERRQ(ierr);
50101b406b76SMatthew G. Knepley   }
5011552f7358SJed Brown   ierr = DMRestoreWorkArray(dm, numIndices, PETSC_INT, &indices);CHKERRQ(ierr);
5012552f7358SJed Brown   PetscFunctionReturn(0);
5013552f7358SJed Brown }
5014552f7358SJed Brown 
5015552f7358SJed Brown #undef __FUNCT__
5016de41b84cSMatthew G. Knepley #define __FUNCT__ "DMPlexMatSetClosureRefined"
5017de41b84cSMatthew G. Knepley PetscErrorCode DMPlexMatSetClosureRefined(DM dmf, PetscSection fsection, PetscSection globalFSection, DM dmc, PetscSection csection, PetscSection globalCSection, Mat A, PetscInt point, const PetscScalar values[], InsertMode mode)
5018de41b84cSMatthew G. Knepley {
5019de41b84cSMatthew G. Knepley   DM_Plex        *mesh   = (DM_Plex*) dmf->data;
5020de41b84cSMatthew G. Knepley   PetscInt       *fpoints = NULL, *ftotpoints = NULL;
5021de41b84cSMatthew G. Knepley   PetscInt       *cpoints = NULL;
5022de41b84cSMatthew G. Knepley   PetscInt       *findices, *cindices;
5023de41b84cSMatthew G. Knepley   PetscInt        foffsets[32], coffsets[32];
5024de41b84cSMatthew G. Knepley   CellRefiner     cellRefiner;
50254ca5e9f5SMatthew G. Knepley   PetscInt        numFields, numSubcells, maxFPoints, numFPoints, numCPoints, numFIndices, numCIndices, dof, off, globalOff, pStart, pEnd, p, q, r, s, f;
5026de41b84cSMatthew G. Knepley   PetscErrorCode  ierr;
5027de41b84cSMatthew G. Knepley 
5028de41b84cSMatthew G. Knepley   PetscFunctionBegin;
5029de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(dmf, DM_CLASSID, 1);
5030de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(dmc, DM_CLASSID, 4);
5031de41b84cSMatthew G. Knepley   if (!fsection) {ierr = DMGetDefaultSection(dmf, &fsection);CHKERRQ(ierr);}
5032de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(fsection, PETSC_SECTION_CLASSID, 2);
5033de41b84cSMatthew G. Knepley   if (!csection) {ierr = DMGetDefaultSection(dmc, &csection);CHKERRQ(ierr);}
5034de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(csection, PETSC_SECTION_CLASSID, 5);
5035de41b84cSMatthew G. Knepley   if (!globalFSection) {ierr = DMGetDefaultGlobalSection(dmf, &globalFSection);CHKERRQ(ierr);}
5036de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(globalFSection, PETSC_SECTION_CLASSID, 3);
5037de41b84cSMatthew G. Knepley   if (!globalCSection) {ierr = DMGetDefaultGlobalSection(dmc, &globalCSection);CHKERRQ(ierr);}
5038de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(globalCSection, PETSC_SECTION_CLASSID, 6);
5039de41b84cSMatthew G. Knepley   PetscValidHeaderSpecific(A, MAT_CLASSID, 7);
5040de41b84cSMatthew G. Knepley   ierr = PetscSectionGetNumFields(fsection, &numFields);CHKERRQ(ierr);
5041de41b84cSMatthew G. Knepley   if (numFields > 31) SETERRQ1(PetscObjectComm((PetscObject)dmf), PETSC_ERR_ARG_OUTOFRANGE, "Number of fields %D limited to 31", numFields);
5042de41b84cSMatthew G. Knepley   ierr = PetscMemzero(foffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5043de41b84cSMatthew G. Knepley   ierr = PetscMemzero(coffsets, 32 * sizeof(PetscInt));CHKERRQ(ierr);
5044de41b84cSMatthew G. Knepley   /* Column indices */
5045de41b84cSMatthew G. Knepley   ierr = DMPlexGetTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
50464ca5e9f5SMatthew G. Knepley   maxFPoints = numCPoints;
5047de41b84cSMatthew G. Knepley   /* Compress out points not in the section */
5048de41b84cSMatthew G. Knepley   /*   TODO: Squeeze out points with 0 dof as well */
5049de41b84cSMatthew G. Knepley   ierr = PetscSectionGetChart(csection, &pStart, &pEnd);CHKERRQ(ierr);
5050de41b84cSMatthew G. Knepley   for (p = 0, q = 0; p < numCPoints*2; p += 2) {
5051de41b84cSMatthew G. Knepley     if ((cpoints[p] >= pStart) && (cpoints[p] < pEnd)) {
5052de41b84cSMatthew G. Knepley       cpoints[q*2]   = cpoints[p];
5053de41b84cSMatthew G. Knepley       cpoints[q*2+1] = cpoints[p+1];
5054de41b84cSMatthew G. Knepley       ++q;
5055de41b84cSMatthew G. Knepley     }
5056de41b84cSMatthew G. Knepley   }
5057de41b84cSMatthew G. Knepley   numCPoints = q;
5058de41b84cSMatthew G. Knepley   for (p = 0, numCIndices = 0; p < numCPoints*2; p += 2) {
5059de41b84cSMatthew G. Knepley     PetscInt fdof;
5060de41b84cSMatthew G. Knepley 
5061de41b84cSMatthew G. Knepley     ierr = PetscSectionGetDof(csection, cpoints[p], &dof);CHKERRQ(ierr);
50624ca5e9f5SMatthew G. Knepley     if (!dof) continue;
5063de41b84cSMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
5064de41b84cSMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(csection, cpoints[p], f, &fdof);CHKERRQ(ierr);
5065de41b84cSMatthew G. Knepley       coffsets[f+1] += fdof;
5066de41b84cSMatthew G. Knepley     }
5067de41b84cSMatthew G. Knepley     numCIndices += dof;
5068de41b84cSMatthew G. Knepley   }
5069de41b84cSMatthew G. Knepley   for (f = 1; f < numFields; ++f) coffsets[f+1] += coffsets[f];
5070de41b84cSMatthew G. Knepley   /* Row indices */
5071de41b84cSMatthew G. Knepley   ierr = DMPlexGetCellRefiner_Internal(dmc, &cellRefiner);CHKERRQ(ierr);
5072de41b84cSMatthew G. Knepley   ierr = CellRefinerGetAffineTransforms_Internal(cellRefiner, &numSubcells, NULL, NULL, NULL);CHKERRQ(ierr);
50731ba5f902SMatthew G. Knepley   ierr = DMGetWorkArray(dmf, maxFPoints*2*numSubcells, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
5074de41b84cSMatthew G. Knepley   for (r = 0, q = 0; r < numSubcells; ++r) {
5075de41b84cSMatthew G. Knepley     /* TODO Map from coarse to fine cells */
5076de41b84cSMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dmf, point*numSubcells + r, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
5077de41b84cSMatthew G. Knepley     /* Compress out points not in the section */
5078de41b84cSMatthew G. Knepley     ierr = PetscSectionGetChart(fsection, &pStart, &pEnd);CHKERRQ(ierr);
5079de41b84cSMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
5080de41b84cSMatthew G. Knepley       if ((fpoints[p] >= pStart) && (fpoints[p] < pEnd)) {
50814ca5e9f5SMatthew G. Knepley         ierr = PetscSectionGetDof(fsection, fpoints[p], &dof);CHKERRQ(ierr);
50824ca5e9f5SMatthew G. Knepley         if (!dof) continue;
50834ca5e9f5SMatthew G. Knepley         for (s = 0; s < q; ++s) if (fpoints[p] == ftotpoints[s*2]) break;
50844ca5e9f5SMatthew G. Knepley         if (s < q) continue;
5085de41b84cSMatthew G. Knepley         ftotpoints[q*2]   = fpoints[p];
5086de41b84cSMatthew G. Knepley         ftotpoints[q*2+1] = fpoints[p+1];
5087de41b84cSMatthew G. Knepley         ++q;
5088de41b84cSMatthew G. Knepley       }
5089de41b84cSMatthew G. Knepley     }
5090de41b84cSMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dmf, point, PETSC_TRUE, &numFPoints, &fpoints);CHKERRQ(ierr);
5091de41b84cSMatthew G. Knepley   }
5092de41b84cSMatthew G. Knepley   numFPoints = q;
5093de41b84cSMatthew G. Knepley   for (p = 0, numFIndices = 0; p < numFPoints*2; p += 2) {
5094de41b84cSMatthew G. Knepley     PetscInt fdof;
5095de41b84cSMatthew G. Knepley 
5096de41b84cSMatthew G. Knepley     ierr = PetscSectionGetDof(fsection, ftotpoints[p], &dof);CHKERRQ(ierr);
50974ca5e9f5SMatthew G. Knepley     if (!dof) continue;
5098de41b84cSMatthew G. Knepley     for (f = 0; f < numFields; ++f) {
5099de41b84cSMatthew G. Knepley       ierr           = PetscSectionGetFieldDof(fsection, ftotpoints[p], f, &fdof);CHKERRQ(ierr);
5100de41b84cSMatthew G. Knepley       foffsets[f+1] += fdof;
5101de41b84cSMatthew G. Knepley     }
5102de41b84cSMatthew G. Knepley     numFIndices += dof;
5103de41b84cSMatthew G. Knepley   }
5104de41b84cSMatthew G. Knepley   for (f = 1; f < numFields; ++f) foffsets[f+1] += foffsets[f];
5105de41b84cSMatthew G. Knepley 
5106de41b84cSMatthew G. Knepley   if (numFields && foffsets[numFields] != numFIndices) SETERRQ2(PetscObjectComm((PetscObject)dmf), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", foffsets[numFields], numFIndices);
5107de41b84cSMatthew G. Knepley   if (numFields && coffsets[numFields] != numCIndices) SETERRQ2(PetscObjectComm((PetscObject)dmc), PETSC_ERR_PLIB, "Invalid size for closure %d should be %d", coffsets[numFields], numCIndices);
5108de41b84cSMatthew G. Knepley   ierr = DMGetWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr);
5109de41b84cSMatthew G. Knepley   ierr = DMGetWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr);
5110de41b84cSMatthew G. Knepley   if (numFields) {
5111de41b84cSMatthew G. Knepley     for (p = 0; p < numFPoints*2; p += 2) {
5112de41b84cSMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
5113de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
5114de41b84cSMatthew G. Knepley       indicesPointFields_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, foffsets, PETSC_FALSE, o, findices);
5115de41b84cSMatthew G. Knepley     }
5116de41b84cSMatthew G. Knepley     for (p = 0; p < numCPoints*2; p += 2) {
5117de41b84cSMatthew G. Knepley       PetscInt o = cpoints[p+1];
5118de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
5119de41b84cSMatthew G. Knepley       indicesPointFields_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, coffsets, PETSC_FALSE, o, cindices);
5120de41b84cSMatthew G. Knepley     }
5121de41b84cSMatthew G. Knepley   } else {
5122de41b84cSMatthew G. Knepley     for (p = 0, off = 0; p < numFPoints*2; p += 2) {
5123de41b84cSMatthew G. Knepley       PetscInt o = ftotpoints[p+1];
5124de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalFSection, ftotpoints[p], &globalOff);CHKERRQ(ierr);
5125de41b84cSMatthew G. Knepley       indicesPoint_private(fsection, ftotpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, findices);
5126de41b84cSMatthew G. Knepley     }
5127de41b84cSMatthew G. Knepley     for (p = 0, off = 0; p < numCPoints*2; p += 2) {
5128de41b84cSMatthew G. Knepley       PetscInt o = cpoints[p+1];
5129de41b84cSMatthew G. Knepley       ierr = PetscSectionGetOffset(globalCSection, cpoints[p], &globalOff);CHKERRQ(ierr);
5130de41b84cSMatthew G. Knepley       indicesPoint_private(csection, cpoints[p], globalOff < 0 ? -(globalOff+1) : globalOff, &off, PETSC_FALSE, o, cindices);
5131de41b84cSMatthew G. Knepley     }
5132de41b84cSMatthew G. Knepley   }
5133de41b84cSMatthew G. Knepley   if (mesh->printSetValues) {ierr = DMPlexPrintMatSetValues(PETSC_VIEWER_STDOUT_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr);}
5134de41b84cSMatthew G. Knepley   ierr = MatSetValues(A, numFIndices, findices, numCIndices, cindices, values, mode);
5135de41b84cSMatthew G. Knepley   if (ierr) {
5136de41b84cSMatthew G. Knepley     PetscMPIInt    rank;
5137de41b84cSMatthew G. Knepley     PetscErrorCode ierr2;
5138de41b84cSMatthew G. Knepley 
5139de41b84cSMatthew G. Knepley     ierr2 = MPI_Comm_rank(PetscObjectComm((PetscObject)A), &rank);CHKERRQ(ierr2);
5140de41b84cSMatthew G. Knepley     ierr2 = (*PetscErrorPrintf)("[%D]ERROR in DMPlexMatSetClosure\n", rank);CHKERRQ(ierr2);
5141de41b84cSMatthew G. Knepley     ierr2 = DMPlexPrintMatSetValues(PETSC_VIEWER_STDERR_SELF, A, point, numFIndices, findices, numCIndices, cindices, values);CHKERRQ(ierr2);
5142de41b84cSMatthew G. Knepley     ierr2 = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr2);
5143de41b84cSMatthew G. Knepley     ierr2 = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr2);
5144de41b84cSMatthew G. Knepley     CHKERRQ(ierr);
5145de41b84cSMatthew G. Knepley   }
5146549a8adaSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numCPoints*2*4, PETSC_INT, &ftotpoints);CHKERRQ(ierr);
5147de41b84cSMatthew G. Knepley   ierr = DMPlexRestoreTransitiveClosure(dmc, point, PETSC_TRUE, &numCPoints, &cpoints);CHKERRQ(ierr);
5148de41b84cSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmf, numFIndices, PETSC_INT, &findices);CHKERRQ(ierr);
5149de41b84cSMatthew G. Knepley   ierr = DMRestoreWorkArray(dmc, numCIndices, PETSC_INT, &cindices);CHKERRQ(ierr);
5150de41b84cSMatthew G. Knepley   PetscFunctionReturn(0);
5151de41b84cSMatthew G. Knepley }
5152de41b84cSMatthew G. Knepley 
5153de41b84cSMatthew G. Knepley #undef __FUNCT__
5154770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexGetHybridBounds"
5155f96281f8SMatthew G. Knepley /*@
5156f96281f8SMatthew G. Knepley   DMPlexGetHybridBounds - Get the first mesh point of each dimension which is a hybrid
5157f96281f8SMatthew G. Knepley 
5158f96281f8SMatthew G. Knepley   Input Parameter:
5159f96281f8SMatthew G. Knepley . dm - The DMPlex object
5160f96281f8SMatthew G. Knepley 
5161f96281f8SMatthew G. Knepley   Output Parameters:
5162f96281f8SMatthew G. Knepley + cMax - The first hybrid cell
5163f96281f8SMatthew G. Knepley . cMax - The first hybrid face
5164f96281f8SMatthew G. Knepley . cMax - The first hybrid edge
5165f96281f8SMatthew G. Knepley - cMax - The first hybrid vertex
5166f96281f8SMatthew G. Knepley 
5167f96281f8SMatthew G. Knepley   Level: developer
5168f96281f8SMatthew G. Knepley 
5169f96281f8SMatthew G. Knepley .seealso DMPlexCreateHybridMesh()
5170f96281f8SMatthew G. Knepley @*/
5171770b213bSMatthew G Knepley PetscErrorCode DMPlexGetHybridBounds(DM dm, PetscInt *cMax, PetscInt *fMax, PetscInt *eMax, PetscInt *vMax)
5172552f7358SJed Brown {
5173552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5174770b213bSMatthew G Knepley   PetscInt       dim;
5175770b213bSMatthew G Knepley   PetscErrorCode ierr;
5176552f7358SJed Brown 
5177552f7358SJed Brown   PetscFunctionBegin;
5178552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5179770b213bSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
5180770b213bSMatthew G Knepley   if (cMax) *cMax = mesh->hybridPointMax[dim];
5181770b213bSMatthew G Knepley   if (fMax) *fMax = mesh->hybridPointMax[dim-1];
5182770b213bSMatthew G Knepley   if (eMax) *eMax = mesh->hybridPointMax[1];
5183770b213bSMatthew G Knepley   if (vMax) *vMax = mesh->hybridPointMax[0];
5184552f7358SJed Brown   PetscFunctionReturn(0);
5185552f7358SJed Brown }
5186552f7358SJed Brown 
5187552f7358SJed Brown #undef __FUNCT__
5188770b213bSMatthew G Knepley #define __FUNCT__ "DMPlexSetHybridBounds"
5189770b213bSMatthew G Knepley PetscErrorCode DMPlexSetHybridBounds(DM dm, PetscInt cMax, PetscInt fMax, PetscInt eMax, PetscInt vMax)
5190552f7358SJed Brown {
5191552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5192770b213bSMatthew G Knepley   PetscInt       dim;
5193770b213bSMatthew G Knepley   PetscErrorCode ierr;
5194552f7358SJed Brown 
5195552f7358SJed Brown   PetscFunctionBegin;
5196552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5197770b213bSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
5198770b213bSMatthew G Knepley   if (cMax >= 0) mesh->hybridPointMax[dim]   = cMax;
5199770b213bSMatthew G Knepley   if (fMax >= 0) mesh->hybridPointMax[dim-1] = fMax;
5200770b213bSMatthew G Knepley   if (eMax >= 0) mesh->hybridPointMax[1]     = eMax;
5201770b213bSMatthew G Knepley   if (vMax >= 0) mesh->hybridPointMax[0]     = vMax;
5202552f7358SJed Brown   PetscFunctionReturn(0);
5203552f7358SJed Brown }
5204552f7358SJed Brown 
5205552f7358SJed Brown #undef __FUNCT__
5206552f7358SJed Brown #define __FUNCT__ "DMPlexGetVTKCellHeight"
5207552f7358SJed Brown PetscErrorCode DMPlexGetVTKCellHeight(DM dm, PetscInt *cellHeight)
5208552f7358SJed Brown {
5209552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5210552f7358SJed Brown 
5211552f7358SJed Brown   PetscFunctionBegin;
5212552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5213552f7358SJed Brown   PetscValidPointer(cellHeight, 2);
5214552f7358SJed Brown   *cellHeight = mesh->vtkCellHeight;
5215552f7358SJed Brown   PetscFunctionReturn(0);
5216552f7358SJed Brown }
5217552f7358SJed Brown 
5218552f7358SJed Brown #undef __FUNCT__
5219552f7358SJed Brown #define __FUNCT__ "DMPlexSetVTKCellHeight"
5220552f7358SJed Brown PetscErrorCode DMPlexSetVTKCellHeight(DM dm, PetscInt cellHeight)
5221552f7358SJed Brown {
5222552f7358SJed Brown   DM_Plex *mesh = (DM_Plex*) dm->data;
5223552f7358SJed Brown 
5224552f7358SJed Brown   PetscFunctionBegin;
5225552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5226552f7358SJed Brown   mesh->vtkCellHeight = cellHeight;
5227552f7358SJed Brown   PetscFunctionReturn(0);
5228552f7358SJed Brown }
5229552f7358SJed Brown 
5230552f7358SJed Brown #undef __FUNCT__
5231552f7358SJed Brown #define __FUNCT__ "DMPlexCreateNumbering_Private"
5232552f7358SJed Brown /* We can easily have a form that takes an IS instead */
5233552f7358SJed Brown PetscErrorCode DMPlexCreateNumbering_Private(DM dm, PetscInt pStart, PetscInt pEnd, PetscSF sf, IS *numbering)
5234552f7358SJed Brown {
5235552f7358SJed Brown   PetscSection   section, globalSection;
5236552f7358SJed Brown   PetscInt      *numbers, p;
5237552f7358SJed Brown   PetscErrorCode ierr;
5238552f7358SJed Brown 
5239552f7358SJed Brown   PetscFunctionBegin;
524082f516ccSBarry Smith   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &section);CHKERRQ(ierr);
5241552f7358SJed Brown   ierr = PetscSectionSetChart(section, pStart, pEnd);CHKERRQ(ierr);
5242552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5243552f7358SJed Brown     ierr = PetscSectionSetDof(section, p, 1);CHKERRQ(ierr);
5244552f7358SJed Brown   }
5245552f7358SJed Brown   ierr = PetscSectionSetUp(section);CHKERRQ(ierr);
5246552f7358SJed Brown   ierr = PetscSectionCreateGlobalSection(section, sf, PETSC_FALSE, &globalSection);CHKERRQ(ierr);
5247785e854fSJed Brown   ierr = PetscMalloc1((pEnd - pStart), &numbers);CHKERRQ(ierr);
5248552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5249552f7358SJed Brown     ierr = PetscSectionGetOffset(globalSection, p, &numbers[p-pStart]);CHKERRQ(ierr);
5250552f7358SJed Brown   }
525182f516ccSBarry Smith   ierr = ISCreateGeneral(PetscObjectComm((PetscObject)dm), pEnd - pStart, numbers, PETSC_OWN_POINTER, numbering);CHKERRQ(ierr);
5252552f7358SJed Brown   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5253552f7358SJed Brown   ierr = PetscSectionDestroy(&globalSection);CHKERRQ(ierr);
5254552f7358SJed Brown   PetscFunctionReturn(0);
5255552f7358SJed Brown }
5256552f7358SJed Brown 
5257552f7358SJed Brown #undef __FUNCT__
5258552f7358SJed Brown #define __FUNCT__ "DMPlexGetCellNumbering"
5259552f7358SJed Brown PetscErrorCode DMPlexGetCellNumbering(DM dm, IS *globalCellNumbers)
5260552f7358SJed Brown {
5261552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5262552f7358SJed Brown   PetscInt       cellHeight, cStart, cEnd, cMax;
5263552f7358SJed Brown   PetscErrorCode ierr;
5264552f7358SJed Brown 
5265552f7358SJed Brown   PetscFunctionBegin;
5266552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5267552f7358SJed Brown   if (!mesh->globalCellNumbers) {
5268552f7358SJed Brown     ierr = DMPlexGetVTKCellHeight(dm, &cellHeight);CHKERRQ(ierr);
5269552f7358SJed Brown     ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
52700298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
52710d644c17SKarl Rupp     if (cMax >= 0) cEnd = PetscMin(cEnd, cMax);
5272552f7358SJed Brown     ierr = DMPlexCreateNumbering_Private(dm, cStart, cEnd, dm->sf, &mesh->globalCellNumbers);CHKERRQ(ierr);
5273552f7358SJed Brown   }
5274552f7358SJed Brown   *globalCellNumbers = mesh->globalCellNumbers;
5275552f7358SJed Brown   PetscFunctionReturn(0);
5276552f7358SJed Brown }
5277552f7358SJed Brown 
5278552f7358SJed Brown #undef __FUNCT__
5279552f7358SJed Brown #define __FUNCT__ "DMPlexGetVertexNumbering"
5280552f7358SJed Brown PetscErrorCode DMPlexGetVertexNumbering(DM dm, IS *globalVertexNumbers)
5281552f7358SJed Brown {
5282552f7358SJed Brown   DM_Plex       *mesh = (DM_Plex*) dm->data;
5283552f7358SJed Brown   PetscInt       vStart, vEnd, vMax;
5284552f7358SJed Brown   PetscErrorCode ierr;
5285552f7358SJed Brown 
5286552f7358SJed Brown   PetscFunctionBegin;
5287552f7358SJed Brown   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5288552f7358SJed Brown   if (!mesh->globalVertexNumbers) {
5289552f7358SJed Brown     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
52900298fd71SBarry Smith     ierr = DMPlexGetHybridBounds(dm, NULL, NULL, NULL, &vMax);CHKERRQ(ierr);
52910d644c17SKarl Rupp     if (vMax >= 0) vEnd = PetscMin(vEnd, vMax);
5292552f7358SJed Brown     ierr = DMPlexCreateNumbering_Private(dm, vStart, vEnd, dm->sf, &mesh->globalVertexNumbers);CHKERRQ(ierr);
5293552f7358SJed Brown   }
5294552f7358SJed Brown   *globalVertexNumbers = mesh->globalVertexNumbers;
5295552f7358SJed Brown   PetscFunctionReturn(0);
5296552f7358SJed Brown }
5297552f7358SJed Brown 
5298552f7358SJed Brown 
5299552f7358SJed Brown #undef __FUNCT__
5300552f7358SJed Brown #define __FUNCT__ "PetscSectionCreateGlobalSectionLabel"
5301552f7358SJed Brown /*@C
5302552f7358SJed Brown   PetscSectionCreateGlobalSectionLabel - Create a section describing the global field layout using
5303552f7358SJed Brown   the local section and an SF describing the section point overlap.
5304552f7358SJed Brown 
5305552f7358SJed Brown   Input Parameters:
5306552f7358SJed Brown   + s - The PetscSection for the local field layout
5307552f7358SJed Brown   . sf - The SF describing parallel layout of the section points
5308552f7358SJed Brown   . includeConstraints - By default this is PETSC_FALSE, meaning that the global field vector will not possess constrained dofs
5309552f7358SJed Brown   . label - The label specifying the points
5310552f7358SJed Brown   - labelValue - The label stratum specifying the points
5311552f7358SJed Brown 
5312552f7358SJed Brown   Output Parameter:
5313552f7358SJed Brown   . gsection - The PetscSection for the global field layout
5314552f7358SJed Brown 
5315552f7358SJed Brown   Note: This gives negative sizes and offsets to points not owned by this process
5316552f7358SJed Brown 
5317552f7358SJed Brown   Level: developer
5318552f7358SJed Brown 
5319552f7358SJed Brown .seealso: PetscSectionCreate()
5320552f7358SJed Brown @*/
5321552f7358SJed Brown PetscErrorCode PetscSectionCreateGlobalSectionLabel(PetscSection s, PetscSF sf, PetscBool includeConstraints, DMLabel label, PetscInt labelValue, PetscSection *gsection)
5322552f7358SJed Brown {
53237ec39499SMatthew G. Knepley   PetscInt      *neg = NULL, *tmpOff = NULL;
5324552f7358SJed Brown   PetscInt       pStart, pEnd, p, dof, cdof, off, globalOff = 0, nroots;
5325552f7358SJed Brown   PetscErrorCode ierr;
5326552f7358SJed Brown 
5327552f7358SJed Brown   PetscFunctionBegin;
53284c0d72c2SMatthew G. Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject) s), gsection);CHKERRQ(ierr);
5329552f7358SJed Brown   ierr = PetscSectionGetChart(s, &pStart, &pEnd);CHKERRQ(ierr);
5330552f7358SJed Brown   ierr = PetscSectionSetChart(*gsection, pStart, pEnd);CHKERRQ(ierr);
53317ec39499SMatthew G. Knepley   ierr = PetscSFGetGraph(sf, &nroots, NULL, NULL, NULL);CHKERRQ(ierr);
53327ec39499SMatthew G. Knepley   if (nroots >= 0) {
53337ec39499SMatthew G. Knepley     if (nroots < pEnd-pStart) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "PetscSF nroots %d < %d section size", nroots, pEnd-pStart);
53341795a4d1SJed Brown     ierr = PetscCalloc1(nroots, &neg);CHKERRQ(ierr);
53357ec39499SMatthew G. Knepley     if (nroots > pEnd-pStart) {
53361795a4d1SJed Brown       ierr = PetscCalloc1(nroots, &tmpOff);CHKERRQ(ierr);
53377ec39499SMatthew G. Knepley     } else {
53387ec39499SMatthew G. Knepley       tmpOff = &(*gsection)->atlasDof[-pStart];
53397ec39499SMatthew G. Knepley     }
53407ec39499SMatthew G. Knepley   }
5341552f7358SJed Brown   /* Mark ghost points with negative dof */
5342552f7358SJed Brown   for (p = pStart; p < pEnd; ++p) {
5343552f7358SJed Brown     PetscInt value;
5344552f7358SJed Brown 
5345552f7358SJed Brown     ierr = DMLabelGetValue(label, p, &value);CHKERRQ(ierr);
5346552f7358SJed Brown     if (value != labelValue) continue;
5347552f7358SJed Brown     ierr = PetscSectionGetDof(s, p, &dof);CHKERRQ(ierr);
5348552f7358SJed Brown     ierr = PetscSectionSetDof(*gsection, p, dof);CHKERRQ(ierr);
5349552f7358SJed Brown     ierr = PetscSectionGetConstraintDof(s, p, &cdof);CHKERRQ(ierr);
5350552f7358SJed Brown     if (!includeConstraints && cdof > 0) {ierr = PetscSectionSetConstraintDof(*gsection, p, cdof);CHKERRQ(ierr);}
53517ec39499SMatthew G. Knepley     if (neg) neg[p] = -(dof+1);
5352552f7358SJed Brown   }
5353552f7358SJed Brown   ierr = PetscSectionSetUpBC(*gsection);CHKERRQ(ierr);
5354552f7358SJed Brown   if (nroots >= 0) {
53557ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
53567ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
5357552f7358SJed Brown     if (nroots > pEnd-pStart) {
53587ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasDof[p-pStart] = tmpOff[p];}
5359552f7358SJed Brown     }
5360552f7358SJed Brown   }
5361552f7358SJed Brown   /* Calculate new sizes, get proccess offset, and calculate point offsets */
5362552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
5363552f7358SJed Brown     cdof = (!includeConstraints && s->bc) ? s->bc->atlasDof[p] : 0;
5364552f7358SJed Brown     (*gsection)->atlasOff[p] = off;
5365552f7358SJed Brown     off += (*gsection)->atlasDof[p] > 0 ? (*gsection)->atlasDof[p]-cdof : 0;
5366552f7358SJed Brown   }
53674c0d72c2SMatthew G. Knepley   ierr       = MPI_Scan(&off, &globalOff, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject) s));CHKERRQ(ierr);
5368552f7358SJed Brown   globalOff -= off;
5369552f7358SJed Brown   for (p = 0, off = 0; p < pEnd-pStart; ++p) {
5370552f7358SJed Brown     (*gsection)->atlasOff[p] += globalOff;
53717ec39499SMatthew G. Knepley     if (neg) neg[p] = -((*gsection)->atlasOff[p]+1);
5372552f7358SJed Brown   }
5373552f7358SJed Brown   /* Put in negative offsets for ghost points */
5374552f7358SJed Brown   if (nroots >= 0) {
53757ec39499SMatthew G. Knepley     ierr = PetscSFBcastBegin(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
53767ec39499SMatthew G. Knepley     ierr = PetscSFBcastEnd(sf, MPIU_INT, neg, tmpOff);CHKERRQ(ierr);
5377552f7358SJed Brown     if (nroots > pEnd-pStart) {
53787ec39499SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {if (tmpOff[p] < 0) (*gsection)->atlasOff[p-pStart] = tmpOff[p];}
5379552f7358SJed Brown     }
5380552f7358SJed Brown   }
53817ec39499SMatthew G. Knepley   if (nroots >= 0 && nroots > pEnd-pStart) {ierr = PetscFree(tmpOff);CHKERRQ(ierr);}
5382552f7358SJed Brown   ierr = PetscFree(neg);CHKERRQ(ierr);
5383552f7358SJed Brown   PetscFunctionReturn(0);
5384552f7358SJed Brown }
5385ca8062c8SMatthew G. Knepley 
5386ca8062c8SMatthew G. Knepley #undef __FUNCT__
5387ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSymmetry"
5388ca8062c8SMatthew G. Knepley /*@
5389ca8062c8SMatthew G. Knepley   DMPlexCheckSymmetry - Check that the adjacency information in the mesh is symmetric.
5390ca8062c8SMatthew G. Knepley 
5391ca8062c8SMatthew G. Knepley   Input Parameters:
5392ca8062c8SMatthew G. Knepley   + dm - The DMPlex object
5393ca8062c8SMatthew G. Knepley 
5394ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
5395ca8062c8SMatthew G. Knepley 
5396ca8062c8SMatthew G. Knepley   Level: developer
5397ca8062c8SMatthew G. Knepley 
53989bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSkeleton(), DMCheckFaces()
5399ca8062c8SMatthew G. Knepley @*/
5400ca8062c8SMatthew G. Knepley PetscErrorCode DMPlexCheckSymmetry(DM dm)
5401ca8062c8SMatthew G. Knepley {
5402ca8062c8SMatthew G. Knepley   PetscSection    coneSection, supportSection;
5403ca8062c8SMatthew G. Knepley   const PetscInt *cone, *support;
5404ca8062c8SMatthew G. Knepley   PetscInt        coneSize, c, supportSize, s;
5405ca8062c8SMatthew G. Knepley   PetscInt        pStart, pEnd, p, csize, ssize;
5406ca8062c8SMatthew G. Knepley   PetscErrorCode  ierr;
5407ca8062c8SMatthew G. Knepley 
5408ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
5409ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5410ca8062c8SMatthew G. Knepley   ierr = DMPlexGetConeSection(dm, &coneSection);CHKERRQ(ierr);
5411ca8062c8SMatthew G. Knepley   ierr = DMPlexGetSupportSection(dm, &supportSection);CHKERRQ(ierr);
5412ca8062c8SMatthew G. Knepley   /* Check that point p is found in the support of its cone points, and vice versa */
5413ca8062c8SMatthew G. Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
5414ca8062c8SMatthew G. Knepley   for (p = pStart; p < pEnd; ++p) {
5415ca8062c8SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, p, &coneSize);CHKERRQ(ierr);
5416ca8062c8SMatthew G. Knepley     ierr = DMPlexGetCone(dm, p, &cone);CHKERRQ(ierr);
5417ca8062c8SMatthew G. Knepley     for (c = 0; c < coneSize; ++c) {
541842e66dfaSMatthew G. Knepley       PetscBool dup = PETSC_FALSE;
541942e66dfaSMatthew G. Knepley       PetscInt  d;
542042e66dfaSMatthew G. Knepley       for (d = c-1; d >= 0; --d) {
542142e66dfaSMatthew G. Knepley         if (cone[c] == cone[d]) {dup = PETSC_TRUE; break;}
542242e66dfaSMatthew G. Knepley       }
5423ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[c], &supportSize);CHKERRQ(ierr);
5424ca8062c8SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[c], &support);CHKERRQ(ierr);
5425ca8062c8SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
5426ca8062c8SMatthew G. Knepley         if (support[s] == p) break;
5427ca8062c8SMatthew G. Knepley       }
542842e66dfaSMatthew G. Knepley       if ((s >= supportSize) || (dup && (support[s+1] != p))) {
5429ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", p);
5430ca8062c8SMatthew G. Knepley         for (s = 0; s < coneSize; ++s) {
5431ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[s]);
5432ca8062c8SMatthew G. Knepley         }
5433ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5434ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", cone[c]);
5435ca8062c8SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
5436ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[s]);
5437ca8062c8SMatthew G. Knepley         }
5438ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
543942e66dfaSMatthew G. Knepley         if (dup) {
544042e66dfaSMatthew G. Knepley           SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not repeatedly found in support of repeated cone point %d", p, cone[c]);
544142e66dfaSMatthew G. Knepley         } else {
5442ca8062c8SMatthew G. Knepley           SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in support of cone point %d", p, cone[c]);
5443ca8062c8SMatthew G. Knepley         }
5444ca8062c8SMatthew G. Knepley       }
544542e66dfaSMatthew G. Knepley     }
5446ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, p, &supportSize);CHKERRQ(ierr);
5447ca8062c8SMatthew G. Knepley     ierr = DMPlexGetSupport(dm, p, &support);CHKERRQ(ierr);
5448ca8062c8SMatthew G. Knepley     for (s = 0; s < supportSize; ++s) {
5449ca8062c8SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
5450ca8062c8SMatthew G. Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
5451ca8062c8SMatthew G. Knepley       for (c = 0; c < coneSize; ++c) {
5452ca8062c8SMatthew G. Knepley         if (cone[c] == p) break;
5453ca8062c8SMatthew G. Knepley       }
5454ca8062c8SMatthew G. Knepley       if (c >= coneSize) {
5455ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d support: ", p);
5456ca8062c8SMatthew G. Knepley         for (c = 0; c < supportSize; ++c) {
5457ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", support[c]);
5458ca8062c8SMatthew G. Knepley         }
5459ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5460ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "p: %d cone: ", support[s]);
5461ca8062c8SMatthew G. Knepley         for (c = 0; c < coneSize; ++c) {
5462ca8062c8SMatthew G. Knepley           ierr = PetscPrintf(PETSC_COMM_SELF, "%d, ", cone[c]);
5463ca8062c8SMatthew G. Knepley         }
5464ca8062c8SMatthew G. Knepley         ierr = PetscPrintf(PETSC_COMM_SELF, "\n");
5465ca8062c8SMatthew G. Knepley         SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d not found in cone of support point %d", p, support[s]);
5466ca8062c8SMatthew G. Knepley       }
5467ca8062c8SMatthew G. Knepley     }
5468ca8062c8SMatthew G. Knepley   }
5469ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(coneSection, &csize);CHKERRQ(ierr);
5470ca8062c8SMatthew G. Knepley   ierr = PetscSectionGetStorageSize(supportSection, &ssize);CHKERRQ(ierr);
5471ca8062c8SMatthew G. Knepley   if (csize != ssize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "Total cone size %d != Total support size %d", csize, ssize);
5472ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
5473ca8062c8SMatthew G. Knepley }
5474ca8062c8SMatthew G. Knepley 
5475ca8062c8SMatthew G. Knepley #undef __FUNCT__
5476ca8062c8SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckSkeleton"
5477ca8062c8SMatthew G. Knepley /*@
5478ca8062c8SMatthew G. Knepley   DMPlexCheckSkeleton - Check that each cell has the correct number of vertices
5479ca8062c8SMatthew G. Knepley 
5480ca8062c8SMatthew G. Knepley   Input Parameters:
5481ca8062c8SMatthew G. Knepley + dm - The DMPlex object
548258723a97SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
548358723a97SMatthew G. Knepley - cellHeight - Normally 0
5484ca8062c8SMatthew G. Knepley 
5485ca8062c8SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
5486ca8062c8SMatthew G. Knepley 
5487ca8062c8SMatthew G. Knepley   Level: developer
5488ca8062c8SMatthew G. Knepley 
54899bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckFaces()
5490ca8062c8SMatthew G. Knepley @*/
549158723a97SMatthew G. Knepley PetscErrorCode DMPlexCheckSkeleton(DM dm, PetscBool isSimplex, PetscInt cellHeight)
5492ca8062c8SMatthew G. Knepley {
549342363296SMatthew G. Knepley   PetscInt       dim, numCorners, numHybridCorners, vStart, vEnd, cStart, cEnd, cMax, c;
5494ca8062c8SMatthew G. Knepley   PetscErrorCode ierr;
5495ca8062c8SMatthew G. Knepley 
5496ca8062c8SMatthew G. Knepley   PetscFunctionBegin;
5497ca8062c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
5498ca8062c8SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
5499ca8062c8SMatthew G. Knepley   switch (dim) {
550042363296SMatthew G. Knepley   case 1: numCorners = isSimplex ? 2 : 2; numHybridCorners = isSimplex ? 2 : 2; break;
550142363296SMatthew G. Knepley   case 2: numCorners = isSimplex ? 3 : 4; numHybridCorners = isSimplex ? 4 : 4; break;
550242363296SMatthew G. Knepley   case 3: numCorners = isSimplex ? 4 : 8; numHybridCorners = isSimplex ? 6 : 8; break;
5503ca8062c8SMatthew G. Knepley   default:
5504ca8062c8SMatthew G. Knepley     SETERRQ1(PetscObjectComm((PetscObject) dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot handle meshes of dimension %d", dim);
5505ca8062c8SMatthew G. Knepley   }
550658723a97SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
550758723a97SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight, &cStart, &cEnd);CHKERRQ(ierr);
5508ca8062c8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
5509ca8062c8SMatthew G. Knepley   cMax = cMax >= 0 ? cMax : cEnd;
5510ca8062c8SMatthew G. Knepley   for (c = cStart; c < cMax; ++c) {
551158723a97SMatthew G. Knepley     PetscInt *closure = NULL, closureSize, cl, coneSize = 0;
551258723a97SMatthew G. Knepley 
551358723a97SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
551458723a97SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
551558723a97SMatthew G. Knepley       const PetscInt p = closure[cl];
551658723a97SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) ++coneSize;
551758723a97SMatthew G. Knepley     }
551858723a97SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
5519ca8062c8SMatthew G. Knepley     if (coneSize != numCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cell %d has  %d vertices != %d", c, coneSize, numCorners);
5520ca8062c8SMatthew G. Knepley   }
552142363296SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
552242363296SMatthew G. Knepley     PetscInt *closure = NULL, closureSize, cl, coneSize = 0;
552342363296SMatthew G. Knepley 
552442363296SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
552542363296SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
552642363296SMatthew G. Knepley       const PetscInt p = closure[cl];
552742363296SMatthew G. Knepley       if ((p >= vStart) && (p < vEnd)) ++coneSize;
552842363296SMatthew G. Knepley     }
552942363296SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
553042363296SMatthew G. Knepley     if (coneSize > numHybridCorners) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Hybrid cell %d has  %d vertices > %d", c, coneSize, numHybridCorners);
553142363296SMatthew G. Knepley   }
5532ca8062c8SMatthew G. Knepley   PetscFunctionReturn(0);
5533ca8062c8SMatthew G. Knepley }
55349bf0dad6SMatthew G. Knepley 
55359bf0dad6SMatthew G. Knepley #undef __FUNCT__
55369bf0dad6SMatthew G. Knepley #define __FUNCT__ "DMPlexCheckFaces"
55379bf0dad6SMatthew G. Knepley /*@
55389bf0dad6SMatthew 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
55399bf0dad6SMatthew G. Knepley 
55409bf0dad6SMatthew G. Knepley   Input Parameters:
55419bf0dad6SMatthew G. Knepley + dm - The DMPlex object
55429bf0dad6SMatthew G. Knepley . isSimplex - Are the cells simplices or tensor products
55439bf0dad6SMatthew G. Knepley - cellHeight - Normally 0
55449bf0dad6SMatthew G. Knepley 
55459bf0dad6SMatthew G. Knepley   Note: This is a useful diagnostic when creating meshes programmatically.
55469bf0dad6SMatthew G. Knepley 
55479bf0dad6SMatthew G. Knepley   Level: developer
55489bf0dad6SMatthew G. Knepley 
55499bf0dad6SMatthew G. Knepley .seealso: DMCreate(), DMCheckSymmetry(), DMCheckSkeleton()
55509bf0dad6SMatthew G. Knepley @*/
55519bf0dad6SMatthew G. Knepley PetscErrorCode DMPlexCheckFaces(DM dm, PetscBool isSimplex, PetscInt cellHeight)
55529bf0dad6SMatthew G. Knepley {
55533554e41dSMatthew G. Knepley   PetscInt       pMax[4];
55543554e41dSMatthew G. Knepley   PetscInt       dim, vStart, vEnd, cStart, cEnd, c, h;
55559bf0dad6SMatthew G. Knepley   PetscErrorCode ierr;
55569bf0dad6SMatthew G. Knepley 
55579bf0dad6SMatthew G. Knepley   PetscFunctionBegin;
55589bf0dad6SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
55599bf0dad6SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
55609bf0dad6SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
556125abba81SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], &pMax[dim-1], &pMax[1], &pMax[0]);CHKERRQ(ierr);
55623554e41dSMatthew G. Knepley   for (h = cellHeight; h < dim; ++h) {
55633554e41dSMatthew G. Knepley     ierr = DMPlexGetHeightStratum(dm, h, &cStart, &cEnd);CHKERRQ(ierr);
55643554e41dSMatthew G. Knepley     for (c = cStart; c < cEnd; ++c) {
55659bf0dad6SMatthew G. Knepley       const PetscInt *cone, *ornt, *faces;
55669bf0dad6SMatthew G. Knepley       PetscInt        numFaces, faceSize, coneSize,f;
55679bf0dad6SMatthew G. Knepley       PetscInt       *closure = NULL, closureSize, cl, numCorners = 0;
55689bf0dad6SMatthew G. Knepley 
556925abba81SMatthew G. Knepley       if (pMax[dim-h] >= 0 && c >= pMax[dim-h]) continue;
55709bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
55719bf0dad6SMatthew G. Knepley       ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
55729bf0dad6SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, c, &ornt);CHKERRQ(ierr);
55739bf0dad6SMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
55749bf0dad6SMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
55759bf0dad6SMatthew G. Knepley         const PetscInt p = closure[cl];
55769bf0dad6SMatthew G. Knepley         if ((p >= vStart) && (p < vEnd)) closure[numCorners++] = p;
55779bf0dad6SMatthew G. Knepley       }
55783554e41dSMatthew G. Knepley       ierr = DMPlexGetRawFaces_Internal(dm, dim-h, numCorners, closure, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
55799bf0dad6SMatthew 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);
55809bf0dad6SMatthew G. Knepley       for (f = 0; f < numFaces; ++f) {
55819bf0dad6SMatthew G. Knepley         PetscInt *fclosure = NULL, fclosureSize, cl, fnumCorners = 0, v;
55829bf0dad6SMatthew G. Knepley 
55839bf0dad6SMatthew G. Knepley         ierr = DMPlexGetTransitiveClosure_Internal(dm, cone[f], ornt[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
55849bf0dad6SMatthew G. Knepley         for (cl = 0; cl < fclosureSize*2; cl += 2) {
55859bf0dad6SMatthew G. Knepley           const PetscInt p = fclosure[cl];
55869bf0dad6SMatthew G. Knepley           if ((p >= vStart) && (p < vEnd)) fclosure[fnumCorners++] = p;
55879bf0dad6SMatthew G. Knepley         }
5588e003ed69SMatthew G. Knepley         if (fnumCorners != faceSize) SETERRQ5(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d has %d vertices but should have %d", cone[f], f, c, fnumCorners, faceSize);
55899bf0dad6SMatthew G. Knepley         for (v = 0; v < fnumCorners; ++v) {
5590e003ed69SMatthew G. Knepley           if (fclosure[v] != faces[f*faceSize+v]) SETERRQ6(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Face %d (%d) of cell %d vertex %d, %d != %d", cone[f], f, c, v, fclosure[v], faces[f*faceSize+v]);
55919bf0dad6SMatthew G. Knepley         }
55929bf0dad6SMatthew G. Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, cone[f], PETSC_TRUE, &fclosureSize, &fclosure);CHKERRQ(ierr);
55939bf0dad6SMatthew G. Knepley       }
55949bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreFaces_Internal(dm, dim, c, &numFaces, &faceSize, &faces);CHKERRQ(ierr);
55959bf0dad6SMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, c, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
55969bf0dad6SMatthew G. Knepley     }
55973554e41dSMatthew G. Knepley   }
5598552f7358SJed Brown   PetscFunctionReturn(0);
5599552f7358SJed Brown }
56003913d7c8SMatthew G. Knepley 
56013913d7c8SMatthew G. Knepley #undef __FUNCT__
5602bceba477SMatthew G. Knepley #define __FUNCT__ "DMCreateInterpolation_Plex"
5603bceba477SMatthew G. Knepley /* Pointwise interpolation
5604bceba477SMatthew G. Knepley      Just code FEM for now
5605bceba477SMatthew G. Knepley      u^f = I u^c
56064ca5e9f5SMatthew G. Knepley      sum_k u^f_k phi^f_k = I sum_j u^c_j phi^c_j
56074ca5e9f5SMatthew G. Knepley      u^f_i = sum_j psi^f_i I phi^c_j u^c_j
56084ca5e9f5SMatthew G. Knepley      I_{ij} = psi^f_i phi^c_j
5609bceba477SMatthew G. Knepley */
5610bceba477SMatthew G. Knepley PetscErrorCode DMCreateInterpolation_Plex(DM dmCoarse, DM dmFine, Mat *interpolation, Vec *scaling)
5611bceba477SMatthew G. Knepley {
5612bceba477SMatthew G. Knepley   PetscSection   gsc, gsf;
5613bceba477SMatthew G. Knepley   PetscInt       m, n;
5614a063dac3SMatthew G. Knepley   void          *ctx;
5615bceba477SMatthew G. Knepley   PetscErrorCode ierr;
5616bceba477SMatthew G. Knepley 
5617bceba477SMatthew G. Knepley   PetscFunctionBegin;
5618bceba477SMatthew G. Knepley   /*
5619bceba477SMatthew G. Knepley   Loop over coarse cells
5620bceba477SMatthew G. Knepley     Loop over coarse basis functions
5621bceba477SMatthew G. Knepley       Loop over fine cells in coarse cell
5622bceba477SMatthew G. Knepley         Loop over fine dual basis functions
5623bceba477SMatthew G. Knepley           Evaluate coarse basis on fine dual basis quad points
5624bceba477SMatthew G. Knepley           Sum
5625bceba477SMatthew G. Knepley           Update local element matrix
5626bceba477SMatthew G. Knepley     Accumulate to interpolation matrix
5627bceba477SMatthew G. Knepley 
5628bceba477SMatthew G. Knepley    Can extend PetscFEIntegrateJacobian_Basic() to do a specialized cell loop
5629bceba477SMatthew G. Knepley   */
5630bceba477SMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr);
5631bceba477SMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsf, &m);CHKERRQ(ierr);
5632bceba477SMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr);
5633bceba477SMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsc, &n);CHKERRQ(ierr);
5634bceba477SMatthew G. Knepley   /* We need to preallocate properly */
5635bceba477SMatthew G. Knepley   ierr = MatCreate(PetscObjectComm((PetscObject) dmCoarse), interpolation);CHKERRQ(ierr);
5636bceba477SMatthew G. Knepley   ierr = MatSetSizes(*interpolation, m, n, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
5637bceba477SMatthew G. Knepley   ierr = MatSetType(*interpolation, dmCoarse->mattype);CHKERRQ(ierr);
5638bceba477SMatthew G. Knepley   ierr = MatSetUp(*interpolation);CHKERRQ(ierr);
5639bceba477SMatthew G. Knepley   ierr = MatSetFromOptions(*interpolation);CHKERRQ(ierr);
5640bceba477SMatthew G. Knepley   ierr = MatSetOption(*interpolation, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE);CHKERRQ(ierr);
5641a063dac3SMatthew G. Knepley   ierr = DMGetApplicationContext(dmFine, &ctx);CHKERRQ(ierr);
5642a063dac3SMatthew G. Knepley   ierr = DMPlexComputeInterpolatorFEM(dmCoarse, dmFine, *interpolation, ctx);CHKERRQ(ierr);
56435d1c2e58SMatthew G. Knepley   /* Use naive scaling */
56445d1c2e58SMatthew G. Knepley   ierr = DMCreateInterpolationScale(dmCoarse, dmFine, *interpolation, scaling);CHKERRQ(ierr);
5645a063dac3SMatthew G. Knepley   PetscFunctionReturn(0);
5646a063dac3SMatthew G. Knepley }
5647bceba477SMatthew G. Knepley 
5648a063dac3SMatthew G. Knepley #undef __FUNCT__
5649a063dac3SMatthew G. Knepley #define __FUNCT__ "DMCreateInjection_Plex"
5650a063dac3SMatthew G. Knepley PetscErrorCode DMCreateInjection_Plex(DM dmCoarse, DM dmFine, VecScatter *ctx)
5651a063dac3SMatthew G. Knepley {
565290748bafSMatthew G. Knepley   Vec             cv,  fv;
565390748bafSMatthew G. Knepley   IS              cis, fis, fpointIS;
565490748bafSMatthew G. Knepley   PetscSection    sc, gsc, gsf;
565590748bafSMatthew G. Knepley   const PetscInt *fpoints;
565690748bafSMatthew G. Knepley   PetscInt       *cindices, *findices;
565790748bafSMatthew G. Knepley   PetscInt        cpStart, cpEnd, m, off, cp;
565890748bafSMatthew G. Knepley   PetscErrorCode  ierr;
565990748bafSMatthew G. Knepley 
5660a063dac3SMatthew G. Knepley   PetscFunctionBegin;
566190748bafSMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmFine, &gsf);CHKERRQ(ierr);
566290748bafSMatthew G. Knepley   ierr = DMGetGlobalVector(dmFine, &fv);CHKERRQ(ierr);
566390748bafSMatthew G. Knepley   ierr = DMGetDefaultSection(dmCoarse, &sc);CHKERRQ(ierr);
566490748bafSMatthew G. Knepley   ierr = DMGetDefaultGlobalSection(dmCoarse, &gsc);CHKERRQ(ierr);
566590748bafSMatthew G. Knepley   ierr = DMGetGlobalVector(dmCoarse, &cv);CHKERRQ(ierr);
566690748bafSMatthew G. Knepley   ierr = DMPlexCreateCoarsePointIS(dmCoarse, &fpointIS);CHKERRQ(ierr);
566790748bafSMatthew G. Knepley   ierr = PetscSectionGetConstrainedStorageSize(gsc, &m);CHKERRQ(ierr);
566890748bafSMatthew G. Knepley   ierr = PetscMalloc2(m,&cindices,m,&findices);CHKERRQ(ierr);
566990748bafSMatthew G. Knepley   ierr = PetscSectionGetChart(gsc, &cpStart, &cpEnd);CHKERRQ(ierr);
567090748bafSMatthew G. Knepley   ierr = ISGetIndices(fpointIS, &fpoints);CHKERRQ(ierr);
567190748bafSMatthew G. Knepley   for (cp = cpStart, off = 0; cp < cpEnd; ++cp) {
567290748bafSMatthew G. Knepley     const PetscInt *cdofsC = NULL;
567390748bafSMatthew G. Knepley     PetscInt        fp     = fpoints[cp-cpStart], dofC, cdofC, dofF, offC, offF, d, e;
567490748bafSMatthew G. Knepley 
567590748bafSMatthew G. Knepley     ierr = PetscSectionGetDof(gsc, cp, &dofC);CHKERRQ(ierr);
567690748bafSMatthew G. Knepley     if (dofC <= 0) continue;
567790748bafSMatthew G. Knepley     ierr = PetscSectionGetConstraintDof(sc, cp, &cdofC);CHKERRQ(ierr);
567890748bafSMatthew G. Knepley     ierr = PetscSectionGetDof(gsf, fp, &dofF);CHKERRQ(ierr);
567990748bafSMatthew G. Knepley     ierr = PetscSectionGetOffset(gsc, cp, &offC);CHKERRQ(ierr);
568090748bafSMatthew G. Knepley     ierr = PetscSectionGetOffset(gsf, fp, &offF);CHKERRQ(ierr);
568190748bafSMatthew G. Knepley     if (cdofC) {ierr = PetscSectionGetConstraintIndices(sc, cp, &cdofsC);CHKERRQ(ierr);}
568290748bafSMatthew G. Knepley     if (dofC != dofF) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has %d coarse dofs != %d fine dofs", cp, fp, dofC, dofF);
568390748bafSMatthew G. Knepley     if (offC < 0 || offF < 0) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Coarse point %d has invalid offset %d (%d)", cp, offC, offF);
568490748bafSMatthew G. Knepley     for (d = 0, e = 0; d < dofC; ++d) {
568590748bafSMatthew G. Knepley       if (cdofsC && cdofsC[e] == d) {++e; continue;}
568690748bafSMatthew G. Knepley       cindices[off+d-e] = offC+d; findices[off+d-e] = offF+d;
568790748bafSMatthew G. Knepley     }
568890748bafSMatthew G. Knepley     if (e != cdofC) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Point %d (%d) has invalid number of constraints %d != %d", cp, fp, e, cdofC);
568990748bafSMatthew G. Knepley     off += dofC-cdofC;
569090748bafSMatthew G. Knepley   }
569190748bafSMatthew G. Knepley   ierr = ISRestoreIndices(fpointIS, &fpoints);CHKERRQ(ierr);
569290748bafSMatthew G. Knepley   if (off != m) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of coarse dofs %d != %d", off, m);
569390748bafSMatthew G. Knepley   ierr = ISCreateGeneral(PETSC_COMM_SELF, m, cindices, PETSC_OWN_POINTER, &cis);CHKERRQ(ierr);
569490748bafSMatthew G. Knepley   ierr = ISCreateGeneral(PETSC_COMM_SELF, m, findices, PETSC_OWN_POINTER, &fis);CHKERRQ(ierr);
569590748bafSMatthew G. Knepley   ierr = VecScatterCreate(cv, cis, fv, fis, ctx);CHKERRQ(ierr);
569690748bafSMatthew G. Knepley   ierr = ISDestroy(&cis);CHKERRQ(ierr);
569790748bafSMatthew G. Knepley   ierr = ISDestroy(&fis);CHKERRQ(ierr);
569890748bafSMatthew G. Knepley   ierr = DMRestoreGlobalVector(dmFine, &fv);CHKERRQ(ierr);
569990748bafSMatthew G. Knepley   ierr = DMRestoreGlobalVector(dmCoarse, &cv);CHKERRQ(ierr);
570090748bafSMatthew G. Knepley   ierr = ISDestroy(&fpointIS);CHKERRQ(ierr);
5701bceba477SMatthew G. Knepley   PetscFunctionReturn(0);
5702bceba477SMatthew G. Knepley }
5703bceba477SMatthew G. Knepley 
5704bceba477SMatthew G. Knepley #undef __FUNCT__
5705fd59a867SMatthew G. Knepley #define __FUNCT__ "DMCreateDefaultSection_Plex"
5706fd59a867SMatthew G. Knepley /* Pointwise interpolation
5707fd59a867SMatthew G. Knepley      Just code FEM for now
5708fd59a867SMatthew G. Knepley      u^f = I u^c
5709fd59a867SMatthew G. Knepley      sum_k u^f_k phi^f_k = I sum_l u^c_l phi^c_l
5710fd59a867SMatthew G. Knepley      u^f_i = sum_l int psi^f_i I phi^c_l u^c_l
5711fd59a867SMatthew G. Knepley      I_{ij} = int psi^f_i phi^c_j
5712fd59a867SMatthew G. Knepley */
5713fd59a867SMatthew G. Knepley PetscErrorCode DMCreateDefaultSection_Plex(DM dm)
5714fd59a867SMatthew G. Knepley {
5715fd59a867SMatthew G. Knepley   PetscSection   section;
5716fd59a867SMatthew G. Knepley   IS            *bcPoints;
5717286d8613SMatthew G. Knepley   PetscInt      *bcFields, *numComp, *numDof;
5718286d8613SMatthew G. Knepley   PetscInt       depth, dim, numBd, numBC = 0, numFields, bd, bc, f;
5719fd59a867SMatthew G. Knepley   PetscErrorCode ierr;
5720fd59a867SMatthew G. Knepley 
5721fd59a867SMatthew G. Knepley   PetscFunctionBegin;
5722fd59a867SMatthew G. Knepley   /* Handle boundary conditions */
5723286d8613SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5724fd59a867SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
5725fd59a867SMatthew G. Knepley   ierr = DMPlexGetNumBoundary(dm, &numBd);CHKERRQ(ierr);
5726fd59a867SMatthew G. Knepley   for (bd = 0; bd < numBd; ++bd) {
5727fd59a867SMatthew G. Knepley     PetscBool isEssential;
5728fd59a867SMatthew G. Knepley     ierr = DMPlexGetBoundary(dm, bd, &isEssential, NULL, NULL, NULL, NULL, NULL, NULL);CHKERRQ(ierr);
5729fd59a867SMatthew G. Knepley     if (isEssential) ++numBC;
5730fd59a867SMatthew G. Knepley   }
5731fd59a867SMatthew G. Knepley   ierr = PetscMalloc2(numBC,&bcFields,numBC,&bcPoints);CHKERRQ(ierr);
5732fd59a867SMatthew G. Knepley   for (bd = 0, bc = 0; bd < numBd; ++bd) {
5733fd59a867SMatthew G. Knepley     const char     *bdLabel;
5734fd59a867SMatthew G. Knepley     DMLabel         label;
5735fd59a867SMatthew G. Knepley     const PetscInt *values;
5736fd59a867SMatthew G. Knepley     PetscInt        field, numValues;
5737fd59a867SMatthew G. Knepley     PetscBool       isEssential, has;
5738fd59a867SMatthew G. Knepley 
5739fd59a867SMatthew G. Knepley     ierr = DMPlexGetBoundary(dm, bd, &isEssential, &bdLabel, &field, NULL, &numValues, &values, NULL);CHKERRQ(ierr);
5740fd59a867SMatthew G. Knepley     if (numValues != 1) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_SUP, "Bug me and I will fix this");
5741fd59a867SMatthew G. Knepley     ierr = DMPlexHasLabel(dm, bdLabel, &has);CHKERRQ(ierr);
5742fd59a867SMatthew G. Knepley     if (!has) {
5743fd59a867SMatthew G. Knepley       ierr = DMPlexCreateLabel(dm, bdLabel);CHKERRQ(ierr);
5744fd59a867SMatthew G. Knepley       ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr);
5745fd59a867SMatthew G. Knepley       ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
5746fd59a867SMatthew G. Knepley     }
5747fd59a867SMatthew G. Knepley     ierr = DMPlexGetLabel(dm, bdLabel, &label);CHKERRQ(ierr);
5748fd59a867SMatthew G. Knepley     ierr = DMPlexLabelComplete(dm, label);CHKERRQ(ierr);
5749fd59a867SMatthew G. Knepley     if (isEssential) {
5750fd59a867SMatthew G. Knepley       bcFields[bc] = field;
5751fd59a867SMatthew G. Knepley       ierr = DMPlexGetStratumIS(dm, bdLabel, values[0], &bcPoints[bc++]);CHKERRQ(ierr);
5752fd59a867SMatthew G. Knepley     }
5753fd59a867SMatthew G. Knepley   }
5754fd59a867SMatthew G. Knepley   /* Handle discretization */
5755fd59a867SMatthew G. Knepley   ierr = DMGetNumFields(dm, &numFields);CHKERRQ(ierr);
5756286d8613SMatthew G. Knepley   ierr = PetscMalloc2(numFields,&numComp,numFields*(dim+1),&numDof);CHKERRQ(ierr);
5757fd59a867SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5758fd59a867SMatthew G. Knepley     PetscFE         fe;
5759286d8613SMatthew G. Knepley     const PetscInt *numFieldDof;
5760fd59a867SMatthew G. Knepley     PetscInt        d;
5761fd59a867SMatthew G. Knepley 
576218abd763SMatthew G. Knepley     ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr);
5763fd59a867SMatthew G. Knepley     ierr = PetscFEGetNumComponents(fe, &numComp[f]);CHKERRQ(ierr);
5764286d8613SMatthew G. Knepley     ierr = PetscFEGetNumDof(fe, &numFieldDof);CHKERRQ(ierr);
5765286d8613SMatthew G. Knepley     for (d = 0; d < dim+1; ++d) numDof[f*(dim+1)+d] = numFieldDof[d];
5766fd59a867SMatthew G. Knepley   }
5767286d8613SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5768286d8613SMatthew G. Knepley     PetscInt d;
5769286d8613SMatthew G. Knepley     for (d = 1; d < dim; ++d) {
5770286d8613SMatthew G. Knepley       if ((numDof[f*(dim+1)+d] > 0) && (depth < dim)) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Mesh must be interpolated when unknowns are specified on edges or faces.");
5771286d8613SMatthew G. Knepley     }
5772286d8613SMatthew G. Knepley   }
5773*f8f126e8SMatthew G. Knepley   ierr = DMPlexCreateSection(dm, dim, numFields, numComp, numDof, numBC, bcFields, bcPoints, NULL, &section);CHKERRQ(ierr);
5774fd59a867SMatthew G. Knepley   for (f = 0; f < numFields; ++f) {
5775fd59a867SMatthew G. Knepley     PetscFE     fe;
5776fd59a867SMatthew G. Knepley     const char *name;
577718abd763SMatthew G. Knepley 
577818abd763SMatthew G. Knepley     ierr = DMGetField(dm, f, (PetscObject *) &fe);CHKERRQ(ierr);
5779fd59a867SMatthew G. Knepley     ierr = PetscObjectGetName((PetscObject) fe, &name);CHKERRQ(ierr);
5780fd59a867SMatthew G. Knepley     ierr = PetscSectionSetFieldName(section, f, name);CHKERRQ(ierr);
5781fd59a867SMatthew G. Knepley   }
5782fd59a867SMatthew G. Knepley   ierr = DMSetDefaultSection(dm, section);CHKERRQ(ierr);
5783fd59a867SMatthew G. Knepley   ierr = PetscSectionDestroy(&section);CHKERRQ(ierr);
5784fd59a867SMatthew G. Knepley   for (bc = 0; bc < numBC; ++bc) {ierr = ISDestroy(&bcPoints[bc]);CHKERRQ(ierr);}
5785fd59a867SMatthew G. Knepley   ierr = PetscFree2(bcFields,bcPoints);CHKERRQ(ierr);
5786286d8613SMatthew G. Knepley   ierr = PetscFree2(numComp,numDof);CHKERRQ(ierr);
5787bceba477SMatthew G. Knepley   PetscFunctionReturn(0);
5788bceba477SMatthew G. Knepley }
5789bceba477SMatthew G. Knepley 
5790bceba477SMatthew G. Knepley #undef __FUNCT__
57913913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexGetCoarseDM"
57923913d7c8SMatthew G. Knepley /*@
57933913d7c8SMatthew G. Knepley   DMPlexGetCoarseDM - Get the coarse mesh from which this was obtained by refinement
57943913d7c8SMatthew G. Knepley 
57953913d7c8SMatthew G. Knepley   Input Parameter:
57963913d7c8SMatthew G. Knepley . dm - The DMPlex object
57973913d7c8SMatthew G. Knepley 
57983913d7c8SMatthew G. Knepley   Output Parameter:
57993913d7c8SMatthew G. Knepley . cdm - The coarse DM
58003913d7c8SMatthew G. Knepley 
58013913d7c8SMatthew G. Knepley   Level: intermediate
58023913d7c8SMatthew G. Knepley 
58033913d7c8SMatthew G. Knepley .seealso: DMPlexSetCoarseDM()
58043913d7c8SMatthew G. Knepley @*/
58053913d7c8SMatthew G. Knepley PetscErrorCode DMPlexGetCoarseDM(DM dm, DM *cdm)
58063913d7c8SMatthew G. Knepley {
58073913d7c8SMatthew G. Knepley   PetscFunctionBegin;
58083913d7c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
58093913d7c8SMatthew G. Knepley   PetscValidPointer(cdm, 2);
58103913d7c8SMatthew G. Knepley   *cdm = ((DM_Plex *) dm->data)->coarseMesh;
58113913d7c8SMatthew G. Knepley   PetscFunctionReturn(0);
58123913d7c8SMatthew G. Knepley }
58133913d7c8SMatthew G. Knepley 
58143913d7c8SMatthew G. Knepley #undef __FUNCT__
58153913d7c8SMatthew G. Knepley #define __FUNCT__ "DMPlexSetCoarseDM"
58163913d7c8SMatthew G. Knepley /*@
58173913d7c8SMatthew G. Knepley   DMPlexSetCoarseDM - Set the coarse mesh from which this was obtained by refinement
58183913d7c8SMatthew G. Knepley 
58193913d7c8SMatthew G. Knepley   Input Parameters:
58203913d7c8SMatthew G. Knepley + dm - The DMPlex object
58213913d7c8SMatthew G. Knepley - cdm - The coarse DM
58223913d7c8SMatthew G. Knepley 
58233913d7c8SMatthew G. Knepley   Level: intermediate
58243913d7c8SMatthew G. Knepley 
58253913d7c8SMatthew G. Knepley .seealso: DMPlexGetCoarseDM()
58263913d7c8SMatthew G. Knepley @*/
58273913d7c8SMatthew G. Knepley PetscErrorCode DMPlexSetCoarseDM(DM dm, DM cdm)
58283913d7c8SMatthew G. Knepley {
58293913d7c8SMatthew G. Knepley   DM_Plex       *mesh;
58303913d7c8SMatthew G. Knepley   PetscErrorCode ierr;
58313913d7c8SMatthew G. Knepley 
58323913d7c8SMatthew G. Knepley   PetscFunctionBegin;
58333913d7c8SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
58343913d7c8SMatthew G. Knepley   if (cdm) PetscValidHeaderSpecific(cdm, DM_CLASSID, 2);
58353913d7c8SMatthew G. Knepley   mesh = (DM_Plex *) dm->data;
58363913d7c8SMatthew G. Knepley   ierr = DMDestroy(&mesh->coarseMesh);CHKERRQ(ierr);
58373913d7c8SMatthew G. Knepley   mesh->coarseMesh = cdm;
58383913d7c8SMatthew G. Knepley   ierr = PetscObjectReference((PetscObject) mesh->coarseMesh);CHKERRQ(ierr);
58393913d7c8SMatthew G. Knepley   PetscFunctionReturn(0);
58403913d7c8SMatthew G. Knepley }
5841