xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision a0541d8a0a17c10fb717400e49fb2f0c8fbee586)
134541f0dSBarry Smith #include <petsc-private/dmpleximpl.h>   /*I      "petscdmplex.h"   I*/
20c312b8eSJed Brown #include <petscsf.h>
3e6ccafaeSMatthew G Knepley 
4e6ccafaeSMatthew G Knepley #undef __FUNCT__
530560a7bSMatthew G. Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces_Internal"
630560a7bSMatthew G. Knepley PetscErrorCode DMPlexMarkBoundaryFaces_Internal(DM dm, PetscInt cellHeight, DMLabel label)
730560a7bSMatthew G. Knepley {
830560a7bSMatthew G. Knepley   PetscInt       fStart, fEnd, f;
930560a7bSMatthew G. Knepley   PetscErrorCode ierr;
1030560a7bSMatthew G. Knepley 
1130560a7bSMatthew G. Knepley   PetscFunctionBegin;
1230560a7bSMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
1330560a7bSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, cellHeight+1, &fStart, &fEnd);CHKERRQ(ierr);
1430560a7bSMatthew G. Knepley   for (f = fStart; f < fEnd; ++f) {
1530560a7bSMatthew G. Knepley     PetscInt supportSize;
1630560a7bSMatthew G. Knepley 
1730560a7bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, f, &supportSize);CHKERRQ(ierr);
1830560a7bSMatthew G. Knepley     if (supportSize == 1) {ierr = DMLabelSetValue(label, f, 1);CHKERRQ(ierr);}
1930560a7bSMatthew G. Knepley   }
2030560a7bSMatthew G. Knepley   PetscFunctionReturn(0);
2130560a7bSMatthew G. Knepley }
2230560a7bSMatthew G. Knepley 
2330560a7bSMatthew G. Knepley #undef __FUNCT__
24cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexMarkBoundaryFaces"
25cd0c2139SMatthew G Knepley /*@
26cd0c2139SMatthew G Knepley   DMPlexMarkBoundaryFaces - Mark all faces on the boundary
27cd0c2139SMatthew G Knepley 
28cd0c2139SMatthew G Knepley   Not Collective
29cd0c2139SMatthew G Knepley 
30cd0c2139SMatthew G Knepley   Input Parameter:
31cd0c2139SMatthew G Knepley . dm - The original DM
32cd0c2139SMatthew G Knepley 
33cd0c2139SMatthew G Knepley   Output Parameter:
34cd0c2139SMatthew G Knepley . label - The DMLabel marking boundary faces with value 1
35cd0c2139SMatthew G Knepley 
36cd0c2139SMatthew G Knepley   Level: developer
37cd0c2139SMatthew G Knepley 
38cd0c2139SMatthew G Knepley .seealso: DMLabelCreate(), DMPlexCreateLabel()
3909f723d9SJed Brown @*/
40cd0c2139SMatthew G Knepley PetscErrorCode DMPlexMarkBoundaryFaces(DM dm, DMLabel label)
41cd0c2139SMatthew G Knepley {
42cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
43cd0c2139SMatthew G Knepley 
44cd0c2139SMatthew G Knepley   PetscFunctionBegin;
4574e03af4SMatthew G. Knepley   ierr = DMPlexMarkBoundaryFaces_Internal(dm, 0, label);CHKERRQ(ierr);
46cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
47cd0c2139SMatthew G Knepley }
48cd0c2139SMatthew G Knepley 
49cd0c2139SMatthew G Knepley #undef __FUNCT__
502be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelComplete"
512be2b188SMatthew G Knepley /*@
522be2b188SMatthew G Knepley   DMPlexLabelComplete - Starting with a label marking points on a surface, we add the transitive closure to the surface
532be2b188SMatthew G Knepley 
542be2b188SMatthew G Knepley   Input Parameters:
552be2b188SMatthew G Knepley + dm - The DM
562be2b188SMatthew G Knepley - label - A DMLabel marking the surface points
572be2b188SMatthew G Knepley 
582be2b188SMatthew G Knepley   Output Parameter:
592be2b188SMatthew G Knepley . label - A DMLabel marking all surface points in the transitive closure
602be2b188SMatthew G Knepley 
612be2b188SMatthew G Knepley   Level: developer
622be2b188SMatthew G Knepley 
632be2b188SMatthew G Knepley .seealso: DMPlexLabelCohesiveComplete()
642be2b188SMatthew G Knepley @*/
652be2b188SMatthew G Knepley PetscErrorCode DMPlexLabelComplete(DM dm, DMLabel label)
662be2b188SMatthew G Knepley {
672be2b188SMatthew G Knepley   IS              valueIS;
682be2b188SMatthew G Knepley   const PetscInt *values;
692be2b188SMatthew G Knepley   PetscInt        numValues, v;
702be2b188SMatthew G Knepley   PetscErrorCode  ierr;
712be2b188SMatthew G Knepley 
722be2b188SMatthew G Knepley   PetscFunctionBegin;
732be2b188SMatthew G Knepley   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
742be2b188SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
752be2b188SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
762be2b188SMatthew G Knepley   for (v = 0; v < numValues; ++v) {
772be2b188SMatthew G Knepley     IS              pointIS;
782be2b188SMatthew G Knepley     const PetscInt *points;
792be2b188SMatthew G Knepley     PetscInt        numPoints, p;
802be2b188SMatthew G Knepley 
812be2b188SMatthew G Knepley     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
822be2b188SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
832be2b188SMatthew G Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
842be2b188SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
852be2b188SMatthew G Knepley       PetscInt *closure = NULL;
862be2b188SMatthew G Knepley       PetscInt  closureSize, c;
872be2b188SMatthew G Knepley 
882be2b188SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
892be2b188SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
902be2b188SMatthew G Knepley         ierr = DMLabelSetValue(label, closure[c], values[v]);CHKERRQ(ierr);
912be2b188SMatthew G Knepley       }
922be2b188SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
932be2b188SMatthew G Knepley     }
942be2b188SMatthew G Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
952be2b188SMatthew G Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
962be2b188SMatthew G Knepley   }
972be2b188SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
982be2b188SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
992be2b188SMatthew G Knepley   PetscFunctionReturn(0);
1002be2b188SMatthew G Knepley }
1012be2b188SMatthew G Knepley 
1022be2b188SMatthew G Knepley #undef __FUNCT__
1036cf0e42fSMatthew G. Knepley #define __FUNCT__ "DMPlexLabelAddCells"
1046cf0e42fSMatthew G. Knepley /*@
1056cf0e42fSMatthew G. Knepley   DMPlexLabelAddCells - Starting with a label marking faces on a surface, we add a cell for each face
1066cf0e42fSMatthew G. Knepley 
1076cf0e42fSMatthew G. Knepley   Input Parameters:
1086cf0e42fSMatthew G. Knepley + dm - The DM
1096cf0e42fSMatthew G. Knepley - label - A DMLabel marking the surface points
1106cf0e42fSMatthew G. Knepley 
1116cf0e42fSMatthew G. Knepley   Output Parameter:
1126cf0e42fSMatthew G. Knepley . label - A DMLabel incorporating cells
1136cf0e42fSMatthew G. Knepley 
1146cf0e42fSMatthew G. Knepley   Level: developer
1156cf0e42fSMatthew G. Knepley 
1166cf0e42fSMatthew G. Knepley   Note: The cells allow FEM boundary conditions to be applied using the cell geometry
1176cf0e42fSMatthew G. Knepley 
1186cf0e42fSMatthew G. Knepley .seealso: DMPlexLabelComplete(), DMPlexLabelCohesiveComplete()
1196cf0e42fSMatthew G. Knepley @*/
1206cf0e42fSMatthew G. Knepley PetscErrorCode DMPlexLabelAddCells(DM dm, DMLabel label)
1216cf0e42fSMatthew G. Knepley {
1226cf0e42fSMatthew G. Knepley   IS              valueIS;
1236cf0e42fSMatthew G. Knepley   const PetscInt *values;
1246cf0e42fSMatthew G. Knepley   PetscInt        numValues, v, cStart, cEnd;
1256cf0e42fSMatthew G. Knepley   PetscErrorCode  ierr;
1266cf0e42fSMatthew G. Knepley 
1276cf0e42fSMatthew G. Knepley   PetscFunctionBegin;
1286cf0e42fSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1296cf0e42fSMatthew G. Knepley   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
1306cf0e42fSMatthew G. Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
1316cf0e42fSMatthew G. Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
1326cf0e42fSMatthew G. Knepley   for (v = 0; v < numValues; ++v) {
1336cf0e42fSMatthew G. Knepley     IS              pointIS;
1346cf0e42fSMatthew G. Knepley     const PetscInt *points;
1356cf0e42fSMatthew G. Knepley     PetscInt        numPoints, p;
1366cf0e42fSMatthew G. Knepley 
1376cf0e42fSMatthew G. Knepley     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
1386cf0e42fSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
1396cf0e42fSMatthew G. Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
1406cf0e42fSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1416cf0e42fSMatthew G. Knepley       PetscInt *closure = NULL;
1426cf0e42fSMatthew G. Knepley       PetscInt  closureSize, point;
1436cf0e42fSMatthew G. Knepley 
1446cf0e42fSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr);
1456cf0e42fSMatthew G. Knepley       point = closure[(closureSize-1)*2];
1466cf0e42fSMatthew G. Knepley       if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr);}
1476cf0e42fSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr);
1486cf0e42fSMatthew G. Knepley     }
1496cf0e42fSMatthew G. Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
1506cf0e42fSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
1516cf0e42fSMatthew G. Knepley   }
1526cf0e42fSMatthew G. Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1536cf0e42fSMatthew G. Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1546cf0e42fSMatthew G. Knepley   PetscFunctionReturn(0);
1556cf0e42fSMatthew G. Knepley }
1566cf0e42fSMatthew G. Knepley 
1576cf0e42fSMatthew G. Knepley #undef __FUNCT__
158cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoint_Internal"
159a6ae58d1SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthMax[], PetscInt depthEnd[], PetscInt depthShift[])
160cd0c2139SMatthew G Knepley {
161cd0c2139SMatthew G Knepley   if (depth < 0) return p;
162a6ae58d1SMatthew G. Knepley   /* Normal Cells                 */ if (p < depthMax[depth])                return p;
163a6ae58d1SMatthew G. Knepley   /* Hybrid Cells+Normal Vertices */ if (p < depthMax[0])                    return p + depthShift[depth];
164a6ae58d1SMatthew G. Knepley   /* Hybrid Vertices+Normal Faces */ if (depth < 2 || p < depthMax[depth-1]) return p + depthShift[depth] + depthShift[0];
165a6ae58d1SMatthew G. Knepley   /* Hybrid Faces+Normal Edges    */ if (depth < 3 || p < depthMax[depth-2]) return p + depthShift[depth] + depthShift[0] + depthShift[depth-1];
166a6ae58d1SMatthew G. Knepley   /* Hybrid Edges                 */                                         return p + depthShift[depth] + depthShift[0] + depthShift[depth-1] + depthShift[depth-2];
167cd0c2139SMatthew G Knepley }
168cd0c2139SMatthew G Knepley 
169cd0c2139SMatthew G Knepley #undef __FUNCT__
170cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
171cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
172cd0c2139SMatthew G Knepley {
173a6ae58d1SMatthew G. Knepley   PetscInt      *depthMax, *depthEnd;
174cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
175cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
176cd0c2139SMatthew G Knepley 
177cd0c2139SMatthew G Knepley   PetscFunctionBegin;
178cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
179cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
1802203a8e9SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr);
181cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
182cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
183a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr);
184cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
185cd0c2139SMatthew G Knepley     pEnd += depthShift[d];
186cd0c2139SMatthew G Knepley     ierr  = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
187a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
188cd0c2139SMatthew G Knepley   }
189cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
190cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
191cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
192cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
193cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
194a6ae58d1SMatthew G. Knepley       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift);
195cd0c2139SMatthew G Knepley       PetscInt size;
196cd0c2139SMatthew G Knepley 
197cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
198cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
199cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
200cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
201cd0c2139SMatthew G Knepley     }
202cd0c2139SMatthew G Knepley   }
203a6ae58d1SMatthew G. Knepley   ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr);
204cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
205cd0c2139SMatthew G Knepley }
206cd0c2139SMatthew G Knepley 
207cd0c2139SMatthew G Knepley #undef __FUNCT__
208cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
209cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
210cd0c2139SMatthew G Knepley {
211a6ae58d1SMatthew G. Knepley   PetscInt      *depthEnd, *depthMax, *newpoints;
212dcbb62e8SMatthew G. Knepley   PetscInt       depth = 0, d, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p;
213cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
214cd0c2139SMatthew G Knepley 
215cd0c2139SMatthew G Knepley   PetscFunctionBegin;
216cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
217cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
218cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
219dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
2202203a8e9SMatthew G. Knepley   ierr = PetscMalloc3(depth+1,&depthEnd,depth+1,&depthMax,PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr);
221a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &depthMax[depth], depth > 0 ? &depthMax[depth-1] : NULL, &depthMax[1], &depthMax[0]);CHKERRQ(ierr);
222cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
223cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
224a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
225cd0c2139SMatthew G Knepley   }
226cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
227cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
228cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
229cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
230a6ae58d1SMatthew G. Knepley     PetscInt        size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthMax, depthEnd, depthShift);
231cd0c2139SMatthew G Knepley 
232cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
233cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
234cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
235cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
236a6ae58d1SMatthew G. Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift);
237cd0c2139SMatthew G Knepley     }
238cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
239cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
240cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
241dcbb62e8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr);
242cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
243cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
244a6ae58d1SMatthew G. Knepley       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthMax, depthEnd, depthShift);
245cd0c2139SMatthew G Knepley     }
246dcbb62e8SMatthew G. Knepley     for (i = size; i < sizeNew; ++i) newpoints[i] = 0;
247cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
248cd0c2139SMatthew G Knepley   }
249a6ae58d1SMatthew G. Knepley   ierr = PetscFree3(depthEnd,depthMax,newpoints);CHKERRQ(ierr);
250cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
251cd0c2139SMatthew G Knepley }
252cd0c2139SMatthew G Knepley 
253cd0c2139SMatthew G Knepley #undef __FUNCT__
254cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
255cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
256cd0c2139SMatthew G Knepley {
257cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
258cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
259cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
260cd0c2139SMatthew G Knepley   PetscInt      *depthEnd, coordSize;
261cd0c2139SMatthew G Knepley   PetscInt       dim, depth = 0, d, vStart, vEnd, vStartNew, vEndNew, v;
262cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
263cd0c2139SMatthew G Knepley 
264cd0c2139SMatthew G Knepley   PetscFunctionBegin;
265cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
266cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
267785e854fSJed Brown   ierr = PetscMalloc1((depth+1), &depthEnd);CHKERRQ(ierr);
268cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
269cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
270cd0c2139SMatthew G Knepley   }
271cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
272cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
273cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
27469d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
275cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
276cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
277cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
278cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
279cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
280cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
281cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
282cd0c2139SMatthew G Knepley   }
283cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
28469d8a9ceSMatthew G. Knepley   ierr = DMSetCoordinateSection(dmNew, newCoordSection);CHKERRQ(ierr);
285cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
286cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
287cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
288cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
2892eb5907fSJed Brown   ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr);
290cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
291cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
292cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
293cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
294cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
295cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
296cd0c2139SMatthew G Knepley 
297cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
298cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
299a6ae58d1SMatthew G. Knepley     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthEnd, depthEnd, depthShift), &noff);CHKERRQ(ierr);
300cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
301cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
302cd0c2139SMatthew G Knepley     }
303cd0c2139SMatthew G Knepley   }
304cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
305cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
306cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
307cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
308cd0c2139SMatthew G Knepley   ierr = PetscFree(depthEnd);CHKERRQ(ierr);
309cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
310cd0c2139SMatthew G Knepley }
311cd0c2139SMatthew G Knepley 
312cd0c2139SMatthew G Knepley #undef __FUNCT__
313cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
314cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
315cd0c2139SMatthew G Knepley {
316a6ae58d1SMatthew G. Knepley   PetscInt          *depthMax, *depthEnd;
317cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d;
318cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
319cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
320cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
321cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
322cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
323cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
324cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
325cd0c2139SMatthew G Knepley 
326cd0c2139SMatthew G Knepley   PetscFunctionBegin;
327cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3282203a8e9SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr);
329a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr);
330cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
331cd0c2139SMatthew G Knepley     totShift += depthShift[d];
332cd0c2139SMatthew G Knepley     ierr      = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
333a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
334cd0c2139SMatthew G Knepley   }
335cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
336cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
337cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
338cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
339cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
340cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
341dcca6d9dSJed Brown     ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr);
342a6ae58d1SMatthew G. Knepley     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthMax, depthEnd, depthShift);
343cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
344cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
345785e854fSJed Brown     ierr = PetscMalloc1(numLeaves,    &glocalPoints);CHKERRQ(ierr);
346785e854fSJed Brown     ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr);
347cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
348a6ae58d1SMatthew G. Knepley       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthMax, depthEnd, depthShift);
349cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
350cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
351cd0c2139SMatthew G Knepley     }
352cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
353cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
354cd0c2139SMatthew G Knepley   }
355a6ae58d1SMatthew G. Knepley   ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr);
356cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
357cd0c2139SMatthew G Knepley }
358cd0c2139SMatthew G Knepley 
359cd0c2139SMatthew G Knepley #undef __FUNCT__
360cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
361cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
362cd0c2139SMatthew G Knepley {
363cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
364cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
365a6ae58d1SMatthew G. Knepley   PetscInt          *depthMax, *depthEnd;
366cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
367cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
368cd0c2139SMatthew G Knepley   PetscInt           depth = 0, d, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
369cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
370cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
371cd0c2139SMatthew G Knepley 
372cd0c2139SMatthew G Knepley   PetscFunctionBegin;
373cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3742203a8e9SMatthew G. Knepley   ierr = PetscMalloc2(depth+1,&depthMax,depth+1,&depthEnd);CHKERRQ(ierr);
375a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr);
376cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
377cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &depthEnd[d]);CHKERRQ(ierr);
378a6ae58d1SMatthew G. Knepley     depthMax[d] = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
379cd0c2139SMatthew G Knepley   }
380cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
381cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
382cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
383cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
384cd0c2139SMatthew G Knepley     const char     *lname;
385cd0c2139SMatthew G Knepley     PetscBool       isDepth;
386cd0c2139SMatthew G Knepley     IS              valueIS;
387cd0c2139SMatthew G Knepley     const PetscInt *values;
388cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
389cd0c2139SMatthew G Knepley 
390cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
391cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
392cd0c2139SMatthew G Knepley     if (isDepth) continue;
393cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
394cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
395cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
396cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
397cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
398cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
399cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
400cd0c2139SMatthew G Knepley       IS              pointIS;
401cd0c2139SMatthew G Knepley       const PetscInt *points;
402cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
403cd0c2139SMatthew G Knepley 
404cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
405cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
406cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
407cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
408a6ae58d1SMatthew G. Knepley         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthMax, depthEnd, depthShift);
409cd0c2139SMatthew G Knepley 
410cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
411cd0c2139SMatthew G Knepley       }
412cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
413cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
414cd0c2139SMatthew G Knepley     }
415cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
416cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
417cd0c2139SMatthew G Knepley   }
418a6ae58d1SMatthew G. Knepley   ierr = PetscFree2(depthMax,depthEnd);CHKERRQ(ierr);
419cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
420cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
421cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
422cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
423cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
424cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
425cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
426cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
427cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
428cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
429cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
430cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
431cd0c2139SMatthew G Knepley     }
432cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
433cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
434cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
435cd0c2139SMatthew G Knepley     } else {
436cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
437cd0c2139SMatthew G Knepley     }
438cd0c2139SMatthew G Knepley   }
439cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
440cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
441cd0c2139SMatthew G Knepley   }
442cd0c2139SMatthew G Knepley   if (0) {
443cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
444cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
445cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
446cd0c2139SMatthew G Knepley   }
447cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
448cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
449cd0c2139SMatthew G Knepley     PetscInt numCells;
450cd0c2139SMatthew G Knepley 
451cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
452cd0c2139SMatthew G Knepley     if (numCells < 2) {
453cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
454cd0c2139SMatthew G Knepley     } else {
455cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
456cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
457cd0c2139SMatthew G Knepley 
458cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
459cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
460cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
461cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
462cd0c2139SMatthew G Knepley     }
463cd0c2139SMatthew G Knepley   }
464cd0c2139SMatthew G Knepley   if (0) {
465cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
466cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
467cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
468cd0c2139SMatthew G Knepley   }
469cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
470cd0c2139SMatthew G Knepley }
471cd0c2139SMatthew G Knepley 
472cd0c2139SMatthew G Knepley #undef __FUNCT__
473cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
474cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
475cd0c2139SMatthew G Knepley {
476cd0c2139SMatthew G Knepley   IS              valueIS;
477cd0c2139SMatthew G Knepley   const PetscInt *values;
478cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
47946c796b9SMatthew G. Knepley   PetscInt        depth = 0, numFS, fs, fStart, fEnd, ghostCell, cEnd, c;
480cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
481cd0c2139SMatthew G Knepley 
482cd0c2139SMatthew G Knepley   PetscFunctionBegin;
48346c796b9SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
484cd0c2139SMatthew G Knepley   /* Count ghost cells */
485cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
486cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
487cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
488cd0c2139SMatthew G Knepley   *numGhostCells = 0;
489cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
49046c796b9SMatthew G. Knepley     IS              faceIS;
49146c796b9SMatthew G. Knepley     const PetscInt *faces;
49246c796b9SMatthew G. Knepley     PetscInt        numFaces, f, numBdFaces = 0;
493cd0c2139SMatthew G Knepley 
49446c796b9SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
49546c796b9SMatthew G. Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
49646c796b9SMatthew G. Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
49746c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
49846c796b9SMatthew G. Knepley       if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces;
49946c796b9SMatthew G. Knepley     }
500cd0c2139SMatthew G Knepley     *numGhostCells += numBdFaces;
50146c796b9SMatthew G. Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
502cd0c2139SMatthew G Knepley   }
503cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
504785e854fSJed Brown   ierr = PetscMalloc1((depth+1), &depthShift);CHKERRQ(ierr);
505cd0c2139SMatthew G Knepley   ierr = PetscMemzero(depthShift, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
506cd0c2139SMatthew G Knepley   if (depth >= 0) depthShift[depth] = *numGhostCells;
507cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
508cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
509cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
510cd0c2139SMatthew G Knepley   for (c = cEnd; c < cEnd + *numGhostCells; ++c) {
511cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
512cd0c2139SMatthew G Knepley   }
513cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
514cd0c2139SMatthew G Knepley     IS              faceIS;
515cd0c2139SMatthew G Knepley     const PetscInt *faces;
516cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
517cd0c2139SMatthew G Knepley 
518cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
519cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
520cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
521cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
522cd0c2139SMatthew G Knepley       PetscInt size;
523cd0c2139SMatthew G Knepley 
52446c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
525cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
526cd0c2139SMatthew 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);
527cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + *numGhostCells, 2);CHKERRQ(ierr);
528cd0c2139SMatthew G Knepley     }
529cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
530cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
531cd0c2139SMatthew G Knepley   }
532cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
533cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
534cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
535cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
536cd0c2139SMatthew G Knepley   ghostCell = cEnd;
537cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
538cd0c2139SMatthew G Knepley     IS              faceIS;
539cd0c2139SMatthew G Knepley     const PetscInt *faces;
540cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
541cd0c2139SMatthew G Knepley 
542cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
543cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
544cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
54546c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
546cd0c2139SMatthew G Knepley       PetscInt newFace = faces[f] + *numGhostCells;
547cd0c2139SMatthew G Knepley 
54846c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
549cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
550cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
55146c796b9SMatthew G. Knepley       ++ghostCell;
552cd0c2139SMatthew G Knepley     }
553cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
554cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
555cd0c2139SMatthew G Knepley   }
556cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
557cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
558cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
559cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
560cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
561cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
562cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
563cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
564cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
565cd0c2139SMatthew G Knepley }
566cd0c2139SMatthew G Knepley 
567cd0c2139SMatthew G Knepley #undef __FUNCT__
568cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
569cd0c2139SMatthew G Knepley /*@C
570cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
571cd0c2139SMatthew G Knepley 
572cd0c2139SMatthew G Knepley   Collective on dm
573cd0c2139SMatthew G Knepley 
574cd0c2139SMatthew G Knepley   Input Parameters:
575cd0c2139SMatthew G Knepley + dm - The original DM
576cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
577cd0c2139SMatthew G Knepley 
578cd0c2139SMatthew G Knepley   Output Parameters:
579cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
580cd0c2139SMatthew G Knepley - dmGhosted - The new DM
581cd0c2139SMatthew G Knepley 
582cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
583cd0c2139SMatthew G Knepley 
584cd0c2139SMatthew G Knepley   Level: developer
585cd0c2139SMatthew G Knepley 
586cd0c2139SMatthew G Knepley .seealso: DMCreate()
58731266bc0SMatthew G. Knepley @*/
588cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
589cd0c2139SMatthew G Knepley {
590cd0c2139SMatthew G Knepley   DM             gdm;
591cd0c2139SMatthew G Knepley   DMLabel        label;
592cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
593cd0c2139SMatthew G Knepley   PetscInt       dim;
594a42b08eeSMatthew G. Knepley   PetscBool      flag;
595cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
596cd0c2139SMatthew G Knepley 
597cd0c2139SMatthew G Knepley   PetscFunctionBegin;
598cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
599cd0c2139SMatthew G Knepley   PetscValidPointer(numGhostCells, 3);
600cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
601cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
602cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
603cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
604cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(gdm, dim);CHKERRQ(ierr);
605a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
606a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
607a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
608a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
609cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
610cd0c2139SMatthew G Knepley   if (!label) {
611cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
612cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
613cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
614cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
615cd0c2139SMatthew G Knepley   }
616cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
617cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
618cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
619cd0c2139SMatthew G Knepley }
620cd0c2139SMatthew G Knepley 
621cd0c2139SMatthew G Knepley #undef __FUNCT__
622cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
623607ab7a9SMatthew G. Knepley /*
624faedd622SMatthew G. Knepley   We are adding three kinds of points here:
625607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
626faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
627607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
628a6ae58d1SMatthew G. Knepley 
629a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
630a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
631607ab7a9SMatthew G. Knepley */
632cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
633cd0c2139SMatthew G Knepley {
634cd0c2139SMatthew G Knepley   MPI_Comm         comm;
635607ab7a9SMatthew G. Knepley   IS               valueIS;
636607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
637607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
63818c5995bSMatthew G. Knepley   IS              *splitIS;
63918c5995bSMatthew G. Knepley   IS              *unsplitIS;
640607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
64118c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
64236dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
64336dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
644607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
64518c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
646cd0c2139SMatthew G Knepley   PetscSection     coordSection;
647cd0c2139SMatthew G Knepley   Vec              coordinates;
648cd0c2139SMatthew G Knepley   PetscScalar     *coords;
649607ab7a9SMatthew G. Knepley   PetscInt         depths[4];          /* Depths in the order that plex points are numbered */
650a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
651a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
652607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
653607ab7a9SMatthew G. Knepley   PetscInt        *depthOffset;        /* Prefix sums of depthShift */
654607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
655607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
65618c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
657cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
658cd0c2139SMatthew G Knepley 
659cd0c2139SMatthew G Knepley   PetscFunctionBegin;
660cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
661cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
662607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
663fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
664607ab7a9SMatthew G. Knepley   depths[0] = depth;
665607ab7a9SMatthew G. Knepley   depths[1] = 0;
666607ab7a9SMatthew G. Knepley   depths[2] = depth-1;
667607ab7a9SMatthew G. Knepley   depths[3] = 1;
668cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
669607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
6702203a8e9SMatthew G. Knepley   ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
671dcca6d9dSJed Brown   ierr = PetscMalloc7(depth+1,&splitIS,depth+1,&unsplitIS,depth+1,&numSplitPoints,depth+1,&numUnsplitPoints,depth+1,&numHybridPoints,depth+1,&splitPoints,depth+1,&unsplitPoints);CHKERRQ(ierr);
672607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthShift,  (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
673607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
674a6ae58d1SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &depthMax[depth] : NULL, depth>1 ? &depthMax[depth-1] : NULL, depth>2 ? &depthMax[1] : NULL, depth >= 0 ? &depthMax[0] : NULL);CHKERRQ(ierr);
675607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
676607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
677a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
678a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
679607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
68018c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
681607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
682a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
683607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
68418c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
68518c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
68618c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
687607ab7a9SMatthew G. Knepley   }
688cd0c2139SMatthew G Knepley   if (label) {
689cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
690cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
691cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
692cd0c2139SMatthew G Knepley   }
693cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
694cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
695cd0c2139SMatthew G Knepley 
696cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
69718c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
69818c5995bSMatthew G. Knepley     if (splitIS[dep]) {
69918c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
70018c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
70118c5995bSMatthew G. Knepley     }
70218c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
70318c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
70418c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
70518c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
706cd0c2139SMatthew G Knepley     }
707cd0c2139SMatthew G Knepley   }
708607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
70918c5995bSMatthew G. Knepley   for (d = 1; d <= depth; ++d) numHybridPoints[d]     = numSplitPoints[d-1] + numUnsplitPoints[d-1]; /* There is a hybrid cell/face/edge for every split face/edge/vertex   */
710607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) depthShift[d]          = numSplitPoints[d] + numHybridPoints[d];
711607ab7a9SMatthew G. Knepley   for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]];
712a6ae58d1SMatthew G. Knepley   for (d = 0; d <= depth; ++d) pMaxNew[d]            += depthOffset[d] - numHybridPointsOld[d];
713cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
714cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
715cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
716cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
717cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
718a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
7194c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
720cd0c2139SMatthew G Knepley       const PetscInt *support;
7214c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
722cd0c2139SMatthew G Knepley 
723cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
724cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
725cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
726cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
727cd0c2139SMatthew G Knepley       if (dep == depth-1) {
7284c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
7294c367dbcSMatthew G. Knepley 
730cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
7314c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
732cd0c2139SMatthew G Knepley       } else if (dep == 0) {
7334c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
734cd0c2139SMatthew G Knepley 
735cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
7364c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
737cd0c2139SMatthew G Knepley           PetscInt val;
738cd0c2139SMatthew G Knepley 
739cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
7404c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
7414c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
7424c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
743cd0c2139SMatthew G Knepley         }
7444c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
7454c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
7464c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
7474c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
7484c367dbcSMatthew G. Knepley         /* Add hybrid edge */
7494c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
7504c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
751cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
7524c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
7534c367dbcSMatthew G. Knepley 
754cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
7554c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
756cd0c2139SMatthew G Knepley           PetscInt val;
757cd0c2139SMatthew G Knepley 
758cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
7594c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
7604c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
7614c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
762cd0c2139SMatthew G Knepley         }
7634c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
7644c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
7654c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
7664c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
7674c367dbcSMatthew G. Knepley         /* Add hybrid face */
7684c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
7694c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
770cd0c2139SMatthew G Knepley       }
771cd0c2139SMatthew G Knepley     }
772cd0c2139SMatthew G Knepley   }
77318c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
77418c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
77518c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
776a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
77718c5995bSMatthew G. Knepley       const PetscInt *support;
778da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
77918c5995bSMatthew G. Knepley 
78018c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
78118c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
78239254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
78318c5995bSMatthew G. Knepley       if (dep == 0) {
78418c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
78518c5995bSMatthew G. Knepley 
78639254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
78739254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
78839254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
78939254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
79039254ff6SMatthew G. Knepley         }
79139254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
79218c5995bSMatthew G. Knepley         /* Add hybrid edge */
79318c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
794e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
795e1757548SMatthew G. Knepley           PetscInt val;
796e1757548SMatthew G. Knepley 
797e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
798e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
799da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
800da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
801e1757548SMatthew G. Knepley         }
802e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
80318c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
80418c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
805cd0c2139SMatthew G Knepley         PetscInt       val;
806cd0c2139SMatthew G Knepley 
807da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
808cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
809da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
810da1dd7e4SMatthew G. Knepley           else              ++qf;
811cd0c2139SMatthew G Knepley         }
81218c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
813da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
81418c5995bSMatthew G. Knepley         /* Add hybrid face */
815da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
816da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
817da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
818da1dd7e4SMatthew G. Knepley         }
81918c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
820da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
821cd0c2139SMatthew G Knepley       }
822cd0c2139SMatthew G Knepley     }
823cd0c2139SMatthew G Knepley   }
824cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
825cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
826cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
827dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
828dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
829cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
830cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
831cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
832cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
833a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
8344c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
835cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
8364c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
837cd0c2139SMatthew G Knepley 
838cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
839cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
840cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
841cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
842cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
843cd0c2139SMatthew G Knepley       if (dep == depth-1) {
84496a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
8454c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
846cd0c2139SMatthew G Knepley         const PetscInt *supportF;
847cd0c2139SMatthew G Knepley 
848cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
849cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
850cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
851cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
852cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
853cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
8544c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
85518c5995bSMatthew G. Knepley           if (v < 0) {
85618c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
85718c5995bSMatthew G. Knepley             if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1);
858a6ae58d1SMatthew G. Knepley             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/;
85996a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
86018c5995bSMatthew G. Knepley           } else {
8614c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
862163235baSMatthew G. Knepley             if (dep > 1) {
863163235baSMatthew G. Knepley               const PetscInt *econe;
864163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
865163235baSMatthew G. Knepley 
866163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
867163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
868163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
869163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
870163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
871163235baSMatthew G. Knepley                 if (vs >= 0) continue;
872163235baSMatthew G. Knepley                 if (vu < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", econe[r], dep-2);
873163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
874163235baSMatthew G. Knepley               }
875163235baSMatthew G. Knepley             }
876cd0c2139SMatthew G Knepley           }
877cd0c2139SMatthew G Knepley         }
878cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
879cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
880e537020bSMatthew G. Knepley         /* Face support */
881cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
882cd0c2139SMatthew G Knepley           PetscInt val;
883cd0c2139SMatthew G Knepley 
884cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
885cd0c2139SMatthew G Knepley           if (val < 0) {
886cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
8874c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
888cd0c2139SMatthew G Knepley           } else {
889cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
8904c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
891e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
892e537020bSMatthew G. Knepley             {
893e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
894e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
895e537020bSMatthew G. Knepley 
896e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
897e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
898e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
899e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
900e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
901e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
902e537020bSMatthew G. Knepley                   break;
903cd0c2139SMatthew G Knepley                 }
904cd0c2139SMatthew G Knepley               }
905e537020bSMatthew G. Knepley               if (nc >= nconeSize) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate face %d in neighboring cell %d", oldp, support[s]);
906e537020bSMatthew G. Knepley             }
907e537020bSMatthew G. Knepley           }
908e537020bSMatthew G. Knepley         }
9094c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
910fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
9114c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
9124c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
913e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
91418c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
91518c5995bSMatthew G. Knepley           if (v < 0) {
91618c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
91718c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
91818c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
91918c5995bSMatthew G. Knepley           } else {
92018c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
92118c5995bSMatthew G. Knepley           }
922e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
923e537020bSMatthew G. Knepley         }
9244c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
9254c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
92696a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
92796a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
928cd0c2139SMatthew G Knepley       } else if (dep == 0) {
9294c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
930cd0c2139SMatthew G Knepley 
931cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
9324c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
933cd0c2139SMatthew G Knepley           PetscInt val;
934cd0c2139SMatthew G Knepley 
935cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
936cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
937a6ae58d1SMatthew G. Knepley             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
938cd0c2139SMatthew G Knepley           }
939cd0c2139SMatthew G Knepley         }
9404c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
941cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
942cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
9434c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
944cd0c2139SMatthew G Knepley           PetscInt val, edge;
945cd0c2139SMatthew G Knepley 
946cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
947cd0c2139SMatthew G Knepley           if (val == 1) {
9484c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
949cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
9504c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
951cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
952a6ae58d1SMatthew G. Knepley             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
953cd0c2139SMatthew G Knepley           }
954cd0c2139SMatthew G Knepley         }
9554c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
956cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
9574c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
958cd0c2139SMatthew G Knepley         coneNew[0] = newp;
959cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
9604c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
9614c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
9624c367dbcSMatthew G. Knepley           PetscInt val, edge;
9634c367dbcSMatthew G. Knepley 
9644c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9654c367dbcSMatthew G. Knepley           if (val == 1) {
9664c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
9674c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
9684c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
9694c367dbcSMatthew G. Knepley           }
9704c367dbcSMatthew G. Knepley         }
9714c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
972cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
9734c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
9744c367dbcSMatthew G. Knepley 
975cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
976cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
977cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
9784c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
979e1757548SMatthew G. Knepley           if (v < 0) {
980e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
981e1757548SMatthew G. Knepley             if (v < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[q], dep-1);
982a6ae58d1SMatthew G. Knepley             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/;
983e1757548SMatthew G. Knepley           } else {
9844c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
985cd0c2139SMatthew G Knepley           }
986e1757548SMatthew G. Knepley         }
987cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
988cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
989cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
990cd0c2139SMatthew G Knepley           PetscInt val;
991cd0c2139SMatthew G Knepley 
992cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9934c367dbcSMatthew G. Knepley           if (val == dim-1) {
994a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
9954c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
996a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
997cd0c2139SMatthew G Knepley           }
998cd0c2139SMatthew G Knepley         }
999b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1000cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1001cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
1002cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1003cd0c2139SMatthew G Knepley           PetscInt val, face;
1004cd0c2139SMatthew G Knepley 
1005cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1006cd0c2139SMatthew G Knepley           if (val == dim-1) {
10074c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1008cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
10094c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
1010cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
1011a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
1012cd0c2139SMatthew G Knepley           }
1013cd0c2139SMatthew G Knepley         }
1014b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1015cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
10164c367dbcSMatthew G. Knepley         /* Hybrid face */
10174c367dbcSMatthew G. Knepley         coneNew[0] = newp;
10184c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
10194c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
10204c367dbcSMatthew G. Knepley           PetscInt vertex;
10214c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
1022e1757548SMatthew G. Knepley           if (vertex < 0) {
1023e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
1024e1757548SMatthew G. Knepley             if (vertex < 0) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not locate point %d in split or unsplit points of depth %d", cone[v], dep-1);
1025e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1026e1757548SMatthew G. Knepley           } else {
10274c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
10284c367dbcSMatthew G. Knepley           }
1029e1757548SMatthew G. Knepley         }
10304c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
10314c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
10324c367dbcSMatthew G. Knepley           PetscInt val, face;
10334c367dbcSMatthew G. Knepley 
10344c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
10354c367dbcSMatthew G. Knepley           if (val == dim-1) {
10364c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
10374c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
10384c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
10394c367dbcSMatthew G. Knepley           }
10404c367dbcSMatthew G. Knepley         }
10414c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1042cd0c2139SMatthew G Knepley       }
1043cd0c2139SMatthew G Knepley     }
1044cd0c2139SMatthew G Knepley   }
104518c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
104618c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
104718c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
1048a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
104918c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
1050e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
105118c5995bSMatthew G. Knepley 
105218c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
105318c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
105418c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
105518c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
105618c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
105718c5995bSMatthew G. Knepley       if (dep == 0) {
105818c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
105918c5995bSMatthew G. Knepley 
106018c5995bSMatthew G. Knepley         /* Unsplit vertex */
106118c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
106218c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
1063a6ae58d1SMatthew G. Knepley           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/;
106418c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
106518c5995bSMatthew G. Knepley           if (e >= 0) {
106618c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
106718c5995bSMatthew G. Knepley           }
106818c5995bSMatthew G. Knepley         }
106918c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
107018c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
107118c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
107218c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
107318c5995bSMatthew G. Knepley         /* Hybrid edge */
107418c5995bSMatthew G. Knepley         coneNew[0] = newp;
107518c5995bSMatthew G. Knepley         coneNew[1] = newp;
107618c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
107718c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
107818c5995bSMatthew G. Knepley           PetscInt val, edge;
107918c5995bSMatthew G. Knepley 
108018c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
108118c5995bSMatthew G. Knepley           if (val == 1) {
108218c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
108318c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
108418c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1085e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1086e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1087e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1088e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
108918c5995bSMatthew G. Knepley           }
109018c5995bSMatthew G. Knepley         }
109118c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1092e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1093e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1094e1757548SMatthew G. Knepley 
1095da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1096e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1097e1757548SMatthew G. Knepley           PetscInt val, face;
1098e1757548SMatthew G. Knepley 
1099e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1100e1757548SMatthew G. Knepley           if (val == dim-1) {
1101e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1102e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
1103a6ae58d1SMatthew G. Knepley             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/;
1104e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1105e1757548SMatthew G. Knepley           } else {
1106a6ae58d1SMatthew G. Knepley             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/;
1107e1757548SMatthew G. Knepley           }
1108e1757548SMatthew G. Knepley         }
1109e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1110e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1111da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1112da1dd7e4SMatthew G. Knepley         if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for unsplit edge %d is %d != %d\n", newp, qf, supportSizeNew);
1113e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1114e1757548SMatthew G. Knepley         /* Add hybrid face */
1115e1757548SMatthew G. Knepley         coneNew[0] = newp;
1116212cc919SMatthew G. Knepley         coneNew[1] = newp;
1117e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1118e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]);
1119212cc919SMatthew G. Knepley         coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1120e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1121e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1122e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1123e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1124da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1125da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1126da1dd7e4SMatthew G. Knepley 
1127da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1128da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1129da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1130da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1131da1dd7e4SMatthew G. Knepley           }
1132da1dd7e4SMatthew G. Knepley         }
1133da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1134da1dd7e4SMatthew G. Knepley         if (qf != supportSizeNew) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Support size for hybrid face %d is %d != %d\n", hybface, qf, supportSizeNew);
1135e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1136cd0c2139SMatthew G Knepley       }
1137cd0c2139SMatthew G Knepley     }
1138cd0c2139SMatthew G Knepley   }
1139cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1140cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1141cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1142cd0c2139SMatthew G Knepley     IS              pIS;
1143cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1144cd0c2139SMatthew G Knepley     const PetscInt *points;
1145cd0c2139SMatthew G Knepley 
1146cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1147cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1148cd0c2139SMatthew G Knepley     if (!pIS) continue;
1149cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1150cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1151cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1152cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1153cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
1154a6ae58d1SMatthew G. Knepley       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/;
1155cd0c2139SMatthew G Knepley       const PetscInt *cone;
1156cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
115750cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1158cd0c2139SMatthew G Knepley 
1159cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1160cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1161cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1162cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1163cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1164cd0c2139SMatthew G Knepley         const PetscInt coldp = cone[c] - depthOffset[dep-1];
1165cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1166cd0c2139SMatthew G Knepley 
1167cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1168cd0c2139SMatthew G Knepley         if (val == dep-1) {
1169cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1170cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1171cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1172cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
117350cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1174cd0c2139SMatthew G Knepley         }
1175cd0c2139SMatthew G Knepley       }
11764a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
11774a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1178cd0c2139SMatthew G Knepley     }
1179cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1180cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1181cd0c2139SMatthew G Knepley   }
1182cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1183cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1184cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1185cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
118669d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1187cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1188cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1189cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
1190a6ae58d1SMatthew G. Knepley     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1191cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1192cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1193cd0c2139SMatthew G Knepley 
1194cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1195cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1196cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1197cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1198cd0c2139SMatthew G Knepley   }
1199cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1200cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1201cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1202cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1203cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1204cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1205cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1206cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
1207a6ae58d1SMatthew G. Knepley       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1208cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1209cd0c2139SMatthew G Knepley       PetscInt       l;
1210cd0c2139SMatthew G Knepley 
1211cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1212cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1213cd0c2139SMatthew G Knepley         const char *lname;
1214cd0c2139SMatthew G Knepley         PetscInt    val;
12159a356370SMatthew G. Knepley         PetscBool   isDepth;
1216cd0c2139SMatthew G Knepley 
1217cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
12189a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
12199a356370SMatthew G. Knepley         if (isDepth) continue;
1220cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1221cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1222cd0c2139SMatthew G Knepley         if (val >= 0) {
1223cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
12249a356370SMatthew G. Knepley #if 0
12259a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
1226cd0c2139SMatthew G Knepley           if (dep == 0) {
12274c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1228cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
12294c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
12304c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
12314c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
1232cd0c2139SMatthew G Knepley           }
12334c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
12349a356370SMatthew G. Knepley #endif
1235cd0c2139SMatthew G Knepley         }
1236cd0c2139SMatthew G Knepley       }
1237cd0c2139SMatthew G Knepley     }
1238cd0c2139SMatthew G Knepley   }
1239cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1240cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1241cd0c2139SMatthew G Knepley 
1242cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
124318c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
124418c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
124518c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
124618c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1247cd0c2139SMatthew G Knepley   }
1248cd0c2139SMatthew G Knepley   if (label) {
1249cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1250cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1251cd0c2139SMatthew G Knepley   }
12520d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
12530d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
125436dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
12550d4d4d06SMatthew G. Knepley   }
12560e49e2e2SMatthew G. Knepley   ierr = DMPlexSetHybridBounds(sdm, depth >= 0 ? pMaxNew[depth] : PETSC_DETERMINE, depth>1 ? pMaxNew[depth-1] : PETSC_DETERMINE, depth>2 ? pMaxNew[1] : PETSC_DETERMINE, depth >= 0 ? pMaxNew[0] : PETSC_DETERMINE);CHKERRQ(ierr);
1257dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
1258a6ae58d1SMatthew G. Knepley   ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
125918c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1260cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1261cd0c2139SMatthew G Knepley }
1262cd0c2139SMatthew G Knepley 
1263cd0c2139SMatthew G Knepley #undef __FUNCT__
1264cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
1265cd0c2139SMatthew G Knepley /*@C
1266cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1267cd0c2139SMatthew G Knepley 
1268cd0c2139SMatthew G Knepley   Collective on dm
1269cd0c2139SMatthew G Knepley 
1270cd0c2139SMatthew G Knepley   Input Parameters:
1271cd0c2139SMatthew G Knepley + dm - The original DM
127253156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1273cd0c2139SMatthew G Knepley 
1274cd0c2139SMatthew G Knepley   Output Parameters:
1275cd0c2139SMatthew G Knepley - dmSplit - The new DM
1276cd0c2139SMatthew G Knepley 
1277cd0c2139SMatthew G Knepley   Level: developer
1278cd0c2139SMatthew G Knepley 
12792be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1280cd0c2139SMatthew G Knepley @*/
1281cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1282cd0c2139SMatthew G Knepley {
1283cd0c2139SMatthew G Knepley   DM             sdm;
1284cd0c2139SMatthew G Knepley   PetscInt       dim;
1285cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1286cd0c2139SMatthew G Knepley 
1287cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1288cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
128953156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1290cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1291cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1292cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1293cd0c2139SMatthew G Knepley   ierr = DMPlexSetDimension(sdm, dim);CHKERRQ(ierr);
1294cd0c2139SMatthew G Knepley   switch (dim) {
1295cd0c2139SMatthew G Knepley   case 2:
1296cd0c2139SMatthew G Knepley   case 3:
1297cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1298cd0c2139SMatthew G Knepley     break;
1299cd0c2139SMatthew G Knepley   default:
1300cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1301cd0c2139SMatthew G Knepley   }
1302cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1303cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1304cd0c2139SMatthew G Knepley }
1305cd0c2139SMatthew G Knepley 
1306cd0c2139SMatthew G Knepley #undef __FUNCT__
13070f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static"
13080f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */
13090f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos)
13100f66a230SMatthew G. Knepley {
13110f66a230SMatthew G. Knepley   const PetscInt *cone, *ornt;
13120f66a230SMatthew G. Knepley   PetscInt        dim, coneSize, c;
13130f66a230SMatthew G. Knepley   PetscErrorCode  ierr;
13140f66a230SMatthew G. Knepley 
13150f66a230SMatthew G. Knepley   PetscFunctionBegin;
13160f66a230SMatthew G. Knepley   *pos = PETSC_TRUE;
13170f66a230SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
13180f66a230SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
13190f66a230SMatthew G. Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
13200f66a230SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr);
13210f66a230SMatthew G. Knepley   for (c = 0; c < coneSize; ++c) {
13220f66a230SMatthew G. Knepley     if (cone[c] == face) {
13230f66a230SMatthew G. Knepley       PetscInt o = ornt[c];
13240f66a230SMatthew G. Knepley 
13250f66a230SMatthew G. Knepley       if (subdm) {
13260f66a230SMatthew G. Knepley         const PetscInt *subcone, *subornt;
13270f66a230SMatthew G. Knepley         PetscInt        subpoint, subface, subconeSize, sc;
13280f66a230SMatthew G. Knepley 
13290f66a230SMatthew G. Knepley         ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
13300f66a230SMatthew G. Knepley         ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr);
13310f66a230SMatthew G. Knepley         ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
13320f66a230SMatthew G. Knepley         ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
13330f66a230SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
13340f66a230SMatthew G. Knepley         for (sc = 0; sc < subconeSize; ++sc) {
13350f66a230SMatthew G. Knepley           if (subcone[sc] == subface) {
13360f66a230SMatthew G. Knepley             o = subornt[0];
13370f66a230SMatthew G. Knepley             break;
13380f66a230SMatthew G. Knepley           }
13390f66a230SMatthew G. Knepley         }
13400f66a230SMatthew G. Knepley         if (sc >= subconeSize) SETERRQ4(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find subpoint %d (%d) in cone for subpoint %d (%d)", subface, face, subpoint, cell);
13410f66a230SMatthew G. Knepley       }
13420f66a230SMatthew G. Knepley       if (o >= 0) *pos = PETSC_TRUE;
13430f66a230SMatthew G. Knepley       else        *pos = PETSC_FALSE;
13440f66a230SMatthew G. Knepley       break;
13450f66a230SMatthew G. Knepley     }
13460f66a230SMatthew G. Knepley   }
13470f66a230SMatthew G. Knepley   if (c == coneSize) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Cell %d in split face %d support does not have it in the cone", cell, face);
13480f66a230SMatthew G. Knepley   PetscFunctionReturn(0);
13490f66a230SMatthew G. Knepley }
13500f66a230SMatthew G. Knepley 
13510f66a230SMatthew G. Knepley #undef __FUNCT__
13522be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1353cd0c2139SMatthew G Knepley /*@
13540f66a230SMatthew G. Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces
1355cd0c2139SMatthew G Knepley   to complete the surface
1356cd0c2139SMatthew G Knepley 
1357cd0c2139SMatthew G Knepley   Input Parameters:
1358cd0c2139SMatthew G Knepley + dm     - The DM
13590f66a230SMatthew G. Knepley . label  - A DMLabel marking the surface
13600f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically
1361bb55d314SMatthew G. Knepley . flip   - Flag to flip the submesh normal and replace points on the other side
136247946fd8SMatthew G. Knepley - subdm  - The subDM associated with the label, or NULL
1363cd0c2139SMatthew G Knepley 
1364cd0c2139SMatthew G Knepley   Output Parameter:
1365cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1366cd0c2139SMatthew G Knepley 
13670f66a230SMatthew G. Knepley   Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation.
13680f66a230SMatthew G. Knepley 
1369cd0c2139SMatthew G Knepley   Level: developer
1370cd0c2139SMatthew G Knepley 
13712be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1372cd0c2139SMatthew G Knepley @*/
13730f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm)
1374cd0c2139SMatthew G Knepley {
1375d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
137618c5995bSMatthew G. Knepley   IS              dimIS, subpointIS, facePosIS, faceNegIS;
137747946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1378bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
13790f66a230SMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, dep, cStart, cEnd, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val;
1380cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1381cd0c2139SMatthew G Knepley 
1382cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1383d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1384cd0c2139SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
138547946fd8SMatthew G. Knepley   if (subdm) {
138647946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
138747946fd8SMatthew G. Knepley     if (subpointIS) {
138847946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
138947946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
139047946fd8SMatthew G. Knepley     }
139147946fd8SMatthew G. Knepley   }
1392d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1393cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1394cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1395cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1396cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1397d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1398cd0c2139SMatthew G Knepley     const PetscInt *support;
1399cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1400cd0c2139SMatthew G Knepley 
1401cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1402cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1403cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1404cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
14050f66a230SMatthew G. Knepley       const PetscInt *cone;
1406cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
14070f66a230SMatthew G. Knepley       PetscBool       pos;
1408cd0c2139SMatthew G Knepley 
14090f66a230SMatthew G. Knepley       ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr);
14100f66a230SMatthew G. Knepley       if (pos) {ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);}
14110f66a230SMatthew G. Knepley       else     {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);}
14120f66a230SMatthew G. Knepley       if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE;
14130f66a230SMatthew G. Knepley       /* Put faces touching the fault in the label */
1414cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1415cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1416cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1417cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1418cd0c2139SMatthew G Knepley 
1419cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1420cd0c2139SMatthew G Knepley         if (val == -1) {
1421cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1422cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1423cd0c2139SMatthew G Knepley 
1424cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1425cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1426cd0c2139SMatthew G Knepley             const PetscInt clp  = closure[cl];
1427*a0541d8aSMatthew G. Knepley             PetscInt       bval = -1;
1428cd0c2139SMatthew G Knepley 
1429cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1430*a0541d8aSMatthew G. Knepley             if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);}
1431*a0541d8aSMatthew G. Knepley             if ((val >= 0) && (val < dim-1) && (bval < 0)) {
1432cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1433cd0c2139SMatthew G Knepley               break;
1434cd0c2139SMatthew G Knepley             }
1435cd0c2139SMatthew G Knepley           }
1436cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1437cd0c2139SMatthew G Knepley         }
1438cd0c2139SMatthew G Knepley       }
1439cd0c2139SMatthew G Knepley     }
1440cd0c2139SMatthew G Knepley   }
14410f66a230SMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
14420f66a230SMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
144347946fd8SMatthew G. Knepley   if (subdm) {
144447946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
144547946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
144647946fd8SMatthew G. Knepley   }
1447*a0541d8aSMatthew G. Knepley   /* Mark boundary points as unsplit */
1448*a0541d8aSMatthew G. Knepley   if (blabel && dim == 3) {
1449*a0541d8aSMatthew G. Knepley     ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr);
1450*a0541d8aSMatthew G. Knepley     ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1451*a0541d8aSMatthew G. Knepley     ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1452*a0541d8aSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1453*a0541d8aSMatthew G. Knepley       const PetscInt point = points[p];
1454*a0541d8aSMatthew G. Knepley       PetscInt       val, bval;
1455*a0541d8aSMatthew G. Knepley 
1456*a0541d8aSMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1457*a0541d8aSMatthew G. Knepley       if (bval >= 0) {
1458*a0541d8aSMatthew G. Knepley         /* Mark as unsplit */
1459*a0541d8aSMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1460*a0541d8aSMatthew G. Knepley         if ((val < 0) || (val > dim)) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Point %d has label value %d, should be part of the fault", point, val);
1461*a0541d8aSMatthew G. Knepley         ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr);
1462*a0541d8aSMatthew G. Knepley         ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr);
1463*a0541d8aSMatthew G. Knepley       }
1464*a0541d8aSMatthew G. Knepley     }
1465*a0541d8aSMatthew G. Knepley     ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1466*a0541d8aSMatthew G. Knepley     ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1467*a0541d8aSMatthew G. Knepley   }
1468cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1469c4d480a2SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
1470cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
14710f66a230SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
1472cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
1473cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1474cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1475cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1476d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1477cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
1478c4d480a2SMatthew G. Knepley     PetscInt  starSize, s, bval;
1479cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1480cd0c2139SMatthew G Knepley 
1481c4d480a2SMatthew G. Knepley     /* Ignore vertices marked in boundary label */
1482c4d480a2SMatthew G. Knepley     if (blabel) {
1483c4d480a2SMatthew G. Knepley       ierr = DMLabelGetValue(blabel, points[p], &bval);CHKERRQ(ierr);
1484c4d480a2SMatthew G. Knepley       if (bval >= 0) {
1485c4d480a2SMatthew G. Knepley         /* Mark as unsplit */
1486c4d480a2SMatthew G. Knepley         ierr = DMLabelClearValue(label, points[p], 0);CHKERRQ(ierr);
1487c4d480a2SMatthew G. Knepley         ierr = DMLabelSetValue(label, points[p], shift2+0);CHKERRQ(ierr);
1488c4d480a2SMatthew G. Knepley         continue;
1489c4d480a2SMatthew G. Knepley       }
1490c4d480a2SMatthew G. Knepley     }
1491d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1492cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1493cd0c2139SMatthew G Knepley     while (again) {
1494cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1495cd0c2139SMatthew G Knepley       again = 0;
1496cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1497cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1498cd0c2139SMatthew G Knepley         const PetscInt *cone;
1499cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1500cd0c2139SMatthew G Knepley 
1501cd0c2139SMatthew G Knepley         if ((point < cStart) || (point >= cEnd)) continue;
1502cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1503cd0c2139SMatthew G Knepley         if (val != -1) continue;
1504d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1505cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1506cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1507cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1508cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1509cd0c2139SMatthew G Knepley           if (val != -1) {
1510d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1511166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1512d7c8f101SMatthew G. Knepley 
1513cd0c2139SMatthew 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);
151437a6de01SMatthew G. Knepley             if (val > 0) side =  1;
151537a6de01SMatthew G. Knepley             else         side = -1;
151637a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1517d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1518d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1519d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1520d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1521d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1522d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1523d7c8f101SMatthew G. Knepley 
1524166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1525166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1526d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1527d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1528d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1529d7c8f101SMatthew G. Knepley 
1530d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1531d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1532d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
153337a6de01SMatthew G. Knepley                 break;
153437a6de01SMatthew G. Knepley               }
1535d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1536cd0c2139SMatthew G Knepley             }
1537cd0c2139SMatthew G Knepley             again = 1;
1538cd0c2139SMatthew G Knepley             break;
1539cd0c2139SMatthew G Knepley           }
1540cd0c2139SMatthew G Knepley         }
1541cd0c2139SMatthew G Knepley       }
1542cd0c2139SMatthew G Knepley     }
1543cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1544cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1545cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1546cd0c2139SMatthew G Knepley 
1547cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1548cd0c2139SMatthew G Knepley       if (val == -1) {
1549cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1550cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1551cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1552cd0c2139SMatthew G Knepley 
1553cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1554cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1555cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1556cd0c2139SMatthew G Knepley 
1557cd0c2139SMatthew G Knepley           if ((spoint < cStart) || (spoint >= cEnd)) continue;
1558cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1559cd0c2139SMatthew 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);
1560d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1561cd0c2139SMatthew G Knepley           if (val > 0) {
1562cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1563cd0c2139SMatthew G Knepley           } else {
1564cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1565cd0c2139SMatthew G Knepley           }
1566cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1567cd0c2139SMatthew G Knepley           break;
1568cd0c2139SMatthew G Knepley         }
1569cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1570cd0c2139SMatthew G Knepley         if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1571cd0c2139SMatthew G Knepley       }
1572cd0c2139SMatthew G Knepley     }
1573cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1574cd0c2139SMatthew G Knepley   }
1575cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1576cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
157718c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
157818c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
157918c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
158018c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
158118c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
158218c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
158318c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
158418c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
158518c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
158618c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
158718c5995bSMatthew G. Knepley     const PetscInt *support;
158818c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
158918c5995bSMatthew G. Knepley 
159018c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
159118c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
159218c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
159318c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
159418c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
159518c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
159618c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
159718c5995bSMatthew G. Knepley     /* Split the face */
159818c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
159918c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
160018c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1601e1757548SMatthew G. Knepley     /* Label its closure:
1602e1757548SMatthew G. Knepley       unmarked: label as unsplit
1603e1757548SMatthew G. Knepley       incident: relabel as split
1604e1757548SMatthew G. Knepley       split:    do nothing
1605e1757548SMatthew G. Knepley     */
160618c5995bSMatthew G. Knepley     {
160718c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
160818c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
160918c5995bSMatthew G. Knepley 
161018c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
161118c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
161218c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
16138771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
161418c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
161518c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
16168771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1617e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1618e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1619e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1620e1757548SMatthew G. Knepley         }
162118c5995bSMatthew G. Knepley       }
162218c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
162318c5995bSMatthew G. Knepley     }
162418c5995bSMatthew G. Knepley   }
162518c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
162618c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1627cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1628cd0c2139SMatthew G Knepley }
1629cd0c2139SMatthew G Knepley 
1630cd0c2139SMatthew G Knepley #undef __FUNCT__
16313cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
16323cf72582SMatthew G. Knepley /*@C
16333cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
16343cf72582SMatthew G. Knepley 
16353cf72582SMatthew G. Knepley   Collective on dm
16363cf72582SMatthew G. Knepley 
16373cf72582SMatthew G. Knepley   Input Parameters:
16383cf72582SMatthew G. Knepley + dm - The original DM
16393cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
16403cf72582SMatthew G. Knepley 
16413cf72582SMatthew G. Knepley   Output Parameters:
16423cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
16433cf72582SMatthew G. Knepley - dmHybrid - The new DM
16443cf72582SMatthew G. Knepley 
16453cf72582SMatthew G. Knepley   Level: developer
16463cf72582SMatthew G. Knepley 
16473cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
16483cf72582SMatthew G. Knepley @*/
16493cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
16503cf72582SMatthew G. Knepley {
16513cf72582SMatthew G. Knepley   DM             idm;
16523cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
16533cf72582SMatthew G. Knepley   PetscInt       dim;
16543cf72582SMatthew G. Knepley   PetscErrorCode ierr;
16553cf72582SMatthew G. Knepley 
16563cf72582SMatthew G. Knepley   PetscFunctionBegin;
16573cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
16583cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
16593cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
16603cf72582SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
16613cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
16623cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
16633cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
16643cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
16653cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
16660f66a230SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr);
16673cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
16683cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
16693cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
167053aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1671e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1672e6ccafaeSMatthew G Knepley }
1673e6ccafaeSMatthew G Knepley 
1674e6ccafaeSMatthew G Knepley #undef __FUNCT__
1675efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1676efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1677efa14ee0SMatthew G Knepley 
1678efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1679efa14ee0SMatthew G Knepley */
1680830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1681efa14ee0SMatthew G Knepley {
1682fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1683efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
168477d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1685efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1686efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1687efa14ee0SMatthew G Knepley 
1688efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1689efa14ee0SMatthew G Knepley   *numFaces = 0;
1690efa14ee0SMatthew G Knepley   *nFV      = 0;
1691efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1692efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
169377d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1694dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1695d92e47f8SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, depth >= 0 ? &pMax[depth] : NULL, depth>1 ? &pMax[depth-1] : NULL, depth>2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1696efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1697efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1698efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1699efa14ee0SMatthew G Knepley   }
1700efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1701fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1702efa14ee0SMatthew G Knepley   if (subvertexIS) {
1703efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1704efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1705efa14ee0SMatthew G Knepley   }
1706efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1707efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
17080298fd71SBarry Smith     PetscInt      *star   = NULL;
1709efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1710efa14ee0SMatthew G Knepley 
1711efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1712efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1713efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1714efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1715efa14ee0SMatthew G Knepley     }
1716efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1717efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
17180298fd71SBarry Smith       PetscInt      *closure = NULL;
1719efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1720efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1721efa14ee0SMatthew G Knepley 
1722efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
172365560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
172482f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1725efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1726efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1727efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1728efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1729efa14ee0SMatthew G Knepley 
1730efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1731efa14ee0SMatthew G Knepley           ++numCorners;
1732efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1733830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1734efa14ee0SMatthew G Knepley         }
1735efa14ee0SMatthew G Knepley       }
173618ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
173782f516ccSBarry 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);
1738efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1739007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1740007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1741007baee2SMatthew G. Knepley 
1742efa14ee0SMatthew G Knepley         ++(*numFaces);
1743efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1744efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1745efa14ee0SMatthew G Knepley         }
1746007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1747007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1748007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1749007baee2SMatthew G. Knepley         }
1750007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1751efa14ee0SMatthew G Knepley       }
1752efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1753efa14ee0SMatthew G Knepley     }
1754efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1755efa14ee0SMatthew G Knepley   }
1756efa14ee0SMatthew G Knepley   if (subvertexIS) {
1757efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1758efa14ee0SMatthew G Knepley   }
1759efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1760efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1761efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1762efa14ee0SMatthew G Knepley }
1763efa14ee0SMatthew G Knepley 
1764efa14ee0SMatthew G Knepley #undef __FUNCT__
1765efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1766830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1767efa14ee0SMatthew G Knepley {
1768efa14ee0SMatthew G Knepley   IS               subvertexIS;
1769efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1770efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1771efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1772efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1773efa14ee0SMatthew G Knepley 
1774efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1775efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1776dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
17770298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1778efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1779efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1780efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1781efa14ee0SMatthew G Knepley   }
1782efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1783830e53efSMatthew G. Knepley   ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1784efa14ee0SMatthew G Knepley   if (subvertexIS) {
1785efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1786efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1787efa14ee0SMatthew G Knepley   }
1788efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1789efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
17900298fd71SBarry Smith     PetscInt      *star   = NULL;
1791efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1792efa14ee0SMatthew G Knepley 
1793efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1794efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1795efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1796efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1797efa14ee0SMatthew G Knepley     }
1798efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1799efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
18000298fd71SBarry Smith       PetscInt      *closure = NULL;
1801efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1802efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1803efa14ee0SMatthew G Knepley 
1804efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1805efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
180682f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1807efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1808efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1809efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1810efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1811efa14ee0SMatthew G Knepley 
1812efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1813efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1814830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1815efa14ee0SMatthew G Knepley         }
1816efa14ee0SMatthew G Knepley       }
1817efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1818efa14ee0SMatthew G Knepley         const PetscInt *support;
1819efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1820efa14ee0SMatthew G Knepley 
1821efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1822efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1823efa14ee0SMatthew G Knepley 
1824efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1825efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1826efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1827efa14ee0SMatthew G Knepley               break;
1828efa14ee0SMatthew G Knepley             }
1829efa14ee0SMatthew G Knepley           }
1830efa14ee0SMatthew G Knepley         }
1831efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1832efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1833efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1834efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1835efa14ee0SMatthew G Knepley         }
1836efa14ee0SMatthew G Knepley       }
1837efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1838efa14ee0SMatthew G Knepley     }
1839efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1840efa14ee0SMatthew G Knepley   }
1841efa14ee0SMatthew G Knepley   if (subvertexIS) {
1842efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1843efa14ee0SMatthew G Knepley   }
1844efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1845efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1846efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1847efa14ee0SMatthew G Knepley }
1848efa14ee0SMatthew G Knepley 
1849efa14ee0SMatthew G Knepley #undef __FUNCT__
1850766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
185127c04023SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char labelname[], PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, PetscInt *subCells[], DM subdm)
1852766ab985SMatthew G. Knepley {
185327c04023SMatthew G. Knepley   DMLabel         label = NULL;
1854766ab985SMatthew G. Knepley   const PetscInt *cone;
185527234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
1856766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
1857766ab985SMatthew G. Knepley 
1858812bfc34SJed Brown   PetscFunctionBegin;
1859c0ed958bSJed Brown   *numFaces = 0;
1860c0ed958bSJed Brown   *nFV = 0;
1861b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1862fed694aaSMatthew G. Knepley   *subCells = NULL;
1863766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1864766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1865766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1866766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
186727c04023SMatthew G. Knepley   if (label) {
186827c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
186927c04023SMatthew G. Knepley       PetscInt val;
187027c04023SMatthew G. Knepley 
187127c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
187227c04023SMatthew G. Knepley       if (val == value) {
187327c04023SMatthew G. Knepley         ++(*numFaces);
187427c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
187527c04023SMatthew G. Knepley       }
187627c04023SMatthew G. Knepley     }
187727c04023SMatthew G. Knepley   } else {
1878766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
187927c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
188027c04023SMatthew G. Knepley   }
1881766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
1882785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
1883766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1884766ab985SMatthew G. Knepley     const PetscInt *cells;
1885766ab985SMatthew G. Knepley     PetscInt        numCells;
1886766ab985SMatthew G. Knepley 
188727c04023SMatthew G. Knepley     if (label) {
188827c04023SMatthew G. Knepley       PetscInt val;
188927c04023SMatthew G. Knepley 
189027c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
189127c04023SMatthew G. Knepley       if (val != value) continue;
189227c04023SMatthew G. Knepley     }
1893766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1894766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
1895766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
1896766ab985SMatthew G. Knepley     }
1897766ab985SMatthew G. Knepley     /* Negative face */
1898766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
189927234c99SMatthew G. Knepley     /* Not true in parallel
190027234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
1901766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
1902766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
190327234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
1904766ab985SMatthew G. Knepley     }
1905766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
1906766ab985SMatthew G. Knepley     /* Positive face is not included */
1907766ab985SMatthew G. Knepley   }
1908766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1909766ab985SMatthew G. Knepley }
1910766ab985SMatthew G. Knepley 
1911766ab985SMatthew G. Knepley #undef __FUNCT__
1912766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
1913b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm)
1914766ab985SMatthew G. Knepley {
191527c04023SMatthew G. Knepley   DMLabel        label = NULL;
1916766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
1917766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
1918766ab985SMatthew G. Knepley   PetscErrorCode ierr;
1919766ab985SMatthew G. Knepley 
1920812bfc34SJed Brown   PetscFunctionBegin;
192127c04023SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1922766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
1923766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1924766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1925766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
1926dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
1927b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
1928766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1929766ab985SMatthew G. Knepley     const PetscInt *cone;
1930766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
1931b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
1932766ab985SMatthew G. Knepley 
193327c04023SMatthew G. Knepley     if (label) {
193427c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
193527c04023SMatthew G. Knepley       if (val != value) continue;
193627c04023SMatthew G. Knepley     }
1937766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
1938766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1939b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
1940b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1941b3154360SMatthew G. Knepley     /* Negative face */
1942766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1943766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1944766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
1945766ab985SMatthew G. Knepley 
1946766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
1947766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
1948766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1949766ab985SMatthew G. Knepley           break;
1950766ab985SMatthew G. Knepley         }
1951766ab985SMatthew G. Knepley       }
1952766ab985SMatthew G. Knepley     }
1953766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1954766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
1955766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
1956766ab985SMatthew G. Knepley       const PetscInt *support;
1957766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
1958766ab985SMatthew G. Knepley 
1959766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
1960711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
1961766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
1962766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
1963766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1964766ab985SMatthew G. Knepley       }
1965766ab985SMatthew G. Knepley     }
1966766ab985SMatthew G. Knepley   }
1967766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
1968766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1969766ab985SMatthew G. Knepley }
1970766ab985SMatthew G. Knepley 
1971766ab985SMatthew G. Knepley #undef __FUNCT__
1972e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
1973e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
1974e6ccafaeSMatthew G Knepley {
197582f516ccSBarry Smith   MPI_Comm       comm;
1976e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
1977e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
1978e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
1979e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
1980e6ccafaeSMatthew G Knepley 
198182f516ccSBarry Smith   PetscFunctionBegin;
198282f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
1983e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &cellDim);CHKERRQ(ierr);
1984e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
1985e6ccafaeSMatthew G Knepley 
1986ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
1987ddeab2a6SMatthew G. Knepley     /* Triangle */
1988e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
1989e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1990ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
1991ddeab2a6SMatthew G. Knepley     /* Triangle */
1992ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1993ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1994ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
1995ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
1996ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
1997ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
1998e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
1999e6ccafaeSMatthew G Knepley     /* Quadratic line */
2000e6ccafaeSMatthew G Knepley     faceSize  = 1;
2001e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
2002e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
2003e6ccafaeSMatthew G Knepley     /* Quads */
2004e6ccafaeSMatthew G Knepley     faceSize = 2;
2005e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
2006e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2007e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
2008e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2009e6ccafaeSMatthew G Knepley     } else {
2010e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
2011e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
2012e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
2013e6ccafaeSMatthew G Knepley     }
2014e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
2015e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
2016e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2017e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
2018e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2019e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
2020e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
2021e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2022e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2023e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
2024e6ccafaeSMatthew G Knepley     };
2025e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
2026e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2027e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2028e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
2029e6ccafaeSMatthew G Knepley     };
2030e6ccafaeSMatthew G Knepley 
2031e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
2032e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
2033e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
2034e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
2035e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
2036e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2037e6ccafaeSMatthew G Knepley 
2038e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
2039e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
2040e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
2041e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
2042e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
2043e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2044e6ccafaeSMatthew G Knepley               break;
2045e6ccafaeSMatthew G Knepley             }
2046e6ccafaeSMatthew G Knepley           }
2047e6ccafaeSMatthew G Knepley         }
2048e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2049e6ccafaeSMatthew G Knepley         break;
2050e6ccafaeSMatthew G Knepley       }
2051e6ccafaeSMatthew G Knepley     }
2052e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
2053e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2054e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2055e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
2056e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
2057e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2058e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
2059e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2060e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
2061e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
2062e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2063e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2064e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2065e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
2066e6ccafaeSMatthew G Knepley     };
2067e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
2068e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2069e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2070e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2071e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
2072e6ccafaeSMatthew G Knepley     };
2073e6ccafaeSMatthew G Knepley 
2074e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
2075e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
2076e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
2077e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
2078e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
2079e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2080e6ccafaeSMatthew G Knepley 
2081e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
2082e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
2083e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
2084e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
2085e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
2086e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2087e6ccafaeSMatthew G Knepley               break;
2088e6ccafaeSMatthew G Knepley             }
2089e6ccafaeSMatthew G Knepley           }
2090e6ccafaeSMatthew G Knepley         }
2091e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2092e6ccafaeSMatthew G Knepley         break;
2093e6ccafaeSMatthew G Knepley       }
2094e6ccafaeSMatthew G Knepley     }
2095e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
2096e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2097e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2098e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
2099e6ccafaeSMatthew G Knepley     /* Hexes
2100e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2101e6ccafaeSMatthew G Knepley        pointing up at the second.
2102e6ccafaeSMatthew G Knepley 
2103e6ccafaeSMatthew G Knepley           7---6
2104e6ccafaeSMatthew G Knepley          /|  /|
2105e6ccafaeSMatthew G Knepley         4---5 |
2106ddeab2a6SMatthew G. Knepley         | 1-|-2
2107e6ccafaeSMatthew G Knepley         |/  |/
2108ddeab2a6SMatthew G. Knepley         0---3
2109e6ccafaeSMatthew G Knepley 
2110e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
2111e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
2112e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
2113e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2114e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
2115e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
2116e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2117ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2118ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2119ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2120ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2121e6ccafaeSMatthew G Knepley     };
2122e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2123ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2124e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2125ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2126ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2127ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2128ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2129e6ccafaeSMatthew G Knepley     };
2130e6ccafaeSMatthew G Knepley 
2131e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
2132e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2133e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2134e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2135e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2136e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2137e6ccafaeSMatthew G Knepley 
2138e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2139e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2140e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2141e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2142e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2143e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2144e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2145e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2146e6ccafaeSMatthew G Knepley               break;
2147e6ccafaeSMatthew G Knepley             }
2148e6ccafaeSMatthew G Knepley           }
2149e6ccafaeSMatthew G Knepley         }
2150e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2151e6ccafaeSMatthew G Knepley         break;
2152e6ccafaeSMatthew G Knepley       }
2153e6ccafaeSMatthew G Knepley     }
2154e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2155e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2156e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2157e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2158e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2159e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2160e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2161e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2162e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2163e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2164e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2165e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2166e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2167e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2168e6ccafaeSMatthew G Knepley     };
2169e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2170e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2171e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2172e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2173e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2174e6ccafaeSMatthew G Knepley     };
2175e6ccafaeSMatthew G Knepley 
2176e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
2177e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2178e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2179e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2180e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2181e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2182e6ccafaeSMatthew G Knepley 
2183e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2184e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2185e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2186e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2187e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2188e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2189e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2190e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2191e6ccafaeSMatthew G Knepley               break;
2192e6ccafaeSMatthew G Knepley             }
2193e6ccafaeSMatthew G Knepley           }
2194e6ccafaeSMatthew G Knepley         }
2195e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2196e6ccafaeSMatthew G Knepley         break;
2197e6ccafaeSMatthew G Knepley       }
2198e6ccafaeSMatthew G Knepley     }
2199e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2200e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2201e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2202e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2203e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2204e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2205e6ccafaeSMatthew G Knepley        pointing up at the second.
2206e6ccafaeSMatthew G Knepley 
2207e6ccafaeSMatthew G Knepley          7---6
2208e6ccafaeSMatthew G Knepley         /|  /|
2209e6ccafaeSMatthew G Knepley        4---5 |
2210e6ccafaeSMatthew G Knepley        | 3-|-2
2211e6ccafaeSMatthew G Knepley        |/  |/
2212e6ccafaeSMatthew G Knepley        0---1
2213e6ccafaeSMatthew G Knepley 
2214e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2215e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2216e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2217e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2218e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2219e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2220e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2221e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2222e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2223e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2224e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2225e6ccafaeSMatthew G Knepley     };
2226e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2227e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2228e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2229e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2230e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2231e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2232e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2233e6ccafaeSMatthew G Knepley     };
2234e6ccafaeSMatthew G Knepley 
2235e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
2236e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2237e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2238e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2239e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2240e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2241e6ccafaeSMatthew G Knepley 
2242e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2243e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2244e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2245e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2246e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2247e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2248e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2249e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2250e6ccafaeSMatthew G Knepley               break;
2251e6ccafaeSMatthew G Knepley             }
2252e6ccafaeSMatthew G Knepley           }
2253e6ccafaeSMatthew G Knepley         }
2254e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2255e6ccafaeSMatthew G Knepley         break;
2256e6ccafaeSMatthew G Knepley       }
2257e6ccafaeSMatthew G Knepley     }
2258e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2259e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2260e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2261e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2262e6ccafaeSMatthew G Knepley   if (!posOrient) {
2263e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2264e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2265e6ccafaeSMatthew G Knepley   } else {
2266e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2267e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2268e6ccafaeSMatthew G Knepley   }
2269e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2270e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2271e6ccafaeSMatthew G Knepley }
2272e6ccafaeSMatthew G Knepley 
2273e6ccafaeSMatthew G Knepley #undef __FUNCT__
2274e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
2275e6ccafaeSMatthew G Knepley /*
2276e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
2277e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
2278e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
2279e6ccafaeSMatthew G Knepley */
2280e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2281e6ccafaeSMatthew G Knepley {
22820298fd71SBarry Smith   const PetscInt *cone = NULL;
2283e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2284e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2285e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2286e6ccafaeSMatthew G Knepley 
2287e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2288e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2289e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2290e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2291e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2292e6ccafaeSMatthew G Knepley 
2293e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2294e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2295e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2296e6ccafaeSMatthew G Knepley       }
2297e6ccafaeSMatthew G Knepley     }
2298e6ccafaeSMatthew G Knepley     if (found) {
2299e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2300e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2301e6ccafaeSMatthew G Knepley       ++v2;
2302e6ccafaeSMatthew G Knepley     } else {
2303e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2304e6ccafaeSMatthew G Knepley     }
2305e6ccafaeSMatthew G Knepley   }
2306e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2307e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2308e6ccafaeSMatthew G Knepley }
2309e6ccafaeSMatthew G Knepley 
2310e6ccafaeSMatthew G Knepley #undef __FUNCT__
2311cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
2312e6ccafaeSMatthew G Knepley /*
2313cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2314e6ccafaeSMatthew G Knepley 
2315e6ccafaeSMatthew G Knepley   Not collective
2316e6ccafaeSMatthew G Knepley 
2317e6ccafaeSMatthew G Knepley   Input Parameters:
2318e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2319e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2320e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2321e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2322e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2323e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2324e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2325e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2326e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2327e6ccafaeSMatthew G Knepley 
2328e6ccafaeSMatthew G Knepley   Output Parameters:
2329e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2330e6ccafaeSMatthew G Knepley 
2331e6ccafaeSMatthew G Knepley   Level: developer
2332e6ccafaeSMatthew G Knepley */
2333cd0c2139SMatthew 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)
2334e6ccafaeSMatthew G Knepley {
233582f516ccSBarry Smith   MPI_Comm        comm;
2336e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2337e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2338e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2339e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2340e6ccafaeSMatthew G Knepley 
2341e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
234282f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2343e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2344e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2345e6ccafaeSMatthew G Knepley #if 0
2346e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2347e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2348e6ccafaeSMatthew G Knepley #else
2349e6ccafaeSMatthew G Knepley   {
2350e6ccafaeSMatthew G Knepley     PetscInt f;
2351e6ccafaeSMatthew G Knepley 
2352e6ccafaeSMatthew G Knepley     numFaces = 0;
2353e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2354e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2355e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2356e6ccafaeSMatthew G Knepley 
2357e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2358e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2359e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2360e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2361e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2362e6ccafaeSMatthew G Knepley         PetscInt       v;
2363e6ccafaeSMatthew G Knepley 
2364e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2365e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2366e6ccafaeSMatthew G Knepley         }
2367e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2368e6ccafaeSMatthew G Knepley       }
2369e6ccafaeSMatthew G Knepley       if (d == dof) {
2370e6ccafaeSMatthew G Knepley         numFaces               = 1;
2371e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2372e6ccafaeSMatthew G Knepley       }
2373e6ccafaeSMatthew G Knepley     }
2374e6ccafaeSMatthew G Knepley   }
2375e6ccafaeSMatthew G Knepley #endif
2376e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2377e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2378e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2379766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2380e6ccafaeSMatthew G Knepley   } else {
2381e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2382e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2383e6ccafaeSMatthew G Knepley 
2384e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2385e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2386e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2387e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2388e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2389e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2390e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2391e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2392e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2393e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2394e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2395e6ccafaeSMatthew G Knepley           break;
2396e6ccafaeSMatthew G Knepley         }
2397e6ccafaeSMatthew G Knepley       }
2398e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2399e6ccafaeSMatthew G Knepley     }
2400e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2401e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2402e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2403e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2404e6ccafaeSMatthew G Knepley   }
2405ef07cca7SMatthew G. Knepley #if 0
2406e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2407ef07cca7SMatthew G. Knepley #else
2408ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2409ef07cca7SMatthew G. Knepley #endif
2410e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2411e6ccafaeSMatthew G Knepley }
2412e6ccafaeSMatthew G Knepley 
2413e6ccafaeSMatthew G Knepley #undef __FUNCT__
2414e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
241553156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2416e6ccafaeSMatthew G Knepley {
241782f516ccSBarry Smith   MPI_Comm        comm;
241853156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2419efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2420efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2421efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2422fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2423efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2424e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2425e6ccafaeSMatthew G Knepley 
2426e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
242782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2428efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2429efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2430efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2431efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
243253156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2433efa14ee0SMatthew G Knepley   /* Setup chart */
2434efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2435efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2436efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2437efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2438e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2439e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2440efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2441e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2442efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2443efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2444efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2445efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2446e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2447e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2448e6ccafaeSMatthew G Knepley   }
2449e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2450e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2451e6ccafaeSMatthew G Knepley   }
2452e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2453e6ccafaeSMatthew G Knepley   /* Create face cones */
2454efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
24550298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2456efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2457e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2458e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2459efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
24600298fd71SBarry Smith     PetscInt      *closure = NULL;
2461efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2462e6ccafaeSMatthew G Knepley 
2463e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2464efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2465efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2466e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2467e6ccafaeSMatthew G Knepley 
2468efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2469efa14ee0SMatthew G Knepley         ++numCorners;
2470efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2471efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2472efa14ee0SMatthew G Knepley           closure[faceSize] = point;
247365560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2474e6ccafaeSMatthew G Knepley           ++faceSize;
2475e6ccafaeSMatthew G Knepley         }
2476e6ccafaeSMatthew G Knepley       }
2477e6ccafaeSMatthew G Knepley     }
2478efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2479efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2480cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2481e6ccafaeSMatthew G Knepley     }
248265560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2483e6ccafaeSMatthew G Knepley   }
2484efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2485e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2486e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2487e6ccafaeSMatthew G Knepley   /* Build coordinates */
2488efa14ee0SMatthew G Knepley   {
2489efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2490efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2491efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2492285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2493efa14ee0SMatthew G Knepley 
249469d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2495e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
249669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2497285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2498285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2499285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2500efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2501efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2502efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2503efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2504efa14ee0SMatthew G Knepley       PetscInt       dof;
2505efa14ee0SMatthew G Knepley 
2506efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2507efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2508285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2509e6ccafaeSMatthew G Knepley     }
2510e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2511e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2512e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2513e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
25142eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2515830e53efSMatthew G. Knepley     if (coordSize) {
2516e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2517e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2518efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2519efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2520efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2521efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2522e6ccafaeSMatthew G Knepley 
2523e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2524e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2525efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2526efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2527efa14ee0SMatthew 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);
2528e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2529e6ccafaeSMatthew G Knepley       }
2530e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2531e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
25323b399e24SMatthew G. Knepley     }
2533e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2534e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2535e6ccafaeSMatthew G Knepley   }
2536efa14ee0SMatthew G Knepley   /* Cleanup */
2537efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2538efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2539efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2540efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2541e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2542e6ccafaeSMatthew G Knepley }
2543e6ccafaeSMatthew G Knepley 
2544e6ccafaeSMatthew G Knepley #undef __FUNCT__
2545e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
254653156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2547e6ccafaeSMatthew G Knepley {
254882f516ccSBarry Smith   MPI_Comm         comm;
254953156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2550efa14ee0SMatthew G Knepley   IS              *subpointIS;
2551efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
255201a2673eSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *coneONew;
2553efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2554e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2555e6ccafaeSMatthew G Knepley 
2556e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
255782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2558efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2559e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2560efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2561efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
256253156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);}
2563efa14ee0SMatthew G Knepley   /* Setup chart */
2564efa14ee0SMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2565dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2566e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2567e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2568e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2569e6ccafaeSMatthew G Knepley   }
2570e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2571e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2572e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2573e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2574e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2575e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2576e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2577e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2578e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
25790ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2580e6ccafaeSMatthew G Knepley   }
2581e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2582e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2583e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2584e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2585e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2586e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2587e6ccafaeSMatthew G Knepley 
2588e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2589e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2590e6ccafaeSMatthew G Knepley       if (d == dim) {
2591e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2592e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2593e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2594e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2595e6ccafaeSMatthew G Knepley         }
2596e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2597e6ccafaeSMatthew G Knepley       }
2598e6ccafaeSMatthew G Knepley     }
2599e6ccafaeSMatthew G Knepley   }
2600e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2601e6ccafaeSMatthew G Knepley   /* Set cones */
26020298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2603dcca6d9dSJed Brown   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr);
2604e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2605e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2606e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2607e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
26080e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2609e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2610e6ccafaeSMatthew G Knepley 
2611e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2612e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2613e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
26140e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2615e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2616e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
261701a2673eSMatthew G. Knepley         if (subc >= 0) {
261801a2673eSMatthew G. Knepley           coneNew[coneSizeNew]  = firstSubPoint[d-1] + subc;
261901a2673eSMatthew G. Knepley           coneONew[coneSizeNew] = ornt[c];
262001a2673eSMatthew G. Knepley           ++coneSizeNew;
262101a2673eSMatthew G. Knepley         }
2622e6ccafaeSMatthew G Knepley       }
2623e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2624e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
262501a2673eSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr);
2626e6ccafaeSMatthew G Knepley     }
2627e6ccafaeSMatthew G Knepley   }
262801a2673eSMatthew G. Knepley   ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr);
2629e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2630e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2631e6ccafaeSMatthew G Knepley   /* Build coordinates */
2632e6ccafaeSMatthew G Knepley   {
2633e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2634e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2635e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2636285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2637e6ccafaeSMatthew G Knepley 
263869d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2639e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
264069d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2641285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2642285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2643285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2644e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2645e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2646e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2647e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2648e6ccafaeSMatthew G Knepley       PetscInt       dof;
2649e6ccafaeSMatthew G Knepley 
2650e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2651e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2652285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2653e6ccafaeSMatthew G Knepley     }
2654e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2655e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2656e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2657e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
26582eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2659e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2660e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2661e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2662e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2663e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2664e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2665e6ccafaeSMatthew G Knepley 
2666e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2667e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2668e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2669e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2670e6ccafaeSMatthew 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);
2671efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2672e6ccafaeSMatthew G Knepley     }
2673e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2674e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2675e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2676e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2677e6ccafaeSMatthew G Knepley   }
2678efa14ee0SMatthew G Knepley   /* Cleanup */
2679e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
26800ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2681e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2682e6ccafaeSMatthew G Knepley   }
2683efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2684e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2685e6ccafaeSMatthew G Knepley }
2686e6ccafaeSMatthew G Knepley 
2687e6ccafaeSMatthew G Knepley #undef __FUNCT__
2688e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2689d0fa310fSMatthew G. Knepley /*@
2690e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2691e6ccafaeSMatthew G Knepley 
2692e6ccafaeSMatthew G Knepley   Input Parameters:
2693e6ccafaeSMatthew G Knepley + dm           - The original mesh
2694830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2695830e53efSMatthew G. Knepley - value        - The label value to use
2696e6ccafaeSMatthew G Knepley 
2697e6ccafaeSMatthew G Knepley   Output Parameter:
2698e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2699e6ccafaeSMatthew G Knepley 
2700e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2701e6ccafaeSMatthew G Knepley 
2702e6ccafaeSMatthew G Knepley   Level: developer
2703e6ccafaeSMatthew G Knepley 
2704e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2705830e53efSMatthew G. Knepley @*/
270653156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2707e6ccafaeSMatthew G Knepley {
2708e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2709e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2710e6ccafaeSMatthew G Knepley 
2711e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2712e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2713766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2714e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2715e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
271682f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2717e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2718e6ccafaeSMatthew G Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2719e6ccafaeSMatthew G Knepley   if (depth == dim) {
2720830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2721e6ccafaeSMatthew G Knepley   } else {
2722830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2723e6ccafaeSMatthew G Knepley   }
2724e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2725e6ccafaeSMatthew G Knepley }
2726e6ccafaeSMatthew G Knepley 
2727e6ccafaeSMatthew G Knepley #undef __FUNCT__
2728aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
2729aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
2730aca35d17SMatthew G. Knepley {
2731aca35d17SMatthew G. Knepley   PetscInt       subPoint;
2732aca35d17SMatthew G. Knepley   PetscErrorCode ierr;
2733aca35d17SMatthew G. Knepley 
2734aca35d17SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
2735aca35d17SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
2736aca35d17SMatthew G. Knepley }
2737aca35d17SMatthew G. Knepley 
2738aca35d17SMatthew G. Knepley #undef __FUNCT__
2739766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
274027c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2741766ab985SMatthew G. Knepley {
2742766ab985SMatthew G. Knepley   MPI_Comm        comm;
2743766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2744766ab985SMatthew G. Knepley   IS              subvertexIS;
2745766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2746fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
2747766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
274887feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
2749766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2750766ab985SMatthew G. Knepley 
2751766ab985SMatthew G. Knepley   PetscFunctionBegin;
2752766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
2753766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2754766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2755766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2756766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
275727c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
2758766ab985SMatthew G. Knepley   /* Setup chart */
2759766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2760766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2761766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2762766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2763766ab985SMatthew G. Knepley   /* Set cone sizes */
2764766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
2765766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
2766766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
2767766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2768766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2769766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2770766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2771766ab985SMatthew G. Knepley   }
2772766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2773766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2774766ab985SMatthew G. Knepley   }
2775766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2776766ab985SMatthew G. Knepley   /* Create face cones */
2777766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
277887feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2779766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2780766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2781766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
2782766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
278387feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
278487feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
2785766ab985SMatthew G. Knepley 
278687feddfdSMatthew G. Knepley     if (cell < cMax) continue;
278787feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
278887feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
278987feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
279087feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
279187feddfdSMatthew G. Knepley     }
279287feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
279387feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
279487feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
279527234c99SMatthew G. Knepley     /* Not true in parallel
279627234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
279787feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
279887feddfdSMatthew G. Knepley       PetscInt negsubcell;
2799766ab985SMatthew G. Knepley 
280087feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
280187feddfdSMatthew G. Knepley       /* I know this is a crap search */
280287feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
280387feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
2804766ab985SMatthew G. Knepley       }
280587feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
280687feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
2807766ab985SMatthew G. Knepley     }
280887feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
280987feddfdSMatthew G. Knepley     ++newFacePoint;
2810766ab985SMatthew G. Knepley   }
2811766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2812766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2813766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2814766ab985SMatthew G. Knepley   /* Build coordinates */
2815766ab985SMatthew G. Knepley   {
2816766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2817766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2818766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2819285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2820766ab985SMatthew G. Knepley 
282169d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2822766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
282369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2824285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2825285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2826285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2827766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2828766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2829766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2830766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2831766ab985SMatthew G. Knepley       PetscInt       dof;
2832766ab985SMatthew G. Knepley 
2833766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2834766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2835285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2836766ab985SMatthew G. Knepley     }
2837766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2838766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2839766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2840766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
28412eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2842766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2843766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2844766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2845766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2846766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2847766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
2848766ab985SMatthew G. Knepley 
2849766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2850766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2851766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2852766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2853766ab985SMatthew 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);
2854766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2855766ab985SMatthew G. Knepley     }
2856766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2857766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2858766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2859766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2860766ab985SMatthew G. Knepley   }
2861aca35d17SMatthew G. Knepley   /* Build SF */
2862aca35d17SMatthew G. Knepley   CHKMEMQ;
2863aca35d17SMatthew G. Knepley   {
2864aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
2865aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
2866bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
2867aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
2868bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
286949c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
2870bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
2871aca35d17SMatthew G. Knepley 
2872bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
2873aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
2874aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
2875aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2876aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
2877aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
2878aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
2879aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
2880dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
2881bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
2882bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
2883bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
2884bdcf2095SMatthew G. Knepley       }
28859e0823b2SMatthew G. Knepley       /* Set subleaves */
2886aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2887aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2888bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2889aca35d17SMatthew G. Knepley 
2890aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
2891bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
2892bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
2893bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
2894bdcf2095SMatthew G. Knepley         ++numSubLeaves;
2895aca35d17SMatthew G. Knepley       }
28969e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
28979e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
28989e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
28999e0823b2SMatthew G. Knepley 
29009e0823b2SMatthew G. Knepley         if (subPoint < 0) {
29019e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
29029e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
29039e0823b2SMatthew G. Knepley         } else {
29049e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
29059e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
29069e0823b2SMatthew G. Knepley         }
2907bdcf2095SMatthew G. Knepley       }
2908bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2909bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2910bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2911bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2912785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
2913785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
291449c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
2915bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2916bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2917aca35d17SMatthew G. Knepley 
2918aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
291949c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
2920aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
2921bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
2922bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
2923bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
2924bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
2925aca35d17SMatthew G. Knepley         ++sl;
2926aca35d17SMatthew G. Knepley       }
2927bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
292849c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
292949c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
2930aca35d17SMatthew G. Knepley     }
2931aca35d17SMatthew G. Knepley   }
2932aca35d17SMatthew G. Knepley   CHKMEMQ;
2933766ab985SMatthew G. Knepley   /* Cleanup */
2934766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2935766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2936766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
2937766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2938766ab985SMatthew G. Knepley }
2939766ab985SMatthew G. Knepley 
2940766ab985SMatthew G. Knepley #undef __FUNCT__
2941766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
2942b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm)
2943766ab985SMatthew G. Knepley {
2944766ab985SMatthew G. Knepley   MPI_Comm         comm;
2945766ab985SMatthew G. Knepley   DMLabel          subpointMap;
2946766ab985SMatthew G. Knepley   IS              *subpointIS;
2947766ab985SMatthew G. Knepley   const PetscInt **subpoints;
2948b1a8e46aSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
2949766ab985SMatthew G. Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2950766ab985SMatthew G. Knepley   PetscErrorCode   ierr;
2951766ab985SMatthew G. Knepley 
2952766ab985SMatthew G. Knepley   PetscFunctionBegin;
2953766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2954766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2955766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2956766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2957766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
2958b3154360SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);
2959766ab985SMatthew G. Knepley   /* Setup chart */
2960766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
2961dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2962766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2963766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2964766ab985SMatthew G. Knepley     totSubPoints += numSubPoints[d];
2965766ab985SMatthew G. Knepley   }
2966766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2967766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2968766ab985SMatthew G. Knepley   /* Set cone sizes */
2969766ab985SMatthew G. Knepley   firstSubPoint[dim] = 0;
2970766ab985SMatthew G. Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2971766ab985SMatthew G. Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2972766ab985SMatthew G. Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2973766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2974766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
2975b643afeaSMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2976766ab985SMatthew G. Knepley   }
2977766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2978766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2979766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
2980766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2981766ab985SMatthew G. Knepley       const PetscInt *cone;
2982766ab985SMatthew G. Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2983766ab985SMatthew G. Knepley 
2984766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2985766ab985SMatthew G. Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2986766ab985SMatthew G. Knepley       if (d == dim) {
2987766ab985SMatthew G. Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2988766ab985SMatthew G. Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2989766ab985SMatthew G. Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2990766ab985SMatthew G. Knepley           if (val >= 0) coneSizeNew++;
2991766ab985SMatthew G. Knepley         }
2992766ab985SMatthew G. Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2993766ab985SMatthew G. Knepley       }
2994766ab985SMatthew G. Knepley     }
2995766ab985SMatthew G. Knepley   }
2996766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2997766ab985SMatthew G. Knepley   /* Set cones */
2998766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2999dcca6d9dSJed Brown   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
3000766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3001766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
3002766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
3003766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
3004b1a8e46aSMatthew G. Knepley       const PetscInt *cone, *ornt;
3005766ab985SMatthew G. Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
3006766ab985SMatthew G. Knepley 
3007766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
3008766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
3009766ab985SMatthew G. Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
3010b1a8e46aSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
3011766ab985SMatthew G. Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
3012766ab985SMatthew G. Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
3013b1a8e46aSMatthew G. Knepley         if (subc >= 0) {
3014b1a8e46aSMatthew G. Knepley           coneNew[coneSizeNew]   = firstSubPoint[d-1] + subc;
3015b1a8e46aSMatthew G. Knepley           orntNew[coneSizeNew++] = ornt[c];
3016b1a8e46aSMatthew G. Knepley         }
3017766ab985SMatthew G. Knepley       }
3018766ab985SMatthew G. Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
3019766ab985SMatthew G. Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
3020b1a8e46aSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
3021766ab985SMatthew G. Knepley     }
3022766ab985SMatthew G. Knepley   }
3023b1a8e46aSMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
3024766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
3025766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
3026766ab985SMatthew G. Knepley   /* Build coordinates */
3027766ab985SMatthew G. Knepley   {
3028766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
3029766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
3030766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
3031285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
3032766ab985SMatthew G. Knepley 
303369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3034766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
303569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
3036285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
3037285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
3038285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
3039766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
3040766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
3041766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
3042766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
3043766ab985SMatthew G. Knepley       PetscInt       dof;
3044766ab985SMatthew G. Knepley 
3045766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3046766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
3047285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
3048766ab985SMatthew G. Knepley     }
3049766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
3050766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
3051766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
3052766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
30532eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
3054766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
3055766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3056766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
3057766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
3058766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
3059766ab985SMatthew G. Knepley       PetscInt dof, off, sdof, soff, d;
3060766ab985SMatthew G. Knepley 
3061766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3062766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
3063766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
3064766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
3065766ab985SMatthew 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);
3066766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
3067766ab985SMatthew G. Knepley     }
3068766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
3069766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3070766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
3071766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
3072766ab985SMatthew G. Knepley   }
3073c80a7578SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
3074c80a7578SMatthew G. Knepley   {
3075c80a7578SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
3076251556f3SMatthew G. Knepley     IS                 subpIS;
3077c80a7578SMatthew G. Knepley     const PetscSFNode *remotePoints;
3078c80a7578SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
3079c80a7578SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
3080c80a7578SMatthew G. Knepley     PetscInt          *slocalPoints;
3081f033dbf2SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
3082c80a7578SMatthew G. Knepley     PetscMPIInt        rank;
3083c80a7578SMatthew G. Knepley 
3084c80a7578SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
3085c80a7578SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
3086c80a7578SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
3087c80a7578SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3088c80a7578SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
3089251556f3SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
3090251556f3SMatthew G. Knepley     if (subpIS) {
3091251556f3SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
3092251556f3SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
3093f033dbf2SMatthew G. Knepley     }
3094c80a7578SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3095c80a7578SMatthew G. Knepley     if (numRoots >= 0) {
309682db75e7SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
3097c80a7578SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
3098c80a7578SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
3099c80a7578SMatthew G. Knepley         newLocalPoints[p].index = -2;
3100c80a7578SMatthew G. Knepley       }
3101c80a7578SMatthew G. Knepley       /* Set subleaves */
3102c80a7578SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
3103c80a7578SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3104c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
3105c80a7578SMatthew G. Knepley 
3106c80a7578SMatthew G. Knepley         if (subpoint < 0) continue;
3107c80a7578SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
3108c80a7578SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
3109c80a7578SMatthew G. Knepley         ++numSubleaves;
3110c80a7578SMatthew G. Knepley       }
3111c80a7578SMatthew G. Knepley       /* Must put in owned subpoints */
3112c80a7578SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
3113c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
3114c80a7578SMatthew G. Knepley 
3115c80a7578SMatthew G. Knepley         if (subpoint < 0) {
3116c80a7578SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
3117c80a7578SMatthew G. Knepley           newOwners[p-pStart].index = -3;
3118c80a7578SMatthew G. Knepley         } else {
3119c80a7578SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
3120c80a7578SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
3121c80a7578SMatthew G. Knepley         }
3122c80a7578SMatthew G. Knepley       }
3123c80a7578SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3124c80a7578SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3125c80a7578SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3126c80a7578SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3127c80a7578SMatthew G. Knepley       ierr = PetscMalloc(numSubleaves * sizeof(PetscInt),    &slocalPoints);CHKERRQ(ierr);
3128c80a7578SMatthew G. Knepley       ierr = PetscMalloc(numSubleaves * sizeof(PetscSFNode), &sremotePoints);CHKERRQ(ierr);
3129c80a7578SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3130c80a7578SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3131c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
3132c80a7578SMatthew G. Knepley 
3133c80a7578SMatthew G. Knepley         if (subpoint < 0) continue;
3134c80a7578SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3135c80a7578SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
3136c80a7578SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3137c80a7578SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3138c80a7578SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3139c80a7578SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3140c80a7578SMatthew G. Knepley         ++sl;
3141c80a7578SMatthew G. Knepley       }
3142c80a7578SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
3143c80a7578SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
3144c80a7578SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3145c80a7578SMatthew G. Knepley     }
3146251556f3SMatthew G. Knepley     if (subpIS) {
3147251556f3SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
3148251556f3SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
3149251556f3SMatthew G. Knepley     }
3150c80a7578SMatthew G. Knepley   }
3151766ab985SMatthew G. Knepley   /* Cleanup */
3152766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3153b643afeaSMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
3154766ab985SMatthew G. Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
3155766ab985SMatthew G. Knepley   }
3156766ab985SMatthew G. Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
3157766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3158766ab985SMatthew G. Knepley }
3159766ab985SMatthew G. Knepley 
3160766ab985SMatthew G. Knepley #undef __FUNCT__
3161766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
3162766ab985SMatthew G. Knepley /*
316327c04023SMatthew G. Knepley   DMPlexCreateCohesiveSubmesh - Extract from a mesh with cohesive cells the hypersurface defined by one face of the cells. Optionally, a Label an be given to restrict the cells.
3164766ab985SMatthew G. Knepley 
3165766ab985SMatthew G. Knepley   Input Parameters:
3166766ab985SMatthew G. Knepley + dm          - The original mesh
316727c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
31687afc1a8bSJed Brown . label       - A label name, or NULL
316927c04023SMatthew G. Knepley - value  - A label value
3170766ab985SMatthew G. Knepley 
3171766ab985SMatthew G. Knepley   Output Parameter:
3172766ab985SMatthew G. Knepley . subdm - The surface mesh
3173766ab985SMatthew G. Knepley 
3174766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3175766ab985SMatthew G. Knepley 
3176766ab985SMatthew G. Knepley   Level: developer
3177766ab985SMatthew G. Knepley 
3178766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3179766ab985SMatthew G. Knepley */
318027c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3181766ab985SMatthew G. Knepley {
3182766ab985SMatthew G. Knepley   PetscInt       dim, depth;
3183766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3184766ab985SMatthew G. Knepley 
3185766ab985SMatthew G. Knepley   PetscFunctionBegin;
3186766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
318727c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3188766ab985SMatthew G. Knepley   ierr = DMPlexGetDimension(dm, &dim);CHKERRQ(ierr);
3189766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3190766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3191766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3192766ab985SMatthew G. Knepley   ierr = DMPlexSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3193766ab985SMatthew G. Knepley   if (depth == dim) {
3194b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3195766ab985SMatthew G. Knepley   } else {
319627c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3197e6ccafaeSMatthew G Knepley   }
3198e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3199e6ccafaeSMatthew G Knepley }
3200e6ccafaeSMatthew G Knepley 
3201e6ccafaeSMatthew G Knepley #undef __FUNCT__
3202e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
320364beef6dSMatthew G. Knepley /*@
320464beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
320564beef6dSMatthew G. Knepley 
320664beef6dSMatthew G. Knepley   Input Parameter:
320764beef6dSMatthew G. Knepley . dm - The submesh DM
320864beef6dSMatthew G. Knepley 
320964beef6dSMatthew G. Knepley   Output Parameter:
321064beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
321164beef6dSMatthew G. Knepley 
321264beef6dSMatthew G. Knepley   Level: developer
321364beef6dSMatthew G. Knepley 
321464beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
321564beef6dSMatthew G. Knepley @*/
3216e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3217e6ccafaeSMatthew G Knepley {
3218e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
3219e6ccafaeSMatthew G Knepley 
3220e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3221e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3222e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
3223e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
3224e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3225e6ccafaeSMatthew G Knepley }
3226e6ccafaeSMatthew G Knepley 
3227e6ccafaeSMatthew G Knepley #undef __FUNCT__
3228e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
3229e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
3230e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3231e6ccafaeSMatthew G Knepley {
3232e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3233285d324eSMatthew G. Knepley   DMLabel        tmp;
3234e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3235e6ccafaeSMatthew G Knepley 
3236e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3237e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3238285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3239e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3240285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3241285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3242e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3243e6ccafaeSMatthew G Knepley }
3244e6ccafaeSMatthew G Knepley 
3245e6ccafaeSMatthew G Knepley #undef __FUNCT__
3246e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
324764beef6dSMatthew G. Knepley /*@
3248e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3249e6ccafaeSMatthew G Knepley 
3250e6ccafaeSMatthew G Knepley   Input Parameter:
3251e6ccafaeSMatthew G Knepley . dm - The submesh DM
3252e6ccafaeSMatthew G Knepley 
3253e6ccafaeSMatthew G Knepley   Output Parameter:
32540298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3255e6ccafaeSMatthew G Knepley 
3256e6ccafaeSMatthew G Knepley   Note: This is IS is guaranteed to be sorted by the construction of the submesh
325764beef6dSMatthew G. Knepley 
325864beef6dSMatthew G. Knepley   Level: developer
325964beef6dSMatthew G. Knepley 
326064beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
326164beef6dSMatthew G. Knepley @*/
3262e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3263e6ccafaeSMatthew G Knepley {
326482f516ccSBarry Smith   MPI_Comm        comm;
3265e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3266e6ccafaeSMatthew G Knepley   IS              is;
3267e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3268e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3269e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3270e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3271e6ccafaeSMatthew G Knepley 
3272e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3273e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3274e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
327582f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
32760298fd71SBarry Smith   *subpointIS = NULL;
3277e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3278e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3279fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3280e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3281e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3282e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3283e6ccafaeSMatthew G Knepley     depths[0] = depth;
3284e6ccafaeSMatthew G Knepley     depths[1] = 0;
3285e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3286785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3287e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3288e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3289e6ccafaeSMatthew G Knepley 
3290e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3291e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
32921e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3293e6ccafaeSMatthew 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);
3294e6ccafaeSMatthew G Knepley       } else {
32951e21b6fdSMatthew G Knepley         if (!n) {
32961e21b6fdSMatthew G Knepley           if (d == 0) {
32971e21b6fdSMatthew G Knepley             /* Missing cells */
32981e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
32991e21b6fdSMatthew G Knepley           } else {
33001e21b6fdSMatthew G Knepley             /* Missing faces */
33011e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
33021e21b6fdSMatthew G Knepley           }
33031e21b6fdSMatthew G Knepley         }
3304e6ccafaeSMatthew G Knepley       }
3305e6ccafaeSMatthew G Knepley       if (n) {
3306e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3307e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3308e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3309e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3310e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3311e6ccafaeSMatthew G Knepley       }
3312e6ccafaeSMatthew G Knepley     }
3313e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3314e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3315fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3316e6ccafaeSMatthew G Knepley   }
3317e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3318e6ccafaeSMatthew G Knepley }
3319