xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision ddeab2a623a3c9ef27697c0e2b46e6452231f06f)
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"
95cd0c2139SMatthew G Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthEnd[], PetscInt depthShift[])
96cd0c2139SMatthew G Knepley {
97cd0c2139SMatthew G Knepley   if (depth < 0) return p;
98cd0c2139SMatthew G Knepley   /* Cells    */ if (p < depthEnd[depth])   return p;
99cd0c2139SMatthew G Knepley   /* Vertices */ if (p < depthEnd[0])       return p + depthShift[depth];
100cd0c2139SMatthew G Knepley   /* Faces    */ if (p < depthEnd[depth-1]) return p + depthShift[depth] + depthShift[0];
101cd0c2139SMatthew G Knepley   /* Edges    */                            return p + depthShift[depth] + depthShift[0] + depthShift[depth-1];
102cd0c2139SMatthew G Knepley }
103cd0c2139SMatthew G Knepley 
104cd0c2139SMatthew G Knepley #undef __FUNCT__
105cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
106cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
107cd0c2139SMatthew G Knepley {
108cd0c2139SMatthew G Knepley   PetscInt      *depthEnd;
109cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
110cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
111cd0c2139SMatthew G Knepley 
112cd0c2139SMatthew G Knepley   PetscFunctionBegin;
113cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
114cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
115cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
116cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
117cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
118cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
119cd0c2139SMatthew G Knepley     pEnd += depthShift[d];
120cd0c2139SMatthew G Knepley     ierr  = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
121cd0c2139SMatthew G Knepley   }
122cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
123cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
124cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
125cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
126cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
127cd0c2139SMatthew G Knepley       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift);
128cd0c2139SMatthew G Knepley       PetscInt size;
129cd0c2139SMatthew G Knepley 
130cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
131cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
132cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
133cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
134cd0c2139SMatthew G Knepley     }
135cd0c2139SMatthew G Knepley   }
136cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
137cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
138cd0c2139SMatthew G Knepley }
139cd0c2139SMatthew G Knepley 
140cd0c2139SMatthew G Knepley #undef __FUNCT__
141cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
142cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
143cd0c2139SMatthew G Knepley {
144cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, *newpoints;
145cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, maxConeSize, maxSupportSize, pStart, pEnd, p;
146cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
147cd0c2139SMatthew G Knepley 
148cd0c2139SMatthew G Knepley   PetscFunctionBegin;
149cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
150cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
151cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
152cd0c2139SMatthew G Knepley   ierr = PetscMalloc2(depth+1,PetscInt,&depthEnd,PetscMax(maxConeSize, maxSupportSize),PetscInt,&newpoints);CHKERRQ(ierr);
153cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
154cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
155cd0c2139SMatthew G Knepley   }
156cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
157cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
158cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
159cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
160cd0c2139SMatthew G Knepley     PetscInt        size, i, newp = DMPlexShiftPoint_Internal(p, depth, depthEnd, depthShift);
161cd0c2139SMatthew G Knepley 
162cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
163cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
164cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
165cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
166cd0c2139SMatthew G Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift);
167cd0c2139SMatthew G Knepley     }
168cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
169cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
170cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
171cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
172cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
173cd0c2139SMatthew G Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthEnd, depthShift);
174cd0c2139SMatthew G Knepley     }
175cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
176cd0c2139SMatthew G Knepley   }
177cd0c2139SMatthew G Knepley   ierr = PetscFree2(depthEnd,newpoints);CHKERRQ(ierr);
178cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
179cd0c2139SMatthew G Knepley }
180cd0c2139SMatthew G Knepley 
181cd0c2139SMatthew G Knepley #undef __FUNCT__
182cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
183cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
184cd0c2139SMatthew G Knepley {
185cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
186cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
187cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
188cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, coordSize;
189cd0c2139SMatthew G Knepley   PetscInt       dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v;
190cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
191cd0c2139SMatthew G Knepley 
192cd0c2139SMatthew G Knepley   PetscFunctionBegin;
193cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
194cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
195cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
196cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
197cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
198cd0c2139SMatthew G Knepley   }
199cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
200cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
201cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
202cd0c2139SMatthew G Knepley   ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
203cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
204cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
205cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
206cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
207cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
208cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
209cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
210cd0c2139SMatthew G Knepley   }
211cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
212cd0c2139SMatthew G Knepley   ierr = DMPlexSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr);
213cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
214cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
215cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
216cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
217cd0c2139SMatthew G Knepley   ierr = VecSetFromOptions(newCoordinates);CHKERRQ(ierr);
218cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
219cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
220cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
221cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
222cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
223cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
224cd0c2139SMatthew G Knepley 
225cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
226cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
227cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthShift), &noff);CHKERRQ(ierr);
228cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
229cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
230cd0c2139SMatthew G Knepley     }
231cd0c2139SMatthew G Knepley   }
232cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
233cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
234cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
235cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
236cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
237cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
238cd0c2139SMatthew G Knepley }
239cd0c2139SMatthew G Knepley 
240cd0c2139SMatthew G Knepley #undef __FUNCT__
241cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
242cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
243cd0c2139SMatthew G Knepley {
244cd0c2139SMatthew G Knepley   PetscInt          *depthEnd;
245cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d;
246cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
247cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
248cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
249cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
250cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
251cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
252cd0c2139SMatthew G Knepley   PetscMPIInt        numProcs;
253cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
254cd0c2139SMatthew G Knepley 
255cd0c2139SMatthew G Knepley   PetscFunctionBegin;
256cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
257cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
258cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
259cd0c2139SMatthew G Knepley     totShift += depthShift[d];
260cd0c2139SMatthew G Knepley     ierr      = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
261cd0c2139SMatthew G Knepley   }
262cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
263cd0c2139SMatthew G Knepley   ierr = MPI_Comm_size(PetscObjectComm((PetscObject)dm), &numProcs);CHKERRQ(ierr);
264cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
265cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
266cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
267cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
268cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
269cd0c2139SMatthew G Knepley     ierr = PetscMalloc2(numRoots,PetscInt,&newLocation,pEnd-pStart,PetscInt,&newRemoteLocation);CHKERRQ(ierr);
270cd0c2139SMatthew G Knepley     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthEnd, depthShift);
271cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
272cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
273cd0c2139SMatthew G Knepley     ierr = PetscMalloc(numLeaves * sizeof(PetscInt),    &glocalPoints);CHKERRQ(ierr);
274cd0c2139SMatthew G Knepley     ierr = PetscMalloc(numLeaves * sizeof(PetscSFNode), &gremotePoints);CHKERRQ(ierr);
275cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
276cd0c2139SMatthew G Knepley       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthEnd, depthShift);
277cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
278cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
279cd0c2139SMatthew G Knepley     }
280cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
281cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
282cd0c2139SMatthew G Knepley   }
283cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
284cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
285cd0c2139SMatthew G Knepley }
286cd0c2139SMatthew G Knepley 
287cd0c2139SMatthew G Knepley #undef __FUNCT__
288cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
289cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
290cd0c2139SMatthew G Knepley {
291cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
292cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
293cd0c2139SMatthew G Knepley   PetscInt          *depthEnd;
294cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
295cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
296cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
297cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
298cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
299cd0c2139SMatthew G Knepley 
300cd0c2139SMatthew G Knepley   PetscFunctionBegin;
301cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
302cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthEnd);CHKERRQ(ierr);
303cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
304cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
305cd0c2139SMatthew G Knepley   }
306cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
307cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
308cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
309cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
310cd0c2139SMatthew G Knepley     const char     *lname;
311cd0c2139SMatthew G Knepley     PetscBool       isDepth;
312cd0c2139SMatthew G Knepley     IS              valueIS;
313cd0c2139SMatthew G Knepley     const PetscInt *values;
314cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
315cd0c2139SMatthew G Knepley 
316cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
317cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
318cd0c2139SMatthew G Knepley     if (isDepth) continue;
319cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
320cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
321cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
322cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
323cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
324cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
325cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
326cd0c2139SMatthew G Knepley       IS              pointIS;
327cd0c2139SMatthew G Knepley       const PetscInt *points;
328cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
329cd0c2139SMatthew G Knepley 
330cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
331cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
332cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
333cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
334cd0c2139SMatthew G Knepley         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthEnd, depthShift);
335cd0c2139SMatthew G Knepley 
336cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
337cd0c2139SMatthew G Knepley       }
338cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
339cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
340cd0c2139SMatthew G Knepley     }
341cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
342cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
343cd0c2139SMatthew G Knepley   }
344cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
345cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
346cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
347cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
348cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
349cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
350cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
351cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
352cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
353cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
354cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
355cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
356cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
357cd0c2139SMatthew G Knepley     }
358cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
359cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
360cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
361cd0c2139SMatthew G Knepley     } else {
362cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
363cd0c2139SMatthew G Knepley     }
364cd0c2139SMatthew G Knepley   }
365cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
366cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
367cd0c2139SMatthew G Knepley   }
368cd0c2139SMatthew G Knepley   if (0) {
369cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
370cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
371cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
372cd0c2139SMatthew G Knepley   }
373cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
374cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
375cd0c2139SMatthew G Knepley     PetscInt numCells;
376cd0c2139SMatthew G Knepley 
377cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
378cd0c2139SMatthew G Knepley     if (numCells < 2) {
379cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
380cd0c2139SMatthew G Knepley     } else {
381cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
382cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
383cd0c2139SMatthew G Knepley 
384cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
385cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
386cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
387cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
388cd0c2139SMatthew G Knepley     }
389cd0c2139SMatthew G Knepley   }
390cd0c2139SMatthew G Knepley   if (0) {
391cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
392cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
393cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
394cd0c2139SMatthew G Knepley   }
395cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
396cd0c2139SMatthew G Knepley }
397cd0c2139SMatthew G Knepley 
398cd0c2139SMatthew G Knepley #undef __FUNCT__
399cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
400cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
401cd0c2139SMatthew G Knepley {
402cd0c2139SMatthew G Knepley   IS              valueIS;
403cd0c2139SMatthew G Knepley   const PetscInt *values;
404cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
405cd0c2139SMatthew G Knepley   PetscInt        depth = 0, numFS, fs, ghostCell, cEnd, c;
406cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
407cd0c2139SMatthew G Knepley 
408cd0c2139SMatthew G Knepley   PetscFunctionBegin;
409cd0c2139SMatthew G Knepley   /* Count ghost cells */
410cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
411cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
412cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
413cd0c2139SMatthew G Knepley 
414cd0c2139SMatthew G Knepley   *numGhostCells = 0;
415cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
416cd0c2139SMatthew G Knepley     PetscInt numBdFaces;
417cd0c2139SMatthew G Knepley 
418cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, values[fs], &numBdFaces);CHKERRQ(ierr);
419cd0c2139SMatthew G Knepley 
420cd0c2139SMatthew G Knepley     *numGhostCells += numBdFaces;
421cd0c2139SMatthew G Knepley   }
422cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
423cd0c2139SMatthew G Knepley   ierr = PetscMalloc((depth+1) * sizeof(PetscInt), &depthShift);CHKERRQ(ierr);
424cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
425cd0c2139SMatthew G Knepley   if (depth >= 0) depthShift[depth] = *numGhostCells;
426cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
427cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
428cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
429cd0c2139SMatthew G Knepley   for (c = cEnd; c < cEnd + *numGhostCells; ++c) {
430cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
431cd0c2139SMatthew G Knepley   }
432cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
433cd0c2139SMatthew G Knepley     IS              faceIS;
434cd0c2139SMatthew G Knepley     const PetscInt *faces;
435cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
436cd0c2139SMatthew G Knepley 
437cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
438cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
439cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
440cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
441cd0c2139SMatthew G Knepley       PetscInt size;
442cd0c2139SMatthew G Knepley 
443cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
444cd0c2139SMatthew 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);
445cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr);
446cd0c2139SMatthew G Knepley     }
447cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
448cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
449cd0c2139SMatthew G Knepley   }
450cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
451cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
452cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
453cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
454cd0c2139SMatthew G Knepley   ghostCell = cEnd;
455cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
456cd0c2139SMatthew G Knepley     IS              faceIS;
457cd0c2139SMatthew G Knepley     const PetscInt *faces;
458cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
459cd0c2139SMatthew G Knepley 
460cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
461cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
462cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
463cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f, ++ghostCell) {
464cd0c2139SMatthew G Knepley       PetscInt newFace = faces[f] + *numGhostCells;
465cd0c2139SMatthew G Knepley 
466cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
467cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
468cd0c2139SMatthew G Knepley     }
469cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
470cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
471cd0c2139SMatthew G Knepley   }
472cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
473cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
474cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
475cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
476cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
477cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
478cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
479cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
480cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
481cd0c2139SMatthew G Knepley }
482cd0c2139SMatthew G Knepley 
483cd0c2139SMatthew G Knepley #undef __FUNCT__
484cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
485cd0c2139SMatthew G Knepley /*@C
486cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
487cd0c2139SMatthew G Knepley 
488cd0c2139SMatthew G Knepley   Collective on dm
489cd0c2139SMatthew G Knepley 
490cd0c2139SMatthew G Knepley   Input Parameters:
491cd0c2139SMatthew G Knepley + dm - The original DM
492cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
493cd0c2139SMatthew G Knepley 
494cd0c2139SMatthew G Knepley   Output Parameters:
495cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
496cd0c2139SMatthew G Knepley - dmGhosted - The new DM
497cd0c2139SMatthew G Knepley 
498cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
499cd0c2139SMatthew G Knepley 
500cd0c2139SMatthew G Knepley   Level: developer
501cd0c2139SMatthew G Knepley 
502cd0c2139SMatthew G Knepley .seealso: DMCreate()
503cd0c2139SMatthew G Knepley */
504cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
505cd0c2139SMatthew G Knepley {
506cd0c2139SMatthew G Knepley   DM             gdm;
507cd0c2139SMatthew G Knepley   DMLabel        label;
508cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
509cd0c2139SMatthew G Knepley   PetscInt       dim;
510cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
511cd0c2139SMatthew G Knepley 
512cd0c2139SMatthew G Knepley   PetscFunctionBegin;
513cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
514cd0c2139SMatthew G Knepley   PetscValidPointer(numGhostCells, 3);
515cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
516cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
517cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
518cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
519cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr);
520cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
521cd0c2139SMatthew G Knepley   if (!label) {
522cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
523cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
524cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
525cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
526cd0c2139SMatthew G Knepley   }
527cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
528cd0c2139SMatthew G Knepley   ierr = DMSetFromOptions(gdm);CHKERRQ(ierr);
529cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
530cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
531cd0c2139SMatthew G Knepley }
532cd0c2139SMatthew G Knepley 
533cd0c2139SMatthew G Knepley #undef __FUNCT__
534cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
535cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
536cd0c2139SMatthew G Knepley {
537cd0c2139SMatthew G Knepley   MPI_Comm        comm;
538cd0c2139SMatthew G Knepley   IS              valueIS, *pointIS;
539cd0c2139SMatthew G Knepley   const PetscInt *values, **splitPoints;
540cd0c2139SMatthew G Knepley   PetscSection    coordSection;
541cd0c2139SMatthew G Knepley   Vec             coordinates;
542cd0c2139SMatthew G Knepley   PetscScalar    *coords;
543cd0c2139SMatthew G Knepley   PetscInt       *depthShift, *depthOffset, *pMaxNew, *numSplitPoints, *coneNew, *supportNew;
544cd0c2139SMatthew G Knepley   PetscInt        shift = 100, depth = 0, dep, dim, d, numSP = 0, sp, maxConeSize, maxSupportSize, numLabels, p, v;
545cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
546cd0c2139SMatthew G Knepley 
547cd0c2139SMatthew G Knepley   PetscFunctionBegin;
548cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
549cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
550cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
551cd0c2139SMatthew G Knepley   if (label) {
552cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
553cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
554cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
555cd0c2139SMatthew G Knepley   }
556cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
557cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
558cd0c2139SMatthew G Knepley   ierr = PetscMalloc5(depth+1,PetscInt,&depthShift,depth+1,PetscInt,&depthOffset,depth+1,PetscInt,&pMaxNew,maxConeSize*3,PetscInt,&coneNew,maxSupportSize,PetscInt,&supportNew);CHKERRQ(ierr);
559cd0c2139SMatthew G Knepley   ierr = PetscMalloc3(depth+1,IS,&pointIS,depth+1,PetscInt,&numSplitPoints,depth+1,const PetscInt*,&splitPoints);CHKERRQ(ierr);
560cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
561cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
562cd0c2139SMatthew G Knepley     ierr              = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
563cd0c2139SMatthew G Knepley     numSplitPoints[d] = 0;
564cd0c2139SMatthew G Knepley     splitPoints[d]    = NULL;
565cd0c2139SMatthew G Knepley     pointIS[d]        = NULL;
566cd0c2139SMatthew G Knepley   }
567cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
568cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
569cd0c2139SMatthew G Knepley 
570cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
571cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, dep, &depthShift[dep]);CHKERRQ(ierr);
572cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pointIS[dep]);CHKERRQ(ierr);
573cd0c2139SMatthew G Knepley     if (pointIS[dep]) {
574cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
575cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
576cd0c2139SMatthew G Knepley     }
577cd0c2139SMatthew G Knepley   }
578cd0c2139SMatthew G Knepley   if (depth >= 0) {
579cd0c2139SMatthew G Knepley     /* Calculate number of additional points */
580cd0c2139SMatthew G Knepley     depthShift[depth] = depthShift[depth-1]; /* There is a cohesive cell for every split face   */
581cd0c2139SMatthew G Knepley     depthShift[1]    += depthShift[0];       /* There is a cohesive edge for every split vertex */
582cd0c2139SMatthew G Knepley     /* Calculate hybrid bound for each dimension */
583cd0c2139SMatthew G Knepley     pMaxNew[0] += depthShift[depth];
584cd0c2139SMatthew G Knepley     if (depth > 1) pMaxNew[dim-1] += depthShift[depth] + depthShift[0];
585cd0c2139SMatthew G Knepley     if (depth > 2) pMaxNew[1]     += depthShift[depth] + depthShift[0] + depthShift[dim-1];
586cd0c2139SMatthew G Knepley 
587cd0c2139SMatthew G Knepley     /* Calculate point offset for each dimension */
588cd0c2139SMatthew G Knepley     depthOffset[depth] = 0;
589cd0c2139SMatthew G Knepley     depthOffset[0]     = depthOffset[depth] + depthShift[depth];
590cd0c2139SMatthew G Knepley     if (depth > 1) depthOffset[dim-1] = depthOffset[0]     + depthShift[0];
591cd0c2139SMatthew G Knepley     if (depth > 2) depthOffset[1]     = depthOffset[dim-1] + depthShift[dim-1];
592cd0c2139SMatthew G Knepley   }
593cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
594cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
595cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
596cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
597cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
598cd0c2139SMatthew G Knepley       const PetscInt  newp   = depthOffset[dep] + oldp;
599cd0c2139SMatthew G Knepley       const PetscInt  splitp = pMaxNew[dep] + p;
600cd0c2139SMatthew G Knepley       const PetscInt *support;
601cd0c2139SMatthew G Knepley       PetscInt        coneSize, supportSize, q, e;
602cd0c2139SMatthew G Knepley 
603cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
604cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
605cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
606cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
607cd0c2139SMatthew G Knepley       if (dep == depth-1) {
608cd0c2139SMatthew G Knepley         const PetscInt ccell = pMaxNew[depth] + p;
609cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
610cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeSize(sdm, ccell, 2 + coneSize);CHKERRQ(ierr);
611cd0c2139SMatthew G Knepley       } else if (dep == 0) {
612cd0c2139SMatthew G Knepley         const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p;
613cd0c2139SMatthew G Knepley 
614cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
615cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
616cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
617cd0c2139SMatthew G Knepley           PetscInt val;
618cd0c2139SMatthew G Knepley 
619cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
620cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) ++q;
621cd0c2139SMatthew G Knepley         }
622cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, newp, q+1);CHKERRQ(ierr);
623cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
624cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
625cd0c2139SMatthew G Knepley           PetscInt val;
626cd0c2139SMatthew G Knepley 
627cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
628cd0c2139SMatthew G Knepley           if ((val == 1) || (val == -(shift + 1))) ++q;
629cd0c2139SMatthew G Knepley         }
630cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, q+1);CHKERRQ(ierr);
631cd0c2139SMatthew G Knepley         /* Add cohesive edges */
632cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeSize(sdm, cedge, 2);CHKERRQ(ierr);
633cd0c2139SMatthew G Knepley         /* Punt for now on support, you loop over closure, extract faces, check which ones are in the label */
634cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
635cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
636cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
637cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
638cd0c2139SMatthew G Knepley           PetscInt val;
639cd0c2139SMatthew G Knepley 
640cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
641cd0c2139SMatthew G Knepley           if ((val == dim-1) || (val == (shift + dim-1))) ++q;
642cd0c2139SMatthew G Knepley         }
643cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, newp, q);CHKERRQ(ierr);
644cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
645cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
646cd0c2139SMatthew G Knepley           PetscInt val;
647cd0c2139SMatthew G Knepley 
648cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
649cd0c2139SMatthew G Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++q;
650cd0c2139SMatthew G Knepley         }
651cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, q);CHKERRQ(ierr);
652cd0c2139SMatthew G Knepley       }
653cd0c2139SMatthew G Knepley     }
654cd0c2139SMatthew G Knepley   }
655cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
656cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
657cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
658cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
659cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
660cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
661cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
662cd0c2139SMatthew G Knepley       const PetscInt  newp   = depthOffset[dep] + oldp;
663cd0c2139SMatthew G Knepley       const PetscInt  splitp = pMaxNew[dep] + p;
664cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
665cd0c2139SMatthew G Knepley       PetscInt        coneSize, supportSize, q, v, e, s;
666cd0c2139SMatthew G Knepley 
667cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
668cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
669cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
670cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
671cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
672cd0c2139SMatthew G Knepley       if (dep == depth-1) {
673cd0c2139SMatthew G Knepley         const PetscInt  ccell = pMaxNew[depth] + p;
674cd0c2139SMatthew G Knepley         const PetscInt *supportF;
675cd0c2139SMatthew G Knepley 
676cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
677cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
678cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
679cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
680cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
681cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
682cd0c2139SMatthew G Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dim-2], splitPoints[dim-2], &v);CHKERRQ(ierr);
683cd0c2139SMatthew G Knepley 
684cd0c2139SMatthew G Knepley           coneNew[2+q] = pMaxNew[dim-2] + v;
685cd0c2139SMatthew G Knepley         }
686cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
687cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
688cd0c2139SMatthew G Knepley         /* Cohesive cell:    Old and new split face, then new cohesive edges */
689cd0c2139SMatthew G Knepley         coneNew[0] = newp;
690cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
691cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
692cd0c2139SMatthew G Knepley           coneNew[2+q] = (pMaxNew[1] - pMaxNew[dim-2]) + (depthShift[1] - depthShift[0]) + coneNew[2+q];
693cd0c2139SMatthew G Knepley         }
694cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, ccell, coneNew);CHKERRQ(ierr);
695cd0c2139SMatthew G Knepley 
696cd0c2139SMatthew G Knepley 
697cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
698cd0c2139SMatthew G Knepley           PetscInt val;
699cd0c2139SMatthew G Knepley 
700cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
701cd0c2139SMatthew G Knepley           if (val < 0) {
702cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
703cd0c2139SMatthew G Knepley             ierr = DMPlexInsertSupport(sdm, newp, s, ccell);CHKERRQ(ierr);
704cd0c2139SMatthew G Knepley           } else {
705cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
706cd0c2139SMatthew G Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, ccell);CHKERRQ(ierr);
707cd0c2139SMatthew G Knepley           }
708cd0c2139SMatthew G Knepley         }
709cd0c2139SMatthew G Knepley       } else if (dep == 0) {
710cd0c2139SMatthew G Knepley         const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p;
711cd0c2139SMatthew G Knepley 
712cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
713cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
714cd0c2139SMatthew G Knepley           PetscInt val;
715cd0c2139SMatthew G Knepley 
716cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
717cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
718cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[1] + support[e];
719cd0c2139SMatthew G Knepley           }
720cd0c2139SMatthew G Knepley         }
721cd0c2139SMatthew G Knepley         supportNew[q] = cedge;
722cd0c2139SMatthew G Knepley 
723cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
724cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
725cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
726cd0c2139SMatthew G Knepley           PetscInt val, edge;
727cd0c2139SMatthew G Knepley 
728cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
729cd0c2139SMatthew G Knepley           if (val == 1) {
730cd0c2139SMatthew G Knepley             ierr = PetscFindInt(support[e], numSplitPoints[1], splitPoints[1], &edge);CHKERRQ(ierr);
731cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
732cd0c2139SMatthew G Knepley             supportNew[q++] = pMaxNew[1] + edge;
733cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
734cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[1] + support[e];
735cd0c2139SMatthew G Knepley           }
736cd0c2139SMatthew G Knepley         }
737cd0c2139SMatthew G Knepley         supportNew[q] = cedge;
738cd0c2139SMatthew G Knepley         ierr          = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
739cd0c2139SMatthew G Knepley         /* Cohesive edge:    Old and new split vertex, punting on support */
740cd0c2139SMatthew G Knepley         coneNew[0] = newp;
741cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
742cd0c2139SMatthew G Knepley         ierr       = DMPlexSetCone(sdm, cedge, coneNew);CHKERRQ(ierr);
743cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
744cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
745cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
746cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
747cd0c2139SMatthew G Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dim-3], splitPoints[dim-3], &v);CHKERRQ(ierr);
748cd0c2139SMatthew G Knepley 
749cd0c2139SMatthew G Knepley           coneNew[q] = pMaxNew[dim-3] + v;
750cd0c2139SMatthew G Knepley         }
751cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
752cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
753cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
754cd0c2139SMatthew G Knepley           PetscInt val;
755cd0c2139SMatthew G Knepley 
756cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
757cd0c2139SMatthew G Knepley           if ((val == dim-1) || (val == (shift + dim-1))) {
758cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[dim-1] + support[e];
759cd0c2139SMatthew G Knepley           }
760cd0c2139SMatthew G Knepley         }
761cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
762cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
763cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
764cd0c2139SMatthew G Knepley           PetscInt val, face;
765cd0c2139SMatthew G Knepley 
766cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
767cd0c2139SMatthew G Knepley           if (val == dim-1) {
768cd0c2139SMatthew G Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dim-1], splitPoints[dim-1], &face);CHKERRQ(ierr);
769cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
770cd0c2139SMatthew G Knepley             supportNew[q++] = pMaxNew[dim-1] + face;
771cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
772cd0c2139SMatthew G Knepley             supportNew[q++] = depthOffset[dim-1] + support[e];
773cd0c2139SMatthew G Knepley           }
774cd0c2139SMatthew G Knepley         }
775cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
776cd0c2139SMatthew G Knepley       }
777cd0c2139SMatthew G Knepley     }
778cd0c2139SMatthew G Knepley   }
779cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
780cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
781cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
782cd0c2139SMatthew G Knepley     IS              pIS;
783cd0c2139SMatthew G Knepley     PetscInt        numPoints;
784cd0c2139SMatthew G Knepley     const PetscInt *points;
785cd0c2139SMatthew G Knepley 
786cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
787cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
788cd0c2139SMatthew G Knepley     if (!pIS) continue;
789cd0c2139SMatthew G Knepley     dep  = -dep - shift;
790cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
791cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
792cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
793cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
794cd0c2139SMatthew G Knepley       const PetscInt  newp = depthOffset[dep] + oldp;
795cd0c2139SMatthew G Knepley       const PetscInt *cone;
796cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
797cd0c2139SMatthew G Knepley       PetscBool       replaced = PETSC_FALSE;
798cd0c2139SMatthew G Knepley 
799cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
800cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
801cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
802cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
803cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
804cd0c2139SMatthew G Knepley         const PetscInt coldp = cone[c] - depthOffset[dep-1];
805cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
806cd0c2139SMatthew G Knepley 
807cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
808cd0c2139SMatthew G Knepley         if (val == dep-1) {
809cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
810cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
811cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
812cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
813cd0c2139SMatthew G Knepley           replaced = PETSC_TRUE;
814cd0c2139SMatthew G Knepley         }
815cd0c2139SMatthew G Knepley       }
816cd0c2139SMatthew G Knepley       if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp);
817cd0c2139SMatthew G Knepley     }
818cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
819cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
820cd0c2139SMatthew G Knepley   }
821cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
822cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
823cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
824cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
825cd0c2139SMatthew G Knepley   ierr = DMPlexGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
826cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
827cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
828cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
829cd0c2139SMatthew G Knepley     const PetscInt newp   = depthOffset[0] + splitPoints[0][v];
830cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
831cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
832cd0c2139SMatthew G Knepley 
833cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
834cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
835cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
836cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
837cd0c2139SMatthew G Knepley   }
838cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
839cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
840cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
841cd0c2139SMatthew G Knepley   /* Step 10: Labels */
842cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
843cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
844cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
845cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
846cd0c2139SMatthew G Knepley       const PetscInt newp   = depthOffset[dep] + splitPoints[dep][p];
847cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
848cd0c2139SMatthew G Knepley       PetscInt       l;
849cd0c2139SMatthew G Knepley 
850cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
851cd0c2139SMatthew G Knepley         DMLabel     mlabel;
852cd0c2139SMatthew G Knepley         const char *lname;
853cd0c2139SMatthew G Knepley         PetscInt    val;
854cd0c2139SMatthew G Knepley 
855cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
856cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
857cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
858cd0c2139SMatthew G Knepley         if (val >= 0) {
859cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
860cd0c2139SMatthew G Knepley           if (dep == 0) {
861cd0c2139SMatthew G Knepley             const PetscInt cedge = pMaxNew[1] + (depthShift[1] - depthShift[0]) + p;
862cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
863cd0c2139SMatthew G Knepley           }
864cd0c2139SMatthew G Knepley         }
865cd0c2139SMatthew G Knepley       }
866cd0c2139SMatthew G Knepley     }
867cd0c2139SMatthew G Knepley   }
868cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
869cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
870cd0c2139SMatthew G Knepley 
871cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
872cd0c2139SMatthew G Knepley     if (pointIS[dep]) {ierr = ISRestoreIndices(pointIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
873cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pointIS[dep]);CHKERRQ(ierr);
874cd0c2139SMatthew G Knepley   }
875cd0c2139SMatthew G Knepley   if (label) {
876cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
877cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
878cd0c2139SMatthew G Knepley   }
879cd0c2139SMatthew G Knepley   ierr = PetscFree5(depthShift, depthOffset, pMaxNew, coneNew, supportNew);CHKERRQ(ierr);
880cd0c2139SMatthew G Knepley   ierr = PetscFree3(pointIS, numSplitPoints, splitPoints);CHKERRQ(ierr);
881cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
882cd0c2139SMatthew G Knepley }
883cd0c2139SMatthew G Knepley 
884cd0c2139SMatthew G Knepley #undef __FUNCT__
885cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
886cd0c2139SMatthew G Knepley /*@C
887cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
888cd0c2139SMatthew G Knepley 
889cd0c2139SMatthew G Knepley   Collective on dm
890cd0c2139SMatthew G Knepley 
891cd0c2139SMatthew G Knepley   Input Parameters:
892cd0c2139SMatthew G Knepley + dm - The original DM
893cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces (this could be auto-generated)
894cd0c2139SMatthew G Knepley 
895cd0c2139SMatthew G Knepley   Output Parameters:
896cd0c2139SMatthew G Knepley - dmSplit - The new DM
897cd0c2139SMatthew G Knepley 
898cd0c2139SMatthew G Knepley   Level: developer
899cd0c2139SMatthew G Knepley 
9002be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
901cd0c2139SMatthew G Knepley @*/
902cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
903cd0c2139SMatthew G Knepley {
904cd0c2139SMatthew G Knepley   DM             sdm;
905cd0c2139SMatthew G Knepley   PetscInt       dim;
906cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
907cd0c2139SMatthew G Knepley 
908cd0c2139SMatthew G Knepley   PetscFunctionBegin;
909cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
910cd0c2139SMatthew G Knepley   PetscValidPointer(dmSplit, 4);
911cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
912cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
913cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
914cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr);
915cd0c2139SMatthew G Knepley   switch (dim) {
916cd0c2139SMatthew G Knepley   case 2:
917cd0c2139SMatthew G Knepley   case 3:
918cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
919cd0c2139SMatthew G Knepley     break;
920cd0c2139SMatthew G Knepley   default:
921cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
922cd0c2139SMatthew G Knepley   }
923cd0c2139SMatthew G Knepley   *dmSplit = sdm;
924cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
925cd0c2139SMatthew G Knepley }
926cd0c2139SMatthew G Knepley 
927cd0c2139SMatthew G Knepley #undef __FUNCT__
9282be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
929cd0c2139SMatthew G Knepley /*@
9302be2b188SMatthew G Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking vertices on an internal surface, we add all other mesh pieces
931cd0c2139SMatthew G Knepley   to complete the surface
932cd0c2139SMatthew G Knepley 
933cd0c2139SMatthew G Knepley   Input Parameters:
934cd0c2139SMatthew G Knepley + dm - The DM
935cd0c2139SMatthew G Knepley - label - A DMLabel marking the surface vertices
936cd0c2139SMatthew G Knepley 
937cd0c2139SMatthew G Knepley   Output Parameter:
938cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
939cd0c2139SMatthew G Knepley 
940cd0c2139SMatthew G Knepley   Level: developer
941cd0c2139SMatthew G Knepley 
9422be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
943cd0c2139SMatthew G Knepley @*/
9442be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label)
945cd0c2139SMatthew G Knepley {
946cd0c2139SMatthew G Knepley   IS              dimIS;
947cd0c2139SMatthew G Knepley   const PetscInt *points;
948cd0c2139SMatthew G Knepley   PetscInt        shift = 100, dim, dep, cStart, cEnd, numPoints, p, val;
949cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
950cd0c2139SMatthew G Knepley 
951cd0c2139SMatthew G Knepley   PetscFunctionBegin;
952cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
953cd0c2139SMatthew G Knepley   /* Cell orientation for face gives the side of the fault */
954cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
955cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
956cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
957cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
958cd0c2139SMatthew G Knepley   for (p = 0; p < numPoints; ++p) {
959cd0c2139SMatthew G Knepley     const PetscInt *support;
960cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
961cd0c2139SMatthew G Knepley 
962cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
963cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
964cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
965cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
966cd0c2139SMatthew G Knepley       const PetscInt *cone, *ornt;
967cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
968cd0c2139SMatthew G Knepley       PetscBool       pos = PETSC_TRUE;
969cd0c2139SMatthew G Knepley 
970cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
971cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
972cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, support[s], &ornt);CHKERRQ(ierr);
973cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
974cd0c2139SMatthew G Knepley         if (cone[c] == points[p]) {
975cd0c2139SMatthew G Knepley           if (ornt[c] >= 0) {
976cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, support[s],   shift+dim);CHKERRQ(ierr);
977cd0c2139SMatthew G Knepley           } else {
978cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, support[s], -(shift+dim));CHKERRQ(ierr);
979cd0c2139SMatthew G Knepley             pos  = PETSC_FALSE;
980cd0c2139SMatthew G Knepley           }
981cd0c2139SMatthew G Knepley           break;
982cd0c2139SMatthew G Knepley         }
983cd0c2139SMatthew G Knepley       }
984cd0c2139SMatthew 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]);
985cd0c2139SMatthew G Knepley       /* Put faces touching the fault in the label */
986cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
987cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
988cd0c2139SMatthew G Knepley 
989cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
990cd0c2139SMatthew G Knepley         if (val == -1) {
991cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
992cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
993cd0c2139SMatthew G Knepley 
994cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
995cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
996cd0c2139SMatthew G Knepley             const PetscInt clp = closure[cl];
997cd0c2139SMatthew G Knepley 
998cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
999cd0c2139SMatthew G Knepley             if ((val >= 0) && (val < dim-1)) {
1000cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1001cd0c2139SMatthew G Knepley               break;
1002cd0c2139SMatthew G Knepley             }
1003cd0c2139SMatthew G Knepley           }
1004cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1005cd0c2139SMatthew G Knepley         }
1006cd0c2139SMatthew G Knepley       }
1007cd0c2139SMatthew G Knepley     }
1008cd0c2139SMatthew G Knepley   }
1009cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1010cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1011cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1012cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1013cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
1014cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1015cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1016cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1017cd0c2139SMatthew G Knepley   for (p = 0; p < numPoints; ++p) {
1018cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
1019cd0c2139SMatthew G Knepley     PetscInt  starSize, s;
1020cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1021cd0c2139SMatthew G Knepley 
1022cd0c2139SMatthew G Knepley     /* First mark cells connected to the fault */
1023cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1024cd0c2139SMatthew G Knepley     while (again) {
1025cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1026cd0c2139SMatthew G Knepley       again = 0;
1027cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1028cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1029cd0c2139SMatthew G Knepley         const PetscInt *cone;
1030cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1031cd0c2139SMatthew G Knepley 
1032cd0c2139SMatthew G Knepley         if ((point < cStart) || (point >= cEnd)) continue;
1033cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1034cd0c2139SMatthew G Knepley         if (val != -1) continue;
1035cd0c2139SMatthew G Knepley         again = 2;
1036cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1037cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1038cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1039cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1040cd0c2139SMatthew G Knepley           if (val != -1) {
1041cd0c2139SMatthew 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);
1042cd0c2139SMatthew G Knepley             if (val > 0) {
1043cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point,   shift+dim);CHKERRQ(ierr);
1044cd0c2139SMatthew G Knepley             } else {
1045cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, -(shift+dim));CHKERRQ(ierr);
1046cd0c2139SMatthew G Knepley             }
1047cd0c2139SMatthew G Knepley             again = 1;
1048cd0c2139SMatthew G Knepley             break;
1049cd0c2139SMatthew G Knepley           }
1050cd0c2139SMatthew G Knepley         }
1051cd0c2139SMatthew G Knepley       }
1052cd0c2139SMatthew G Knepley     }
1053cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1054cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1055cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1056cd0c2139SMatthew G Knepley 
1057cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1058cd0c2139SMatthew G Knepley       if (val == -1) {
1059cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1060cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1061cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1062cd0c2139SMatthew G Knepley 
1063cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1064cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1065cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1066cd0c2139SMatthew G Knepley 
1067cd0c2139SMatthew G Knepley           if ((spoint < cStart) || (spoint >= cEnd)) continue;
1068cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1069cd0c2139SMatthew 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);
1070cd0c2139SMatthew G Knepley           ierr = DMPlexGetLabelValue(dm, "depth", point, &dep);CHKERRQ(ierr);
1071cd0c2139SMatthew G Knepley           if (val > 0) {
1072cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1073cd0c2139SMatthew G Knepley           } else {
1074cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1075cd0c2139SMatthew G Knepley           }
1076cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1077cd0c2139SMatthew G Knepley           break;
1078cd0c2139SMatthew G Knepley         }
1079cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1080cd0c2139SMatthew G Knepley         if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1081cd0c2139SMatthew G Knepley       }
1082cd0c2139SMatthew G Knepley     }
1083cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1084cd0c2139SMatthew G Knepley   }
1085cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1086cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1087cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1088cd0c2139SMatthew G Knepley }
1089cd0c2139SMatthew G Knepley 
1090cd0c2139SMatthew G Knepley #undef __FUNCT__
1091efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1092efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1093efa14ee0SMatthew G Knepley 
1094efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1095efa14ee0SMatthew G Knepley */
1096830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1097efa14ee0SMatthew G Knepley {
1098efa14ee0SMatthew G Knepley   IS               subvertexIS;
1099efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
110077d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1101efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1102efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1103efa14ee0SMatthew G Knepley 
1104efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1105efa14ee0SMatthew G Knepley   *numFaces = 0;
1106efa14ee0SMatthew G Knepley   *nFV      = 0;
1107efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1108efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
110977d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
111077d178adSMatthew G. Knepley   ierr = PetscMalloc3(pSize,PetscInt,&pStart,pSize,PetscInt,&pEnd,pSize,PetscInt,&pMax);CHKERRQ(ierr);
11110298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[depth], depth>1 ? &pMax[depth-1] : NULL, depth > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1112efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1113efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1114efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1115efa14ee0SMatthew G Knepley   }
1116efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1117830e53efSMatthew G. Knepley   ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1118efa14ee0SMatthew G Knepley   if (subvertexIS) {
1119efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1120efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1121efa14ee0SMatthew G Knepley   }
1122efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1123efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
11240298fd71SBarry Smith     PetscInt      *star   = NULL;
1125efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1126efa14ee0SMatthew G Knepley 
1127efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1128efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1129efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1130efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1131efa14ee0SMatthew G Knepley     }
1132efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1133efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
11340298fd71SBarry Smith       PetscInt      *closure = NULL;
1135efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1136efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1137efa14ee0SMatthew G Knepley 
1138efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
113965560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
114082f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1141efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1142efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1143efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1144efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1145efa14ee0SMatthew G Knepley 
1146efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1147efa14ee0SMatthew G Knepley           ++numCorners;
1148efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1149830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1150efa14ee0SMatthew G Knepley         }
1151efa14ee0SMatthew G Knepley       }
115218ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
115382f516ccSBarry 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);
1154efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1155007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1156007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1157007baee2SMatthew G. Knepley 
1158efa14ee0SMatthew G Knepley         ++(*numFaces);
1159efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1160efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1161efa14ee0SMatthew G Knepley         }
1162007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1163007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1164007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1165007baee2SMatthew G. Knepley         }
1166007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1167efa14ee0SMatthew G Knepley       }
1168efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1169efa14ee0SMatthew G Knepley     }
1170efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1171efa14ee0SMatthew G Knepley   }
1172efa14ee0SMatthew G Knepley   if (subvertexIS) {
1173efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1174efa14ee0SMatthew G Knepley   }
1175efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1176efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1177efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1178efa14ee0SMatthew G Knepley }
1179efa14ee0SMatthew G Knepley 
1180efa14ee0SMatthew G Knepley #undef __FUNCT__
1181efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1182830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1183efa14ee0SMatthew G Knepley {
1184efa14ee0SMatthew G Knepley   IS               subvertexIS;
1185efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1186efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1187efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1188efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1189efa14ee0SMatthew G Knepley 
1190efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1191efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1192efa14ee0SMatthew G Knepley   ierr = PetscMalloc3(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd,dim+1,PetscInt,&pMax);CHKERRQ(ierr);
11930298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1194efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1195efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1196efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1197efa14ee0SMatthew G Knepley   }
1198efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1199830e53efSMatthew G. Knepley   ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1200efa14ee0SMatthew G Knepley   if (subvertexIS) {
1201efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1202efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1203efa14ee0SMatthew G Knepley   }
1204efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1205efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
12060298fd71SBarry Smith     PetscInt      *star   = NULL;
1207efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1208efa14ee0SMatthew G Knepley 
1209efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1210efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1211efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1212efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1213efa14ee0SMatthew G Knepley     }
1214efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1215efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
12160298fd71SBarry Smith       PetscInt      *closure = NULL;
1217efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1218efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1219efa14ee0SMatthew G Knepley 
1220efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1221efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
122282f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1223efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1224efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1225efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1226efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1227efa14ee0SMatthew G Knepley 
1228efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1229efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1230830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1231efa14ee0SMatthew G Knepley         }
1232efa14ee0SMatthew G Knepley       }
1233efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1234efa14ee0SMatthew G Knepley         const PetscInt *support;
1235efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1236efa14ee0SMatthew G Knepley 
1237efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1238efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1239efa14ee0SMatthew G Knepley 
1240efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1241efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1242efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1243efa14ee0SMatthew G Knepley               break;
1244efa14ee0SMatthew G Knepley             }
1245efa14ee0SMatthew G Knepley           }
1246efa14ee0SMatthew G Knepley         }
1247efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1248efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1249efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1250efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1251efa14ee0SMatthew G Knepley         }
1252efa14ee0SMatthew G Knepley       }
1253efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1254efa14ee0SMatthew G Knepley     }
1255efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1256efa14ee0SMatthew G Knepley   }
1257efa14ee0SMatthew G Knepley   if (subvertexIS) {
1258efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1259efa14ee0SMatthew G Knepley   }
1260efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1261efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1262efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1263efa14ee0SMatthew G Knepley }
1264efa14ee0SMatthew G Knepley 
1265efa14ee0SMatthew G Knepley #undef __FUNCT__
1266766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
1267766ab985SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm)
1268766ab985SMatthew G. Knepley {
1269766ab985SMatthew G. Knepley   const PetscInt *cone;
1270766ab985SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, p, coneSize;
1271766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
1272766ab985SMatthew G. Knepley 
1273812bfc34SJed Brown   PetscFunctionBegin;
1274c0ed958bSJed Brown   *numFaces = 0;
1275c0ed958bSJed Brown   *nFV = 0;
1276766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1277766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1278766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1279766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
1280766ab985SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
1281766ab985SMatthew G. Knepley   *numFaces = cEnd - cMax;
1282766ab985SMatthew G. Knepley   *nFV      = hasLagrange ? coneSize/3 : coneSize/2;
1283766ab985SMatthew G. Knepley   ierr = PetscMalloc(*numFaces *2 * sizeof(PetscInt), subCells);CHKERRQ(ierr);
1284766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1285766ab985SMatthew G. Knepley     const PetscInt *cells;
1286766ab985SMatthew G. Knepley     PetscInt        numCells;
1287766ab985SMatthew G. Knepley 
1288766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1289766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
1290766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
1291766ab985SMatthew G. Knepley     }
1292766ab985SMatthew G. Knepley     /* Negative face */
1293766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
1294766ab985SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1295766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
1296766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
1297766ab985SMatthew G. Knepley       (*subCells)[(c-cMax)*2+p] = cells[p];
1298766ab985SMatthew G. Knepley     }
1299766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
1300766ab985SMatthew G. Knepley     /* Positive face is not included */
1301766ab985SMatthew G. Knepley   }
1302766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1303766ab985SMatthew G. Knepley }
1304766ab985SMatthew G. Knepley 
1305766ab985SMatthew G. Knepley #undef __FUNCT__
1306766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
1307766ab985SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, DMLabel subpointMap, DM subdm)
1308766ab985SMatthew G. Knepley {
1309766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
1310766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
1311766ab985SMatthew G. Knepley   PetscErrorCode ierr;
1312766ab985SMatthew G. Knepley 
1313812bfc34SJed Brown   PetscFunctionBegin;
1314766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1315766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1316766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1317766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
1318766ab985SMatthew G. Knepley   ierr = PetscMalloc2(dim+1,PetscInt,&pStart,dim+1,PetscInt,&pEnd);CHKERRQ(ierr);
1319766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
1320766ab985SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1321766ab985SMatthew G. Knepley   }
1322766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1323766ab985SMatthew G. Knepley     const PetscInt *cone;
1324766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
1325766ab985SMatthew G. Knepley     PetscInt        coneSize, closureSize, cl;
1326766ab985SMatthew G. Knepley 
1327766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
1328766ab985SMatthew G. Knepley     if (hasLagrange) {
1329766ab985SMatthew G. Knepley       if (coneSize != 3) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1330766ab985SMatthew G. Knepley     } else {
1331766ab985SMatthew G. Knepley       if (coneSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1332766ab985SMatthew G. Knepley     }
1333766ab985SMatthew G. Knepley     /* Negative face */
1334766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1335766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1336766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1337766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
1338766ab985SMatthew G. Knepley 
1339766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
1340766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
1341766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1342766ab985SMatthew G. Knepley           break;
1343766ab985SMatthew G. Knepley         }
1344766ab985SMatthew G. Knepley       }
1345766ab985SMatthew G. Knepley     }
1346766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1347766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
1348766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
1349766ab985SMatthew G. Knepley       const PetscInt *support;
1350766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
1351766ab985SMatthew G. Knepley 
1352766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
1353766ab985SMatthew G. Knepley       if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells");
1354766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
1355766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
1356766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1357766ab985SMatthew G. Knepley       }
1358766ab985SMatthew G. Knepley     }
1359766ab985SMatthew G. Knepley   }
1360766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
1361766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1362766ab985SMatthew G. Knepley }
1363766ab985SMatthew G. Knepley 
1364766ab985SMatthew G. Knepley #undef __FUNCT__
1365e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
1366e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1367e6ccafaeSMatthew G Knepley {
136882f516ccSBarry Smith   MPI_Comm       comm;
1369e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
1370e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
1371e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
1372e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1373e6ccafaeSMatthew G Knepley 
137482f516ccSBarry Smith   PetscFunctionBegin;
137582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1376e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr);
1377e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
1378e6ccafaeSMatthew G Knepley 
1379*ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
1380*ddeab2a6SMatthew G. Knepley     /* Triangle */
1381e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
1382e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1383*ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
1384*ddeab2a6SMatthew G. Knepley     /* Triangle */
1385*ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1386*ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1387*ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
1388*ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
1389*ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1390*ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1391e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
1392e6ccafaeSMatthew G Knepley     /* Quadratic line */
1393e6ccafaeSMatthew G Knepley     faceSize  = 1;
1394e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
1395e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
1396e6ccafaeSMatthew G Knepley     /* Quads */
1397e6ccafaeSMatthew G Knepley     faceSize = 2;
1398e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
1399e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1400e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
1401e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
1402e6ccafaeSMatthew G Knepley     } else {
1403e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
1404e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
1405e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
1406e6ccafaeSMatthew G Knepley     }
1407e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
1408e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
1409e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1410e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
1411e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1412e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
1413e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
1414e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1415e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1416e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
1417e6ccafaeSMatthew G Knepley     };
1418e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
1419e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
1420e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
1421e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
1422e6ccafaeSMatthew G Knepley     };
1423e6ccafaeSMatthew G Knepley 
1424e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
1425e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
1426e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
1427e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
1428e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
1429e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1430e6ccafaeSMatthew G Knepley 
1431e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
1432e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
1433e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
1434e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
1435e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
1436e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1437e6ccafaeSMatthew G Knepley               break;
1438e6ccafaeSMatthew G Knepley             }
1439e6ccafaeSMatthew G Knepley           }
1440e6ccafaeSMatthew G Knepley         }
1441e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1442e6ccafaeSMatthew G Knepley         break;
1443e6ccafaeSMatthew G Knepley       }
1444e6ccafaeSMatthew G Knepley     }
1445e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
1446e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1447e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1448e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
1449e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
1450e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
1451e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
1452e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
1453e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
1454e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
1455e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1456e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1457e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1458e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
1459e6ccafaeSMatthew G Knepley     };
1460e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
1461e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
1462e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
1463e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
1464e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
1465e6ccafaeSMatthew G Knepley     };
1466e6ccafaeSMatthew G Knepley 
1467e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
1468e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
1469e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
1470e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
1471e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
1472e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1473e6ccafaeSMatthew G Knepley 
1474e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
1475e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
1476e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
1477e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
1478e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
1479e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1480e6ccafaeSMatthew G Knepley               break;
1481e6ccafaeSMatthew G Knepley             }
1482e6ccafaeSMatthew G Knepley           }
1483e6ccafaeSMatthew G Knepley         }
1484e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1485e6ccafaeSMatthew G Knepley         break;
1486e6ccafaeSMatthew G Knepley       }
1487e6ccafaeSMatthew G Knepley     }
1488e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
1489e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1490e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1491e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
1492e6ccafaeSMatthew G Knepley     /* Hexes
1493e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1494e6ccafaeSMatthew G Knepley        pointing up at the second.
1495e6ccafaeSMatthew G Knepley 
1496e6ccafaeSMatthew G Knepley           7---6
1497e6ccafaeSMatthew G Knepley          /|  /|
1498e6ccafaeSMatthew G Knepley         4---5 |
1499*ddeab2a6SMatthew G. Knepley         | 1-|-2
1500e6ccafaeSMatthew G Knepley         |/  |/
1501*ddeab2a6SMatthew G. Knepley         0---3
1502e6ccafaeSMatthew G Knepley 
1503e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
1504e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
1505e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
1506e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1507e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
1508e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
1509e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
1510*ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
1511*ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
1512*ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
1513*ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
1514e6ccafaeSMatthew G Knepley     };
1515e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
1516*ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
1517e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
1518*ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
1519*ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
1520*ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
1521*ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
1522e6ccafaeSMatthew G Knepley     };
1523e6ccafaeSMatthew G Knepley 
1524e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
1525e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
1526e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
1527e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
1528e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
1529e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1530e6ccafaeSMatthew G Knepley 
1531e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
1532e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
1533e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
1534e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
1535e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
1536e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
1537e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
1538e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1539e6ccafaeSMatthew G Knepley               break;
1540e6ccafaeSMatthew G Knepley             }
1541e6ccafaeSMatthew G Knepley           }
1542e6ccafaeSMatthew G Knepley         }
1543e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1544e6ccafaeSMatthew G Knepley         break;
1545e6ccafaeSMatthew G Knepley       }
1546e6ccafaeSMatthew G Knepley     }
1547e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
1548e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1549e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1550e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
1551e6ccafaeSMatthew G Knepley     /* Quadratic tet */
1552e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
1553e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
1554e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
1555e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
1556e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
1557e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
1558e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
1559e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
1560e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
1561e6ccafaeSMatthew G Knepley     };
1562e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
1563e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
1564e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
1565e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
1566e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
1567e6ccafaeSMatthew G Knepley     };
1568e6ccafaeSMatthew G Knepley 
1569e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
1570e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
1571e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
1572e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
1573e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
1574e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1575e6ccafaeSMatthew G Knepley 
1576e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
1577e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
1578e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
1579e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
1580e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
1581e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
1582e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
1583e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1584e6ccafaeSMatthew G Knepley               break;
1585e6ccafaeSMatthew G Knepley             }
1586e6ccafaeSMatthew G Knepley           }
1587e6ccafaeSMatthew G Knepley         }
1588e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1589e6ccafaeSMatthew G Knepley         break;
1590e6ccafaeSMatthew G Knepley       }
1591e6ccafaeSMatthew G Knepley     }
1592e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
1593e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1594e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1595e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
1596e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
1597e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
1598e6ccafaeSMatthew G Knepley        pointing up at the second.
1599e6ccafaeSMatthew G Knepley 
1600e6ccafaeSMatthew G Knepley          7---6
1601e6ccafaeSMatthew G Knepley         /|  /|
1602e6ccafaeSMatthew G Knepley        4---5 |
1603e6ccafaeSMatthew G Knepley        | 3-|-2
1604e6ccafaeSMatthew G Knepley        |/  |/
1605e6ccafaeSMatthew G Knepley        0---1
1606e6ccafaeSMatthew G Knepley 
1607e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
1608e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
1609e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
1610e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
1611e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
1612e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
1613e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
1614e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
1615e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
1616e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
1617e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
1618e6ccafaeSMatthew G Knepley     };
1619e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
1620e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
1621e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
1622e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
1623e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
1624e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
1625e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
1626e6ccafaeSMatthew G Knepley     };
1627e6ccafaeSMatthew G Knepley 
1628e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
1629e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
1630e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
1631e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
1632e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
1633e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
1634e6ccafaeSMatthew G Knepley 
1635e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
1636e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
1637e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
1638e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
1639e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
1640e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
1641e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
1642e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
1643e6ccafaeSMatthew G Knepley               break;
1644e6ccafaeSMatthew G Knepley             }
1645e6ccafaeSMatthew G Knepley           }
1646e6ccafaeSMatthew G Knepley         }
1647e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
1648e6ccafaeSMatthew G Knepley         break;
1649e6ccafaeSMatthew G Knepley       }
1650e6ccafaeSMatthew G Knepley     }
1651e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
1652e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
1653e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
1654e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
1655e6ccafaeSMatthew G Knepley   if (!posOrient) {
1656e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
1657e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
1658e6ccafaeSMatthew G Knepley   } else {
1659e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
1660e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
1661e6ccafaeSMatthew G Knepley   }
1662e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
1663e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1664e6ccafaeSMatthew G Knepley }
1665e6ccafaeSMatthew G Knepley 
1666e6ccafaeSMatthew G Knepley #undef __FUNCT__
1667e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
1668e6ccafaeSMatthew G Knepley /*
1669e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
1670e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
1671e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
1672e6ccafaeSMatthew G Knepley */
1673e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1674e6ccafaeSMatthew G Knepley {
16750298fd71SBarry Smith   const PetscInt *cone = NULL;
1676e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
1677e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
1678e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1679e6ccafaeSMatthew G Knepley 
1680e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
1681e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
1682e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
1683e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
1684e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
1685e6ccafaeSMatthew G Knepley 
1686e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
1687e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
1688e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
1689e6ccafaeSMatthew G Knepley       }
1690e6ccafaeSMatthew G Knepley     }
1691e6ccafaeSMatthew G Knepley     if (found) {
1692e6ccafaeSMatthew G Knepley       indices[v2]      = v;
1693e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
1694e6ccafaeSMatthew G Knepley       ++v2;
1695e6ccafaeSMatthew G Knepley     } else {
1696e6ccafaeSMatthew G Knepley       oppositeVertex = v;
1697e6ccafaeSMatthew G Knepley     }
1698e6ccafaeSMatthew G Knepley   }
1699e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
1700e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1701e6ccafaeSMatthew G Knepley }
1702e6ccafaeSMatthew G Knepley 
1703e6ccafaeSMatthew G Knepley #undef __FUNCT__
1704cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
1705e6ccafaeSMatthew G Knepley /*
1706cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
1707e6ccafaeSMatthew G Knepley 
1708e6ccafaeSMatthew G Knepley   Not collective
1709e6ccafaeSMatthew G Knepley 
1710e6ccafaeSMatthew G Knepley   Input Parameters:
1711e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
1712e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
1713e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
1714e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
1715e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
1716e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
1717e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
1718e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
1719e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
1720e6ccafaeSMatthew G Knepley 
1721e6ccafaeSMatthew G Knepley   Output Parameters:
1722e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
1723e6ccafaeSMatthew G Knepley 
1724e6ccafaeSMatthew G Knepley   Level: developer
1725e6ccafaeSMatthew G Knepley */
1726cd0c2139SMatthew 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)
1727e6ccafaeSMatthew G Knepley {
172882f516ccSBarry Smith   MPI_Comm        comm;
1729e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
1730e6ccafaeSMatthew G Knepley   const PetscInt *faces;
1731e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
1732e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1733e6ccafaeSMatthew G Knepley 
1734e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
173582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1736e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
1737e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
1738e6ccafaeSMatthew G Knepley #if 0
1739e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
1740e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
1741e6ccafaeSMatthew G Knepley #else
1742e6ccafaeSMatthew G Knepley   {
1743e6ccafaeSMatthew G Knepley     PetscInt f;
1744e6ccafaeSMatthew G Knepley 
1745e6ccafaeSMatthew G Knepley     numFaces = 0;
1746e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
1747e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
1748e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
1749e6ccafaeSMatthew G Knepley 
1750e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
1751e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
1752e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
1753e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
1754e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
1755e6ccafaeSMatthew G Knepley         PetscInt       v;
1756e6ccafaeSMatthew G Knepley 
1757e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
1758e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
1759e6ccafaeSMatthew G Knepley         }
1760e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
1761e6ccafaeSMatthew G Knepley       }
1762e6ccafaeSMatthew G Knepley       if (d == dof) {
1763e6ccafaeSMatthew G Knepley         numFaces               = 1;
1764e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
1765e6ccafaeSMatthew G Knepley       }
1766e6ccafaeSMatthew G Knepley     }
1767e6ccafaeSMatthew G Knepley   }
1768e6ccafaeSMatthew G Knepley #endif
1769e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
1770e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
1771e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
1772766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
1773e6ccafaeSMatthew G Knepley   } else {
1774e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
1775e6ccafaeSMatthew G Knepley     PetscBool posOriented;
1776e6ccafaeSMatthew G Knepley 
1777e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
1778e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
1779e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
1780e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
1781e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
1782e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
1783e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
1784e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
1785e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
1786e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
1787e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
1788e6ccafaeSMatthew G Knepley           break;
1789e6ccafaeSMatthew G Knepley         }
1790e6ccafaeSMatthew G Knepley       }
1791e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
1792e6ccafaeSMatthew G Knepley     }
1793e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
1794e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
1795e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
1796e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
1797e6ccafaeSMatthew G Knepley   }
1798ef07cca7SMatthew G. Knepley #if 0
1799e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
1800ef07cca7SMatthew G. Knepley #else
1801ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
1802ef07cca7SMatthew G. Knepley #endif
1803e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1804e6ccafaeSMatthew G Knepley }
1805e6ccafaeSMatthew G Knepley 
1806e6ccafaeSMatthew G Knepley #undef __FUNCT__
1807e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
1808830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm)
1809e6ccafaeSMatthew G Knepley {
181082f516ccSBarry Smith   MPI_Comm        comm;
1811efa14ee0SMatthew G Knepley   DMLabel         vertexLabel, subpointMap;
1812efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
1813efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
1814efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
1815efa14ee0SMatthew G Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
1816efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
1817e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
1818e6ccafaeSMatthew G Knepley 
1819e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
182082f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1821efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
1822efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
1823efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
1824efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
1825efa14ee0SMatthew G Knepley   ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr);
1826830e53efSMatthew G. Knepley   ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);
1827efa14ee0SMatthew G Knepley   /* Setup chart */
1828efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
1829efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
1830efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
1831efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
1832e6ccafaeSMatthew G Knepley   /* Set cone sizes */
1833e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
1834efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
1835e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
1836efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
1837efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
1838efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
1839efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
1840e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
1841e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
1842e6ccafaeSMatthew G Knepley   }
1843e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
1844e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
1845e6ccafaeSMatthew G Knepley   }
1846e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
1847e6ccafaeSMatthew G Knepley   /* Create face cones */
1848efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
18490298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
1850efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
1851e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
1852e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
1853efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
18540298fd71SBarry Smith     PetscInt      *closure = NULL;
1855efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
1856e6ccafaeSMatthew G Knepley 
1857e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1858efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1859efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
1860e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
1861e6ccafaeSMatthew G Knepley 
1862efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
1863efa14ee0SMatthew G Knepley         ++numCorners;
1864efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
1865efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
1866efa14ee0SMatthew G Knepley           closure[faceSize] = point;
186765560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
1868e6ccafaeSMatthew G Knepley           ++faceSize;
1869e6ccafaeSMatthew G Knepley         }
1870e6ccafaeSMatthew G Knepley       }
1871e6ccafaeSMatthew G Knepley     }
1872efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
1873efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
1874cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
1875e6ccafaeSMatthew G Knepley     }
187665560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1877e6ccafaeSMatthew G Knepley   }
1878efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
1879e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
1880e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
1881e6ccafaeSMatthew G Knepley   /* Build coordinates */
1882efa14ee0SMatthew G Knepley   {
1883efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
1884efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
1885efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
1886285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
1887efa14ee0SMatthew G Knepley 
1888e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
1889e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
1890e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
1891285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
1892285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
1893285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
1894efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
1895efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
1896efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
1897efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
1898efa14ee0SMatthew G Knepley       PetscInt       dof;
1899efa14ee0SMatthew G Knepley 
1900efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
1901efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
1902285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
1903e6ccafaeSMatthew G Knepley     }
1904e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
1905e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
1906e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
1907e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
1908e6ccafaeSMatthew G Knepley     ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr);
1909830e53efSMatthew G. Knepley     if (coordSize) {
1910e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
1911e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
1912efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
1913efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
1914efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
1915efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
1916e6ccafaeSMatthew G Knepley 
1917e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
1918e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
1919efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
1920efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
1921efa14ee0SMatthew 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);
1922e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
1923e6ccafaeSMatthew G Knepley       }
1924e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
1925e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
19263b399e24SMatthew G. Knepley     }
1927e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
1928e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
1929e6ccafaeSMatthew G Knepley   }
1930efa14ee0SMatthew G Knepley   /* Cleanup */
1931efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
1932efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1933efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
1934efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
1935e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1936e6ccafaeSMatthew G Knepley }
1937e6ccafaeSMatthew G Knepley 
1938e6ccafaeSMatthew G Knepley #undef __FUNCT__
1939e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
1940830e53efSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, const char vertexLabelName[], PetscInt value, DM subdm)
1941e6ccafaeSMatthew G Knepley {
194282f516ccSBarry Smith   MPI_Comm         comm;
1943e6ccafaeSMatthew G Knepley   DMLabel          subpointMap, vertexLabel;
1944efa14ee0SMatthew G Knepley   IS              *subpointIS;
1945efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
1946efa14ee0SMatthew G Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew;
1947efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
1948e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
1949e6ccafaeSMatthew G Knepley 
1950e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
195182f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1952efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
1953e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
1954efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
1955efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
1956e6ccafaeSMatthew G Knepley   ierr = DMPlexGetLabel(dm, vertexLabelName, &vertexLabel);CHKERRQ(ierr);
1957830e53efSMatthew G. Knepley   ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);
1958efa14ee0SMatthew G Knepley   /* Setup chart */
1959efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1960efa14ee0SMatthew G Knepley   ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr);
1961e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1962e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
1963e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
1964e6ccafaeSMatthew G Knepley   }
1965e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
1966e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
1967e6ccafaeSMatthew G Knepley   /* Set cone sizes */
1968e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
1969e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
1970e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
1971e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
1972e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1973e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
1974e6ccafaeSMatthew G Knepley     ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
1975e6ccafaeSMatthew G Knepley   }
1976e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1977e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
1978e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
1979e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
1980e6ccafaeSMatthew G Knepley       const PetscInt *cone;
1981e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
1982e6ccafaeSMatthew G Knepley 
1983e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1984e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
1985e6ccafaeSMatthew G Knepley       if (d == dim) {
1986e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1987e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
1988e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
1989e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
1990e6ccafaeSMatthew G Knepley         }
1991e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
1992e6ccafaeSMatthew G Knepley       }
1993e6ccafaeSMatthew G Knepley     }
1994e6ccafaeSMatthew G Knepley   }
1995e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
1996e6ccafaeSMatthew G Knepley   /* Set cones */
19970298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
1998e6ccafaeSMatthew G Knepley   ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr);
1999e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2000e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2001e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2002e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2003e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2004e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2005e6ccafaeSMatthew G Knepley 
2006e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2007e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2008e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2009e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2010e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
2011e6ccafaeSMatthew G Knepley         if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc;
2012e6ccafaeSMatthew G Knepley       }
2013e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2014e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
2015e6ccafaeSMatthew G Knepley     }
2016e6ccafaeSMatthew G Knepley   }
2017e6ccafaeSMatthew G Knepley   ierr = PetscFree(coneNew);CHKERRQ(ierr);
2018e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2019e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2020e6ccafaeSMatthew G Knepley   /* Build coordinates */
2021e6ccafaeSMatthew G Knepley   {
2022e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2023e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2024e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2025285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2026e6ccafaeSMatthew G Knepley 
2027e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2028e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2029e6ccafaeSMatthew G Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2030285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2031285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2032285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2033e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2034e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2035e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2036e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2037e6ccafaeSMatthew G Knepley       PetscInt       dof;
2038e6ccafaeSMatthew G Knepley 
2039e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2040e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2041285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2042e6ccafaeSMatthew G Knepley     }
2043e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2044e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2045e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2046e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2047e6ccafaeSMatthew G Knepley     ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr);
2048e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2049e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2050e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2051e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2052e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2053e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2054e6ccafaeSMatthew G Knepley 
2055e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2056e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2057e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2058e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2059e6ccafaeSMatthew 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);
2060efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2061e6ccafaeSMatthew G Knepley     }
2062e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2063e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2064e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2065e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2066e6ccafaeSMatthew G Knepley   }
2067efa14ee0SMatthew G Knepley   /* Cleanup */
2068e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2069e6ccafaeSMatthew G Knepley     ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2070e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2071e6ccafaeSMatthew G Knepley   }
2072efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2073e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2074e6ccafaeSMatthew G Knepley }
2075e6ccafaeSMatthew G Knepley 
2076e6ccafaeSMatthew G Knepley #undef __FUNCT__
2077e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2078830e53efSMatthew G. Knepley /*@C
2079e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2080e6ccafaeSMatthew G Knepley 
2081e6ccafaeSMatthew G Knepley   Input Parameters:
2082e6ccafaeSMatthew G Knepley + dm           - The original mesh
2083830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2084830e53efSMatthew G. Knepley - value        - The label value to use
2085e6ccafaeSMatthew G Knepley 
2086e6ccafaeSMatthew G Knepley   Output Parameter:
2087e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2088e6ccafaeSMatthew G Knepley 
2089e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2090e6ccafaeSMatthew G Knepley 
2091e6ccafaeSMatthew G Knepley   Level: developer
2092e6ccafaeSMatthew G Knepley 
2093e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2094830e53efSMatthew G. Knepley @*/
2095830e53efSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, const char vertexLabel[], PetscInt value, DM *subdm)
2096e6ccafaeSMatthew G Knepley {
2097e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2098e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2099e6ccafaeSMatthew G Knepley 
2100e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2101e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2102e6ccafaeSMatthew G Knepley   PetscValidCharPointer(vertexLabel, 2);
2103766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2104e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2105e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
210682f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2107e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2108e6ccafaeSMatthew G Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2109e6ccafaeSMatthew G Knepley   if (depth == dim) {
2110830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2111e6ccafaeSMatthew G Knepley   } else {
2112830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2113e6ccafaeSMatthew G Knepley   }
2114e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2115e6ccafaeSMatthew G Knepley }
2116e6ccafaeSMatthew G Knepley 
2117e6ccafaeSMatthew G Knepley #undef __FUNCT__
2118766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
2119766ab985SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, DM subdm)
2120766ab985SMatthew G. Knepley {
2121766ab985SMatthew G. Knepley   MPI_Comm        comm;
2122766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2123766ab985SMatthew G. Knepley   IS              subvertexIS;
2124766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2125766ab985SMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells;
2126766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
212787feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
2128766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2129766ab985SMatthew G. Knepley 
2130766ab985SMatthew G. Knepley   PetscFunctionBegin;
2131766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
2132766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2133766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2134766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2135766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
2136766ab985SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
2137766ab985SMatthew G. Knepley   /* Setup chart */
2138766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2139766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2140766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2141766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2142766ab985SMatthew G. Knepley   /* Set cone sizes */
2143766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
2144766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
2145766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
2146766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2147766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2148766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2149766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2150766ab985SMatthew G. Knepley   }
2151766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2152766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2153766ab985SMatthew G. Knepley   }
2154766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2155766ab985SMatthew G. Knepley   /* Create face cones */
2156766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
215787feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2158766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2159766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2160766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
2161766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
216287feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
216387feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
2164766ab985SMatthew G. Knepley 
216587feddfdSMatthew G. Knepley     if (cell < cMax) continue;
216687feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
216787feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
216887feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
216987feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
217087feddfdSMatthew G. Knepley     }
217187feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
217287feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
217387feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
217487feddfdSMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
217587feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
217687feddfdSMatthew G. Knepley       PetscInt negsubcell;
2177766ab985SMatthew G. Knepley 
217887feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
217987feddfdSMatthew G. Knepley       /* I know this is a crap search */
218087feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
218187feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
2182766ab985SMatthew G. Knepley       }
218387feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
218487feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
2185766ab985SMatthew G. Knepley     }
218687feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
218787feddfdSMatthew G. Knepley     ++newFacePoint;
2188766ab985SMatthew G. Knepley   }
2189766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2190766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2191766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2192766ab985SMatthew G. Knepley   /* Build coordinates */
2193766ab985SMatthew G. Knepley   {
2194766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2195766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2196766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2197285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2198766ab985SMatthew G. Knepley 
2199766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2200766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2201766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2202285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2203285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2204285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2205766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2206766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2207766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2208766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2209766ab985SMatthew G. Knepley       PetscInt       dof;
2210766ab985SMatthew G. Knepley 
2211766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2212766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2213285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2214766ab985SMatthew G. Knepley     }
2215766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2216766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2217766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2218766ab985SMatthew G. Knepley     if (coordSize) {
2219766ab985SMatthew G. Knepley       ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2220766ab985SMatthew G. Knepley       ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr);
2221766ab985SMatthew G. Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2222766ab985SMatthew G. Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2223766ab985SMatthew G. Knepley       for (v = 0; v < numSubVertices; ++v) {
2224766ab985SMatthew G. Knepley         const PetscInt vertex    = subVertices[v];
2225766ab985SMatthew G. Knepley         const PetscInt subvertex = firstSubVertex+v;
2226766ab985SMatthew G. Knepley         PetscInt       dof, off, sdof, soff, d;
2227766ab985SMatthew G. Knepley 
2228766ab985SMatthew G. Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2229766ab985SMatthew G. Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2230766ab985SMatthew G. Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2231766ab985SMatthew G. Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2232766ab985SMatthew 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);
2233766ab985SMatthew G. Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2234766ab985SMatthew G. Knepley       }
2235766ab985SMatthew G. Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2236766ab985SMatthew G. Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2237766ab985SMatthew G. Knepley     }
2238766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2239766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2240766ab985SMatthew G. Knepley   }
2241766ab985SMatthew G. Knepley   /* Cleanup */
2242766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2243766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2244766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
2245766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2246766ab985SMatthew G. Knepley }
2247766ab985SMatthew G. Knepley 
2248766ab985SMatthew G. Knepley #undef __FUNCT__
2249766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
2250766ab985SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, PetscBool hasLagrange, DM subdm)
2251766ab985SMatthew G. Knepley {
2252766ab985SMatthew G. Knepley   MPI_Comm         comm;
2253766ab985SMatthew G. Knepley   DMLabel          subpointMap;
2254766ab985SMatthew G. Knepley   IS              *subpointIS;
2255766ab985SMatthew G. Knepley   const PetscInt **subpoints;
2256766ab985SMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew;
2257766ab985SMatthew G. Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2258766ab985SMatthew G. Knepley   PetscErrorCode   ierr;
2259766ab985SMatthew G. Knepley 
2260766ab985SMatthew G. Knepley   PetscFunctionBegin;
2261766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2262766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2263766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2264766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2265766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
2266766ab985SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, hasLagrange, subpointMap, subdm);CHKERRQ(ierr);
2267766ab985SMatthew G. Knepley   /* Setup chart */
2268766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2269766ab985SMatthew G. Knepley   ierr = PetscMalloc4(dim+1,PetscInt,&numSubPoints,dim+1,PetscInt,&firstSubPoint,dim+1,IS,&subpointIS,dim+1,const PetscInt *,&subpoints);CHKERRQ(ierr);
2270766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2271766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2272766ab985SMatthew G. Knepley     totSubPoints += numSubPoints[d];
2273766ab985SMatthew G. Knepley   }
2274766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2275766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2276766ab985SMatthew G. Knepley   /* Set cone sizes */
2277766ab985SMatthew G. Knepley   firstSubPoint[dim] = 0;
2278766ab985SMatthew G. Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2279766ab985SMatthew G. Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2280766ab985SMatthew G. Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2281766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2282766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
2283766ab985SMatthew G. Knepley     ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2284766ab985SMatthew G. Knepley   }
2285766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2286766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2287766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2288766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2289766ab985SMatthew G. Knepley       const PetscInt *cone;
2290766ab985SMatthew G. Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2291766ab985SMatthew G. Knepley 
2292766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2293766ab985SMatthew G. Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2294766ab985SMatthew G. Knepley       if (d == dim) {
2295766ab985SMatthew G. Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2296766ab985SMatthew G. Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2297766ab985SMatthew G. Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2298766ab985SMatthew G. Knepley           if (val >= 0) coneSizeNew++;
2299766ab985SMatthew G. Knepley         }
2300766ab985SMatthew G. Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2301766ab985SMatthew G. Knepley       }
2302766ab985SMatthew G. Knepley     }
2303766ab985SMatthew G. Knepley   }
2304766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2305766ab985SMatthew G. Knepley   /* Set cones */
2306766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2307766ab985SMatthew G. Knepley   ierr = PetscMalloc(maxConeSize * sizeof(PetscInt), &coneNew);CHKERRQ(ierr);
2308766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2309766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2310766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2311766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2312766ab985SMatthew G. Knepley       const PetscInt *cone;
2313766ab985SMatthew G. Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2314766ab985SMatthew G. Knepley 
2315766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2316766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2317766ab985SMatthew G. Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2318766ab985SMatthew G. Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2319766ab985SMatthew G. Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
2320766ab985SMatthew G. Knepley         if (subc >= 0) coneNew[coneSizeNew++] = firstSubPoint[d-1] + subc;
2321766ab985SMatthew G. Knepley       }
2322766ab985SMatthew G. Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2323766ab985SMatthew G. Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
2324766ab985SMatthew G. Knepley     }
2325766ab985SMatthew G. Knepley   }
2326766ab985SMatthew G. Knepley   ierr = PetscFree(coneNew);CHKERRQ(ierr);
2327766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2328766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2329766ab985SMatthew G. Knepley   /* Build coordinates */
2330766ab985SMatthew G. Knepley   {
2331766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2332766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2333766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2334285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2335766ab985SMatthew G. Knepley 
2336766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2337766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
2338766ab985SMatthew G. Knepley     ierr = DMPlexGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2339285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2340285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2341285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2342766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2343766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2344766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
2345766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2346766ab985SMatthew G. Knepley       PetscInt       dof;
2347766ab985SMatthew G. Knepley 
2348766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2349766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2350285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2351766ab985SMatthew G. Knepley     }
2352766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2353766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2354766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2355766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2356766ab985SMatthew G. Knepley     ierr = VecSetFromOptions(subCoordinates);CHKERRQ(ierr);
2357766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2358766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2359766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2360766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
2361766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2362766ab985SMatthew G. Knepley       PetscInt dof, off, sdof, soff, d;
2363766ab985SMatthew G. Knepley 
2364766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2365766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2366766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2367766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2368766ab985SMatthew 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);
2369766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2370766ab985SMatthew G. Knepley     }
2371766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2372766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2373766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2374766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2375766ab985SMatthew G. Knepley   }
2376766ab985SMatthew G. Knepley   /* Cleanup */
2377766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2378766ab985SMatthew G. Knepley     ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);
2379766ab985SMatthew G. Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2380766ab985SMatthew G. Knepley   }
2381766ab985SMatthew G. Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2382766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2383766ab985SMatthew G. Knepley }
2384766ab985SMatthew G. Knepley 
2385766ab985SMatthew G. Knepley #undef __FUNCT__
2386766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
2387766ab985SMatthew G. Knepley /*
2388766ab985SMatthew G. Knepley   DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells.
2389766ab985SMatthew G. Knepley 
2390766ab985SMatthew G. Knepley   Input Parameters:
2391766ab985SMatthew G. Knepley + dm          - The original mesh
2392766ab985SMatthew G. Knepley - hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
2393766ab985SMatthew G. Knepley 
2394766ab985SMatthew G. Knepley   Output Parameter:
2395766ab985SMatthew G. Knepley . subdm - The surface mesh
2396766ab985SMatthew G. Knepley 
2397766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2398766ab985SMatthew G. Knepley 
2399766ab985SMatthew G. Knepley   Level: developer
2400766ab985SMatthew G. Knepley 
2401766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
2402766ab985SMatthew G. Knepley */
2403766ab985SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, DM *subdm)
2404766ab985SMatthew G. Knepley {
2405766ab985SMatthew G. Knepley   PetscInt       dim, depth;
2406766ab985SMatthew G. Knepley   PetscErrorCode ierr;
2407766ab985SMatthew G. Knepley 
2408766ab985SMatthew G. Knepley   PetscFunctionBegin;
2409766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2410766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2411766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2412766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2413766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2414766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2415766ab985SMatthew G. Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2416766ab985SMatthew G. Knepley   if (depth == dim) {
2417766ab985SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, hasLagrange, *subdm);CHKERRQ(ierr);
2418766ab985SMatthew G. Knepley   } else {
2419766ab985SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, *subdm);CHKERRQ(ierr);
2420e6ccafaeSMatthew G Knepley   }
2421e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2422e6ccafaeSMatthew G Knepley }
2423e6ccafaeSMatthew G Knepley 
2424e6ccafaeSMatthew G Knepley #undef __FUNCT__
2425e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
242664beef6dSMatthew G. Knepley /*@
242764beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
242864beef6dSMatthew G. Knepley 
242964beef6dSMatthew G. Knepley   Input Parameter:
243064beef6dSMatthew G. Knepley . dm - The submesh DM
243164beef6dSMatthew G. Knepley 
243264beef6dSMatthew G. Knepley   Output Parameter:
243364beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
243464beef6dSMatthew G. Knepley 
243564beef6dSMatthew G. Knepley   Level: developer
243664beef6dSMatthew G. Knepley 
243764beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
243864beef6dSMatthew G. Knepley @*/
2439e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
2440e6ccafaeSMatthew G Knepley {
2441e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
2442e6ccafaeSMatthew G Knepley 
2443e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2444e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2445e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
2446e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
2447e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2448e6ccafaeSMatthew G Knepley }
2449e6ccafaeSMatthew G Knepley 
2450e6ccafaeSMatthew G Knepley #undef __FUNCT__
2451e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
2452e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
2453e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
2454e6ccafaeSMatthew G Knepley {
2455e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
2456285d324eSMatthew G. Knepley   DMLabel        tmp;
2457e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2458e6ccafaeSMatthew G Knepley 
2459e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2460e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2461285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
2462e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
2463285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
2464285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
2465e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2466e6ccafaeSMatthew G Knepley }
2467e6ccafaeSMatthew G Knepley 
2468e6ccafaeSMatthew G Knepley #undef __FUNCT__
2469e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
247064beef6dSMatthew G. Knepley /*@
2471e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
2472e6ccafaeSMatthew G Knepley 
2473e6ccafaeSMatthew G Knepley   Input Parameter:
2474e6ccafaeSMatthew G Knepley . dm - The submesh DM
2475e6ccafaeSMatthew G Knepley 
2476e6ccafaeSMatthew G Knepley   Output Parameter:
24770298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
2478e6ccafaeSMatthew G Knepley 
2479e6ccafaeSMatthew G Knepley   Note: This is IS is guaranteed to be sorted by the construction of the submesh
248064beef6dSMatthew G. Knepley 
248164beef6dSMatthew G. Knepley   Level: developer
248264beef6dSMatthew G. Knepley 
248364beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
248464beef6dSMatthew G. Knepley @*/
2485e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
2486e6ccafaeSMatthew G Knepley {
248782f516ccSBarry Smith   MPI_Comm        comm;
2488e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
2489e6ccafaeSMatthew G Knepley   IS              is;
2490e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
2491e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
2492e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
2493e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2494e6ccafaeSMatthew G Knepley 
2495e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2496e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2497e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
249882f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
24990298fd71SBarry Smith   *subpointIS = NULL;
2500e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
2501e6ccafaeSMatthew G Knepley   if (subpointMap) {
2502e6ccafaeSMatthew G Knepley     ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
2503e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2504e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
2505e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
2506e6ccafaeSMatthew G Knepley     depths[0] = depth;
2507e6ccafaeSMatthew G Knepley     depths[1] = 0;
2508e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
2509e6ccafaeSMatthew G Knepley     ierr = PetscMalloc(pEnd * sizeof(PetscInt), &points);CHKERRQ(ierr);
2510e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
2511e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
2512e6ccafaeSMatthew G Knepley 
2513e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
2514e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
25151e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
2516e6ccafaeSMatthew 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);
2517e6ccafaeSMatthew G Knepley       } else {
25181e21b6fdSMatthew G Knepley         if (!n) {
25191e21b6fdSMatthew G Knepley           if (d == 0) {
25201e21b6fdSMatthew G Knepley             /* Missing cells */
25211e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
25221e21b6fdSMatthew G Knepley           } else {
25231e21b6fdSMatthew G Knepley             /* Missing faces */
25241e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
25251e21b6fdSMatthew G Knepley           }
25261e21b6fdSMatthew G Knepley         }
2527e6ccafaeSMatthew G Knepley       }
2528e6ccafaeSMatthew G Knepley       if (n) {
2529e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
2530e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
2531e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
2532e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
2533e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
2534e6ccafaeSMatthew G Knepley       }
2535e6ccafaeSMatthew G Knepley     }
2536e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
2537e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
2538e6ccafaeSMatthew G Knepley     ierr = ISCreateGeneral(comm, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
2539e6ccafaeSMatthew G Knepley   }
2540e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2541e6ccafaeSMatthew G Knepley }
2542