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