xref: /petsc/src/dm/impls/plex/plexsubmesh.c (revision 59eef20bb2b484aab9124e89de55392d8efdf346)
1af0996ceSBarry 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;
12422eabd52SMatthew G. Knepley   PetscInt        numValues, v, cStart, cEnd, cEndInterior;
1256cf0e42fSMatthew G. Knepley   PetscErrorCode  ierr;
1266cf0e42fSMatthew G. Knepley 
1276cf0e42fSMatthew G. Knepley   PetscFunctionBegin;
1286cf0e42fSMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
12922eabd52SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cEndInterior, NULL, NULL, NULL);CHKERRQ(ierr);
13022eabd52SMatthew G. Knepley   cEnd = cEndInterior < 0 ? cEnd : cEndInterior;
1316cf0e42fSMatthew G. Knepley   ierr = DMLabelGetNumValues(label, &numValues);CHKERRQ(ierr);
1326cf0e42fSMatthew G. Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
1336cf0e42fSMatthew G. Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
1346cf0e42fSMatthew G. Knepley   for (v = 0; v < numValues; ++v) {
1356cf0e42fSMatthew G. Knepley     IS              pointIS;
1366cf0e42fSMatthew G. Knepley     const PetscInt *points;
1376cf0e42fSMatthew G. Knepley     PetscInt        numPoints, p;
1386cf0e42fSMatthew G. Knepley 
1396cf0e42fSMatthew G. Knepley     ierr = DMLabelGetStratumSize(label, values[v], &numPoints);CHKERRQ(ierr);
1406cf0e42fSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[v], &pointIS);CHKERRQ(ierr);
1416cf0e42fSMatthew G. Knepley     ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
1426cf0e42fSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1436cf0e42fSMatthew G. Knepley       PetscInt *closure = NULL;
14422eabd52SMatthew G. Knepley       PetscInt  closureSize, point, cl;
1456cf0e42fSMatthew G. Knepley 
1466cf0e42fSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr);
14722eabd52SMatthew G. Knepley       for (cl = closureSize-1; cl > 0; --cl) {
14822eabd52SMatthew G. Knepley         point = closure[cl*2];
14922eabd52SMatthew G. Knepley         if ((point >= cStart) && (point < cEnd)) {ierr = DMLabelSetValue(label, point, values[v]);CHKERRQ(ierr); break;}
15022eabd52SMatthew G. Knepley       }
1516cf0e42fSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &closureSize, &closure);CHKERRQ(ierr);
1526cf0e42fSMatthew G. Knepley     }
1536cf0e42fSMatthew G. Knepley     ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
1546cf0e42fSMatthew G. Knepley     ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
1556cf0e42fSMatthew G. Knepley   }
1566cf0e42fSMatthew G. Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1576cf0e42fSMatthew G. Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1586cf0e42fSMatthew G. Knepley   PetscFunctionReturn(0);
1596cf0e42fSMatthew G. Knepley }
1606cf0e42fSMatthew G. Knepley 
1616cf0e42fSMatthew G. Knepley #undef __FUNCT__
1622582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointSetUp_Internal"
163*59eef20bSToby Isaac /* take (oldEnd, added) pairs, ordered by height and convert them to (oldstart, newstart) pairs, ordered by ascending
164*59eef20bSToby Isaac  * index (skipping first, which is (0,0)) */
1652582d50cSToby Isaac PETSC_STATIC_INLINE PetscErrorCode DMPlexShiftPointSetUp_Internal(PetscInt depth, PetscInt depthShift[])
166cd0c2139SMatthew G Knepley {
1672582d50cSToby Isaac   PetscInt d, off = 0;
1682582d50cSToby Isaac 
1692582d50cSToby Isaac   PetscFunctionBegin;
170*59eef20bSToby Isaac   /* sort by (oldend): yes this is an O(n^2) sort, we expect depth <= 3 */
1712582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
1722582d50cSToby Isaac     PetscInt firstd = d;
1732582d50cSToby Isaac     PetscInt firstStart = depthShift[2*d+1];
1742582d50cSToby Isaac     PetscInt e;
1752582d50cSToby Isaac 
1762582d50cSToby Isaac     for (e = d+1; e <= depth; e++) {
1772582d50cSToby Isaac       if (depthShift[2*e] < firstStart) {
1782582d50cSToby Isaac         firstd = e;
1792582d50cSToby Isaac         firstStart = depthShift[2*d];
1802582d50cSToby Isaac       }
1812582d50cSToby Isaac     }
1822582d50cSToby Isaac     if (firstd != d) {
1832582d50cSToby Isaac       PetscInt swap[2];
1842582d50cSToby Isaac 
1852582d50cSToby Isaac       e = firstd;
1862582d50cSToby Isaac       swap[0] = depthShift[2*d];
1872582d50cSToby Isaac       swap[1] = depthShift[2*d+1];
1882582d50cSToby Isaac       depthShift[2*d]   = depthShift[2*e];
1892582d50cSToby Isaac       depthShift[2*d+1] = depthShift[2*e+1];
1902582d50cSToby Isaac       depthShift[2*e]   = swap[0];
1912582d50cSToby Isaac       depthShift[2*e+1] = swap[1];
1922582d50cSToby Isaac     }
1932582d50cSToby Isaac   }
1942582d50cSToby Isaac   /* convert (oldstart, added) to (oldstart, newstart) */
1952582d50cSToby Isaac   for (d = 0; d < depth; d++) {
1962582d50cSToby Isaac     off += depthShift[2*d+1];
197*59eef20bSToby Isaac     depthShift[2*d+1] = depthShift[2*d] + off;
1982582d50cSToby Isaac   }
1992582d50cSToby Isaac   depthShift[2*depth]   = PETSC_MAX_INT;
2002582d50cSToby Isaac   depthShift[2*depth+1] = PETSC_MAX_INT;
2012582d50cSToby Isaac   PetscFunctionReturn(0);
2022582d50cSToby Isaac }
2032582d50cSToby Isaac 
2042582d50cSToby Isaac #undef __FUNCT__
2052582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPoint_Internal"
2062582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */
2072582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPoint_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[])
2082582d50cSToby Isaac {
2092582d50cSToby Isaac   PetscInt d;
2102582d50cSToby Isaac   PetscInt newOff = 0;
2112582d50cSToby Isaac 
2122582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
2132582d50cSToby Isaac     if (p < depthShift[2*d]) return p + newOff;
2142582d50cSToby Isaac     else newOff = depthShift[2*d+1] - depthShift[2*d];
2152582d50cSToby Isaac   }
2162582d50cSToby Isaac   return p;
2172582d50cSToby Isaac }
2182582d50cSToby Isaac 
2192582d50cSToby Isaac #undef __FUNCT__
2202582d50cSToby Isaac #define __FUNCT__ "DMPlexShiftPointInverse_Internal"
2212582d50cSToby Isaac /* depthShift is a list of (old, new) pairs */
2222582d50cSToby Isaac PETSC_STATIC_INLINE PetscInt DMPlexShiftPointInverse_Internal(PetscInt p, PetscInt depth, PetscInt depthShift[])
2232582d50cSToby Isaac {
2242582d50cSToby Isaac   PetscInt d;
2252582d50cSToby Isaac   PetscInt newOff = 0;
2262582d50cSToby Isaac 
2272582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
2282582d50cSToby Isaac     if (p < depthShift[2*d+1]) return p + newOff;
2292582d50cSToby Isaac     else newOff = depthShift[2*d] - depthShift[2*d+1];
2302582d50cSToby Isaac   }
2312582d50cSToby Isaac   return p;
232cd0c2139SMatthew G Knepley }
233cd0c2139SMatthew G Knepley 
234cd0c2139SMatthew G Knepley #undef __FUNCT__
235cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSizes_Internal"
236cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSizes_Internal(DM dm, PetscInt depthShift[], DM dmNew)
237cd0c2139SMatthew G Knepley {
238cd0c2139SMatthew G Knepley   PetscInt       depth = 0, d, pStart, pEnd, p;
239cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
240cd0c2139SMatthew G Knepley 
241cd0c2139SMatthew G Knepley   PetscFunctionBegin;
242cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
243cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
244cd0c2139SMatthew G Knepley   /* Step 1: Expand chart */
245cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
246cd0c2139SMatthew G Knepley   ierr = DMPlexSetChart(dmNew, pStart, pEnd);CHKERRQ(ierr);
247cd0c2139SMatthew G Knepley   /* Step 2: Set cone and support sizes */
248cd0c2139SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
249cd0c2139SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart, &pEnd);CHKERRQ(ierr);
250cd0c2139SMatthew G Knepley     for (p = pStart; p < pEnd; ++p) {
2512582d50cSToby Isaac       PetscInt newp = DMPlexShiftPoint_Internal(p, depth, depthShift);
252cd0c2139SMatthew G Knepley       PetscInt size;
253cd0c2139SMatthew G Knepley 
254cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
255cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(dmNew, newp, size);CHKERRQ(ierr);
256cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
257cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(dmNew, newp, size);CHKERRQ(ierr);
258cd0c2139SMatthew G Knepley     }
259cd0c2139SMatthew G Knepley   }
260cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
261cd0c2139SMatthew G Knepley }
262cd0c2139SMatthew G Knepley 
263cd0c2139SMatthew G Knepley #undef __FUNCT__
264cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftPoints_Internal"
265cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftPoints_Internal(DM dm, PetscInt depthShift[], DM dmNew)
266cd0c2139SMatthew G Knepley {
2672582d50cSToby Isaac   PetscInt      *newpoints;
2682582d50cSToby Isaac   PetscInt       depth = 0, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, pStart, pEnd, p;
269cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
270cd0c2139SMatthew G Knepley 
271cd0c2139SMatthew G Knepley   PetscFunctionBegin;
272cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
273cd0c2139SMatthew G Knepley   if (depth < 0) PetscFunctionReturn(0);
274cd0c2139SMatthew G Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
275dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dmNew, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
2762582d50cSToby Isaac   ierr = PetscMalloc1(PetscMax(PetscMax(maxConeSize, maxSupportSize), PetscMax(maxConeSizeNew, maxSupportSizeNew)),&newpoints);CHKERRQ(ierr);
277cd0c2139SMatthew G Knepley   /* Step 5: Set cones and supports */
278cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
279cd0c2139SMatthew G Knepley   for (p = pStart; p < pEnd; ++p) {
280cd0c2139SMatthew G Knepley     const PetscInt *points = NULL, *orientations = NULL;
2812582d50cSToby Isaac     PetscInt        size,sizeNew, i, newp = DMPlexShiftPoint_Internal(p, depth, depthShift);
282cd0c2139SMatthew G Knepley 
283cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeSize(dm, p, &size);CHKERRQ(ierr);
284cd0c2139SMatthew G Knepley     ierr = DMPlexGetCone(dm, p, &points);CHKERRQ(ierr);
285cd0c2139SMatthew G Knepley     ierr = DMPlexGetConeOrientation(dm, p, &orientations);CHKERRQ(ierr);
286cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
2872582d50cSToby Isaac       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift);
288cd0c2139SMatthew G Knepley     }
289cd0c2139SMatthew G Knepley     ierr = DMPlexSetCone(dmNew, newp, newpoints);CHKERRQ(ierr);
290cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeOrientation(dmNew, newp, orientations);CHKERRQ(ierr);
291cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, p, &size);CHKERRQ(ierr);
292dcbb62e8SMatthew G. Knepley     ierr = DMPlexGetSupportSize(dmNew, newp, &sizeNew);CHKERRQ(ierr);
293cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, p, &points);CHKERRQ(ierr);
294cd0c2139SMatthew G Knepley     for (i = 0; i < size; ++i) {
2952582d50cSToby Isaac       newpoints[i] = DMPlexShiftPoint_Internal(points[i], depth, depthShift);
296cd0c2139SMatthew G Knepley     }
297dcbb62e8SMatthew G. Knepley     for (i = size; i < sizeNew; ++i) newpoints[i] = 0;
298cd0c2139SMatthew G Knepley     ierr = DMPlexSetSupport(dmNew, newp, newpoints);CHKERRQ(ierr);
299cd0c2139SMatthew G Knepley   }
3002582d50cSToby Isaac   ierr = PetscFree(newpoints);CHKERRQ(ierr);
301cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
302cd0c2139SMatthew G Knepley }
303cd0c2139SMatthew G Knepley 
304cd0c2139SMatthew G Knepley #undef __FUNCT__
305cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftCoordinates_Internal"
306cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftCoordinates_Internal(DM dm, PetscInt depthShift[], DM dmNew)
307cd0c2139SMatthew G Knepley {
308cd0c2139SMatthew G Knepley   PetscSection   coordSection, newCoordSection;
309cd0c2139SMatthew G Knepley   Vec            coordinates, newCoordinates;
310cd0c2139SMatthew G Knepley   PetscScalar   *coords, *newCoords;
3112582d50cSToby Isaac   PetscInt       coordSize;
3122582d50cSToby Isaac   PetscInt       dim, depth = 0, vStart, vEnd, vStartNew, vEndNew, v;
313cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
314cd0c2139SMatthew G Knepley 
315cd0c2139SMatthew G Knepley   PetscFunctionBegin;
316c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
317cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
318cd0c2139SMatthew G Knepley   /* Step 8: Convert coordinates */
319cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
320cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dmNew, 0, &vStartNew, &vEndNew);CHKERRQ(ierr);
32169d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
322cd0c2139SMatthew G Knepley   ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dm), &newCoordSection);CHKERRQ(ierr);
323cd0c2139SMatthew G Knepley   ierr = PetscSectionSetNumFields(newCoordSection, 1);CHKERRQ(ierr);
324cd0c2139SMatthew G Knepley   ierr = PetscSectionSetFieldComponents(newCoordSection, 0, dim);CHKERRQ(ierr);
325cd0c2139SMatthew G Knepley   ierr = PetscSectionSetChart(newCoordSection, vStartNew, vEndNew);CHKERRQ(ierr);
326cd0c2139SMatthew G Knepley   for (v = vStartNew; v < vEndNew; ++v) {
327cd0c2139SMatthew G Knepley     ierr = PetscSectionSetDof(newCoordSection, v, dim);CHKERRQ(ierr);
328cd0c2139SMatthew G Knepley     ierr = PetscSectionSetFieldDof(newCoordSection, v, 0, dim);CHKERRQ(ierr);
329cd0c2139SMatthew G Knepley   }
330cd0c2139SMatthew G Knepley   ierr = PetscSectionSetUp(newCoordSection);CHKERRQ(ierr);
33146e270d4SMatthew G. Knepley   ierr = DMSetCoordinateSection(dmNew, PETSC_DETERMINE, newCoordSection);CHKERRQ(ierr);
332cd0c2139SMatthew G Knepley   ierr = PetscSectionGetStorageSize(newCoordSection, &coordSize);CHKERRQ(ierr);
333cd0c2139SMatthew G Knepley   ierr = VecCreate(PetscObjectComm((PetscObject)dm), &newCoordinates);CHKERRQ(ierr);
334cd0c2139SMatthew G Knepley   ierr = PetscObjectSetName((PetscObject) newCoordinates, "coordinates");CHKERRQ(ierr);
335cd0c2139SMatthew G Knepley   ierr = VecSetSizes(newCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
3364e90ef8eSMatthew G. Knepley   ierr = VecSetBlockSize(newCoordinates, dim);CHKERRQ(ierr);
3372eb5907fSJed Brown   ierr = VecSetType(newCoordinates,VECSTANDARD);CHKERRQ(ierr);
338cd0c2139SMatthew G Knepley   ierr = DMSetCoordinatesLocal(dmNew, newCoordinates);CHKERRQ(ierr);
339cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
340cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
341cd0c2139SMatthew G Knepley   ierr = VecGetArray(newCoordinates, &newCoords);CHKERRQ(ierr);
342cd0c2139SMatthew G Knepley   for (v = vStart; v < vEnd; ++v) {
343cd0c2139SMatthew G Knepley     PetscInt dof, off, noff, d;
344cd0c2139SMatthew G Knepley 
345cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, v, &dof);CHKERRQ(ierr);
346cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, v, &off);CHKERRQ(ierr);
3472582d50cSToby Isaac     ierr = PetscSectionGetOffset(newCoordSection, DMPlexShiftPoint_Internal(v, depth, depthShift), &noff);CHKERRQ(ierr);
348cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) {
349cd0c2139SMatthew G Knepley       newCoords[noff+d] = coords[off+d];
350cd0c2139SMatthew G Knepley     }
351cd0c2139SMatthew G Knepley   }
352cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
353cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(newCoordinates, &newCoords);CHKERRQ(ierr);
354cd0c2139SMatthew G Knepley   ierr = VecDestroy(&newCoordinates);CHKERRQ(ierr);
355cd0c2139SMatthew G Knepley   ierr = PetscSectionDestroy(&newCoordSection);CHKERRQ(ierr);
356cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
357cd0c2139SMatthew G Knepley }
358cd0c2139SMatthew G Knepley 
359cd0c2139SMatthew G Knepley #undef __FUNCT__
360cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftSF_Internal"
361cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftSF_Internal(DM dm, PetscInt depthShift[], DM dmNew)
362cd0c2139SMatthew G Knepley {
3632582d50cSToby Isaac   PetscInt           depth = 0;
364cd0c2139SMatthew G Knepley   PetscSF            sfPoint, sfPointNew;
365cd0c2139SMatthew G Knepley   const PetscSFNode *remotePoints;
366cd0c2139SMatthew G Knepley   PetscSFNode       *gremotePoints;
367cd0c2139SMatthew G Knepley   const PetscInt    *localPoints;
368cd0c2139SMatthew G Knepley   PetscInt          *glocalPoints, *newLocation, *newRemoteLocation;
369cd0c2139SMatthew G Knepley   PetscInt           numRoots, numLeaves, l, pStart, pEnd, totShift = 0;
370cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
371cd0c2139SMatthew G Knepley 
372cd0c2139SMatthew G Knepley   PetscFunctionBegin;
373cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
374cd0c2139SMatthew G Knepley   /* Step 9: Convert pointSF */
375cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
376cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dmNew, &sfPointNew);CHKERRQ(ierr);
377cd0c2139SMatthew G Knepley   ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
378cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
379cd0c2139SMatthew G Knepley   if (numRoots >= 0) {
380dcca6d9dSJed Brown     ierr = PetscMalloc2(numRoots,&newLocation,pEnd-pStart,&newRemoteLocation);CHKERRQ(ierr);
3812582d50cSToby Isaac     for (l=0; l<numRoots; l++) newLocation[l] = DMPlexShiftPoint_Internal(l, depth, depthShift);
382cd0c2139SMatthew G Knepley     ierr = PetscSFBcastBegin(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
383cd0c2139SMatthew G Knepley     ierr = PetscSFBcastEnd(sfPoint, MPIU_INT, newLocation, newRemoteLocation);CHKERRQ(ierr);
384785e854fSJed Brown     ierr = PetscMalloc1(numLeaves,    &glocalPoints);CHKERRQ(ierr);
385785e854fSJed Brown     ierr = PetscMalloc1(numLeaves, &gremotePoints);CHKERRQ(ierr);
386cd0c2139SMatthew G Knepley     for (l = 0; l < numLeaves; ++l) {
3872582d50cSToby Isaac       glocalPoints[l]        = DMPlexShiftPoint_Internal(localPoints[l], depth, depthShift);
388cd0c2139SMatthew G Knepley       gremotePoints[l].rank  = remotePoints[l].rank;
389cd0c2139SMatthew G Knepley       gremotePoints[l].index = newRemoteLocation[localPoints[l]];
390cd0c2139SMatthew G Knepley     }
391cd0c2139SMatthew G Knepley     ierr = PetscFree2(newLocation,newRemoteLocation);CHKERRQ(ierr);
392cd0c2139SMatthew G Knepley     ierr = PetscSFSetGraph(sfPointNew, numRoots + totShift, numLeaves, glocalPoints, PETSC_OWN_POINTER, gremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
393cd0c2139SMatthew G Knepley   }
394cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
395cd0c2139SMatthew G Knepley }
396cd0c2139SMatthew G Knepley 
397cd0c2139SMatthew G Knepley #undef __FUNCT__
398cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexShiftLabels_Internal"
399cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexShiftLabels_Internal(DM dm, PetscInt depthShift[], DM dmNew)
400cd0c2139SMatthew G Knepley {
401cd0c2139SMatthew G Knepley   PetscSF            sfPoint;
402cd0c2139SMatthew G Knepley   DMLabel            vtkLabel, ghostLabel;
403cd0c2139SMatthew G Knepley   const PetscSFNode *leafRemote;
404cd0c2139SMatthew G Knepley   const PetscInt    *leafLocal;
4052582d50cSToby Isaac   PetscInt           depth = 0, numLeaves, numLabels, l, cStart, cEnd, c, fStart, fEnd, f;
406cd0c2139SMatthew G Knepley   PetscMPIInt        rank;
407cd0c2139SMatthew G Knepley   PetscErrorCode     ierr;
408cd0c2139SMatthew G Knepley 
409cd0c2139SMatthew G Knepley   PetscFunctionBegin;
410cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
411cd0c2139SMatthew G Knepley   /* Step 10: Convert labels */
412cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(dm, &numLabels);CHKERRQ(ierr);
413cd0c2139SMatthew G Knepley   for (l = 0; l < numLabels; ++l) {
414cd0c2139SMatthew G Knepley     DMLabel         label, newlabel;
415cd0c2139SMatthew G Knepley     const char     *lname;
416cd0c2139SMatthew G Knepley     PetscBool       isDepth;
417cd0c2139SMatthew G Knepley     IS              valueIS;
418cd0c2139SMatthew G Knepley     const PetscInt *values;
419cd0c2139SMatthew G Knepley     PetscInt        numValues, val;
420cd0c2139SMatthew G Knepley 
421cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabelName(dm, l, &lname);CHKERRQ(ierr);
422cd0c2139SMatthew G Knepley     ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
423cd0c2139SMatthew G Knepley     if (isDepth) continue;
424cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dmNew, lname);CHKERRQ(ierr);
425cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, lname, &label);CHKERRQ(ierr);
426cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dmNew, lname, &newlabel);CHKERRQ(ierr);
427cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
428cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numValues);CHKERRQ(ierr);
429cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
430cd0c2139SMatthew G Knepley     for (val = 0; val < numValues; ++val) {
431cd0c2139SMatthew G Knepley       IS              pointIS;
432cd0c2139SMatthew G Knepley       const PetscInt *points;
433cd0c2139SMatthew G Knepley       PetscInt        numPoints, p;
434cd0c2139SMatthew G Knepley 
435cd0c2139SMatthew G Knepley       ierr = DMLabelGetStratumIS(label, values[val], &pointIS);CHKERRQ(ierr);
436cd0c2139SMatthew G Knepley       ierr = ISGetLocalSize(pointIS, &numPoints);CHKERRQ(ierr);
437cd0c2139SMatthew G Knepley       ierr = ISGetIndices(pointIS, &points);CHKERRQ(ierr);
438cd0c2139SMatthew G Knepley       for (p = 0; p < numPoints; ++p) {
4392582d50cSToby Isaac         const PetscInt newpoint = DMPlexShiftPoint_Internal(points[p], depth, depthShift);
440cd0c2139SMatthew G Knepley 
441cd0c2139SMatthew G Knepley         ierr = DMLabelSetValue(newlabel, newpoint, values[val]);CHKERRQ(ierr);
442cd0c2139SMatthew G Knepley       }
443cd0c2139SMatthew G Knepley       ierr = ISRestoreIndices(pointIS, &points);CHKERRQ(ierr);
444cd0c2139SMatthew G Knepley       ierr = ISDestroy(&pointIS);CHKERRQ(ierr);
445cd0c2139SMatthew G Knepley     }
446cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
447cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
448cd0c2139SMatthew G Knepley   }
449cd0c2139SMatthew G Knepley   /* Step 11: Make label for output (vtk) and to mark ghost points (ghost) */
450cd0c2139SMatthew G Knepley   ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)dm), &rank);CHKERRQ(ierr);
451cd0c2139SMatthew G Knepley   ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
452cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
453cd0c2139SMatthew G Knepley   ierr = PetscSFGetGraph(sfPoint, NULL, &numLeaves, &leafLocal, &leafRemote);CHKERRQ(ierr);
454cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "vtk");CHKERRQ(ierr);
455cd0c2139SMatthew G Knepley   ierr = DMPlexCreateLabel(dmNew, "ghost");CHKERRQ(ierr);
456cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "vtk", &vtkLabel);CHKERRQ(ierr);
457cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dmNew, "ghost", &ghostLabel);CHKERRQ(ierr);
458cd0c2139SMatthew G Knepley   for (l = 0, c = cStart; l < numLeaves && c < cEnd; ++l, ++c) {
459cd0c2139SMatthew G Knepley     for (; c < leafLocal[l] && c < cEnd; ++c) {
460cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
461cd0c2139SMatthew G Knepley     }
462cd0c2139SMatthew G Knepley     if (leafLocal[l] >= cEnd) break;
463cd0c2139SMatthew G Knepley     if (leafRemote[l].rank == rank) {
464cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
465cd0c2139SMatthew G Knepley     } else {
466cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, c, 2);CHKERRQ(ierr);
467cd0c2139SMatthew G Knepley     }
468cd0c2139SMatthew G Knepley   }
469cd0c2139SMatthew G Knepley   for (; c < cEnd; ++c) {
470cd0c2139SMatthew G Knepley     ierr = DMLabelSetValue(vtkLabel, c, 1);CHKERRQ(ierr);
471cd0c2139SMatthew G Knepley   }
472cd0c2139SMatthew G Knepley   if (0) {
473cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
474cd0c2139SMatthew G Knepley     ierr = DMLabelView(vtkLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
475cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
476cd0c2139SMatthew G Knepley   }
477cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dmNew, 1, &fStart, &fEnd);CHKERRQ(ierr);
478cd0c2139SMatthew G Knepley   for (f = fStart; f < fEnd; ++f) {
479cd0c2139SMatthew G Knepley     PetscInt numCells;
480cd0c2139SMatthew G Knepley 
481cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dmNew, f, &numCells);CHKERRQ(ierr);
482cd0c2139SMatthew G Knepley     if (numCells < 2) {
483cd0c2139SMatthew G Knepley       ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);
484cd0c2139SMatthew G Knepley     } else {
485cd0c2139SMatthew G Knepley       const PetscInt *cells = NULL;
486cd0c2139SMatthew G Knepley       PetscInt        vA, vB;
487cd0c2139SMatthew G Knepley 
488cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dmNew, f, &cells);CHKERRQ(ierr);
489cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[0], &vA);CHKERRQ(ierr);
490cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(vtkLabel, cells[1], &vB);CHKERRQ(ierr);
491cd0c2139SMatthew G Knepley       if (!vA && !vB) {ierr = DMLabelSetValue(ghostLabel, f, 1);CHKERRQ(ierr);}
492cd0c2139SMatthew G Knepley     }
493cd0c2139SMatthew G Knepley   }
494cd0c2139SMatthew G Knepley   if (0) {
495cd0c2139SMatthew G Knepley     ierr = PetscViewerASCIISynchronizedAllow(PETSC_VIEWER_STDOUT_WORLD, PETSC_TRUE);CHKERRQ(ierr);
496cd0c2139SMatthew G Knepley     ierr = DMLabelView(ghostLabel, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
497cd0c2139SMatthew G Knepley     ierr = PetscViewerFlush(PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr);
498cd0c2139SMatthew G Knepley   }
499cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
500cd0c2139SMatthew G Knepley }
501cd0c2139SMatthew G Knepley 
502cd0c2139SMatthew G Knepley #undef __FUNCT__
503ca04dac2SToby Isaac #define __FUNCT__ "DMPlexShiftTree_Internal"
504ca04dac2SToby Isaac static PetscErrorCode DMPlexShiftTree_Internal(DM dm, PetscInt depthShift[], DM dmNew)
505ca04dac2SToby Isaac {
506ca04dac2SToby Isaac   DM             refTree;
507ca04dac2SToby Isaac   PetscSection   pSec;
508ca04dac2SToby Isaac   PetscInt       *parents, *childIDs;
509ca04dac2SToby Isaac   PetscErrorCode ierr;
510ca04dac2SToby Isaac 
511ca04dac2SToby Isaac   PetscFunctionBegin;
512ca04dac2SToby Isaac   ierr = DMPlexGetReferenceTree(dm,&refTree);CHKERRQ(ierr);
513ca04dac2SToby Isaac   ierr = DMPlexSetReferenceTree(dmNew,refTree);CHKERRQ(ierr);
514ca04dac2SToby Isaac   ierr = DMPlexGetTree(dm,&pSec,&parents,&childIDs,NULL,NULL);CHKERRQ(ierr);
515ca04dac2SToby Isaac   if (pSec) {
5162582d50cSToby Isaac     PetscInt p, pStart, pEnd, *parentsShifted, pStartShifted, pEndShifted, depth;
517ca04dac2SToby Isaac     PetscSection pSecShifted;
518ca04dac2SToby Isaac 
519ca04dac2SToby Isaac     ierr = PetscSectionGetChart(pSec,&pStart,&pEnd);CHKERRQ(ierr);
520ca04dac2SToby Isaac     ierr = DMPlexGetDepth(dm,&depth);CHKERRQ(ierr);
5212582d50cSToby Isaac     pStartShifted = DMPlexShiftPoint_Internal(pStart,depth,depthShift);
5222582d50cSToby Isaac     pEndShifted   = DMPlexShiftPoint_Internal(pEnd,depth,depthShift);
523ca04dac2SToby Isaac     ierr = PetscMalloc1(pEndShifted - pStartShifted,&parentsShifted);CHKERRQ(ierr);
524ca04dac2SToby Isaac     ierr = PetscSectionCreate(PetscObjectComm((PetscObject)dmNew),&pSecShifted);CHKERRQ(ierr);
525ca04dac2SToby Isaac     ierr = PetscSectionSetChart(pSecShifted,pStartShifted,pEndShifted);CHKERRQ(ierr);
526ca04dac2SToby Isaac     for (p = 0; p < pEndShifted - pStartShifted; p++) {
5272582d50cSToby Isaac       parentsShifted[p] = DMPlexShiftPoint_Internal(parents[p],depth,depthShift);
528ca04dac2SToby Isaac     }
529ca04dac2SToby Isaac     for (p = pStartShifted; p < pEndShifted; p++) {
530ca04dac2SToby Isaac       PetscInt dof, pShifted;
531ca04dac2SToby Isaac 
5322582d50cSToby Isaac       pShifted = DMPlexShiftPoint_Internal(parents[p],depth,depthShift);
533ca04dac2SToby Isaac       ierr = PetscSectionGetDof(pSec,p,&dof);CHKERRQ(ierr);
534ca04dac2SToby Isaac       ierr = PetscSectionSetDof(pSecShifted,pShifted,dof);CHKERRQ(ierr);
535ca04dac2SToby Isaac     }
536ca04dac2SToby Isaac     ierr = PetscSectionSetUp(pSecShifted);CHKERRQ(ierr);
537ca04dac2SToby Isaac     ierr = DMPlexSetTree(dmNew,pSecShifted,parentsShifted,childIDs);CHKERRQ(ierr);
538ca04dac2SToby Isaac   }
539ca04dac2SToby Isaac   PetscFunctionReturn(0);
540ca04dac2SToby Isaac }
541ca04dac2SToby Isaac 
542ca04dac2SToby Isaac #undef __FUNCT__
543cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells_Internal"
544cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructGhostCells_Internal(DM dm, DMLabel label, PetscInt *numGhostCells, DM gdm)
545cd0c2139SMatthew G Knepley {
546da97024aSMatthew G. Knepley   PetscSF         sf;
547cd0c2139SMatthew G Knepley   IS              valueIS;
548da97024aSMatthew G. Knepley   const PetscInt *values, *leaves;
549cd0c2139SMatthew G Knepley   PetscInt       *depthShift;
5502582d50cSToby Isaac   PetscInt        d, depth = 0, nleaves, loc, Ng, numFS, fs, fStart, fEnd, ghostCell, cEnd, c;
551cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
552cd0c2139SMatthew G Knepley 
553cd0c2139SMatthew G Knepley   PetscFunctionBegin;
554da97024aSMatthew G. Knepley   ierr = DMGetPointSF(dm, &sf);CHKERRQ(ierr);
555da97024aSMatthew G. Knepley   ierr = PetscSFGetGraph(sf, NULL, &nleaves, &leaves, NULL);CHKERRQ(ierr);
556da97024aSMatthew G. Knepley   nleaves = PetscMax(0, nleaves);
55746c796b9SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
558cd0c2139SMatthew G Knepley   /* Count ghost cells */
559cd0c2139SMatthew G Knepley   ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
560cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(valueIS, &numFS);CHKERRQ(ierr);
561cd0c2139SMatthew G Knepley   ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
5624a6cfa73SMatthew G. Knepley   Ng   = 0;
563cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
56446c796b9SMatthew G. Knepley     IS              faceIS;
56546c796b9SMatthew G. Knepley     const PetscInt *faces;
56646c796b9SMatthew G. Knepley     PetscInt        numFaces, f, numBdFaces = 0;
567cd0c2139SMatthew G Knepley 
56846c796b9SMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
56946c796b9SMatthew G. Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
57046c796b9SMatthew G. Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
57146c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
572ca04dac2SToby Isaac       PetscInt numChildren;
573ca04dac2SToby Isaac 
574da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
575ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
576ca04dac2SToby Isaac       /* non-local and ancestors points don't get to register ghosts */
577ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
57846c796b9SMatthew G. Knepley       if ((faces[f] >= fStart) && (faces[f] < fEnd)) ++numBdFaces;
57946c796b9SMatthew G. Knepley     }
5804a6cfa73SMatthew G. Knepley     Ng += numBdFaces;
58146c796b9SMatthew G. Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
582cd0c2139SMatthew G Knepley   }
583cd0c2139SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
5842582d50cSToby Isaac   ierr = PetscMalloc1(2*(depth+1), &depthShift);CHKERRQ(ierr);
5852582d50cSToby Isaac   for (d = 0; d <= depth; d++) {
586*59eef20bSToby Isaac     PetscInt dEnd;
5872582d50cSToby Isaac 
588*59eef20bSToby Isaac     ierr = DMPlexGetDepthStratum(dm,d,&dEnd,NULL);CHKERRQ(ierr);
589*59eef20bSToby Isaac     depthShift[2*d]   = dEnd;
5902582d50cSToby Isaac     depthShift[2*d+1] = 0;
5912582d50cSToby Isaac   }
5922582d50cSToby Isaac   if (depth >= 0) depthShift[2*depth+1] = Ng;
5932582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);CHKERRQ(ierr);
594cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
595cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
596cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
5975acea1aeSMatthew G. Knepley   ierr = DMPlexSetHybridBounds(gdm, cEnd, PETSC_DETERMINE, PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr);
5984a6cfa73SMatthew G. Knepley   for (c = cEnd; c < cEnd + Ng; ++c) {
599cd0c2139SMatthew G Knepley     ierr = DMPlexSetConeSize(gdm, c, 1);CHKERRQ(ierr);
600cd0c2139SMatthew G Knepley   }
601cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
602cd0c2139SMatthew G Knepley     IS              faceIS;
603cd0c2139SMatthew G Knepley     const PetscInt *faces;
604cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
605cd0c2139SMatthew G Knepley 
606cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
607cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
608cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
609cd0c2139SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
610ca04dac2SToby Isaac       PetscInt size, numChildren;
611cd0c2139SMatthew G Knepley 
612da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
613ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
614ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
61546c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
616cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, faces[f], &size);CHKERRQ(ierr);
617cd0c2139SMatthew 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);
6184a6cfa73SMatthew G. Knepley       ierr = DMPlexSetSupportSize(gdm, faces[f] + Ng, 2);CHKERRQ(ierr);
619cd0c2139SMatthew G Knepley     }
620cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
621cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
622cd0c2139SMatthew G Knepley   }
623cd0c2139SMatthew G Knepley   /* Step 4: Setup ghosted DM */
624cd0c2139SMatthew G Knepley   ierr = DMSetUp(gdm);CHKERRQ(ierr);
625cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
626cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
627cd0c2139SMatthew G Knepley   ghostCell = cEnd;
628cd0c2139SMatthew G Knepley   for (fs = 0; fs < numFS; ++fs) {
629cd0c2139SMatthew G Knepley     IS              faceIS;
630cd0c2139SMatthew G Knepley     const PetscInt *faces;
631cd0c2139SMatthew G Knepley     PetscInt        numFaces, f;
632cd0c2139SMatthew G Knepley 
633cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, values[fs], &faceIS);CHKERRQ(ierr);
634cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(faceIS, &numFaces);CHKERRQ(ierr);
635cd0c2139SMatthew G Knepley     ierr = ISGetIndices(faceIS, &faces);CHKERRQ(ierr);
63646c796b9SMatthew G. Knepley     for (f = 0; f < numFaces; ++f) {
637ca04dac2SToby Isaac       PetscInt newFace = faces[f] + Ng, numChildren;
638cd0c2139SMatthew G Knepley 
639da97024aSMatthew G. Knepley       ierr = PetscFindInt(faces[f], nleaves, leaves, &loc);CHKERRQ(ierr);
640ca04dac2SToby Isaac       ierr = DMPlexGetTreeChildren(dm,faces[f],&numChildren,NULL);CHKERRQ(ierr);
641ca04dac2SToby Isaac       if (loc >= 0 || numChildren) continue;
64246c796b9SMatthew G. Knepley       if ((faces[f] < fStart) || (faces[f] >= fEnd)) continue;
643cd0c2139SMatthew G Knepley       ierr = DMPlexSetCone(gdm, ghostCell, &newFace);CHKERRQ(ierr);
644cd0c2139SMatthew G Knepley       ierr = DMPlexInsertSupport(gdm, newFace, 1, ghostCell);CHKERRQ(ierr);
64546c796b9SMatthew G. Knepley       ++ghostCell;
646cd0c2139SMatthew G Knepley     }
647cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(faceIS, &faces);CHKERRQ(ierr);
648cd0c2139SMatthew G Knepley     ierr = ISDestroy(&faceIS);CHKERRQ(ierr);
649cd0c2139SMatthew G Knepley   }
650cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
651cd0c2139SMatthew G Knepley   ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
652cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
653cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(gdm);CHKERRQ(ierr);
654cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
655cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
656cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
657ca04dac2SToby Isaac   ierr = DMPlexShiftTree_Internal(dm, depthShift, gdm);CHKERRQ(ierr);
658cd0c2139SMatthew G Knepley   ierr = PetscFree(depthShift);CHKERRQ(ierr);
659966c7b3fSMatthew G. Knepley   /* Step 7: Periodicity */
660966c7b3fSMatthew G. Knepley   if (dm->maxCell) {
661966c7b3fSMatthew G. Knepley     const PetscReal *maxCell, *L;
6625dc8c3f7SMatthew G. Knepley     const DMBoundaryType *bd;
6635dc8c3f7SMatthew G. Knepley     ierr = DMGetPeriodicity(dm,  &maxCell, &L, &bd);CHKERRQ(ierr);
6645dc8c3f7SMatthew G. Knepley     ierr = DMSetPeriodicity(gdm,  maxCell,  L,  bd);CHKERRQ(ierr);
665966c7b3fSMatthew G. Knepley   }
6664a6cfa73SMatthew G. Knepley   if (numGhostCells) *numGhostCells = Ng;
667cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
668cd0c2139SMatthew G Knepley }
669cd0c2139SMatthew G Knepley 
670cd0c2139SMatthew G Knepley #undef __FUNCT__
671cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructGhostCells"
672cd0c2139SMatthew G Knepley /*@C
673cd0c2139SMatthew G Knepley   DMPlexConstructGhostCells - Construct ghost cells which connect to every boundary face
674cd0c2139SMatthew G Knepley 
675cd0c2139SMatthew G Knepley   Collective on dm
676cd0c2139SMatthew G Knepley 
677cd0c2139SMatthew G Knepley   Input Parameters:
678cd0c2139SMatthew G Knepley + dm - The original DM
679cd0c2139SMatthew G Knepley - labelName - The label specifying the boundary faces, or "Face Sets" if this is NULL
680cd0c2139SMatthew G Knepley 
681cd0c2139SMatthew G Knepley   Output Parameters:
682cd0c2139SMatthew G Knepley + numGhostCells - The number of ghost cells added to the DM
683cd0c2139SMatthew G Knepley - dmGhosted - The new DM
684cd0c2139SMatthew G Knepley 
685cd0c2139SMatthew G Knepley   Note: If no label exists of that name, one will be created marking all boundary faces
686cd0c2139SMatthew G Knepley 
687cd0c2139SMatthew G Knepley   Level: developer
688cd0c2139SMatthew G Knepley 
689cd0c2139SMatthew G Knepley .seealso: DMCreate()
69031266bc0SMatthew G. Knepley @*/
691cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructGhostCells(DM dm, const char labelName[], PetscInt *numGhostCells, DM *dmGhosted)
692cd0c2139SMatthew G Knepley {
693cd0c2139SMatthew G Knepley   DM             gdm;
694cd0c2139SMatthew G Knepley   DMLabel        label;
695cd0c2139SMatthew G Knepley   const char    *name = labelName ? labelName : "Face Sets";
696cd0c2139SMatthew G Knepley   PetscInt       dim;
697a42b08eeSMatthew G. Knepley   PetscBool      flag;
698cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
699cd0c2139SMatthew G Knepley 
700cd0c2139SMatthew G Knepley   PetscFunctionBegin;
701cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
7024a6cfa73SMatthew G. Knepley   if (numGhostCells) PetscValidPointer(numGhostCells, 3);
703cd0c2139SMatthew G Knepley   PetscValidPointer(dmGhosted, 4);
704cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &gdm);CHKERRQ(ierr);
705cd0c2139SMatthew G Knepley   ierr = DMSetType(gdm, DMPLEX);CHKERRQ(ierr);
706c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
707c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(gdm, dim);CHKERRQ(ierr);
708a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseCone(dm, &flag);CHKERRQ(ierr);
709a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseCone(gdm, flag);CHKERRQ(ierr);
710a42b08eeSMatthew G. Knepley   ierr = DMPlexGetAdjacencyUseClosure(dm, &flag);CHKERRQ(ierr);
711a42b08eeSMatthew G. Knepley   ierr = DMPlexSetAdjacencyUseClosure(gdm, flag);CHKERRQ(ierr);
712cd0c2139SMatthew G Knepley   ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
713cd0c2139SMatthew G Knepley   if (!label) {
714cd0c2139SMatthew G Knepley     /* Get label for boundary faces */
715cd0c2139SMatthew G Knepley     ierr = DMPlexCreateLabel(dm, name);CHKERRQ(ierr);
716cd0c2139SMatthew G Knepley     ierr = DMPlexGetLabel(dm, name, &label);CHKERRQ(ierr);
717cd0c2139SMatthew G Knepley     ierr = DMPlexMarkBoundaryFaces(dm, label);CHKERRQ(ierr);
718cd0c2139SMatthew G Knepley   }
719cd0c2139SMatthew G Knepley   ierr = DMPlexConstructGhostCells_Internal(dm, label, numGhostCells, gdm);CHKERRQ(ierr);
7208e136ac0SMatthew G. Knepley   ierr = DMPlexCopyBoundary(dm, gdm);CHKERRQ(ierr);
721cd0c2139SMatthew G Knepley   *dmGhosted = gdm;
722cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
723cd0c2139SMatthew G Knepley }
724cd0c2139SMatthew G Knepley 
725cd0c2139SMatthew G Knepley #undef __FUNCT__
726cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells_Internal"
727607ab7a9SMatthew G. Knepley /*
728faedd622SMatthew G. Knepley   We are adding three kinds of points here:
729607ab7a9SMatthew G. Knepley     Replicated:     Copies of points which exist in the mesh, such as vertices identified across a fault
730faedd622SMatthew G. Knepley     Non-replicated: Points which exist on the fault, but are not replicated
731607ab7a9SMatthew G. Knepley     Hybrid:         Entirely new points, such as cohesive cells
732a6ae58d1SMatthew G. Knepley 
733a6ae58d1SMatthew G. Knepley   When creating subsequent cohesive cells, we shift the old hybrid cells to the end of the numbering at
734a6ae58d1SMatthew G. Knepley   each depth so that the new split/hybrid points can be inserted as a block.
735607ab7a9SMatthew G. Knepley */
736cd0c2139SMatthew G Knepley static PetscErrorCode DMPlexConstructCohesiveCells_Internal(DM dm, DMLabel label, DM sdm)
737cd0c2139SMatthew G Knepley {
738cd0c2139SMatthew G Knepley   MPI_Comm         comm;
739607ab7a9SMatthew G. Knepley   IS               valueIS;
740607ab7a9SMatthew G. Knepley   PetscInt         numSP = 0;       /* The number of depths for which we have replicated points */
741607ab7a9SMatthew G. Knepley   const PetscInt  *values;          /* List of depths for which we have replicated points */
74218c5995bSMatthew G. Knepley   IS              *splitIS;
74318c5995bSMatthew G. Knepley   IS              *unsplitIS;
744607ab7a9SMatthew G. Knepley   PetscInt        *numSplitPoints;     /* The number of replicated points at each depth */
74518c5995bSMatthew G. Knepley   PetscInt        *numUnsplitPoints;   /* The number of non-replicated points at each depth which still give rise to hybrid points */
74636dbac82SMatthew G. Knepley   PetscInt        *numHybridPoints;    /* The number of new hybrid points at each depth */
74736dbac82SMatthew G. Knepley   PetscInt        *numHybridPointsOld; /* The number of existing hybrid points at each depth */
748607ab7a9SMatthew G. Knepley   const PetscInt **splitPoints;        /* Replicated points for each depth */
74918c5995bSMatthew G. Knepley   const PetscInt **unsplitPoints;      /* Non-replicated points for each depth */
750cd0c2139SMatthew G Knepley   PetscSection     coordSection;
751cd0c2139SMatthew G Knepley   Vec              coordinates;
752cd0c2139SMatthew G Knepley   PetscScalar     *coords;
753a6ae58d1SMatthew G. Knepley   PetscInt        *depthMax;           /* The first hybrid point at each depth in the original mesh */
754a6ae58d1SMatthew G. Knepley   PetscInt        *depthEnd;           /* The point limit at each depth in the original mesh */
755607ab7a9SMatthew G. Knepley   PetscInt        *depthShift;         /* Number of replicated+hybrid points at each depth */
756607ab7a9SMatthew G. Knepley   PetscInt        *pMaxNew;            /* The first replicated point at each depth in the new mesh, hybrids come after this */
757607ab7a9SMatthew G. Knepley   PetscInt        *coneNew, *coneONew, *supportNew;
75818c5995bSMatthew G. Knepley   PetscInt         shift = 100, shift2 = 200, depth = 0, dep, dim, d, sp, maxConeSize, maxSupportSize, maxConeSizeNew, maxSupportSizeNew, numLabels, vStart, vEnd, pEnd, p, v;
759cd0c2139SMatthew G Knepley   PetscErrorCode   ierr;
760cd0c2139SMatthew G Knepley 
761cd0c2139SMatthew G Knepley   PetscFunctionBegin;
762cd0c2139SMatthew G Knepley   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
763c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
764607ab7a9SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
765fd4b9f15SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
766cd0c2139SMatthew G Knepley   /* Count split points and add cohesive cells */
767607ab7a9SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, &maxSupportSize);CHKERRQ(ierr);
7682582d50cSToby Isaac   ierr = PetscMalloc5(depth+1,&depthMax,depth+1,&depthEnd,2*(depth+1),&depthShift,depth+1,&pMaxNew,depth+1,&numHybridPointsOld);CHKERRQ(ierr);
769dcca6d9dSJed 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);
770a6ae58d1SMatthew 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);
771607ab7a9SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
772607ab7a9SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, d, NULL, &pMaxNew[d]);CHKERRQ(ierr);
773a6ae58d1SMatthew G. Knepley     depthEnd[d]           = pMaxNew[d];
774a6ae58d1SMatthew G. Knepley     depthMax[d]           = depthMax[d] < 0 ? depthEnd[d] : depthMax[d];
775607ab7a9SMatthew G. Knepley     numSplitPoints[d]     = 0;
77618c5995bSMatthew G. Knepley     numUnsplitPoints[d]   = 0;
777607ab7a9SMatthew G. Knepley     numHybridPoints[d]    = 0;
778a6ae58d1SMatthew G. Knepley     numHybridPointsOld[d] = depthMax[d] < 0 ? 0 : depthEnd[d] - depthMax[d];
779607ab7a9SMatthew G. Knepley     splitPoints[d]        = NULL;
78018c5995bSMatthew G. Knepley     unsplitPoints[d]      = NULL;
78118c5995bSMatthew G. Knepley     splitIS[d]            = NULL;
78218c5995bSMatthew G. Knepley     unsplitIS[d]          = NULL;
783*59eef20bSToby Isaac     /* we are shifting the existing hybrid points with the stratum behind them, so
784*59eef20bSToby Isaac      * the split comes at the end of the normal points, i.e., at depthMax[d] */
785*59eef20bSToby Isaac     depthShift[2*d]       = depthMax[d];
786*59eef20bSToby Isaac     depthShift[2*d+1]     = 0;
787607ab7a9SMatthew G. Knepley   }
788cd0c2139SMatthew G Knepley   if (label) {
789cd0c2139SMatthew G Knepley     ierr = DMLabelGetValueIS(label, &valueIS);CHKERRQ(ierr);
790cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(valueIS, &numSP);CHKERRQ(ierr);
791cd0c2139SMatthew G Knepley     ierr = ISGetIndices(valueIS, &values);CHKERRQ(ierr);
792cd0c2139SMatthew G Knepley   }
793cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
794cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
795cd0c2139SMatthew G Knepley 
796cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
79718c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, dep, &splitIS[dep]);CHKERRQ(ierr);
79818c5995bSMatthew G. Knepley     if (splitIS[dep]) {
79918c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(splitIS[dep], &numSplitPoints[dep]);CHKERRQ(ierr);
80018c5995bSMatthew G. Knepley       ierr = ISGetIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);
80118c5995bSMatthew G. Knepley     }
80218c5995bSMatthew G. Knepley     ierr = DMLabelGetStratumIS(label, shift2+dep, &unsplitIS[dep]);CHKERRQ(ierr);
80318c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {
80418c5995bSMatthew G. Knepley       ierr = ISGetLocalSize(unsplitIS[dep], &numUnsplitPoints[dep]);CHKERRQ(ierr);
80518c5995bSMatthew G. Knepley       ierr = ISGetIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);
806cd0c2139SMatthew G Knepley     }
807cd0c2139SMatthew G Knepley   }
808607ab7a9SMatthew G. Knepley   /* Calculate number of hybrid points */
80918c5995bSMatthew 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   */
8102582d50cSToby Isaac   for (d = 0; d <= depth; ++d) depthShift[2*d+1]      = numSplitPoints[d] + numHybridPoints[d];
8112582d50cSToby Isaac   ierr = DMPlexShiftPointSetUp_Internal(depth,depthShift);
812*59eef20bSToby Isaac   /* the end of the points in this stratum that come before the new points:
813*59eef20bSToby Isaac    * shifting pMaxNew[d] gets the new start of the next stratum, then count back the old hybrid points and the newly
814*59eef20bSToby Isaac    * added points */
8152582d50cSToby Isaac   for (d = 0; d <= depth; ++d) pMaxNew[d]             = DMPlexShiftPoint_Internal(pMaxNew[d],depth,depthShift) - (numHybridPointsOld[d] + numSplitPoints[d] + numHybridPoints[d]);
816cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSizes_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
817cd0c2139SMatthew G Knepley   /* Step 3: Set cone/support sizes for new points */
818cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
819cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
820cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
8212582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
8224c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
823cd0c2139SMatthew G Knepley       const PetscInt *support;
8244c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, qn, qp, e;
825cd0c2139SMatthew G Knepley 
826cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
827cd0c2139SMatthew G Knepley       ierr = DMPlexSetConeSize(sdm, splitp, coneSize);CHKERRQ(ierr);
828cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
829cd0c2139SMatthew G Knepley       ierr = DMPlexSetSupportSize(sdm, splitp, supportSize);CHKERRQ(ierr);
830cd0c2139SMatthew G Knepley       if (dep == depth-1) {
8314c367dbcSMatthew G. Knepley         const PetscInt hybcell = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
8324c367dbcSMatthew G. Knepley 
833cd0c2139SMatthew G Knepley         /* Add cohesive cells, they are prisms */
8344c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybcell, 2 + coneSize);CHKERRQ(ierr);
835cd0c2139SMatthew G Knepley       } else if (dep == 0) {
8364c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
837cd0c2139SMatthew G Knepley 
838cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
8394c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
840cd0c2139SMatthew G Knepley           PetscInt val;
841cd0c2139SMatthew G Knepley 
842cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8434c367dbcSMatthew G. Knepley           if (val == 1) ++qf;
8444c367dbcSMatthew G. Knepley           if ((val == 1) || (val ==  (shift + 1))) ++qn;
8454c367dbcSMatthew G. Knepley           if ((val == 1) || (val == -(shift + 1))) ++qp;
846cd0c2139SMatthew G Knepley         }
8474c367dbcSMatthew G. Knepley         /* Split old vertex: Edges into original vertex and new cohesive edge */
8484c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
8494c367dbcSMatthew G. Knepley         /* Split new vertex: Edges into split vertex and new cohesive edge */
8504c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
8514c367dbcSMatthew G. Knepley         /* Add hybrid edge */
8524c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
8534c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
854cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
8554c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
8564c367dbcSMatthew G. Knepley 
857cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
8584c367dbcSMatthew G. Knepley         for (e = 0, qn = 0, qp = 0, qf = 0; e < supportSize; ++e) {
859cd0c2139SMatthew G Knepley           PetscInt val;
860cd0c2139SMatthew G Knepley 
861cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
8624c367dbcSMatthew G. Knepley           if (val == dim-1) ++qf;
8634c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val ==  (shift + dim-1))) ++qn;
8644c367dbcSMatthew G. Knepley           if ((val == dim-1) || (val == -(shift + dim-1))) ++qp;
865cd0c2139SMatthew G Knepley         }
8664c367dbcSMatthew G. Knepley         /* Split old edge: Faces into original edge and cohesive face (positive side?) */
8674c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qn+1);CHKERRQ(ierr);
8684c367dbcSMatthew G. Knepley         /* Split new edge: Faces into split edge and cohesive face (negative side?) */
8694c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, splitp, qp+1);CHKERRQ(ierr);
8704c367dbcSMatthew G. Knepley         /* Add hybrid face */
8714c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
8724c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
873cd0c2139SMatthew G Knepley       }
874cd0c2139SMatthew G Knepley     }
875cd0c2139SMatthew G Knepley   }
87618c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
87718c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
87818c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
8792582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
88018c5995bSMatthew G. Knepley       const PetscInt *support;
881da1dd7e4SMatthew G. Knepley       PetscInt        coneSize, supportSize, qf, e, s;
88218c5995bSMatthew G. Knepley 
88318c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
88418c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
88539254ff6SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
88618c5995bSMatthew G. Knepley       if (dep == 0) {
88718c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
88818c5995bSMatthew G. Knepley 
88939254ff6SMatthew G. Knepley         /* Unsplit vertex: Edges into original vertex, split edges, and new cohesive edge twice */
89039254ff6SMatthew G. Knepley         for (s = 0, qf = 0; s < supportSize; ++s, ++qf) {
89139254ff6SMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
89239254ff6SMatthew G. Knepley           if (e >= 0) ++qf;
89339254ff6SMatthew G. Knepley         }
89439254ff6SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
89518c5995bSMatthew G. Knepley         /* Add hybrid edge */
89618c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybedge, 2);CHKERRQ(ierr);
897e1757548SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
898e1757548SMatthew G. Knepley           PetscInt val;
899e1757548SMatthew G. Knepley 
900e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
901e1757548SMatthew G. Knepley           /* Split and unsplit edges produce hybrid faces */
902da1dd7e4SMatthew G. Knepley           if (val == 1) ++qf;
903da1dd7e4SMatthew G. Knepley           if (val == (shift2 + 1)) ++qf;
904e1757548SMatthew G. Knepley         }
905e1757548SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybedge, qf);CHKERRQ(ierr);
90618c5995bSMatthew G. Knepley       } else if (dep == dim-2) {
90718c5995bSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
908cd0c2139SMatthew G Knepley         PetscInt       val;
909cd0c2139SMatthew G Knepley 
910da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
911cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
912da1dd7e4SMatthew G. Knepley           if (val == dim-1) qf += 2;
913da1dd7e4SMatthew G. Knepley           else              ++qf;
914cd0c2139SMatthew G Knepley         }
91518c5995bSMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and cohesive face twice */
916da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, newp, qf+2);CHKERRQ(ierr);
91718c5995bSMatthew G. Knepley         /* Add hybrid face */
918da1dd7e4SMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
919da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
920da1dd7e4SMatthew G. Knepley           if (val == dim-1) ++qf;
921da1dd7e4SMatthew G. Knepley         }
92218c5995bSMatthew G. Knepley         ierr = DMPlexSetConeSize(sdm, hybface, 4);CHKERRQ(ierr);
923da1dd7e4SMatthew G. Knepley         ierr = DMPlexSetSupportSize(sdm, hybface, qf);CHKERRQ(ierr);
924cd0c2139SMatthew G Knepley       }
925cd0c2139SMatthew G Knepley     }
926cd0c2139SMatthew G Knepley   }
927cd0c2139SMatthew G Knepley   /* Step 4: Setup split DM */
928cd0c2139SMatthew G Knepley   ierr = DMSetUp(sdm);CHKERRQ(ierr);
929cd0c2139SMatthew G Knepley   ierr = DMPlexShiftPoints_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
930dcbb62e8SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(sdm, &maxConeSizeNew, &maxSupportSizeNew);CHKERRQ(ierr);
931dcca6d9dSJed Brown   ierr = PetscMalloc3(PetscMax(maxConeSize, maxConeSizeNew)*3,&coneNew,PetscMax(maxConeSize, maxConeSizeNew)*3,&coneONew,PetscMax(maxSupportSize, maxSupportSizeNew),&supportNew);CHKERRQ(ierr);
932cd0c2139SMatthew G Knepley   /* Step 6: Set cones and supports for new points */
933cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
934cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
935cd0c2139SMatthew G Knepley       const PetscInt  oldp   = splitPoints[dep][p];
9362582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
9374c367dbcSMatthew G. Knepley       const PetscInt  splitp = p    + pMaxNew[dep];
938cd0c2139SMatthew G Knepley       const PetscInt *cone, *support, *ornt;
9394c367dbcSMatthew G. Knepley       PetscInt        coneSize, supportSize, q, qf, qn, qp, v, e, s;
940cd0c2139SMatthew G Knepley 
941cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
942cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
943cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
944cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
945cd0c2139SMatthew G Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
946cd0c2139SMatthew G Knepley       if (dep == depth-1) {
94796a07cd0SMatthew G. Knepley         PetscBool       hasUnsplit = PETSC_FALSE;
9484c367dbcSMatthew G. Knepley         const PetscInt  hybcell    = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
949cd0c2139SMatthew G Knepley         const PetscInt *supportF;
950cd0c2139SMatthew G Knepley 
951cd0c2139SMatthew G Knepley         /* Split face:       copy in old face to new face to start */
952cd0c2139SMatthew G Knepley         ierr = DMPlexGetSupport(sdm, newp,  &supportF);CHKERRQ(ierr);
953cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportF);CHKERRQ(ierr);
954cd0c2139SMatthew G Knepley         /* Split old face:   old vertices/edges in cone so no change */
955cd0c2139SMatthew G Knepley         /* Split new face:   new vertices/edges in cone */
956cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
9574c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
95818c5995bSMatthew G. Knepley           if (v < 0) {
95918c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
96018c5995bSMatthew 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);
9612582d50cSToby Isaac             coneNew[2+q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
96296a07cd0SMatthew G. Knepley             hasUnsplit   = PETSC_TRUE;
96318c5995bSMatthew G. Knepley           } else {
9644c367dbcSMatthew G. Knepley             coneNew[2+q] = v + pMaxNew[dep-1];
965163235baSMatthew G. Knepley             if (dep > 1) {
966163235baSMatthew G. Knepley               const PetscInt *econe;
967163235baSMatthew G. Knepley               PetscInt        econeSize, r, vs, vu;
968163235baSMatthew G. Knepley 
969163235baSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, cone[q], &econeSize);CHKERRQ(ierr);
970163235baSMatthew G. Knepley               ierr = DMPlexGetCone(dm, cone[q], &econe);CHKERRQ(ierr);
971163235baSMatthew G. Knepley               for (r = 0; r < econeSize; ++r) {
972163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numSplitPoints[dep-2],   splitPoints[dep-2],   &vs);CHKERRQ(ierr);
973163235baSMatthew G. Knepley                 ierr = PetscFindInt(econe[r], numUnsplitPoints[dep-2], unsplitPoints[dep-2], &vu);CHKERRQ(ierr);
974163235baSMatthew G. Knepley                 if (vs >= 0) continue;
975163235baSMatthew 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);
976163235baSMatthew G. Knepley                 hasUnsplit   = PETSC_TRUE;
977163235baSMatthew G. Knepley               }
978163235baSMatthew G. Knepley             }
979cd0c2139SMatthew G Knepley           }
980cd0c2139SMatthew G Knepley         }
981cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, &coneNew[2]);CHKERRQ(ierr);
982cd0c2139SMatthew G Knepley         ierr = DMPlexSetConeOrientation(sdm, splitp, ornt);CHKERRQ(ierr);
983e537020bSMatthew G. Knepley         /* Face support */
984cd0c2139SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
985cd0c2139SMatthew G Knepley           PetscInt val;
986cd0c2139SMatthew G Knepley 
987cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[s], &val);CHKERRQ(ierr);
988cd0c2139SMatthew G Knepley           if (val < 0) {
989cd0c2139SMatthew G Knepley             /* Split old face:   Replace negative side cell with cohesive cell */
9904c367dbcSMatthew G. Knepley              ierr = DMPlexInsertSupport(sdm, newp, s, hybcell);CHKERRQ(ierr);
991cd0c2139SMatthew G Knepley           } else {
992cd0c2139SMatthew G Knepley             /* Split new face:   Replace positive side cell with cohesive cell */
9934c367dbcSMatthew G. Knepley             ierr = DMPlexInsertSupport(sdm, splitp, s, hybcell);CHKERRQ(ierr);
994e537020bSMatthew G. Knepley             /* Get orientation for cohesive face */
995e537020bSMatthew G. Knepley             {
996e537020bSMatthew G. Knepley               const PetscInt *ncone, *nconeO;
997e537020bSMatthew G. Knepley               PetscInt        nconeSize, nc;
998e537020bSMatthew G. Knepley 
999e537020bSMatthew G. Knepley               ierr = DMPlexGetConeSize(dm, support[s], &nconeSize);CHKERRQ(ierr);
1000e537020bSMatthew G. Knepley               ierr = DMPlexGetCone(dm, support[s], &ncone);CHKERRQ(ierr);
1001e537020bSMatthew G. Knepley               ierr = DMPlexGetConeOrientation(dm, support[s], &nconeO);CHKERRQ(ierr);
1002e537020bSMatthew G. Knepley               for (nc = 0; nc < nconeSize; ++nc) {
1003e537020bSMatthew G. Knepley                 if (ncone[nc] == oldp) {
1004e537020bSMatthew G. Knepley                   coneONew[0] = nconeO[nc];
1005e537020bSMatthew G. Knepley                   break;
1006cd0c2139SMatthew G Knepley                 }
1007cd0c2139SMatthew G Knepley               }
1008e537020bSMatthew 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]);
1009e537020bSMatthew G. Knepley             }
1010e537020bSMatthew G. Knepley           }
1011e537020bSMatthew G. Knepley         }
10124c367dbcSMatthew G. Knepley         /* Cohesive cell:    Old and new split face, then new cohesive faces */
1013fd4b9f15SMatthew G. Knepley         coneNew[0]  = newp;   /* Extracted negative side orientation above */
10144c367dbcSMatthew G. Knepley         coneNew[1]  = splitp;
10154c367dbcSMatthew G. Knepley         coneONew[1] = coneONew[0];
1016e537020bSMatthew G. Knepley         for (q = 0; q < coneSize; ++q) {
101718c5995bSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
101818c5995bSMatthew G. Knepley           if (v < 0) {
101918c5995bSMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
102018c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
102118c5995bSMatthew G. Knepley             coneONew[2+q] = 0;
102218c5995bSMatthew G. Knepley           } else {
102318c5995bSMatthew G. Knepley             coneNew[2+q]  = v + pMaxNew[dep] + numSplitPoints[dep];
102418c5995bSMatthew G. Knepley           }
1025e537020bSMatthew G. Knepley           coneONew[2+q] = 0;
1026e537020bSMatthew G. Knepley         }
10274c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybcell, coneNew);CHKERRQ(ierr);
10284c367dbcSMatthew G. Knepley         ierr = DMPlexSetConeOrientation(sdm, hybcell, coneONew);CHKERRQ(ierr);
102996a07cd0SMatthew G. Knepley         /* Label the hybrid cells on the boundary of the split */
103096a07cd0SMatthew G. Knepley         if (hasUnsplit) {ierr = DMLabelSetValue(label, -hybcell, dim);CHKERRQ(ierr);}
1031cd0c2139SMatthew G Knepley       } else if (dep == 0) {
10324c367dbcSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1033cd0c2139SMatthew G Knepley 
1034cd0c2139SMatthew G Knepley         /* Split old vertex: Edges in old split faces and new cohesive edge */
10354c367dbcSMatthew G. Knepley         for (e = 0, qn = 0; e < supportSize; ++e) {
1036cd0c2139SMatthew G Knepley           PetscInt val;
1037cd0c2139SMatthew G Knepley 
1038cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1039cd0c2139SMatthew G Knepley           if ((val == 1) || (val == (shift + 1))) {
10402582d50cSToby Isaac             supportNew[qn++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1041cd0c2139SMatthew G Knepley           }
1042cd0c2139SMatthew G Knepley         }
10434c367dbcSMatthew G. Knepley         supportNew[qn] = hybedge;
1044cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1045cd0c2139SMatthew G Knepley         /* Split new vertex: Edges in new split faces and new cohesive edge */
10464c367dbcSMatthew G. Knepley         for (e = 0, qp = 0; e < supportSize; ++e) {
1047cd0c2139SMatthew G Knepley           PetscInt val, edge;
1048cd0c2139SMatthew G Knepley 
1049cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1050cd0c2139SMatthew G Knepley           if (val == 1) {
10514c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
1052cd0c2139SMatthew G Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
10534c367dbcSMatthew G. Knepley             supportNew[qp++] = edge + pMaxNew[dep+1];
1054cd0c2139SMatthew G Knepley           } else if (val == -(shift + 1)) {
10552582d50cSToby Isaac             supportNew[qp++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1056cd0c2139SMatthew G Knepley           }
1057cd0c2139SMatthew G Knepley         }
10584c367dbcSMatthew G. Knepley         supportNew[qp] = hybedge;
1059cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
10604c367dbcSMatthew G. Knepley         /* Hybrid edge:    Old and new split vertex */
1061cd0c2139SMatthew G Knepley         coneNew[0] = newp;
1062cd0c2139SMatthew G Knepley         coneNew[1] = splitp;
10634c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
10644c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
10654c367dbcSMatthew G. Knepley           PetscInt val, edge;
10664c367dbcSMatthew G. Knepley 
10674c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
10684c367dbcSMatthew G. Knepley           if (val == 1) {
10694c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
10704c367dbcSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
10714c367dbcSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
10724c367dbcSMatthew G. Knepley           }
10734c367dbcSMatthew G. Knepley         }
10744c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1075cd0c2139SMatthew G Knepley       } else if (dep == dim-2) {
10764c367dbcSMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
10774c367dbcSMatthew G. Knepley 
1078cd0c2139SMatthew G Knepley         /* Split old edge:   old vertices in cone so no change */
1079cd0c2139SMatthew G Knepley         /* Split new edge:   new vertices in cone */
1080cd0c2139SMatthew G Knepley         for (q = 0; q < coneSize; ++q) {
10814c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[q], numSplitPoints[dep-1], splitPoints[dep-1], &v);CHKERRQ(ierr);
1082e1757548SMatthew G. Knepley           if (v < 0) {
1083e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[q], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1084e1757548SMatthew 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);
10852582d50cSToby Isaac             coneNew[q] = DMPlexShiftPoint_Internal(cone[q], depth, depthShift) /*cone[q] + depthOffset[dep-1]*/;
1086e1757548SMatthew G. Knepley           } else {
10874c367dbcSMatthew G. Knepley             coneNew[q] = v + pMaxNew[dep-1];
1088cd0c2139SMatthew G Knepley           }
1089e1757548SMatthew G. Knepley         }
1090cd0c2139SMatthew G Knepley         ierr = DMPlexSetCone(sdm, splitp, coneNew);CHKERRQ(ierr);
1091cd0c2139SMatthew G Knepley         /* Split old edge: Faces in positive side cells and old split faces */
1092cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1093cd0c2139SMatthew G Knepley           PetscInt val;
1094cd0c2139SMatthew G Knepley 
1095cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
10964c367dbcSMatthew G. Knepley           if (val == dim-1) {
10972582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
10984c367dbcSMatthew G. Knepley           } else if (val == (shift + dim-1)) {
10992582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1100cd0c2139SMatthew G Knepley           }
1101cd0c2139SMatthew G Knepley         }
1102b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1103cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1104cd0c2139SMatthew G Knepley         /* Split new edge: Faces in negative side cells and new split faces */
1105cd0c2139SMatthew G Knepley         for (e = 0, q = 0; e < supportSize; ++e) {
1106cd0c2139SMatthew G Knepley           PetscInt val, face;
1107cd0c2139SMatthew G Knepley 
1108cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
1109cd0c2139SMatthew G Knepley           if (val == dim-1) {
11104c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1111cd0c2139SMatthew G Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11124c367dbcSMatthew G. Knepley             supportNew[q++] = face + pMaxNew[dep+1];
1113cd0c2139SMatthew G Knepley           } else if (val == -(shift + dim-1)) {
11142582d50cSToby Isaac             supportNew[q++] = DMPlexShiftPoint_Internal(support[e], depth, depthShift) /*support[e] + depthOffset[dep+1]*/;
1115cd0c2139SMatthew G Knepley           }
1116cd0c2139SMatthew G Knepley         }
1117b279cd2aSMatthew G. Knepley         supportNew[q++] = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1118cd0c2139SMatthew G Knepley         ierr = DMPlexSetSupport(sdm, splitp, supportNew);CHKERRQ(ierr);
11194c367dbcSMatthew G. Knepley         /* Hybrid face */
11204c367dbcSMatthew G. Knepley         coneNew[0] = newp;
11214c367dbcSMatthew G. Knepley         coneNew[1] = splitp;
11224c367dbcSMatthew G. Knepley         for (v = 0; v < coneSize; ++v) {
11234c367dbcSMatthew G. Knepley           PetscInt vertex;
11244c367dbcSMatthew G. Knepley           ierr = PetscFindInt(cone[v], numSplitPoints[dep-1], splitPoints[dep-1], &vertex);CHKERRQ(ierr);
1125e1757548SMatthew G. Knepley           if (vertex < 0) {
1126e1757548SMatthew G. Knepley             ierr = PetscFindInt(cone[v], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &vertex);CHKERRQ(ierr);
1127e1757548SMatthew 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);
1128e1757548SMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1129e1757548SMatthew G. Knepley           } else {
11304c367dbcSMatthew G. Knepley             coneNew[2+v] = vertex + pMaxNew[dep] + numSplitPoints[dep];
11314c367dbcSMatthew G. Knepley           }
1132e1757548SMatthew G. Knepley         }
11334c367dbcSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
11344c367dbcSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
11354c367dbcSMatthew G. Knepley           PetscInt val, face;
11364c367dbcSMatthew G. Knepley 
11374c367dbcSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
11384c367dbcSMatthew G. Knepley           if (val == dim-1) {
11394c367dbcSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
11404c367dbcSMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[e]);
11414c367dbcSMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
11424c367dbcSMatthew G. Knepley           }
11434c367dbcSMatthew G. Knepley         }
11444c367dbcSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1145cd0c2139SMatthew G Knepley       }
1146cd0c2139SMatthew G Knepley     }
1147cd0c2139SMatthew G Knepley   }
114818c5995bSMatthew G. Knepley   for (dep = 0; dep <= depth; ++dep) {
114918c5995bSMatthew G. Knepley     for (p = 0; p < numUnsplitPoints[dep]; ++p) {
115018c5995bSMatthew G. Knepley       const PetscInt  oldp   = unsplitPoints[dep][p];
11512582d50cSToby Isaac       const PetscInt  newp   = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*oldp + depthOffset[dep]*/;
115218c5995bSMatthew G. Knepley       const PetscInt *cone, *support, *ornt;
1153e1757548SMatthew G. Knepley       PetscInt        coneSize, supportSize, supportSizeNew, q, qf, e, f, s;
115418c5995bSMatthew G. Knepley 
115518c5995bSMatthew G. Knepley       ierr = DMPlexGetConeSize(dm, oldp, &coneSize);CHKERRQ(ierr);
115618c5995bSMatthew G. Knepley       ierr = DMPlexGetCone(dm, oldp, &cone);CHKERRQ(ierr);
115718c5995bSMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, oldp, &ornt);CHKERRQ(ierr);
115818c5995bSMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, oldp, &supportSize);CHKERRQ(ierr);
115918c5995bSMatthew G. Knepley       ierr = DMPlexGetSupport(dm, oldp, &support);CHKERRQ(ierr);
116018c5995bSMatthew G. Knepley       if (dep == 0) {
116118c5995bSMatthew G. Knepley         const PetscInt hybedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
116218c5995bSMatthew G. Knepley 
116318c5995bSMatthew G. Knepley         /* Unsplit vertex */
116418c5995bSMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
116518c5995bSMatthew G. Knepley         for (s = 0, q = 0; s < supportSize; ++s) {
11662582d50cSToby Isaac           supportNew[q++] = DMPlexShiftPoint_Internal(support[s], depth, depthShift) /*support[s] + depthOffset[dep+1]*/;
116718c5995bSMatthew G. Knepley           ierr = PetscFindInt(support[s], numSplitPoints[dep+1], splitPoints[dep+1], &e);CHKERRQ(ierr);
116818c5995bSMatthew G. Knepley           if (e >= 0) {
116918c5995bSMatthew G. Knepley             supportNew[q++] = e + pMaxNew[dep+1];
117018c5995bSMatthew G. Knepley           }
117118c5995bSMatthew G. Knepley         }
117218c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
117318c5995bSMatthew G. Knepley         supportNew[q++] = hybedge;
117418c5995bSMatthew G. Knepley         if (q != supportSizeNew) SETERRQ3(comm, PETSC_ERR_ARG_WRONG, "Support size %d != %d for vertex %d", q, supportSizeNew, newp);
117518c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
117618c5995bSMatthew G. Knepley         /* Hybrid edge */
117718c5995bSMatthew G. Knepley         coneNew[0] = newp;
117818c5995bSMatthew G. Knepley         coneNew[1] = newp;
117918c5995bSMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybedge, coneNew);CHKERRQ(ierr);
118018c5995bSMatthew G. Knepley         for (e = 0, qf = 0; e < supportSize; ++e) {
118118c5995bSMatthew G. Knepley           PetscInt val, edge;
118218c5995bSMatthew G. Knepley 
118318c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(label, support[e], &val);CHKERRQ(ierr);
118418c5995bSMatthew G. Knepley           if (val == 1) {
118518c5995bSMatthew G. Knepley             ierr = PetscFindInt(support[e], numSplitPoints[dep+1], splitPoints[dep+1], &edge);CHKERRQ(ierr);
118618c5995bSMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a split edge", support[e]);
118718c5995bSMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2];
1188e1757548SMatthew G. Knepley           } else if  (val ==  (shift2 + 1)) {
1189e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[e], numUnsplitPoints[dep+1], unsplitPoints[dep+1], &edge);CHKERRQ(ierr);
1190e1757548SMatthew G. Knepley             if (edge < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Edge %d is not a unsplit edge", support[e]);
1191e1757548SMatthew G. Knepley             supportNew[qf++] = edge + pMaxNew[dep+2] + numSplitPoints[dep+2] + numSplitPoints[dep+1];
119218c5995bSMatthew G. Knepley           }
119318c5995bSMatthew G. Knepley         }
119418c5995bSMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybedge, supportNew);CHKERRQ(ierr);
1195e1757548SMatthew G. Knepley       } else if (dep == dim-2) {
1196e1757548SMatthew G. Knepley         const PetscInt hybface = p + pMaxNew[dep+1] + numSplitPoints[dep+1] + numSplitPoints[dep];
1197e1757548SMatthew G. Knepley 
1198da1dd7e4SMatthew G. Knepley         /* Unsplit edge: Faces into original edge, split face, and hybrid face twice */
1199e1757548SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1200e1757548SMatthew G. Knepley           PetscInt val, face;
1201e1757548SMatthew G. Knepley 
1202e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1203e1757548SMatthew G. Knepley           if (val == dim-1) {
1204e1757548SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1205e1757548SMatthew G. Knepley             if (face < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Face %d is not a split face", support[f]);
12062582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1207e1757548SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+1];
1208e1757548SMatthew G. Knepley           } else {
12092582d50cSToby Isaac             supportNew[qf++] = DMPlexShiftPoint_Internal(support[f], depth, depthShift) /*support[f] + depthOffset[dep+1]*/;
1210e1757548SMatthew G. Knepley           }
1211e1757548SMatthew G. Knepley         }
1212e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1213e1757548SMatthew G. Knepley         supportNew[qf++] = hybface;
1214da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, newp, &supportSizeNew);CHKERRQ(ierr);
1215da1dd7e4SMatthew 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);
1216e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, newp, supportNew);CHKERRQ(ierr);
1217e1757548SMatthew G. Knepley         /* Add hybrid face */
1218e1757548SMatthew G. Knepley         coneNew[0] = newp;
1219212cc919SMatthew G. Knepley         coneNew[1] = newp;
1220e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[0], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1221e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[0]);
1222212cc919SMatthew G. Knepley         coneNew[2] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1223e1757548SMatthew G. Knepley         ierr = PetscFindInt(cone[1], numUnsplitPoints[dep-1], unsplitPoints[dep-1], &v);CHKERRQ(ierr);
1224e1757548SMatthew G. Knepley         if (v < 0) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex %d is not an unsplit vertex", cone[1]);
1225e1757548SMatthew G. Knepley         coneNew[3] = v + pMaxNew[dep] + numSplitPoints[dep] + numSplitPoints[dep-1];
1226e1757548SMatthew G. Knepley         ierr = DMPlexSetCone(sdm, hybface, coneNew);CHKERRQ(ierr);
1227da1dd7e4SMatthew G. Knepley         for (f = 0, qf = 0; f < supportSize; ++f) {
1228da1dd7e4SMatthew G. Knepley           PetscInt val, face;
1229da1dd7e4SMatthew G. Knepley 
1230da1dd7e4SMatthew G. Knepley           ierr = DMLabelGetValue(label, support[f], &val);CHKERRQ(ierr);
1231da1dd7e4SMatthew G. Knepley           if (val == dim-1) {
1232da1dd7e4SMatthew G. Knepley             ierr = PetscFindInt(support[f], numSplitPoints[dep+1], splitPoints[dep+1], &face);CHKERRQ(ierr);
1233da1dd7e4SMatthew G. Knepley             supportNew[qf++] = face + pMaxNew[dep+2] + numSplitPoints[dep+2];
1234da1dd7e4SMatthew G. Knepley           }
1235da1dd7e4SMatthew G. Knepley         }
1236da1dd7e4SMatthew G. Knepley         ierr = DMPlexGetSupportSize(sdm, hybface, &supportSizeNew);CHKERRQ(ierr);
1237da1dd7e4SMatthew 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);
1238e1757548SMatthew G. Knepley         ierr = DMPlexSetSupport(sdm, hybface, supportNew);CHKERRQ(ierr);
1239cd0c2139SMatthew G Knepley       }
1240cd0c2139SMatthew G Knepley     }
1241cd0c2139SMatthew G Knepley   }
1242cd0c2139SMatthew G Knepley   /* Step 6b: Replace split points in negative side cones */
1243cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1244cd0c2139SMatthew G Knepley     PetscInt        dep = values[sp];
1245cd0c2139SMatthew G Knepley     IS              pIS;
1246cd0c2139SMatthew G Knepley     PetscInt        numPoints;
1247cd0c2139SMatthew G Knepley     const PetscInt *points;
1248cd0c2139SMatthew G Knepley 
1249cd0c2139SMatthew G Knepley     if (dep >= 0) continue;
1250cd0c2139SMatthew G Knepley     ierr = DMLabelGetStratumIS(label, dep, &pIS);CHKERRQ(ierr);
1251cd0c2139SMatthew G Knepley     if (!pIS) continue;
1252cd0c2139SMatthew G Knepley     dep  = -dep - shift;
1253cd0c2139SMatthew G Knepley     ierr = ISGetLocalSize(pIS, &numPoints);CHKERRQ(ierr);
1254cd0c2139SMatthew G Knepley     ierr = ISGetIndices(pIS, &points);CHKERRQ(ierr);
1255cd0c2139SMatthew G Knepley     for (p = 0; p < numPoints; ++p) {
1256cd0c2139SMatthew G Knepley       const PetscInt  oldp = points[p];
12572582d50cSToby Isaac       const PetscInt  newp = DMPlexShiftPoint_Internal(oldp, depth, depthShift) /*depthOffset[dep] + oldp*/;
1258cd0c2139SMatthew G Knepley       const PetscInt *cone;
1259cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
126050cf782dSMatthew G. Knepley       /* PetscBool       replaced = PETSC_FALSE; */
1261cd0c2139SMatthew G Knepley 
1262cd0c2139SMatthew G Knepley       /* Negative edge: replace split vertex */
1263cd0c2139SMatthew G Knepley       /* Negative cell: replace split face */
1264cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(sdm, newp, &coneSize);CHKERRQ(ierr);
1265cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(sdm, newp, &cone);CHKERRQ(ierr);
1266cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
12672582d50cSToby Isaac         const PetscInt coldp = DMPlexShiftPointInverse_Internal(cone[2],depth,depthShift);
1268cd0c2139SMatthew G Knepley         PetscInt       csplitp, cp, val;
1269cd0c2139SMatthew G Knepley 
1270cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, coldp, &val);CHKERRQ(ierr);
1271cd0c2139SMatthew G Knepley         if (val == dep-1) {
1272cd0c2139SMatthew G Knepley           ierr = PetscFindInt(coldp, numSplitPoints[dep-1], splitPoints[dep-1], &cp);CHKERRQ(ierr);
1273cd0c2139SMatthew G Knepley           if (cp < 0) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "Point %d is not a split point of dimension %d", oldp, dep-1);
1274cd0c2139SMatthew G Knepley           csplitp  = pMaxNew[dep-1] + cp;
1275cd0c2139SMatthew G Knepley           ierr     = DMPlexInsertCone(sdm, newp, c, csplitp);CHKERRQ(ierr);
127650cf782dSMatthew G. Knepley           /* replaced = PETSC_TRUE; */
1277cd0c2139SMatthew G Knepley         }
1278cd0c2139SMatthew G Knepley       }
12794a189a86SMatthew G. Knepley       /* Cells with only a vertex or edge on the submesh have no replacement */
12804a189a86SMatthew G. Knepley       /* if (!replaced) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "The cone of point %d does not contain split points", oldp); */
1281cd0c2139SMatthew G Knepley     }
1282cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(pIS, &points);CHKERRQ(ierr);
1283cd0c2139SMatthew G Knepley     ierr = ISDestroy(&pIS);CHKERRQ(ierr);
1284cd0c2139SMatthew G Knepley   }
1285cd0c2139SMatthew G Knepley   /* Step 7: Stratify */
1286cd0c2139SMatthew G Knepley   ierr = DMPlexStratify(sdm);CHKERRQ(ierr);
1287cd0c2139SMatthew G Knepley   /* Step 8: Coordinates */
1288cd0c2139SMatthew G Knepley   ierr = DMPlexShiftCoordinates_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
128969d8a9ceSMatthew G. Knepley   ierr = DMGetCoordinateSection(sdm, &coordSection);CHKERRQ(ierr);
1290cd0c2139SMatthew G Knepley   ierr = DMGetCoordinatesLocal(sdm, &coordinates);CHKERRQ(ierr);
1291cd0c2139SMatthew G Knepley   ierr = VecGetArray(coordinates, &coords);CHKERRQ(ierr);
1292cd0c2139SMatthew G Knepley   for (v = 0; v < (numSplitPoints ? numSplitPoints[0] : 0); ++v) {
12932582d50cSToby Isaac     const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[0][v], depth, depthShift) /*depthOffset[0] + splitPoints[0][v]*/;
1294cd0c2139SMatthew G Knepley     const PetscInt splitp = pMaxNew[0] + v;
1295cd0c2139SMatthew G Knepley     PetscInt       dof, off, soff, d;
1296cd0c2139SMatthew G Knepley 
1297cd0c2139SMatthew G Knepley     ierr = PetscSectionGetDof(coordSection, newp, &dof);CHKERRQ(ierr);
1298cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, newp, &off);CHKERRQ(ierr);
1299cd0c2139SMatthew G Knepley     ierr = PetscSectionGetOffset(coordSection, splitp, &soff);CHKERRQ(ierr);
1300cd0c2139SMatthew G Knepley     for (d = 0; d < dof; ++d) coords[soff+d] = coords[off+d];
1301cd0c2139SMatthew G Knepley   }
1302cd0c2139SMatthew G Knepley   ierr = VecRestoreArray(coordinates, &coords);CHKERRQ(ierr);
1303cd0c2139SMatthew G Knepley   /* Step 9: SF, if I can figure this out we can split the mesh in parallel */
1304cd0c2139SMatthew G Knepley   ierr = DMPlexShiftSF_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1305cd0c2139SMatthew G Knepley   /* Step 10: Labels */
1306cd0c2139SMatthew G Knepley   ierr = DMPlexShiftLabels_Internal(dm, depthShift, sdm);CHKERRQ(ierr);
1307cd0c2139SMatthew G Knepley   ierr = DMPlexGetNumLabels(sdm, &numLabels);CHKERRQ(ierr);
1308cd0c2139SMatthew G Knepley   for (dep = 0; dep <= depth; ++dep) {
1309cd0c2139SMatthew G Knepley     for (p = 0; p < numSplitPoints[dep]; ++p) {
13102582d50cSToby Isaac       const PetscInt newp   = DMPlexShiftPoint_Internal(splitPoints[dep][p], depth, depthShift) /*depthOffset[dep] + splitPoints[dep][p]*/;
1311cd0c2139SMatthew G Knepley       const PetscInt splitp = pMaxNew[dep] + p;
1312cd0c2139SMatthew G Knepley       PetscInt       l;
1313cd0c2139SMatthew G Knepley 
1314cd0c2139SMatthew G Knepley       for (l = 0; l < numLabels; ++l) {
1315cd0c2139SMatthew G Knepley         DMLabel     mlabel;
1316cd0c2139SMatthew G Knepley         const char *lname;
1317cd0c2139SMatthew G Knepley         PetscInt    val;
13189a356370SMatthew G. Knepley         PetscBool   isDepth;
1319cd0c2139SMatthew G Knepley 
1320cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabelName(sdm, l, &lname);CHKERRQ(ierr);
13219a356370SMatthew G. Knepley         ierr = PetscStrcmp(lname, "depth", &isDepth);CHKERRQ(ierr);
13229a356370SMatthew G. Knepley         if (isDepth) continue;
1323cd0c2139SMatthew G Knepley         ierr = DMPlexGetLabel(sdm, lname, &mlabel);CHKERRQ(ierr);
1324cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(mlabel, newp, &val);CHKERRQ(ierr);
1325cd0c2139SMatthew G Knepley         if (val >= 0) {
1326cd0c2139SMatthew G Knepley           ierr = DMLabelSetValue(mlabel, splitp, val);CHKERRQ(ierr);
13279a356370SMatthew G. Knepley #if 0
13289a356370SMatthew G. Knepley           /* Do not put cohesive edges into the label */
1329cd0c2139SMatthew G Knepley           if (dep == 0) {
13304c367dbcSMatthew G. Knepley             const PetscInt cedge = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
1331cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(mlabel, cedge, val);CHKERRQ(ierr);
13324c367dbcSMatthew G. Knepley           } else if (dep == dim-2) {
13334c367dbcSMatthew G. Knepley             const PetscInt cface = p + pMaxNew[dep+1] + numSplitPoints[dep+1];
13344c367dbcSMatthew G. Knepley             ierr = DMLabelSetValue(mlabel, cface, val);CHKERRQ(ierr);
1335cd0c2139SMatthew G Knepley           }
13364c367dbcSMatthew G. Knepley           /* Do not put cohesive faces into the label */
13379a356370SMatthew G. Knepley #endif
1338cd0c2139SMatthew G Knepley         }
1339cd0c2139SMatthew G Knepley       }
1340cd0c2139SMatthew G Knepley     }
1341cd0c2139SMatthew G Knepley   }
1342cd0c2139SMatthew G Knepley   for (sp = 0; sp < numSP; ++sp) {
1343cd0c2139SMatthew G Knepley     const PetscInt dep = values[sp];
1344cd0c2139SMatthew G Knepley 
1345cd0c2139SMatthew G Knepley     if ((dep < 0) || (dep > depth)) continue;
134618c5995bSMatthew G. Knepley     if (splitIS[dep]) {ierr = ISRestoreIndices(splitIS[dep], &splitPoints[dep]);CHKERRQ(ierr);}
134718c5995bSMatthew G. Knepley     ierr = ISDestroy(&splitIS[dep]);CHKERRQ(ierr);
134818c5995bSMatthew G. Knepley     if (unsplitIS[dep]) {ierr = ISRestoreIndices(unsplitIS[dep], &unsplitPoints[dep]);CHKERRQ(ierr);}
134918c5995bSMatthew G. Knepley     ierr = ISDestroy(&unsplitIS[dep]);CHKERRQ(ierr);
1350cd0c2139SMatthew G Knepley   }
1351cd0c2139SMatthew G Knepley   if (label) {
1352cd0c2139SMatthew G Knepley     ierr = ISRestoreIndices(valueIS, &values);CHKERRQ(ierr);
1353cd0c2139SMatthew G Knepley     ierr = ISDestroy(&valueIS);CHKERRQ(ierr);
1354cd0c2139SMatthew G Knepley   }
13550d4d4d06SMatthew G. Knepley   for (d = 0; d <= depth; ++d) {
13560d4d4d06SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(sdm, d, NULL, &pEnd);CHKERRQ(ierr);
135736dbac82SMatthew G. Knepley     pMaxNew[d] = pEnd - numHybridPoints[d] - numHybridPointsOld[d];
13580d4d4d06SMatthew G. Knepley   }
13590e49e2e2SMatthew 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);
1360dcbb62e8SMatthew G. Knepley   ierr = PetscFree3(coneNew, coneONew, supportNew);CHKERRQ(ierr);
13612582d50cSToby Isaac   ierr = PetscFree5(depthMax, depthEnd, depthShift, pMaxNew, numHybridPointsOld);CHKERRQ(ierr);
136218c5995bSMatthew G. Knepley   ierr = PetscFree7(splitIS, unsplitIS, numSplitPoints, numUnsplitPoints, numHybridPoints, splitPoints, unsplitPoints);CHKERRQ(ierr);
1363cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1364cd0c2139SMatthew G Knepley }
1365cd0c2139SMatthew G Knepley 
1366cd0c2139SMatthew G Knepley #undef __FUNCT__
1367cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexConstructCohesiveCells"
1368cd0c2139SMatthew G Knepley /*@C
1369cd0c2139SMatthew G Knepley   DMPlexConstructCohesiveCells - Construct cohesive cells which split the face along an internal interface
1370cd0c2139SMatthew G Knepley 
1371cd0c2139SMatthew G Knepley   Collective on dm
1372cd0c2139SMatthew G Knepley 
1373cd0c2139SMatthew G Knepley   Input Parameters:
1374cd0c2139SMatthew G Knepley + dm - The original DM
137553156dfcSMatthew G. Knepley - label - The label specifying the boundary faces (this could be auto-generated)
1376cd0c2139SMatthew G Knepley 
1377cd0c2139SMatthew G Knepley   Output Parameters:
1378cd0c2139SMatthew G Knepley - dmSplit - The new DM
1379cd0c2139SMatthew G Knepley 
1380cd0c2139SMatthew G Knepley   Level: developer
1381cd0c2139SMatthew G Knepley 
13822be2b188SMatthew G Knepley .seealso: DMCreate(), DMPlexLabelCohesiveComplete()
1383cd0c2139SMatthew G Knepley @*/
1384cd0c2139SMatthew G Knepley PetscErrorCode DMPlexConstructCohesiveCells(DM dm, DMLabel label, DM *dmSplit)
1385cd0c2139SMatthew G Knepley {
1386cd0c2139SMatthew G Knepley   DM             sdm;
1387cd0c2139SMatthew G Knepley   PetscInt       dim;
1388cd0c2139SMatthew G Knepley   PetscErrorCode ierr;
1389cd0c2139SMatthew G Knepley 
1390cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1391cd0c2139SMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
139253156dfcSMatthew G. Knepley   PetscValidPointer(dmSplit, 3);
1393cd0c2139SMatthew G Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), &sdm);CHKERRQ(ierr);
1394cd0c2139SMatthew G Knepley   ierr = DMSetType(sdm, DMPLEX);CHKERRQ(ierr);
1395c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1396c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(sdm, dim);CHKERRQ(ierr);
1397cd0c2139SMatthew G Knepley   switch (dim) {
1398cd0c2139SMatthew G Knepley   case 2:
1399cd0c2139SMatthew G Knepley   case 3:
1400cd0c2139SMatthew G Knepley     ierr = DMPlexConstructCohesiveCells_Internal(dm, label, sdm);CHKERRQ(ierr);
1401cd0c2139SMatthew G Knepley     break;
1402cd0c2139SMatthew G Knepley   default:
1403cd0c2139SMatthew G Knepley     SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_OUTOFRANGE, "Cannot construct cohesive cells for dimension %d", dim);
1404cd0c2139SMatthew G Knepley   }
1405cd0c2139SMatthew G Knepley   *dmSplit = sdm;
1406cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1407cd0c2139SMatthew G Knepley }
1408cd0c2139SMatthew G Knepley 
1409cd0c2139SMatthew G Knepley #undef __FUNCT__
14100f66a230SMatthew G. Knepley #define __FUNCT__ "GetSurfaceSide_Static"
14110f66a230SMatthew G. Knepley /* Returns the side of the surface for a given cell with a face on the surface */
14120f66a230SMatthew G. Knepley static PetscErrorCode GetSurfaceSide_Static(DM dm, DM subdm, PetscInt numSubpoints, const PetscInt *subpoints, PetscInt cell, PetscInt face, PetscBool *pos)
14130f66a230SMatthew G. Knepley {
14140f66a230SMatthew G. Knepley   const PetscInt *cone, *ornt;
14150f66a230SMatthew G. Knepley   PetscInt        dim, coneSize, c;
14160f66a230SMatthew G. Knepley   PetscErrorCode  ierr;
14170f66a230SMatthew G. Knepley 
14180f66a230SMatthew G. Knepley   PetscFunctionBegin;
14190f66a230SMatthew G. Knepley   *pos = PETSC_TRUE;
1420c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
14210f66a230SMatthew G. Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
14220f66a230SMatthew G. Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
14230f66a230SMatthew G. Knepley   ierr = DMPlexGetConeOrientation(dm, cell, &ornt);CHKERRQ(ierr);
14240f66a230SMatthew G. Knepley   for (c = 0; c < coneSize; ++c) {
14250f66a230SMatthew G. Knepley     if (cone[c] == face) {
14260f66a230SMatthew G. Knepley       PetscInt o = ornt[c];
14270f66a230SMatthew G. Knepley 
14280f66a230SMatthew G. Knepley       if (subdm) {
14290f66a230SMatthew G. Knepley         const PetscInt *subcone, *subornt;
14300f66a230SMatthew G. Knepley         PetscInt        subpoint, subface, subconeSize, sc;
14310f66a230SMatthew G. Knepley 
14320f66a230SMatthew G. Knepley         ierr = PetscFindInt(cell, numSubpoints, subpoints, &subpoint);CHKERRQ(ierr);
14330f66a230SMatthew G. Knepley         ierr = PetscFindInt(face, numSubpoints, subpoints, &subface);CHKERRQ(ierr);
14340f66a230SMatthew G. Knepley         ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
14350f66a230SMatthew G. Knepley         ierr = DMPlexGetCone(subdm, subpoint, &subcone);CHKERRQ(ierr);
14360f66a230SMatthew G. Knepley         ierr = DMPlexGetConeOrientation(subdm, subpoint, &subornt);CHKERRQ(ierr);
14370f66a230SMatthew G. Knepley         for (sc = 0; sc < subconeSize; ++sc) {
14380f66a230SMatthew G. Knepley           if (subcone[sc] == subface) {
14390f66a230SMatthew G. Knepley             o = subornt[0];
14400f66a230SMatthew G. Knepley             break;
14410f66a230SMatthew G. Knepley           }
14420f66a230SMatthew G. Knepley         }
14430f66a230SMatthew 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);
14440f66a230SMatthew G. Knepley       }
14450f66a230SMatthew G. Knepley       if (o >= 0) *pos = PETSC_TRUE;
14460f66a230SMatthew G. Knepley       else        *pos = PETSC_FALSE;
14470f66a230SMatthew G. Knepley       break;
14480f66a230SMatthew G. Knepley     }
14490f66a230SMatthew G. Knepley   }
14500f66a230SMatthew 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);
14510f66a230SMatthew G. Knepley   PetscFunctionReturn(0);
14520f66a230SMatthew G. Knepley }
14530f66a230SMatthew G. Knepley 
14540f66a230SMatthew G. Knepley #undef __FUNCT__
14552be2b188SMatthew G Knepley #define __FUNCT__ "DMPlexLabelCohesiveComplete"
1456cd0c2139SMatthew G Knepley /*@
14570f66a230SMatthew G. Knepley   DMPlexLabelCohesiveComplete - Starting with a label marking points on an internal surface, we add all other mesh pieces
1458cd0c2139SMatthew G Knepley   to complete the surface
1459cd0c2139SMatthew G Knepley 
1460cd0c2139SMatthew G Knepley   Input Parameters:
1461cd0c2139SMatthew G Knepley + dm     - The DM
14620f66a230SMatthew G. Knepley . label  - A DMLabel marking the surface
14630f66a230SMatthew G. Knepley . blabel - A DMLabel marking the vertices on the boundary which will not be duplicated, or NULL to find them automatically
1464bb55d314SMatthew G. Knepley . flip   - Flag to flip the submesh normal and replace points on the other side
146547946fd8SMatthew G. Knepley - subdm  - The subDM associated with the label, or NULL
1466cd0c2139SMatthew G Knepley 
1467cd0c2139SMatthew G Knepley   Output Parameter:
1468cd0c2139SMatthew G Knepley . label - A DMLabel marking all surface points
1469cd0c2139SMatthew G Knepley 
14700f66a230SMatthew G. Knepley   Note: The vertices in blabel are called "unsplit" in the terminology from hybrid cell creation.
14710f66a230SMatthew G. Knepley 
1472cd0c2139SMatthew G Knepley   Level: developer
1473cd0c2139SMatthew G Knepley 
14742be2b188SMatthew G Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelComplete()
1475cd0c2139SMatthew G Knepley @*/
14760f66a230SMatthew G. Knepley PetscErrorCode DMPlexLabelCohesiveComplete(DM dm, DMLabel label, DMLabel blabel, PetscBool flip, DM subdm)
1477cd0c2139SMatthew G Knepley {
1478d90583fdSMatthew G. Knepley   DMLabel         depthLabel;
147986200784SMatthew G. Knepley   IS              dimIS, subpointIS, facePosIS, faceNegIS, crossEdgeIS = NULL;
148047946fd8SMatthew G. Knepley   const PetscInt *points, *subpoints;
1481bb55d314SMatthew G. Knepley   const PetscInt  rev   = flip ? -1 : 1;
1482370472baSMatthew G. Knepley   PetscInt       *pMax;
1483370472baSMatthew G. Knepley   PetscInt        shift = 100, shift2 = 200, dim, depth, pSize, dep, cStart, cEnd, cMax, fStart, fEnd, vStart, vEnd, numPoints, numSubpoints, p, val;
1484cd0c2139SMatthew G Knepley   PetscErrorCode  ierr;
1485cd0c2139SMatthew G Knepley 
1486cd0c2139SMatthew G Knepley   PetscFunctionBegin;
1487370472baSMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1488370472baSMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1489370472baSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1490370472baSMatthew G. Knepley   ierr = PetscMalloc1(pSize,&pMax);CHKERRQ(ierr);
1491370472baSMatthew 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);
1492d90583fdSMatthew G. Knepley   ierr = DMPlexGetDepthLabel(dm, &depthLabel);CHKERRQ(ierr);
1493c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
149447946fd8SMatthew G. Knepley   if (subdm) {
149547946fd8SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpointIS);CHKERRQ(ierr);
149647946fd8SMatthew G. Knepley     if (subpointIS) {
149747946fd8SMatthew G. Knepley       ierr = ISGetLocalSize(subpointIS, &numSubpoints);CHKERRQ(ierr);
149847946fd8SMatthew G. Knepley       ierr = ISGetIndices(subpointIS, &subpoints);CHKERRQ(ierr);
149947946fd8SMatthew G. Knepley     }
150047946fd8SMatthew G. Knepley   }
1501d7c8f101SMatthew G. Knepley   /* Mark cell on the fault, and its faces which touch the fault: cell orientation for face gives the side of the fault */
1502cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, dim-1, &dimIS);CHKERRQ(ierr);
1503dc86033cSMatthew G. Knepley   if (!dimIS) {
1504dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1505dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1506dc86033cSMatthew G. Knepley   }
1507cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1508cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1509d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault faces */
1510cd0c2139SMatthew G Knepley     const PetscInt *support;
1511cd0c2139SMatthew G Knepley     PetscInt        supportSize, s;
1512cd0c2139SMatthew G Knepley 
1513cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupportSize(dm, points[p], &supportSize);CHKERRQ(ierr);
1514cd0c2139SMatthew G Knepley     if (supportSize != 2) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_ARG_WRONG, "Split face %d has %d != 2 supports", points[p], supportSize);
1515cd0c2139SMatthew G Knepley     ierr = DMPlexGetSupport(dm, points[p], &support);CHKERRQ(ierr);
1516cd0c2139SMatthew G Knepley     for (s = 0; s < supportSize; ++s) {
15170f66a230SMatthew G. Knepley       const PetscInt *cone;
1518cd0c2139SMatthew G Knepley       PetscInt        coneSize, c;
15190f66a230SMatthew G. Knepley       PetscBool       pos;
1520cd0c2139SMatthew G Knepley 
15210f66a230SMatthew G. Knepley       ierr = GetSurfaceSide_Static(dm, subdm, numSubpoints, subpoints, support[s], points[p], &pos);CHKERRQ(ierr);
15220f66a230SMatthew G. Knepley       if (pos) {ierr = DMLabelSetValue(label, support[s],  rev*(shift+dim));CHKERRQ(ierr);}
15230f66a230SMatthew G. Knepley       else     {ierr = DMLabelSetValue(label, support[s], -rev*(shift+dim));CHKERRQ(ierr);}
15240f66a230SMatthew G. Knepley       if (rev < 0) pos = !pos ? PETSC_TRUE : PETSC_FALSE;
15250f66a230SMatthew G. Knepley       /* Put faces touching the fault in the label */
1526cd0c2139SMatthew G Knepley       ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
1527cd0c2139SMatthew G Knepley       ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
1528cd0c2139SMatthew G Knepley       for (c = 0; c < coneSize; ++c) {
1529cd0c2139SMatthew G Knepley         const PetscInt point = cone[c];
1530cd0c2139SMatthew G Knepley 
1531cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1532cd0c2139SMatthew G Knepley         if (val == -1) {
1533cd0c2139SMatthew G Knepley           PetscInt *closure = NULL;
1534cd0c2139SMatthew G Knepley           PetscInt  closureSize, cl;
1535cd0c2139SMatthew G Knepley 
1536cd0c2139SMatthew G Knepley           ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1537cd0c2139SMatthew G Knepley           for (cl = 0; cl < closureSize*2; cl += 2) {
1538cd0c2139SMatthew G Knepley             const PetscInt clp  = closure[cl];
1539a0541d8aSMatthew G. Knepley             PetscInt       bval = -1;
1540cd0c2139SMatthew G Knepley 
1541cd0c2139SMatthew G Knepley             ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1542a0541d8aSMatthew G. Knepley             if (blabel) {ierr = DMLabelGetValue(blabel, clp, &bval);CHKERRQ(ierr);}
1543a0541d8aSMatthew G. Knepley             if ((val >= 0) && (val < dim-1) && (bval < 0)) {
1544cd0c2139SMatthew G Knepley               ierr = DMLabelSetValue(label, point, pos == PETSC_TRUE ? shift+dim-1 : -(shift+dim-1));CHKERRQ(ierr);
1545cd0c2139SMatthew G Knepley               break;
1546cd0c2139SMatthew G Knepley             }
1547cd0c2139SMatthew G Knepley           }
1548cd0c2139SMatthew G Knepley           ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1549cd0c2139SMatthew G Knepley         }
1550cd0c2139SMatthew G Knepley       }
1551cd0c2139SMatthew G Knepley     }
1552cd0c2139SMatthew G Knepley   }
15530f66a230SMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
15540f66a230SMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
155547946fd8SMatthew G. Knepley   if (subdm) {
155647946fd8SMatthew G. Knepley     if (subpointIS) {ierr = ISRestoreIndices(subpointIS, &subpoints);CHKERRQ(ierr);}
155747946fd8SMatthew G. Knepley     ierr = ISDestroy(&subpointIS);CHKERRQ(ierr);
155847946fd8SMatthew G. Knepley   }
1559a0541d8aSMatthew G. Knepley   /* Mark boundary points as unsplit */
156086200784SMatthew G. Knepley   if (blabel) {
1561a0541d8aSMatthew G. Knepley     ierr = DMLabelGetStratumIS(blabel, 1, &dimIS);CHKERRQ(ierr);
1562a0541d8aSMatthew G. Knepley     ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1563a0541d8aSMatthew G. Knepley     ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1564a0541d8aSMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1565a0541d8aSMatthew G. Knepley       const PetscInt point = points[p];
1566a0541d8aSMatthew G. Knepley       PetscInt       val, bval;
1567a0541d8aSMatthew G. Knepley 
1568a0541d8aSMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1569a0541d8aSMatthew G. Knepley       if (bval >= 0) {
1570f7019248SMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1571f7019248SMatthew G. Knepley         if ((val < 0) || (val > dim)) {
1572f7019248SMatthew G. Knepley           /* This could be a point added from splitting a vertex on an adjacent fault, otherwise its just wrong */
1573f7019248SMatthew G. Knepley           ierr = DMLabelClearValue(blabel, point, bval);CHKERRQ(ierr);
1574f7019248SMatthew G. Knepley         }
1575f7019248SMatthew G. Knepley       }
1576f7019248SMatthew G. Knepley     }
1577f7019248SMatthew G. Knepley     for (p = 0; p < numPoints; ++p) {
1578f7019248SMatthew G. Knepley       const PetscInt point = points[p];
1579f7019248SMatthew G. Knepley       PetscInt       val, bval;
1580f7019248SMatthew G. Knepley 
1581f7019248SMatthew G. Knepley       ierr = DMLabelGetValue(blabel, point, &bval);CHKERRQ(ierr);
1582f7019248SMatthew G. Knepley       if (bval >= 0) {
158386200784SMatthew G. Knepley         const PetscInt *cone,    *support;
158486200784SMatthew G. Knepley         PetscInt        coneSize, supportSize, s, valA, valB, valE;
158586200784SMatthew G. Knepley 
1586a0541d8aSMatthew G. Knepley         /* Mark as unsplit */
1587a0541d8aSMatthew G. Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1588a0541d8aSMatthew 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);
1589a0541d8aSMatthew G. Knepley         ierr = DMLabelClearValue(label, point, val);CHKERRQ(ierr);
1590a0541d8aSMatthew G. Knepley         ierr = DMLabelSetValue(label, point, shift2+val);CHKERRQ(ierr);
15912c06a818SMatthew G. Knepley         /* Check for cross-edge
15922c06a818SMatthew G. Knepley              A cross-edge has endpoints which are both on the boundary of the surface, but the edge itself is not. */
159386200784SMatthew G. Knepley         if (val != 0) continue;
159486200784SMatthew G. Knepley         ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
159586200784SMatthew G. Knepley         ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
159686200784SMatthew G. Knepley         for (s = 0; s < supportSize; ++s) {
159786200784SMatthew G. Knepley           ierr = DMPlexGetCone(dm, support[s], &cone);CHKERRQ(ierr);
159886200784SMatthew G. Knepley           ierr = DMPlexGetConeSize(dm, support[s], &coneSize);CHKERRQ(ierr);
159986200784SMatthew G. Knepley           if (coneSize != 2) SETERRQ2(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Edge %D has %D vertices != 2", support[s], coneSize);
160086200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[0], &valA);CHKERRQ(ierr);
160186200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, cone[1], &valB);CHKERRQ(ierr);
160286200784SMatthew G. Knepley           ierr = DMLabelGetValue(blabel, support[s], &valE);CHKERRQ(ierr);
160309816f77SMatthew G. Knepley           if ((valE < 0) && (valA >= 0) && (valB >= 0) && (cone[0] != cone[1])) {ierr = DMLabelSetValue(blabel, support[s], 2);CHKERRQ(ierr);}
160486200784SMatthew G. Knepley         }
1605a0541d8aSMatthew G. Knepley       }
1606a0541d8aSMatthew G. Knepley     }
1607a0541d8aSMatthew G. Knepley     ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1608a0541d8aSMatthew G. Knepley     ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1609a0541d8aSMatthew G. Knepley   }
1610cd0c2139SMatthew G Knepley   /* Search for other cells/faces/edges connected to the fault by a vertex */
1611c4d480a2SMatthew G. Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
1612cd0c2139SMatthew G Knepley   ierr = DMPlexGetHeightStratum(dm, 0, &cStart, &cEnd);CHKERRQ(ierr);
1613d24f5ce5SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
1614d24f5ce5SMatthew G. Knepley   cMax = cMax < 0 ? cEnd : cMax;
16150f66a230SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 1, &fStart, &fEnd);CHKERRQ(ierr);
1616cd0c2139SMatthew G Knepley   ierr = DMLabelGetStratumIS(label, 0, &dimIS);CHKERRQ(ierr);
161786200784SMatthew G. Knepley   if (blabel) {ierr = DMLabelGetStratumIS(blabel, 2, &crossEdgeIS);CHKERRQ(ierr);}
161886200784SMatthew G. Knepley   if (dimIS && crossEdgeIS) {
161986200784SMatthew G. Knepley     IS vertIS = dimIS;
162086200784SMatthew G. Knepley 
162186200784SMatthew G. Knepley     ierr = ISExpand(vertIS, crossEdgeIS, &dimIS);CHKERRQ(ierr);
162286200784SMatthew G. Knepley     ierr = ISDestroy(&crossEdgeIS);CHKERRQ(ierr);
162386200784SMatthew G. Knepley     ierr = ISDestroy(&vertIS);CHKERRQ(ierr);
162486200784SMatthew G. Knepley   }
1625dc86033cSMatthew G. Knepley   if (!dimIS) {
1626dc86033cSMatthew G. Knepley     ierr = PetscFree(pMax);CHKERRQ(ierr);
1627dc86033cSMatthew G. Knepley     PetscFunctionReturn(0);
1628dc86033cSMatthew G. Knepley   }
1629cd0c2139SMatthew G Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
1630cd0c2139SMatthew G Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
1631d7c8f101SMatthew G. Knepley   for (p = 0; p < numPoints; ++p) { /* Loop over fault vertices */
1632cd0c2139SMatthew G Knepley     PetscInt *star = NULL;
163386200784SMatthew G. Knepley     PetscInt  starSize, s;
1634cd0c2139SMatthew G Knepley     PetscInt  again = 1;  /* 0: Finished 1: Keep iterating after a change 2: No change */
1635cd0c2139SMatthew G Knepley 
1636d4622b2cSMatthew G. Knepley     /* All points connected to the fault are inside a cell, so at the top level we will only check cells */
1637cd0c2139SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1638cd0c2139SMatthew G Knepley     while (again) {
1639cd0c2139SMatthew G Knepley       if (again > 1) SETERRQ(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Could not classify all cells connected to the fault");
1640cd0c2139SMatthew G Knepley       again = 0;
1641cd0c2139SMatthew G Knepley       for (s = 0; s < starSize*2; s += 2) {
1642cd0c2139SMatthew G Knepley         const PetscInt  point = star[s];
1643cd0c2139SMatthew G Knepley         const PetscInt *cone;
1644cd0c2139SMatthew G Knepley         PetscInt        coneSize, c;
1645cd0c2139SMatthew G Knepley 
1646d24f5ce5SMatthew G. Knepley         if ((point < cStart) || (point >= cMax)) continue;
1647cd0c2139SMatthew G Knepley         ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1648cd0c2139SMatthew G Knepley         if (val != -1) continue;
1649d4622b2cSMatthew G. Knepley         again = again == 1 ? 1 : 2;
1650cd0c2139SMatthew G Knepley         ierr  = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
1651cd0c2139SMatthew G Knepley         ierr  = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
1652cd0c2139SMatthew G Knepley         for (c = 0; c < coneSize; ++c) {
1653cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, cone[c], &val);CHKERRQ(ierr);
1654cd0c2139SMatthew G Knepley           if (val != -1) {
1655d7c8f101SMatthew G. Knepley             const PetscInt *ccone;
1656166d9d0cSMatthew G. Knepley             PetscInt        cconeSize, cc, side;
1657d7c8f101SMatthew G. Knepley 
1658db8edaafSMatthew G. Knepley             if (PetscAbs(val) < shift) SETERRQ3(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d on cell %d has an invalid label %d", cone[c], point, val);
165937a6de01SMatthew G. Knepley             if (val > 0) side =  1;
166037a6de01SMatthew G. Knepley             else         side = -1;
166137a6de01SMatthew G. Knepley             ierr = DMLabelSetValue(label, point, side*(shift+dim));CHKERRQ(ierr);
1662d7c8f101SMatthew G. Knepley             /* Mark cell faces which touch the fault */
1663d7c8f101SMatthew G. Knepley             ierr = DMPlexGetConeSize(dm, point, &cconeSize);CHKERRQ(ierr);
1664d7c8f101SMatthew G. Knepley             ierr = DMPlexGetCone(dm, point, &ccone);CHKERRQ(ierr);
1665d7c8f101SMatthew G. Knepley             for (cc = 0; cc < cconeSize; ++cc) {
1666d7c8f101SMatthew G. Knepley               PetscInt *closure = NULL;
1667d7c8f101SMatthew G. Knepley               PetscInt  closureSize, cl;
1668d7c8f101SMatthew G. Knepley 
1669166d9d0cSMatthew G. Knepley               ierr = DMLabelGetValue(label, ccone[cc], &val);CHKERRQ(ierr);
1670166d9d0cSMatthew G. Knepley               if (val != -1) continue;
1671d7c8f101SMatthew G. Knepley               ierr = DMPlexGetTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1672d4622b2cSMatthew G. Knepley               for (cl = 0; cl < closureSize*2; cl += 2) {
1673d7c8f101SMatthew G. Knepley                 const PetscInt clp = closure[cl];
1674d7c8f101SMatthew G. Knepley 
1675d7c8f101SMatthew G. Knepley                 ierr = DMLabelGetValue(label, clp, &val);CHKERRQ(ierr);
1676d7c8f101SMatthew G. Knepley                 if (val == -1) continue;
1677d7c8f101SMatthew G. Knepley                 ierr = DMLabelSetValue(label, ccone[cc], side*(shift+dim-1));CHKERRQ(ierr);
167837a6de01SMatthew G. Knepley                 break;
167937a6de01SMatthew G. Knepley               }
1680d7c8f101SMatthew G. Knepley               ierr = DMPlexRestoreTransitiveClosure(dm, ccone[cc], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1681cd0c2139SMatthew G Knepley             }
1682cd0c2139SMatthew G Knepley             again = 1;
1683cd0c2139SMatthew G Knepley             break;
1684cd0c2139SMatthew G Knepley           }
1685cd0c2139SMatthew G Knepley         }
1686cd0c2139SMatthew G Knepley       }
1687cd0c2139SMatthew G Knepley     }
1688cd0c2139SMatthew G Knepley     /* Classify the rest by cell membership */
1689cd0c2139SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1690cd0c2139SMatthew G Knepley       const PetscInt point = star[s];
1691cd0c2139SMatthew G Knepley 
1692cd0c2139SMatthew G Knepley       ierr = DMLabelGetValue(label, point, &val);CHKERRQ(ierr);
1693cd0c2139SMatthew G Knepley       if (val == -1) {
1694cd0c2139SMatthew G Knepley         PetscInt  *sstar = NULL;
1695cd0c2139SMatthew G Knepley         PetscInt   sstarSize, ss;
1696cd0c2139SMatthew G Knepley         PetscBool  marked = PETSC_FALSE;
1697cd0c2139SMatthew G Knepley 
1698cd0c2139SMatthew G Knepley         ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1699cd0c2139SMatthew G Knepley         for (ss = 0; ss < sstarSize*2; ss += 2) {
1700cd0c2139SMatthew G Knepley           const PetscInt spoint = sstar[ss];
1701cd0c2139SMatthew G Knepley 
1702d24f5ce5SMatthew G. Knepley           if ((spoint < cStart) || (spoint >= cMax)) continue;
1703cd0c2139SMatthew G Knepley           ierr = DMLabelGetValue(label, spoint, &val);CHKERRQ(ierr);
1704cd0c2139SMatthew 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);
1705d90583fdSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1706cd0c2139SMatthew G Knepley           if (val > 0) {
1707cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point,   shift+dep);CHKERRQ(ierr);
1708cd0c2139SMatthew G Knepley           } else {
1709cd0c2139SMatthew G Knepley             ierr = DMLabelSetValue(label, point, -(shift+dep));CHKERRQ(ierr);
1710cd0c2139SMatthew G Knepley           }
1711cd0c2139SMatthew G Knepley           marked = PETSC_TRUE;
1712cd0c2139SMatthew G Knepley           break;
1713cd0c2139SMatthew G Knepley         }
1714cd0c2139SMatthew G Knepley         ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_FALSE, &sstarSize, &sstar);CHKERRQ(ierr);
1715370472baSMatthew G. Knepley         ierr = DMLabelGetValue(depthLabel, point, &dep);CHKERRQ(ierr);
1716370472baSMatthew G. Knepley         if (point < pMax[dep] && !marked) SETERRQ1(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Point %d could not be classified", point);
1717cd0c2139SMatthew G Knepley       }
1718cd0c2139SMatthew G Knepley     }
1719cd0c2139SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, points[p], PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1720cd0c2139SMatthew G Knepley   }
1721cd0c2139SMatthew G Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
1722cd0c2139SMatthew G Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
172318c5995bSMatthew G. Knepley   /* If any faces touching the fault divide cells on either side, split them */
172418c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label,   shift+dim-1,  &facePosIS);CHKERRQ(ierr);
172518c5995bSMatthew G. Knepley   ierr = DMLabelGetStratumIS(label, -(shift+dim-1), &faceNegIS);CHKERRQ(ierr);
172618c5995bSMatthew G. Knepley   ierr = ISExpand(facePosIS, faceNegIS, &dimIS);CHKERRQ(ierr);
172718c5995bSMatthew G. Knepley   ierr = ISDestroy(&facePosIS);CHKERRQ(ierr);
172818c5995bSMatthew G. Knepley   ierr = ISDestroy(&faceNegIS);CHKERRQ(ierr);
172918c5995bSMatthew G. Knepley   ierr = ISGetLocalSize(dimIS, &numPoints);CHKERRQ(ierr);
173018c5995bSMatthew G. Knepley   ierr = ISGetIndices(dimIS, &points);CHKERRQ(ierr);
173118c5995bSMatthew G. Knepley   for (p = 0; p < numPoints; ++p) {
173218c5995bSMatthew G. Knepley     const PetscInt  point = points[p];
173318c5995bSMatthew G. Knepley     const PetscInt *support;
173418c5995bSMatthew G. Knepley     PetscInt        supportSize, valA, valB;
173518c5995bSMatthew G. Knepley 
173618c5995bSMatthew G. Knepley     ierr = DMPlexGetSupportSize(dm, point, &supportSize);CHKERRQ(ierr);
173718c5995bSMatthew G. Knepley     if (supportSize != 2) continue;
173818c5995bSMatthew G. Knepley     ierr = DMPlexGetSupport(dm, point, &support);CHKERRQ(ierr);
173918c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[0], &valA);CHKERRQ(ierr);
174018c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, support[1], &valB);CHKERRQ(ierr);
174118c5995bSMatthew G. Knepley     if ((valA == -1) || (valB == -1)) continue;
174218c5995bSMatthew G. Knepley     if (valA*valB > 0) continue;
174318c5995bSMatthew G. Knepley     /* Split the face */
174418c5995bSMatthew G. Knepley     ierr = DMLabelGetValue(label, point, &valA);CHKERRQ(ierr);
174518c5995bSMatthew G. Knepley     ierr = DMLabelClearValue(label, point, valA);CHKERRQ(ierr);
174618c5995bSMatthew G. Knepley     ierr = DMLabelSetValue(label, point, dim-1);CHKERRQ(ierr);
1747e1757548SMatthew G. Knepley     /* Label its closure:
1748e1757548SMatthew G. Knepley       unmarked: label as unsplit
1749e1757548SMatthew G. Knepley       incident: relabel as split
1750e1757548SMatthew G. Knepley       split:    do nothing
1751e1757548SMatthew G. Knepley     */
175218c5995bSMatthew G. Knepley     {
175318c5995bSMatthew G. Knepley       PetscInt *closure = NULL;
175418c5995bSMatthew G. Knepley       PetscInt  closureSize, cl;
175518c5995bSMatthew G. Knepley 
175618c5995bSMatthew G. Knepley       ierr = DMPlexGetTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
175718c5995bSMatthew G. Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
175818c5995bSMatthew G. Knepley         ierr = DMLabelGetValue(label, closure[cl], &valA);CHKERRQ(ierr);
17598771c1d3SMatthew G. Knepley         if (valA == -1) { /* Mark as unsplit */
176018c5995bSMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
176118c5995bSMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], shift2+dep);CHKERRQ(ierr);
17628771c1d3SMatthew G. Knepley         } else if (((valA >= shift) && (valA < shift2)) || ((valA <= -shift) && (valA > -shift2))) {
1763e1757548SMatthew G. Knepley           ierr = DMLabelGetValue(depthLabel, closure[cl], &dep);CHKERRQ(ierr);
1764e1757548SMatthew G. Knepley           ierr = DMLabelClearValue(label, closure[cl], valA);CHKERRQ(ierr);
1765e1757548SMatthew G. Knepley           ierr = DMLabelSetValue(label, closure[cl], dep);CHKERRQ(ierr);
1766e1757548SMatthew G. Knepley         }
176718c5995bSMatthew G. Knepley       }
176818c5995bSMatthew G. Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, point, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
176918c5995bSMatthew G. Knepley     }
177018c5995bSMatthew G. Knepley   }
177118c5995bSMatthew G. Knepley   ierr = ISRestoreIndices(dimIS, &points);CHKERRQ(ierr);
177218c5995bSMatthew G. Knepley   ierr = ISDestroy(&dimIS);CHKERRQ(ierr);
1773370472baSMatthew G. Knepley   ierr = PetscFree(pMax);CHKERRQ(ierr);
1774cd0c2139SMatthew G Knepley   PetscFunctionReturn(0);
1775cd0c2139SMatthew G Knepley }
1776cd0c2139SMatthew G Knepley 
1777cd0c2139SMatthew G Knepley #undef __FUNCT__
17783cf72582SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateHybridMesh"
17793cf72582SMatthew G. Knepley /*@C
17803cf72582SMatthew G. Knepley   DMPlexCreateHybridMesh - Create a mesh with hybrid cells along an internal interface
17813cf72582SMatthew G. Knepley 
17823cf72582SMatthew G. Knepley   Collective on dm
17833cf72582SMatthew G. Knepley 
17843cf72582SMatthew G. Knepley   Input Parameters:
17853cf72582SMatthew G. Knepley + dm - The original DM
17863cf72582SMatthew G. Knepley - labelName - The label specifying the interface vertices
17873cf72582SMatthew G. Knepley 
17883cf72582SMatthew G. Knepley   Output Parameters:
17893cf72582SMatthew G. Knepley + hybridLabel - The label fully marking the interface
17903cf72582SMatthew G. Knepley - dmHybrid - The new DM
17913cf72582SMatthew G. Knepley 
17923cf72582SMatthew G. Knepley   Level: developer
17933cf72582SMatthew G. Knepley 
17943cf72582SMatthew G. Knepley .seealso: DMPlexConstructCohesiveCells(), DMPlexLabelCohesiveComplete(), DMCreate()
17953cf72582SMatthew G. Knepley @*/
17963cf72582SMatthew G. Knepley PetscErrorCode DMPlexCreateHybridMesh(DM dm, DMLabel label, DMLabel *hybridLabel, DM *dmHybrid)
17973cf72582SMatthew G. Knepley {
17983cf72582SMatthew G. Knepley   DM             idm;
17993cf72582SMatthew G. Knepley   DMLabel        subpointMap, hlabel;
18003cf72582SMatthew G. Knepley   PetscInt       dim;
18013cf72582SMatthew G. Knepley   PetscErrorCode ierr;
18023cf72582SMatthew G. Knepley 
18033cf72582SMatthew G. Knepley   PetscFunctionBegin;
18043cf72582SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
18053cf72582SMatthew G. Knepley   if (hybridLabel) PetscValidPointer(hybridLabel, 3);
18063cf72582SMatthew G. Knepley   PetscValidPointer(dmHybrid, 4);
1807c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
18083cf72582SMatthew G. Knepley   ierr = DMPlexCreateSubmesh(dm, label, 1, &idm);CHKERRQ(ierr);
18093cf72582SMatthew G. Knepley   ierr = DMPlexOrient(idm);CHKERRQ(ierr);
18103cf72582SMatthew G. Knepley   ierr = DMPlexGetSubpointMap(idm, &subpointMap);CHKERRQ(ierr);
18113cf72582SMatthew G. Knepley   ierr = DMLabelDuplicate(subpointMap, &hlabel);CHKERRQ(ierr);
18123cf72582SMatthew G. Knepley   ierr = DMLabelClearStratum(hlabel, dim);CHKERRQ(ierr);
18130f66a230SMatthew G. Knepley   ierr = DMPlexLabelCohesiveComplete(dm, hlabel, NULL, PETSC_FALSE, idm);CHKERRQ(ierr);
18143cf72582SMatthew G. Knepley   ierr = DMDestroy(&idm);CHKERRQ(ierr);
18153cf72582SMatthew G. Knepley   ierr = DMPlexConstructCohesiveCells(dm, hlabel, dmHybrid);CHKERRQ(ierr);
18163cf72582SMatthew G. Knepley   if (hybridLabel) *hybridLabel = hlabel;
181753aa2e23SMatthew G. Knepley   else             {ierr = DMLabelDestroy(&hlabel);CHKERRQ(ierr);}
1818e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
1819e6ccafaeSMatthew G Knepley }
1820e6ccafaeSMatthew G Knepley 
1821e6ccafaeSMatthew G Knepley #undef __FUNCT__
1822efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Uninterpolated"
1823efa14ee0SMatthew G Knepley /* Here we need the explicit assumption that:
1824efa14ee0SMatthew G Knepley 
1825efa14ee0SMatthew G Knepley      For any marked cell, the marked vertices constitute a single face
1826efa14ee0SMatthew G Knepley */
1827830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, PetscInt *numFaces, PetscInt *nFV, DM subdm)
1828efa14ee0SMatthew G Knepley {
1829fed694aaSMatthew G. Knepley   IS               subvertexIS = NULL;
1830efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
183177d178adSMatthew G. Knepley   PetscInt        *pStart, *pEnd, *pMax, pSize;
1832efa14ee0SMatthew G Knepley   PetscInt         depth, dim, d, numSubVerticesInitial = 0, v;
1833efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1834efa14ee0SMatthew G Knepley 
1835efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1836efa14ee0SMatthew G Knepley   *numFaces = 0;
1837efa14ee0SMatthew G Knepley   *nFV      = 0;
1838efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
1839c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
184077d178adSMatthew G. Knepley   pSize = PetscMax(depth, dim) + 1;
1841dcca6d9dSJed Brown   ierr = PetscMalloc3(pSize,&pStart,pSize,&pEnd,pSize,&pMax);CHKERRQ(ierr);
1842d92e47f8SMatthew 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);
1843efa14ee0SMatthew G Knepley   for (d = 0; d <= depth; ++d) {
1844efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1845efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1846efa14ee0SMatthew G Knepley   }
1847efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
1848fed694aaSMatthew G. Knepley   if (vertexLabel) {ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);}
1849efa14ee0SMatthew G Knepley   if (subvertexIS) {
1850efa14ee0SMatthew G Knepley     ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1851efa14ee0SMatthew G Knepley     ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1852efa14ee0SMatthew G Knepley   }
1853efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1854efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
18550298fd71SBarry Smith     PetscInt      *star   = NULL;
1856efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numCells = 0, c;
1857efa14ee0SMatthew G Knepley 
1858efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1859efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1860efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1861efa14ee0SMatthew G Knepley       if ((point >= pStart[depth]) && (point < pEnd[depth])) star[numCells++] = point;
1862efa14ee0SMatthew G Knepley     }
1863efa14ee0SMatthew G Knepley     for (c = 0; c < numCells; ++c) {
1864efa14ee0SMatthew G Knepley       const PetscInt cell    = star[c];
18650298fd71SBarry Smith       PetscInt      *closure = NULL;
1866efa14ee0SMatthew G Knepley       PetscInt       closureSize, cl;
1867efa14ee0SMatthew G Knepley       PetscInt       cellLoc, numCorners = 0, faceSize = 0;
1868efa14ee0SMatthew G Knepley 
1869efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, cell, &cellLoc);CHKERRQ(ierr);
187065560c7fSMatthew G Knepley       if (cellLoc == 2) continue;
187182f516ccSBarry Smith       if (cellLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Cell %d has dimension %d in the surface label", cell, cellLoc);
1872efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1873efa14ee0SMatthew G Knepley       for (cl = 0; cl < closureSize*2; cl += 2) {
1874efa14ee0SMatthew G Knepley         const PetscInt point = closure[cl];
1875efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1876efa14ee0SMatthew G Knepley 
1877efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1878efa14ee0SMatthew G Knepley           ++numCorners;
1879efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1880830e53efSMatthew G. Knepley           if (vertexLoc == value) closure[faceSize++] = point;
1881efa14ee0SMatthew G Knepley         }
1882efa14ee0SMatthew G Knepley       }
188318ad9376SMatthew G. Knepley       if (!(*nFV)) {ierr = DMPlexGetNumFaceVertices(dm, dim, numCorners, nFV);CHKERRQ(ierr);}
188482f516ccSBarry 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);
1885efa14ee0SMatthew G Knepley       if (faceSize == *nFV) {
1886007baee2SMatthew G. Knepley         const PetscInt *cells = NULL;
1887007baee2SMatthew G. Knepley         PetscInt        numCells, nc;
1888007baee2SMatthew G. Knepley 
1889efa14ee0SMatthew G Knepley         ++(*numFaces);
1890efa14ee0SMatthew G Knepley         for (cl = 0; cl < faceSize; ++cl) {
1891efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, closure[cl], 0);CHKERRQ(ierr);
1892efa14ee0SMatthew G Knepley         }
1893007baee2SMatthew G. Knepley         ierr = DMPlexGetJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1894007baee2SMatthew G. Knepley         for (nc = 0; nc < numCells; ++nc) {
1895007baee2SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, cells[nc], 2);CHKERRQ(ierr);
1896007baee2SMatthew G. Knepley         }
1897007baee2SMatthew G. Knepley         ierr = DMPlexRestoreJoin(dm, faceSize, closure, &numCells, &cells);CHKERRQ(ierr);
1898efa14ee0SMatthew G Knepley       }
1899efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1900efa14ee0SMatthew G Knepley     }
1901efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1902efa14ee0SMatthew G Knepley   }
1903efa14ee0SMatthew G Knepley   if (subvertexIS) {
1904efa14ee0SMatthew G Knepley     ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1905efa14ee0SMatthew G Knepley   }
1906efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1907efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1908efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1909efa14ee0SMatthew G Knepley }
1910efa14ee0SMatthew G Knepley 
1911efa14ee0SMatthew G Knepley #undef __FUNCT__
1912efa14ee0SMatthew G Knepley #define __FUNCT__ "DMPlexMarkSubmesh_Interpolated"
1913830e53efSMatthew G. Knepley static PetscErrorCode DMPlexMarkSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DMLabel subpointMap, DM subdm)
1914efa14ee0SMatthew G Knepley {
191534b4c39eSMatthew G. Knepley   IS               subvertexIS = NULL;
1916efa14ee0SMatthew G Knepley   const PetscInt  *subvertices;
1917efa14ee0SMatthew G Knepley   PetscInt        *pStart, *pEnd, *pMax;
1918efa14ee0SMatthew G Knepley   PetscInt         dim, d, numSubVerticesInitial = 0, v;
1919efa14ee0SMatthew G Knepley   PetscErrorCode   ierr;
1920efa14ee0SMatthew G Knepley 
1921efa14ee0SMatthew G Knepley   PetscFunctionBegin;
1922c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
1923dcca6d9dSJed Brown   ierr = PetscMalloc3(dim+1,&pStart,dim+1,&pEnd,dim+1,&pMax);CHKERRQ(ierr);
19240298fd71SBarry Smith   ierr = DMPlexGetHybridBounds(dm, &pMax[dim], dim>1 ? &pMax[dim-1] : NULL, dim > 2 ? &pMax[1] : NULL, &pMax[0]);CHKERRQ(ierr);
1925efa14ee0SMatthew G Knepley   for (d = 0; d <= dim; ++d) {
1926efa14ee0SMatthew G Knepley     ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);
1927efa14ee0SMatthew G Knepley     if (pMax[d] >= 0) pEnd[d] = PetscMin(pEnd[d], pMax[d]);
1928efa14ee0SMatthew G Knepley   }
1929efa14ee0SMatthew G Knepley   /* Loop over initial vertices and mark all faces in the collective star() */
193034b4c39eSMatthew G. Knepley   if (vertexLabel) {
1931830e53efSMatthew G. Knepley     ierr = DMLabelGetStratumIS(vertexLabel, value, &subvertexIS);CHKERRQ(ierr);
1932efa14ee0SMatthew G Knepley     if (subvertexIS) {
1933efa14ee0SMatthew G Knepley       ierr = ISGetSize(subvertexIS, &numSubVerticesInitial);CHKERRQ(ierr);
1934efa14ee0SMatthew G Knepley       ierr = ISGetIndices(subvertexIS, &subvertices);CHKERRQ(ierr);
1935efa14ee0SMatthew G Knepley     }
193634b4c39eSMatthew G. Knepley   }
1937efa14ee0SMatthew G Knepley   for (v = 0; v < numSubVerticesInitial; ++v) {
1938efa14ee0SMatthew G Knepley     const PetscInt vertex = subvertices[v];
19390298fd71SBarry Smith     PetscInt      *star   = NULL;
1940efa14ee0SMatthew G Knepley     PetscInt       starSize, s, numFaces = 0, f;
1941efa14ee0SMatthew G Knepley 
1942efa14ee0SMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1943efa14ee0SMatthew G Knepley     for (s = 0; s < starSize*2; s += 2) {
1944efa14ee0SMatthew G Knepley       const PetscInt point = star[s];
1945efa14ee0SMatthew G Knepley       if ((point >= pStart[dim-1]) && (point < pEnd[dim-1])) star[numFaces++] = point;
1946efa14ee0SMatthew G Knepley     }
1947efa14ee0SMatthew G Knepley     for (f = 0; f < numFaces; ++f) {
1948efa14ee0SMatthew G Knepley       const PetscInt face    = star[f];
19490298fd71SBarry Smith       PetscInt      *closure = NULL;
1950efa14ee0SMatthew G Knepley       PetscInt       closureSize, c;
1951efa14ee0SMatthew G Knepley       PetscInt       faceLoc;
1952efa14ee0SMatthew G Knepley 
1953efa14ee0SMatthew G Knepley       ierr = DMLabelGetValue(subpointMap, face, &faceLoc);CHKERRQ(ierr);
1954efa14ee0SMatthew G Knepley       if (faceLoc == dim-1) continue;
195582f516ccSBarry Smith       if (faceLoc >= 0) SETERRQ2(PetscObjectComm((PetscObject)dm), PETSC_ERR_PLIB, "Face %d has dimension %d in the surface label", face, faceLoc);
1956efa14ee0SMatthew G Knepley       ierr = DMPlexGetTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1957efa14ee0SMatthew G Knepley       for (c = 0; c < closureSize*2; c += 2) {
1958efa14ee0SMatthew G Knepley         const PetscInt point = closure[c];
1959efa14ee0SMatthew G Knepley         PetscInt       vertexLoc;
1960efa14ee0SMatthew G Knepley 
1961efa14ee0SMatthew G Knepley         if ((point >= pStart[0]) && (point < pEnd[0])) {
1962efa14ee0SMatthew G Knepley           ierr = DMLabelGetValue(vertexLabel, point, &vertexLoc);CHKERRQ(ierr);
1963830e53efSMatthew G. Knepley           if (vertexLoc != value) break;
1964efa14ee0SMatthew G Knepley         }
1965efa14ee0SMatthew G Knepley       }
1966efa14ee0SMatthew G Knepley       if (c == closureSize*2) {
1967efa14ee0SMatthew G Knepley         const PetscInt *support;
1968efa14ee0SMatthew G Knepley         PetscInt        supportSize, s;
1969efa14ee0SMatthew G Knepley 
1970efa14ee0SMatthew G Knepley         for (c = 0; c < closureSize*2; c += 2) {
1971efa14ee0SMatthew G Knepley           const PetscInt point = closure[c];
1972efa14ee0SMatthew G Knepley 
1973efa14ee0SMatthew G Knepley           for (d = 0; d < dim; ++d) {
1974efa14ee0SMatthew G Knepley             if ((point >= pStart[d]) && (point < pEnd[d])) {
1975efa14ee0SMatthew G Knepley               ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
1976efa14ee0SMatthew G Knepley               break;
1977efa14ee0SMatthew G Knepley             }
1978efa14ee0SMatthew G Knepley           }
1979efa14ee0SMatthew G Knepley         }
1980efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupportSize(dm, face, &supportSize);CHKERRQ(ierr);
1981efa14ee0SMatthew G Knepley         ierr = DMPlexGetSupport(dm, face, &support);CHKERRQ(ierr);
1982efa14ee0SMatthew G Knepley         for (s = 0; s < supportSize; ++s) {
1983efa14ee0SMatthew G Knepley           ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
1984efa14ee0SMatthew G Knepley         }
1985efa14ee0SMatthew G Knepley       }
1986efa14ee0SMatthew G Knepley       ierr = DMPlexRestoreTransitiveClosure(dm, face, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
1987efa14ee0SMatthew G Knepley     }
1988efa14ee0SMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, vertex, PETSC_FALSE, &starSize, &star);CHKERRQ(ierr);
1989efa14ee0SMatthew G Knepley   }
199034b4c39eSMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subvertices);CHKERRQ(ierr);}
1991efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
1992efa14ee0SMatthew G Knepley   ierr = PetscFree3(pStart,pEnd,pMax);CHKERRQ(ierr);
1993efa14ee0SMatthew G Knepley   PetscFunctionReturn(0);
1994efa14ee0SMatthew G Knepley }
1995efa14ee0SMatthew G Knepley 
1996efa14ee0SMatthew G Knepley #undef __FUNCT__
1997766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Uninterpolated"
199827c04023SMatthew 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)
1999766ab985SMatthew G. Knepley {
200027c04023SMatthew G. Knepley   DMLabel         label = NULL;
2001766ab985SMatthew G. Knepley   const PetscInt *cone;
200227234c99SMatthew G. Knepley   PetscInt        dim, cMax, cEnd, c, subc = 0, p, coneSize;
2003766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2004766ab985SMatthew G. Knepley 
2005812bfc34SJed Brown   PetscFunctionBegin;
2006c0ed958bSJed Brown   *numFaces = 0;
2007c0ed958bSJed Brown   *nFV = 0;
2008b6d5cb33SJed Brown   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
2009fed694aaSMatthew G. Knepley   *subCells = NULL;
2010c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2011766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2012766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2013766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
201427c04023SMatthew G. Knepley   if (label) {
201527c04023SMatthew G. Knepley     for (c = cMax; c < cEnd; ++c) {
201627c04023SMatthew G. Knepley       PetscInt val;
201727c04023SMatthew G. Knepley 
201827c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
201927c04023SMatthew G. Knepley       if (val == value) {
202027c04023SMatthew G. Knepley         ++(*numFaces);
202127c04023SMatthew G. Knepley         ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
202227c04023SMatthew G. Knepley       }
202327c04023SMatthew G. Knepley     }
202427c04023SMatthew G. Knepley   } else {
2025766ab985SMatthew G. Knepley     *numFaces = cEnd - cMax;
202627c04023SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cMax, &coneSize);CHKERRQ(ierr);
202727c04023SMatthew G. Knepley   }
2028766ab985SMatthew G. Knepley   *nFV = hasLagrange ? coneSize/3 : coneSize/2;
2029785e854fSJed Brown   ierr = PetscMalloc1(*numFaces *2, subCells);CHKERRQ(ierr);
2030766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2031766ab985SMatthew G. Knepley     const PetscInt *cells;
2032766ab985SMatthew G. Knepley     PetscInt        numCells;
2033766ab985SMatthew G. Knepley 
203427c04023SMatthew G. Knepley     if (label) {
203527c04023SMatthew G. Knepley       PetscInt val;
203627c04023SMatthew G. Knepley 
203727c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
203827c04023SMatthew G. Knepley       if (val != value) continue;
203927c04023SMatthew G. Knepley     }
2040766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2041766ab985SMatthew G. Knepley     for (p = 0; p < *nFV; ++p) {
2042766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cone[p], 0);CHKERRQ(ierr);
2043766ab985SMatthew G. Knepley     }
2044766ab985SMatthew G. Knepley     /* Negative face */
2045766ab985SMatthew G. Knepley     ierr = DMPlexGetJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
204627234c99SMatthew G. Knepley     /* Not true in parallel
204727234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
2048766ab985SMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
2049766ab985SMatthew G. Knepley       ierr = DMLabelSetValue(subpointMap, cells[p], 2);CHKERRQ(ierr);
205027234c99SMatthew G. Knepley       (*subCells)[subc++] = cells[p];
2051766ab985SMatthew G. Knepley     }
2052766ab985SMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, *nFV, cone, &numCells, &cells);CHKERRQ(ierr);
2053766ab985SMatthew G. Knepley     /* Positive face is not included */
2054766ab985SMatthew G. Knepley   }
2055766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2056766ab985SMatthew G. Knepley }
2057766ab985SMatthew G. Knepley 
2058766ab985SMatthew G. Knepley #undef __FUNCT__
2059766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexMarkCohesiveSubmesh_Interpolated"
20603982b651SMatthew G. Knepley static PetscErrorCode DMPlexMarkCohesiveSubmesh_Interpolated(DM dm, DMLabel label, PetscInt value, DMLabel subpointMap, DM subdm)
2061766ab985SMatthew G. Knepley {
2062766ab985SMatthew G. Knepley   PetscInt      *pStart, *pEnd;
2063766ab985SMatthew G. Knepley   PetscInt       dim, cMax, cEnd, c, d;
2064766ab985SMatthew G. Knepley   PetscErrorCode ierr;
2065766ab985SMatthew G. Knepley 
2066812bfc34SJed Brown   PetscFunctionBegin;
2067c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2068766ab985SMatthew G. Knepley   ierr = DMPlexGetHeightStratum(dm, 0, NULL, &cEnd);CHKERRQ(ierr);
2069766ab985SMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
2070766ab985SMatthew G. Knepley   if (cMax < 0) PetscFunctionReturn(0);
2071dcca6d9dSJed Brown   ierr = PetscMalloc2(dim+1,&pStart,dim+1,&pEnd);CHKERRQ(ierr);
2072b3154360SMatthew G. Knepley   for (d = 0; d <= dim; ++d) {ierr = DMPlexGetDepthStratum(dm, d, &pStart[d], &pEnd[d]);CHKERRQ(ierr);}
2073766ab985SMatthew G. Knepley   for (c = cMax; c < cEnd; ++c) {
2074766ab985SMatthew G. Knepley     const PetscInt *cone;
2075766ab985SMatthew G. Knepley     PetscInt       *closure = NULL;
2076b3154360SMatthew G. Knepley     PetscInt        fconeSize, coneSize, closureSize, cl, val;
2077766ab985SMatthew G. Knepley 
207827c04023SMatthew G. Knepley     if (label) {
207927c04023SMatthew G. Knepley       ierr = DMLabelGetValue(label, c, &val);CHKERRQ(ierr);
208027c04023SMatthew G. Knepley       if (val != value) continue;
208127c04023SMatthew G. Knepley     }
2082766ab985SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, c, &coneSize);CHKERRQ(ierr);
2083766ab985SMatthew G. Knepley     ierr = DMPlexGetCone(dm, c, &cone);CHKERRQ(ierr);
2084b3154360SMatthew G. Knepley     ierr = DMPlexGetConeSize(dm, cone[0], &fconeSize);CHKERRQ(ierr);
2085b3154360SMatthew G. Knepley     if (coneSize != (fconeSize ? fconeSize : 1) + 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells");
2086b3154360SMatthew G. Knepley     /* Negative face */
2087766ab985SMatthew G. Knepley     ierr = DMPlexGetTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2088766ab985SMatthew G. Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2089766ab985SMatthew G. Knepley       const PetscInt point = closure[cl];
2090766ab985SMatthew G. Knepley 
2091766ab985SMatthew G. Knepley       for (d = 0; d <= dim; ++d) {
2092766ab985SMatthew G. Knepley         if ((point >= pStart[d]) && (point < pEnd[d])) {
2093766ab985SMatthew G. Knepley           ierr = DMLabelSetValue(subpointMap, point, d);CHKERRQ(ierr);
2094766ab985SMatthew G. Knepley           break;
2095766ab985SMatthew G. Knepley         }
2096766ab985SMatthew G. Knepley       }
2097766ab985SMatthew G. Knepley     }
2098766ab985SMatthew G. Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cone[0], PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2099766ab985SMatthew G. Knepley     /* Cells -- positive face is not included */
2100766ab985SMatthew G. Knepley     for (cl = 0; cl < 1; ++cl) {
2101766ab985SMatthew G. Knepley       const PetscInt *support;
2102766ab985SMatthew G. Knepley       PetscInt        supportSize, s;
2103766ab985SMatthew G. Knepley 
2104766ab985SMatthew G. Knepley       ierr = DMPlexGetSupportSize(dm, cone[cl], &supportSize);CHKERRQ(ierr);
2105711de394SMatthew G. Knepley       /* if (supportSize != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive faces should separate two cells"); */
2106766ab985SMatthew G. Knepley       ierr = DMPlexGetSupport(dm, cone[cl], &support);CHKERRQ(ierr);
2107766ab985SMatthew G. Knepley       for (s = 0; s < supportSize; ++s) {
2108766ab985SMatthew G. Knepley         ierr = DMLabelSetValue(subpointMap, support[s], dim);CHKERRQ(ierr);
2109766ab985SMatthew G. Knepley       }
2110766ab985SMatthew G. Knepley     }
2111766ab985SMatthew G. Knepley   }
2112766ab985SMatthew G. Knepley   ierr = PetscFree2(pStart, pEnd);CHKERRQ(ierr);
2113766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
2114766ab985SMatthew G. Knepley }
2115766ab985SMatthew G. Knepley 
2116766ab985SMatthew G. Knepley #undef __FUNCT__
2117e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetFaceOrientation"
2118e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetFaceOrientation(DM dm, PetscInt cell, PetscInt numCorners, PetscInt indices[], PetscInt oppositeVertex, PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2119e6ccafaeSMatthew G Knepley {
212082f516ccSBarry Smith   MPI_Comm       comm;
2121e6ccafaeSMatthew G Knepley   PetscBool      posOrient = PETSC_FALSE;
2122e6ccafaeSMatthew G Knepley   const PetscInt debug     = 0;
2123e6ccafaeSMatthew G Knepley   PetscInt       cellDim, faceSize, f;
2124e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2125e6ccafaeSMatthew G Knepley 
212682f516ccSBarry Smith   PetscFunctionBegin;
212782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2128c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &cellDim);CHKERRQ(ierr);
2129e6ccafaeSMatthew G Knepley   if (debug) {PetscPrintf(comm, "cellDim: %d numCorners: %d\n", cellDim, numCorners);CHKERRQ(ierr);}
2130e6ccafaeSMatthew G Knepley 
2131ddeab2a6SMatthew G. Knepley   if (cellDim == 1 && numCorners == 2) {
2132ddeab2a6SMatthew G. Knepley     /* Triangle */
2133e6ccafaeSMatthew G Knepley     faceSize  = numCorners-1;
2134e6ccafaeSMatthew G Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2135ddeab2a6SMatthew G. Knepley   } else if (cellDim == 2 && numCorners == 3) {
2136ddeab2a6SMatthew G. Knepley     /* Triangle */
2137ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2138ddeab2a6SMatthew G. Knepley     posOrient = !(oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2139ddeab2a6SMatthew G. Knepley   } else if (cellDim == 3 && numCorners == 4) {
2140ddeab2a6SMatthew G. Knepley     /* Tetrahedron */
2141ddeab2a6SMatthew G. Knepley     faceSize  = numCorners-1;
2142ddeab2a6SMatthew G. Knepley     posOrient = (oppositeVertex%2) ? PETSC_TRUE : PETSC_FALSE;
2143e6ccafaeSMatthew G Knepley   } else if (cellDim == 1 && numCorners == 3) {
2144e6ccafaeSMatthew G Knepley     /* Quadratic line */
2145e6ccafaeSMatthew G Knepley     faceSize  = 1;
2146e6ccafaeSMatthew G Knepley     posOrient = PETSC_TRUE;
2147e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 4) {
2148e6ccafaeSMatthew G Knepley     /* Quads */
2149e6ccafaeSMatthew G Knepley     faceSize = 2;
2150e6ccafaeSMatthew G Knepley     if ((indices[1] > indices[0]) && (indices[1] - indices[0] == 1)) {
2151e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2152e6ccafaeSMatthew G Knepley     } else if ((indices[0] == 3) && (indices[1] == 0)) {
2153e6ccafaeSMatthew G Knepley       posOrient = PETSC_TRUE;
2154e6ccafaeSMatthew G Knepley     } else {
2155e6ccafaeSMatthew G Knepley       if (((indices[0] > indices[1]) && (indices[0] - indices[1] == 1)) || ((indices[0] == 0) && (indices[1] == 3))) {
2156e6ccafaeSMatthew G Knepley         posOrient = PETSC_FALSE;
2157e6ccafaeSMatthew G Knepley       } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossedge");
2158e6ccafaeSMatthew G Knepley     }
2159e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 6) {
2160e6ccafaeSMatthew G Knepley     /* Quadratic triangle (I hate this) */
2161e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2162e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTri = 3;
2163e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2164e6ccafaeSMatthew G Knepley     PetscBool      found                    = PETSC_FALSE;
2165e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTriSorted[9] = {
2166e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2167e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2168e6ccafaeSMatthew G Knepley       2, 3,  5, /* left */
2169e6ccafaeSMatthew G Knepley     };
2170e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTri[9] = {
2171e6ccafaeSMatthew G Knepley       0, 3,  4, /* bottom */
2172e6ccafaeSMatthew G Knepley       1, 4,  5, /* right */
2173e6ccafaeSMatthew G Knepley       2, 5,  3, /* left */
2174e6ccafaeSMatthew G Knepley     };
2175e6ccafaeSMatthew G Knepley 
2176e6ccafaeSMatthew G Knepley     faceSize = faceSizeTri;
2177e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTri; ++i) sortedIndices[i] = indices[i];
2178e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTri, sortedIndices);CHKERRQ(ierr);
2179e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 3; ++iFace) {
2180e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTri;
2181e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2182e6ccafaeSMatthew G Knepley 
2183e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTriSorted[ii+0]) &&
2184e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTriSorted[ii+1])) {
2185e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTri; ++fVertex) {
2186e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTri; ++cVertex) {
2187e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTri[ii+fVertex]) {
2188e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2189e6ccafaeSMatthew G Knepley               break;
2190e6ccafaeSMatthew G Knepley             }
2191e6ccafaeSMatthew G Knepley           }
2192e6ccafaeSMatthew G Knepley         }
2193e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2194e6ccafaeSMatthew G Knepley         break;
2195e6ccafaeSMatthew G Knepley       }
2196e6ccafaeSMatthew G Knepley     }
2197e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tri crossface");
2198e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2199e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2200e6ccafaeSMatthew G Knepley   } else if (cellDim == 2 && numCorners == 9) {
2201e6ccafaeSMatthew G Knepley     /* Quadratic quad (I hate this) */
2202e6ccafaeSMatthew G Knepley     /* Edges are determined by the first 2 vertices (corners of edges) */
2203e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuad = 3;
2204e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[3], i, iFace;
2205e6ccafaeSMatthew G Knepley     PetscBool      found                      = PETSC_FALSE;
2206e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadSorted[12] = {
2207e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2208e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2209e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2210e6ccafaeSMatthew G Knepley       0, 3,  7, /* left */
2211e6ccafaeSMatthew G Knepley     };
2212e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuad[12] = {
2213e6ccafaeSMatthew G Knepley       0, 1,  4, /* bottom */
2214e6ccafaeSMatthew G Knepley       1, 2,  5, /* right */
2215e6ccafaeSMatthew G Knepley       2, 3,  6, /* top */
2216e6ccafaeSMatthew G Knepley       3, 0,  7, /* left */
2217e6ccafaeSMatthew G Knepley     };
2218e6ccafaeSMatthew G Knepley 
2219e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuad;
2220e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuad; ++i) sortedIndices[i] = indices[i];
2221e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuad, sortedIndices);CHKERRQ(ierr);
2222e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 4; ++iFace) {
2223e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuad;
2224e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2225e6ccafaeSMatthew G Knepley 
2226e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadSorted[ii+0]) &&
2227e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadSorted[ii+1])) {
2228e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuad; ++fVertex) {
2229e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuad; ++cVertex) {
2230e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuad[ii+fVertex]) {
2231e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2232e6ccafaeSMatthew G Knepley               break;
2233e6ccafaeSMatthew G Knepley             }
2234e6ccafaeSMatthew G Knepley           }
2235e6ccafaeSMatthew G Knepley         }
2236e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2237e6ccafaeSMatthew G Knepley         break;
2238e6ccafaeSMatthew G Knepley       }
2239e6ccafaeSMatthew G Knepley     }
2240e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid quad crossface");
2241e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2242e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2243e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 8) {
2244e6ccafaeSMatthew G Knepley     /* Hexes
2245e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2246e6ccafaeSMatthew G Knepley        pointing up at the second.
2247e6ccafaeSMatthew G Knepley 
2248e6ccafaeSMatthew G Knepley           7---6
2249e6ccafaeSMatthew G Knepley          /|  /|
2250e6ccafaeSMatthew G Knepley         4---5 |
2251ddeab2a6SMatthew G. Knepley         | 1-|-2
2252e6ccafaeSMatthew G Knepley         |/  |/
2253ddeab2a6SMatthew G. Knepley         0---3
2254e6ccafaeSMatthew G Knepley 
2255e6ccafaeSMatthew G Knepley         Faces are determined by the first 4 vertices (corners of faces) */
2256e6ccafaeSMatthew G Knepley     const PetscInt faceSizeHex = 4;
2257e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[4], i, iFace;
2258e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2259e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHexSorted[24] = {
2260e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  /* bottom */
2261e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2262ddeab2a6SMatthew G. Knepley       0, 3, 4, 5,  /* front */
2263ddeab2a6SMatthew G. Knepley       2, 3, 5, 6,  /* right */
2264ddeab2a6SMatthew G. Knepley       1, 2, 6, 7,  /* back */
2265ddeab2a6SMatthew G. Knepley       0, 1, 4, 7,  /* left */
2266e6ccafaeSMatthew G Knepley     };
2267e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesHex[24] = {
2268ddeab2a6SMatthew G. Knepley       1, 2, 3, 0,  /* bottom */
2269e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  /* top */
2270ddeab2a6SMatthew G. Knepley       0, 3, 5, 4,  /* front */
2271ddeab2a6SMatthew G. Knepley       3, 2, 6, 5,  /* right */
2272ddeab2a6SMatthew G. Knepley       2, 1, 7, 6,  /* back */
2273ddeab2a6SMatthew G. Knepley       1, 0, 4, 7,  /* left */
2274e6ccafaeSMatthew G Knepley     };
2275e6ccafaeSMatthew G Knepley 
2276e6ccafaeSMatthew G Knepley     faceSize = faceSizeHex;
2277e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeHex; ++i) sortedIndices[i] = indices[i];
2278e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeHex, sortedIndices);CHKERRQ(ierr);
2279e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2280e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeHex;
2281e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2282e6ccafaeSMatthew G Knepley 
2283e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesHexSorted[ii+0]) &&
2284e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesHexSorted[ii+1]) &&
2285e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesHexSorted[ii+2]) &&
2286e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesHexSorted[ii+3])) {
2287e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeHex; ++fVertex) {
2288e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeHex; ++cVertex) {
2289e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesHex[ii+fVertex]) {
2290e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2291e6ccafaeSMatthew G Knepley               break;
2292e6ccafaeSMatthew G Knepley             }
2293e6ccafaeSMatthew G Knepley           }
2294e6ccafaeSMatthew G Knepley         }
2295e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2296e6ccafaeSMatthew G Knepley         break;
2297e6ccafaeSMatthew G Knepley       }
2298e6ccafaeSMatthew G Knepley     }
2299e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2300e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2301e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2302e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 10) {
2303e6ccafaeSMatthew G Knepley     /* Quadratic tet */
2304e6ccafaeSMatthew G Knepley     /* Faces are determined by the first 3 vertices (corners of faces) */
2305e6ccafaeSMatthew G Knepley     const PetscInt faceSizeTet = 6;
2306e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[6], i, iFace;
2307e6ccafaeSMatthew G Knepley     PetscBool      found                     = PETSC_FALSE;
2308e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTetSorted[24] = {
2309e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2310e6ccafaeSMatthew G Knepley       0, 3, 4,  6, 7, 9,  /* front */
2311e6ccafaeSMatthew G Knepley       1, 4, 5,  7, 8, 9,  /* right */
2312e6ccafaeSMatthew G Knepley       2, 3, 5,  6, 8, 9,  /* left */
2313e6ccafaeSMatthew G Knepley     };
2314e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesTet[24] = {
2315e6ccafaeSMatthew G Knepley       0, 1, 2,  6, 7, 8, /* bottom */
2316e6ccafaeSMatthew G Knepley       0, 4, 3,  6, 7, 9,  /* front */
2317e6ccafaeSMatthew G Knepley       1, 5, 4,  7, 8, 9,  /* right */
2318e6ccafaeSMatthew G Knepley       2, 3, 5,  8, 6, 9,  /* left */
2319e6ccafaeSMatthew G Knepley     };
2320e6ccafaeSMatthew G Knepley 
2321e6ccafaeSMatthew G Knepley     faceSize = faceSizeTet;
2322e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeTet; ++i) sortedIndices[i] = indices[i];
2323e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeTet, sortedIndices);CHKERRQ(ierr);
2324e6ccafaeSMatthew G Knepley     for (iFace=0; iFace < 4; ++iFace) {
2325e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeTet;
2326e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2327e6ccafaeSMatthew G Knepley 
2328e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesTetSorted[ii+0]) &&
2329e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesTetSorted[ii+1]) &&
2330e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesTetSorted[ii+2]) &&
2331e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesTetSorted[ii+3])) {
2332e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeTet; ++fVertex) {
2333e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeTet; ++cVertex) {
2334e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesTet[ii+fVertex]) {
2335e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2336e6ccafaeSMatthew G Knepley               break;
2337e6ccafaeSMatthew G Knepley             }
2338e6ccafaeSMatthew G Knepley           }
2339e6ccafaeSMatthew G Knepley         }
2340e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2341e6ccafaeSMatthew G Knepley         break;
2342e6ccafaeSMatthew G Knepley       }
2343e6ccafaeSMatthew G Knepley     }
2344e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid tet crossface");
2345e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2346e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2347e6ccafaeSMatthew G Knepley   } else if (cellDim == 3 && numCorners == 27) {
2348e6ccafaeSMatthew G Knepley     /* Quadratic hexes (I hate this)
2349e6ccafaeSMatthew G Knepley        A hex is two oriented quads with the normal of the first
2350e6ccafaeSMatthew G Knepley        pointing up at the second.
2351e6ccafaeSMatthew G Knepley 
2352e6ccafaeSMatthew G Knepley          7---6
2353e6ccafaeSMatthew G Knepley         /|  /|
2354e6ccafaeSMatthew G Knepley        4---5 |
2355e6ccafaeSMatthew G Knepley        | 3-|-2
2356e6ccafaeSMatthew G Knepley        |/  |/
2357e6ccafaeSMatthew G Knepley        0---1
2358e6ccafaeSMatthew G Knepley 
2359e6ccafaeSMatthew G Knepley        Faces are determined by the first 4 vertices (corners of faces) */
2360e6ccafaeSMatthew G Knepley     const PetscInt faceSizeQuadHex = 9;
2361e6ccafaeSMatthew G Knepley     PetscInt       sortedIndices[9], i, iFace;
2362e6ccafaeSMatthew G Knepley     PetscBool      found                         = PETSC_FALSE;
2363e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHexSorted[54] = {
2364e6ccafaeSMatthew G Knepley       0, 1, 2, 3,  8, 9, 10, 11,  24, /* bottom */
2365e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2366e6ccafaeSMatthew G Knepley       0, 1, 4, 5,  8, 12, 16, 17,  22, /* front */
2367e6ccafaeSMatthew G Knepley       1, 2, 5, 6,  9, 13, 17, 18,  21, /* right */
2368e6ccafaeSMatthew G Knepley       2, 3, 6, 7,  10, 14, 18, 19,  23, /* back */
2369e6ccafaeSMatthew G Knepley       0, 3, 4, 7,  11, 15, 16, 19,  20, /* left */
2370e6ccafaeSMatthew G Knepley     };
2371e6ccafaeSMatthew G Knepley     PetscInt       faceVerticesQuadHex[54] = {
2372e6ccafaeSMatthew G Knepley       3, 2, 1, 0,  10, 9, 8, 11,  24, /* bottom */
2373e6ccafaeSMatthew G Knepley       4, 5, 6, 7,  12, 13, 14, 15,  25, /* top */
2374e6ccafaeSMatthew G Knepley       0, 1, 5, 4,  8, 17, 12, 16,  22, /* front */
2375e6ccafaeSMatthew G Knepley       1, 2, 6, 5,  9, 18, 13, 17,  21, /* right */
2376e6ccafaeSMatthew G Knepley       2, 3, 7, 6,  10, 19, 14, 18,  23, /* back */
2377e6ccafaeSMatthew G Knepley       3, 0, 4, 7,  11, 16, 15, 19,  20 /* left */
2378e6ccafaeSMatthew G Knepley     };
2379e6ccafaeSMatthew G Knepley 
2380e6ccafaeSMatthew G Knepley     faceSize = faceSizeQuadHex;
2381e6ccafaeSMatthew G Knepley     for (i = 0; i < faceSizeQuadHex; ++i) sortedIndices[i] = indices[i];
2382e6ccafaeSMatthew G Knepley     ierr = PetscSortInt(faceSizeQuadHex, sortedIndices);CHKERRQ(ierr);
2383e6ccafaeSMatthew G Knepley     for (iFace = 0; iFace < 6; ++iFace) {
2384e6ccafaeSMatthew G Knepley       const PetscInt ii = iFace*faceSizeQuadHex;
2385e6ccafaeSMatthew G Knepley       PetscInt       fVertex, cVertex;
2386e6ccafaeSMatthew G Knepley 
2387e6ccafaeSMatthew G Knepley       if ((sortedIndices[0] == faceVerticesQuadHexSorted[ii+0]) &&
2388e6ccafaeSMatthew G Knepley           (sortedIndices[1] == faceVerticesQuadHexSorted[ii+1]) &&
2389e6ccafaeSMatthew G Knepley           (sortedIndices[2] == faceVerticesQuadHexSorted[ii+2]) &&
2390e6ccafaeSMatthew G Knepley           (sortedIndices[3] == faceVerticesQuadHexSorted[ii+3])) {
2391e6ccafaeSMatthew G Knepley         for (fVertex = 0; fVertex < faceSizeQuadHex; ++fVertex) {
2392e6ccafaeSMatthew G Knepley           for (cVertex = 0; cVertex < faceSizeQuadHex; ++cVertex) {
2393e6ccafaeSMatthew G Knepley             if (indices[cVertex] == faceVerticesQuadHex[ii+fVertex]) {
2394e6ccafaeSMatthew G Knepley               faceVertices[fVertex] = origVertices[cVertex];
2395e6ccafaeSMatthew G Knepley               break;
2396e6ccafaeSMatthew G Knepley             }
2397e6ccafaeSMatthew G Knepley           }
2398e6ccafaeSMatthew G Knepley         }
2399e6ccafaeSMatthew G Knepley         found = PETSC_TRUE;
2400e6ccafaeSMatthew G Knepley         break;
2401e6ccafaeSMatthew G Knepley       }
2402e6ccafaeSMatthew G Knepley     }
2403e6ccafaeSMatthew G Knepley     if (!found) SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Invalid hex crossface");
2404e6ccafaeSMatthew G Knepley     if (posOriented) *posOriented = PETSC_TRUE;
2405e6ccafaeSMatthew G Knepley     PetscFunctionReturn(0);
2406e6ccafaeSMatthew G Knepley   } else SETERRQ(comm, PETSC_ERR_ARG_WRONG, "Unknown cell type for faceOrientation().");
2407e6ccafaeSMatthew G Knepley   if (!posOrient) {
2408e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Reversing initial face orientation\n");CHKERRQ(ierr);}
2409e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[faceSize-1 - f];
2410e6ccafaeSMatthew G Knepley   } else {
2411e6ccafaeSMatthew G Knepley     if (debug) {ierr = PetscPrintf(comm, "  Keeping initial face orientation\n");CHKERRQ(ierr);}
2412e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) faceVertices[f] = origVertices[f];
2413e6ccafaeSMatthew G Knepley   }
2414e6ccafaeSMatthew G Knepley   if (posOriented) *posOriented = posOrient;
2415e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2416e6ccafaeSMatthew G Knepley }
2417e6ccafaeSMatthew G Knepley 
2418e6ccafaeSMatthew G Knepley #undef __FUNCT__
2419e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetOrientedFace"
2420e6ccafaeSMatthew G Knepley /*
2421e6ccafaeSMatthew G Knepley     Given a cell and a face, as a set of vertices,
2422e6ccafaeSMatthew G Knepley       return the oriented face, as a set of vertices, in faceVertices
2423e6ccafaeSMatthew G Knepley     The orientation is such that the face normal points out of the cell
2424e6ccafaeSMatthew G Knepley */
2425e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetOrientedFace(DM dm, PetscInt cell, PetscInt faceSize, const PetscInt face[], PetscInt numCorners, PetscInt indices[], PetscInt origVertices[], PetscInt faceVertices[], PetscBool *posOriented)
2426e6ccafaeSMatthew G Knepley {
24270298fd71SBarry Smith   const PetscInt *cone = NULL;
2428e6ccafaeSMatthew G Knepley   PetscInt        coneSize, v, f, v2;
2429e6ccafaeSMatthew G Knepley   PetscInt        oppositeVertex = -1;
2430e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2431e6ccafaeSMatthew G Knepley 
2432e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2433e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(dm, cell, &coneSize);CHKERRQ(ierr);
2434e6ccafaeSMatthew G Knepley   ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
2435e6ccafaeSMatthew G Knepley   for (v = 0, v2 = 0; v < coneSize; ++v) {
2436e6ccafaeSMatthew G Knepley     PetscBool found = PETSC_FALSE;
2437e6ccafaeSMatthew G Knepley 
2438e6ccafaeSMatthew G Knepley     for (f = 0; f < faceSize; ++f) {
2439e6ccafaeSMatthew G Knepley       if (face[f] == cone[v]) {
2440e6ccafaeSMatthew G Knepley         found = PETSC_TRUE; break;
2441e6ccafaeSMatthew G Knepley       }
2442e6ccafaeSMatthew G Knepley     }
2443e6ccafaeSMatthew G Knepley     if (found) {
2444e6ccafaeSMatthew G Knepley       indices[v2]      = v;
2445e6ccafaeSMatthew G Knepley       origVertices[v2] = cone[v];
2446e6ccafaeSMatthew G Knepley       ++v2;
2447e6ccafaeSMatthew G Knepley     } else {
2448e6ccafaeSMatthew G Knepley       oppositeVertex = v;
2449e6ccafaeSMatthew G Knepley     }
2450e6ccafaeSMatthew G Knepley   }
2451e6ccafaeSMatthew G Knepley   ierr = DMPlexGetFaceOrientation(dm, cell, numCorners, indices, oppositeVertex, origVertices, faceVertices, posOriented);CHKERRQ(ierr);
2452e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2453e6ccafaeSMatthew G Knepley }
2454e6ccafaeSMatthew G Knepley 
2455e6ccafaeSMatthew G Knepley #undef __FUNCT__
2456cd0c2139SMatthew G Knepley #define __FUNCT__ "DMPlexInsertFace_Internal"
2457e6ccafaeSMatthew G Knepley /*
2458cd0c2139SMatthew G Knepley   DMPlexInsertFace_Internal - Puts a face into the mesh
2459e6ccafaeSMatthew G Knepley 
2460e6ccafaeSMatthew G Knepley   Not collective
2461e6ccafaeSMatthew G Knepley 
2462e6ccafaeSMatthew G Knepley   Input Parameters:
2463e6ccafaeSMatthew G Knepley   + dm              - The DMPlex
2464e6ccafaeSMatthew G Knepley   . numFaceVertex   - The number of vertices in the face
2465e6ccafaeSMatthew G Knepley   . faceVertices    - The vertices in the face for dm
2466e6ccafaeSMatthew G Knepley   . subfaceVertices - The vertices in the face for subdm
2467e6ccafaeSMatthew G Knepley   . numCorners      - The number of vertices in the cell
2468e6ccafaeSMatthew G Knepley   . cell            - A cell in dm containing the face
2469e6ccafaeSMatthew G Knepley   . subcell         - A cell in subdm containing the face
2470e6ccafaeSMatthew G Knepley   . firstFace       - First face in the mesh
2471e6ccafaeSMatthew G Knepley   - newFacePoint    - Next face in the mesh
2472e6ccafaeSMatthew G Knepley 
2473e6ccafaeSMatthew G Knepley   Output Parameters:
2474e6ccafaeSMatthew G Knepley   . newFacePoint - Contains next face point number on input, updated on output
2475e6ccafaeSMatthew G Knepley 
2476e6ccafaeSMatthew G Knepley   Level: developer
2477e6ccafaeSMatthew G Knepley */
2478cd0c2139SMatthew 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)
2479e6ccafaeSMatthew G Knepley {
248082f516ccSBarry Smith   MPI_Comm        comm;
2481e6ccafaeSMatthew G Knepley   DM_Plex        *submesh = (DM_Plex*) subdm->data;
2482e6ccafaeSMatthew G Knepley   const PetscInt *faces;
2483e6ccafaeSMatthew G Knepley   PetscInt        numFaces, coneSize;
2484e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2485e6ccafaeSMatthew G Knepley 
2486e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
248782f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2488e6ccafaeSMatthew G Knepley   ierr = DMPlexGetConeSize(subdm, subcell, &coneSize);CHKERRQ(ierr);
2489e6ccafaeSMatthew G Knepley   if (coneSize != 1) SETERRQ2(comm, PETSC_ERR_ARG_OUTOFRANGE, "Cone size of cell %d is %d != 1", cell, coneSize);
2490e6ccafaeSMatthew G Knepley #if 0
2491e6ccafaeSMatthew G Knepley   /* Cannot use this because support() has not been constructed yet */
2492e6ccafaeSMatthew G Knepley   ierr = DMPlexGetJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2493e6ccafaeSMatthew G Knepley #else
2494e6ccafaeSMatthew G Knepley   {
2495e6ccafaeSMatthew G Knepley     PetscInt f;
2496e6ccafaeSMatthew G Knepley 
2497e6ccafaeSMatthew G Knepley     numFaces = 0;
2498e6ccafaeSMatthew G Knepley     ierr     = DMGetWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2499e6ccafaeSMatthew G Knepley     for (f = firstFace; f < *newFacePoint; ++f) {
2500e6ccafaeSMatthew G Knepley       PetscInt dof, off, d;
2501e6ccafaeSMatthew G Knepley 
2502e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(submesh->coneSection, f, &dof);CHKERRQ(ierr);
2503e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(submesh->coneSection, f, &off);CHKERRQ(ierr);
2504e6ccafaeSMatthew G Knepley       /* Yes, I know this is quadratic, but I expect the sizes to be <5 */
2505e6ccafaeSMatthew G Knepley       for (d = 0; d < dof; ++d) {
2506e6ccafaeSMatthew G Knepley         const PetscInt p = submesh->cones[off+d];
2507e6ccafaeSMatthew G Knepley         PetscInt       v;
2508e6ccafaeSMatthew G Knepley 
2509e6ccafaeSMatthew G Knepley         for (v = 0; v < numFaceVertices; ++v) {
2510e6ccafaeSMatthew G Knepley           if (subfaceVertices[v] == p) break;
2511e6ccafaeSMatthew G Knepley         }
2512e6ccafaeSMatthew G Knepley         if (v == numFaceVertices) break;
2513e6ccafaeSMatthew G Knepley       }
2514e6ccafaeSMatthew G Knepley       if (d == dof) {
2515e6ccafaeSMatthew G Knepley         numFaces               = 1;
2516e6ccafaeSMatthew G Knepley         ((PetscInt*) faces)[0] = f;
2517e6ccafaeSMatthew G Knepley       }
2518e6ccafaeSMatthew G Knepley     }
2519e6ccafaeSMatthew G Knepley   }
2520e6ccafaeSMatthew G Knepley #endif
2521e6ccafaeSMatthew G Knepley   if (numFaces > 1) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Vertex set had %d faces, not one", numFaces);
2522e6ccafaeSMatthew G Knepley   else if (numFaces == 1) {
2523e6ccafaeSMatthew G Knepley     /* Add the other cell neighbor for this face */
2524766ab985SMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, faces);CHKERRQ(ierr);
2525e6ccafaeSMatthew G Knepley   } else {
2526e6ccafaeSMatthew G Knepley     PetscInt *indices, *origVertices, *orientedVertices, *orientedSubVertices, v, ov;
2527e6ccafaeSMatthew G Knepley     PetscBool posOriented;
2528e6ccafaeSMatthew G Knepley 
2529e6ccafaeSMatthew G Knepley     ierr                = DMGetWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2530e6ccafaeSMatthew G Knepley     origVertices        = &orientedVertices[numFaceVertices];
2531e6ccafaeSMatthew G Knepley     indices             = &orientedVertices[numFaceVertices*2];
2532e6ccafaeSMatthew G Knepley     orientedSubVertices = &orientedVertices[numFaceVertices*3];
2533e6ccafaeSMatthew G Knepley     ierr                = DMPlexGetOrientedFace(dm, cell, numFaceVertices, faceVertices, numCorners, indices, origVertices, orientedVertices, &posOriented);CHKERRQ(ierr);
2534e6ccafaeSMatthew G Knepley     /* TODO: I know that routine should return a permutation, not the indices */
2535e6ccafaeSMatthew G Knepley     for (v = 0; v < numFaceVertices; ++v) {
2536e6ccafaeSMatthew G Knepley       const PetscInt vertex = faceVertices[v], subvertex = subfaceVertices[v];
2537e6ccafaeSMatthew G Knepley       for (ov = 0; ov < numFaceVertices; ++ov) {
2538e6ccafaeSMatthew G Knepley         if (orientedVertices[ov] == vertex) {
2539e6ccafaeSMatthew G Knepley           orientedSubVertices[ov] = subvertex;
2540e6ccafaeSMatthew G Knepley           break;
2541e6ccafaeSMatthew G Knepley         }
2542e6ccafaeSMatthew G Knepley       }
2543e6ccafaeSMatthew G Knepley       if (ov == numFaceVertices) SETERRQ1(comm, PETSC_ERR_PLIB, "Could not find face vertex %d in orientated set", vertex);
2544e6ccafaeSMatthew G Knepley     }
2545e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, *newFacePoint, orientedSubVertices);CHKERRQ(ierr);
2546e6ccafaeSMatthew G Knepley     ierr = DMPlexSetCone(subdm, subcell, newFacePoint);CHKERRQ(ierr);
2547e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(subdm, 4*numFaceVertices * sizeof(PetscInt), PETSC_INT, &orientedVertices);CHKERRQ(ierr);
2548e6ccafaeSMatthew G Knepley     ++(*newFacePoint);
2549e6ccafaeSMatthew G Knepley   }
2550ef07cca7SMatthew G. Knepley #if 0
2551e6ccafaeSMatthew G Knepley   ierr = DMPlexRestoreJoin(subdm, numFaceVertices, subfaceVertices, &numFaces, &faces);CHKERRQ(ierr);
2552ef07cca7SMatthew G. Knepley #else
2553ef07cca7SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, 1, PETSC_INT, (void **) &faces);CHKERRQ(ierr);
2554ef07cca7SMatthew G. Knepley #endif
2555e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2556e6ccafaeSMatthew G Knepley }
2557e6ccafaeSMatthew G Knepley 
2558e6ccafaeSMatthew G Knepley #undef __FUNCT__
2559e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Uninterpolated"
256053156dfcSMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Uninterpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
2561e6ccafaeSMatthew G Knepley {
256282f516ccSBarry Smith   MPI_Comm        comm;
256353156dfcSMatthew G. Knepley   DMLabel         subpointMap;
2564efa14ee0SMatthew G Knepley   IS              subvertexIS,  subcellIS;
2565efa14ee0SMatthew G Knepley   const PetscInt *subVertices, *subCells;
2566efa14ee0SMatthew G Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells;
2567fed694aaSMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces = 0, firstSubFace, newFacePoint, nFV = 0;
2568efa14ee0SMatthew G Knepley   PetscInt        vStart, vEnd, c, f;
2569e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
2570e6ccafaeSMatthew G Knepley 
2571e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
257282f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2573efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2574efa14ee0SMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2575efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2576efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
257753156dfcSMatthew G. Knepley   if (vertexLabel) {ierr = DMPlexMarkSubmesh_Uninterpolated(dm, vertexLabel, value, subpointMap, &numSubFaces, &nFV, subdm);CHKERRQ(ierr);}
2578efa14ee0SMatthew G Knepley   /* Setup chart */
2579efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2580efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2581efa14ee0SMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2582efa14ee0SMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2583e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2584e6ccafaeSMatthew G Knepley   firstSubVertex = numSubCells;
2585efa14ee0SMatthew G Knepley   firstSubFace   = numSubCells+numSubVertices;
2586e6ccafaeSMatthew G Knepley   newFacePoint   = firstSubFace;
2587efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
2588efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2589efa14ee0SMatthew G Knepley   ierr = DMLabelGetStratumIS(subpointMap, 2, &subcellIS);CHKERRQ(ierr);
2590efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISGetIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2591e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2592e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
2593e6ccafaeSMatthew G Knepley   }
2594e6ccafaeSMatthew G Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
2595e6ccafaeSMatthew G Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
2596e6ccafaeSMatthew G Knepley   }
2597e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2598e6ccafaeSMatthew G Knepley   /* Create face cones */
2599efa14ee0SMatthew G Knepley   ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
26000298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
2601efa14ee0SMatthew G Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2602e6ccafaeSMatthew G Knepley   for (c = 0; c < numSubCells; ++c) {
2603e6ccafaeSMatthew G Knepley     const PetscInt cell    = subCells[c];
2604efa14ee0SMatthew G Knepley     const PetscInt subcell = c;
26050298fd71SBarry Smith     PetscInt      *closure = NULL;
2606efa14ee0SMatthew G Knepley     PetscInt       closureSize, cl, numCorners = 0, faceSize = 0;
2607e6ccafaeSMatthew G Knepley 
2608e6ccafaeSMatthew G Knepley     ierr = DMPlexGetTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2609efa14ee0SMatthew G Knepley     for (cl = 0; cl < closureSize*2; cl += 2) {
2610efa14ee0SMatthew G Knepley       const PetscInt point = closure[cl];
2611e6ccafaeSMatthew G Knepley       PetscInt       subVertex;
2612e6ccafaeSMatthew G Knepley 
2613efa14ee0SMatthew G Knepley       if ((point >= vStart) && (point < vEnd)) {
2614efa14ee0SMatthew G Knepley         ++numCorners;
2615efa14ee0SMatthew G Knepley         ierr = PetscFindInt(point, numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
2616efa14ee0SMatthew G Knepley         if (subVertex >= 0) {
2617efa14ee0SMatthew G Knepley           closure[faceSize] = point;
261865560c7fSMatthew G Knepley           subface[faceSize] = firstSubVertex+subVertex;
2619e6ccafaeSMatthew G Knepley           ++faceSize;
2620e6ccafaeSMatthew G Knepley         }
2621e6ccafaeSMatthew G Knepley       }
2622e6ccafaeSMatthew G Knepley     }
2623efa14ee0SMatthew G Knepley     if (faceSize > nFV) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Invalid submesh: Too many vertices %d of an element on the surface", faceSize);
2624efa14ee0SMatthew G Knepley     if (faceSize == nFV) {
2625cd0c2139SMatthew G Knepley       ierr = DMPlexInsertFace_Internal(dm, subdm, faceSize, closure, subface, numCorners, cell, subcell, firstSubFace, &newFacePoint);CHKERRQ(ierr);
2626e6ccafaeSMatthew G Knepley     }
262765560c7fSMatthew G Knepley     ierr = DMPlexRestoreTransitiveClosure(dm, cell, PETSC_TRUE, &closureSize, &closure);CHKERRQ(ierr);
2628e6ccafaeSMatthew G Knepley   }
2629efa14ee0SMatthew G Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
2630e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2631e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2632e6ccafaeSMatthew G Knepley   /* Build coordinates */
2633efa14ee0SMatthew G Knepley   {
2634efa14ee0SMatthew G Knepley     PetscSection coordSection, subCoordSection;
2635efa14ee0SMatthew G Knepley     Vec          coordinates, subCoordinates;
2636efa14ee0SMatthew G Knepley     PetscScalar *coords, *subCoords;
2637285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
2638efa14ee0SMatthew G Knepley 
263969d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2640e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
264169d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2642285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2643285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2644285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2645efa14ee0SMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
2646efa14ee0SMatthew G Knepley     for (v = 0; v < numSubVertices; ++v) {
2647efa14ee0SMatthew G Knepley       const PetscInt vertex    = subVertices[v];
2648efa14ee0SMatthew G Knepley       const PetscInt subvertex = firstSubVertex+v;
2649efa14ee0SMatthew G Knepley       PetscInt       dof;
2650efa14ee0SMatthew G Knepley 
2651efa14ee0SMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2652efa14ee0SMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2653285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2654e6ccafaeSMatthew G Knepley     }
2655e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2656e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2657e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2658e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
26592eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2660830e53efSMatthew G. Knepley     if (coordSize) {
2661e6ccafaeSMatthew G Knepley       ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2662e6ccafaeSMatthew G Knepley       ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2663efa14ee0SMatthew G Knepley       for (v = 0; v < numSubVertices; ++v) {
2664efa14ee0SMatthew G Knepley         const PetscInt vertex    = subVertices[v];
2665efa14ee0SMatthew G Knepley         const PetscInt subvertex = firstSubVertex+v;
2666efa14ee0SMatthew G Knepley         PetscInt       dof, off, sdof, soff, d;
2667e6ccafaeSMatthew G Knepley 
2668e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2669e6ccafaeSMatthew G Knepley         ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2670efa14ee0SMatthew G Knepley         ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2671efa14ee0SMatthew G Knepley         ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2672efa14ee0SMatthew 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);
2673e6ccafaeSMatthew G Knepley         for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2674e6ccafaeSMatthew G Knepley       }
2675e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2676e6ccafaeSMatthew G Knepley       ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
26773b399e24SMatthew G. Knepley     }
2678e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2679e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2680e6ccafaeSMatthew G Knepley   }
2681efa14ee0SMatthew G Knepley   /* Cleanup */
2682efa14ee0SMatthew G Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
2683efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
2684efa14ee0SMatthew G Knepley   if (subcellIS) {ierr = ISRestoreIndices(subcellIS, &subCells);CHKERRQ(ierr);}
2685efa14ee0SMatthew G Knepley   ierr = ISDestroy(&subcellIS);CHKERRQ(ierr);
2686e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2687e6ccafaeSMatthew G Knepley }
2688e6ccafaeSMatthew G Knepley 
2689e6ccafaeSMatthew G Knepley #undef __FUNCT__
26903982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexFilterPoint_Internal"
26913982b651SMatthew G. Knepley PETSC_STATIC_INLINE PetscInt DMPlexFilterPoint_Internal(PetscInt point, PetscInt firstSubPoint, PetscInt numSubPoints, const PetscInt subPoints[])
26923982b651SMatthew G. Knepley {
26933982b651SMatthew G. Knepley   PetscInt       subPoint;
26943982b651SMatthew G. Knepley   PetscErrorCode ierr;
26953982b651SMatthew G. Knepley 
26963982b651SMatthew G. Knepley   ierr = PetscFindInt(point, numSubPoints, subPoints, &subPoint); if (ierr < 0) return ierr;
26973982b651SMatthew G. Knepley   return subPoint < 0 ? subPoint : firstSubPoint+subPoint;
26983982b651SMatthew G. Knepley }
26993982b651SMatthew G. Knepley 
27003982b651SMatthew G. Knepley #undef __FUNCT__
27013982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmeshGeneric_Interpolated"
27023982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmeshGeneric_Interpolated(DM dm, DMLabel label, PetscInt value, PetscBool isCohesive, DM subdm)
2703e6ccafaeSMatthew G Knepley {
270482f516ccSBarry Smith   MPI_Comm         comm;
270553156dfcSMatthew G. Knepley   DMLabel          subpointMap;
2706efa14ee0SMatthew G Knepley   IS              *subpointIS;
2707efa14ee0SMatthew G Knepley   const PetscInt **subpoints;
27083982b651SMatthew G. Knepley   PetscInt        *numSubPoints, *firstSubPoint, *coneNew, *orntNew;
2709efa14ee0SMatthew G Knepley   PetscInt         totSubPoints = 0, maxConeSize, dim, p, d, v;
2710e6ccafaeSMatthew G Knepley   PetscErrorCode   ierr;
2711e6ccafaeSMatthew G Knepley 
2712e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
271382f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
2714efa14ee0SMatthew G Knepley   /* Create subpointMap which marks the submesh */
2715e6ccafaeSMatthew G Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2716efa14ee0SMatthew G Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2717efa14ee0SMatthew G Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
27183982b651SMatthew G. Knepley   if (isCohesive) {ierr = DMPlexMarkCohesiveSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
27193982b651SMatthew G. Knepley   else            {ierr = DMPlexMarkSubmesh_Interpolated(dm, label, value, subpointMap, subdm);CHKERRQ(ierr);}
2720efa14ee0SMatthew G Knepley   /* Setup chart */
2721c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2722dcca6d9dSJed Brown   ierr = PetscMalloc4(dim+1,&numSubPoints,dim+1,&firstSubPoint,dim+1,&subpointIS,dim+1,&subpoints);CHKERRQ(ierr);
2723e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2724e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumSize(subpointMap, d, &numSubPoints[d]);CHKERRQ(ierr);
2725e6ccafaeSMatthew G Knepley     totSubPoints += numSubPoints[d];
2726e6ccafaeSMatthew G Knepley   }
2727e6ccafaeSMatthew G Knepley   ierr = DMPlexSetChart(subdm, 0, totSubPoints);CHKERRQ(ierr);
2728e6ccafaeSMatthew G Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2729e6ccafaeSMatthew G Knepley   /* Set cone sizes */
2730e6ccafaeSMatthew G Knepley   firstSubPoint[dim] = 0;
2731e6ccafaeSMatthew G Knepley   firstSubPoint[0]   = firstSubPoint[dim] + numSubPoints[dim];
2732e6ccafaeSMatthew G Knepley   if (dim > 1) {firstSubPoint[dim-1] = firstSubPoint[0]     + numSubPoints[0];}
2733e6ccafaeSMatthew G Knepley   if (dim > 2) {firstSubPoint[dim-2] = firstSubPoint[dim-1] + numSubPoints[dim-1];}
2734e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2735e6ccafaeSMatthew G Knepley     ierr = DMLabelGetStratumIS(subpointMap, d, &subpointIS[d]);CHKERRQ(ierr);
27360ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISGetIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2737e6ccafaeSMatthew G Knepley   }
2738e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2739e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2740e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2741e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
2742e6ccafaeSMatthew G Knepley       const PetscInt *cone;
2743e6ccafaeSMatthew G Knepley       PetscInt        coneSize, coneSizeNew, c, val;
2744e6ccafaeSMatthew G Knepley 
2745e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2746e6ccafaeSMatthew G Knepley       ierr = DMPlexSetConeSize(subdm, subpoint, coneSize);CHKERRQ(ierr);
2747e6ccafaeSMatthew G Knepley       if (d == dim) {
2748e6ccafaeSMatthew G Knepley         ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
2749e6ccafaeSMatthew G Knepley         for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2750e6ccafaeSMatthew G Knepley           ierr = DMLabelGetValue(subpointMap, cone[c], &val);CHKERRQ(ierr);
2751e6ccafaeSMatthew G Knepley           if (val >= 0) coneSizeNew++;
2752e6ccafaeSMatthew G Knepley         }
2753e6ccafaeSMatthew G Knepley         ierr = DMPlexSetConeSize(subdm, subpoint, coneSizeNew);CHKERRQ(ierr);
2754e6ccafaeSMatthew G Knepley       }
2755e6ccafaeSMatthew G Knepley     }
2756e6ccafaeSMatthew G Knepley   }
2757e6ccafaeSMatthew G Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
2758e6ccafaeSMatthew G Knepley   /* Set cones */
27590298fd71SBarry Smith   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
27603982b651SMatthew G. Knepley   ierr = PetscMalloc2(maxConeSize,&coneNew,maxConeSize,&orntNew);CHKERRQ(ierr);
2761e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
2762e6ccafaeSMatthew G Knepley     for (p = 0; p < numSubPoints[d]; ++p) {
2763e6ccafaeSMatthew G Knepley       const PetscInt  point    = subpoints[d][p];
2764e6ccafaeSMatthew G Knepley       const PetscInt  subpoint = firstSubPoint[d] + p;
27650e49e2e2SMatthew G. Knepley       const PetscInt *cone, *ornt;
2766e6ccafaeSMatthew G Knepley       PetscInt        coneSize, subconeSize, coneSizeNew, c, subc;
2767e6ccafaeSMatthew G Knepley 
2768e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(dm, point, &coneSize);CHKERRQ(ierr);
2769e6ccafaeSMatthew G Knepley       ierr = DMPlexGetConeSize(subdm, subpoint, &subconeSize);CHKERRQ(ierr);
2770e6ccafaeSMatthew G Knepley       ierr = DMPlexGetCone(dm, point, &cone);CHKERRQ(ierr);
27710e49e2e2SMatthew G. Knepley       ierr = DMPlexGetConeOrientation(dm, point, &ornt);CHKERRQ(ierr);
2772e6ccafaeSMatthew G Knepley       for (c = 0, coneSizeNew = 0; c < coneSize; ++c) {
2773e6ccafaeSMatthew G Knepley         ierr = PetscFindInt(cone[c], numSubPoints[d-1], subpoints[d-1], &subc);CHKERRQ(ierr);
277401a2673eSMatthew G. Knepley         if (subc >= 0) {
277501a2673eSMatthew G. Knepley           coneNew[coneSizeNew] = firstSubPoint[d-1] + subc;
27763982b651SMatthew G. Knepley           orntNew[coneSizeNew] = ornt[c];
277701a2673eSMatthew G. Knepley           ++coneSizeNew;
277801a2673eSMatthew G. Knepley         }
2779e6ccafaeSMatthew G Knepley       }
2780e6ccafaeSMatthew G Knepley       if (coneSizeNew != subconeSize) SETERRQ2(comm, PETSC_ERR_PLIB, "Number of cone points located %d does not match subcone size %d", coneSizeNew, subconeSize);
2781e6ccafaeSMatthew G Knepley       ierr = DMPlexSetCone(subdm, subpoint, coneNew);CHKERRQ(ierr);
27823982b651SMatthew G. Knepley       ierr = DMPlexSetConeOrientation(subdm, subpoint, orntNew);CHKERRQ(ierr);
2783e6ccafaeSMatthew G Knepley     }
2784e6ccafaeSMatthew G Knepley   }
27853982b651SMatthew G. Knepley   ierr = PetscFree2(coneNew,orntNew);CHKERRQ(ierr);
2786e6ccafaeSMatthew G Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
2787e6ccafaeSMatthew G Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
2788e6ccafaeSMatthew G Knepley   /* Build coordinates */
2789e6ccafaeSMatthew G Knepley   {
2790e6ccafaeSMatthew G Knepley     PetscSection coordSection, subCoordSection;
2791e6ccafaeSMatthew G Knepley     Vec          coordinates, subCoordinates;
2792e6ccafaeSMatthew G Knepley     PetscScalar *coords, *subCoords;
2793285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize;
2794e6ccafaeSMatthew G Knepley 
279569d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
2796e6ccafaeSMatthew G Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
279769d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
2798285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
2799285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
2800285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
2801e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubPoint[0], firstSubPoint[0]+numSubPoints[0]);CHKERRQ(ierr);
2802e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2803e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2804e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2805e6ccafaeSMatthew G Knepley       PetscInt       dof;
2806e6ccafaeSMatthew G Knepley 
2807e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2808e6ccafaeSMatthew G Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
2809285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
2810e6ccafaeSMatthew G Knepley     }
2811e6ccafaeSMatthew G Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
2812e6ccafaeSMatthew G Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
2813e6ccafaeSMatthew G Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
2814e6ccafaeSMatthew G Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
28152eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
2816e6ccafaeSMatthew G Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
2817e6ccafaeSMatthew G Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2818e6ccafaeSMatthew G Knepley     for (v = 0; v < numSubPoints[0]; ++v) {
2819e6ccafaeSMatthew G Knepley       const PetscInt vertex    = subpoints[0][v];
2820e6ccafaeSMatthew G Knepley       const PetscInt subvertex = firstSubPoint[0]+v;
2821e6ccafaeSMatthew G Knepley       PetscInt dof, off, sdof, soff, d;
2822e6ccafaeSMatthew G Knepley 
2823e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
2824e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
2825e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
2826e6ccafaeSMatthew G Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
2827e6ccafaeSMatthew 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);
2828efa14ee0SMatthew G Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
2829e6ccafaeSMatthew G Knepley     }
2830e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
2831e6ccafaeSMatthew G Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
2832e6ccafaeSMatthew G Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
2833e6ccafaeSMatthew G Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
2834e6ccafaeSMatthew G Knepley   }
28353982b651SMatthew G. Knepley   /* Build SF: We need this complexity because subpoints might not be selected on the owning process */
28363982b651SMatthew G. Knepley   {
28373982b651SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
28383982b651SMatthew G. Knepley     IS                 subpIS;
28393982b651SMatthew G. Knepley     const PetscSFNode *remotePoints;
28403982b651SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
28413982b651SMatthew G. Knepley     const PetscInt    *localPoints, *subpoints;
28423982b651SMatthew G. Knepley     PetscInt          *slocalPoints;
28433982b651SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubpoints = 0, numSubroots, numSubleaves = 0, l, sl, ll, pStart, pEnd, p;
28443982b651SMatthew G. Knepley     PetscMPIInt        rank;
28453982b651SMatthew G. Knepley 
28463982b651SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
28473982b651SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
28483982b651SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
28493982b651SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
28503982b651SMatthew G. Knepley     ierr = DMPlexGetChart(subdm, NULL, &numSubroots);CHKERRQ(ierr);
28513982b651SMatthew G. Knepley     ierr = DMPlexCreateSubpointIS(subdm, &subpIS);CHKERRQ(ierr);
28523982b651SMatthew G. Knepley     if (subpIS) {
28533982b651SMatthew G. Knepley       ierr = ISGetIndices(subpIS, &subpoints);CHKERRQ(ierr);
28543982b651SMatthew G. Knepley       ierr = ISGetLocalSize(subpIS, &numSubpoints);CHKERRQ(ierr);
28553982b651SMatthew G. Knepley     }
28563982b651SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
28573982b651SMatthew G. Knepley     if (numRoots >= 0) {
28583982b651SMatthew G. Knepley       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
28593982b651SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
28603982b651SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
28613982b651SMatthew G. Knepley         newLocalPoints[p].index = -2;
28623982b651SMatthew G. Knepley       }
28633982b651SMatthew G. Knepley       /* Set subleaves */
28643982b651SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
28653982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
28663982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
28673982b651SMatthew G. Knepley 
28683982b651SMatthew G. Knepley         if (subpoint < 0) continue;
28693982b651SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
28703982b651SMatthew G. Knepley         newLocalPoints[point-pStart].index = subpoint;
28713982b651SMatthew G. Knepley         ++numSubleaves;
28723982b651SMatthew G. Knepley       }
28733982b651SMatthew G. Knepley       /* Must put in owned subpoints */
28743982b651SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
28753982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(p, 0, numSubpoints, subpoints);
28763982b651SMatthew G. Knepley 
28773982b651SMatthew G. Knepley         if (subpoint < 0) {
28783982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
28793982b651SMatthew G. Knepley           newOwners[p-pStart].index = -3;
28803982b651SMatthew G. Knepley         } else {
28813982b651SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
28823982b651SMatthew G. Knepley           newOwners[p-pStart].index = subpoint;
28833982b651SMatthew G. Knepley         }
28843982b651SMatthew G. Knepley       }
28853982b651SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
28863982b651SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
28873982b651SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
28883982b651SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
28893982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &slocalPoints);CHKERRQ(ierr);
28903982b651SMatthew G. Knepley       ierr = PetscMalloc1(numSubleaves, &sremotePoints);CHKERRQ(ierr);
28913982b651SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
28923982b651SMatthew G. Knepley         const PetscInt point    = localPoints[l];
28933982b651SMatthew G. Knepley         const PetscInt subpoint = DMPlexFilterPoint_Internal(point, 0, numSubpoints, subpoints);
28943982b651SMatthew G. Knepley 
28953982b651SMatthew G. Knepley         if (subpoint < 0) continue;
28963982b651SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
28973982b651SMatthew G. Knepley         slocalPoints[sl]        = subpoint;
28983982b651SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
28993982b651SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
29003982b651SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
29013982b651SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
29023982b651SMatthew G. Knepley         ++sl;
29033982b651SMatthew G. Knepley       }
29043982b651SMatthew G. Knepley       if (sl + ll != numSubleaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubleaves);
29053982b651SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
29063982b651SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubroots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
29073982b651SMatthew G. Knepley     }
29083982b651SMatthew G. Knepley     if (subpIS) {
29093982b651SMatthew G. Knepley       ierr = ISRestoreIndices(subpIS, &subpoints);CHKERRQ(ierr);
29103982b651SMatthew G. Knepley       ierr = ISDestroy(&subpIS);CHKERRQ(ierr);
29113982b651SMatthew G. Knepley     }
29123982b651SMatthew G. Knepley   }
2913efa14ee0SMatthew G Knepley   /* Cleanup */
2914e6ccafaeSMatthew G Knepley   for (d = 0; d <= dim; ++d) {
29150ae02aa4SMatthew G. Knepley     if (subpointIS[d]) {ierr = ISRestoreIndices(subpointIS[d], &subpoints[d]);CHKERRQ(ierr);}
2916e6ccafaeSMatthew G Knepley     ierr = ISDestroy(&subpointIS[d]);CHKERRQ(ierr);
2917e6ccafaeSMatthew G Knepley   }
2918efa14ee0SMatthew G Knepley   ierr = PetscFree4(numSubPoints,firstSubPoint,subpointIS,subpoints);CHKERRQ(ierr);
2919e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2920e6ccafaeSMatthew G Knepley }
2921e6ccafaeSMatthew G Knepley 
2922e6ccafaeSMatthew G Knepley #undef __FUNCT__
29233982b651SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateSubmesh_Interpolated"
29243982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateSubmesh_Interpolated(DM dm, DMLabel vertexLabel, PetscInt value, DM subdm)
29253982b651SMatthew G. Knepley {
29263982b651SMatthew G. Knepley   PetscErrorCode ierr;
29273982b651SMatthew G. Knepley 
29283982b651SMatthew G. Knepley   PetscFunctionBegin;
29293982b651SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, vertexLabel, value, PETSC_FALSE, subdm);CHKERRQ(ierr);
29303982b651SMatthew G. Knepley   PetscFunctionReturn(0);
29313982b651SMatthew G. Knepley }
29323982b651SMatthew G. Knepley 
29333982b651SMatthew G. Knepley #undef __FUNCT__
2934e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubmesh"
2935d0fa310fSMatthew G. Knepley /*@
2936e6ccafaeSMatthew G Knepley   DMPlexCreateSubmesh - Extract a hypersurface from the mesh using vertices defined by a label
2937e6ccafaeSMatthew G Knepley 
2938e6ccafaeSMatthew G Knepley   Input Parameters:
2939e6ccafaeSMatthew G Knepley + dm           - The original mesh
2940830e53efSMatthew G. Knepley . vertexLabel  - The DMLabel marking vertices contained in the surface
2941830e53efSMatthew G. Knepley - value        - The label value to use
2942e6ccafaeSMatthew G Knepley 
2943e6ccafaeSMatthew G Knepley   Output Parameter:
2944e6ccafaeSMatthew G Knepley . subdm - The surface mesh
2945e6ccafaeSMatthew G Knepley 
2946e6ccafaeSMatthew G Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
2947e6ccafaeSMatthew G Knepley 
2948e6ccafaeSMatthew G Knepley   Level: developer
2949e6ccafaeSMatthew G Knepley 
2950e6ccafaeSMatthew G Knepley .seealso: DMPlexGetSubpointMap(), DMPlexGetLabel(), DMLabelSetValue()
2951830e53efSMatthew G. Knepley @*/
295253156dfcSMatthew G. Knepley PetscErrorCode DMPlexCreateSubmesh(DM dm, DMLabel vertexLabel, PetscInt value, DM *subdm)
2953e6ccafaeSMatthew G Knepley {
2954e6ccafaeSMatthew G Knepley   PetscInt       dim, depth;
2955e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
2956e6ccafaeSMatthew G Knepley 
2957e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
2958e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
2959766ab985SMatthew G. Knepley   PetscValidPointer(subdm, 3);
2960c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
2961e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
296282f516ccSBarry Smith   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
2963e6ccafaeSMatthew G Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
2964c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
2965e6ccafaeSMatthew G Knepley   if (depth == dim) {
2966830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Interpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2967e6ccafaeSMatthew G Knepley   } else {
2968830e53efSMatthew G. Knepley     ierr = DMPlexCreateSubmesh_Uninterpolated(dm, vertexLabel, value, *subdm);CHKERRQ(ierr);
2969e6ccafaeSMatthew G Knepley   }
2970e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
2971e6ccafaeSMatthew G Knepley }
2972e6ccafaeSMatthew G Knepley 
2973e6ccafaeSMatthew G Knepley #undef __FUNCT__
2974766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Uninterpolated"
297527c04023SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Uninterpolated(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM subdm)
2976766ab985SMatthew G. Knepley {
2977766ab985SMatthew G. Knepley   MPI_Comm        comm;
2978766ab985SMatthew G. Knepley   DMLabel         subpointMap;
2979766ab985SMatthew G. Knepley   IS              subvertexIS;
2980766ab985SMatthew G. Knepley   const PetscInt *subVertices;
2981fed694aaSMatthew G. Knepley   PetscInt        numSubVertices, firstSubVertex, numSubCells, *subCells = NULL;
2982766ab985SMatthew G. Knepley   PetscInt       *subface, maxConeSize, numSubFaces, firstSubFace, newFacePoint, nFV;
298387feddfdSMatthew G. Knepley   PetscInt        cMax, c, f;
2984766ab985SMatthew G. Knepley   PetscErrorCode  ierr;
2985766ab985SMatthew G. Knepley 
2986766ab985SMatthew G. Knepley   PetscFunctionBegin;
2987766ab985SMatthew G. Knepley   ierr = PetscObjectGetComm((PetscObject)dm, &comm);CHKERRQ(ierr);
2988766ab985SMatthew G. Knepley   /* Create subpointMap which marks the submesh */
2989766ab985SMatthew G. Knepley   ierr = DMLabelCreate("subpoint_map", &subpointMap);CHKERRQ(ierr);
2990766ab985SMatthew G. Knepley   ierr = DMPlexSetSubpointMap(subdm, subpointMap);CHKERRQ(ierr);
2991766ab985SMatthew G. Knepley   ierr = DMLabelDestroy(&subpointMap);CHKERRQ(ierr);
299227c04023SMatthew G. Knepley   ierr = DMPlexMarkCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, subpointMap, &numSubFaces, &nFV, &subCells, subdm);CHKERRQ(ierr);
2993766ab985SMatthew G. Knepley   /* Setup chart */
2994766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 0, &numSubVertices);CHKERRQ(ierr);
2995766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumSize(subpointMap, 2, &numSubCells);CHKERRQ(ierr);
2996766ab985SMatthew G. Knepley   ierr = DMPlexSetChart(subdm, 0, numSubCells+numSubFaces+numSubVertices);CHKERRQ(ierr);
2997766ab985SMatthew G. Knepley   ierr = DMPlexSetVTKCellHeight(subdm, 1);CHKERRQ(ierr);
2998766ab985SMatthew G. Knepley   /* Set cone sizes */
2999766ab985SMatthew G. Knepley   firstSubVertex = numSubCells;
3000766ab985SMatthew G. Knepley   firstSubFace   = numSubCells+numSubVertices;
3001766ab985SMatthew G. Knepley   newFacePoint   = firstSubFace;
3002766ab985SMatthew G. Knepley   ierr = DMLabelGetStratumIS(subpointMap, 0, &subvertexIS);CHKERRQ(ierr);
3003766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISGetIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3004766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3005766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, c, 1);CHKERRQ(ierr);
3006766ab985SMatthew G. Knepley   }
3007766ab985SMatthew G. Knepley   for (f = firstSubFace; f < firstSubFace+numSubFaces; ++f) {
3008766ab985SMatthew G. Knepley     ierr = DMPlexSetConeSize(subdm, f, nFV);CHKERRQ(ierr);
3009766ab985SMatthew G. Knepley   }
3010766ab985SMatthew G. Knepley   ierr = DMSetUp(subdm);CHKERRQ(ierr);
3011766ab985SMatthew G. Knepley   /* Create face cones */
3012766ab985SMatthew G. Knepley   ierr = DMPlexGetMaxSizes(dm, &maxConeSize, NULL);CHKERRQ(ierr);
301387feddfdSMatthew G. Knepley   ierr = DMPlexGetHybridBounds(dm, &cMax, NULL, NULL, NULL);CHKERRQ(ierr);
3014766ab985SMatthew G. Knepley   ierr = DMGetWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3015766ab985SMatthew G. Knepley   for (c = 0; c < numSubCells; ++c) {
3016766ab985SMatthew G. Knepley     const PetscInt  cell    = subCells[c];
3017766ab985SMatthew G. Knepley     const PetscInt  subcell = c;
301887feddfdSMatthew G. Knepley     const PetscInt *cone, *cells;
301987feddfdSMatthew G. Knepley     PetscInt        numCells, subVertex, p, v;
3020766ab985SMatthew G. Knepley 
302187feddfdSMatthew G. Knepley     if (cell < cMax) continue;
302287feddfdSMatthew G. Knepley     ierr = DMPlexGetCone(dm, cell, &cone);CHKERRQ(ierr);
302387feddfdSMatthew G. Knepley     for (v = 0; v < nFV; ++v) {
302487feddfdSMatthew G. Knepley       ierr = PetscFindInt(cone[v], numSubVertices, subVertices, &subVertex);CHKERRQ(ierr);
302587feddfdSMatthew G. Knepley       subface[v] = firstSubVertex+subVertex;
302687feddfdSMatthew G. Knepley     }
302787feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, newFacePoint, subface);CHKERRQ(ierr);
302887feddfdSMatthew G. Knepley     ierr = DMPlexSetCone(subdm, subcell, &newFacePoint);CHKERRQ(ierr);
302987feddfdSMatthew G. Knepley     ierr = DMPlexGetJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
303027234c99SMatthew G. Knepley     /* Not true in parallel
303127234c99SMatthew G. Knepley     if (numCells != 2) SETERRQ(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Cohesive cells should separate two cells"); */
303287feddfdSMatthew G. Knepley     for (p = 0; p < numCells; ++p) {
303387feddfdSMatthew G. Knepley       PetscInt negsubcell;
3034766ab985SMatthew G. Knepley 
303587feddfdSMatthew G. Knepley       if (cells[p] >= cMax) continue;
303687feddfdSMatthew G. Knepley       /* I know this is a crap search */
303787feddfdSMatthew G. Knepley       for (negsubcell = 0; negsubcell < numSubCells; ++negsubcell) {
303887feddfdSMatthew G. Knepley         if (subCells[negsubcell] == cells[p]) break;
3039766ab985SMatthew G. Knepley       }
304087feddfdSMatthew G. Knepley       if (negsubcell == numSubCells) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Could not find negative face neighbor for cohesive cell %d", cell);
304187feddfdSMatthew G. Knepley       ierr = DMPlexSetCone(subdm, negsubcell, &newFacePoint);CHKERRQ(ierr);
3042766ab985SMatthew G. Knepley     }
304387feddfdSMatthew G. Knepley     ierr = DMPlexRestoreJoin(dm, nFV, cone, &numCells, &cells);CHKERRQ(ierr);
304487feddfdSMatthew G. Knepley     ++newFacePoint;
3045766ab985SMatthew G. Knepley   }
3046766ab985SMatthew G. Knepley   ierr = DMRestoreWorkArray(subdm, maxConeSize, PETSC_INT, (void**) &subface);CHKERRQ(ierr);
3047766ab985SMatthew G. Knepley   ierr = DMPlexSymmetrize(subdm);CHKERRQ(ierr);
3048766ab985SMatthew G. Knepley   ierr = DMPlexStratify(subdm);CHKERRQ(ierr);
3049766ab985SMatthew G. Knepley   /* Build coordinates */
3050766ab985SMatthew G. Knepley   {
3051766ab985SMatthew G. Knepley     PetscSection coordSection, subCoordSection;
3052766ab985SMatthew G. Knepley     Vec          coordinates, subCoordinates;
3053766ab985SMatthew G. Knepley     PetscScalar *coords, *subCoords;
3054285d324eSMatthew G. Knepley     PetscInt     numComp, coordSize, v;
3055766ab985SMatthew G. Knepley 
305669d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(dm, &coordSection);CHKERRQ(ierr);
3057766ab985SMatthew G. Knepley     ierr = DMGetCoordinatesLocal(dm, &coordinates);CHKERRQ(ierr);
305869d8a9ceSMatthew G. Knepley     ierr = DMGetCoordinateSection(subdm, &subCoordSection);CHKERRQ(ierr);
3059285d324eSMatthew G. Knepley     ierr = PetscSectionSetNumFields(subCoordSection, 1);CHKERRQ(ierr);
3060285d324eSMatthew G. Knepley     ierr = PetscSectionGetFieldComponents(coordSection, 0, &numComp);CHKERRQ(ierr);
3061285d324eSMatthew G. Knepley     ierr = PetscSectionSetFieldComponents(subCoordSection, 0, numComp);CHKERRQ(ierr);
3062766ab985SMatthew G. Knepley     ierr = PetscSectionSetChart(subCoordSection, firstSubVertex, firstSubVertex+numSubVertices);CHKERRQ(ierr);
3063766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3064766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3065766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3066766ab985SMatthew G. Knepley       PetscInt       dof;
3067766ab985SMatthew G. Knepley 
3068766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3069766ab985SMatthew G. Knepley       ierr = PetscSectionSetDof(subCoordSection, subvertex, dof);CHKERRQ(ierr);
3070285d324eSMatthew G. Knepley       ierr = PetscSectionSetFieldDof(subCoordSection, subvertex, 0, dof);CHKERRQ(ierr);
3071766ab985SMatthew G. Knepley     }
3072766ab985SMatthew G. Knepley     ierr = PetscSectionSetUp(subCoordSection);CHKERRQ(ierr);
3073766ab985SMatthew G. Knepley     ierr = PetscSectionGetStorageSize(subCoordSection, &coordSize);CHKERRQ(ierr);
3074766ab985SMatthew G. Knepley     ierr = VecCreate(comm, &subCoordinates);CHKERRQ(ierr);
3075766ab985SMatthew G. Knepley     ierr = VecSetSizes(subCoordinates, coordSize, PETSC_DETERMINE);CHKERRQ(ierr);
30762eb5907fSJed Brown     ierr = VecSetType(subCoordinates,VECSTANDARD);CHKERRQ(ierr);
3077766ab985SMatthew G. Knepley     ierr = VecGetArray(coordinates,    &coords);CHKERRQ(ierr);
3078766ab985SMatthew G. Knepley     ierr = VecGetArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3079766ab985SMatthew G. Knepley     for (v = 0; v < numSubVertices; ++v) {
3080766ab985SMatthew G. Knepley       const PetscInt vertex    = subVertices[v];
3081766ab985SMatthew G. Knepley       const PetscInt subvertex = firstSubVertex+v;
3082766ab985SMatthew G. Knepley       PetscInt       dof, off, sdof, soff, d;
3083766ab985SMatthew G. Knepley 
3084766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(coordSection, vertex, &dof);CHKERRQ(ierr);
3085766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(coordSection, vertex, &off);CHKERRQ(ierr);
3086766ab985SMatthew G. Knepley       ierr = PetscSectionGetDof(subCoordSection, subvertex, &sdof);CHKERRQ(ierr);
3087766ab985SMatthew G. Knepley       ierr = PetscSectionGetOffset(subCoordSection, subvertex, &soff);CHKERRQ(ierr);
3088766ab985SMatthew 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);
3089766ab985SMatthew G. Knepley       for (d = 0; d < dof; ++d) subCoords[soff+d] = coords[off+d];
3090766ab985SMatthew G. Knepley     }
3091766ab985SMatthew G. Knepley     ierr = VecRestoreArray(coordinates,    &coords);CHKERRQ(ierr);
3092766ab985SMatthew G. Knepley     ierr = VecRestoreArray(subCoordinates, &subCoords);CHKERRQ(ierr);
3093766ab985SMatthew G. Knepley     ierr = DMSetCoordinatesLocal(subdm, subCoordinates);CHKERRQ(ierr);
3094766ab985SMatthew G. Knepley     ierr = VecDestroy(&subCoordinates);CHKERRQ(ierr);
3095766ab985SMatthew G. Knepley   }
3096aca35d17SMatthew G. Knepley   /* Build SF */
3097aca35d17SMatthew G. Knepley   CHKMEMQ;
3098aca35d17SMatthew G. Knepley   {
3099aca35d17SMatthew G. Knepley     PetscSF            sfPoint, sfPointSub;
3100aca35d17SMatthew G. Knepley     const PetscSFNode *remotePoints;
3101bdcf2095SMatthew G. Knepley     PetscSFNode       *sremotePoints, *newLocalPoints, *newOwners;
3102aca35d17SMatthew G. Knepley     const PetscInt    *localPoints;
3103bdcf2095SMatthew G. Knepley     PetscInt          *slocalPoints;
310449c26ae4SMatthew G. Knepley     PetscInt           numRoots, numLeaves, numSubRoots = numSubCells+numSubFaces+numSubVertices, numSubLeaves = 0, l, sl, ll, pStart, pEnd, p, vStart, vEnd;
3105bdcf2095SMatthew G. Knepley     PetscMPIInt        rank;
3106aca35d17SMatthew G. Knepley 
3107bdcf2095SMatthew G. Knepley     ierr = MPI_Comm_rank(PetscObjectComm((PetscObject) dm), &rank);CHKERRQ(ierr);
3108aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(dm, &sfPoint);CHKERRQ(ierr);
3109aca35d17SMatthew G. Knepley     ierr = DMGetPointSF(subdm, &sfPointSub);CHKERRQ(ierr);
3110aca35d17SMatthew G. Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3111aca35d17SMatthew G. Knepley     ierr = DMPlexGetDepthStratum(dm, 0, &vStart, &vEnd);CHKERRQ(ierr);
3112aca35d17SMatthew G. Knepley     ierr = PetscSFGetGraph(sfPoint, &numRoots, &numLeaves, &localPoints, &remotePoints);CHKERRQ(ierr);
3113aca35d17SMatthew G. Knepley     if (numRoots >= 0) {
3114aca35d17SMatthew G. Knepley       /* Only vertices should be shared */
3115dcca6d9dSJed Brown       ierr = PetscMalloc2(pEnd-pStart,&newLocalPoints,numRoots,&newOwners);CHKERRQ(ierr);
3116bdcf2095SMatthew G. Knepley       for (p = 0; p < pEnd-pStart; ++p) {
3117bdcf2095SMatthew G. Knepley         newLocalPoints[p].rank  = -2;
3118bdcf2095SMatthew G. Knepley         newLocalPoints[p].index = -2;
3119bdcf2095SMatthew G. Knepley       }
31209e0823b2SMatthew G. Knepley       /* Set subleaves */
3121aca35d17SMatthew G. Knepley       for (l = 0; l < numLeaves; ++l) {
3122aca35d17SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3123bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3124aca35d17SMatthew G. Knepley 
3125aca35d17SMatthew G. Knepley         if ((point < vStart) && (point >= vEnd)) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Should not be mapping anything but vertices, %d", point);
3126bdcf2095SMatthew G. Knepley         if (subPoint < 0) continue;
3127bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].rank  = rank;
3128bdcf2095SMatthew G. Knepley         newLocalPoints[point-pStart].index = subPoint;
3129bdcf2095SMatthew G. Knepley         ++numSubLeaves;
3130aca35d17SMatthew G. Knepley       }
31319e0823b2SMatthew G. Knepley       /* Must put in owned subpoints */
31329e0823b2SMatthew G. Knepley       for (p = pStart; p < pEnd; ++p) {
31339e0823b2SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(p, firstSubVertex, numSubVertices, subVertices);
31349e0823b2SMatthew G. Knepley 
31359e0823b2SMatthew G. Knepley         if (subPoint < 0) {
31369e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = -3;
31379e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = -3;
31389e0823b2SMatthew G. Knepley         } else {
31399e0823b2SMatthew G. Knepley           newOwners[p-pStart].rank  = rank;
31409e0823b2SMatthew G. Knepley           newOwners[p-pStart].index = subPoint;
31419e0823b2SMatthew G. Knepley         }
3142bdcf2095SMatthew G. Knepley       }
3143bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceBegin(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3144bdcf2095SMatthew G. Knepley       ierr = PetscSFReduceEnd(sfPoint, MPIU_2INT, newLocalPoints, newOwners, MPI_MAXLOC);CHKERRQ(ierr);
3145bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastBegin(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3146bdcf2095SMatthew G. Knepley       ierr = PetscSFBcastEnd(sfPoint, MPIU_2INT, newOwners, newLocalPoints);CHKERRQ(ierr);
3147785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves,    &slocalPoints);CHKERRQ(ierr);
3148785e854fSJed Brown       ierr = PetscMalloc1(numSubLeaves, &sremotePoints);CHKERRQ(ierr);
314949c26ae4SMatthew G. Knepley       for (l = 0, sl = 0, ll = 0; l < numLeaves; ++l) {
3150bdcf2095SMatthew G. Knepley         const PetscInt point    = localPoints[l];
3151bdcf2095SMatthew G. Knepley         const PetscInt subPoint = DMPlexFilterPoint_Internal(point, firstSubVertex, numSubVertices, subVertices);
3152aca35d17SMatthew G. Knepley 
3153aca35d17SMatthew G. Knepley         if (subPoint < 0) continue;
315449c26ae4SMatthew G. Knepley         if (newLocalPoints[point].rank == rank) {++ll; continue;}
3155aca35d17SMatthew G. Knepley         slocalPoints[sl]        = subPoint;
3156bdcf2095SMatthew G. Knepley         sremotePoints[sl].rank  = newLocalPoints[point].rank;
3157bdcf2095SMatthew G. Knepley         sremotePoints[sl].index = newLocalPoints[point].index;
3158bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].rank  < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote rank for local point %d", point);
3159bdcf2095SMatthew G. Knepley         if (sremotePoints[sl].index < 0) SETERRQ1(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid remote subpoint for local point %d", point);
3160aca35d17SMatthew G. Knepley         ++sl;
3161aca35d17SMatthew G. Knepley       }
3162bdcf2095SMatthew G. Knepley       ierr = PetscFree2(newLocalPoints,newOwners);CHKERRQ(ierr);
316349c26ae4SMatthew G. Knepley       if (sl + ll != numSubLeaves) SETERRQ3(PETSC_COMM_SELF, PETSC_ERR_PLIB, "Mismatch in number of subleaves %d + %d != %d", sl, ll, numSubLeaves);
316449c26ae4SMatthew G. Knepley       ierr = PetscSFSetGraph(sfPointSub, numSubRoots, sl, slocalPoints, PETSC_OWN_POINTER, sremotePoints, PETSC_OWN_POINTER);CHKERRQ(ierr);
3165aca35d17SMatthew G. Knepley     }
3166aca35d17SMatthew G. Knepley   }
3167aca35d17SMatthew G. Knepley   CHKMEMQ;
3168766ab985SMatthew G. Knepley   /* Cleanup */
3169766ab985SMatthew G. Knepley   if (subvertexIS) {ierr = ISRestoreIndices(subvertexIS, &subVertices);CHKERRQ(ierr);}
3170766ab985SMatthew G. Knepley   ierr = ISDestroy(&subvertexIS);CHKERRQ(ierr);
3171766ab985SMatthew G. Knepley   ierr = PetscFree(subCells);CHKERRQ(ierr);
3172766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3173766ab985SMatthew G. Knepley }
3174766ab985SMatthew G. Knepley 
3175766ab985SMatthew G. Knepley #undef __FUNCT__
3176766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh_Interpolated"
31773982b651SMatthew G. Knepley static PetscErrorCode DMPlexCreateCohesiveSubmesh_Interpolated(DM dm, const char labelname[], PetscInt value, DM subdm)
3178766ab985SMatthew G. Knepley {
31793982b651SMatthew G. Knepley   DMLabel        label = NULL;
3180766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3181766ab985SMatthew G. Knepley 
3182766ab985SMatthew G. Knepley   PetscFunctionBegin;
31833982b651SMatthew G. Knepley   if (labelname) {ierr = DMPlexGetLabel(dm, labelname, &label);CHKERRQ(ierr);}
31843982b651SMatthew G. Knepley   ierr = DMPlexCreateSubmeshGeneric_Interpolated(dm, label, value, PETSC_TRUE, subdm);CHKERRQ(ierr);
3185766ab985SMatthew G. Knepley   PetscFunctionReturn(0);
3186766ab985SMatthew G. Knepley }
3187766ab985SMatthew G. Knepley 
3188766ab985SMatthew G. Knepley #undef __FUNCT__
3189766ab985SMatthew G. Knepley #define __FUNCT__ "DMPlexCreateCohesiveSubmesh"
3190766ab985SMatthew G. Knepley /*
319127c04023SMatthew 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.
3192766ab985SMatthew G. Knepley 
3193766ab985SMatthew G. Knepley   Input Parameters:
3194766ab985SMatthew G. Knepley + dm          - The original mesh
319527c04023SMatthew G. Knepley . hasLagrange - The mesh has Lagrange unknowns in the cohesive cells
31967afc1a8bSJed Brown . label       - A label name, or NULL
319727c04023SMatthew G. Knepley - value  - A label value
3198766ab985SMatthew G. Knepley 
3199766ab985SMatthew G. Knepley   Output Parameter:
3200766ab985SMatthew G. Knepley . subdm - The surface mesh
3201766ab985SMatthew G. Knepley 
3202766ab985SMatthew G. Knepley   Note: This function produces a DMLabel mapping original points in the submesh to their depth. This can be obtained using DMPlexGetSubpointMap().
3203766ab985SMatthew G. Knepley 
3204766ab985SMatthew G. Knepley   Level: developer
3205766ab985SMatthew G. Knepley 
3206766ab985SMatthew G. Knepley .seealso: DMPlexGetSubpointMap(), DMPlexCreateSubmesh()
3207766ab985SMatthew G. Knepley */
320827c04023SMatthew G. Knepley PetscErrorCode DMPlexCreateCohesiveSubmesh(DM dm, PetscBool hasLagrange, const char label[], PetscInt value, DM *subdm)
3209766ab985SMatthew G. Knepley {
3210766ab985SMatthew G. Knepley   PetscInt       dim, depth;
3211766ab985SMatthew G. Knepley   PetscErrorCode ierr;
3212766ab985SMatthew G. Knepley 
3213766ab985SMatthew G. Knepley   PetscFunctionBegin;
3214766ab985SMatthew G. Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
321527c04023SMatthew G. Knepley   PetscValidPointer(subdm, 5);
3216c73cfb54SMatthew G. Knepley   ierr = DMGetDimension(dm, &dim);CHKERRQ(ierr);
3217766ab985SMatthew G. Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3218766ab985SMatthew G. Knepley   ierr = DMCreate(PetscObjectComm((PetscObject)dm), subdm);CHKERRQ(ierr);
3219766ab985SMatthew G. Knepley   ierr = DMSetType(*subdm, DMPLEX);CHKERRQ(ierr);
3220c73cfb54SMatthew G. Knepley   ierr = DMSetDimension(*subdm, dim-1);CHKERRQ(ierr);
3221766ab985SMatthew G. Knepley   if (depth == dim) {
3222b3154360SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Interpolated(dm, label, value, *subdm);CHKERRQ(ierr);
3223766ab985SMatthew G. Knepley   } else {
322427c04023SMatthew G. Knepley     ierr = DMPlexCreateCohesiveSubmesh_Uninterpolated(dm, hasLagrange, label, value, *subdm);CHKERRQ(ierr);
3225e6ccafaeSMatthew G Knepley   }
3226e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3227e6ccafaeSMatthew G Knepley }
3228e6ccafaeSMatthew G Knepley 
3229e6ccafaeSMatthew G Knepley #undef __FUNCT__
3230e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexGetSubpointMap"
323164beef6dSMatthew G. Knepley /*@
323264beef6dSMatthew G. Knepley   DMPlexGetSubpointMap - Returns a DMLabel with point dimension as values
323364beef6dSMatthew G. Knepley 
323464beef6dSMatthew G. Knepley   Input Parameter:
323564beef6dSMatthew G. Knepley . dm - The submesh DM
323664beef6dSMatthew G. Knepley 
323764beef6dSMatthew G. Knepley   Output Parameter:
323864beef6dSMatthew G. Knepley . subpointMap - The DMLabel of all the points from the original mesh in this submesh, or NULL if this is not a submesh
323964beef6dSMatthew G. Knepley 
324064beef6dSMatthew G. Knepley   Level: developer
324164beef6dSMatthew G. Knepley 
324264beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexCreateSubpointIS()
324364beef6dSMatthew G. Knepley @*/
3244e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexGetSubpointMap(DM dm, DMLabel *subpointMap)
3245e6ccafaeSMatthew G Knepley {
3246e6ccafaeSMatthew G Knepley   DM_Plex *mesh = (DM_Plex*) dm->data;
3247e6ccafaeSMatthew G Knepley 
3248e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3249e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3250e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointMap, 2);
3251e6ccafaeSMatthew G Knepley   *subpointMap = mesh->subpointMap;
3252e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3253e6ccafaeSMatthew G Knepley }
3254e6ccafaeSMatthew G Knepley 
3255e6ccafaeSMatthew G Knepley #undef __FUNCT__
3256e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexSetSubpointMap"
3257e6ccafaeSMatthew G Knepley /* Note: Should normally not be called by the user, since it is set in DMPlexCreateSubmesh() */
3258e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexSetSubpointMap(DM dm, DMLabel subpointMap)
3259e6ccafaeSMatthew G Knepley {
3260e6ccafaeSMatthew G Knepley   DM_Plex       *mesh = (DM_Plex *) dm->data;
3261285d324eSMatthew G. Knepley   DMLabel        tmp;
3262e6ccafaeSMatthew G Knepley   PetscErrorCode ierr;
3263e6ccafaeSMatthew G Knepley 
3264e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3265e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3266285d324eSMatthew G. Knepley   tmp  = mesh->subpointMap;
3267e6ccafaeSMatthew G Knepley   mesh->subpointMap = subpointMap;
3268285d324eSMatthew G. Knepley   ++mesh->subpointMap->refct;
3269285d324eSMatthew G. Knepley   ierr = DMLabelDestroy(&tmp);CHKERRQ(ierr);
3270e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3271e6ccafaeSMatthew G Knepley }
3272e6ccafaeSMatthew G Knepley 
3273e6ccafaeSMatthew G Knepley #undef __FUNCT__
3274e6ccafaeSMatthew G Knepley #define __FUNCT__ "DMPlexCreateSubpointIS"
327564beef6dSMatthew G. Knepley /*@
3276e6ccafaeSMatthew G Knepley   DMPlexCreateSubpointIS - Creates an IS covering the entire subdm chart with the original points as data
3277e6ccafaeSMatthew G Knepley 
3278e6ccafaeSMatthew G Knepley   Input Parameter:
3279e6ccafaeSMatthew G Knepley . dm - The submesh DM
3280e6ccafaeSMatthew G Knepley 
3281e6ccafaeSMatthew G Knepley   Output Parameter:
32820298fd71SBarry Smith . subpointIS - The IS of all the points from the original mesh in this submesh, or NULL if this is not a submesh
3283e6ccafaeSMatthew G Knepley 
32843982b651SMatthew G. Knepley   Note: This IS is guaranteed to be sorted by the construction of the submesh
328564beef6dSMatthew G. Knepley 
328664beef6dSMatthew G. Knepley   Level: developer
328764beef6dSMatthew G. Knepley 
328864beef6dSMatthew G. Knepley .seealso: DMPlexCreateSubmesh(), DMPlexGetSubpointMap()
328964beef6dSMatthew G. Knepley @*/
3290e6ccafaeSMatthew G Knepley PetscErrorCode DMPlexCreateSubpointIS(DM dm, IS *subpointIS)
3291e6ccafaeSMatthew G Knepley {
329282f516ccSBarry Smith   MPI_Comm        comm;
3293e6ccafaeSMatthew G Knepley   DMLabel         subpointMap;
3294e6ccafaeSMatthew G Knepley   IS              is;
3295e6ccafaeSMatthew G Knepley   const PetscInt *opoints;
3296e6ccafaeSMatthew G Knepley   PetscInt       *points, *depths;
3297e6ccafaeSMatthew G Knepley   PetscInt        depth, depStart, depEnd, d, pStart, pEnd, p, n, off;
3298e6ccafaeSMatthew G Knepley   PetscErrorCode  ierr;
3299e6ccafaeSMatthew G Knepley 
3300e6ccafaeSMatthew G Knepley   PetscFunctionBegin;
3301e6ccafaeSMatthew G Knepley   PetscValidHeaderSpecific(dm, DM_CLASSID, 1);
3302e6ccafaeSMatthew G Knepley   PetscValidPointer(subpointIS, 2);
330382f516ccSBarry Smith   ierr = PetscObjectGetComm((PetscObject)dm,&comm);CHKERRQ(ierr);
33040298fd71SBarry Smith   *subpointIS = NULL;
3305e6ccafaeSMatthew G Knepley   ierr = DMPlexGetSubpointMap(dm, &subpointMap);CHKERRQ(ierr);
3306e6ccafaeSMatthew G Knepley   ierr = DMPlexGetDepth(dm, &depth);CHKERRQ(ierr);
3307fed694aaSMatthew G. Knepley   if (subpointMap && depth >= 0) {
3308e6ccafaeSMatthew G Knepley     ierr = DMPlexGetChart(dm, &pStart, &pEnd);CHKERRQ(ierr);
3309e6ccafaeSMatthew G Knepley     if (pStart) SETERRQ1(comm, PETSC_ERR_ARG_WRONG, "Submeshes must start the point numbering at 0, not %d", pStart);
3310e6ccafaeSMatthew G Knepley     ierr = DMGetWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3311e6ccafaeSMatthew G Knepley     depths[0] = depth;
3312e6ccafaeSMatthew G Knepley     depths[1] = 0;
3313e6ccafaeSMatthew G Knepley     for(d = 2; d <= depth; ++d) {depths[d] = depth+1 - d;}
3314785e854fSJed Brown     ierr = PetscMalloc1(pEnd, &points);CHKERRQ(ierr);
3315e6ccafaeSMatthew G Knepley     for(d = 0, off = 0; d <= depth; ++d) {
3316e6ccafaeSMatthew G Knepley       const PetscInt dep = depths[d];
3317e6ccafaeSMatthew G Knepley 
3318e6ccafaeSMatthew G Knepley       ierr = DMPlexGetDepthStratum(dm, dep, &depStart, &depEnd);CHKERRQ(ierr);
3319e6ccafaeSMatthew G Knepley       ierr = DMLabelGetStratumSize(subpointMap, dep, &n);CHKERRQ(ierr);
33201e21b6fdSMatthew G Knepley       if (((d < 2) && (depth > 1)) || (d == 1)) { /* Only check vertices and cells for now since the map is broken for others */
3321e6ccafaeSMatthew 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);
3322e6ccafaeSMatthew G Knepley       } else {
33231e21b6fdSMatthew G Knepley         if (!n) {
33241e21b6fdSMatthew G Knepley           if (d == 0) {
33251e21b6fdSMatthew G Knepley             /* Missing cells */
33261e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = -1;
33271e21b6fdSMatthew G Knepley           } else {
33281e21b6fdSMatthew G Knepley             /* Missing faces */
33291e21b6fdSMatthew G Knepley             for(p = 0; p < depEnd-depStart; ++p, ++off) points[off] = PETSC_MAX_INT;
33301e21b6fdSMatthew G Knepley           }
33311e21b6fdSMatthew G Knepley         }
3332e6ccafaeSMatthew G Knepley       }
3333e6ccafaeSMatthew G Knepley       if (n) {
3334e6ccafaeSMatthew G Knepley         ierr = DMLabelGetStratumIS(subpointMap, dep, &is);CHKERRQ(ierr);
3335e6ccafaeSMatthew G Knepley         ierr = ISGetIndices(is, &opoints);CHKERRQ(ierr);
3336e6ccafaeSMatthew G Knepley         for(p = 0; p < n; ++p, ++off) points[off] = opoints[p];
3337e6ccafaeSMatthew G Knepley         ierr = ISRestoreIndices(is, &opoints);CHKERRQ(ierr);
3338e6ccafaeSMatthew G Knepley         ierr = ISDestroy(&is);CHKERRQ(ierr);
3339e6ccafaeSMatthew G Knepley       }
3340e6ccafaeSMatthew G Knepley     }
3341e6ccafaeSMatthew G Knepley     ierr = DMRestoreWorkArray(dm, depth+1, PETSC_INT, &depths);CHKERRQ(ierr);
3342e6ccafaeSMatthew G Knepley     if (off != pEnd) SETERRQ2(comm, PETSC_ERR_ARG_WRONG, "The number of mapped submesh points %d should be %d", off, pEnd);
3343fed694aaSMatthew G. Knepley     ierr = ISCreateGeneral(PETSC_COMM_SELF, pEnd, points, PETSC_OWN_POINTER, subpointIS);CHKERRQ(ierr);
3344e6ccafaeSMatthew G Knepley   }
3345e6ccafaeSMatthew G Knepley   PetscFunctionReturn(0);
3346e6ccafaeSMatthew G Knepley }
3347