xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision a42b08ee92fdfb8efcbb3e5250402468579ba15d)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
20c312b8eSJed Brown #include <petscsf.h>
3e6ccafaeSMatthew G Knepley 
4e6ccafaeSMatthew G Knepley #undef __FUNCT__
5cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces"
6cd0c2139SMatthew G Knepley /*@
7cd0c2139SMatthew G Knepley   DMPlexMarkBoundaryFaces - Mark all faces on the boundary
8cd0c2139SMatthew G Knepley 
9cd0c2139SMatthew G Knepley   Not Collective
10cd0c2139SMatthew G Knepley 
11cd0c2139SMatthew G Knepley   Input Parameter:
12cd0c2139SMatthew G Knepley . dm - The original DM
13cd0c2139SMatthew G Knepley 
14cd0c2139SMatthew G Knepley   Output Parameter:
15cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1
16cd0c2139SMatthew G Knepley 
17cd0c2139SMatthew G Knepley   Level: developer
18cd0c2139SMatthew G Knepley 
19cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel()
2009f723d9SJed Brown @*/
21cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label)
22cd0c2139SMatthew G Knepley {
23cd0c2139SMatthew G Knepley   PetscInt       fStart, fEnd, f;
24cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
25cd0c2139SMatthew G Knepley 
26cd0c2139SMatthew G Knepley   PetscFunctionBegin;
27cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
28cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
29cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
30cd0c2139SMatthew G Knepley     PetscInt supportSize;
31cd0c2139SMatthew G Knepley 
32cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr);
33cd0c2139SMatthew G Knepley     if (supportSize == 1) {
34cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);
35cd0c2139SMatthew G Knepley     }
36cd0c2139SMatthew G Knepley   }
37cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
38cd0c2139SMatthew G Knepley }
39cd0c2139SMatthew G Knepley 
40cd0c2139SMatthew G Knepley #undef __FUNCT__
412be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete"
422be2b188SMatthew G Knepley /*@
432be2b188SMatthew G Knepley   DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface
442be2b188SMatthew G Knepley 
452be2b188SMatthew G Knepley   Input Parameters:
462be2b188SMatthew G Knepley + dm - The DM
472be2b188SMatthew G Knepley - label - A DMLabel marking the surface points
482be2b188SMatthew G Knepley 
492be2b188SMatthew G Knepley   Output Parameter:
502be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure
512be2b188SMatthew G Knepley 
522be2b188SMatthew G Knepley   Level: developer
532be2b188SMatthew G Knepley 
542be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete()
552be2b188SMatthew G Knepley @*/
562be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label)
572be2b188SMatthew G Knepley {
582be2b188SMatthew G Knepley   IS              valueIS;
592be2b188SMatthew G Knepley   const PetscInt *values;
602be2b188SMatthew G Knepley   PetscInt        numValues, v;
612be2b188SMatthew G Knepley   PetscErrorCode  ierr;
622be2b188SMatthew G Knepley 
632be2b188SMatthew G Knepley   PetscFunctionBegin;
642be2b188SMatthew G Knepley   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
652be2b188SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
662be2b188SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
672be2b188SMatthew G Knepley   for (v = 0; v < numValues; ++v) {
682be2b188SMatthew G Knepley     IS              pointIS;
692be2b188SMatthew G Knepley     const PetscInt *points;
702be2b188SMatthew G Knepley     PetscInt        numPoints, p;
712be2b188SMatthew G Knepley 
722be2b188SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
732be2b188SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
742be2b188SMatthew G Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
752be2b188SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
762be2b188SMatthew G Knepley       PetscInt *closure = NULL;
772be2b188SMatthew G Knepley       PetscInt  closureSize, c;
782be2b188SMatthew G Knepley 
792be2b188SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
802be2b188SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
812be2b188SMatthew G Knepley         ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr);
822be2b188SMatthew G Knepley       }
832be2b188SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
842be2b188SMatthew G Knepley     }
852be2b188SMatthew G Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
862be2b188SMatthew G Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
872be2b188SMatthew G Knepley   }
882be2b188SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
892be2b188SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
902be2b188SMatthew G Knepley   PetscFunctionReturn(0);
912be2b188SMatthew G Knepley }
922be2b188SMatthew G Knepley 
932be2b188SMatthew G Knepley #undef __FUNCT__
94cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal"
95a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[])
96cd0c2139SMatthew G Knepley {
97cd0c2139SMatthew G Knepley   if (depth < 0) return p;
98a6ae58d1SMatthew G. Knepley   /* Normal Cells                 */ if (p < depthMax[depth])                return p;
99a6ae58d1SMatthew G. Knepley   /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0])                    return p + depthShift[depth];
100a6ae58d1SMatthew G. Knepley   /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0];
101a6ae58d1SMatthew G. Knepley   /* Hybrid Faces+Normal Edges    */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1];
102a6ae58d1SMatthew G. Knepley   /* Hybrid Edges                 */                                         return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2];
103cd0c2139SMatthew G Knepley }
104cd0c2139SMatthew G Knepley 
105cd0c2139SMatthew G Knepley #undef __FUNCT__
106cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
107cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
108cd0c2139SMatthew G Knepley {
109a6ae58d1SMatthew G. Knepley   PetscInt      *depthMax, *depthEnd;
110cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
111cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
112cd0c2139SMatthew G Knepley 
113cd0c2139SMatthew G Knepley   PetscFunctionBegin;
114cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
115cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
1162203a8e9SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr);
117cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
118cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
119a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr);
120cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
121cd0c2139SMatthew G Knepley     pEnd += depthShift[d];
122cd0c2139SMatthew G Knepley     ierr  = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
123a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
124cd0c2139SMatthew G Knepley   }
125cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
126cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
127cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
128cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
129cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
130a6ae58d1SMatthew G. Knepley       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift);
131cd0c2139SMatthew G Knepley       PetscInt size;
132cd0c2139SMatthew G Knepley 
133cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
134cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
135cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
136cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
137cd0c2139SMatthew G Knepley     }
138cd0c2139SMatthew G Knepley   }
139a6ae58d1SMatthew G. Knepley   ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr);
140cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
141cd0c2139SMatthew G Knepley }
142cd0c2139SMatthew G Knepley 
143cd0c2139SMatthew G Knepley #undef __FUNCT__
144cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
145cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
146cd0c2139SMatthew G Knepley {
147a6ae58d1SMatthew G. Knepley   PetscInt      *depthEnd, *depthMax, *newpoints;
148dcbb62e8SMatthew G. Knepley   PetscInt       depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p;
149cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
150cd0c2139SMatthew G Knepley 
151cd0c2139SMatthew G Knepley   PetscFunctionBegin;
152cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
153cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
154cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
155dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
1562203a8e9SMatthew G. Knepley   ierr = PetscMalloc3(depth+1,&depthEnd,depth+1,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr);
157a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr);
158cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
159cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
160a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
161cd0c2139SMatthew G Knepley   }
162cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
163cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
164cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
165cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
166a6ae58d1SMatthew G. Knepley     PetscInt        size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift);
167cd0c2139SMatthew G Knepley 
168cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
169cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
170cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
171cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
172a6ae58d1SMatthew G. Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift);
173cd0c2139SMatthew G Knepley     }
174cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
175cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
176cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
177dcbb62e8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr);
178cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
179cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
180a6ae58d1SMatthew G. Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift);
181cd0c2139SMatthew G Knepley     }
182dcbb62e8SMatthew G. Knepley     for (i = size; i < sizeNew; ++i) newpoints[i] = 0;
183cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
184cd0c2139SMatthew G Knepley   }
185a6ae58d1SMatthew G. Knepley   ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr);
186cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
187cd0c2139SMatthew G Knepley }
188cd0c2139SMatthew G Knepley 
189cd0c2139SMatthew G Knepley #undef __FUNCT__
190cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
191cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
192cd0c2139SMatthew G Knepley {
193cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
194cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
195cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
196cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, coordSize;
197cd0c2139SMatthew G Knepley   PetscInt       dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v;
198cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
199cd0c2139SMatthew G Knepley 
200cd0c2139SMatthew G Knepley   PetscFunctionBegin;
201cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
202cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
203785e854fSJed Brown   ierr = PetscMalloc1((depth+1), &depthEnd);CHKERRQ(ierr);
204cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
205cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
206cd0c2139SMatthew G Knepley   }
207cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
208cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
209cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
21069d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
211cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
212cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
213cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
214cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
215cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
216cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
217cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
218cd0c2139SMatthew G Knepley   }
219cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
22069d8a9ceSMatthew G. Knepley   ierr = DMSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr);
221cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
222cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
223cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
224cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2252eb5907fSJed Brown   ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr);
226cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
227cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
228cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
229cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
230cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
231cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
232cd0c2139SMatthew G Knepley 
233cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
234cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
235a6ae58d1SMatthew G. Knepley     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr);
236cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
237cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
238cd0c2139SMatthew G Knepley     }
239cd0c2139SMatthew G Knepley   }
240cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
241cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
242cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
243cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
244cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
245cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
246cd0c2139SMatthew G Knepley }
247cd0c2139SMatthew G Knepley 
248cd0c2139SMatthew G Knepley #undef __FUNCT__
249cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
250cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
251cd0c2139SMatthew G Knepley {
252a6ae58d1SMatthew G. Knepley   PetscInt          *depthMax, *depthEnd;
253cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d;
254cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
255cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
256cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
257cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
258cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
259cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
260cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
261cd0c2139SMatthew G Knepley 
262cd0c2139SMatthew G Knepley   PetscFunctionBegin;
263cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2642203a8e9SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr);
265a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr);
266cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
267cd0c2139SMatthew G Knepley     totShift += depthShift[d];
268cd0c2139SMatthew G Knepley     ierr      = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
269a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
270cd0c2139SMatthew G Knepley   }
271cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
272cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
273cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
274cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
275cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
276cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
277dcca6d9dSJed Brown     ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr);
278a6ae58d1SMatthew G. Knepley     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift);
279cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
280cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
281785e854fSJed Brown     ierr = PetscMalloc1(numLeaves,    &glocalPoints);CHKERRQ(ierr);
282785e854fSJed Brown     ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr);
283cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
284a6ae58d1SMatthew G. Knepley       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift);
285cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
286cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
287cd0c2139SMatthew G Knepley     }
288cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
289cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
290cd0c2139SMatthew G Knepley   }
291a6ae58d1SMatthew G. Knepley   ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr);
292cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
293cd0c2139SMatthew G Knepley }
294cd0c2139SMatthew G Knepley 
295cd0c2139SMatthew G Knepley #undef __FUNCT__
296cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
297cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
298cd0c2139SMatthew G Knepley {
299cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
300cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
301a6ae58d1SMatthew G. Knepley   PetscInt          *depthMax, *depthEnd;
302cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
303cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
304cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
305cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
306cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
307cd0c2139SMatthew G Knepley 
308cd0c2139SMatthew G Knepley   PetscFunctionBegin;
309cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3102203a8e9SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr);
311a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr);
312cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
313cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
314a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
315cd0c2139SMatthew G Knepley   }
316cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
317cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
318cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
319cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
320cd0c2139SMatthew G Knepley     const char     *lname;
321cd0c2139SMatthew G Knepley     PetscBool       isDepth;
322cd0c2139SMatthew G Knepley     IS              valueIS;
323cd0c2139SMatthew G Knepley     const PetscInt *values;
324cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
325cd0c2139SMatthew G Knepley 
326cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
327cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
328cd0c2139SMatthew G Knepley     if (isDepth) continue;
329cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
330cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
331cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
332cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
333cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
334cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
335cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
336cd0c2139SMatthew G Knepley       IS              pointIS;
337cd0c2139SMatthew G Knepley       const PetscInt *points;
338cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
339cd0c2139SMatthew G Knepley 
340cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
341cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
342cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
343cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
344a6ae58d1SMatthew G. Knepley         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift);
345cd0c2139SMatthew G Knepley 
346cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
347cd0c2139SMatthew G Knepley       }
348cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
349cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
350cd0c2139SMatthew G Knepley     }
351cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
352cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
353cd0c2139SMatthew G Knepley   }
354a6ae58d1SMatthew G. Knepley   ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr);
355cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
356cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
357cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
358cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
359cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
360cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
361cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
362cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
363cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
364cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
365cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
366cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
367cd0c2139SMatthew G Knepley     }
368cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
369cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
370cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
371cd0c2139SMatthew G Knepley     } else {
372cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
373cd0c2139SMatthew G Knepley     }
374cd0c2139SMatthew G Knepley   }
375cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
376cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
377cd0c2139SMatthew G Knepley   }
378cd0c2139SMatthew G Knepley   if (0) {
379cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
380cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
381cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
382cd0c2139SMatthew G Knepley   }
383cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
384cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
385cd0c2139SMatthew G Knepley     PetscInt numCells;
386cd0c2139SMatthew G Knepley 
387cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
388cd0c2139SMatthew G Knepley     if (numCells < 2) {
389cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
390cd0c2139SMatthew G Knepley     } else {
391cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
392cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
393cd0c2139SMatthew G Knepley 
394cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
395cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
396cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
397cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
398cd0c2139SMatthew G Knepley     }
399cd0c2139SMatthew G Knepley   }
400cd0c2139SMatthew G Knepley   if (0) {
401cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
402cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
403cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
404cd0c2139SMatthew G Knepley   }
405cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
406cd0c2139SMatthew G Knepley }
407cd0c2139SMatthew G Knepley 
408cd0c2139SMatthew G Knepley #undef __FUNCT__
409cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
410cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
411cd0c2139SMatthew G Knepley {
412cd0c2139SMatthew G Knepley   IS              valueIS;
413cd0c2139SMatthew G Knepley   const PetscInt *values;
414cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
41546c796b9SMatthew G. Knepley   PetscInt        depth = 0, numFS, fs, fStart, fEnd, ghostCell, cEnd, c;
416cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
417cd0c2139SMatthew G Knepley 
418cd0c2139SMatthew G Knepley   PetscFunctionBegin;
41946c796b9SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
420cd0c2139SMatthew G Knepley   /* Count ghost cells */
421cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
422cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
423cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
424cd0c2139SMatthew G Knepley   *numGhostCells = 0;
425cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
42646c796b9SMatthew G. Knepley     IS              faceIS;
42746c796b9SMatthew G. Knepley     const PetscInt *faces;
42846c796b9SMatthew G. Knepley     PetscInt        numFaces, f, numBdFaces = 0;
429cd0c2139SMatthew G Knepley 
43046c796b9SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
43146c796b9SMatthew G. Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
43246c796b9SMatthew G. Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
43346c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
43446c796b9SMatthew G. Knepley       if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces;
43546c796b9SMatthew G. Knepley     }
436cd0c2139SMatthew G Knepley     *numGhostCells += numBdFaces;
43746c796b9SMatthew G. Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
438cd0c2139SMatthew G Knepley   }
439cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
440785e854fSJed Brown   ierr = PetscMalloc1((depth+1), &depthShift);CHKERRQ(ierr);
441cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
442cd0c2139SMatthew G Knepley   if (depth >= 0) depthShift[depth] = *numGhostCells;
443cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
444cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
445cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
446cd0c2139SMatthew G Knepley   for (c = cEnd; c < cEnd + *numGhostCells; ++c) {
447cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
448cd0c2139SMatthew G Knepley   }
449cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
450cd0c2139SMatthew G Knepley     IS              faceIS;
451cd0c2139SMatthew G Knepley     const PetscInt *faces;
452cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
453cd0c2139SMatthew G Knepley 
454cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
455cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
456cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
457cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
458cd0c2139SMatthew G Knepley       PetscInt size;
459cd0c2139SMatthew G Knepley 
46046c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
461cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
462cd0c2139SMatthew G Knepley       if (size != 1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "DM has boundary face %d with %d support cells", faces[f], size);
463cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr);
464cd0c2139SMatthew G Knepley     }
465cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
466cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
467cd0c2139SMatthew G Knepley   }
468cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
469cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
470cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
471cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
472cd0c2139SMatthew G Knepley   ghostCell = cEnd;
473cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
474cd0c2139SMatthew G Knepley     IS              faceIS;
475cd0c2139SMatthew G Knepley     const PetscInt *faces;
476cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
477cd0c2139SMatthew G Knepley 
478cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
479cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
480cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
48146c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
482cd0c2139SMatthew G Knepley       PetscInt newFace = faces[f] + *numGhostCells;
483cd0c2139SMatthew G Knepley 
48446c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
485cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
486cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
48746c796b9SMatthew G. Knepley       ++ghostCell;
488cd0c2139SMatthew G Knepley     }
489cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
490cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
491cd0c2139SMatthew G Knepley   }
492cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
493cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
494cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
495cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
496cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
497cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
498cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
499cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
500cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
501cd0c2139SMatthew G Knepley }
502cd0c2139SMatthew G Knepley 
503cd0c2139SMatthew G Knepley #undef __FUNCT__
504cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
505cd0c2139SMatthew G Knepley /*@C
506cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
507cd0c2139SMatthew G Knepley 
508cd0c2139SMatthew G Knepley   Collective on dm
509cd0c2139SMatthew G Knepley 
510cd0c2139SMatthew G Knepley   Input Parameters:
511cd0c2139SMatthew G Knepley + dm - The original DM
512cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
513cd0c2139SMatthew G Knepley 
514cd0c2139SMatthew G Knepley   Output Parameters:
515cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
516cd0c2139SMatthew G Knepley - dmGhosted - The new DM
517cd0c2139SMatthew G Knepley 
518cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
519cd0c2139SMatthew G Knepley 
520cd0c2139SMatthew G Knepley   Level: developer
521cd0c2139SMatthew G Knepley 
522cd0c2139SMatthew G Knepley .seealso: DMCreate()
52331266bc0SMatthew G. Knepley @*/
524cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
525cd0c2139SMatthew G Knepley {
526cd0c2139SMatthew G Knepley   DM             gdm;
527cd0c2139SMatthew G Knepley   DMLabel        label;
528cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
529cd0c2139SMatthew G Knepley   PetscInt       dim;
530*a42b08eeSMatthew G. Knepley   PetscBool      flag;
531cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
532cd0c2139SMatthew G Knepley 
533cd0c2139SMatthew G Knepley   PetscFunctionBegin;
534cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
535cd0c2139SMatthew G Knepley   PetscValidPointer(numGhostCells, 3);
536cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
537cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
538cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
539cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
540cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr);
541*a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
542*a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
543*a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
544*a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
545cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
546cd0c2139SMatthew G Knepley   if (!label) {
547cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
548cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
549cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
550cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
551cd0c2139SMatthew G Knepley   }
552cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
553cd0c2139SMatthew G Knepley   ierr = DMSetFromOptions(gdm);CHKERRQ(ierr);
554cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
555cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
556cd0c2139SMatthew G Knepley }
557cd0c2139SMatthew G Knepley 
558cd0c2139SMatthew G Knepley #undef __FUNCT__
559cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
560607ab7a9SMatthew G. Knepley /*
561faedd622SMatthew G. Knepley   We are adding three kinds of points here:
562607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
563faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
564607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
565a6ae58d1SMatthew G. Knepley 
566a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
567a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
568607ab7a9SMatthew G. Knepley */
569cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
570cd0c2139SMatthew G Knepley {
571cd0c2139SMatthew G Knepley   MPI_Comm         comm;
572607ab7a9SMatthew G. Knepley   IS               valueIS;
573607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
574607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
57518c5995bSMatthew G. Knepley   IS              *splitIS;
57618c5995bSMatthew G. Knepley   IS              *unsplitIS;
577607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
57818c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
57936dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
58036dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
581607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
58218c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
583cd0c2139SMatthew G Knepley   PetscSection     coordSection;
584cd0c2139SMatthew G Knepley   Vec              coordinates;
585cd0c2139SMatthew G Knepley   PetscScalar     *coords;
586607ab7a9SMatthew G. Knepley   PetscInt         depths[4];          /* Depths in the order that plex points are numbered */
587a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
588a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
589607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
590607ab7a9SMatthew G. Knepley   PetscInt        *depthOffset;        /* Prefix sums of depthShift */
591607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
592607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
59318c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
594cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
595cd0c2139SMatthew G Knepley 
596cd0c2139SMatthew G Knepley   PetscFunctionBegin;
597cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
598cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
599607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
600fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
601607ab7a9SMatthew G. Knepley   depths[0] = depth;
602607ab7a9SMatthew G. Knepley   depths[1] = 0;
603607ab7a9SMatthew G. Knepley   depths[2] = depth-1;
604607ab7a9SMatthew G. Knepley   depths[3] = 1;
605cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
606607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
6072203a8e9SMatthew G. Knepley   ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
608dcca6d9dSJed Brown   ierr = PetscMalloc7(depth+1,&splitIS,depth+1,&unsplitIS,depth+1,&numSplitPoints,depth+1,&numUnsplitPoints,depth+1,&numHybridPoints,depth+1,&splitPoints,depth+1,&unsplitPoints);CHKERRQ(ierr);
609607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthShift,  (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
610607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
611a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr);
612607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
613607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
614a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
615a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
616607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
61718c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
618607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
619a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
620607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
62118c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
62218c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
62318c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
624607ab7a9SMatthew G. Knepley   }
625cd0c2139SMatthew G Knepley   if (label) {
626cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
627cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
628cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
629cd0c2139SMatthew G Knepley   }
630cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
631cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
632cd0c2139SMatthew G Knepley 
633cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
63418c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
63518c5995bSMatthew G. Knepley     if (splitIS[dep]) {
63618c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
63718c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
63818c5995bSMatthew G. Knepley     }
63918c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
64018c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
64118c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
64218c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
643cd0c2139SMatthew G Knepley     }
644cd0c2139SMatthew G Knepley   }
645607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
64618c5995bSMatthew G. Knepley   for (d = 1; d <= depth; ++d) numHybridPoints[d]     = numSplitPoints[d-1] + numUnsplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex   */
647607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) depthShift[d]          = numSplitPoints[d] + numHybridPoints[d];
648607ab7a9SMatthew G. Knepley   for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]];
649a6ae58d1SMatthew G. Knepley   for (d = 0; d <= depth; ++d) pMaxNew[d]            += depthOffset[d] - numHybridPointsOld[d];
650cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
651cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
652cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
653cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
654cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
655a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
6564c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
657cd0c2139SMatthew G Knepley       const PetscInt *support;
6584c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
659cd0c2139SMatthew G Knepley 
660cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
661cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
662cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
663cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
664cd0c2139SMatthew G Knepley       if (dep == depth-1) {
6654c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
6664c367dbcSMatthew G. Knepley 
667cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
6684c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
669cd0c2139SMatthew G Knepley       } else if (dep == 0) {
6704c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
671cd0c2139SMatthew G Knepley 
672cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
6734c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
674cd0c2139SMatthew G Knepley           PetscInt val;
675cd0c2139SMatthew G Knepley 
676cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
6774c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
6784c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
6794c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
680cd0c2139SMatthew G Knepley         }
6814c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
6824c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
6834c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
6844c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
6854c367dbcSMatthew G. Knepley         /* Add hybrid edge */
6864c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
6874c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
688cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
6894c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
6904c367dbcSMatthew G. Knepley 
691cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
6924c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
693cd0c2139SMatthew G Knepley           PetscInt val;
694cd0c2139SMatthew G Knepley 
695cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
6964c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
6974c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
6984c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
699cd0c2139SMatthew G Knepley         }
7004c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
7014c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
7024c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
7034c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
7044c367dbcSMatthew G. Knepley         /* Add hybrid face */
7054c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
7064c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
707cd0c2139SMatthew G Knepley       }
708cd0c2139SMatthew G Knepley     }
709cd0c2139SMatthew G Knepley   }
71018c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
71118c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
71218c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
713a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
71418c5995bSMatthew G. Knepley       const PetscInt *support;
715da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
71618c5995bSMatthew G. Knepley 
71718c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
71818c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
71939254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
72018c5995bSMatthew G. Knepley       if (dep == 0) {
72118c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
72218c5995bSMatthew G. Knepley 
72339254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
72439254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
72539254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
72639254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
72739254ff6SMatthew G. Knepley         }
72839254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
72918c5995bSMatthew G. Knepley         /* Add hybrid edge */
73018c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
731e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
732e1757548SMatthew G. Knepley           PetscInt val;
733e1757548SMatthew G. Knepley 
734e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
735e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
736da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
737da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
738e1757548SMatthew G. Knepley         }
739e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
74018c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
74118c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
742cd0c2139SMatthew G Knepley         PetscInt       val;
743cd0c2139SMatthew G Knepley 
744da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
745cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
746da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
747da1dd7e4SMatthew G. Knepley           else              ++qf;
748cd0c2139SMatthew G Knepley         }
74918c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
750da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
75118c5995bSMatthew G. Knepley         /* Add hybrid face */
752da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
753da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
754da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
755da1dd7e4SMatthew G. Knepley         }
75618c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
757da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
758cd0c2139SMatthew G Knepley       }
759cd0c2139SMatthew G Knepley     }
760cd0c2139SMatthew G Knepley   }
761cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
762cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
763cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
764dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
765dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
766cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
767cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
768cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
769cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
770a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
7714c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
772cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
7734c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
774cd0c2139SMatthew G Knepley 
775cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
776cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
777cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
778cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
779cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
780cd0c2139SMatthew G Knepley       if (dep == depth-1) {
78196a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
7824c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
783cd0c2139SMatthew G Knepley         const PetscInt *supportF;
784cd0c2139SMatthew G Knepley 
785cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
786cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
787cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
788cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
789cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
790cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
7914c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
79218c5995bSMatthew G. Knepley           if (v < 0) {
79318c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
79418c5995bSMatthew G. Knepley             if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1);
795a6ae58d1SMatthew G. Knepley             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/;
79696a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
79718c5995bSMatthew G. Knepley           } else {
7984c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
799163235baSMatthew G. Knepley             if (dep > 1) {
800163235baSMatthew G. Knepley               const PetscInt *econe;
801163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
802163235baSMatthew G. Knepley 
803163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
804163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
805163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
806163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
807163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
808163235baSMatthew G. Knepley                 if (vs >= 0) continue;
809163235baSMatthew G. Knepley                 if (vu < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", econe[r], dep-2);
810163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
811163235baSMatthew G. Knepley               }
812163235baSMatthew G. Knepley             }
813cd0c2139SMatthew G Knepley           }
814cd0c2139SMatthew G Knepley         }
815cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
816cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
817e537020bSMatthew G. Knepley         /* Face support */
818cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
819cd0c2139SMatthew G Knepley           PetscInt val;
820cd0c2139SMatthew G Knepley 
821cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
822cd0c2139SMatthew G Knepley           if (val < 0) {
823cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
8244c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
825cd0c2139SMatthew G Knepley           } else {
826cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
8274c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
828e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
829e537020bSMatthew G. Knepley             {
830e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
831e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
832e537020bSMatthew G. Knepley 
833e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
834e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
835e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
836e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
837e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
838e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
839e537020bSMatthew G. Knepley                   break;
840cd0c2139SMatthew G Knepley                 }
841cd0c2139SMatthew G Knepley               }
842e537020bSMatthew G. Knepley               if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]);
843e537020bSMatthew G. Knepley             }
844e537020bSMatthew G. Knepley           }
845e537020bSMatthew G. Knepley         }
8464c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
847fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
8484c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
8494c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
850e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
85118c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
85218c5995bSMatthew G. Knepley           if (v < 0) {
85318c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
85418c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
85518c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
85618c5995bSMatthew G. Knepley           } else {
85718c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
85818c5995bSMatthew G. Knepley           }
859e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
860e537020bSMatthew G. Knepley         }
8614c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
8624c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
86396a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
86496a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
865cd0c2139SMatthew G Knepley       } else if (dep == 0) {
8664c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
867cd0c2139SMatthew G Knepley 
868cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
8694c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
870cd0c2139SMatthew G Knepley           PetscInt val;
871cd0c2139SMatthew G Knepley 
872cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
873cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
874a6ae58d1SMatthew G. Knepley             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
875cd0c2139SMatthew G Knepley           }
876cd0c2139SMatthew G Knepley         }
8774c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
878cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
879cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
8804c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
881cd0c2139SMatthew G Knepley           PetscInt val, edge;
882cd0c2139SMatthew G Knepley 
883cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
884cd0c2139SMatthew G Knepley           if (val == 1) {
8854c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
886cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
8874c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
888cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
889a6ae58d1SMatthew G. Knepley             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
890cd0c2139SMatthew G Knepley           }
891cd0c2139SMatthew G Knepley         }
8924c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
893cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
8944c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
895cd0c2139SMatthew G Knepley         coneNew[0] = newp;
896cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
8974c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
8984c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
8994c367dbcSMatthew G. Knepley           PetscInt val, edge;
9004c367dbcSMatthew G. Knepley 
9014c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9024c367dbcSMatthew G. Knepley           if (val == 1) {
9034c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
9044c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
9054c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
9064c367dbcSMatthew G. Knepley           }
9074c367dbcSMatthew G. Knepley         }
9084c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
909cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
9104c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
9114c367dbcSMatthew G. Knepley 
912cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
913cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
914cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
9154c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
916e1757548SMatthew G. Knepley           if (v < 0) {
917e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
918e1757548SMatthew G. Knepley             if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1);
919a6ae58d1SMatthew G. Knepley             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/;
920e1757548SMatthew G. Knepley           } else {
9214c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
922cd0c2139SMatthew G Knepley           }
923e1757548SMatthew G. Knepley         }
924cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
925cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
926cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
927cd0c2139SMatthew G Knepley           PetscInt val;
928cd0c2139SMatthew G Knepley 
929cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9304c367dbcSMatthew G. Knepley           if (val == dim-1) {
931a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
9324c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
933a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
934cd0c2139SMatthew G Knepley           }
935cd0c2139SMatthew G Knepley         }
936b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
937cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
938cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
939cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
940cd0c2139SMatthew G Knepley           PetscInt val, face;
941cd0c2139SMatthew G Knepley 
942cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
943cd0c2139SMatthew G Knepley           if (val == dim-1) {
9444c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
945cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
9464c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
947cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
948a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
949cd0c2139SMatthew G Knepley           }
950cd0c2139SMatthew G Knepley         }
951b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
952cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
9534c367dbcSMatthew G. Knepley         /* Hybrid face */
9544c367dbcSMatthew G. Knepley         coneNew[0] = newp;
9554c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
9564c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
9574c367dbcSMatthew G. Knepley           PetscInt vertex;
9584c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
959e1757548SMatthew G. Knepley           if (vertex < 0) {
960e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
961e1757548SMatthew G. Knepley             if (vertex < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[v], dep-1);
962e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
963e1757548SMatthew G. Knepley           } else {
9644c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
9654c367dbcSMatthew G. Knepley           }
966e1757548SMatthew G. Knepley         }
9674c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
9684c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
9694c367dbcSMatthew G. Knepley           PetscInt val, face;
9704c367dbcSMatthew G. Knepley 
9714c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9724c367dbcSMatthew G. Knepley           if (val == dim-1) {
9734c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
9744c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
9754c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
9764c367dbcSMatthew G. Knepley           }
9774c367dbcSMatthew G. Knepley         }
9784c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
979cd0c2139SMatthew G Knepley       }
980cd0c2139SMatthew G Knepley     }
981cd0c2139SMatthew G Knepley   }
98218c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
98318c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
98418c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
985a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
98618c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
987e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
98818c5995bSMatthew G. Knepley 
98918c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
99018c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
99118c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
99218c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
99318c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
99418c5995bSMatthew G. Knepley       if (dep == 0) {
99518c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
99618c5995bSMatthew G. Knepley 
99718c5995bSMatthew G. Knepley         /* Unsplit vertex */
99818c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
99918c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
1000a6ae58d1SMatthew G. Knepley           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/;
100118c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
100218c5995bSMatthew G. Knepley           if (e >= 0) {
100318c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
100418c5995bSMatthew G. Knepley           }
100518c5995bSMatthew G. Knepley         }
100618c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
100718c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
100818c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
100918c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
101018c5995bSMatthew G. Knepley         /* Hybrid edge */
101118c5995bSMatthew G. Knepley         coneNew[0] = newp;
101218c5995bSMatthew G. Knepley         coneNew[1] = newp;
101318c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
101418c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
101518c5995bSMatthew G. Knepley           PetscInt val, edge;
101618c5995bSMatthew G. Knepley 
101718c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
101818c5995bSMatthew G. Knepley           if (val == 1) {
101918c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
102018c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
102118c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1022e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1023e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1024e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1025e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
102618c5995bSMatthew G. Knepley           }
102718c5995bSMatthew G. Knepley         }
102818c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1029e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1030e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1031e1757548SMatthew G. Knepley 
1032da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1033e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1034e1757548SMatthew G. Knepley           PetscInt val, face;
1035e1757548SMatthew G. Knepley 
1036e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1037e1757548SMatthew G. Knepley           if (val == dim-1) {
1038e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1039e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
1040a6ae58d1SMatthew G. Knepley             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/;
1041e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1042e1757548SMatthew G. Knepley           } else {
1043a6ae58d1SMatthew G. Knepley             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/;
1044e1757548SMatthew G. Knepley           }
1045e1757548SMatthew G. Knepley         }
1046e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1047e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1048da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1049da1dd7e4SMatthew G. Knepley         if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for unsplit edge %d is %d != %d\n", newp, qf, supportSizeNew);
1050e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1051e1757548SMatthew G. Knepley         /* Add hybrid face */
1052e1757548SMatthew G. Knepley         coneNew[0] = newp;
1053e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1054e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]);
1055e1757548SMatthew G. Knepley         coneNew[1] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1056e1757548SMatthew G. Knepley         coneNew[2] = newp;
1057e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1058e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1059e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1060e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1061da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1062da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1063da1dd7e4SMatthew G. Knepley 
1064da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1065da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1066da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1067da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1068da1dd7e4SMatthew G. Knepley           }
1069da1dd7e4SMatthew G. Knepley         }
1070da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1071da1dd7e4SMatthew G. Knepley         if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for hybrid face %d is %d != %d\n", hybface, qf, supportSizeNew);
1072e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1073cd0c2139SMatthew G Knepley       }
1074cd0c2139SMatthew G Knepley     }
1075cd0c2139SMatthew G Knepley   }
1076cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1077cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1078cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1079cd0c2139SMatthew G Knepley     IS              pIS;
1080cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1081cd0c2139SMatthew G Knepley     const PetscInt *points;
1082cd0c2139SMatthew G Knepley 
1083cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1084cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1085cd0c2139SMatthew G Knepley     if (!pIS) continue;
1086cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1087cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1088cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1089cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1090cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
1091a6ae58d1SMatthew G. Knepley       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/;
1092cd0c2139SMatthew G Knepley       const PetscInt *cone;
1093cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
109450cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1095cd0c2139SMatthew G Knepley 
1096cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1097cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1098cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1099cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1100cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1101cd0c2139SMatthew G Knepley         const PetscInt coldp = cone[c] - depthOffset[dep-1];
1102cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1103cd0c2139SMatthew G Knepley 
1104cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1105cd0c2139SMatthew G Knepley         if (val == dep-1) {
1106cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1107cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1108cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1109cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
111050cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1111cd0c2139SMatthew G Knepley         }
1112cd0c2139SMatthew G Knepley       }
11134a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
11144a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1115cd0c2139SMatthew G Knepley     }
1116cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1117cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1118cd0c2139SMatthew G Knepley   }
1119cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1120cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1121cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1122cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
112369d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1124cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1125cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1126cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
1127a6ae58d1SMatthew G. Knepley     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1128cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1129cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1130cd0c2139SMatthew G Knepley 
1131cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1132cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1133cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1134cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1135cd0c2139SMatthew G Knepley   }
1136cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1137cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1138cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1139cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1140cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1141cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1142cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1143cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
1144a6ae58d1SMatthew G. Knepley       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1145cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1146cd0c2139SMatthew G Knepley       PetscInt       l;
1147cd0c2139SMatthew G Knepley 
1148cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1149cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1150cd0c2139SMatthew G Knepley         const char *lname;
1151cd0c2139SMatthew G Knepley         PetscInt    val;
11529a356370SMatthew G. Knepley         PetscBool   isDepth;
1153cd0c2139SMatthew G Knepley 
1154cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
11559a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
11569a356370SMatthew G. Knepley         if (isDepth) continue;
1157cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1158cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1159cd0c2139SMatthew G Knepley         if (val >= 0) {
1160cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
11619a356370SMatthew G. Knepley #if 0
11629a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
1163cd0c2139SMatthew G Knepley           if (dep == 0) {
11644c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1165cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
11664c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
11674c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
11684c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
1169cd0c2139SMatthew G Knepley           }
11704c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
11719a356370SMatthew G. Knepley #endif
1172cd0c2139SMatthew G Knepley         }
1173cd0c2139SMatthew G Knepley       }
1174cd0c2139SMatthew G Knepley     }
1175cd0c2139SMatthew G Knepley   }
1176cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1177cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1178cd0c2139SMatthew G Knepley 
1179cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
118018c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
118118c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
118218c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
118318c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1184cd0c2139SMatthew G Knepley   }
1185cd0c2139SMatthew G Knepley   if (label) {
1186cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1187cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1188cd0c2139SMatthew G Knepley   }
11890d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
11900d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
119136dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
11920d4d4d06SMatthew G. Knepley   }
11930e49e2e2SMatthew G. Knepley   ierr = DMPlexSetHybridBounds(sdm, depth >= 0 ? pMaxNew[depth] : PETSC_DETERMINE, depth>1 ? pMaxNew[depth-1] : PETSC_DETERMINE, depth>2 ? pMaxNew[1] : PETSC_DETERMINE, depth >= 0 ? pMaxNew[0] : PETSC_DETERMINE);CHKERRQ(ierr);
1194dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
1195a6ae58d1SMatthew G. Knepley   ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
119618c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1197cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1198cd0c2139SMatthew G Knepley }
1199cd0c2139SMatthew G Knepley 
1200cd0c2139SMatthew G Knepley #undef __FUNCT__
1201cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
1202cd0c2139SMatthew G Knepley /*@C
1203cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1204cd0c2139SMatthew G Knepley 
1205cd0c2139SMatthew G Knepley   Collective on dm
1206cd0c2139SMatthew G Knepley 
1207cd0c2139SMatthew G Knepley   Input Parameters:
1208cd0c2139SMatthew G Knepley + dm - The original DM
120953156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1210cd0c2139SMatthew G Knepley 
1211cd0c2139SMatthew G Knepley   Output Parameters:
1212cd0c2139SMatthew G Knepley - dmSplit - The new DM
1213cd0c2139SMatthew G Knepley 
1214cd0c2139SMatthew G Knepley   Level: developer
1215cd0c2139SMatthew G Knepley 
12162be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1217cd0c2139SMatthew G Knepley @*/
1218cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1219cd0c2139SMatthew G Knepley {
1220cd0c2139SMatthew G Knepley   DM             sdm;
1221cd0c2139SMatthew G Knepley   PetscInt       dim;
1222cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1223cd0c2139SMatthew G Knepley 
1224cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1225cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
122653156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1227cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1228cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1229cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1230cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr);
1231cd0c2139SMatthew G Knepley   switch (dim) {
1232cd0c2139SMatthew G Knepley   case 2:
1233cd0c2139SMatthew G Knepley   case 3:
1234cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1235cd0c2139SMatthew G Knepley     break;
1236cd0c2139SMatthew G Knepley   default:
1237cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1238cd0c2139SMatthew G Knepley   }
1239cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1240cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1241cd0c2139SMatthew G Knepley }
1242cd0c2139SMatthew G Knepley 
1243cd0c2139SMatthew G Knepley #undef __FUNCT__
12442be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1245cd0c2139SMatthew G Knepley /*@
12462be2b188SMatthew G Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces
1247cd0c2139SMatthew G Knepley   to complete the surface
1248cd0c2139SMatthew G Knepley 
1249cd0c2139SMatthew G Knepley   Input Parameters:
1250cd0c2139SMatthew G Knepley + dm - The DM
125147946fd8SMatthew G. Knepley . label - A DMLabel marking the surface vertices
1252bb55d314SMatthew G. Knepley . flip  - Flag to flip the submesh normal and replace points on the other side
125347946fd8SMatthew G. Knepley - subdm - The subDM associated with the label, or NULL
1254cd0c2139SMatthew G Knepley 
1255cd0c2139SMatthew G Knepley   Output Parameter:
1256cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1257cd0c2139SMatthew G Knepley 
1258cd0c2139SMatthew G Knepley   Level: developer
1259cd0c2139SMatthew G Knepley 
12602be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1261cd0c2139SMatthew G Knepley @*/
1262bb55d314SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, PetscBool flip, DM subdm)
1263cd0c2139SMatthew G Knepley {
1264d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
126518c5995bSMatthew G. Knepley   IS              dimIS, subpointIS, facePosIS, faceNegIS;
126647946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1267bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
126818c5995bSMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, dep, cStart, cEnd, numPoints, numSubpoints, p, val;
1269cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1270cd0c2139SMatthew G Knepley 
1271cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1272d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1273cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
127447946fd8SMatthew G. Knepley   if (subdm) {
127547946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
127647946fd8SMatthew G. Knepley     if (subpointIS) {
127747946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
127847946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
127947946fd8SMatthew G. Knepley     }
128047946fd8SMatthew G. Knepley   }
1281d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1282cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1283cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1284cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1285cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1286d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1287cd0c2139SMatthew G Knepley     const PetscInt *support;
1288cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1289cd0c2139SMatthew G Knepley 
1290cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1291cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1292cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1293cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
1294cd0c2139SMatthew G Knepley       const PetscInt *cone, *ornt;
1295cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
1296cd0c2139SMatthew G Knepley       PetscBool       pos = PETSC_TRUE;
1297cd0c2139SMatthew G Knepley 
1298cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1299cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1300cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr);
1301cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1302cd0c2139SMatthew G Knepley         if (cone[c] == points[p]) {
130347946fd8SMatthew G. Knepley           PetscInt o = ornt[c];
130447946fd8SMatthew G. Knepley 
130547946fd8SMatthew G. Knepley           if (subdm) {
130647946fd8SMatthew G. Knepley             const PetscInt *subcone, *subornt;
130747946fd8SMatthew G. Knepley             PetscInt        subpoint, subface, subconeSize, sc;
130847946fd8SMatthew G. Knepley 
130947946fd8SMatthew G. Knepley             ierr = PetscFindInt(support[s], numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
131047946fd8SMatthew G. Knepley             ierr = PetscFindInt(points[p],  numSubpoints, subpoints, &subface);CHKERRQ(ierr);
131147946fd8SMatthew G. Knepley             ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
131247946fd8SMatthew G. Knepley             ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
131347946fd8SMatthew G. Knepley             ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
131447946fd8SMatthew G. Knepley             for (sc = 0; sc < subconeSize; ++sc) {
131547946fd8SMatthew G. Knepley               if (subcone[sc] == subface) {
131647946fd8SMatthew G. Knepley                 o = subornt[0];
131747946fd8SMatthew G. Knepley                 break;
131847946fd8SMatthew G. Knepley               }
131947946fd8SMatthew G. Knepley             }
132047946fd8SMatthew G. Knepley             if (sc >= subconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find point %d in cone for subpoint %d", points[p], subpoint);
132147946fd8SMatthew G. Knepley           }
132247946fd8SMatthew G. Knepley           if (o >= 0) {
1323bb55d314SMatthew G. Knepley             ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);
1324ffaa4bbcSMatthew G. Knepley             pos  = rev > 0 ? PETSC_TRUE : PETSC_FALSE;
1325cd0c2139SMatthew G Knepley           } else {
1326bb55d314SMatthew G. Knepley             ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);
1327ffaa4bbcSMatthew G. Knepley             pos  = rev > 0 ? PETSC_FALSE : PETSC_TRUE;
1328cd0c2139SMatthew G Knepley           }
1329cd0c2139SMatthew G Knepley           break;
1330cd0c2139SMatthew G Knepley         }
1331cd0c2139SMatthew G Knepley       }
1332cd0c2139SMatthew G Knepley       if (c == coneSize) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell split face %d support does not have it in the cone", points[p]);
1333cd0c2139SMatthew G Knepley       /* Put faces touching the fault in the label */
1334cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1335cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1336cd0c2139SMatthew G Knepley 
1337cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1338cd0c2139SMatthew G Knepley         if (val == -1) {
1339cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1340cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1341cd0c2139SMatthew G Knepley 
1342cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1343cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1344cd0c2139SMatthew G Knepley             const PetscInt clp = closure[cl];
1345cd0c2139SMatthew G Knepley 
1346cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1347cd0c2139SMatthew G Knepley             if ((val >= 0) && (val < dim-1)) {
1348cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1349cd0c2139SMatthew G Knepley               break;
1350cd0c2139SMatthew G Knepley             }
1351cd0c2139SMatthew G Knepley           }
1352cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1353cd0c2139SMatthew G Knepley         }
1354cd0c2139SMatthew G Knepley       }
1355cd0c2139SMatthew G Knepley     }
1356cd0c2139SMatthew G Knepley   }
135747946fd8SMatthew G. Knepley   if (subdm) {
135847946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
135947946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
136047946fd8SMatthew G. Knepley   }
1361cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1362cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1363cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1364cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1365cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
1366cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1367cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1368cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1369d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1370cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
1371cd0c2139SMatthew G Knepley     PetscInt  starSize, s;
1372cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1373cd0c2139SMatthew G Knepley 
1374d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1375cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1376cd0c2139SMatthew G Knepley     while (again) {
1377cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1378cd0c2139SMatthew G Knepley       again = 0;
1379cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1380cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1381cd0c2139SMatthew G Knepley         const PetscInt *cone;
1382cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1383cd0c2139SMatthew G Knepley 
1384cd0c2139SMatthew G Knepley         if ((point < cStart) || (point >= cEnd)) continue;
1385cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1386cd0c2139SMatthew G Knepley         if (val != -1) continue;
1387d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1388cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1389cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1390cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1391cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1392cd0c2139SMatthew G Knepley           if (val != -1) {
1393d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1394166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1395d7c8f101SMatthew G. Knepley 
1396cd0c2139SMatthew G Knepley             if (abs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val);
139737a6de01SMatthew G. Knepley             if (val > 0) side =  1;
139837a6de01SMatthew G. Knepley             else         side = -1;
139937a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1400d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1401d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1402d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1403d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1404d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1405d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1406d7c8f101SMatthew G. Knepley 
1407166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1408166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1409d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1410d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1411d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1412d7c8f101SMatthew G. Knepley 
1413d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1414d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1415d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
141637a6de01SMatthew G. Knepley                 break;
141737a6de01SMatthew G. Knepley               }
1418d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1419cd0c2139SMatthew G Knepley             }
1420cd0c2139SMatthew G Knepley             again = 1;
1421cd0c2139SMatthew G Knepley             break;
1422cd0c2139SMatthew G Knepley           }
1423cd0c2139SMatthew G Knepley         }
1424cd0c2139SMatthew G Knepley       }
1425cd0c2139SMatthew G Knepley     }
1426cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1427cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1428cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1429cd0c2139SMatthew G Knepley 
1430cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1431cd0c2139SMatthew G Knepley       if (val == -1) {
1432cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1433cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1434cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1435cd0c2139SMatthew G Knepley 
1436cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1437cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1438cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1439cd0c2139SMatthew G Knepley 
1440cd0c2139SMatthew G Knepley           if ((spoint < cStart) || (spoint >= cEnd)) continue;
1441cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1442cd0c2139SMatthew G Knepley           if (val == -1) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d in star of %d does not have a valid label", spoint, point);
1443d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1444cd0c2139SMatthew G Knepley           if (val > 0) {
1445cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1446cd0c2139SMatthew G Knepley           } else {
1447cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1448cd0c2139SMatthew G Knepley           }
1449cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1450cd0c2139SMatthew G Knepley           break;
1451cd0c2139SMatthew G Knepley         }
1452cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1453cd0c2139SMatthew G Knepley         if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1454cd0c2139SMatthew G Knepley       }
1455cd0c2139SMatthew G Knepley     }
1456cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1457cd0c2139SMatthew G Knepley   }
1458cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1459cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
146018c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
146118c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
146218c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
146318c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
146418c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
146518c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
146618c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
146718c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
146818c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
146918c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
147018c5995bSMatthew G. Knepley     const PetscInt *support;
147118c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
147218c5995bSMatthew G. Knepley 
147318c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
147418c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
147518c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
147618c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
147718c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
147818c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
147918c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
148018c5995bSMatthew G. Knepley     /* Split the face */
148118c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
148218c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
148318c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1484e1757548SMatthew G. Knepley     /* Label its closure:
1485e1757548SMatthew G. Knepley       unmarked: label as unsplit
1486e1757548SMatthew G. Knepley       incident: relabel as split
1487e1757548SMatthew G. Knepley       split:    do nothing
1488e1757548SMatthew G. Knepley     */
148918c5995bSMatthew G. Knepley     {
149018c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
149118c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
149218c5995bSMatthew G. Knepley 
149318c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
149418c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
149518c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
14968771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
149718c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
149818c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
14998771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1500e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1501e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1502e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1503e1757548SMatthew G. Knepley         }
150418c5995bSMatthew G. Knepley       }
150518c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
150618c5995bSMatthew G. Knepley     }
150718c5995bSMatthew G. Knepley   }
150818c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
150918c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1510cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1511cd0c2139SMatthew G Knepley }
1512cd0c2139SMatthew G Knepley 
1513cd0c2139SMatthew G Knepley #undef __FUNCT__
15143cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
15153cf72582SMatthew G. Knepley /*@C
15163cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
15173cf72582SMatthew G. Knepley 
15183cf72582SMatthew G. Knepley   Collective on dm
15193cf72582SMatthew G. Knepley 
15203cf72582SMatthew G. Knepley   Input Parameters:
15213cf72582SMatthew G. Knepley + dm - The original DM
15223cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
15233cf72582SMatthew G. Knepley 
15243cf72582SMatthew G. Knepley   Output Parameters:
15253cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
15263cf72582SMatthew G. Knepley - dmHybrid - The new DM
15273cf72582SMatthew G. Knepley 
15283cf72582SMatthew G. Knepley   Level: developer
15293cf72582SMatthew G. Knepley 
15303cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
15313cf72582SMatthew G. Knepley @*/
15323cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
15333cf72582SMatthew G. Knepley {
15343cf72582SMatthew G. Knepley   DM             idm;
15353cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
15363cf72582SMatthew G. Knepley   PetscInt       dim;
15373cf72582SMatthew G. Knepley   PetscErrorCode ierr;
15383cf72582SMatthew G. Knepley 
15393cf72582SMatthew G. Knepley   PetscFunctionBegin;
15403cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
15413cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
15423cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
15433cf72582SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
15443cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
15453cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
15463cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
15473cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
15483cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
15493cf72582SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, PETSC_FALSE, idm);CHKERRQ(ierr);
15503cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
15513cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
15523cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
155353aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1554e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1555e6ccafaeSMatthew G Knepley }
1556e6ccafaeSMatthew G Knepley 
1557e6ccafaeSMatthew G Knepley #undef __FUNCT__
1558efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1559efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1560efa14ee0SMatthew G Knepley 
1561efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1562efa14ee0SMatthew G Knepley */
1563830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1564efa14ee0SMatthew G Knepley {
1565fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1566efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
156777d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1568efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1569efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1570efa14ee0SMatthew G Knepley 
1571efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1572efa14ee0SMatthew G Knepley   *numFaces = 0;
1573efa14ee0SMatthew G Knepley   *nFV      = 0;
1574efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1575efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
157677d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1577dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1578d92e47f8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1579efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1580efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1581efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1582efa14ee0SMatthew G Knepley   }
1583efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1584fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1585efa14ee0SMatthew G Knepley   if (subvertexIS) {
1586efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1587efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1588efa14ee0SMatthew G Knepley   }
1589efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1590efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
15910298fd71SBarry Smith     PetscInt      *star   = NULL;
1592efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1593efa14ee0SMatthew G Knepley 
1594efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1595efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1596efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1597efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1598efa14ee0SMatthew G Knepley     }
1599efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1600efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
16010298fd71SBarry Smith       PetscInt      *closure = NULL;
1602efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1603efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1604efa14ee0SMatthew G Knepley 
1605efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
160665560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
160782f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1608efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1609efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1610efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1611efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1612efa14ee0SMatthew G Knepley 
1613efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1614efa14ee0SMatthew G Knepley           ++numCorners;
1615efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1616830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1617efa14ee0SMatthew G Knepley         }
1618efa14ee0SMatthew G Knepley       }
161918ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
162082f516ccSBarry Smith       if (faceSize > *nFV) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
1621efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1622007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1623007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1624007baee2SMatthew G. Knepley 
1625efa14ee0SMatthew G Knepley         ++(*numFaces);
1626efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1627efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1628efa14ee0SMatthew G Knepley         }
1629007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1630007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1631007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1632007baee2SMatthew G. Knepley         }
1633007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1634efa14ee0SMatthew G Knepley       }
1635efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1636efa14ee0SMatthew G Knepley     }
1637efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1638efa14ee0SMatthew G Knepley   }
1639efa14ee0SMatthew G Knepley   if (subvertexIS) {
1640efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1641efa14ee0SMatthew G Knepley   }
1642efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1643efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1644efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1645efa14ee0SMatthew G Knepley }
1646efa14ee0SMatthew G Knepley 
1647efa14ee0SMatthew G Knepley #undef __FUNCT__
1648efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1649830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1650efa14ee0SMatthew G Knepley {
1651efa14ee0SMatthew G Knepley   IS               subvertexIS;
1652efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1653efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1654efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1655efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1656efa14ee0SMatthew G Knepley 
1657efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1658efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1659dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
16600298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1661efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1662efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1663efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1664efa14ee0SMatthew G Knepley   }
1665efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1666830e53efSMatthew G. Knepley   ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1667efa14ee0SMatthew G Knepley   if (subvertexIS) {
1668efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1669efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1670efa14ee0SMatthew G Knepley   }
1671efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1672efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
16730298fd71SBarry Smith     PetscInt      *star   = NULL;
1674efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1675efa14ee0SMatthew G Knepley 
1676efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1677efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1678efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1679efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1680efa14ee0SMatthew G Knepley     }
1681efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1682efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
16830298fd71SBarry Smith       PetscInt      *closure = NULL;
1684efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1685efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1686efa14ee0SMatthew G Knepley 
1687efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1688efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
168982f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1690efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1691efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1692efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1693efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1694efa14ee0SMatthew G Knepley 
1695efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1696efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1697830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1698efa14ee0SMatthew G Knepley         }
1699efa14ee0SMatthew G Knepley       }
1700efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1701efa14ee0SMatthew G Knepley         const PetscInt *support;
1702efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1703efa14ee0SMatthew G Knepley 
1704efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1705efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1706efa14ee0SMatthew G Knepley 
1707efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1708efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1709efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1710efa14ee0SMatthew G Knepley               break;
1711efa14ee0SMatthew G Knepley             }
1712efa14ee0SMatthew G Knepley           }
1713efa14ee0SMatthew G Knepley         }
1714efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1715efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1716efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1717efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1718efa14ee0SMatthew G Knepley         }
1719efa14ee0SMatthew G Knepley       }
1720efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1721efa14ee0SMatthew G Knepley     }
1722efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1723efa14ee0SMatthew G Knepley   }
1724efa14ee0SMatthew G Knepley   if (subvertexIS) {
1725efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1726efa14ee0SMatthew G Knepley   }
1727efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1728efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1729efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1730efa14ee0SMatthew G Knepley }
1731efa14ee0SMatthew G Knepley 
1732efa14ee0SMatthew G Knepley #undef __FUNCT__
1733766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
173427c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm)
1735766ab985SMatthew G. Knepley {
173627c04023SMatthew G. Knepley   DMLabel         label = NULL;
1737766ab985SMatthew G. Knepley   const PetscInt *cone;
173827234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
1739766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
1740766ab985SMatthew G. Knepley 
1741812bfc34SJed Brown   PetscFunctionBegin;
1742c0ed958bSJed Brown   *numFaces = 0;
1743c0ed958bSJed Brown   *nFV = 0;
1744b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1745fed694aaSMatthew G. Knepley   *subCells = NULL;
1746766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1747766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1748766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1749766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
175027c04023SMatthew G. Knepley   if (label) {
175127c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
175227c04023SMatthew G. Knepley       PetscInt val;
175327c04023SMatthew G. Knepley 
175427c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
175527c04023SMatthew G. Knepley       if (val == value) {
175627c04023SMatthew G. Knepley         ++(*numFaces);
175727c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
175827c04023SMatthew G. Knepley       }
175927c04023SMatthew G. Knepley     }
176027c04023SMatthew G. Knepley   } else {
1761766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
176227c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
176327c04023SMatthew G. Knepley   }
1764766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
1765785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
1766766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1767766ab985SMatthew G. Knepley     const PetscInt *cells;
1768766ab985SMatthew G. Knepley     PetscInt        numCells;
1769766ab985SMatthew G. Knepley 
177027c04023SMatthew G. Knepley     if (label) {
177127c04023SMatthew G. Knepley       PetscInt val;
177227c04023SMatthew G. Knepley 
177327c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
177427c04023SMatthew G. Knepley       if (val != value) continue;
177527c04023SMatthew G. Knepley     }
1776766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1777766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
1778766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
1779766ab985SMatthew G. Knepley     }
1780766ab985SMatthew G. Knepley     /* Negative face */
1781766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
178227234c99SMatthew G. Knepley     /* Not true in parallel
178327234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
1784766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
1785766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
178627234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
1787766ab985SMatthew G. Knepley     }
1788766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
1789766ab985SMatthew G. Knepley     /* Positive face is not included */
1790766ab985SMatthew G. Knepley   }
1791766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1792766ab985SMatthew G. Knepley }
1793766ab985SMatthew G. Knepley 
1794766ab985SMatthew G. Knepley #undef __FUNCT__
1795766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
1796b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm)
1797766ab985SMatthew G. Knepley {
179827c04023SMatthew G. Knepley   DMLabel        label = NULL;
1799766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
1800766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
1801766ab985SMatthew G. Knepley   PetscErrorCode ierr;
1802766ab985SMatthew G. Knepley 
1803812bfc34SJed Brown   PetscFunctionBegin;
180427c04023SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1805766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1806766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1807766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1808766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
1809dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
1810b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
1811766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1812766ab985SMatthew G. Knepley     const PetscInt *cone;
1813766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
1814b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
1815766ab985SMatthew G. Knepley 
181627c04023SMatthew G. Knepley     if (label) {
181727c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
181827c04023SMatthew G. Knepley       if (val != value) continue;
181927c04023SMatthew G. Knepley     }
1820766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
1821766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1822b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
1823b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1824b3154360SMatthew G. Knepley     /* Negative face */
1825766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1826766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1827766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
1828766ab985SMatthew G. Knepley 
1829766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
1830766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
1831766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1832766ab985SMatthew G. Knepley           break;
1833766ab985SMatthew G. Knepley         }
1834766ab985SMatthew G. Knepley       }
1835766ab985SMatthew G. Knepley     }
1836766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1837766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
1838766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
1839766ab985SMatthew G. Knepley       const PetscInt *support;
1840766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
1841766ab985SMatthew G. Knepley 
1842766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
1843711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
1844766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
1845766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
1846766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1847766ab985SMatthew G. Knepley       }
1848766ab985SMatthew G. Knepley     }
1849766ab985SMatthew G. Knepley   }
1850766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
1851766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1852766ab985SMatthew G. Knepley }
1853766ab985SMatthew G. Knepley 
1854766ab985SMatthew G. Knepley #undef __FUNCT__
1855e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
1856e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1857e6ccafaeSMatthew G Knepley {
185882f516ccSBarry Smith   MPI_Comm       comm;
1859e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
1860e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
1861e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
1862e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1863e6ccafaeSMatthew G Knepley 
186482f516ccSBarry Smith   PetscFunctionBegin;
186582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1866e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr);
1867e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
1868e6ccafaeSMatthew G Knepley 
1869ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
1870ddeab2a6SMatthew G. Knepley     /* Triangle */
1871e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
1872e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1873ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
1874ddeab2a6SMatthew G. Knepley     /* Triangle */
1875ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1876ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1877ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
1878ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
1879ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1880ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1881e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
1882e6ccafaeSMatthew G Knepley     /* Quadratic line */
1883e6ccafaeSMatthew G Knepley     faceSize  = 1;
1884e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
1885e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
1886e6ccafaeSMatthew G Knepley     /* Quads */
1887e6ccafaeSMatthew G Knepley     faceSize = 2;
1888e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
1889e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1890e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
1891e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1892e6ccafaeSMatthew G Knepley     } else {
1893e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
1894e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
1895e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
1896e6ccafaeSMatthew G Knepley     }
1897e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
1898e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
1899e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1900e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
1901e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1902e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
1903e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
1904e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1905e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1906e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
1907e6ccafaeSMatthew G Knepley     };
1908e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
1909e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1910e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1911e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
1912e6ccafaeSMatthew G Knepley     };
1913e6ccafaeSMatthew G Knepley 
1914e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
1915e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
1916e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
1917e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
1918e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
1919e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1920e6ccafaeSMatthew G Knepley 
1921e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
1922e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
1923e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
1924e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
1925e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
1926e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1927e6ccafaeSMatthew G Knepley               break;
1928e6ccafaeSMatthew G Knepley             }
1929e6ccafaeSMatthew G Knepley           }
1930e6ccafaeSMatthew G Knepley         }
1931e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1932e6ccafaeSMatthew G Knepley         break;
1933e6ccafaeSMatthew G Knepley       }
1934e6ccafaeSMatthew G Knepley     }
1935e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
1936e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1937e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1938e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
1939e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
1940e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1941e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
1942e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1943e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
1944e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
1945e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1946e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1947e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1948e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
1949e6ccafaeSMatthew G Knepley     };
1950e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
1951e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1952e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1953e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1954e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
1955e6ccafaeSMatthew G Knepley     };
1956e6ccafaeSMatthew G Knepley 
1957e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
1958e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
1959e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
1960e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
1961e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
1962e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1963e6ccafaeSMatthew G Knepley 
1964e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
1965e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
1966e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
1967e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
1968e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
1969e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1970e6ccafaeSMatthew G Knepley               break;
1971e6ccafaeSMatthew G Knepley             }
1972e6ccafaeSMatthew G Knepley           }
1973e6ccafaeSMatthew G Knepley         }
1974e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1975e6ccafaeSMatthew G Knepley         break;
1976e6ccafaeSMatthew G Knepley       }
1977e6ccafaeSMatthew G Knepley     }
1978e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
1979e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1980e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1981e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
1982e6ccafaeSMatthew G Knepley     /* Hexes
1983e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1984e6ccafaeSMatthew G Knepley        pointing up at the second.
1985e6ccafaeSMatthew G Knepley 
1986e6ccafaeSMatthew G Knepley           7---6
1987e6ccafaeSMatthew G Knepley          /|  /|
1988e6ccafaeSMatthew G Knepley         4---5 |
1989ddeab2a6SMatthew G. Knepley         | 1-|-2
1990e6ccafaeSMatthew G Knepley         |/  |/
1991ddeab2a6SMatthew G. Knepley         0---3
1992e6ccafaeSMatthew G Knepley 
1993e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
1994e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
1995e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
1996e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1997e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
1998e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
1999e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2000ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2001ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2002ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2003ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2004e6ccafaeSMatthew G Knepley     };
2005e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2006ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2007e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2008ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2009ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2010ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2011ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2012e6ccafaeSMatthew G Knepley     };
2013e6ccafaeSMatthew G Knepley 
2014e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
2015e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2016e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2017e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2018e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2019e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2020e6ccafaeSMatthew G Knepley 
2021e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2022e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2023e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2024e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2025e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2026e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2027e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2028e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2029e6ccafaeSMatthew G Knepley               break;
2030e6ccafaeSMatthew G Knepley             }
2031e6ccafaeSMatthew G Knepley           }
2032e6ccafaeSMatthew G Knepley         }
2033e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2034e6ccafaeSMatthew G Knepley         break;
2035e6ccafaeSMatthew G Knepley       }
2036e6ccafaeSMatthew G Knepley     }
2037e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2038e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2039e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2040e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2041e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2042e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2043e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2044e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2045e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2046e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2047e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2048e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2049e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2050e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2051e6ccafaeSMatthew G Knepley     };
2052e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2053e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2054e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2055e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2056e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2057e6ccafaeSMatthew G Knepley     };
2058e6ccafaeSMatthew G Knepley 
2059e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
2060e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2061e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2062e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2063e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2064e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2065e6ccafaeSMatthew G Knepley 
2066e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2067e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2068e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2069e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2070e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2071e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2072e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2073e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2074e6ccafaeSMatthew G Knepley               break;
2075e6ccafaeSMatthew G Knepley             }
2076e6ccafaeSMatthew G Knepley           }
2077e6ccafaeSMatthew G Knepley         }
2078e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2079e6ccafaeSMatthew G Knepley         break;
2080e6ccafaeSMatthew G Knepley       }
2081e6ccafaeSMatthew G Knepley     }
2082e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2083e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2084e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2085e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2086e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2087e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2088e6ccafaeSMatthew G Knepley        pointing up at the second.
2089e6ccafaeSMatthew G Knepley 
2090e6ccafaeSMatthew G Knepley          7---6
2091e6ccafaeSMatthew G Knepley         /|  /|
2092e6ccafaeSMatthew G Knepley        4---5 |
2093e6ccafaeSMatthew G Knepley        | 3-|-2
2094e6ccafaeSMatthew G Knepley        |/  |/
2095e6ccafaeSMatthew G Knepley        0---1
2096e6ccafaeSMatthew G Knepley 
2097e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2098e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2099e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2100e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2101e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2102e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2103e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2104e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2105e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2106e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2107e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2108e6ccafaeSMatthew G Knepley     };
2109e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2110e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2111e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2112e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2113e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2114e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2115e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2116e6ccafaeSMatthew G Knepley     };
2117e6ccafaeSMatthew G Knepley 
2118e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
2119e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2120e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2121e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2122e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2123e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2124e6ccafaeSMatthew G Knepley 
2125e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2126e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2127e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2128e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2129e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2130e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2131e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2132e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2133e6ccafaeSMatthew G Knepley               break;
2134e6ccafaeSMatthew G Knepley             }
2135e6ccafaeSMatthew G Knepley           }
2136e6ccafaeSMatthew G Knepley         }
2137e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2138e6ccafaeSMatthew G Knepley         break;
2139e6ccafaeSMatthew G Knepley       }
2140e6ccafaeSMatthew G Knepley     }
2141e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2142e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2143e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2144e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2145e6ccafaeSMatthew G Knepley   if (!posOrient) {
2146e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2147e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2148e6ccafaeSMatthew G Knepley   } else {
2149e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2150e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2151e6ccafaeSMatthew G Knepley   }
2152e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2153e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2154e6ccafaeSMatthew G Knepley }
2155e6ccafaeSMatthew G Knepley 
2156e6ccafaeSMatthew G Knepley #undef __FUNCT__
2157e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
2158e6ccafaeSMatthew G Knepley /*
2159e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
2160e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
2161e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
2162e6ccafaeSMatthew G Knepley */
2163e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2164e6ccafaeSMatthew G Knepley {
21650298fd71SBarry Smith   const PetscInt *cone = NULL;
2166e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2167e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2168e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2169e6ccafaeSMatthew G Knepley 
2170e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2171e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2172e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2173e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2174e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2175e6ccafaeSMatthew G Knepley 
2176e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2177e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2178e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2179e6ccafaeSMatthew G Knepley       }
2180e6ccafaeSMatthew G Knepley     }
2181e6ccafaeSMatthew G Knepley     if (found) {
2182e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2183e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2184e6ccafaeSMatthew G Knepley       ++v2;
2185e6ccafaeSMatthew G Knepley     } else {
2186e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2187e6ccafaeSMatthew G Knepley     }
2188e6ccafaeSMatthew G Knepley   }
2189e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2190e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2191e6ccafaeSMatthew G Knepley }
2192e6ccafaeSMatthew G Knepley 
2193e6ccafaeSMatthew G Knepley #undef __FUNCT__
2194cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
2195e6ccafaeSMatthew G Knepley /*
2196cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2197e6ccafaeSMatthew G Knepley 
2198e6ccafaeSMatthew G Knepley   Not collective
2199e6ccafaeSMatthew G Knepley 
2200e6ccafaeSMatthew G Knepley   Input Parameters:
2201e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2202e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2203e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2204e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2205e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2206e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2207e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2208e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2209e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2210e6ccafaeSMatthew G Knepley 
2211e6ccafaeSMatthew G Knepley   Output Parameters:
2212e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2213e6ccafaeSMatthew G Knepley 
2214e6ccafaeSMatthew G Knepley   Level: developer
2215e6ccafaeSMatthew G Knepley */
2216cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexInsertFace_Internal(DM dm, DM subdm, PetscInt numFaceVertices, const PetscInt faceVertices[], const PetscInt subfaceVertices[], PetscInt numCorners, PetscInt cell, PetscInt subcell, PetscInt firstFace, PetscInt *newFacePoint)
2217e6ccafaeSMatthew G Knepley {
221882f516ccSBarry Smith   MPI_Comm        comm;
2219e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2220e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2221e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2222e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2223e6ccafaeSMatthew G Knepley 
2224e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
222582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2226e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2227e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2228e6ccafaeSMatthew G Knepley #if 0
2229e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2230e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2231e6ccafaeSMatthew G Knepley #else
2232e6ccafaeSMatthew G Knepley   {
2233e6ccafaeSMatthew G Knepley     PetscInt f;
2234e6ccafaeSMatthew G Knepley 
2235e6ccafaeSMatthew G Knepley     numFaces = 0;
2236e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2237e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2238e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2239e6ccafaeSMatthew G Knepley 
2240e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2241e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2242e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2243e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2244e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2245e6ccafaeSMatthew G Knepley         PetscInt       v;
2246e6ccafaeSMatthew G Knepley 
2247e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2248e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2249e6ccafaeSMatthew G Knepley         }
2250e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2251e6ccafaeSMatthew G Knepley       }
2252e6ccafaeSMatthew G Knepley       if (d == dof) {
2253e6ccafaeSMatthew G Knepley         numFaces               = 1;
2254e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2255e6ccafaeSMatthew G Knepley       }
2256e6ccafaeSMatthew G Knepley     }
2257e6ccafaeSMatthew G Knepley   }
2258e6ccafaeSMatthew G Knepley #endif
2259e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2260e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2261e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2262766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2263e6ccafaeSMatthew G Knepley   } else {
2264e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2265e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2266e6ccafaeSMatthew G Knepley 
2267e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2268e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2269e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2270e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2271e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2272e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2273e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2274e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2275e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2276e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2277e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2278e6ccafaeSMatthew G Knepley           break;
2279e6ccafaeSMatthew G Knepley         }
2280e6ccafaeSMatthew G Knepley       }
2281e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2282e6ccafaeSMatthew G Knepley     }
2283e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2284e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2285e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2286e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2287e6ccafaeSMatthew G Knepley   }
2288ef07cca7SMatthew G. Knepley #if 0
2289e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2290ef07cca7SMatthew G. Knepley #else
2291ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2292ef07cca7SMatthew G. Knepley #endif
2293e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2294e6ccafaeSMatthew G Knepley }
2295e6ccafaeSMatthew G Knepley 
2296e6ccafaeSMatthew G Knepley #undef __FUNCT__
2297e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
229853156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2299e6ccafaeSMatthew G Knepley {
230082f516ccSBarry Smith   MPI_Comm        comm;
230153156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2302efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2303efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2304efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2305fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2306efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2307e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2308e6ccafaeSMatthew G Knepley 
2309e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
231082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2311efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2312efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2313efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2314efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
231553156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2316efa14ee0SMatthew G Knepley   /* Setup chart */
2317efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2318efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2319efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2320efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2321e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2322e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2323efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2324e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2325efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2326efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2327efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2328efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2329e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2330e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2331e6ccafaeSMatthew G Knepley   }
2332e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2333e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2334e6ccafaeSMatthew G Knepley   }
2335e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2336e6ccafaeSMatthew G Knepley   /* Create face cones */
2337efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
23380298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2339efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2340e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2341e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2342efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
23430298fd71SBarry Smith     PetscInt      *closure = NULL;
2344efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2345e6ccafaeSMatthew G Knepley 
2346e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2347efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2348efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2349e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2350e6ccafaeSMatthew G Knepley 
2351efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2352efa14ee0SMatthew G Knepley         ++numCorners;
2353efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2354efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2355efa14ee0SMatthew G Knepley           closure[faceSize] = point;
235665560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2357e6ccafaeSMatthew G Knepley           ++faceSize;
2358e6ccafaeSMatthew G Knepley         }
2359e6ccafaeSMatthew G Knepley       }
2360e6ccafaeSMatthew G Knepley     }
2361efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2362efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2363cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2364e6ccafaeSMatthew G Knepley     }
236565560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2366e6ccafaeSMatthew G Knepley   }
2367efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2368e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2369e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2370e6ccafaeSMatthew G Knepley   /* Build coordinates */
2371efa14ee0SMatthew G Knepley   {
2372efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2373efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2374efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2375285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2376efa14ee0SMatthew G Knepley 
237769d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2378e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
237969d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2380285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2381285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2382285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2383efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2384efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2385efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2386efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2387efa14ee0SMatthew G Knepley       PetscInt       dof;
2388efa14ee0SMatthew G Knepley 
2389efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2390efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2391285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2392e6ccafaeSMatthew G Knepley     }
2393e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2394e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2395e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2396e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
23972eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2398830e53efSMatthew G. Knepley     if (coordSize) {
2399e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2400e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2401efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2402efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2403efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2404efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2405e6ccafaeSMatthew G Knepley 
2406e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2407e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2408efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2409efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2410efa14ee0SMatthew G Knepley         if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof);
2411e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2412e6ccafaeSMatthew G Knepley       }
2413e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2414e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
24153b399e24SMatthew G. Knepley     }
2416e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2417e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2418e6ccafaeSMatthew G Knepley   }
2419efa14ee0SMatthew G Knepley   /* Cleanup */
2420efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2421efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2422efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2423efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2424e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2425e6ccafaeSMatthew G Knepley }
2426e6ccafaeSMatthew G Knepley 
2427e6ccafaeSMatthew G Knepley #undef __FUNCT__
2428e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
242953156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2430e6ccafaeSMatthew G Knepley {
243182f516ccSBarry Smith   MPI_Comm         comm;
243253156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2433efa14ee0SMatthew G Knepley   IS              *subpointIS;
2434efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
243501a2673eSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *coneONew;
2436efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2437e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2438e6ccafaeSMatthew G Knepley 
2439e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
244082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2441efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2442e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2443efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2444efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
244553156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);}
2446efa14ee0SMatthew G Knepley   /* Setup chart */
2447efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2448dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2449e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2450e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2451e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2452e6ccafaeSMatthew G Knepley   }
2453e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2454e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2455e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2456e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2457e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2458e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2459e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2460e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2461e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
24620ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2463e6ccafaeSMatthew G Knepley   }
2464e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2465e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2466e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2467e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2468e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2469e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2470e6ccafaeSMatthew G Knepley 
2471e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2472e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2473e6ccafaeSMatthew G Knepley       if (d == dim) {
2474e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2475e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2476e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2477e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2478e6ccafaeSMatthew G Knepley         }
2479e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2480e6ccafaeSMatthew G Knepley       }
2481e6ccafaeSMatthew G Knepley     }
2482e6ccafaeSMatthew G Knepley   }
2483e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2484e6ccafaeSMatthew G Knepley   /* Set cones */
24850298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2486dcca6d9dSJed Brown   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr);
2487e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2488e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2489e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2490e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
24910e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2492e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2493e6ccafaeSMatthew G Knepley 
2494e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2495e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2496e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
24970e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2498e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2499e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
250001a2673eSMatthew G. Knepley         if (subc >= 0) {
250101a2673eSMatthew G. Knepley           coneNew[coneSizeNew]  = firstSubPoint[d-1] + subc;
250201a2673eSMatthew G. Knepley           coneONew[coneSizeNew] = ornt[c];
250301a2673eSMatthew G. Knepley           ++coneSizeNew;
250401a2673eSMatthew G. Knepley         }
2505e6ccafaeSMatthew G Knepley       }
2506e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2507e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
250801a2673eSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr);
2509e6ccafaeSMatthew G Knepley     }
2510e6ccafaeSMatthew G Knepley   }
251101a2673eSMatthew G. Knepley   ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr);
2512e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2513e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2514e6ccafaeSMatthew G Knepley   /* Build coordinates */
2515e6ccafaeSMatthew G Knepley   {
2516e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2517e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2518e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2519285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2520e6ccafaeSMatthew G Knepley 
252169d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2522e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
252369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2524285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2525285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2526285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2527e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2528e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2529e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2530e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2531e6ccafaeSMatthew G Knepley       PetscInt       dof;
2532e6ccafaeSMatthew G Knepley 
2533e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2534e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2535285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2536e6ccafaeSMatthew G Knepley     }
2537e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2538e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2539e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2540e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
25412eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2542e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2543e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2544e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2545e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2546e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2547e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2548e6ccafaeSMatthew G Knepley 
2549e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2550e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2551e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2552e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2553e6ccafaeSMatthew G Knepley       if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof);
2554efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2555e6ccafaeSMatthew G Knepley     }
2556e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2557e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2558e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2559e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2560e6ccafaeSMatthew G Knepley   }
2561efa14ee0SMatthew G Knepley   /* Cleanup */
2562e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
25630ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2564e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2565e6ccafaeSMatthew G Knepley   }
2566efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2567e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2568e6ccafaeSMatthew G Knepley }
2569e6ccafaeSMatthew G Knepley 
2570e6ccafaeSMatthew G Knepley #undef __FUNCT__
2571e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2572d0fa310fSMatthew G. Knepley /*@
2573e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2574e6ccafaeSMatthew G Knepley 
2575e6ccafaeSMatthew G Knepley   Input Parameters:
2576e6ccafaeSMatthew G Knepley + dm           - The original mesh
2577830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2578830e53efSMatthew G. Knepley - value        - The label value to use
2579e6ccafaeSMatthew G Knepley 
2580e6ccafaeSMatthew G Knepley   Output Parameter:
2581e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2582e6ccafaeSMatthew G Knepley 
2583e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2584e6ccafaeSMatthew G Knepley 
2585e6ccafaeSMatthew G Knepley   Level: developer
2586e6ccafaeSMatthew G Knepley 
2587e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2588830e53efSMatthew G. Knepley @*/
258953156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2590e6ccafaeSMatthew G Knepley {
2591e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2592e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2593e6ccafaeSMatthew G Knepley 
2594e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2595e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2596766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2597e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2598e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
259982f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2600e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2601e6ccafaeSMatthew G Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2602e6ccafaeSMatthew G Knepley   if (depth == dim) {
2603830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2604e6ccafaeSMatthew G Knepley   } else {
2605830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2606e6ccafaeSMatthew G Knepley   }
2607e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2608e6ccafaeSMatthew G Knepley }
2609e6ccafaeSMatthew G Knepley 
2610e6ccafaeSMatthew G Knepley #undef __FUNCT__
2611aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
2612aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
2613aca35d17SMatthew G. Knepley {
2614aca35d17SMatthew G. Knepley   PetscInt       subPoint;
2615aca35d17SMatthew G. Knepley   PetscErrorCode ierr;
2616aca35d17SMatthew G. Knepley 
2617aca35d17SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
2618aca35d17SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
2619aca35d17SMatthew G. Knepley }
2620aca35d17SMatthew G. Knepley 
2621aca35d17SMatthew G. Knepley #undef __FUNCT__
2622766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
262327c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2624766ab985SMatthew G. Knepley {
2625766ab985SMatthew G. Knepley   MPI_Comm        comm;
2626766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2627766ab985SMatthew G. Knepley   IS              subvertexIS;
2628766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2629fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
2630766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
263187feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
2632766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2633766ab985SMatthew G. Knepley 
2634766ab985SMatthew G. Knepley   PetscFunctionBegin;
2635766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
2636766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2637766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2638766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2639766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
264027c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
2641766ab985SMatthew G. Knepley   /* Setup chart */
2642766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2643766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2644766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2645766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2646766ab985SMatthew G. Knepley   /* Set cone sizes */
2647766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
2648766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
2649766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
2650766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2651766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2652766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2653766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2654766ab985SMatthew G. Knepley   }
2655766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2656766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2657766ab985SMatthew G. Knepley   }
2658766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2659766ab985SMatthew G. Knepley   /* Create face cones */
2660766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
266187feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2662766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2663766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2664766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
2665766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
266687feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
266787feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
2668766ab985SMatthew G. Knepley 
266987feddfdSMatthew G. Knepley     if (cell < cMax) continue;
267087feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
267187feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
267287feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
267387feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
267487feddfdSMatthew G. Knepley     }
267587feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
267687feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
267787feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
267827234c99SMatthew G. Knepley     /* Not true in parallel
267927234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
268087feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
268187feddfdSMatthew G. Knepley       PetscInt negsubcell;
2682766ab985SMatthew G. Knepley 
268387feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
268487feddfdSMatthew G. Knepley       /* I know this is a crap search */
268587feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
268687feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
2687766ab985SMatthew G. Knepley       }
268887feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
268987feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
2690766ab985SMatthew G. Knepley     }
269187feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
269287feddfdSMatthew G. Knepley     ++newFacePoint;
2693766ab985SMatthew G. Knepley   }
2694766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2695766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2696766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2697766ab985SMatthew G. Knepley   /* Build coordinates */
2698766ab985SMatthew G. Knepley   {
2699766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2700766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2701766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2702285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2703766ab985SMatthew G. Knepley 
270469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2705766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
270669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2707285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2708285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2709285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2710766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2711766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2712766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2713766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2714766ab985SMatthew G. Knepley       PetscInt       dof;
2715766ab985SMatthew G. Knepley 
2716766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2717766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2718285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2719766ab985SMatthew G. Knepley     }
2720766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2721766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2722766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2723766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
27242eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2725766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2726766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2727766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2728766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2729766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2730766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
2731766ab985SMatthew G. Knepley 
2732766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2733766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2734766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2735766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2736766ab985SMatthew G. Knepley       if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof);
2737766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2738766ab985SMatthew G. Knepley     }
2739766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2740766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2741766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2742766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2743766ab985SMatthew G. Knepley   }
2744aca35d17SMatthew G. Knepley   /* Build SF */
2745aca35d17SMatthew G. Knepley   CHKMEMQ;
2746aca35d17SMatthew G. Knepley   {
2747aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
2748aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
2749bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
2750aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
2751bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
275249c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
2753bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
2754aca35d17SMatthew G. Knepley 
2755bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
2756aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
2757aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
2758aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2759aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
2760aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
2761aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
2762aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
2763dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
2764bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
2765bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
2766bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
2767bdcf2095SMatthew G. Knepley       }
27689e0823b2SMatthew G. Knepley       /* Set subleaves */
2769aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2770aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2771bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2772aca35d17SMatthew G. Knepley 
2773aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
2774bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
2775bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
2776bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
2777bdcf2095SMatthew G. Knepley         ++numSubLeaves;
2778aca35d17SMatthew G. Knepley       }
27799e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
27809e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
27819e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
27829e0823b2SMatthew G. Knepley 
27839e0823b2SMatthew G. Knepley         if (subPoint < 0) {
27849e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
27859e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
27869e0823b2SMatthew G. Knepley         } else {
27879e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
27889e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
27899e0823b2SMatthew G. Knepley         }
2790bdcf2095SMatthew G. Knepley       }
2791bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2792bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2793bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2794bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2795785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
2796785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
279749c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
2798bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2799bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2800aca35d17SMatthew G. Knepley 
2801aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
280249c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
2803aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
2804bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
2805bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
2806bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
2807bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
2808aca35d17SMatthew G. Knepley         ++sl;
2809aca35d17SMatthew G. Knepley       }
2810bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
281149c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
281249c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
2813aca35d17SMatthew G. Knepley     }
2814aca35d17SMatthew G. Knepley   }
2815aca35d17SMatthew G. Knepley   CHKMEMQ;
2816766ab985SMatthew G. Knepley   /* Cleanup */
2817766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2818766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2819766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
2820766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2821766ab985SMatthew G. Knepley }
2822766ab985SMatthew G. Knepley 
2823766ab985SMatthew G. Knepley #undef __FUNCT__
2824766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
2825b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm)
2826766ab985SMatthew G. Knepley {
2827766ab985SMatthew G. Knepley   MPI_Comm         comm;
2828766ab985SMatthew G. Knepley   DMLabel          subpointMap;
2829766ab985SMatthew G. Knepley   IS              *subpointIS;
2830766ab985SMatthew G. Knepley   const PetscInt **subpoints;
2831b1a8e46aSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
2832766ab985SMatthew G. Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2833766ab985SMatthew G. Knepley   PetscErrorCode   ierr;
2834766ab985SMatthew G. Knepley 
2835766ab985SMatthew G. Knepley   PetscFunctionBegin;
2836766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2837766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2838766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2839766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2840766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
2841b3154360SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);
2842766ab985SMatthew G. Knepley   /* Setup chart */
2843766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2844dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2845766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2846766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2847766ab985SMatthew G. Knepley     totSubPoints += numSubPoints[d];
2848766ab985SMatthew G. Knepley   }
2849766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2850766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2851766ab985SMatthew G. Knepley   /* Set cone sizes */
2852766ab985SMatthew G. Knepley   firstSubPoint[dim] = 0;
2853766ab985SMatthew G. Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2854766ab985SMatthew G. Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2855766ab985SMatthew G. Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2856766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2857766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
2858b643afeaSMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2859766ab985SMatthew G. Knepley   }
2860766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2861766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2862766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2863766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2864766ab985SMatthew G. Knepley       const PetscInt *cone;
2865766ab985SMatthew G. Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2866766ab985SMatthew G. Knepley 
2867766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2868766ab985SMatthew G. Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2869766ab985SMatthew G. Knepley       if (d == dim) {
2870766ab985SMatthew G. Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2871766ab985SMatthew G. Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2872766ab985SMatthew G. Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2873766ab985SMatthew G. Knepley           if (val >= 0) coneSizeNew++;
2874766ab985SMatthew G. Knepley         }
2875766ab985SMatthew G. Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2876766ab985SMatthew G. Knepley       }
2877766ab985SMatthew G. Knepley     }
2878766ab985SMatthew G. Knepley   }
2879766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2880766ab985SMatthew G. Knepley   /* Set cones */
2881766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2882dcca6d9dSJed Brown   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
2883766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2884766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2885766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2886766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2887b1a8e46aSMatthew G. Knepley       const PetscInt *cone, *ornt;
2888766ab985SMatthew G. Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2889766ab985SMatthew G. Knepley 
2890766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2891766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2892766ab985SMatthew G. Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2893b1a8e46aSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2894766ab985SMatthew G. Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2895766ab985SMatthew G. Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
2896b1a8e46aSMatthew G. Knepley         if (subc >= 0) {
2897b1a8e46aSMatthew G. Knepley           coneNew[coneSizeNew]   = firstSubPoint[d-1] + subc;
2898b1a8e46aSMatthew G. Knepley           orntNew[coneSizeNew++] = ornt[c];
2899b1a8e46aSMatthew G. Knepley         }
2900766ab985SMatthew G. Knepley       }
2901766ab985SMatthew G. Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2902766ab985SMatthew G. Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
2903b1a8e46aSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
2904766ab985SMatthew G. Knepley     }
2905766ab985SMatthew G. Knepley   }
2906b1a8e46aSMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
2907766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2908766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2909766ab985SMatthew G. Knepley   /* Build coordinates */
2910766ab985SMatthew G. Knepley   {
2911766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2912766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2913766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2914285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2915766ab985SMatthew G. Knepley 
291669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2917766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
291869d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2919285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2920285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2921285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2922766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2923766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2924766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
2925766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2926766ab985SMatthew G. Knepley       PetscInt       dof;
2927766ab985SMatthew G. Knepley 
2928766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2929766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2930285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2931766ab985SMatthew G. Knepley     }
2932766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2933766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2934766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2935766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
29362eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2937766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2938766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2939766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2940766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
2941766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2942766ab985SMatthew G. Knepley       PetscInt dof, off, sdof, soff, d;
2943766ab985SMatthew G. Knepley 
2944766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2945766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2946766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2947766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2948766ab985SMatthew G. Knepley       if (dof != sdof) SETERRQ4(comm, PETSC_ERR_PLIB, "Coordinate dimension %d on subvertex %d, vertex %d should be %d", sdof, subvertex, vertex, dof);
2949766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2950766ab985SMatthew G. Knepley     }
2951766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2952766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2953766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2954766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2955766ab985SMatthew G. Knepley   }
2956c80a7578SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
2957c80a7578SMatthew G. Knepley   {
2958c80a7578SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
2959251556f3SMatthew G. Knepley     IS                 subpIS;
2960c80a7578SMatthew G. Knepley     const PetscSFNode *remotePoints;
2961c80a7578SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
2962c80a7578SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
2963c80a7578SMatthew G. Knepley     PetscInt          *slocalPoints;
2964f033dbf2SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
2965c80a7578SMatthew G. Knepley     PetscMPIInt        rank;
2966c80a7578SMatthew G. Knepley 
2967c80a7578SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
2968c80a7578SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
2969c80a7578SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
2970c80a7578SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2971c80a7578SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
2972251556f3SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
2973251556f3SMatthew G. Knepley     if (subpIS) {
2974251556f3SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
2975251556f3SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
2976f033dbf2SMatthew G. Knepley     }
2977c80a7578SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
2978c80a7578SMatthew G. Knepley     if (numRoots >= 0) {
297982db75e7SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
2980c80a7578SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
2981c80a7578SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
2982c80a7578SMatthew G. Knepley         newLocalPoints[p].index = -2;
2983c80a7578SMatthew G. Knepley       }
2984c80a7578SMatthew G. Knepley       /* Set subleaves */
2985c80a7578SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2986c80a7578SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2987c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
2988c80a7578SMatthew G. Knepley 
2989c80a7578SMatthew G. Knepley         if (subpoint < 0) continue;
2990c80a7578SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
2991c80a7578SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
2992c80a7578SMatthew G. Knepley         ++numSubleaves;
2993c80a7578SMatthew G. Knepley       }
2994c80a7578SMatthew G. Knepley       /* Must put in owned subpoints */
2995c80a7578SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
2996c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
2997c80a7578SMatthew G. Knepley 
2998c80a7578SMatthew G. Knepley         if (subpoint < 0) {
2999c80a7578SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
3000c80a7578SMatthew G. Knepley           newOwners[p-pStart].index = -3;
3001c80a7578SMatthew G. Knepley         } else {
3002c80a7578SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
3003c80a7578SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
3004c80a7578SMatthew G. Knepley         }
3005c80a7578SMatthew G. Knepley       }
3006c80a7578SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3007c80a7578SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3008c80a7578SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3009c80a7578SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3010c80a7578SMatthew G. Knepley       ierr = PetscMalloc(numSubleaves * sizeof(PetscInt),    &slocalPoints);CHKERRQ(ierr);
3011c80a7578SMatthew G. Knepley       ierr = PetscMalloc(numSubleaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr);
3012c80a7578SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3013c80a7578SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3014c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
3015c80a7578SMatthew G. Knepley 
3016c80a7578SMatthew G. Knepley         if (subpoint < 0) continue;
3017c80a7578SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3018c80a7578SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
3019c80a7578SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3020c80a7578SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3021c80a7578SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3022c80a7578SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3023c80a7578SMatthew G. Knepley         ++sl;
3024c80a7578SMatthew G. Knepley       }
3025c80a7578SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
3026c80a7578SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
3027c80a7578SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3028c80a7578SMatthew G. Knepley     }
3029251556f3SMatthew G. Knepley     if (subpIS) {
3030251556f3SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
3031251556f3SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
3032251556f3SMatthew G. Knepley     }
3033c80a7578SMatthew G. Knepley   }
3034766ab985SMatthew G. Knepley   /* Cleanup */
3035766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3036b643afeaSMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
3037766ab985SMatthew G. Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
3038766ab985SMatthew G. Knepley   }
3039766ab985SMatthew G. Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
3040766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3041766ab985SMatthew G. Knepley }
3042766ab985SMatthew G. Knepley 
3043766ab985SMatthew G. Knepley #undef __FUNCT__
3044766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
3045766ab985SMatthew G. Knepley /*
304627c04023SMatthew G. Knepley   DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. Optionally, a Label an be given to restrict the cells.
3047766ab985SMatthew G. Knepley 
3048766ab985SMatthew G. Knepley   Input Parameters:
3049766ab985SMatthew G. Knepley + dm          - The original mesh
305027c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
30517afc1a8bSJed Brown . label       - A label name, or NULL
305227c04023SMatthew G. Knepley - value  - A label value
3053766ab985SMatthew G. Knepley 
3054766ab985SMatthew G. Knepley   Output Parameter:
3055766ab985SMatthew G. Knepley . subdm - The surface mesh
3056766ab985SMatthew G. Knepley 
3057766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3058766ab985SMatthew G. Knepley 
3059766ab985SMatthew G. Knepley   Level: developer
3060766ab985SMatthew G. Knepley 
3061766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3062766ab985SMatthew G. Knepley */
306327c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3064766ab985SMatthew G. Knepley {
3065766ab985SMatthew G. Knepley   PetscInt       dim, depth;
3066766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3067766ab985SMatthew G. Knepley 
3068766ab985SMatthew G. Knepley   PetscFunctionBegin;
3069766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
307027c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3071766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
3072766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3073766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3074766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3075766ab985SMatthew G. Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3076766ab985SMatthew G. Knepley   if (depth == dim) {
3077b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3078766ab985SMatthew G. Knepley   } else {
307927c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3080e6ccafaeSMatthew G Knepley   }
3081e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3082e6ccafaeSMatthew G Knepley }
3083e6ccafaeSMatthew G Knepley 
3084e6ccafaeSMatthew G Knepley #undef __FUNCT__
3085e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
308664beef6dSMatthew G. Knepley /*@
308764beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
308864beef6dSMatthew G. Knepley 
308964beef6dSMatthew G. Knepley   Input Parameter:
309064beef6dSMatthew G. Knepley . dm - The submesh DM
309164beef6dSMatthew G. Knepley 
309264beef6dSMatthew G. Knepley   Output Parameter:
309364beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
309464beef6dSMatthew G. Knepley 
309564beef6dSMatthew G. Knepley   Level: developer
309664beef6dSMatthew G. Knepley 
309764beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
309864beef6dSMatthew G. Knepley @*/
3099e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3100e6ccafaeSMatthew G Knepley {
3101e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
3102e6ccafaeSMatthew G Knepley 
3103e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3104e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3105e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
3106e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
3107e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3108e6ccafaeSMatthew G Knepley }
3109e6ccafaeSMatthew G Knepley 
3110e6ccafaeSMatthew G Knepley #undef __FUNCT__
3111e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
3112e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
3113e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3114e6ccafaeSMatthew G Knepley {
3115e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3116285d324eSMatthew G. Knepley   DMLabel        tmp;
3117e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3118e6ccafaeSMatthew G Knepley 
3119e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3120e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3121285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3122e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3123285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3124285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3125e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3126e6ccafaeSMatthew G Knepley }
3127e6ccafaeSMatthew G Knepley 
3128e6ccafaeSMatthew G Knepley #undef __FUNCT__
3129e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
313064beef6dSMatthew G. Knepley /*@
3131e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3132e6ccafaeSMatthew G Knepley 
3133e6ccafaeSMatthew G Knepley   Input Parameter:
3134e6ccafaeSMatthew G Knepley . dm - The submesh DM
3135e6ccafaeSMatthew G Knepley 
3136e6ccafaeSMatthew G Knepley   Output Parameter:
31370298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3138e6ccafaeSMatthew G Knepley 
3139e6ccafaeSMatthew G Knepley   Note: This is IS is guaranteed to be sorted by the construction of the submesh
314064beef6dSMatthew G. Knepley 
314164beef6dSMatthew G. Knepley   Level: developer
314264beef6dSMatthew G. Knepley 
314364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
314464beef6dSMatthew G. Knepley @*/
3145e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3146e6ccafaeSMatthew G Knepley {
314782f516ccSBarry Smith   MPI_Comm        comm;
3148e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3149e6ccafaeSMatthew G Knepley   IS              is;
3150e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3151e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3152e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3153e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3154e6ccafaeSMatthew G Knepley 
3155e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3156e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3157e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
315882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
31590298fd71SBarry Smith   *subpointIS = NULL;
3160e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3161e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3162fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3163e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3164e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3165e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3166e6ccafaeSMatthew G Knepley     depths[0] = depth;
3167e6ccafaeSMatthew G Knepley     depths[1] = 0;
3168e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3169785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3170e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3171e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3172e6ccafaeSMatthew G Knepley 
3173e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3174e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
31751e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3176e6ccafaeSMatthew G Knepley         if (n != depEnd-depStart) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d at depth %d should be %d", n, dep, depEnd-depStart);
3177e6ccafaeSMatthew G Knepley       } else {
31781e21b6fdSMatthew G Knepley         if (!n) {
31791e21b6fdSMatthew G Knepley           if (d == 0) {
31801e21b6fdSMatthew G Knepley             /* Missing cells */
31811e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
31821e21b6fdSMatthew G Knepley           } else {
31831e21b6fdSMatthew G Knepley             /* Missing faces */
31841e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
31851e21b6fdSMatthew G Knepley           }
31861e21b6fdSMatthew G Knepley         }
3187e6ccafaeSMatthew G Knepley       }
3188e6ccafaeSMatthew G Knepley       if (n) {
3189e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3190e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3191e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3192e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3193e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3194e6ccafaeSMatthew G Knepley       }
3195e6ccafaeSMatthew G Knepley     }
3196e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3197e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3198fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3199e6ccafaeSMatthew G Knepley   }
3200e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3201e6ccafaeSMatthew G Knepley }
3202