xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision 09b7985c7a6e8aa19eec0591f6cd1273cce5eac5)
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;
265c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(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);
28446e270d4SMatthew G. Knepley   ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, 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;
4794a6cfa73SMatthew G. Knepley   PetscInt        depth = 0, Ng, 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);
4884a6cfa73SMatthew G. Knepley   Ng   = 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     }
5004a6cfa73SMatthew G. Knepley     Ng += 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);
5064a6cfa73SMatthew G. Knepley   if (depth >= 0) depthShift[depth] = Ng;
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);
5105acea1aeSMatthew G. Knepley   ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
5114a6cfa73SMatthew G. Knepley   for (c = cEnd; c < cEnd + Ng; ++c) {
512cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
513cd0c2139SMatthew G Knepley   }
514cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
515cd0c2139SMatthew G Knepley     IS              faceIS;
516cd0c2139SMatthew G Knepley     const PetscInt *faces;
517cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
518cd0c2139SMatthew G Knepley 
519cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
520cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
521cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
522cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
523cd0c2139SMatthew G Knepley       PetscInt size;
524cd0c2139SMatthew G Knepley 
52546c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
526cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
527cd0c2139SMatthew 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);
5284a6cfa73SMatthew G. Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr);
529cd0c2139SMatthew G Knepley     }
530cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
531cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
532cd0c2139SMatthew G Knepley   }
533cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
534cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
535cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
536cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
537cd0c2139SMatthew G Knepley   ghostCell = cEnd;
538cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
539cd0c2139SMatthew G Knepley     IS              faceIS;
540cd0c2139SMatthew G Knepley     const PetscInt *faces;
541cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
542cd0c2139SMatthew G Knepley 
543cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
544cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
545cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
54646c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
5474a6cfa73SMatthew G. Knepley       PetscInt newFace = faces[f] + Ng;
548cd0c2139SMatthew G Knepley 
54946c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
550cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
551cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
55246c796b9SMatthew G. Knepley       ++ghostCell;
553cd0c2139SMatthew G Knepley     }
554cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
555cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
556cd0c2139SMatthew G Knepley   }
557cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
558cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
559cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
560cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
561cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
562cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
563cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
564cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
5654a6cfa73SMatthew G. Knepley   if (numGhostCells) *numGhostCells = Ng;
566cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
567cd0c2139SMatthew G Knepley }
568cd0c2139SMatthew G Knepley 
569cd0c2139SMatthew G Knepley #undef __FUNCT__
570cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
571cd0c2139SMatthew G Knepley /*@C
572cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
573cd0c2139SMatthew G Knepley 
574cd0c2139SMatthew G Knepley   Collective on dm
575cd0c2139SMatthew G Knepley 
576cd0c2139SMatthew G Knepley   Input Parameters:
577cd0c2139SMatthew G Knepley + dm - The original DM
578cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
579cd0c2139SMatthew G Knepley 
580cd0c2139SMatthew G Knepley   Output Parameters:
581cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
582cd0c2139SMatthew G Knepley - dmGhosted - The new DM
583cd0c2139SMatthew G Knepley 
584cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
585cd0c2139SMatthew G Knepley 
586cd0c2139SMatthew G Knepley   Level: developer
587cd0c2139SMatthew G Knepley 
588cd0c2139SMatthew G Knepley .seealso: DMCreate()
58931266bc0SMatthew G. Knepley @*/
590cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
591cd0c2139SMatthew G Knepley {
592cd0c2139SMatthew G Knepley   DM             gdm;
593cd0c2139SMatthew G Knepley   DMLabel        label;
594cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
595cd0c2139SMatthew G Knepley   PetscInt       dim;
596a42b08eeSMatthew G. Knepley   PetscBool      flag;
597cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
598cd0c2139SMatthew G Knepley 
599cd0c2139SMatthew G Knepley   PetscFunctionBegin;
600cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
6014a6cfa73SMatthew G. Knepley   if (numGhostCells) PetscValidPointer(numGhostCells, 3);
602cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
603cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
604cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
605c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
606c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr);
607a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
608a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
609a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
610a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
611cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
612cd0c2139SMatthew G Knepley   if (!label) {
613cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
614cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
615cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
616cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
617cd0c2139SMatthew G Knepley   }
618cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
6198e136ac0SMatthew G. Knepley   ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr);
620cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
621cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
622cd0c2139SMatthew G Knepley }
623cd0c2139SMatthew G Knepley 
624cd0c2139SMatthew G Knepley #undef __FUNCT__
625cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
626607ab7a9SMatthew G. Knepley /*
627faedd622SMatthew G. Knepley   We are adding three kinds of points here:
628607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
629faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
630607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
631a6ae58d1SMatthew G. Knepley 
632a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
633a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
634607ab7a9SMatthew G. Knepley */
635cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
636cd0c2139SMatthew G Knepley {
637cd0c2139SMatthew G Knepley   MPI_Comm         comm;
638607ab7a9SMatthew G. Knepley   IS               valueIS;
639607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
640607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
64118c5995bSMatthew G. Knepley   IS              *splitIS;
64218c5995bSMatthew G. Knepley   IS              *unsplitIS;
643607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
64418c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
64536dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
64636dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
647607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
64818c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
649cd0c2139SMatthew G Knepley   PetscSection     coordSection;
650cd0c2139SMatthew G Knepley   Vec              coordinates;
651cd0c2139SMatthew G Knepley   PetscScalar     *coords;
652607ab7a9SMatthew G. Knepley   PetscInt         depths[4];          /* Depths in the order that plex points are numbered */
653a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
654a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
655607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
656607ab7a9SMatthew G. Knepley   PetscInt        *depthOffset;        /* Prefix sums of depthShift */
657607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
658607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
65918c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
660cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
661cd0c2139SMatthew G Knepley 
662cd0c2139SMatthew G Knepley   PetscFunctionBegin;
663cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
664c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
665607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
666fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
667607ab7a9SMatthew G. Knepley   depths[0] = depth;
668607ab7a9SMatthew G. Knepley   depths[1] = 0;
669607ab7a9SMatthew G. Knepley   depths[2] = depth-1;
670607ab7a9SMatthew G. Knepley   depths[3] = 1;
671cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
672607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
6732203a8e9SMatthew G. Knepley   ierr = PetscMalloc6(depth+1,&depthMax,depth+1,&depthEnd,depth+1,&depthShift,depth+1,&depthOffset,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
674dcca6d9dSJed 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);
675607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthShift,  (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
676607ab7a9SMatthew G. Knepley   ierr = PetscMemzero(depthOffset, (depth+1) * sizeof(PetscInt));CHKERRQ(ierr);
677a6ae58d1SMatthew 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);
678607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
679607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
680a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
681a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
682607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
68318c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
684607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
685a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
686607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
68718c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
68818c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
68918c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
690607ab7a9SMatthew G. Knepley   }
691cd0c2139SMatthew G Knepley   if (label) {
692cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
693cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
694cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
695cd0c2139SMatthew G Knepley   }
696cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
697cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
698cd0c2139SMatthew G Knepley 
699cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
70018c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
70118c5995bSMatthew G. Knepley     if (splitIS[dep]) {
70218c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
70318c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
70418c5995bSMatthew G. Knepley     }
70518c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
70618c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
70718c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
70818c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
709cd0c2139SMatthew G Knepley     }
710cd0c2139SMatthew G Knepley   }
711607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
71218c5995bSMatthew 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   */
713607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) depthShift[d]          = numSplitPoints[d] + numHybridPoints[d];
714607ab7a9SMatthew G. Knepley   for (d = 1; d <= depth; ++d) depthOffset[depths[d]] = depthOffset[depths[d-1]] + depthShift[depths[d-1]];
715a6ae58d1SMatthew G. Knepley   for (d = 0; d <= depth; ++d) pMaxNew[d]            += depthOffset[d] - numHybridPointsOld[d];
716cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
717cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
718cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
719cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
720cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
721a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
7224c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
723cd0c2139SMatthew G Knepley       const PetscInt *support;
7244c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
725cd0c2139SMatthew G Knepley 
726cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
727cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
728cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
729cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
730cd0c2139SMatthew G Knepley       if (dep == depth-1) {
7314c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
7324c367dbcSMatthew G. Knepley 
733cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
7344c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
735cd0c2139SMatthew G Knepley       } else if (dep == 0) {
7364c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
737cd0c2139SMatthew G Knepley 
738cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
7394c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
740cd0c2139SMatthew G Knepley           PetscInt val;
741cd0c2139SMatthew G Knepley 
742cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
7434c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
7444c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
7454c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
746cd0c2139SMatthew G Knepley         }
7474c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
7484c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
7494c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
7504c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
7514c367dbcSMatthew G. Knepley         /* Add hybrid edge */
7524c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
7534c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
754cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
7554c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
7564c367dbcSMatthew G. Knepley 
757cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
7584c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
759cd0c2139SMatthew G Knepley           PetscInt val;
760cd0c2139SMatthew G Knepley 
761cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
7624c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
7634c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
7644c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
765cd0c2139SMatthew G Knepley         }
7664c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
7674c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
7684c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
7694c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
7704c367dbcSMatthew G. Knepley         /* Add hybrid face */
7714c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
7724c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
773cd0c2139SMatthew G Knepley       }
774cd0c2139SMatthew G Knepley     }
775cd0c2139SMatthew G Knepley   }
77618c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
77718c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
77818c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
779a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
78018c5995bSMatthew G. Knepley       const PetscInt *support;
781da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
78218c5995bSMatthew G. Knepley 
78318c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
78418c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
78539254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
78618c5995bSMatthew G. Knepley       if (dep == 0) {
78718c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
78818c5995bSMatthew G. Knepley 
78939254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
79039254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
79139254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
79239254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
79339254ff6SMatthew G. Knepley         }
79439254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
79518c5995bSMatthew G. Knepley         /* Add hybrid edge */
79618c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
797e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
798e1757548SMatthew G. Knepley           PetscInt val;
799e1757548SMatthew G. Knepley 
800e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
801e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
802da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
803da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
804e1757548SMatthew G. Knepley         }
805e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
80618c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
80718c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
808cd0c2139SMatthew G Knepley         PetscInt       val;
809cd0c2139SMatthew G Knepley 
810da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
811cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
812da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
813da1dd7e4SMatthew G. Knepley           else              ++qf;
814cd0c2139SMatthew G Knepley         }
81518c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
816da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
81718c5995bSMatthew G. Knepley         /* Add hybrid face */
818da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
819da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
820da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
821da1dd7e4SMatthew G. Knepley         }
82218c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
823da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
824cd0c2139SMatthew G Knepley       }
825cd0c2139SMatthew G Knepley     }
826cd0c2139SMatthew G Knepley   }
827cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
828cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
829cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
830dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
831dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
832cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
833cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
834cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
835cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
836a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
8374c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
838cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
8394c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
840cd0c2139SMatthew G Knepley 
841cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
842cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
843cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
844cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
845cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
846cd0c2139SMatthew G Knepley       if (dep == depth-1) {
84796a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
8484c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
849cd0c2139SMatthew G Knepley         const PetscInt *supportF;
850cd0c2139SMatthew G Knepley 
851cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
852cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
853cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
854cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
855cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
856cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
8574c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
85818c5995bSMatthew G. Knepley           if (v < 0) {
85918c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
86018c5995bSMatthew 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);
861a6ae58d1SMatthew G. Knepley             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/;
86296a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
86318c5995bSMatthew G. Knepley           } else {
8644c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
865163235baSMatthew G. Knepley             if (dep > 1) {
866163235baSMatthew G. Knepley               const PetscInt *econe;
867163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
868163235baSMatthew G. Knepley 
869163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
870163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
871163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
872163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
873163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
874163235baSMatthew G. Knepley                 if (vs >= 0) continue;
875163235baSMatthew 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);
876163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
877163235baSMatthew G. Knepley               }
878163235baSMatthew G. Knepley             }
879cd0c2139SMatthew G Knepley           }
880cd0c2139SMatthew G Knepley         }
881cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
882cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
883e537020bSMatthew G. Knepley         /* Face support */
884cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
885cd0c2139SMatthew G Knepley           PetscInt val;
886cd0c2139SMatthew G Knepley 
887cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
888cd0c2139SMatthew G Knepley           if (val < 0) {
889cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
8904c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
891cd0c2139SMatthew G Knepley           } else {
892cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
8934c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
894e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
895e537020bSMatthew G. Knepley             {
896e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
897e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
898e537020bSMatthew G. Knepley 
899e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
900e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
901e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
902e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
903e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
904e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
905e537020bSMatthew G. Knepley                   break;
906cd0c2139SMatthew G Knepley                 }
907cd0c2139SMatthew G Knepley               }
908e537020bSMatthew 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]);
909e537020bSMatthew G. Knepley             }
910e537020bSMatthew G. Knepley           }
911e537020bSMatthew G. Knepley         }
9124c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
913fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
9144c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
9154c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
916e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
91718c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
91818c5995bSMatthew G. Knepley           if (v < 0) {
91918c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
92018c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
92118c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
92218c5995bSMatthew G. Knepley           } else {
92318c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
92418c5995bSMatthew G. Knepley           }
925e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
926e537020bSMatthew G. Knepley         }
9274c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
9284c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
92996a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
93096a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
931cd0c2139SMatthew G Knepley       } else if (dep == 0) {
9324c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
933cd0c2139SMatthew G Knepley 
934cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
9354c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
936cd0c2139SMatthew G Knepley           PetscInt val;
937cd0c2139SMatthew G Knepley 
938cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
939cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
940a6ae58d1SMatthew G. Knepley             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
941cd0c2139SMatthew G Knepley           }
942cd0c2139SMatthew G Knepley         }
9434c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
944cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
945cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
9464c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
947cd0c2139SMatthew G Knepley           PetscInt val, edge;
948cd0c2139SMatthew G Knepley 
949cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
950cd0c2139SMatthew G Knepley           if (val == 1) {
9514c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
952cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
9534c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
954cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
955a6ae58d1SMatthew G. Knepley             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
956cd0c2139SMatthew G Knepley           }
957cd0c2139SMatthew G Knepley         }
9584c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
959cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
9604c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
961cd0c2139SMatthew G Knepley         coneNew[0] = newp;
962cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
9634c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
9644c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
9654c367dbcSMatthew G. Knepley           PetscInt val, edge;
9664c367dbcSMatthew G. Knepley 
9674c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9684c367dbcSMatthew G. Knepley           if (val == 1) {
9694c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
9704c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
9714c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
9724c367dbcSMatthew G. Knepley           }
9734c367dbcSMatthew G. Knepley         }
9744c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
975cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
9764c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
9774c367dbcSMatthew G. Knepley 
978cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
979cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
980cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
9814c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
982e1757548SMatthew G. Knepley           if (v < 0) {
983e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
984e1757548SMatthew 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);
985a6ae58d1SMatthew G. Knepley             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthMax, depthEnd, depthShift) /*cone[q] + depthOffset[dep-1]*/;
986e1757548SMatthew G. Knepley           } else {
9874c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
988cd0c2139SMatthew G Knepley           }
989e1757548SMatthew G. Knepley         }
990cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
991cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
992cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
993cd0c2139SMatthew G Knepley           PetscInt val;
994cd0c2139SMatthew G Knepley 
995cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
9964c367dbcSMatthew G. Knepley           if (val == dim-1) {
997a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
9984c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
999a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
1000cd0c2139SMatthew G Knepley           }
1001cd0c2139SMatthew G Knepley         }
1002b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1003cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1004cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
1005cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1006cd0c2139SMatthew G Knepley           PetscInt val, face;
1007cd0c2139SMatthew G Knepley 
1008cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1009cd0c2139SMatthew G Knepley           if (val == dim-1) {
10104c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1011cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
10124c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
1013cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
1014a6ae58d1SMatthew G. Knepley             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthMax, depthEnd, depthShift) /*support[e] + depthOffset[dep+1]*/;
1015cd0c2139SMatthew G Knepley           }
1016cd0c2139SMatthew G Knepley         }
1017b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1018cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
10194c367dbcSMatthew G. Knepley         /* Hybrid face */
10204c367dbcSMatthew G. Knepley         coneNew[0] = newp;
10214c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
10224c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
10234c367dbcSMatthew G. Knepley           PetscInt vertex;
10244c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
1025e1757548SMatthew G. Knepley           if (vertex < 0) {
1026e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
1027e1757548SMatthew 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);
1028e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1029e1757548SMatthew G. Knepley           } else {
10304c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
10314c367dbcSMatthew G. Knepley           }
1032e1757548SMatthew G. Knepley         }
10334c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
10344c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
10354c367dbcSMatthew G. Knepley           PetscInt val, face;
10364c367dbcSMatthew G. Knepley 
10374c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
10384c367dbcSMatthew G. Knepley           if (val == dim-1) {
10394c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
10404c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
10414c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
10424c367dbcSMatthew G. Knepley           }
10434c367dbcSMatthew G. Knepley         }
10444c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1045cd0c2139SMatthew G Knepley       }
1046cd0c2139SMatthew G Knepley     }
1047cd0c2139SMatthew G Knepley   }
104818c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
104918c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
105018c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
1051a6ae58d1SMatthew G. Knepley       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*oldp + depthOffset[dep]*/;
105218c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
1053e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
105418c5995bSMatthew G. Knepley 
105518c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
105618c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
105718c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
105818c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
105918c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
106018c5995bSMatthew G. Knepley       if (dep == 0) {
106118c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
106218c5995bSMatthew G. Knepley 
106318c5995bSMatthew G. Knepley         /* Unsplit vertex */
106418c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
106518c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
1066a6ae58d1SMatthew G. Knepley           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthMax, depthEnd, depthShift) /*support[s] + depthOffset[dep+1]*/;
106718c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
106818c5995bSMatthew G. Knepley           if (e >= 0) {
106918c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
107018c5995bSMatthew G. Knepley           }
107118c5995bSMatthew G. Knepley         }
107218c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
107318c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
107418c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
107518c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
107618c5995bSMatthew G. Knepley         /* Hybrid edge */
107718c5995bSMatthew G. Knepley         coneNew[0] = newp;
107818c5995bSMatthew G. Knepley         coneNew[1] = newp;
107918c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
108018c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
108118c5995bSMatthew G. Knepley           PetscInt val, edge;
108218c5995bSMatthew G. Knepley 
108318c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
108418c5995bSMatthew G. Knepley           if (val == 1) {
108518c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
108618c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
108718c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1088e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1089e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1090e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1091e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
109218c5995bSMatthew G. Knepley           }
109318c5995bSMatthew G. Knepley         }
109418c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1095e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1096e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1097e1757548SMatthew G. Knepley 
1098da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1099e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1100e1757548SMatthew G. Knepley           PetscInt val, face;
1101e1757548SMatthew G. Knepley 
1102e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1103e1757548SMatthew G. Knepley           if (val == dim-1) {
1104e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1105e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
1106a6ae58d1SMatthew G. Knepley             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/;
1107e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1108e1757548SMatthew G. Knepley           } else {
1109a6ae58d1SMatthew G. Knepley             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthMax, depthEnd, depthShift) /*support[f] + depthOffset[dep+1]*/;
1110e1757548SMatthew G. Knepley           }
1111e1757548SMatthew G. Knepley         }
1112e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1113e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1114da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1115da1dd7e4SMatthew 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);
1116e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1117e1757548SMatthew G. Knepley         /* Add hybrid face */
1118e1757548SMatthew G. Knepley         coneNew[0] = newp;
1119212cc919SMatthew G. Knepley         coneNew[1] = newp;
1120e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], 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[0]);
1122212cc919SMatthew G. Knepley         coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1123e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1124e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1125e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1126e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1127da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1128da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1129da1dd7e4SMatthew G. Knepley 
1130da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1131da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1132da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1133da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1134da1dd7e4SMatthew G. Knepley           }
1135da1dd7e4SMatthew G. Knepley         }
1136da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1137da1dd7e4SMatthew 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);
1138e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1139cd0c2139SMatthew G Knepley       }
1140cd0c2139SMatthew G Knepley     }
1141cd0c2139SMatthew G Knepley   }
1142cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1143cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1144cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1145cd0c2139SMatthew G Knepley     IS              pIS;
1146cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1147cd0c2139SMatthew G Knepley     const PetscInt *points;
1148cd0c2139SMatthew G Knepley 
1149cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1150cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1151cd0c2139SMatthew G Knepley     if (!pIS) continue;
1152cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1153cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1154cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1155cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1156cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
1157a6ae58d1SMatthew G. Knepley       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + oldp*/;
1158cd0c2139SMatthew G Knepley       const PetscInt *cone;
1159cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
116050cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1161cd0c2139SMatthew G Knepley 
1162cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1163cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1164cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1165cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1166cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1167cd0c2139SMatthew G Knepley         const PetscInt coldp = cone[c] - depthOffset[dep-1];
1168cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1169cd0c2139SMatthew G Knepley 
1170cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1171cd0c2139SMatthew G Knepley         if (val == dep-1) {
1172cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1173cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1174cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1175cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
117650cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1177cd0c2139SMatthew G Knepley         }
1178cd0c2139SMatthew G Knepley       }
11794a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
11804a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1181cd0c2139SMatthew G Knepley     }
1182cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1183cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1184cd0c2139SMatthew G Knepley   }
1185cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1186cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1187cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1188cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
118969d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1190cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1191cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1192cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
1193a6ae58d1SMatthew G. Knepley     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthMax, depthEnd, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1194cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1195cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1196cd0c2139SMatthew G Knepley 
1197cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1198cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1199cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1200cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1201cd0c2139SMatthew G Knepley   }
1202cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1203cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1204cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1205cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1206cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1207cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1208cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1209cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
1210a6ae58d1SMatthew G. Knepley       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthMax, depthEnd, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1211cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1212cd0c2139SMatthew G Knepley       PetscInt       l;
1213cd0c2139SMatthew G Knepley 
1214cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1215cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1216cd0c2139SMatthew G Knepley         const char *lname;
1217cd0c2139SMatthew G Knepley         PetscInt    val;
12189a356370SMatthew G. Knepley         PetscBool   isDepth;
1219cd0c2139SMatthew G Knepley 
1220cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
12219a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
12229a356370SMatthew G. Knepley         if (isDepth) continue;
1223cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1224cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1225cd0c2139SMatthew G Knepley         if (val >= 0) {
1226cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
12279a356370SMatthew G. Knepley #if 0
12289a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
1229cd0c2139SMatthew G Knepley           if (dep == 0) {
12304c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1231cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
12324c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
12334c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
12344c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
1235cd0c2139SMatthew G Knepley           }
12364c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
12379a356370SMatthew G. Knepley #endif
1238cd0c2139SMatthew G Knepley         }
1239cd0c2139SMatthew G Knepley       }
1240cd0c2139SMatthew G Knepley     }
1241cd0c2139SMatthew G Knepley   }
1242cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1243cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1244cd0c2139SMatthew G Knepley 
1245cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
124618c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
124718c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
124818c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
124918c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1250cd0c2139SMatthew G Knepley   }
1251cd0c2139SMatthew G Knepley   if (label) {
1252cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1253cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1254cd0c2139SMatthew G Knepley   }
12550d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
12560d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
125736dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
12580d4d4d06SMatthew G. Knepley   }
12590e49e2e2SMatthew 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);
1260dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
1261a6ae58d1SMatthew G. Knepley   ierr = PetscFree6(depthMax, depthEnd, depthShift, depthOffset, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
126218c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1263cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1264cd0c2139SMatthew G Knepley }
1265cd0c2139SMatthew G Knepley 
1266cd0c2139SMatthew G Knepley #undef __FUNCT__
1267cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
1268cd0c2139SMatthew G Knepley /*@C
1269cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1270cd0c2139SMatthew G Knepley 
1271cd0c2139SMatthew G Knepley   Collective on dm
1272cd0c2139SMatthew G Knepley 
1273cd0c2139SMatthew G Knepley   Input Parameters:
1274cd0c2139SMatthew G Knepley + dm - The original DM
127553156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1276cd0c2139SMatthew G Knepley 
1277cd0c2139SMatthew G Knepley   Output Parameters:
1278cd0c2139SMatthew G Knepley - dmSplit - The new DM
1279cd0c2139SMatthew G Knepley 
1280cd0c2139SMatthew G Knepley   Level: developer
1281cd0c2139SMatthew G Knepley 
12822be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1283cd0c2139SMatthew G Knepley @*/
1284cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1285cd0c2139SMatthew G Knepley {
1286cd0c2139SMatthew G Knepley   DM             sdm;
1287cd0c2139SMatthew G Knepley   PetscInt       dim;
1288cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1289cd0c2139SMatthew G Knepley 
1290cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1291cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
129253156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1293cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1294cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1295c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1296c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr);
1297cd0c2139SMatthew G Knepley   switch (dim) {
1298cd0c2139SMatthew G Knepley   case 2:
1299cd0c2139SMatthew G Knepley   case 3:
1300cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1301cd0c2139SMatthew G Knepley     break;
1302cd0c2139SMatthew G Knepley   default:
1303cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1304cd0c2139SMatthew G Knepley   }
1305cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1306cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1307cd0c2139SMatthew G Knepley }
1308cd0c2139SMatthew G Knepley 
1309cd0c2139SMatthew G Knepley #undef __FUNCT__
13100f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static"
13110f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */
13120f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos)
13130f66a230SMatthew G. Knepley {
13140f66a230SMatthew G. Knepley   const PetscInt *cone, *ornt;
13150f66a230SMatthew G. Knepley   PetscInt        dim, coneSize, c;
13160f66a230SMatthew G. Knepley   PetscErrorCode  ierr;
13170f66a230SMatthew G. Knepley 
13180f66a230SMatthew G. Knepley   PetscFunctionBegin;
13190f66a230SMatthew G. Knepley   *pos = PETSC_TRUE;
1320c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
13210f66a230SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
13220f66a230SMatthew G. Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
13230f66a230SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr);
13240f66a230SMatthew G. Knepley   for (c = 0; c < coneSize; ++c) {
13250f66a230SMatthew G. Knepley     if (cone[c] == face) {
13260f66a230SMatthew G. Knepley       PetscInt o = ornt[c];
13270f66a230SMatthew G. Knepley 
13280f66a230SMatthew G. Knepley       if (subdm) {
13290f66a230SMatthew G. Knepley         const PetscInt *subcone, *subornt;
13300f66a230SMatthew G. Knepley         PetscInt        subpoint, subface, subconeSize, sc;
13310f66a230SMatthew G. Knepley 
13320f66a230SMatthew G. Knepley         ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
13330f66a230SMatthew G. Knepley         ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr);
13340f66a230SMatthew G. Knepley         ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
13350f66a230SMatthew G. Knepley         ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
13360f66a230SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
13370f66a230SMatthew G. Knepley         for (sc = 0; sc < subconeSize; ++sc) {
13380f66a230SMatthew G. Knepley           if (subcone[sc] == subface) {
13390f66a230SMatthew G. Knepley             o = subornt[0];
13400f66a230SMatthew G. Knepley             break;
13410f66a230SMatthew G. Knepley           }
13420f66a230SMatthew G. Knepley         }
13430f66a230SMatthew 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);
13440f66a230SMatthew G. Knepley       }
13450f66a230SMatthew G. Knepley       if (o >= 0) *pos = PETSC_TRUE;
13460f66a230SMatthew G. Knepley       else        *pos = PETSC_FALSE;
13470f66a230SMatthew G. Knepley       break;
13480f66a230SMatthew G. Knepley     }
13490f66a230SMatthew G. Knepley   }
13500f66a230SMatthew 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);
13510f66a230SMatthew G. Knepley   PetscFunctionReturn(0);
13520f66a230SMatthew G. Knepley }
13530f66a230SMatthew G. Knepley 
13540f66a230SMatthew G. Knepley #undef __FUNCT__
13552be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1356cd0c2139SMatthew G Knepley /*@
13570f66a230SMatthew G. Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces
1358cd0c2139SMatthew G Knepley   to complete the surface
1359cd0c2139SMatthew G Knepley 
1360cd0c2139SMatthew G Knepley   Input Parameters:
1361cd0c2139SMatthew G Knepley + dm     - The DM
13620f66a230SMatthew G. Knepley . label  - A DMLabel marking the surface
13630f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically
1364bb55d314SMatthew G. Knepley . flip   - Flag to flip the submesh normal and replace points on the other side
136547946fd8SMatthew G. Knepley - subdm  - The subDM associated with the label, or NULL
1366cd0c2139SMatthew G Knepley 
1367cd0c2139SMatthew G Knepley   Output Parameter:
1368cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1369cd0c2139SMatthew G Knepley 
13700f66a230SMatthew G. Knepley   Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation.
13710f66a230SMatthew G. Knepley 
1372cd0c2139SMatthew G Knepley   Level: developer
1373cd0c2139SMatthew G Knepley 
13742be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1375cd0c2139SMatthew G Knepley @*/
13760f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm)
1377cd0c2139SMatthew G Knepley {
1378d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
137986200784SMatthew G. Knepley   IS              dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL;
138047946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1381bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
1382d24f5ce5SMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val;
1383cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1384cd0c2139SMatthew G Knepley 
1385cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1386d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1387c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
138847946fd8SMatthew G. Knepley   if (subdm) {
138947946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
139047946fd8SMatthew G. Knepley     if (subpointIS) {
139147946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
139247946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
139347946fd8SMatthew G. Knepley     }
139447946fd8SMatthew G. Knepley   }
1395d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1396cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1397cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1398cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1399cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1400d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1401cd0c2139SMatthew G Knepley     const PetscInt *support;
1402cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1403cd0c2139SMatthew G Knepley 
1404cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1405cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1406cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1407cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
14080f66a230SMatthew G. Knepley       const PetscInt *cone;
1409cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
14100f66a230SMatthew G. Knepley       PetscBool       pos;
1411cd0c2139SMatthew G Knepley 
14120f66a230SMatthew G. Knepley       ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr);
14130f66a230SMatthew G. Knepley       if (pos) {ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);}
14140f66a230SMatthew G. Knepley       else     {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);}
14150f66a230SMatthew G. Knepley       if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE;
14160f66a230SMatthew G. Knepley       /* Put faces touching the fault in the label */
1417cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1418cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1419cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1420cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1421cd0c2139SMatthew G Knepley 
1422cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1423cd0c2139SMatthew G Knepley         if (val == -1) {
1424cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1425cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1426cd0c2139SMatthew G Knepley 
1427cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1428cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1429cd0c2139SMatthew G Knepley             const PetscInt clp  = closure[cl];
1430a0541d8aSMatthew G. Knepley             PetscInt       bval = -1;
1431cd0c2139SMatthew G Knepley 
1432cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1433a0541d8aSMatthew G. Knepley             if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);}
1434a0541d8aSMatthew G. Knepley             if ((val >= 0) && (val < dim-1) && (bval < 0)) {
1435cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1436cd0c2139SMatthew G Knepley               break;
1437cd0c2139SMatthew G Knepley             }
1438cd0c2139SMatthew G Knepley           }
1439cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1440cd0c2139SMatthew G Knepley         }
1441cd0c2139SMatthew G Knepley       }
1442cd0c2139SMatthew G Knepley     }
1443cd0c2139SMatthew G Knepley   }
14440f66a230SMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
14450f66a230SMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
144647946fd8SMatthew G. Knepley   if (subdm) {
144747946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
144847946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
144947946fd8SMatthew G. Knepley   }
1450a0541d8aSMatthew G. Knepley   /* Mark boundary points as unsplit */
145186200784SMatthew G. Knepley   if (blabel) {
1452a0541d8aSMatthew G. Knepley     ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr);
1453a0541d8aSMatthew G. Knepley     ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1454a0541d8aSMatthew G. Knepley     ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1455a0541d8aSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1456a0541d8aSMatthew G. Knepley       const PetscInt point = points[p];
1457a0541d8aSMatthew G. Knepley       PetscInt       val, bval;
1458a0541d8aSMatthew G. Knepley 
1459a0541d8aSMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1460a0541d8aSMatthew G. Knepley       if (bval >= 0) {
1461f7019248SMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1462f7019248SMatthew G. Knepley         if ((val < 0) || (val > dim)) {
1463f7019248SMatthew G. Knepley           /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */
1464f7019248SMatthew G. Knepley           ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr);
1465f7019248SMatthew G. Knepley         }
1466f7019248SMatthew G. Knepley       }
1467f7019248SMatthew G. Knepley     }
1468f7019248SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1469f7019248SMatthew G. Knepley       const PetscInt point = points[p];
1470f7019248SMatthew G. Knepley       PetscInt       val, bval;
1471f7019248SMatthew G. Knepley 
1472f7019248SMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1473f7019248SMatthew G. Knepley       if (bval >= 0) {
147486200784SMatthew G. Knepley         const PetscInt *cone,    *support;
147586200784SMatthew G. Knepley         PetscInt        coneSize, supportSize, s, valA, valB, valE;
147686200784SMatthew G. Knepley 
1477a0541d8aSMatthew G. Knepley         /* Mark as unsplit */
1478a0541d8aSMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1479a0541d8aSMatthew 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);
1480a0541d8aSMatthew G. Knepley         ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr);
1481a0541d8aSMatthew G. Knepley         ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr);
148286200784SMatthew G. Knepley         /* Check for cross-edge */
148386200784SMatthew G. Knepley         if (val != 0) continue;
148486200784SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
148586200784SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
148686200784SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
148786200784SMatthew G. Knepley           ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
148886200784SMatthew G. Knepley           ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
148986200784SMatthew G. Knepley           if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize);
149086200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr);
149186200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr);
149286200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr);
149309816f77SMatthew G. Knepley           if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);}
149486200784SMatthew G. Knepley         }
1495a0541d8aSMatthew G. Knepley       }
1496a0541d8aSMatthew G. Knepley     }
1497a0541d8aSMatthew G. Knepley     ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1498a0541d8aSMatthew G. Knepley     ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1499a0541d8aSMatthew G. Knepley   }
1500cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1501c4d480a2SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
1502cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1503d24f5ce5SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1504d24f5ce5SMatthew G. Knepley   cMax = cMax < 0 ? cEnd : cMax;
15050f66a230SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
1506cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
150786200784SMatthew G. Knepley   if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);}
150886200784SMatthew G. Knepley   if (dimIS && crossEdgeIS) {
150986200784SMatthew G. Knepley     IS vertIS = dimIS;
151086200784SMatthew G. Knepley 
151186200784SMatthew G. Knepley     ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr);
151286200784SMatthew G. Knepley     ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr);
151386200784SMatthew G. Knepley     ierr = ISDestroy(&vertIS);CHKERRQ(ierr);
151486200784SMatthew G. Knepley   }
1515cd0c2139SMatthew G Knepley   if (!dimIS) PetscFunctionReturn(0);
1516cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1517cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1518d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1519cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
152086200784SMatthew G. Knepley     PetscInt  starSize, s;
1521cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1522cd0c2139SMatthew G Knepley 
1523d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1524cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1525cd0c2139SMatthew G Knepley     while (again) {
1526cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1527cd0c2139SMatthew G Knepley       again = 0;
1528cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1529cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1530cd0c2139SMatthew G Knepley         const PetscInt *cone;
1531cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1532cd0c2139SMatthew G Knepley 
1533d24f5ce5SMatthew G. Knepley         if ((point < cStart) || (point >= cMax)) continue;
1534cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1535cd0c2139SMatthew G Knepley         if (val != -1) continue;
1536d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1537cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1538cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1539cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1540cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1541cd0c2139SMatthew G Knepley           if (val != -1) {
1542d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1543166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1544d7c8f101SMatthew G. Knepley 
1545cd0c2139SMatthew 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);
154637a6de01SMatthew G. Knepley             if (val > 0) side =  1;
154737a6de01SMatthew G. Knepley             else         side = -1;
154837a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1549d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1550d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1551d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1552d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1553d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1554d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1555d7c8f101SMatthew G. Knepley 
1556166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1557166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1558d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1559d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1560d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1561d7c8f101SMatthew G. Knepley 
1562d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1563d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1564d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
156537a6de01SMatthew G. Knepley                 break;
156637a6de01SMatthew G. Knepley               }
1567d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1568cd0c2139SMatthew G Knepley             }
1569cd0c2139SMatthew G Knepley             again = 1;
1570cd0c2139SMatthew G Knepley             break;
1571cd0c2139SMatthew G Knepley           }
1572cd0c2139SMatthew G Knepley         }
1573cd0c2139SMatthew G Knepley       }
1574cd0c2139SMatthew G Knepley     }
1575cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1576cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1577cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1578cd0c2139SMatthew G Knepley 
1579cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1580cd0c2139SMatthew G Knepley       if (val == -1) {
1581cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1582cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1583cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1584cd0c2139SMatthew G Knepley 
1585cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1586cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1587cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1588cd0c2139SMatthew G Knepley 
1589d24f5ce5SMatthew G. Knepley           if ((spoint < cStart) || (spoint >= cMax)) continue;
1590cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1591cd0c2139SMatthew 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);
1592d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1593cd0c2139SMatthew G Knepley           if (val > 0) {
1594cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1595cd0c2139SMatthew G Knepley           } else {
1596cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1597cd0c2139SMatthew G Knepley           }
1598cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1599cd0c2139SMatthew G Knepley           break;
1600cd0c2139SMatthew G Knepley         }
1601cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1602cd0c2139SMatthew G Knepley         if (!marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1603cd0c2139SMatthew G Knepley       }
1604cd0c2139SMatthew G Knepley     }
1605cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1606cd0c2139SMatthew G Knepley   }
1607cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1608cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
160918c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
161018c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
161118c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
161218c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
161318c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
161418c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
161518c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
161618c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
161718c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
161818c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
161918c5995bSMatthew G. Knepley     const PetscInt *support;
162018c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
162118c5995bSMatthew G. Knepley 
162218c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
162318c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
162418c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
162518c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
162618c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
162718c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
162818c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
162918c5995bSMatthew G. Knepley     /* Split the face */
163018c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
163118c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
163218c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1633e1757548SMatthew G. Knepley     /* Label its closure:
1634e1757548SMatthew G. Knepley       unmarked: label as unsplit
1635e1757548SMatthew G. Knepley       incident: relabel as split
1636e1757548SMatthew G. Knepley       split:    do nothing
1637e1757548SMatthew G. Knepley     */
163818c5995bSMatthew G. Knepley     {
163918c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
164018c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
164118c5995bSMatthew G. Knepley 
164218c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
164318c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
164418c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
16458771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
164618c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
164718c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
16488771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1649e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1650e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1651e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1652e1757548SMatthew G. Knepley         }
165318c5995bSMatthew G. Knepley       }
165418c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
165518c5995bSMatthew G. Knepley     }
165618c5995bSMatthew G. Knepley   }
165718c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
165818c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1659cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1660cd0c2139SMatthew G Knepley }
1661cd0c2139SMatthew G Knepley 
1662cd0c2139SMatthew G Knepley #undef __FUNCT__
16633cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
16643cf72582SMatthew G. Knepley /*@C
16653cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
16663cf72582SMatthew G. Knepley 
16673cf72582SMatthew G. Knepley   Collective on dm
16683cf72582SMatthew G. Knepley 
16693cf72582SMatthew G. Knepley   Input Parameters:
16703cf72582SMatthew G. Knepley + dm - The original DM
16713cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
16723cf72582SMatthew G. Knepley 
16733cf72582SMatthew G. Knepley   Output Parameters:
16743cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
16753cf72582SMatthew G. Knepley - dmHybrid - The new DM
16763cf72582SMatthew G. Knepley 
16773cf72582SMatthew G. Knepley   Level: developer
16783cf72582SMatthew G. Knepley 
16793cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
16803cf72582SMatthew G. Knepley @*/
16813cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
16823cf72582SMatthew G. Knepley {
16833cf72582SMatthew G. Knepley   DM             idm;
16843cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
16853cf72582SMatthew G. Knepley   PetscInt       dim;
16863cf72582SMatthew G. Knepley   PetscErrorCode ierr;
16873cf72582SMatthew G. Knepley 
16883cf72582SMatthew G. Knepley   PetscFunctionBegin;
16893cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
16903cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
16913cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
1692c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
16933cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
16943cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
16953cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
16963cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
16973cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
16980f66a230SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr);
16993cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
17003cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
17013cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
170253aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1703e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1704e6ccafaeSMatthew G Knepley }
1705e6ccafaeSMatthew G Knepley 
1706e6ccafaeSMatthew G Knepley #undef __FUNCT__
1707efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1708efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1709efa14ee0SMatthew G Knepley 
1710efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1711efa14ee0SMatthew G Knepley */
1712830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1713efa14ee0SMatthew G Knepley {
1714fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1715efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
171677d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1717efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1718efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1719efa14ee0SMatthew G Knepley 
1720efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1721efa14ee0SMatthew G Knepley   *numFaces = 0;
1722efa14ee0SMatthew G Knepley   *nFV      = 0;
1723efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1724c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
172577d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1726dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1727d92e47f8SMatthew 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);
1728efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1729efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1730efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1731efa14ee0SMatthew G Knepley   }
1732efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1733fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1734efa14ee0SMatthew G Knepley   if (subvertexIS) {
1735efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1736efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1737efa14ee0SMatthew G Knepley   }
1738efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1739efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
17400298fd71SBarry Smith     PetscInt      *star   = NULL;
1741efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1742efa14ee0SMatthew G Knepley 
1743efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1744efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1745efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1746efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1747efa14ee0SMatthew G Knepley     }
1748efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1749efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
17500298fd71SBarry Smith       PetscInt      *closure = NULL;
1751efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1752efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1753efa14ee0SMatthew G Knepley 
1754efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
175565560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
175682f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1757efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1758efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1759efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1760efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1761efa14ee0SMatthew G Knepley 
1762efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1763efa14ee0SMatthew G Knepley           ++numCorners;
1764efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1765830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1766efa14ee0SMatthew G Knepley         }
1767efa14ee0SMatthew G Knepley       }
176818ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
176982f516ccSBarry 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);
1770efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1771007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1772007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1773007baee2SMatthew G. Knepley 
1774efa14ee0SMatthew G Knepley         ++(*numFaces);
1775efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1776efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1777efa14ee0SMatthew G Knepley         }
1778007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1779007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1780007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1781007baee2SMatthew G. Knepley         }
1782007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1783efa14ee0SMatthew G Knepley       }
1784efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1785efa14ee0SMatthew G Knepley     }
1786efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1787efa14ee0SMatthew G Knepley   }
1788efa14ee0SMatthew G Knepley   if (subvertexIS) {
1789efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1790efa14ee0SMatthew G Knepley   }
1791efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1792efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1793efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1794efa14ee0SMatthew G Knepley }
1795efa14ee0SMatthew G Knepley 
1796efa14ee0SMatthew G Knepley #undef __FUNCT__
1797efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1798830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1799efa14ee0SMatthew G Knepley {
1800efa14ee0SMatthew G Knepley   IS               subvertexIS;
1801efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1802efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1803efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1804efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1805efa14ee0SMatthew G Knepley 
1806efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1807c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1808dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
18090298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1810efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1811efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1812efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1813efa14ee0SMatthew G Knepley   }
1814efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1815830e53efSMatthew G. Knepley   ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1816efa14ee0SMatthew G Knepley   if (subvertexIS) {
1817efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1818efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1819efa14ee0SMatthew G Knepley   }
1820efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1821efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
18220298fd71SBarry Smith     PetscInt      *star   = NULL;
1823efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1824efa14ee0SMatthew G Knepley 
1825efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1826efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1827efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1828efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1829efa14ee0SMatthew G Knepley     }
1830efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1831efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
18320298fd71SBarry Smith       PetscInt      *closure = NULL;
1833efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1834efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1835efa14ee0SMatthew G Knepley 
1836efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1837efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
183882f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1839efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1840efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1841efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1842efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1843efa14ee0SMatthew G Knepley 
1844efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1845efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1846830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1847efa14ee0SMatthew G Knepley         }
1848efa14ee0SMatthew G Knepley       }
1849efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1850efa14ee0SMatthew G Knepley         const PetscInt *support;
1851efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1852efa14ee0SMatthew G Knepley 
1853efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1854efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1855efa14ee0SMatthew G Knepley 
1856efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1857efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1858efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1859efa14ee0SMatthew G Knepley               break;
1860efa14ee0SMatthew G Knepley             }
1861efa14ee0SMatthew G Knepley           }
1862efa14ee0SMatthew G Knepley         }
1863efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1864efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1865efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1866efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1867efa14ee0SMatthew G Knepley         }
1868efa14ee0SMatthew G Knepley       }
1869efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1870efa14ee0SMatthew G Knepley     }
1871efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1872efa14ee0SMatthew G Knepley   }
1873efa14ee0SMatthew G Knepley   if (subvertexIS) {
1874efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1875efa14ee0SMatthew G Knepley   }
1876efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1877efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1878efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1879efa14ee0SMatthew G Knepley }
1880efa14ee0SMatthew G Knepley 
1881efa14ee0SMatthew G Knepley #undef __FUNCT__
1882766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
188327c04023SMatthew 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)
1884766ab985SMatthew G. Knepley {
188527c04023SMatthew G. Knepley   DMLabel         label = NULL;
1886766ab985SMatthew G. Knepley   const PetscInt *cone;
188727234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
1888766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
1889766ab985SMatthew G. Knepley 
1890812bfc34SJed Brown   PetscFunctionBegin;
1891c0ed958bSJed Brown   *numFaces = 0;
1892c0ed958bSJed Brown   *nFV = 0;
1893b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1894fed694aaSMatthew G. Knepley   *subCells = NULL;
1895c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1896766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1897766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1898766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
189927c04023SMatthew G. Knepley   if (label) {
190027c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
190127c04023SMatthew G. Knepley       PetscInt val;
190227c04023SMatthew G. Knepley 
190327c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
190427c04023SMatthew G. Knepley       if (val == value) {
190527c04023SMatthew G. Knepley         ++(*numFaces);
190627c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
190727c04023SMatthew G. Knepley       }
190827c04023SMatthew G. Knepley     }
190927c04023SMatthew G. Knepley   } else {
1910766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
191127c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
191227c04023SMatthew G. Knepley   }
1913766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
1914785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
1915766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1916766ab985SMatthew G. Knepley     const PetscInt *cells;
1917766ab985SMatthew G. Knepley     PetscInt        numCells;
1918766ab985SMatthew G. Knepley 
191927c04023SMatthew G. Knepley     if (label) {
192027c04023SMatthew G. Knepley       PetscInt val;
192127c04023SMatthew G. Knepley 
192227c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
192327c04023SMatthew G. Knepley       if (val != value) continue;
192427c04023SMatthew G. Knepley     }
1925766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1926766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
1927766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
1928766ab985SMatthew G. Knepley     }
1929766ab985SMatthew G. Knepley     /* Negative face */
1930766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
193127234c99SMatthew G. Knepley     /* Not true in parallel
193227234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
1933766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
1934766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
193527234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
1936766ab985SMatthew G. Knepley     }
1937766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
1938766ab985SMatthew G. Knepley     /* Positive face is not included */
1939766ab985SMatthew G. Knepley   }
1940766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
1941766ab985SMatthew G. Knepley }
1942766ab985SMatthew G. Knepley 
1943766ab985SMatthew G. Knepley #undef __FUNCT__
1944766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
1945b3154360SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DMLabel subpointMap, DM subdm)
1946766ab985SMatthew G. Knepley {
194727c04023SMatthew G. Knepley   DMLabel        label = NULL;
1948766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
1949766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
1950766ab985SMatthew G. Knepley   PetscErrorCode ierr;
1951766ab985SMatthew G. Knepley 
1952812bfc34SJed Brown   PetscFunctionBegin;
195327c04023SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
1954c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1955766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
1956766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1957766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
1958dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
1959b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
1960766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
1961766ab985SMatthew G. Knepley     const PetscInt *cone;
1962766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
1963b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
1964766ab985SMatthew G. Knepley 
196527c04023SMatthew G. Knepley     if (label) {
196627c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
196727c04023SMatthew G. Knepley       if (val != value) continue;
196827c04023SMatthew G. Knepley     }
1969766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
1970766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
1971b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
1972b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
1973b3154360SMatthew G. Knepley     /* Negative face */
1974766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1975766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
1976766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
1977766ab985SMatthew G. Knepley 
1978766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
1979766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
1980766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1981766ab985SMatthew G. Knepley           break;
1982766ab985SMatthew G. Knepley         }
1983766ab985SMatthew G. Knepley       }
1984766ab985SMatthew G. Knepley     }
1985766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1986766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
1987766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
1988766ab985SMatthew G. Knepley       const PetscInt *support;
1989766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
1990766ab985SMatthew G. Knepley 
1991766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
1992711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
1993766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
1994766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
1995766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1996766ab985SMatthew G. Knepley       }
1997766ab985SMatthew G. Knepley     }
1998766ab985SMatthew G. Knepley   }
1999766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
2000766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2001766ab985SMatthew G. Knepley }
2002766ab985SMatthew G. Knepley 
2003766ab985SMatthew G. Knepley #undef __FUNCT__
2004e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
2005e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2006e6ccafaeSMatthew G Knepley {
200782f516ccSBarry Smith   MPI_Comm       comm;
2008e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
2009e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
2010e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
2011e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2012e6ccafaeSMatthew G Knepley 
201382f516ccSBarry Smith   PetscFunctionBegin;
201482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2015c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr);
2016e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
2017e6ccafaeSMatthew G Knepley 
2018ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
2019ddeab2a6SMatthew G. Knepley     /* Triangle */
2020e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
2021e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2022ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
2023ddeab2a6SMatthew G. Knepley     /* Triangle */
2024ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2025ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2026ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
2027ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
2028ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2029ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2030e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
2031e6ccafaeSMatthew G Knepley     /* Quadratic line */
2032e6ccafaeSMatthew G Knepley     faceSize  = 1;
2033e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
2034e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
2035e6ccafaeSMatthew G Knepley     /* Quads */
2036e6ccafaeSMatthew G Knepley     faceSize = 2;
2037e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
2038e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2039e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
2040e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2041e6ccafaeSMatthew G Knepley     } else {
2042e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
2043e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
2044e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
2045e6ccafaeSMatthew G Knepley     }
2046e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
2047e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
2048e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2049e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
2050e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2051e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
2052e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
2053e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2054e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2055e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
2056e6ccafaeSMatthew G Knepley     };
2057e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
2058e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2059e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2060e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
2061e6ccafaeSMatthew G Knepley     };
2062e6ccafaeSMatthew G Knepley 
2063e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
2064e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
2065e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
2066e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
2067e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
2068e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2069e6ccafaeSMatthew G Knepley 
2070e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
2071e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
2072e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
2073e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
2074e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
2075e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2076e6ccafaeSMatthew G Knepley               break;
2077e6ccafaeSMatthew G Knepley             }
2078e6ccafaeSMatthew G Knepley           }
2079e6ccafaeSMatthew G Knepley         }
2080e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2081e6ccafaeSMatthew G Knepley         break;
2082e6ccafaeSMatthew G Knepley       }
2083e6ccafaeSMatthew G Knepley     }
2084e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
2085e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2086e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2087e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
2088e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
2089e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2090e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
2091e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2092e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
2093e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
2094e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2095e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2096e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2097e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
2098e6ccafaeSMatthew G Knepley     };
2099e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
2100e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2101e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2102e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2103e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
2104e6ccafaeSMatthew G Knepley     };
2105e6ccafaeSMatthew G Knepley 
2106e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
2107e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
2108e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
2109e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
2110e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
2111e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2112e6ccafaeSMatthew G Knepley 
2113e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
2114e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
2115e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
2116e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
2117e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
2118e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2119e6ccafaeSMatthew G Knepley               break;
2120e6ccafaeSMatthew G Knepley             }
2121e6ccafaeSMatthew G Knepley           }
2122e6ccafaeSMatthew G Knepley         }
2123e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2124e6ccafaeSMatthew G Knepley         break;
2125e6ccafaeSMatthew G Knepley       }
2126e6ccafaeSMatthew G Knepley     }
2127e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
2128e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2129e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2130e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
2131e6ccafaeSMatthew G Knepley     /* Hexes
2132e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2133e6ccafaeSMatthew G Knepley        pointing up at the second.
2134e6ccafaeSMatthew G Knepley 
2135e6ccafaeSMatthew G Knepley           7---6
2136e6ccafaeSMatthew G Knepley          /|  /|
2137e6ccafaeSMatthew G Knepley         4---5 |
2138ddeab2a6SMatthew G. Knepley         | 1-|-2
2139e6ccafaeSMatthew G Knepley         |/  |/
2140ddeab2a6SMatthew G. Knepley         0---3
2141e6ccafaeSMatthew G Knepley 
2142e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
2143e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
2144e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
2145e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2146e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
2147e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
2148e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2149ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2150ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2151ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2152ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2153e6ccafaeSMatthew G Knepley     };
2154e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2155ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2156e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2157ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2158ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2159ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2160ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2161e6ccafaeSMatthew G Knepley     };
2162e6ccafaeSMatthew G Knepley 
2163e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
2164e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2165e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2166e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2167e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2168e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2169e6ccafaeSMatthew G Knepley 
2170e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2171e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2172e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2173e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2174e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2175e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2176e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2177e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2178e6ccafaeSMatthew G Knepley               break;
2179e6ccafaeSMatthew G Knepley             }
2180e6ccafaeSMatthew G Knepley           }
2181e6ccafaeSMatthew G Knepley         }
2182e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2183e6ccafaeSMatthew G Knepley         break;
2184e6ccafaeSMatthew G Knepley       }
2185e6ccafaeSMatthew G Knepley     }
2186e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2187e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2188e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2189e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2190e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2191e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2192e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2193e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2194e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2195e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2196e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2197e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2198e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2199e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2200e6ccafaeSMatthew G Knepley     };
2201e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2202e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2203e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2204e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2205e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2206e6ccafaeSMatthew G Knepley     };
2207e6ccafaeSMatthew G Knepley 
2208e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
2209e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2210e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2211e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2212e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2213e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2214e6ccafaeSMatthew G Knepley 
2215e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2216e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2217e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2218e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2219e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2220e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2221e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2222e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2223e6ccafaeSMatthew G Knepley               break;
2224e6ccafaeSMatthew G Knepley             }
2225e6ccafaeSMatthew G Knepley           }
2226e6ccafaeSMatthew G Knepley         }
2227e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2228e6ccafaeSMatthew G Knepley         break;
2229e6ccafaeSMatthew G Knepley       }
2230e6ccafaeSMatthew G Knepley     }
2231e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2232e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2233e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2234e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2235e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2236e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2237e6ccafaeSMatthew G Knepley        pointing up at the second.
2238e6ccafaeSMatthew G Knepley 
2239e6ccafaeSMatthew G Knepley          7---6
2240e6ccafaeSMatthew G Knepley         /|  /|
2241e6ccafaeSMatthew G Knepley        4---5 |
2242e6ccafaeSMatthew G Knepley        | 3-|-2
2243e6ccafaeSMatthew G Knepley        |/  |/
2244e6ccafaeSMatthew G Knepley        0---1
2245e6ccafaeSMatthew G Knepley 
2246e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2247e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2248e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2249e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2250e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2251e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2252e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2253e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2254e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2255e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2256e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2257e6ccafaeSMatthew G Knepley     };
2258e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2259e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2260e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2261e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2262e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2263e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2264e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2265e6ccafaeSMatthew G Knepley     };
2266e6ccafaeSMatthew G Knepley 
2267e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
2268e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2269e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2270e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2271e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2272e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2273e6ccafaeSMatthew G Knepley 
2274e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2275e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2276e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2277e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2278e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2279e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2280e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2281e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2282e6ccafaeSMatthew G Knepley               break;
2283e6ccafaeSMatthew G Knepley             }
2284e6ccafaeSMatthew G Knepley           }
2285e6ccafaeSMatthew G Knepley         }
2286e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2287e6ccafaeSMatthew G Knepley         break;
2288e6ccafaeSMatthew G Knepley       }
2289e6ccafaeSMatthew G Knepley     }
2290e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2291e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2292e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2293e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2294e6ccafaeSMatthew G Knepley   if (!posOrient) {
2295e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2296e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2297e6ccafaeSMatthew G Knepley   } else {
2298e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2299e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2300e6ccafaeSMatthew G Knepley   }
2301e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2302e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2303e6ccafaeSMatthew G Knepley }
2304e6ccafaeSMatthew G Knepley 
2305e6ccafaeSMatthew G Knepley #undef __FUNCT__
2306e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
2307e6ccafaeSMatthew G Knepley /*
2308e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
2309e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
2310e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
2311e6ccafaeSMatthew G Knepley */
2312e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2313e6ccafaeSMatthew G Knepley {
23140298fd71SBarry Smith   const PetscInt *cone = NULL;
2315e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2316e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2317e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2318e6ccafaeSMatthew G Knepley 
2319e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2320e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2321e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2322e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2323e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2324e6ccafaeSMatthew G Knepley 
2325e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2326e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2327e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2328e6ccafaeSMatthew G Knepley       }
2329e6ccafaeSMatthew G Knepley     }
2330e6ccafaeSMatthew G Knepley     if (found) {
2331e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2332e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2333e6ccafaeSMatthew G Knepley       ++v2;
2334e6ccafaeSMatthew G Knepley     } else {
2335e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2336e6ccafaeSMatthew G Knepley     }
2337e6ccafaeSMatthew G Knepley   }
2338e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2339e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2340e6ccafaeSMatthew G Knepley }
2341e6ccafaeSMatthew G Knepley 
2342e6ccafaeSMatthew G Knepley #undef __FUNCT__
2343cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
2344e6ccafaeSMatthew G Knepley /*
2345cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2346e6ccafaeSMatthew G Knepley 
2347e6ccafaeSMatthew G Knepley   Not collective
2348e6ccafaeSMatthew G Knepley 
2349e6ccafaeSMatthew G Knepley   Input Parameters:
2350e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2351e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2352e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2353e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2354e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2355e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2356e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2357e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2358e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2359e6ccafaeSMatthew G Knepley 
2360e6ccafaeSMatthew G Knepley   Output Parameters:
2361e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2362e6ccafaeSMatthew G Knepley 
2363e6ccafaeSMatthew G Knepley   Level: developer
2364e6ccafaeSMatthew G Knepley */
2365cd0c2139SMatthew 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)
2366e6ccafaeSMatthew G Knepley {
236782f516ccSBarry Smith   MPI_Comm        comm;
2368e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2369e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2370e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2371e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2372e6ccafaeSMatthew G Knepley 
2373e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
237482f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2375e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2376e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2377e6ccafaeSMatthew G Knepley #if 0
2378e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2379e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2380e6ccafaeSMatthew G Knepley #else
2381e6ccafaeSMatthew G Knepley   {
2382e6ccafaeSMatthew G Knepley     PetscInt f;
2383e6ccafaeSMatthew G Knepley 
2384e6ccafaeSMatthew G Knepley     numFaces = 0;
2385e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2386e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2387e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2388e6ccafaeSMatthew G Knepley 
2389e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2390e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2391e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2392e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2393e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2394e6ccafaeSMatthew G Knepley         PetscInt       v;
2395e6ccafaeSMatthew G Knepley 
2396e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2397e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2398e6ccafaeSMatthew G Knepley         }
2399e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2400e6ccafaeSMatthew G Knepley       }
2401e6ccafaeSMatthew G Knepley       if (d == dof) {
2402e6ccafaeSMatthew G Knepley         numFaces               = 1;
2403e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2404e6ccafaeSMatthew G Knepley       }
2405e6ccafaeSMatthew G Knepley     }
2406e6ccafaeSMatthew G Knepley   }
2407e6ccafaeSMatthew G Knepley #endif
2408e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2409e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2410e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2411766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2412e6ccafaeSMatthew G Knepley   } else {
2413e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2414e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2415e6ccafaeSMatthew G Knepley 
2416e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2417e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2418e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2419e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2420e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2421e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2422e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2423e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2424e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2425e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2426e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2427e6ccafaeSMatthew G Knepley           break;
2428e6ccafaeSMatthew G Knepley         }
2429e6ccafaeSMatthew G Knepley       }
2430e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2431e6ccafaeSMatthew G Knepley     }
2432e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2433e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2434e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2435e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2436e6ccafaeSMatthew G Knepley   }
2437ef07cca7SMatthew G. Knepley #if 0
2438e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2439ef07cca7SMatthew G. Knepley #else
2440ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2441ef07cca7SMatthew G. Knepley #endif
2442e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2443e6ccafaeSMatthew G Knepley }
2444e6ccafaeSMatthew G Knepley 
2445e6ccafaeSMatthew G Knepley #undef __FUNCT__
2446e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
244753156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2448e6ccafaeSMatthew G Knepley {
244982f516ccSBarry Smith   MPI_Comm        comm;
245053156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2451efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2452efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2453efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2454fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2455efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2456e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2457e6ccafaeSMatthew G Knepley 
2458e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
245982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2460efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2461efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2462efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2463efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
246453156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2465efa14ee0SMatthew G Knepley   /* Setup chart */
2466efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2467efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2468efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2469efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2470e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2471e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2472efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2473e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2474efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2475efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2476efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2477efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2478e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2479e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2480e6ccafaeSMatthew G Knepley   }
2481e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2482e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2483e6ccafaeSMatthew G Knepley   }
2484e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2485e6ccafaeSMatthew G Knepley   /* Create face cones */
2486efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
24870298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2488efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2489e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2490e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2491efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
24920298fd71SBarry Smith     PetscInt      *closure = NULL;
2493efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2494e6ccafaeSMatthew G Knepley 
2495e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2496efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2497efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2498e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2499e6ccafaeSMatthew G Knepley 
2500efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2501efa14ee0SMatthew G Knepley         ++numCorners;
2502efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2503efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2504efa14ee0SMatthew G Knepley           closure[faceSize] = point;
250565560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2506e6ccafaeSMatthew G Knepley           ++faceSize;
2507e6ccafaeSMatthew G Knepley         }
2508e6ccafaeSMatthew G Knepley       }
2509e6ccafaeSMatthew G Knepley     }
2510efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2511efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2512cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2513e6ccafaeSMatthew G Knepley     }
251465560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2515e6ccafaeSMatthew G Knepley   }
2516efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2517e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2518e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2519e6ccafaeSMatthew G Knepley   /* Build coordinates */
2520efa14ee0SMatthew G Knepley   {
2521efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2522efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2523efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2524285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2525efa14ee0SMatthew G Knepley 
252669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2527e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
252869d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2529285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2530285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2531285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2532efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2533efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2534efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2535efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2536efa14ee0SMatthew G Knepley       PetscInt       dof;
2537efa14ee0SMatthew G Knepley 
2538efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2539efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2540285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2541e6ccafaeSMatthew G Knepley     }
2542e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2543e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2544e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2545e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
25462eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2547830e53efSMatthew G. Knepley     if (coordSize) {
2548e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2549e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2550efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2551efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2552efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2553efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2554e6ccafaeSMatthew G Knepley 
2555e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2556e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2557efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2558efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2559efa14ee0SMatthew 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);
2560e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2561e6ccafaeSMatthew G Knepley       }
2562e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2563e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
25643b399e24SMatthew G. Knepley     }
2565e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2566e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2567e6ccafaeSMatthew G Knepley   }
2568efa14ee0SMatthew G Knepley   /* Cleanup */
2569efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2570efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2571efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2572efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2573e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2574e6ccafaeSMatthew G Knepley }
2575e6ccafaeSMatthew G Knepley 
2576e6ccafaeSMatthew G Knepley #undef __FUNCT__
2577e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
257853156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2579e6ccafaeSMatthew G Knepley {
258082f516ccSBarry Smith   MPI_Comm         comm;
258153156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2582efa14ee0SMatthew G Knepley   IS              *subpointIS;
2583efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
258401a2673eSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *coneONew;
2585efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2586e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2587e6ccafaeSMatthew G Knepley 
2588e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
258982f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2590efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2591e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2592efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2593efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
259453156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Interpolated(dm, vertexLabel, value, subpointMap, subdm);CHKERRQ(ierr);}
2595efa14ee0SMatthew G Knepley   /* Setup chart */
2596c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2597dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2598e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2599e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2600e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2601e6ccafaeSMatthew G Knepley   }
2602e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2603e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2604e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2605e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2606e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2607e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2608e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2609e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2610e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
26110ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2612e6ccafaeSMatthew G Knepley   }
2613e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2614e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2615e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2616e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2617e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2618e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2619e6ccafaeSMatthew G Knepley 
2620e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2621e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2622e6ccafaeSMatthew G Knepley       if (d == dim) {
2623e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2624e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2625e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2626e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2627e6ccafaeSMatthew G Knepley         }
2628e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2629e6ccafaeSMatthew G Knepley       }
2630e6ccafaeSMatthew G Knepley     }
2631e6ccafaeSMatthew G Knepley   }
2632e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2633e6ccafaeSMatthew G Knepley   /* Set cones */
26340298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2635dcca6d9dSJed Brown   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&coneONew);CHKERRQ(ierr);
2636e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2637e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2638e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2639e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
26400e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2641e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2642e6ccafaeSMatthew G Knepley 
2643e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2644e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2645e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
26460e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2647e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2648e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
264901a2673eSMatthew G. Knepley         if (subc >= 0) {
265001a2673eSMatthew G. Knepley           coneNew[coneSizeNew]  = firstSubPoint[d-1] + subc;
265101a2673eSMatthew G. Knepley           coneONew[coneSizeNew] = ornt[c];
265201a2673eSMatthew G. Knepley           ++coneSizeNew;
265301a2673eSMatthew G. Knepley         }
2654e6ccafaeSMatthew G Knepley       }
2655e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2656e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
265701a2673eSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, coneONew);CHKERRQ(ierr);
2658e6ccafaeSMatthew G Knepley     }
2659e6ccafaeSMatthew G Knepley   }
266001a2673eSMatthew G. Knepley   ierr = PetscFree2(coneNew,coneONew);CHKERRQ(ierr);
2661e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2662e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2663e6ccafaeSMatthew G Knepley   /* Build coordinates */
2664e6ccafaeSMatthew G Knepley   {
2665e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2666e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2667e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2668285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2669e6ccafaeSMatthew G Knepley 
267069d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2671e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
267269d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2673285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2674285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2675285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2676e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2677e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2678e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2679e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2680e6ccafaeSMatthew G Knepley       PetscInt       dof;
2681e6ccafaeSMatthew G Knepley 
2682e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2683e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2684285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2685e6ccafaeSMatthew G Knepley     }
2686e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2687e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2688e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2689e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
26902eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2691e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2692e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2693e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2694e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2695e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2696e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2697e6ccafaeSMatthew G Knepley 
2698e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2699e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2700e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2701e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2702e6ccafaeSMatthew 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);
2703efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2704e6ccafaeSMatthew G Knepley     }
2705e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2706e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2707e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2708e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2709e6ccafaeSMatthew G Knepley   }
2710efa14ee0SMatthew G Knepley   /* Cleanup */
2711e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
27120ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2713e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2714e6ccafaeSMatthew G Knepley   }
2715efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2716e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2717e6ccafaeSMatthew G Knepley }
2718e6ccafaeSMatthew G Knepley 
2719e6ccafaeSMatthew G Knepley #undef __FUNCT__
2720e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2721d0fa310fSMatthew G. Knepley /*@
2722e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2723e6ccafaeSMatthew G Knepley 
2724e6ccafaeSMatthew G Knepley   Input Parameters:
2725e6ccafaeSMatthew G Knepley + dm           - The original mesh
2726830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2727830e53efSMatthew G. Knepley - value        - The label value to use
2728e6ccafaeSMatthew G Knepley 
2729e6ccafaeSMatthew G Knepley   Output Parameter:
2730e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2731e6ccafaeSMatthew G Knepley 
2732e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2733e6ccafaeSMatthew G Knepley 
2734e6ccafaeSMatthew G Knepley   Level: developer
2735e6ccafaeSMatthew G Knepley 
2736e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2737830e53efSMatthew G. Knepley @*/
273853156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2739e6ccafaeSMatthew G Knepley {
2740e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2741e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2742e6ccafaeSMatthew G Knepley 
2743e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2744e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2745766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2746c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2747e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
274882f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2749e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2750c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2751e6ccafaeSMatthew G Knepley   if (depth == dim) {
2752830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2753e6ccafaeSMatthew G Knepley   } else {
2754830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2755e6ccafaeSMatthew G Knepley   }
2756e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2757e6ccafaeSMatthew G Knepley }
2758e6ccafaeSMatthew G Knepley 
2759e6ccafaeSMatthew G Knepley #undef __FUNCT__
2760aca35d17SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
2761aca35d17SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
2762aca35d17SMatthew G. Knepley {
2763aca35d17SMatthew G. Knepley   PetscInt       subPoint;
2764aca35d17SMatthew G. Knepley   PetscErrorCode ierr;
2765aca35d17SMatthew G. Knepley 
2766aca35d17SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
2767aca35d17SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
2768aca35d17SMatthew G. Knepley }
2769aca35d17SMatthew G. Knepley 
2770aca35d17SMatthew G. Knepley #undef __FUNCT__
2771766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
277227c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2773766ab985SMatthew G. Knepley {
2774766ab985SMatthew G. Knepley   MPI_Comm        comm;
2775766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2776766ab985SMatthew G. Knepley   IS              subvertexIS;
2777766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2778fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
2779766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
278087feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
2781766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2782766ab985SMatthew G. Knepley 
2783766ab985SMatthew G. Knepley   PetscFunctionBegin;
2784766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
2785766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2786766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2787766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2788766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
278927c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
2790766ab985SMatthew G. Knepley   /* Setup chart */
2791766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2792766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2793766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2794766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2795766ab985SMatthew G. Knepley   /* Set cone sizes */
2796766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
2797766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
2798766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
2799766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2800766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2801766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2802766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2803766ab985SMatthew G. Knepley   }
2804766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2805766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2806766ab985SMatthew G. Knepley   }
2807766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2808766ab985SMatthew G. Knepley   /* Create face cones */
2809766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
281087feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2811766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2812766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
2813766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
2814766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
281587feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
281687feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
2817766ab985SMatthew G. Knepley 
281887feddfdSMatthew G. Knepley     if (cell < cMax) continue;
281987feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
282087feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
282187feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
282287feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
282387feddfdSMatthew G. Knepley     }
282487feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
282587feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
282687feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
282727234c99SMatthew G. Knepley     /* Not true in parallel
282827234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
282987feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
283087feddfdSMatthew G. Knepley       PetscInt negsubcell;
2831766ab985SMatthew G. Knepley 
283287feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
283387feddfdSMatthew G. Knepley       /* I know this is a crap search */
283487feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
283587feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
2836766ab985SMatthew G. Knepley       }
283787feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
283887feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
2839766ab985SMatthew G. Knepley     }
284087feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
284187feddfdSMatthew G. Knepley     ++newFacePoint;
2842766ab985SMatthew G. Knepley   }
2843766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2844766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2845766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2846766ab985SMatthew G. Knepley   /* Build coordinates */
2847766ab985SMatthew G. Knepley   {
2848766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
2849766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
2850766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
2851285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2852766ab985SMatthew G. Knepley 
285369d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2854766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
285569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2856285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2857285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2858285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2859766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2860766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2861766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2862766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2863766ab985SMatthew G. Knepley       PetscInt       dof;
2864766ab985SMatthew G. Knepley 
2865766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2866766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2867285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2868766ab985SMatthew G. Knepley     }
2869766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2870766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2871766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2872766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
28732eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2874766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2875766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2876766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
2877766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
2878766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
2879766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
2880766ab985SMatthew G. Knepley 
2881766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2882766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2883766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2884766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2885766ab985SMatthew 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);
2886766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2887766ab985SMatthew G. Knepley     }
2888766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2889766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2890766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2891766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2892766ab985SMatthew G. Knepley   }
2893aca35d17SMatthew G. Knepley   /* Build SF */
2894aca35d17SMatthew G. Knepley   CHKMEMQ;
2895aca35d17SMatthew G. Knepley   {
2896aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
2897aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
2898bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
2899aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
2900bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
290149c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
2902bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
2903aca35d17SMatthew G. Knepley 
2904bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
2905aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
2906aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
2907aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
2908aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
2909aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
2910aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
2911aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
2912dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
2913bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
2914bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
2915bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
2916bdcf2095SMatthew G. Knepley       }
29179e0823b2SMatthew G. Knepley       /* Set subleaves */
2918aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
2919aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2920bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2921aca35d17SMatthew G. Knepley 
2922aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
2923bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
2924bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
2925bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
2926bdcf2095SMatthew G. Knepley         ++numSubLeaves;
2927aca35d17SMatthew G. Knepley       }
29289e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
29299e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
29309e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
29319e0823b2SMatthew G. Knepley 
29329e0823b2SMatthew G. Knepley         if (subPoint < 0) {
29339e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
29349e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
29359e0823b2SMatthew G. Knepley         } else {
29369e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
29379e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
29389e0823b2SMatthew G. Knepley         }
2939bdcf2095SMatthew G. Knepley       }
2940bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2941bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
2942bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2943bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
2944785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
2945785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
294649c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
2947bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
2948bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
2949aca35d17SMatthew G. Knepley 
2950aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
295149c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
2952aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
2953bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
2954bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
2955bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
2956bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
2957aca35d17SMatthew G. Knepley         ++sl;
2958aca35d17SMatthew G. Knepley       }
2959bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
296049c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
296149c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
2962aca35d17SMatthew G. Knepley     }
2963aca35d17SMatthew G. Knepley   }
2964aca35d17SMatthew G. Knepley   CHKMEMQ;
2965766ab985SMatthew G. Knepley   /* Cleanup */
2966766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2967766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2968766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
2969766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2970766ab985SMatthew G. Knepley }
2971766ab985SMatthew G. Knepley 
2972766ab985SMatthew G. Knepley #undef __FUNCT__
2973766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
2974b3154360SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char label[], PetscInt value, DM subdm)
2975766ab985SMatthew G. Knepley {
2976766ab985SMatthew G. Knepley   MPI_Comm         comm;
2977766ab985SMatthew G. Knepley   DMLabel          subpointMap;
2978766ab985SMatthew G. Knepley   IS              *subpointIS;
2979766ab985SMatthew G. Knepley   const PetscInt **subpoints;
2980b1a8e46aSMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
2981766ab985SMatthew G. Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2982766ab985SMatthew G. Knepley   PetscErrorCode   ierr;
2983766ab985SMatthew G. Knepley 
2984766ab985SMatthew G. Knepley   PetscFunctionBegin;
2985766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2986766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2987766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2988766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2989766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
2990b3154360SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);
2991766ab985SMatthew G. Knepley   /* Setup chart */
2992c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2993dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2994766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
2995766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2996766ab985SMatthew G. Knepley     totSubPoints += numSubPoints[d];
2997766ab985SMatthew G. Knepley   }
2998766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2999766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
3000766ab985SMatthew G. Knepley   /* Set cone sizes */
3001766ab985SMatthew G. Knepley   firstSubPoint[dim] = 0;
3002766ab985SMatthew G. Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
3003766ab985SMatthew G. Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
3004766ab985SMatthew G. Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
3005766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3006766ab985SMatthew G. Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
3007b643afeaSMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
3008766ab985SMatthew G. Knepley   }
3009766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3010766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
3011766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
3012766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
3013766ab985SMatthew G. Knepley       const PetscInt *cone;
3014766ab985SMatthew G. Knepley       PetscInt        coneSize, coneSizeNew, c, val;
3015766ab985SMatthew G. Knepley 
3016766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
3017766ab985SMatthew G. Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
3018766ab985SMatthew G. Knepley       if (d == dim) {
3019766ab985SMatthew G. Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
3020766ab985SMatthew G. Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
3021766ab985SMatthew G. Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
3022766ab985SMatthew G. Knepley           if (val >= 0) coneSizeNew++;
3023766ab985SMatthew G. Knepley         }
3024766ab985SMatthew G. Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
3025766ab985SMatthew G. Knepley       }
3026766ab985SMatthew G. Knepley     }
3027766ab985SMatthew G. Knepley   }
3028766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
3029766ab985SMatthew G. Knepley   /* Set cones */
3030766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
3031dcca6d9dSJed Brown   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
3032766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3033766ab985SMatthew G. Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
3034766ab985SMatthew G. Knepley       const PetscInt  point    = subpoints[d][p];
3035766ab985SMatthew G. Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
3036b1a8e46aSMatthew G. Knepley       const PetscInt *cone, *ornt;
3037766ab985SMatthew G. Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
3038766ab985SMatthew G. Knepley 
3039766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
3040766ab985SMatthew G. Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
3041766ab985SMatthew G. Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
3042b1a8e46aSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
3043766ab985SMatthew G. Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
3044766ab985SMatthew G. Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
3045b1a8e46aSMatthew G. Knepley         if (subc >= 0) {
3046b1a8e46aSMatthew G. Knepley           coneNew[coneSizeNew]   = firstSubPoint[d-1] + subc;
3047b1a8e46aSMatthew G. Knepley           orntNew[coneSizeNew++] = ornt[c];
3048b1a8e46aSMatthew G. Knepley         }
3049766ab985SMatthew G. Knepley       }
3050766ab985SMatthew G. Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
3051766ab985SMatthew G. Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
3052b1a8e46aSMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
3053766ab985SMatthew G. Knepley     }
3054766ab985SMatthew G. Knepley   }
3055b1a8e46aSMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
3056766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
3057766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
3058766ab985SMatthew G. Knepley   /* Build coordinates */
3059766ab985SMatthew G. Knepley   {
3060766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
3061766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
3062766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
3063285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
3064766ab985SMatthew G. Knepley 
306569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3066766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
306769d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
3068285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
3069285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
3070285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
3071766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
3072766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
3073766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
3074766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
3075766ab985SMatthew G. Knepley       PetscInt       dof;
3076766ab985SMatthew G. Knepley 
3077766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3078766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
3079285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
3080766ab985SMatthew G. Knepley     }
3081766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
3082766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
3083766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
3084766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
30852eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
3086766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
3087766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3088766ab985SMatthew G. Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
3089766ab985SMatthew G. Knepley       const PetscInt vertex    = subpoints[0][v];
3090766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
3091766ab985SMatthew G. Knepley       PetscInt dof, off, sdof, soff, d;
3092766ab985SMatthew G. Knepley 
3093766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3094766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
3095766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
3096766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
3097766ab985SMatthew 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);
3098766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
3099766ab985SMatthew G. Knepley     }
3100766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
3101766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3102766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
3103766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
3104766ab985SMatthew G. Knepley   }
3105c80a7578SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
3106c80a7578SMatthew G. Knepley   {
3107c80a7578SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
3108251556f3SMatthew G. Knepley     IS                 subpIS;
3109c80a7578SMatthew G. Knepley     const PetscSFNode *remotePoints;
3110c80a7578SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
3111c80a7578SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
3112c80a7578SMatthew G. Knepley     PetscInt          *slocalPoints;
3113f033dbf2SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
3114c80a7578SMatthew G. Knepley     PetscMPIInt        rank;
3115c80a7578SMatthew G. Knepley 
3116c80a7578SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
3117c80a7578SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
3118c80a7578SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
3119c80a7578SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3120c80a7578SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
3121251556f3SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
3122251556f3SMatthew G. Knepley     if (subpIS) {
3123251556f3SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
3124251556f3SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
3125f033dbf2SMatthew G. Knepley     }
3126c80a7578SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3127c80a7578SMatthew G. Knepley     if (numRoots >= 0) {
312882db75e7SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
3129c80a7578SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
3130c80a7578SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
3131c80a7578SMatthew G. Knepley         newLocalPoints[p].index = -2;
3132c80a7578SMatthew G. Knepley       }
3133c80a7578SMatthew G. Knepley       /* Set subleaves */
3134c80a7578SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
3135c80a7578SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3136c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
3137c80a7578SMatthew G. Knepley 
3138c80a7578SMatthew G. Knepley         if (subpoint < 0) continue;
3139c80a7578SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
3140c80a7578SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
3141c80a7578SMatthew G. Knepley         ++numSubleaves;
3142c80a7578SMatthew G. Knepley       }
3143c80a7578SMatthew G. Knepley       /* Must put in owned subpoints */
3144c80a7578SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
3145c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
3146c80a7578SMatthew G. Knepley 
3147c80a7578SMatthew G. Knepley         if (subpoint < 0) {
3148c80a7578SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
3149c80a7578SMatthew G. Knepley           newOwners[p-pStart].index = -3;
3150c80a7578SMatthew G. Knepley         } else {
3151c80a7578SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
3152c80a7578SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
3153c80a7578SMatthew G. Knepley         }
3154c80a7578SMatthew G. Knepley       }
3155c80a7578SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3156c80a7578SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3157c80a7578SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3158c80a7578SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3159*09b7985cSMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr);
3160*09b7985cSMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr);
3161c80a7578SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3162c80a7578SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3163c80a7578SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
3164c80a7578SMatthew G. Knepley 
3165c80a7578SMatthew G. Knepley         if (subpoint < 0) continue;
3166c80a7578SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3167c80a7578SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
3168c80a7578SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3169c80a7578SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3170c80a7578SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3171c80a7578SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3172c80a7578SMatthew G. Knepley         ++sl;
3173c80a7578SMatthew G. Knepley       }
3174c80a7578SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
3175c80a7578SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
3176c80a7578SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3177c80a7578SMatthew G. Knepley     }
3178251556f3SMatthew G. Knepley     if (subpIS) {
3179251556f3SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
3180251556f3SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
3181251556f3SMatthew G. Knepley     }
3182c80a7578SMatthew G. Knepley   }
3183766ab985SMatthew G. Knepley   /* Cleanup */
3184766ab985SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {
3185b643afeaSMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
3186766ab985SMatthew G. Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
3187766ab985SMatthew G. Knepley   }
3188766ab985SMatthew G. Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
3189766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3190766ab985SMatthew G. Knepley }
3191766ab985SMatthew G. Knepley 
3192766ab985SMatthew G. Knepley #undef __FUNCT__
3193766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
3194766ab985SMatthew G. Knepley /*
319527c04023SMatthew 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.
3196766ab985SMatthew G. Knepley 
3197766ab985SMatthew G. Knepley   Input Parameters:
3198766ab985SMatthew G. Knepley + dm          - The original mesh
319927c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
32007afc1a8bSJed Brown . label       - A label name, or NULL
320127c04023SMatthew G. Knepley - value  - A label value
3202766ab985SMatthew G. Knepley 
3203766ab985SMatthew G. Knepley   Output Parameter:
3204766ab985SMatthew G. Knepley . subdm - The surface mesh
3205766ab985SMatthew G. Knepley 
3206766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3207766ab985SMatthew G. Knepley 
3208766ab985SMatthew G. Knepley   Level: developer
3209766ab985SMatthew G. Knepley 
3210766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3211766ab985SMatthew G. Knepley */
321227c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3213766ab985SMatthew G. Knepley {
3214766ab985SMatthew G. Knepley   PetscInt       dim, depth;
3215766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3216766ab985SMatthew G. Knepley 
3217766ab985SMatthew G. Knepley   PetscFunctionBegin;
3218766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
321927c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3220c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3221766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3222766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3223766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3224c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3225766ab985SMatthew G. Knepley   if (depth == dim) {
3226b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3227766ab985SMatthew G. Knepley   } else {
322827c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3229e6ccafaeSMatthew G Knepley   }
3230e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3231e6ccafaeSMatthew G Knepley }
3232e6ccafaeSMatthew G Knepley 
3233e6ccafaeSMatthew G Knepley #undef __FUNCT__
3234e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
323564beef6dSMatthew G. Knepley /*@
323664beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
323764beef6dSMatthew G. Knepley 
323864beef6dSMatthew G. Knepley   Input Parameter:
323964beef6dSMatthew G. Knepley . dm - The submesh DM
324064beef6dSMatthew G. Knepley 
324164beef6dSMatthew G. Knepley   Output Parameter:
324264beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
324364beef6dSMatthew G. Knepley 
324464beef6dSMatthew G. Knepley   Level: developer
324564beef6dSMatthew G. Knepley 
324664beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
324764beef6dSMatthew G. Knepley @*/
3248e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3249e6ccafaeSMatthew G Knepley {
3250e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
3251e6ccafaeSMatthew G Knepley 
3252e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3253e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3254e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
3255e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
3256e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3257e6ccafaeSMatthew G Knepley }
3258e6ccafaeSMatthew G Knepley 
3259e6ccafaeSMatthew G Knepley #undef __FUNCT__
3260e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
3261e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
3262e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3263e6ccafaeSMatthew G Knepley {
3264e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3265285d324eSMatthew G. Knepley   DMLabel        tmp;
3266e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3267e6ccafaeSMatthew G Knepley 
3268e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3269e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3270285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3271e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3272285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3273285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3274e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3275e6ccafaeSMatthew G Knepley }
3276e6ccafaeSMatthew G Knepley 
3277e6ccafaeSMatthew G Knepley #undef __FUNCT__
3278e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
327964beef6dSMatthew G. Knepley /*@
3280e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3281e6ccafaeSMatthew G Knepley 
3282e6ccafaeSMatthew G Knepley   Input Parameter:
3283e6ccafaeSMatthew G Knepley . dm - The submesh DM
3284e6ccafaeSMatthew G Knepley 
3285e6ccafaeSMatthew G Knepley   Output Parameter:
32860298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3287e6ccafaeSMatthew G Knepley 
3288e6ccafaeSMatthew G Knepley   Note: This is IS is guaranteed to be sorted by the construction of the submesh
328964beef6dSMatthew G. Knepley 
329064beef6dSMatthew G. Knepley   Level: developer
329164beef6dSMatthew G. Knepley 
329264beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
329364beef6dSMatthew G. Knepley @*/
3294e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3295e6ccafaeSMatthew G Knepley {
329682f516ccSBarry Smith   MPI_Comm        comm;
3297e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3298e6ccafaeSMatthew G Knepley   IS              is;
3299e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3300e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3301e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3302e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3303e6ccafaeSMatthew G Knepley 
3304e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3305e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3306e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
330782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
33080298fd71SBarry Smith   *subpointIS = NULL;
3309e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3310e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3311fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3312e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3313e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3314e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3315e6ccafaeSMatthew G Knepley     depths[0] = depth;
3316e6ccafaeSMatthew G Knepley     depths[1] = 0;
3317e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3318785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3319e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3320e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3321e6ccafaeSMatthew G Knepley 
3322e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3323e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
33241e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3325e6ccafaeSMatthew 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);
3326e6ccafaeSMatthew G Knepley       } else {
33271e21b6fdSMatthew G Knepley         if (!n) {
33281e21b6fdSMatthew G Knepley           if (d == 0) {
33291e21b6fdSMatthew G Knepley             /* Missing cells */
33301e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
33311e21b6fdSMatthew G Knepley           } else {
33321e21b6fdSMatthew G Knepley             /* Missing faces */
33331e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
33341e21b6fdSMatthew G Knepley           }
33351e21b6fdSMatthew G Knepley         }
3336e6ccafaeSMatthew G Knepley       }
3337e6ccafaeSMatthew G Knepley       if (n) {
3338e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3339e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3340e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3341e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3342e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3343e6ccafaeSMatthew G Knepley       }
3344e6ccafaeSMatthew G Knepley     }
3345e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3346e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3347fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3348e6ccafaeSMatthew G Knepley   }
3349e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3350e6ccafaeSMatthew G Knepley }
3351